| /src/sys/arch/x86/x86/ |
| nmi.c | 56 struct nmi_handler *n_next; member in struct:nmi_handler
84 n->n_next = nmi_handlers;
115 pp = &n->n_next;
123 atomic_store_relaxed(pp, n->n_next);
158 n = atomic_load_relaxed(&n->n_next)) {
|
| /src/usr.bin/tsort/ |
| tsort.c | 88 NODE **n_prevp; /* pointer to previous node's n_next */
89 NODE *n_next; /* next node in graph */ member in struct:node_str
272 if ((n->n_next = graph) != NULL)
273 graph->n_prevp = &n->n_next;
294 for (n = graph; n != NULL; n = n->n_next)
313 next = n->n_next;
330 for (cnt = 0, n = graph; n != NULL; n = n->n_next)
335 for (n = graph; n != NULL; n = n->n_next) {
370 *n->n_prevp = n->n_next;
371 if (n->n_next)
[all...] |
| /src/usr.bin/rdist/ |
| gram.y | 121 last_n->n_next = makenl($2);
122 last_n = last_n->n_next;
149 if (nl->n_next != NULL)
378 for (h = hosts; h != NULL; nexth = h->n_next, free(h), h = nexth) {
481 nl->n_next = NULL;
490 freenl(nl->n_next);
|
| lookup.c | 106 nl->n_next = makenl(cp);
107 nl = nl->n_next;
|
| docmd.c | 100 for (f = c->c_files; f != NULL; f = f->n_next)
149 ddir = files->n_next != NULL; /* destination is a directory */
163 for (f = files; f != NULL; f = f->n_next) {
411 for (f = files; f != NULL; f = f->n_next) {
580 to = to->n_next;
586 to = to->n_next;
611 for (nl = list; nl != NULL; nl = nl->n_next)
634 for (nl = sc->sc_args; nl != NULL; nl = nl->n_next) {
|
| main.c | 272 prev->n_next = nl;
315 nl = nl->n_next;
|
| defs.h | 105 struct namelist *n_next; member in struct:namelist
|
| expand.c | 106 for (nl = list; nl != NULL; nl = nl->n_next)
124 for (nl = list; nl != NULL; nl = nl->n_next)
136 prev->n_next = nl;
190 for (; tp != NULL; tp = tp->n_next) {
|
| /src/usr.sbin/autofs/ |
| common.c | 197 TAILQ_INSERT_TAIL(&parent->n_children, n, n_next);
228 TAILQ_INSERT_TAIL(&parent->n_children, n, n_next);
245 TAILQ_FOREACH(child, &o->n_children, n_next)
258 TAILQ_FOREACH_SAFE(child, &n->n_children, n_next, tmp)
262 TAILQ_REMOVE(&n->n_parent->n_children, n, n_next);
275 TAILQ_REMOVE(&n->n_parent->n_children, n, n_next);
277 TAILQ_INSERT_AFTER(&previous->n_parent->n_children, previous, n, n_next);
286 TAILQ_FOREACH_SAFE(n, &root->n_children, n_next, tmp) {
320 &tmproot->n_children, nodehead, n_next, tmp2) {
409 TAILQ_FOREACH(child, &n->n_children, n_next)
[all...] |
| common.h | 53 TAILQ_ENTRY(node) n_next; member in struct:node
|
| automount.c | 177 TAILQ_FOREACH(n, &root->n_children, n_next) {
184 TAILQ_FOREACH(n2, &n->n_children, n_next) {
|
| automountd.c | 137 TAILQ_FOREACH(child, &node->n_children, n_next) {
155 TAILQ_FOREACH(child, &node->n_children, n_next)
|
| /src/usr.sbin/netgroup_mkdb/ |
| netgroup_mkdb.c | 66 struct nentry *n_next; member in struct:nentry
259 e->n_next = NULL;
264 tail->n_next = e;
279 e->n_next = NULL;
281 tail->n_next = e;
367 for (e = fe->n_next; e != NULL; e = e->n_next)
463 if (e->n_next == NULL) {
470 for (e = e->n_next; e != NULL; e = e->n_next) {
[all...] |
| /src/usr.sbin/rwhod/ |
| rwhod.c | 91 struct neighbor *n_next; member in struct:neighbor
415 for (np = neighbors; np != NULL; np = np->n_next)
523 for (np = neighbors; np != NULL; np = np->n_next)
539 np->n_next = neighbors;
|
