HomeSort by: relevance | last modified time | path
    Searched defs:n_next (Results 1 - 5 of 5) sorted by relevancy

  /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/rdist/
defs.h 105 struct namelist *n_next; member in struct:namelist
  /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.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;

Completed in 13 milliseconds