Searched refs:n_next (Results 1 - 9 of 9) sorted by relevance

/macosx-10.9.5/misc_cmds-32/tsort/
H A Dtsort.c89 NODE **n_prevp; /* pointer to previous node's n_next */
90 NODE *n_next; /* next node in graph */ member in struct:node_str
282 if ((n->n_next = graph) != NULL)
283 graph->n_prevp = &n->n_next;
304 for (n = graph; n != NULL; n = n->n_next)
323 next = n->n_next;
340 for (cnt = 0, n = graph; n != NULL; n = n->n_next)
347 for (n = graph; n != NULL; n = n->n_next) {
383 *n->n_prevp = n->n_next;
384 if (n->n_next)
[all...]
/macosx-10.9.5/cxxfilt-11/cxxfilt/include/
H A Dbout.h111 struct nlist * n_next; member in union:nlist::__anon7608
/macosx-10.9.5/NFS-81/rpc.statd/
H A Dstatd.h88 struct Notify_s *n_next; member in struct:Notify_s
H A Dprocs.c211 np->n_next = mhp->mh_notify_list;
242 next = np->n_next;
244 last->n_next = next;
252 np = np->n_next;
499 for (; np; np = np->n_next) {
/macosx-10.9.5/bc-21/bc/h/
H A Dnumber.h45 bc_num n_next; /* Linked list for available list. */ member in struct:bc_struct
/macosx-10.9.5/remote_cmds-41.90.1/rwhod.tproj/
H A Drwhod.c143 struct neighbor *n_next; member in struct:neighbor
504 else for (np = neighbors; np != NULL; np = np->n_next) {
675 for (np = neighbors; np != NULL; np = np->n_next)
716 np->n_next = neighbors;
/macosx-10.9.5/bc-21/bc/lib/
H A Dnumber.c64 _bc_Free_list = temp->n_next;
92 (*num)->n_next = _bc_Free_list;
642 _bc_Free_list = temp->n_next;
/macosx-10.9.5/libxml2-26/libxml2/
H A Dtestapi.c26163 int n_next; local
26170 for (n_next = 0;n_next < gen_nb_xmlNodePtr;n_next++) {
26175 next = gen_xmlNodePtr(n_next, 1);
26183 des_xmlNodePtr(n_next, next, 1);
26192 printf(" %d", n_next);
[all...]
/macosx-10.9.5/pyobjc-42/pyobjc/pyobjc-core/libxml2-src/
H A Dtestapi.c25988 int n_next; local
25995 for (n_next = 0;n_next < gen_nb_xmlNodePtr;n_next++) {
26000 next = gen_xmlNodePtr(n_next, 1);
26008 des_xmlNodePtr(n_next, next, 1);
26017 printf(" %d", n_next);
[all...]

Completed in 485 milliseconds