| /onnv-gate/usr/src/uts/common/io/drm/ |
| H A D | drm_mm.c | 165 struct drm_mm_node *next_node; in drm_mm_put_block() local
178 next_node = list_entry(cur_head->next, in drm_mm_put_block()
180 if (next_node->free) { in drm_mm_put_block()
182 prev_node->size += next_node->size; in drm_mm_put_block()
183 list_del(&next_node->ml_entry); in drm_mm_put_block()
184 list_del(&next_node->fl_entry); in drm_mm_put_block()
185 drm_free(next_node, in drm_mm_put_block()
186 sizeof (*next_node), DRM_MEM_MM); in drm_mm_put_block()
188 next_node->size += cur->size; in drm_mm_put_block()
189 next_node->start = cur->start; in drm_mm_put_block()
|
| /onnv-gate/usr/src/uts/common/io/fibre-channel/fca/oce/ |
| H A D | oce_utils.c | 35 OCE_LIST_NODE_T *next_node);
38 OCE_LIST_NODE_T *prev_node, OCE_LIST_NODE_T *next_node);
74 OCE_LIST_NODE_T *next_node) in oce_list_insert_node() argument
76 next_node->prev = list_node; in oce_list_insert_node()
77 list_node->next = next_node; in oce_list_insert_node()
83 oce_list_del_node(OCE_LIST_NODE_T *prev_node, OCE_LIST_NODE_T *next_node) in oce_list_del_node() argument
85 next_node->prev = prev_node; in oce_list_del_node()
86 prev_node->next = next_node; in oce_list_del_node()
|
| /onnv-gate/usr/src/lib/udapl/udapl_tavor/common/ |
| H A D | dapl_provider.c | 245 DAPL_PROVIDER_LIST_NODE *cur_node, *prev_node, *next_node; in dapl_provider_list_insert() local
270 next_node = g_dapl_provider_list.tail; in dapl_provider_list_insert()
276 cur_node->next = next_node; in dapl_provider_list_insert()
280 next_node->prev = cur_node; in dapl_provider_list_insert()
332 DAPL_PROVIDER_LIST_NODE *cur_node, *prev_node, *next_node; in dapl_provider_list_remove() local
342 next_node = cur_node->next; in dapl_provider_list_remove()
344 prev_node->next = next_node; in dapl_provider_list_remove()
345 next_node->prev = prev_node; in dapl_provider_list_remove()
|
| /onnv-gate/usr/src/lib/udapl/libdat/common/ |
| H A D | dat_dictionary.c | 262 DAT_DICTIONARY_NODE *cur_node, *prev_node, *next_node; in dat_dictionary_insert() local
281 next_node = p_dictionary->tail; in dat_dictionary_insert()
284 cur_node->next = next_node; in dat_dictionary_insert()
288 next_node->prev = cur_node; in dat_dictionary_insert()
379 DAT_DICTIONARY_NODE *cur_node, *prev_node, *next_node; in dat_dictionary_remove() local
397 next_node = cur_node->next; in dat_dictionary_remove()
399 prev_node->next = next_node; in dat_dictionary_remove()
400 next_node->prev = prev_node; in dat_dictionary_remove()
|
| /onnv-gate/usr/src/lib/libinetutil/common/ |
| H A D | tq.c | 65 iu_timer_node_t *node, *next_node; in iu_tq_destroy() local
67 for (node = tq->iutq_head; node != NULL; node = next_node) { in iu_tq_destroy()
68 next_node = node->iutn_next; in iu_tq_destroy()
317 iu_timer_node_t *node, *next_node; in iu_expire_timers() local
383 for (node = pending_delete_chain; node != NULL; node = next_node) { in iu_expire_timers()
384 next_node = node->iutn_next; in iu_expire_timers()
|
| /onnv-gate/usr/src/cmd/zpool/ |
| H A D | zpool_iter.c | 165 zpool_node_t *node, *next_node; in pool_list_iter() local
168 for (node = uu_avl_first(zlp->zl_avl); node != NULL; node = next_node) { in pool_list_iter()
169 next_node = uu_avl_next(zlp->zl_avl, node); in pool_list_iter()
|
| /onnv-gate/usr/src/cmd/prtconf/ |
| H A D | pdevinfo.c | 1758 di_node_t root, next_node; in do_productinfo() local
1786 next_node = find_node_by_name(promh, root, "openprom"); in do_productinfo()
1787 if (next_node != DI_NODE_NIL) in do_productinfo()
1788 dump_prodinfo(promh, next_node, oprom_prop, in do_productinfo()
1803 di_node_t next_node; in find_node_by_name() local
1806 for (next_node = di_child_node(parent); next_node != DI_NODE_NIL; in find_node_by_name()
1807 next_node = di_sibling_node(next_node)) { in find_node_by_name()
1810 len = get_propval_by_name(promh, next_node, "name", &prop_valp); in find_node_by_name()
1812 return (next_node); in find_node_by_name()
|
| /onnv-gate/usr/src/cmd/fruadm/ |
| H A D | fruadm.c | 786 fru_nodehdl_t next_node; in walk_tree() local
844 if (fru_get_child(node, &next_node) == FRU_SUCCESS) in walk_tree()
845 walk_tree(next_node, path, process_self); in walk_tree()
847 if (fru_get_peer(node, &next_node) == FRU_SUCCESS) in walk_tree()
848 walk_tree(next_node, prior_path, process_tree); in walk_tree()
|
| /onnv-gate/usr/src/tools/cscope-fast/ |
| H A D | cgrep.c | 229 static Node *next_node; variable
1343 next_node = NULL; in re_cwinit()
1609 if (!next_node) lim = NULL; in newnode()
1610 if (next_node == lim) { in newnode()
1611 next_node = (Node *)egmalloc(incr * sizeof (Node)); in newnode()
1612 lim = next_node + incr; in newnode()
1614 next_node->d = d; in newnode()
1616 next_node->id = c->nodeid++; in newnode()
1617 next_node->alts = NULL; in newnode()
1618 next_node->tab = NULL; in newnode()
[all …]
|
| /onnv-gate/usr/src/uts/common/rpc/ |
| H A D | clnt_clts.c | 1788 struct endpnt *next_node = NULL; in endpnt_reap() local
1793 next_node = list_next(&etp->e_ilist, e); in endpnt_reap()
1798 e = next_node; in endpnt_reap()
1812 e = next_node; in endpnt_reap()
1825 struct endpnt *next_node = NULL; in endpnt_reclaim() local
1858 next_node = list_next(&np->e_ilist, e); in endpnt_reclaim()
1862 e = next_node; in endpnt_reclaim()
1874 e = next_node; in endpnt_reclaim()
|
| /onnv-gate/usr/src/lib/libparted/common/lib/ |
| H A D | regexec.c | 3101 Idx next_node = dfa->nexts[cur_node]; in check_arrival_add_next_nodes() local
3114 ok = re_node_set_insert (&union_set, next_node); in check_arrival_add_next_nodes()
3267 Idx to_idx, next_node; in expand_bkref_cache() local
3282 next_node = dfa->edests[ent->node].elems[0]; in expand_bkref_cache()
3283 if (re_node_set_contains (cur_nodes, next_node)) in expand_bkref_cache()
3285 err = re_node_set_init_1 (&new_dests, next_node); in expand_bkref_cache()
3302 next_node = dfa->nexts[ent->node]; in expand_bkref_cache()
3307 next_node)) in expand_bkref_cache()
3311 ok = re_node_set_insert (&union_set, next_node); in expand_bkref_cache()
3321 err = re_node_set_init_1 (&union_set, next_node); in expand_bkref_cache()
[all …]
|
| /onnv-gate/usr/src/cmd/nscd/ |
| H A D | cache.c | 2228 nsc_entry_t *node, *next_node; in reap_cache() local
2364 next_node = nscdb->qhead; in reap_cache()
2365 while (nodes_togo > 0 && next_node != NULL) { in reap_cache()
2366 node = next_node; in reap_cache()
2367 next_node = next_node->qprev; in reap_cache()
|