Home
last modified time | relevance | path

Searched refs:n_next (Results 1 – 7 of 7) sorted by relevance

/freebsd/usr.bin/tsort/
H A Dtsort.c74 NODE *n_next; /* next node in graph */ member
261 if ((n->n_next = graph) != NULL) in get_node()
262 graph->n_prevp = &n->n_next; in get_node()
283 for (n = graph; n != NULL; n = n->n_next) in clear_cycle()
302 next = n->n_next; in tsort()
319 for (cnt = 0, n = graph; n != NULL; n = n->n_next) in tsort()
326 for (n = graph; n != NULL; n = n->n_next) in tsort()
361 *n->n_prevp = n->n_next; in remove_node()
362 if (n->n_next) in remove_node()
363 n->n_next->n_prevp = n->n_prevp; in remove_node()
/freebsd/usr.sbin/autofs/
H A Dcommon.c202 TAILQ_INSERT_TAIL(&parent->n_children, n, n_next); in node_new()
233 TAILQ_INSERT_TAIL(&parent->n_children, n, n_next); in node_new_map()
250 TAILQ_FOREACH(child, &o->n_children, n_next) in node_duplicate()
263 TAILQ_FOREACH_SAFE(child, &n->n_children, n_next, tmp) in node_delete()
267 TAILQ_REMOVE(&n->n_parent->n_children, n, n_next); in node_delete()
280 TAILQ_REMOVE(&n->n_parent->n_children, n, n_next); in node_move_after()
282 TAILQ_INSERT_AFTER(&previous->n_parent->n_children, previous, n, n_next); in node_move_after()
291 TAILQ_FOREACH_SAFE(n, &root->n_children, n_next, tmp) { in node_expand_includes()
325 &tmproot->n_children, nodehead, n_next, tmp2) { in node_expand_includes()
413 TAILQ_FOREACH(child, &n->n_children, n_next) in node_expand_ampersand()
[all …]
H A Dautomount.c216 TAILQ_FOREACH(n, &root->n_children, n_next) { in mount_unmount()
223 TAILQ_FOREACH(n2, &n->n_children, n_next) { in mount_unmount()
H A Dautomountd.c141 TAILQ_FOREACH(child, &node->n_children, n_next) { in create_subtree()
159 TAILQ_FOREACH(child, &node->n_children, n_next) in create_subtree()
H A Dcommon.h43 TAILQ_ENTRY(node) n_next;
/freebsd/sys/dev/xen/console/
H A Dxen_console.c138 size_t n_next; member
162 pca->buf[pca->n_next++] = c; in putchar()
163 if ((pca->size == pca->n_next) || (c = '\0')) { in putchar()
165 xen_emergency_print(pca->buf, pca->n_next); in putchar()
166 pca->n_next = 0; in putchar()
181 pca.n_next = 0; in xc_printf()
192 if (pca.n_next != 0) in xc_printf()
193 xen_emergency_print(buf, pca.n_next); in xc_printf()
/freebsd/usr.sbin/rwhod/
H A Drwhod.c101 struct neighbor *n_next; member
493 for (np = neighbors; np != NULL; np = np->n_next) { in sender_process()
657 for (np = neighbors; np != NULL; np = np->n_next) { in configure()
700 np->n_next = neighbors; in configure()