Home
last modified time | relevance | path

Searched refs:next_node (Results 1 – 12 of 12) sorted by relevance

/titanic_50/usr/src/uts/common/io/drm/
H A Ddrm_mm.c165 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()
/titanic_50/usr/src/uts/common/io/fibre-channel/fca/oce/
H A Doce_utils.c32 OCE_LIST_NODE_T *next_node);
35 OCE_LIST_NODE_T *prev_node, OCE_LIST_NODE_T *next_node);
71 OCE_LIST_NODE_T *next_node) in oce_list_insert_node() argument
73 next_node->prev = list_node; in oce_list_insert_node()
74 list_node->next = next_node; in oce_list_insert_node()
80 oce_list_del_node(OCE_LIST_NODE_T *prev_node, OCE_LIST_NODE_T *next_node) in oce_list_del_node() argument
82 next_node->prev = prev_node; in oce_list_del_node()
83 prev_node->next = next_node; in oce_list_del_node()
/titanic_50/usr/src/lib/udapl/udapl_tavor/common/
H A Ddapl_provider.c245 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()
/titanic_50/usr/src/lib/udapl/libdat/common/
H A Ddat_dictionary.c262 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()
/titanic_50/usr/src/lib/libinetutil/common/
H A Dtq.c65 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()
/titanic_50/usr/src/cmd/zpool/
H A Dzpool_iter.c167 zpool_node_t *node, *next_node; in pool_list_iter() local
170 for (node = uu_avl_first(zlp->zl_avl); node != NULL; node = next_node) { in pool_list_iter()
171 next_node = uu_avl_next(zlp->zl_avl, node); in pool_list_iter()
/titanic_50/usr/src/cmd/prtconf/
H A Dpdevinfo.c1779 di_node_t root, next_node; in do_productinfo() local
1807 next_node = find_node_by_name(promh, root, "openprom"); in do_productinfo()
1808 if (next_node != DI_NODE_NIL) in do_productinfo()
1809 dump_prodinfo(promh, next_node, oprom_prop, in do_productinfo()
1824 di_node_t next_node; in find_node_by_name() local
1827 for (next_node = di_child_node(parent); next_node != DI_NODE_NIL; in find_node_by_name()
1828 next_node = di_sibling_node(next_node)) { in find_node_by_name()
1831 len = get_propval_by_name(promh, next_node, "name", &prop_valp); in find_node_by_name()
1833 return (next_node); in find_node_by_name()
/titanic_50/usr/src/cmd/fruadm/
H A Dfruadm.c788 fru_nodehdl_t next_node; in walk_tree() local
846 if (fru_get_child(node, &next_node) == FRU_SUCCESS) in walk_tree()
847 walk_tree(next_node, path, process_self); in walk_tree()
849 if (fru_get_peer(node, &next_node) == FRU_SUCCESS) in walk_tree()
850 walk_tree(next_node, prior_path, process_tree); in walk_tree()
/titanic_50/usr/src/tools/cscope-fast/
H A Dcgrep.c229 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 …]
/titanic_50/usr/src/uts/common/rpc/
H A Dclnt_clts.c1802 struct endpnt *next_node = NULL; in endpnt_reap() local
1807 next_node = list_next(&etp->e_ilist, e); in endpnt_reap()
1812 e = next_node; in endpnt_reap()
1826 e = next_node; in endpnt_reap()
1839 struct endpnt *next_node = NULL; in endpnt_reclaim() local
1872 next_node = list_next(&np->e_ilist, e); in endpnt_reclaim()
1876 e = next_node; in endpnt_reclaim()
1888 e = next_node; in endpnt_reclaim()
/titanic_50/usr/src/cmd/nscd/
H A Dcache.c2256 nsc_entry_t *node, *next_node; in reap_cache() local
2392 next_node = nscdb->qhead; in reap_cache()
2393 while (nodes_togo > 0 && next_node != NULL) { in reap_cache()
2394 node = next_node; in reap_cache()
2395 next_node = next_node->qprev; in reap_cache()
/titanic_50/usr/src/cmd/zfs/
H A Dzfs_main.c4308 fs_perm_node_t *next_node = in fs_perm_set_fini() local
4314 node = next_node; in fs_perm_set_fini()
4354 deleg_perm_node_t *next_node = in who_perm_fini() local
4359 node = next_node; in who_perm_fini()
4390 who_perm_node_t *next_node = uu_avl_next(fsperm->fsp_sc_avl, in fs_perm_fini() local
4396 node = next_node; in fs_perm_fini()
4401 who_perm_node_t *next_node = uu_avl_next(fsperm->fsp_uge_avl, in fs_perm_fini() local
4407 node = next_node; in fs_perm_fini()