/netbsd/sys/external/bsd/drm/dist/bsd-core/ |
H A D | drm_mm.c | 235 struct drm_mm_node *next_node; in drm_mm_put_block() local 248 next_node = in drm_mm_put_block() 250 if (next_node->free) { in drm_mm_put_block() 252 prev_node->size += next_node->size; in drm_mm_put_block() 253 list_del(&next_node->ml_entry); in drm_mm_put_block() 254 list_del(&next_node->fl_entry); in drm_mm_put_block() 256 list_add(&next_node->fl_entry, in drm_mm_put_block() 260 free(next_node, DRM_MEM_MM); in drm_mm_put_block() 262 next_node->size += cur->size; in drm_mm_put_block() 263 next_node->start = cur->start; in drm_mm_put_block()
|
/netbsd/crypto/external/bsd/heimdal/dist/lib/base/ |
H A D | heimbase.c | 737 heim_object_t node, next_node; in heim_path_vget2() local 790 node = next_node; in heim_path_vget2() 916 heim_object_t next_node = NULL; in heim_path_vcreate() local 943 next_node = heim_array_get_value(node, idx); in heim_path_vcreate() 945 next_node = NULL; in heim_path_vcreate() 956 if (next_node == NULL) { in heim_path_vcreate() 958 if (next_node == NULL) { in heim_path_vcreate() 969 next_node); in heim_path_vcreate() 976 heim_release(next_node); in heim_path_vcreate() 982 node = next_node; in heim_path_vcreate() [all …]
|
/netbsd/external/cddl/osnet/dist/cmd/zpool/ |
H A D | zpool_iter.c | 168 zpool_node_t *node, *next_node; in pool_list_iter() local 171 for (node = uu_avl_first(zlp->zl_avl); node != NULL; node = next_node) { in pool_list_iter() 172 next_node = uu_avl_next(zlp->zl_avl, node); in pool_list_iter()
|
/netbsd/external/gpl3/gcc/dist/libobjc/ |
H A D | hash.c | 81 node_ptr next_node; in objc_hash_delete() local 94 while ((next_node = node->next)) in objc_hash_delete() 97 node = next_node; in objc_hash_delete()
|
/netbsd/external/gpl3/gcc.old/dist/libobjc/ |
H A D | hash.c | 81 node_ptr next_node; in objc_hash_delete() local 94 while ((next_node = node->next)) in objc_hash_delete() 97 node = next_node; in objc_hash_delete()
|
/netbsd/common/lib/libc/gen/ |
H A D | ptree.c | 722 uintptr_t node, next_node; in ptree_iterate() local 736 next_node = node; in ptree_iterate() 741 next_node = PT_NULL; in ptree_iterate() 751 next_node = PT_NULL; in ptree_iterate() 759 next_node = PTN_BRANCH_SLOT(ptn, slot + 1); in ptree_iterate() 765 next_node = PTN_BRANCH_SLOT(ptn, slot - 1); in ptree_iterate() 776 next_node = PTN_BRANCH_ROOT_SLOT(ptn); in ptree_iterate() 777 ptn = PT_NODE(next_node); in ptree_iterate() 785 KASSERT(PT_NULL_P(next_node)); in ptree_iterate() 791 node = next_node; in ptree_iterate()
|
/netbsd/external/bsd/openldap/dist/servers/slapd/overlays/ |
H A D | sssvlv.c | 416 TAvlnode *cur_node, *next_node; in free_sort_op() local 419 next_node = ldap_tavl_next( cur_node, TAVL_DIR_RIGHT ); in free_sort_op() 423 cur_node = next_node; in free_sort_op() 608 TAvlnode *next_node = NULL; in send_page() local 620 next_node = ldap_tavl_next( cur_node, TAVL_DIR_RIGHT ); in send_page() 629 cur_node = next_node; in send_page() 642 so->so_tree = next_node; in send_page() 643 if ( next_node ) in send_page() 644 next_node->avl_left = NULL; in send_page()
|
/netbsd/external/bsd/ntp/dist/include/ |
H A D | ntp_prio_q.h | 48 void *next_node(void *my_node);
|
/netbsd/external/bsd/ntp/dist/ntpd/ |
H A D | ntp_prio_q.c | 110 next_node( in next_node() function
|
/netbsd/external/gpl2/xcvs/dist/lib/ |
H A D | regexec.c | 3055 Idx next_node = dfa->nexts[cur_node]; in check_arrival_add_next_nodes() local 3068 ok = re_node_set_insert (&union_set, next_node); in check_arrival_add_next_nodes() 3221 Idx to_idx, next_node; in expand_bkref_cache() local 3236 next_node = dfa->edests[ent->node].elems[0]; in expand_bkref_cache() 3237 if (re_node_set_contains (cur_nodes, next_node)) in expand_bkref_cache() 3239 err = re_node_set_init_1 (&new_dests, next_node); in expand_bkref_cache() 3256 next_node = dfa->nexts[ent->node]; in expand_bkref_cache() 3261 next_node)) in expand_bkref_cache() 3393 Idx next_node; in build_trtable() local 3398 next_node = dfa->nexts[dests_node[i].elems[j]]; in build_trtable() [all …]
|
/netbsd/external/gpl2/gettext/dist/gettext-tools/gnulib-lib/ |
H A D | gl_list.h | 375 gl_list_node_t (*next_node) (gl_list_t list, gl_list_node_t node); member 485 ->next_node (list, node); in gl_list_next_node()
|
H A D | gl_list.c | 69 ->next_node (list, node); in gl_list_next_node()
|
/netbsd/sbin/fsck_udf/ |
H A D | main.c | 3853 struct udf_fsck_node *cur_node, *next_node; in udf_check_directory_tree() local 4008 TAILQ_FOREACH_SAFE(cur_node, &fs_nodes, next, next_node) { in udf_check_directory_tree() 4093 TAILQ_FOREACH_SAFE(cur_node, &fs_nodes, next, next_node) { in udf_check_directory_tree() 4120 TAILQ_FOREACH_SAFE(cur_node, &fs_nodes, next, next_node) { in udf_check_directory_tree() 4156 struct udf_fsck_node *cur_node, *next_node; in udf_cleanup_after_check() local 4161 TAILQ_FOREACH_SAFE(cur_node, &fs_nodes, next, next_node) { in udf_cleanup_after_check()
|
/netbsd/external/cddl/osnet/dist/cmd/zfs/ |
H A D | zfs_main.c | 4363 fs_perm_node_t *next_node = in fs_perm_set_fini() local 4369 node = next_node; in fs_perm_set_fini() 4409 deleg_perm_node_t *next_node = in who_perm_fini() local 4414 node = next_node; in who_perm_fini() 4445 who_perm_node_t *next_node = uu_avl_next(fsperm->fsp_sc_avl, in fs_perm_fini() local 4451 node = next_node; in fs_perm_fini() 4456 who_perm_node_t *next_node = uu_avl_next(fsperm->fsp_uge_avl, in fs_perm_fini() local 4462 node = next_node; in fs_perm_fini()
|
/netbsd/external/gpl2/dtc/dist/pylibfdt/ |
H A D | libfdt.i | 152 def next_node(self, nodeoffset, depth, quiet=()):
|
/netbsd/external/gpl2/dtc/dist/tests/ |
H A D | pylibfdt_tests.py | 237 node, depth = self.fdt.next_node(node, depth, (libfdt.BADOFFSET,))
|
/netbsd/external/gpl3/gcc/dist/gcc/ |
H A D | passes.c | 1486 struct pass_list_node *next_node = added_pass_nodes->next; in register_pass() local 1492 added_pass_nodes = next_node; in register_pass()
|
H A D | tree-vect-slp.cc | 97 this->next_node = slp_first_node; in _slp_tree() 122 this->prev_node->next_node = this->next_node; in ~_slp_tree() 124 slp_first_node = this->next_node; in ~_slp_tree() 125 if (this->next_node) in ~_slp_tree() 126 this->next_node->prev_node = this->prev_node; in ~_slp_tree()
|
H A D | passes.cc | 1533 struct pass_list_node *next_node = added_pass_nodes->next; in register_pass() local 1539 added_pass_nodes = next_node; in register_pass()
|
H A D | tree-vectorizer.h | 220 slp_tree next_node; member
|
H A D | ChangeLog-2020 | 2392 * tree-vectorizer.h (_slp_tree::next_node,
|
H A D | ChangeLog-2014 | 22828 "next_node" from rtx to rtx_insn_list *, and use methods when
|
/netbsd/external/gpl3/gcc.old/dist/gcc/ |
H A D | passes.c | 1486 struct pass_list_node *next_node = added_pass_nodes->next; in register_pass() local 1492 added_pass_nodes = next_node; in register_pass()
|
/netbsd/external/mpl/bind/dist/lib/dns/ |
H A D | zone.c | 9721 goto next_node; in zone_sign() 9881 next_node: in zone_sign()
|
/netbsd/external/bsd/ntp/dist/ |
H A D | CommitLog | 169180 make next_node() actually work
|