| /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.sbin/autofs/ |
| common.h | 53 TAILQ_ENTRY(node) n_next; member in struct:node
|
| /src/external/bsd/bc/dist/ |
| number.h | 45 bc_num n_next; /* Linked list for available list. */ member in struct:bc_struct
|
| /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/external/gpl3/gdb/dist/include/ |
| bout.h | 112 struct nlist * n_next; member in union:nlist::__anon18440
|
| /src/external/gpl3/gdb.old/dist/include/ |
| bout.h | 112 struct nlist * n_next; member in union:nlist::__anon21181
|
| /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;
|
| /src/external/mit/isl/dist/ |
| isl_scheduler_scc.c | 286 int n_next; local
289 n_next = scc_graph->edge_table[i]->n;
290 next = isl_alloc_array(scc_graph->ctx, int, n_next);
299 if (isl_sort(next, n_next, sizeof(int), &cmp_int, NULL) < 0)
420 int n_next; local
422 n_next = scc_graph->edge_table[i]->n;
423 if (n_next <= 1)
430 for (j = n_next - 2; j >= 0; --j)
|
| /src/external/gpl3/gcc/dist/gcc/fortran/ |
| openmp.cc | 9105 gfc_omp_namelist *n_prev, *n_next, *n_addr; local
9113 n_next = n->next;
9124 n_prev->next = n_next;
9126 omp_clauses->lists[OMP_LIST_USE_DEVICE_PTR] = n_next;
9130 n = n_next;
|
| /src/external/gpl3/gcc.old/dist/gcc/fortran/ |
| openmp.cc | 7456 gfc_omp_namelist *n_prev, *n_next, *n_addr; local
7464 n_next = n->next;
7475 n_prev->next = n_next;
7477 omp_clauses->lists[OMP_LIST_USE_DEVICE_PTR] = n_next;
7481 n = n_next;
|
