Sponsored Content
Full Discussion: i-node problem
Top Forums Programming i-node problem Post 32178 by chenhao_no1 on Wednesday 20th of November 2002 06:49:28 AM
Old 11-20-2002
i-node problem

First , thank you for reading the post.

I Use Digital Unix 4.0F .

I get an i-node number of a text file using stat() function . I want to read the file context following the i-node information . But I do not know how to read disk information accroding to i-node information .
 

9 More Discussions You Might Find Interesting

1. UNIX for Advanced & Expert Users

problem connecting to oracle 10g after NCR node reboot

Hi All, I am facing a connection problem with Oracle 10g on Solaris 10 when my application (started by /etc/rc3.d at node reboot) tries to establish a session after reboot of the node where my application is running (NCR UNIX (MP RAS)). I find that my application (run as a deamon process)... (1 Reply)
Discussion started by: sowjanya
1 Replies

2. Shell Programming and Scripting

i-node address

how would i show all i-node addresses of all files in my directory (1 Reply)
Discussion started by: trob
1 Replies

3. Linux

Node size

Hi, Does the output of the command numactl --hardware available: 1 nodes (0-0) node 0 cpus: 0 1 node 0 size: 8155 MB node 0 free: 3231 MB No distance information available. where, node 0 size: 8155MB mean that the local memory associated with node 0 is 8155MB? Can anyone guide me... (0 Replies)
Discussion started by: heartbreakkid
0 Replies

4. SuSE

Node size

Hi, Does the output of the command numactl --hardware available: 1 nodes (0-0) node 0 cpus: 0 1 node 0 size: 8155 MB node 0 free: 3231 MB No distance information available. where, node 0 size: 8155MB mean that the local memory associated with node 0 is 8155MB? Can anyone guide me... (1 Reply)
Discussion started by: heartbreakkid
1 Replies

5. Solaris

SVM metaset on 2 node Solaris cluster storage replicated to non-clustered Solaris node

Hi, Is it possible to have a Solaris cluster of 2 nodes at SITE-A using SVM and creating metaset using say 2 LUNs (on SAN). Then replicating these 2 LUNs to remote site SITE-B via storage based replication and then using these LUNs by importing them as a metaset on a server at SITE-B which is... (0 Replies)
Discussion started by: dn2011
0 Replies

6. Red Hat

Problem in RedHat Cluster Node while network Failure or in Hang mode

Hi, We are having many RedHat linux Server with Cluster facility for availability of service like HTTPD / MySQL. We face some issue while some issue related to power disturbance / fluctuation or Network failure. There is two Cluster Node configured in... (0 Replies)
Discussion started by: hirenkmistry
0 Replies

7. Homework & Coursework Questions

Accessing one UNIX node from another node of the same server

Hi Experts, I am in need of running a script from one node say node 1 via node 2. My scheduling tool dont have access to node2 , so i need to invoke the list file from node1 but the script needs to run from node2. because the server to which i am hitting, is having access only for the node... (5 Replies)
Discussion started by: arun1377
5 Replies

8. HP-UX

Mount FIle systems from node-1 onto node-2

Hi, We have HP UX service guard cluster on OS 11.23. Recently 40+ LUNs presented to both nodes by SAN team but I was asked to mount them on only one node. I created required VGs/LVs, created VxFS and mounted all of them and they are working fine. Now client requested those FS on 2nd node as... (4 Replies)
Discussion started by: prvnrk
4 Replies

9. UNIX for Beginners Questions & Answers

NTP synchronised problem in our Centos 7.6 node

Someone, please help on this issue:- Note : for security reason i didn't mention hostnames and ips. ============================================================================== # ntpstat unsynchronised polling server every 1024 s Ntpstat showing unsynchronised. ... (29 Replies)
Discussion started by: shanmugaraj
29 Replies
list(3) 						    InterNetNews Documentation							   list(3)

NAME
list - list routines SYNOPSIS
#include <inn/list.h> struct node { struct node *succ; struct node *pred; }; struct list { struct node *head; struct node *tail; struct node *tailpred; }; void list_new(struct list *list); struct node *list_addhead(struct list *list, struct node *node); struct node *list_addtail(struct list *list, struct node *node); struct node *list_head(struct list *list); struct node *list_tail(struct list *list); struct node *list_succ(struct node *node); struct node *list_pred(struct node *node); struct node *list_remhead(struct list *list); struct node *list_remtail(struct list *list); struct node *list_remove(struct node *node); struct node *list_insert(struct list *list, struct node *node, struct node *pred); bool list_isempty(struct list *list); DESCRIPTION
list_new initialises the list header list so as to create an empty list. list_addhead adds node to the head of list, returning the node just added. list_addtail adds node to the tail of list, returning the node just added. list_head returns a pointer to the the node at the head of list or NULL if the list is empty. list_tail returns a pointer to the the node at the tail of list or NULL if the list is empty. list_succ returns the next (successor) node on the list after node or NULL if node was the final node. list_pred returns the previous (predecessor) node on the list before node or NULL if node was the first node. list_remhead removes the first node from list and returns it to the caller. If the list is empty NULL is returned. list_remtail removes the last node from list and returns it to the caller. If the list is empty NULL is returned. list_remove removes node from the list it is on and returns it to the caller. list_insert inserts node onto list after the node pred. If pred is NULL then node is added to the head of list. HISTORY
Written by Alex Kiernan <alex.kiernan@thus.net> for InterNetNews 2.4.0. $Id: list.pod 7851 2008-05-26 19:33:08Z iulius $ INN 2.5.2 2009-05-21 list(3)
All times are GMT -4. The time now is 03:07 AM.
Unix & Linux Forums Content Copyright 1993-2022. All Rights Reserved.
Privacy Policy