Home
last modified time | relevance | path

Searched refs:node (Results 1 – 25 of 3070) sorted by relevance

12345678910>>...123

/netbsd/external/gpl3/gcc/dist/gcc/
H A Dipa-visibility.c193 while (node->transparent_alias && node->definition) in cgraph_externally_visible_p()
194 node = node->get_alias_target (); in cgraph_externally_visible_p()
351 while (node->transparent_alias && node->definition && !node->weakref) in can_replace_by_local_alias()
352 node = node->get_alias_target (); in can_replace_by_local_alias()
401 || (!DECL_WEAK (node->decl) && !DECL_ONE_ONLY (node->decl)) in update_visibility_by_resolution_info()
575 if (node->same_comdat_group && TREE_PUBLIC (node->decl)) in localize_node()
605 if (DECL_COMDAT (node->decl) && !node->alias) in localize_node()
680 if (DECL_EXTERNAL (node->decl) || !node->definition) in function_and_variable_visibility()
704 n != node; in function_and_variable_visibility()
728 && node->definition && !node->weakref in function_and_variable_visibility()
[all …]
H A Dipa-visibility.cc98 && !node->thunk in non_local_p()
193 while (node->transparent_alias && node->definition) in cgraph_externally_visible_p()
194 node = node->get_alias_target (); in cgraph_externally_visible_p()
351 while (node->transparent_alias && node->definition && !node->weakref) in can_replace_by_local_alias()
352 node = node->get_alias_target (); in can_replace_by_local_alias()
575 if (node->same_comdat_group && TREE_PUBLIC (node->decl)) in localize_node()
605 if (DECL_COMDAT (node->decl) && !node->alias) in localize_node()
680 if (DECL_EXTERNAL (node->decl) || !node->definition) in function_and_variable_visibility()
704 n != node; in function_and_variable_visibility()
728 && node->definition && !node->weakref in function_and_variable_visibility()
[all …]
H A Dprint-tree.cc127 if (node == 0) in print_node_brief()
232 if (node == 0) in print_node()
332 if (!TYPE_P (node) && TREE_SIDE_EFFECTS (node)) in print_node()
335 if (TYPE_P (node) ? TYPE_READONLY (node) : TREE_READONLY (node)) in print_node()
337 if (TYPE_P (node) && TYPE_ATOMIC (node)) in print_node()
339 if (!TYPE_P (node) && TREE_CONSTANT (node)) in print_node()
341 else if (TYPE_P (node) && TYPE_SIZES_GIMPLIFIED (node)) in print_node()
344 if (TYPE_P (node) && !ADDR_SPACE_GENERIC_P (TYPE_ADDR_SPACE (node))) in print_node()
518 DECL_ALIGN (node), DECL_WARN_IF_NOT_ALIGN (node)); in print_node()
674 TYPE_ALIGN (node), TYPE_WARN_IF_NOT_ALIGN (node), in print_node()
[all …]
H A Dprint-tree.c127 if (node == 0) in print_node_brief()
232 if (node == 0) in print_node()
332 if (!TYPE_P (node) && TREE_SIDE_EFFECTS (node)) in print_node()
335 if (TYPE_P (node) ? TYPE_READONLY (node) : TREE_READONLY (node)) in print_node()
337 if (TYPE_P (node) && TYPE_ATOMIC (node)) in print_node()
339 if (!TYPE_P (node) && TREE_CONSTANT (node)) in print_node()
341 else if (TYPE_P (node) && TYPE_SIZES_GIMPLIFIED (node)) in print_node()
344 if (TYPE_P (node) && !ADDR_SPACE_GENERIC_P (TYPE_ADDR_SPACE (node))) in print_node()
514 DECL_ALIGN (node), DECL_WARN_IF_NOT_ALIGN (node)); in print_node()
670 TYPE_ALIGN (node), TYPE_WARN_IF_NOT_ALIGN (node), in print_node()
[all …]
H A Dlto-cgraph.c150 if (last_node.node != node) in lto_symtab_encoder_delete_node()
395 if (node->analyzed && (!boundary_p || node->alias in lto_output_node()
396 || (node->thunk.thunk_p && !node->inlined_to))) in lto_output_node()
612 gcc_assert (node->definition || !node->analyzed); in lto_output_varpool_node()
929 if (node->alias && node->analyzed) in compute_ltrans_boundary()
936 node = node->get_alias_target (); in compute_ltrans_boundary()
988 && ((node->thunk.thunk_p && !node->inlined_to) in output_symtab()
1177 || node->clone_of->decl != node->decl)) in input_overwrite_node()
1325 if (node->alias && !node->analyzed && node->weakref) in input_node()
1393 if (node->alias && !node->analyzed && node->weakref) in input_varpool_node()
[all …]
H A Dlto-cgraph.cc154 if (last_node.node != node) in lto_symtab_encoder_delete_node()
399 if (node->analyzed && (!boundary_p || node->alias in lto_output_node()
400 || (node->thunk && !node->inlined_to))) in lto_output_node()
938 if (node->alias && node->analyzed) in compute_ltrans_boundary()
945 node = node->get_alias_target (); in compute_ltrans_boundary()
997 && ((node->thunk && !node->inlined_to) in output_symtab()
1188 || node->clone_of->decl != node->decl)) in input_overwrite_node()
1325 if (node->alias && !node->analyzed && node->weakref) in input_node()
1395 if (node->alias && !node->analyzed && node->weakref) in input_varpool_node()
1548 if (node == NULL || node->decl == NULL_TREE) in input_cgraph_1()
[all …]
H A Dsplay-tree-utils.tcc165 if (!node) in print()
230 node = right; in splay_limit()
240 node = right; in splay_limit()
249 node = right; in splay_limit()
258 return node; in splay_limit()
552 node = next; in lookup()
591 node = next; in lookup()
617 m_root = node; in lookup()
673 node = next; in lookup()
698 node = next; in lookup()
[all …]
/netbsd/external/gpl3/gcc.old/dist/gcc/
H A Dipa-visibility.c193 while (node->transparent_alias && node->definition) in cgraph_externally_visible_p()
194 node = node->get_alias_target (); in cgraph_externally_visible_p()
351 while (node->transparent_alias && node->definition && !node->weakref) in can_replace_by_local_alias()
352 node = node->get_alias_target (); in can_replace_by_local_alias()
401 || (!DECL_WEAK (node->decl) && !DECL_ONE_ONLY (node->decl)) in update_visibility_by_resolution_info()
575 if (node->same_comdat_group && TREE_PUBLIC (node->decl)) in localize_node()
605 if (DECL_COMDAT (node->decl) && !node->alias) in localize_node()
680 if (DECL_EXTERNAL (node->decl) || !node->definition) in function_and_variable_visibility()
704 n != node; in function_and_variable_visibility()
728 && node->definition && !node->weakref in function_and_variable_visibility()
[all …]
H A Dprint-tree.c127 if (node == 0) in print_node_brief()
232 if (node == 0) in print_node()
332 if (!TYPE_P (node) && TREE_SIDE_EFFECTS (node)) in print_node()
335 if (TYPE_P (node) ? TYPE_READONLY (node) : TREE_READONLY (node)) in print_node()
337 if (TYPE_P (node) && TYPE_ATOMIC (node)) in print_node()
339 if (!TYPE_P (node) && TREE_CONSTANT (node)) in print_node()
341 else if (TYPE_P (node) && TYPE_SIZES_GIMPLIFIED (node)) in print_node()
344 if (TYPE_P (node) && !ADDR_SPACE_GENERIC_P (TYPE_ADDR_SPACE (node))) in print_node()
514 DECL_ALIGN (node), DECL_WARN_IF_NOT_ALIGN (node)); in print_node()
670 TYPE_ALIGN (node), TYPE_WARN_IF_NOT_ALIGN (node), in print_node()
[all …]
H A Dlto-cgraph.c150 if (last_node.node != node) in lto_symtab_encoder_delete_node()
395 if (node->analyzed && (!boundary_p || node->alias in lto_output_node()
396 || (node->thunk.thunk_p && !node->inlined_to))) in lto_output_node()
612 gcc_assert (node->definition || !node->analyzed); in lto_output_varpool_node()
929 if (node->alias && node->analyzed) in compute_ltrans_boundary()
936 node = node->get_alias_target (); in compute_ltrans_boundary()
988 && ((node->thunk.thunk_p && !node->inlined_to) in output_symtab()
1177 || node->clone_of->decl != node->decl)) in input_overwrite_node()
1325 if (node->alias && !node->analyzed && node->weakref) in input_node()
1393 if (node->alias && !node->analyzed && node->weakref) in input_varpool_node()
[all …]
/netbsd/external/gpl2/gettext/dist/gettext-tools/gnulib-lib/
H A Dgl_anylinked_list2.h158 node = node->next; in gl_linked_get_at()
165 node = node->prev; in gl_linked_get_at()
184 node = node->next; in gl_linked_set_at()
191 node = node->prev; in gl_linked_set_at()
651 node = node->next; in gl_linked_add_at()
664 node = node->prev; in gl_linked_add_at()
719 node = node->next; in gl_linked_remove_at()
733 node = node->prev; in gl_linked_remove_at()
821 node = node->prev; in gl_linked_iterator_from_to()
824 node = node->prev; in gl_linked_iterator_from_to()
[all …]
/netbsd/external/gpl2/dtc/dist/
H A Dchecks.c64 struct node *node, in check_msg() argument
194 struct node *node) in check_always_fail() argument
201 struct node *node) in check_is_string() argument
219 struct node *node) in check_is_string_list() argument
248 struct node *node) in check_is_cell() argument
306 struct node *node) in check_node_name_chars() argument
317 struct node *node) in check_node_name_chars_strict() argument
328 struct node *node) in check_node_name_format() argument
548 struct node *node) in check_name_properties() argument
766 struct node *node) in check_ranges_format() argument
[all …]
H A Dlivetree.c121 struct node *name_node(struct node *node, char *name) in name_node() argument
130 struct node *omit_node_if_unused(struct node *node) in omit_node_if_unused() argument
137 struct node *reference_node(struct node *node) in reference_node() argument
233 struct node *node; in add_orphan_node() local
323 node = node->next_sibling; in delete_node_by_name()
542 struct node *child, *node; in get_node_by_label() local
788 struct node *node; in build_and_name_child_node() local
826 struct node *an, struct node *node, in generate_label_tree_internal() argument
910 struct node *node) in generate_fixups_tree_internal() argument
954 struct node *lfn, struct node *node, in add_local_fixup_entry() argument
[all …]
/netbsd/external/bsd/kyua-cli/dist/utils/config/
H A Dnodes_test.cpp86 node.set(true); in ATF_TEST_CASE_BODY()
113 node.set(true); in ATF_TEST_CASE_BODY()
124 node.set(true); in ATF_TEST_CASE_BODY()
193 node.set(5); in ATF_TEST_CASE_BODY()
209 node.set(20); in ATF_TEST_CASE_BODY()
218 node.set(20); in ATF_TEST_CASE_BODY()
220 node.set(0); in ATF_TEST_CASE_BODY()
231 node.set(754); in ATF_TEST_CASE_BODY()
292 node.set(89); in ATF_TEST_CASE_BODY()
330 node.set(""); in ATF_TEST_CASE_BODY()
[all …]
/netbsd/external/gpl3/gcc/dist/gcc/cp/
H A Dptree.c33 if (DECL_MUTABLE_P (node)) in cxx_print_decl()
60 if (DECL_EXTERNAL (node) && DECL_NOT_REALLY_EXTERN (node)) in cxx_print_decl()
75 switch (TREE_CODE (node)) in cxx_print_type()
85 TEMPLATE_TYPE_IDX (node), TEMPLATE_TYPE_LEVEL (node), in cxx_print_type()
116 if (TYPE_PTRMEMFUNC_P (node)) in cxx_print_type()
120 if (! CLASS_TYPE_P (node)) in cxx_print_type()
137 if (TYPE_HAS_COPY_CTOR (node)) in cxx_print_type()
157 if (TYPE_BINFO (node)) in cxx_print_type()
211 switch (TREE_CODE (node)) in cxx_print_xnode()
228 TEMPLATE_PARM_IDX (node), TEMPLATE_PARM_LEVEL (node), in cxx_print_xnode()
[all …]
H A Dptree.cc33 if (DECL_MUTABLE_P (node)) in cxx_print_decl()
99 if (DECL_EXTERNAL (node) && DECL_NOT_REALLY_EXTERN (node)) in cxx_print_decl()
126 switch (TREE_CODE (node)) in cxx_print_type()
136 TEMPLATE_TYPE_IDX (node), TEMPLATE_TYPE_LEVEL (node), in cxx_print_type()
170 if (BASES_DIRECT (node)) in cxx_print_type()
188 if (! CLASS_TYPE_P (node)) in cxx_print_type()
225 if (TYPE_BINFO (node)) in cxx_print_type()
279 switch (TREE_CODE (node)) in cxx_print_xnode()
333 TEMPLATE_PARM_IDX (node), TEMPLATE_PARM_LEVEL (node), in cxx_print_xnode()
399 debug_tree (cp_expr node) in debug_tree() argument
[all …]
/netbsd/external/gpl3/gcc.old/dist/gcc/cp/
H A Dptree.c33 if (DECL_MUTABLE_P (node)) in cxx_print_decl()
60 if (DECL_EXTERNAL (node) && DECL_NOT_REALLY_EXTERN (node)) in cxx_print_decl()
75 switch (TREE_CODE (node)) in cxx_print_type()
85 TEMPLATE_TYPE_IDX (node), TEMPLATE_TYPE_LEVEL (node), in cxx_print_type()
116 if (TYPE_PTRMEMFUNC_P (node)) in cxx_print_type()
120 if (! CLASS_TYPE_P (node)) in cxx_print_type()
137 if (TYPE_HAS_COPY_CTOR (node)) in cxx_print_type()
157 if (TYPE_BINFO (node)) in cxx_print_type()
211 switch (TREE_CODE (node)) in cxx_print_xnode()
228 TEMPLATE_PARM_IDX (node), TEMPLATE_PARM_LEVEL (node), in cxx_print_xnode()
[all …]
/netbsd/external/gpl2/groff/dist/src/roff/troff/
H A Dnode.h60 node(node *);
61 node(node *, statem *, int);
82 virtual node *merge_self(node *);
118 inline node::node() in node() function
123 inline node::node(node *n) in node() function
128 inline node::node(node *n, statem *s, int divlevel) in node() function
137 inline node::~node() in ~node()
196 void split(int, node **, node **);
249 void split(int, node **, node **);
612 node *reverse_node_list(node *);
[all …]
/netbsd/external/cddl/osnet/dist/common/avl/
H A Davl.c157 for (node = node->avl_child[left]; in avl_walk()
159 node = node->avl_child[right]) in avl_walk()
167 node = AVL_XPARENT(node); in avl_walk()
189 for (node = tree->avl_root; node != NULL; node = node->avl_child[0]) in avl_first()
208 for (node = tree->avl_root; node != NULL; node = node->avl_child[1]) in avl_last()
264 node = node->avl_child[child]) { in avl_find()
603 node = node->avl_child[child]; in avl_insert_here()
613 node = node->avl_child[child]; in avl_insert_here()
720 node = node->avl_child[right]) in avl_remove()
1036 node = node->avl_child[0]; in avl_destroy_nodes()
[all …]
/netbsd/external/bsd/ntp/dist/lib/isc/
H A Dradix.c233 func(node->prefix, node->data); in isc_radix_process()
269 node = node->r; in isc_radix_search()
271 node = node->l; in isc_radix_search()
277 if (node && node->prefix) in isc_radix_search()
340 node->l = node->r = NULL; in isc_radix_insert()
385 node = node->r; in isc_radix_insert()
389 node = node->l; in isc_radix_insert()
576 } else if (node->parent->r == node) { in isc_radix_insert()
603 } else if (node->parent->r == node) { in isc_radix_insert()
622 if (node->r && node->l) { in isc_radix_remove()
[all …]
/netbsd/external/bsd/nsd/dist/
H A Drbtree.c134 node = node->parent->parent; in rbtree_insert_fixup()
138 node = node->parent; in rbtree_insert_fixup()
163 node = node->parent; in rbtree_insert_fixup()
202 node = node->left; in rbtree_insert()
204 node = node->right; in rbtree_insert()
481 node = node->left; in rbtree_find_less_equal()
485 node = node->right; in rbtree_find_less_equal()
500 for (node = rbtree->root; node->left != RBTREE_NULL; node = node->left); in rbtree_first()
509 for (node = rbtree->root; node->right != RBTREE_NULL; node = node->right); in rbtree_last()
524 for (node = node->right; node->left != RBTREE_NULL; node = node->left); in rbtree_next()
[all …]
/netbsd/external/bsd/unbound/dist/util/
H A Drbtree.c178 node = node->parent->parent; in rbtree_insert_fixup()
182 node = node->parent; in rbtree_insert_fixup()
207 node = node->parent; in rbtree_insert_fixup()
247 node = node->left; in rbtree_insert()
249 node = node->right; in rbtree_insert()
534 node = node->left; in rbtree_find_less_equal()
538 node = node->right; in rbtree_find_less_equal()
553 for (node = rbtree->root; node->left != RBTREE_NULL; node = node->left); in rbtree_first()
562 for (node = rbtree->root; node->right != RBTREE_NULL; node = node->right); in rbtree_last()
577 for (node = node->right; node->left != RBTREE_NULL; node = node->left); in rbtree_next()
[all …]
/netbsd/sys/dev/raidframe/
H A Drf_dagfuncs.c182 node->wakeFunc, node, in rf_ParityLogUpdateFunc()
192 (node->wakeFunc) (node, ENOMEM); in rf_ParityLogUpdateFunc()
218 node->wakeFunc, node, node->dagHdr->tracerec, timer); in rf_ParityLogOverwriteFunc()
227 (node->wakeFunc) (node, ENOMEM); in rf_ParityLogOverwriteFunc()
277 bf, parityStripeID, which_ru, node->wakeFunc, node, in rf_DiskReadFuncForThreads()
283 (void *) (node->dagHdr->raidPtr), 0, node->dagHdr->bp); in rf_DiskReadFuncForThreads()
307 bf, parityStripeID, which_ru, node->wakeFunc, node, in rf_DiskWriteFuncForThreads()
332 0L, 0, NULL, 0L, 0, node->wakeFunc, node, in rf_DiskUndoFunc()
424 if (node->params[i + 1].p != node->results[0]) { in rf_RegularXorFunc()
455 if (node->params[i + 1].p != node->results[0]) { in rf_SimpleXorFunc()
[all …]
/netbsd/external/mpl/bind/dist/lib/isc/
H A Dradix.c220 RADIX_WALK(radix->head, node) { func(node->prefix, node->data); } in isc_radix_process()
256 node = node->r; in isc_radix_search()
258 node = node->l; in isc_radix_search()
262 if (node != NULL && node->prefix) { in isc_radix_search()
332 node->l = node->r = NULL; in isc_radix_insert()
379 node = node->r; in isc_radix_insert()
384 node = node->l; in isc_radix_insert()
571 } else if (node->parent->r == node) { in isc_radix_insert()
601 } else if (node->parent->r == node) { in isc_radix_insert()
620 if (node->r && node->l) { in isc_radix_remove()
[all …]
/netbsd/sys/fs/tmpfs/
H A Dtmpfs_subr.c136 if (node->tn_spec.tn_dir.tn_parent == node) in tmpfs_init_vnode()
149 vp->v_data = node; in tmpfs_init_vnode()
153 cache_enter_id(vp, node->tn_mode, node->tn_uid, node->tn_gid, true); in tmpfs_init_vnode()
205 if (node == NULL) in tmpfs_newvnode()
219 node->tn_id = (ino_t)((uintptr_t)node / sizeof(*node)); in tmpfs_newvnode()
237 node->tn_birthtime = node->tn_atime; in tmpfs_newvnode()
238 node->tn_ctime = node->tn_atime; in tmpfs_newvnode()
239 node->tn_mtime = node->tn_atime; in tmpfs_newvnode()
529 if (node != TMPFS_NODE_WHITEOUT && node->tn_type == VDIR) { in tmpfs_dir_attach()
1039 cache_enter_id(vp, node->tn_mode, node->tn_uid, node->tn_gid, true); in tmpfs_chmod()
[all …]

12345678910>>...123