Home
last modified time | relevance | path

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

12345678910>>...70

/openbsd-src/gnu/gcc/gcc/
H A Dprint-tree.c40 tree node; member
51 debug_tree (tree node) in debug_tree() argument
54 print_node (stderr, "", node, 0); in debug_tree()
73 print_node_brief (FILE *file, const char *prefix, tree node, int indent) in print_node_brief() argument
77 if (node == 0) in print_node_brief()
80 class = TREE_CODE_CLASS (TREE_CODE (node)); in print_node_brief()
86 fprintf (file, "%s <%s", prefix, tree_code_name[(int) TREE_CODE (node)]); in print_node_brief()
87 dump_addr (file, " ", node); in print_node_brief()
91 if (DECL_NAME (node)) in print_node_brief()
92 fprintf (file, " %s", IDENTIFIER_POINTER (DECL_NAME (node))); in print_node_brief()
[all …]
H A Dcgraph.c103 static void cgraph_node_remove_callers (struct cgraph_node *node);
182 struct cgraph_node *node; in cgraph_create_node() local
184 node = GGC_CNEW (struct cgraph_node); in cgraph_create_node()
185 node->next = cgraph_nodes; in cgraph_create_node()
186 node->uid = cgraph_max_uid++; in cgraph_create_node()
187 node->order = cgraph_order++; in cgraph_create_node()
189 cgraph_nodes->previous = node; in cgraph_create_node()
190 node->previous = NULL; in cgraph_create_node()
191 node->global.estimated_growth = INT_MIN; in cgraph_create_node()
192 cgraph_nodes = node; in cgraph_create_node()
[all …]
H A Dipa.c33 struct cgraph_node *node, *node2; in cgraph_postorder() local
45 for (node = cgraph_nodes; node; node = node->next) in cgraph_postorder()
46 node->aux = NULL; in cgraph_postorder()
47 for (node = cgraph_nodes; node; node = node->next) in cgraph_postorder()
48 if (!node->aux) in cgraph_postorder()
50 node2 = node; in cgraph_postorder()
51 if (!node->callers) in cgraph_postorder()
52 node->aux = &last; in cgraph_postorder()
54 node->aux = node->callers; in cgraph_postorder()
86 for (node = cgraph_nodes; node; node = node->next) in cgraph_postorder()
[all …]
H A Dcgraphunit.c194 decide_is_function_needed (struct cgraph_node *node, tree decl) in decide_is_function_needed() argument
200 node->local.externally_visible = true; in decide_is_function_needed()
205 if (node->local.externally_visible) in decide_is_function_needed()
221 if (node->needed) in decide_is_function_needed()
233 || (!optimize && !node->local.disregard_inline_limits in decide_is_function_needed()
235 && !node->origin)) in decide_is_function_needed()
264 || (!node->local.disregard_inline_limits in decide_is_function_needed()
268 && (!node->local.inlinable || !cgraph_default_inline_p (node, NULL)))) in decide_is_function_needed()
317 struct cgraph_varpool_node *next, *node = cgraph_varpool_nodes_queue; in cgraph_varpool_remove_unreferenced_decls() local
324 while (node) in cgraph_varpool_remove_unreferenced_decls()
[all …]
H A Dipa-inline.c223 cgraph_estimate_growth (struct cgraph_node *node) in cgraph_estimate_growth() argument
227 if (node->global.estimated_growth != INT_MIN) in cgraph_estimate_growth()
228 return node->global.estimated_growth; in cgraph_estimate_growth()
230 for (e = node->callers; e; e = e->next_caller) in cgraph_estimate_growth()
232 growth += (cgraph_estimate_size_after_inlining (1, e->caller, node) in cgraph_estimate_growth()
238 if (!node->needed && !DECL_EXTERNAL (node->decl)) in cgraph_estimate_growth()
239 growth -= node->global.insns; in cgraph_estimate_growth()
241 node->global.estimated_growth = growth; in cgraph_estimate_growth()
419 update_caller_keys (fibheap_t heap, struct cgraph_node *node, in update_caller_keys() argument
425 if (!node->local.inlinable || node->local.disregard_inline_limits in update_caller_keys()
[all …]
/openbsd-src/gnu/usr.bin/gcc/gcc/
H A Dprint-tree.c37 tree node; member
48 debug_tree (node) in debug_tree() argument
49 tree node; in debug_tree()
52 print_node (stderr, "", node, 0);
60 print_node_brief (file, prefix, node, indent) in print_node_brief() argument
63 tree node;
68 if (node == 0)
71 class = TREE_CODE_CLASS (TREE_CODE (node));
77 fprintf (file, "%s <%s ", prefix, tree_code_name[(int) TREE_CODE (node)]);
78 fprintf (file, HOST_PTR_PRINTF, (char *) node);
[all …]
H A Det-forest.c58 et_forest_node_t node; member
105 splay (node) in splay() argument
106 et_forest_occurrence_t node; in splay()
113 parent = node->parent;
116 return node; /* node == root. */
125 if (node == parent->left)
132 node1 = node->right;
133 count1 = node->count_right;
147 node->right = parent;
148 node->count_right = count1 + parent->count_right + 1;
[all …]
/openbsd-src/gnu/usr.bin/gcc/gcc/cp/
H A Dptree.c30 cxx_print_decl (file, node, indent) in cxx_print_decl() argument
32 tree node;
35 if (TREE_CODE (node) == FIELD_DECL)
37 if (DECL_MUTABLE_P (node))
45 if (!DECL_LANG_SPECIFIC (node))
48 if (TREE_CODE (node) == FUNCTION_DECL
49 && DECL_PENDING_INLINE_INFO (node))
52 fprintf (file, HOST_PTR_PRINTF, DECL_PENDING_INLINE_INFO (node));
54 if (TREE_CODE (node) == TYPE_DECL
55 && DECL_SORTED_FIELDS (node))
[all …]
/openbsd-src/gnu/gcc/gcc/cp/
H A Dptree.c32 cxx_print_decl (FILE *file, tree node, int indent) in cxx_print_decl() argument
34 if (TREE_CODE (node) == FIELD_DECL) in cxx_print_decl()
36 if (DECL_MUTABLE_P (node)) in cxx_print_decl()
44 if (!CODE_CONTAINS_STRUCT (TREE_CODE (node), TS_DECL_COMMON) in cxx_print_decl()
45 || !DECL_LANG_SPECIFIC (node)) in cxx_print_decl()
48 if (TREE_CODE (node) == FUNCTION_DECL in cxx_print_decl()
49 && DECL_PENDING_INLINE_INFO (node)) in cxx_print_decl()
51 (void *) DECL_PENDING_INLINE_INFO (node)); in cxx_print_decl()
52 if (TREE_CODE (node) == TYPE_DECL in cxx_print_decl()
53 && DECL_SORTED_FIELDS (node)) in cxx_print_decl()
[all …]
/openbsd-src/gnu/llvm/llvm/lib/Target/AMDGPU/
H A DAMDGPUInstrInfo.td9 // This file contains DAG node definitions for the AMDGPU target.
103 // This argument to this node is a dword address.
364 // Intrinsic/Custom node compatibility PatFrags
367 def AMDGPUrcp : PatFrags<(ops node:$src), [(int_amdgcn_rcp node:$src),
368 (AMDGPUrcp_impl node:$src)]>;
369 def AMDGPUrcp_legacy : PatFrags<(ops node:$src), [(int_amdgcn_rcp_legacy node:$src),
370 (AMDGPUrcp_legacy_impl node:$src)]>;
372 def AMDGPUrsq : PatFrags<(ops node:$src), [(int_amdgcn_rsq node:$src),
373 (AMDGPUrsq_impl node:$src)]>;
375 def AMDGPUrsq_clamp : PatFrags<(ops node:$src), [(int_amdgcn_rsq_clamp node:$src),
[all …]
/openbsd-src/usr.sbin/nsd/
H A Drbtree.c28 static void rbtree_rotate_left(rbtree_type *rbtree, rbnode_type *node);
29 static void rbtree_rotate_right(rbtree_type *rbtree, rbnode_type *node);
30 static void rbtree_insert_fixup(rbtree_type *rbtree, rbnode_type *node);
64 rbtree_rotate_left(rbtree_type *rbtree, rbnode_type *node) in rbtree_rotate_left() argument
66 rbnode_type *right = node->right; in rbtree_rotate_left()
67 node->right = right->left; in rbtree_rotate_left()
69 right->left->parent = node; in rbtree_rotate_left()
71 right->parent = node->parent; in rbtree_rotate_left()
73 if (node->parent != RBTREE_NULL) { in rbtree_rotate_left()
74 if (node == node->parent->left) { in rbtree_rotate_left()
[all …]
/openbsd-src/usr.sbin/unbound/util/
H A Drbtree.c62 static void rbtree_rotate_left(rbtree_type *rbtree, rbnode_type *node);
64 static void rbtree_rotate_right(rbtree_type *rbtree, rbnode_type *node);
66 static void rbtree_insert_fixup(rbtree_type *rbtree, rbnode_type *node);
108 rbtree_rotate_left(rbtree_type *rbtree, rbnode_type *node) in rbtree_rotate_left() argument
110 rbnode_type *right = node->right; in rbtree_rotate_left()
111 node->right = right->left; in rbtree_rotate_left()
113 right->left->parent = node; in rbtree_rotate_left()
115 right->parent = node->parent; in rbtree_rotate_left()
117 if (node->parent != RBTREE_NULL) { in rbtree_rotate_left()
118 if (node == node->parent->left) { in rbtree_rotate_left()
[all …]
/openbsd-src/sbin/unwind/libunbound/util/
H A Drbtree.c62 static void rbtree_rotate_left(rbtree_type *rbtree, rbnode_type *node);
64 static void rbtree_rotate_right(rbtree_type *rbtree, rbnode_type *node);
66 static void rbtree_insert_fixup(rbtree_type *rbtree, rbnode_type *node);
108 rbtree_rotate_left(rbtree_type *rbtree, rbnode_type *node) in rbtree_rotate_left() argument
110 rbnode_type *right = node->right; in rbtree_rotate_left()
111 node->right = right->left; in rbtree_rotate_left()
113 right->left->parent = node; in rbtree_rotate_left()
115 right->parent = node->parent; in rbtree_rotate_left()
117 if (node->parent != RBTREE_NULL) { in rbtree_rotate_left()
118 if (node == node->parent->left) { in rbtree_rotate_left()
[all …]
/openbsd-src/gnu/llvm/llvm/include/llvm/Target/
H A DTargetSelectionDAG.td96 // DAG node.
335 def node;
803 /// can match something on the DAG, from a single node to multiple nested other
978 def not : PatFrag<(ops node:$in), (xor node:$in, -1)>;
979 def vnot : PatFrag<(ops node:$in), (xor node:$in, immAllOnesV)>;
980 def ineg : PatFrag<(ops node:$in), (sub 0, node:$in)>;
982 def zanyext : PatFrags<(ops node:$op),
983 [(zext node:$op),
984 (anyext node:$op)]>;
994 def unindexedload : PatFrag<(ops node:$ptr), (ld node:$ptr)> {
[all …]
/openbsd-src/sys/dev/pci/drm/
H A Dlinux_radix.c57 struct radix_tree_node *node; in radix_tree_lookup() local
62 node = root->rnode; in radix_tree_lookup()
66 while (height && node) in radix_tree_lookup()
67 node = node->slots[radix_pos(index, height--)]; in radix_tree_lookup()
68 if (node) in radix_tree_lookup()
69 item = node->slots[radix_pos(index, 0)]; in radix_tree_lookup()
79 struct radix_tree_node *node; in radix_tree_iter_find() local
84 node = root->rnode; in radix_tree_iter_find()
85 if (node == NULL) in radix_tree_iter_find()
97 *pppslot = node->slots + pos; in radix_tree_iter_find()
[all …]
H A Ddrm_mm.c79 * steep cliff not a real concern. Removing a node again is O(1).
107 static noinline void save_stack(struct drm_mm_node *node) in save_stack() argument
115 node->stack = stack_depot_save(entries, n, GFP_NOWAIT); in save_stack()
120 struct drm_mm_node *node; in show_leaks() local
129 list_for_each_entry(node, drm_mm_nodes(mm), node_list) { in show_leaks()
130 if (!node->stack) { in show_leaks()
131 DRM_ERROR("node [%08llx + %08llx]: unknown owner\n", in show_leaks()
132 node->start, node->size); in show_leaks()
136 nr_entries = stack_depot_fetch(node in show_leaks()
148 save_stack(struct drm_mm_node * node) save_stack() argument
152 START(node) global() argument
153 LAST(node) global() argument
192 drm_mm_interval_tree_add_node(struct drm_mm_node * hole_node,struct drm_mm_node * node) drm_mm_interval_tree_add_node() argument
266 insert_hole_size(struct rb_root_cached * root,struct drm_mm_node * node) insert_hole_size() argument
286 add_hole(struct drm_mm_node * node) add_hole() argument
300 rm_hole(struct drm_mm_node * node) rm_hole() argument
333 struct drm_mm_node *node = best_hole() local
350 struct drm_mm_node *node = NULL; find_hole() local
394 next_hole(struct drm_mm * mm,struct drm_mm_node * node,enum drm_mm_insert_mode mode) next_hole() argument
428 drm_mm_reserve_node(struct drm_mm * mm,struct drm_mm_node * node) drm_mm_reserve_node() argument
493 drm_mm_insert_node_in_range(struct drm_mm * const mm,struct drm_mm_node * const node,u64 size,u64 alignment,unsigned long color,u64 range_start,u64 range_end,enum drm_mm_insert_mode mode) drm_mm_insert_node_in_range() argument
592 drm_mm_node_scanned_block(const struct drm_mm_node * node) drm_mm_node_scanned_block() argument
605 drm_mm_remove_node(struct drm_mm_node * node) drm_mm_remove_node() argument
759 drm_mm_scan_add_block(struct drm_mm_scan * scan,struct drm_mm_node * node) drm_mm_scan_add_block() argument
850 drm_mm_scan_remove_block(struct drm_mm_scan * scan,struct drm_mm_node * node) drm_mm_scan_remove_block() argument
[all...]
/openbsd-src/gnu/usr.bin/perl/regen/
H A Dregcomp.pl109 my ($node)= @_;
111 if ( $all{ $node->{name} } ) {
112 die "Duplicate item '$node->{name}' in regcomp.sym line $node->{line_num} "
113 . "previously defined on line $all{ $node->{name} }{line_num}\n";
114 } elsif (!$node->{optype}) {
115 die "must have an optype in node ", Dumper($node);
116 } elsif ($node->{optype} eq "op") {
117 push @ops, $node;
118 } elsif ($node->{optype} eq "state") {
119 push @states, $node;
[all …]
/openbsd-src/gnu/llvm/llvm/lib/Target/SystemZ/
H A DSystemZOperators.td444 def z_loadbswap16 : PatFrag<(ops node:$addr), (z_loadbswap node:$addr), [{
447 def z_loadbswap32 : PatFrag<(ops node:$addr), (z_loadbswap node:$addr), [{
450 def z_loadbswap64 : PatFrag<(ops node:$addr), (z_loadbswap node:$addr), [{
454 def z_storebswap16 : PatFrag<(ops node:$src, node:$addr),
455 (z_storebswap node:$src, node:$addr), [{
458 def z_storebswap32 : PatFrag<(ops node:$src, node:$addr),
459 (z_storebswap node:$src, node:$addr), [{
462 def z_storebswap64 : PatFrag<(ops node:$src, node:$addr),
463 (z_storebswap node:$src, node:$addr), [{
469 : PatFrag<(ops node:$valid, node:$mask, node:$bb),
[all …]
/openbsd-src/usr.sbin/ldomctl/
H A Dconfig.c144 pri_link_core(struct md *md, struct md_node *node, struct core *core) in pri_link_core() argument
151 TAILQ_FOREACH(prop, &node->prop_list, link) { in pri_link_core()
154 node2 = prop->d.arc.node; in pri_link_core()
173 pri_add_core(struct md *md, struct md_node *node) in pri_add_core() argument
180 pri_link_core(md, node, core); in pri_add_core()
186 struct md_node *node; in pri_init_cores() local
192 TAILQ_FOREACH(node, &md->node_list, link) { in pri_init_cores()
193 if (strcmp(node->name->str, "tlb") == 0 && in pri_init_cores()
194 md_get_prop_data(md, node, "type", &type, &len) && in pri_init_cores()
196 pri_add_core(md, node); in pri_init_cores()
[all …]
/openbsd-src/sys/dev/pci/drm/i915/gt/
H A Dintel_gt_buffer_pool.c30 static void node_free(struct intel_gt_buffer_pool_node *node) in node_free() argument
32 i915_gem_object_put(node->obj); in node_free()
33 i915_active_fini(&node->active); in node_free()
34 kfree_rcu(node, rcu); in node_free()
39 struct intel_gt_buffer_pool_node *node, *stale = NULL; in pool_free_older_than() local
57 node = list_entry(pos, typeof(*node), link); in pool_free_older_than()
59 age = READ_ONCE(node->age); in pool_free_older_than()
64 if (!xchg(&node->age, 0)) in pool_free_older_than()
67 node->free = stale; in pool_free_older_than()
68 stale = node; in pool_free_older_than()
[all …]
/openbsd-src/gnu/llvm/llvm/lib/Target/X86/
H A DX86InstrFragmentsSIMD.td28 def load_mmx : PatFrag<(ops node:$ptr), (x86mmx (load node:$ptr))>;
141 def X86any_vfpext : PatFrags<(ops node:$src),
142 [(X86strict_vfpext node:$src),
143 (X86vfpext node:$src)]>;
156 def X86any_vfpround : PatFrags<(ops node:$src),
157 [(X86strict_vfpround node:$src),
158 (X86vfpround node:$src)]>;
201 def X86any_cmpp : PatFrags<(ops node:$src1, node:$src2, node:$src3),
202 [(X86strict_cmpp node:$src1, node:$src2, node:$src3),
203 (X86cmpp node:$src1, node:$src2, node:$src3)]>;
[all …]
/openbsd-src/gnu/lib/libiberty/src/
H A Dfibheap.c66 fibnode_t node; in fibnode_new() local
68 node = (fibnode_t) xcalloc (1, sizeof *node); in fibnode_new()
69 node->left = node; in fibnode_new()
70 node->right = node; in fibnode_new()
72 return node; in fibnode_new()
100 fibnode_t node; in fibheap_insert() local
103 node = fibnode_new (); in fibheap_insert()
106 node->data = data; in fibheap_insert()
107 node->key = key; in fibheap_insert()
110 fibheap_ins_root (heap, node); in fibheap_insert()
[all …]
/openbsd-src/sys/tmpfs/
H A Dtmpfs_subr.c105 mode_t mode, char *target, dev_t rdev, tmpfs_node_t **node) in tmpfs_alloc_node() argument
208 *node = nnode; in tmpfs_alloc_node()
217 tmpfs_free_node(tmpfs_mount_t *tmp, tmpfs_node_t *node) in tmpfs_free_node() argument
222 LIST_REMOVE(node, tn_entries); in tmpfs_free_node()
225 switch (node->tn_type) { in tmpfs_free_node()
227 if (node->tn_size > 0) { in tmpfs_free_node()
228 KASSERT(node->tn_size <= SIZE_MAX); in tmpfs_free_node()
229 tmpfs_strname_free(tmp, node->tn_spec.tn_lnk.tn_link, in tmpfs_free_node()
230 node->tn_size); in tmpfs_free_node()
238 objsz = PAGE_SIZE * node in tmpfs_free_node()
272 tmpfs_vnode_get(struct mount * mp,tmpfs_node_t * node,struct vnode ** vpp) tmpfs_vnode_get() argument
373 tmpfs_node_t *dnode = VP_TO_TMPFS_DIR(dvp), *node; tmpfs_alloc_file() local
480 tmpfs_dir_attach(tmpfs_node_t * dnode,tmpfs_dirent_t * de,tmpfs_node_t * node) tmpfs_dir_attach() argument
532 tmpfs_node_t *node = de->td_node; tmpfs_dir_detach() local
582 tmpfs_dir_lookup(tmpfs_node_t * node,struct componentname * cnp) tmpfs_dir_lookup() argument
611 tmpfs_dir_cached(tmpfs_node_t * node) tmpfs_dir_cached() argument
681 tmpfs_dir_lookupbyseq(tmpfs_node_t * node,off_t seq) tmpfs_dir_lookupbyseq() argument
709 tmpfs_dir_getdotents(tmpfs_node_t * node,struct dirent * dp,struct uio * uio) tmpfs_dir_getdotents() argument
754 tmpfs_dir_getdents(tmpfs_node_t * node,struct uio * uio) tmpfs_dir_getdents() argument
867 tmpfs_node_t *node = VP_TO_TMPFS_NODE(vp); tmpfs_reg_resize() local
939 tmpfs_node_t *node = VP_TO_TMPFS_NODE(vp); tmpfs_chflags() local
976 tmpfs_node_t *node = VP_TO_TMPFS_NODE(vp); tmpfs_chmod() local
1015 tmpfs_node_t *node = VP_TO_TMPFS_NODE(vp); tmpfs_chown() local
1055 tmpfs_node_t *node = VP_TO_TMPFS_NODE(vp); tmpfs_chsize() local
1098 tmpfs_node_t *node = VP_TO_TMPFS_NODE(vp); tmpfs_chtimes() local
1134 tmpfs_update(tmpfs_node_t * node,int flags) tmpfs_update() argument
1154 tmpfs_node_t *node = VP_TO_TMPFS_NODE(vp); tmpfs_truncate() local
1174 tmpfs_uio_cached(tmpfs_node_t * node) tmpfs_uio_cached() argument
1183 tmpfs_uio_lookup(tmpfs_node_t * node,voff_t pgnum) tmpfs_uio_lookup() argument
1192 tmpfs_uio_uncache(tmpfs_node_t * node) tmpfs_uio_uncache() argument
1202 tmpfs_uio_cache(tmpfs_node_t * node,voff_t pgnum,vaddr_t pgptr) tmpfs_uio_cache() argument
1216 tmpfs_uiomove(tmpfs_node_t * node,struct uio * uio,vsize_t len) tmpfs_uiomove() argument
1263 tmpfs_zeropg(tmpfs_node_t * node,voff_t pgnum,vaddr_t pgoff) tmpfs_zeropg() argument
[all...]
/openbsd-src/usr.sbin/makefs/cd9660/
H A Diso9660_rrip.c51 cd9660_susp_initialize(iso9660_disk *diskStructure, cd9660node *node, in cd9660_susp_initialize() argument
58 assert(node != NULL); in cd9660_susp_initialize()
60 if (!(node->type & CD9660_TYPE_DOT) && in cd9660_susp_initialize()
61 !(node->type & CD9660_TYPE_DOTDOT)) in cd9660_susp_initialize()
62 TAILQ_INIT(&(node->head)); in cd9660_susp_initialize()
63 if (node->dot_record != 0) in cd9660_susp_initialize()
64 TAILQ_INIT(&(node->dot_record->head)); in cd9660_susp_initialize()
65 if (node->dot_dot_record != 0) in cd9660_susp_initialize()
66 TAILQ_INIT(&(node->dot_dot_record->head)); in cd9660_susp_initialize()
69 if ((r = cd9660_susp_initialize_node(diskStructure, node)) < 0) in cd9660_susp_initialize()
[all …]
/openbsd-src/usr.sbin/unbound/edns-subnet/
H A Daddrtree.c55 edge_create(struct addrnode *node, const addrkey_t *addr, in edge_create() argument
62 edge->node = node; in edge_create()
75 node->parent_edge = edge; in edge_create()
93 struct addrnode* node = (struct addrnode *)malloc( sizeof (*node) ); in node_create() local
94 if (!node) in node_create()
96 node->elem = elem; in node_create()
98 node->scope = scope; in node_create()
99 node->ttl = ttl; in node_create()
100 node->only_match_scope_zero = 0; in node_create()
101 node->edge[0] = NULL; in node_create()
[all …]

12345678910>>...70