Linux and UNIX Man Pages

Linux & Unix Commands - Search Man Pages

puffs_node(3) [netbsd man page]

PUFFS_NODE(3)						   BSD Library Functions Manual 					     PUFFS_NODE(3)

NAME
puffs_node -- puffs node routines LIBRARY
puffs Convenience Library (libpuffs, -lpuffs) SYNOPSIS
#include <puffs.h> struct puffs_node * puffs_pn_new(struct puffs_usermount *pu, void *priv); void * puffs_nodewalk_fn(struct puffs_usermount *pu, struct puffs_node *pn, void *arg); void * puffs_pn_nodewalk(struct puffs_usermount *pu, puffs_nodewalk_fn nwfn, void *arg); void puffs_pn_remove(struct puffs_node *pn); void puffs_pn_put(struct puffs_node *pn); DESCRIPTION
puffs_pn_new(pu, priv) Create a new node and attach it to the mountpoint pu. The argument priv can be used for associating file system specific data with the new node and will not be accessed by puffs. puffs_nodewalk_fn(pu, pn, arg) A callback for puffs_nodewalk(). The list of nodes is iterated in the argument pn and the argument arg is the argument given to puffs_nodewalk(). puffs_nodewalk(pu, nwfn, arg) Walk all nodes associted with the mountpoint pu and call nwfn() for them. The walk is aborted if puffs_nodewalk_fn() returns a value which is not NULL. This value is also returned this function. In case the whole set of nodes is traversed, NULL is returned. This function is useful for example in handling the puffs_fs_sync() callback, when cached data for every node should be flushed to stable storage. puffs_pn_remove(pn) Signal that a node has been removed from the file system, but do not yet release resources associated with the node. This will prevent the nodewalk functions from accessing the node. If necessary, this is usually called from puffs_node_remove() and puffs_node_rmdir(). puffs_pn_put(pn) Free all resources associated with node pn. This is typically called from puffs_node_reclaim(). SEE ALSO
puffs(3) BSD
June 24, 2007 BSD

Check Out this Related Man Page

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 9074 2010-05-31 19:01:32Z iulius $ INN 2.5.3 2011-06-10 list(3)
Man Page