| /netbsd/src/external/gpl3/gcc/dist/gcc/ |
| D | ipa-visibility.cc | 93 non_local_p (struct cgraph_node *node, void *data ATTRIBUTE_UNUSED) in non_local_p() argument
95 return !(node->only_called_directly_or_aliased_p () in non_local_p()
98 && !node->thunk in non_local_p()
99 && node->definition in non_local_p()
100 && !DECL_EXTERNAL (node->decl) in non_local_p()
101 && !lookup_attribute ("noipa", DECL_ATTRIBUTES (node->decl)) in non_local_p()
102 && !node->externally_visible in non_local_p()
103 && !node->used_from_other_partition in non_local_p()
104 && !node->in_other_partition in non_local_p()
105 && node->get_availability () >= AVAIL_AVAILABLE); in non_local_p()
[all …]
|
| D | print-tree.cc | 59 print_real_cst (FILE *file, const_tree node, bool brief) in print_real_cst() argument
61 if (TREE_OVERFLOW (node)) in print_real_cst()
64 REAL_VALUE_TYPE d = TREE_REAL_CST (node); in print_real_cst()
123 print_node_brief (FILE *file, const char *prefix, const_tree node, int indent) in print_node_brief() argument
127 if (node == 0) in print_node_brief()
130 tclass = TREE_CODE_CLASS (TREE_CODE (node)); in print_node_brief()
136 fprintf (file, "%s <%s", prefix, get_tree_code_name (TREE_CODE (node))); in print_node_brief()
137 dump_addr (file, " ", node); in print_node_brief()
141 if (DECL_NAME (node)) in print_node_brief()
142 fprintf (file, " %s", IDENTIFIER_POINTER (DECL_NAME (node))); in print_node_brief()
[all …]
|
| D | lto-cgraph.cc | 107 symtab_node *node) in lto_symtab_encoder_encode() argument
113 lto_encoder_entry entry = {node, false, false, false}; in lto_symtab_encoder_encode()
120 size_t *slot = encoder->map->get (node); in lto_symtab_encoder_encode()
123 lto_encoder_entry entry = {node, false, false, false}; in lto_symtab_encoder_encode()
126 encoder->map->put (node, ref + 1); in lto_symtab_encoder_encode()
139 symtab_node *node) in lto_symtab_encoder_delete_node() argument
144 size_t *slot = encoder->map->get (node); in lto_symtab_encoder_delete_node()
149 gcc_checking_assert (encoder->nodes[index].node == node); in lto_symtab_encoder_delete_node()
154 if (last_node.node != node) in lto_symtab_encoder_delete_node()
156 gcc_assert (encoder->map->put (last_node.node, index + 1)); in lto_symtab_encoder_delete_node()
[all …]
|
| D | splay-tree-utils.tcc | 24 base_splay_tree<Accessors>::get_child (node_type node, unsigned int index) in get_child() argument
26 return Accessors::child (node, index); in get_child()
34 base_splay_tree<Accessors>::set_child (node_type node, unsigned int index, in set_child() argument
37 Accessors::child (node, index) = child; in set_child()
39 set_parent (child, node); in set_child()
49 base_splay_tree<Accessors>::promote_child (node_type node, unsigned int index) in promote_child() argument
51 node_type promoted = get_child (node, index); in promote_child()
52 set_child (node, index, get_child (promoted, 1 - index)); in promote_child()
53 set_child (promoted, 1 - index, node); in promote_child()
63 base_splay_tree<Accessors>::promote_child (node_type node, unsigned int index, in promote_child() argument
[all …]
|
| D | cgraphunit.cc | 284 enqueue_node (symtab_node *node) in enqueue_node() argument
286 if (node->aux) in enqueue_node()
289 node->aux = queued_nodes; in enqueue_node()
290 queued_nodes = node; in enqueue_node()
310 cgraph_node *node = cgraph_new_nodes[i]; in process_new_functions() local
311 fndecl = node->decl; in process_new_functions()
319 call_cgraph_insertion_hooks (node); in process_new_functions()
320 enqueue_node (node); in process_new_functions()
331 if (!node->analyzed) in process_new_functions()
332 node->analyze (); in process_new_functions()
[all …]
|
| D | tree-pretty-print.cc | 61 #define NIY do_niy (pp, node, spc, flags)
68 do_niy (pretty_printer *pp, const_tree node, int spc, dump_flags_t flags) in do_niy() argument
73 pp_string (pp, get_tree_code_name (TREE_CODE (node))); in do_niy()
75 if (EXPR_P (node)) in do_niy()
77 len = TREE_OPERAND_LENGTH (node); in do_niy()
81 dump_generic_node (pp, TREE_OPERAND (node, i), spc+2, flags, false); in do_niy()
271 dump_decl_name (pretty_printer *pp, tree node, dump_flags_t flags) in dump_decl_name() argument
273 tree name = DECL_NAME (node); in dump_decl_name()
277 && HAS_DECL_ASSEMBLER_NAME_P (node) in dump_decl_name()
278 && DECL_ASSEMBLER_NAME_SET_P (node)) in dump_decl_name()
[all …]
|
| /netbsd/src/external/bsd/kyua-cli/dist/utils/config/ |
| D | nodes_test.cpp | 85 config::bool_node node; in ATF_TEST_CASE_BODY() local
86 node.set(true); in ATF_TEST_CASE_BODY()
87 config::detail::base_node* raw_copy = node.deep_copy(); in ATF_TEST_CASE_BODY()
91 ATF_REQUIRE(node.value()); in ATF_TEST_CASE_BODY()
100 config::bool_node node; in ATF_TEST_CASE_BODY() local
101 ATF_REQUIRE(!node.is_set()); in ATF_TEST_CASE_BODY()
102 node.set(false); in ATF_TEST_CASE_BODY()
103 ATF_REQUIRE( node.is_set()); in ATF_TEST_CASE_BODY()
110 config::bool_node node; in ATF_TEST_CASE_BODY() local
111 node.set(false); in ATF_TEST_CASE_BODY()
[all …]
|
| /netbsd/src/external/gpl3/gcc/dist/gcc/cp/ |
| D | ptree.cc | 29 cxx_print_decl (FILE *file, tree node, int indent) in cxx_print_decl() argument
31 if (TREE_CODE (node) == FIELD_DECL) in cxx_print_decl()
33 if (DECL_MUTABLE_P (node)) in cxx_print_decl()
41 if (!CODE_CONTAINS_STRUCT (TREE_CODE (node), TS_DECL_COMMON) in cxx_print_decl()
42 || !DECL_LANG_SPECIFIC (node)) in cxx_print_decl()
45 if (TREE_CODE (node) == FUNCTION_DECL) in cxx_print_decl()
50 fprintf (file, " full-name \"%s\"", decl_as_string (node, flags)); in cxx_print_decl()
52 else if (TREE_CODE (node) == TEMPLATE_DECL) in cxx_print_decl()
54 print_node (file, "result", DECL_TEMPLATE_RESULT (node), indent + 4); in cxx_print_decl()
55 print_node (file, "parms", DECL_TEMPLATE_PARMS (node), indent + 4); in cxx_print_decl()
[all …]
|
| /netbsd/src/external/cddl/osnet/dist/common/avl/ |
| D | avl.c | 139 avl_node_t *node = AVL_DATA2NODE(oldnode, off); in avl_walk() local
147 if (node == NULL) in avl_walk()
156 if (node->avl_child[left] != NULL) { in avl_walk()
157 for (node = node->avl_child[left]; in avl_walk()
158 node->avl_child[right] != NULL; in avl_walk()
159 node = node->avl_child[right]) in avl_walk()
166 was_child = AVL_XCHILD(node); in avl_walk()
167 node = AVL_XPARENT(node); in avl_walk()
168 if (node == NULL) in avl_walk()
175 return (AVL_NODE2DATA(node, off)); in avl_walk()
[all …]
|
| /netbsd/src/sys/dev/raidframe/ |
| D | rf_dagfuncs.c | 106 rf_TerminateFunc(RF_DagNode_t *node) in rf_TerminateFunc() argument
108 RF_ASSERT(node->dagHdr->numCommits == node->dagHdr->numCommitNodes); in rf_TerminateFunc()
109 node->status = rf_good; in rf_TerminateFunc()
110 rf_FinishNode(node, RF_THREAD_CONTEXT); in rf_TerminateFunc()
114 rf_TerminateUndoFunc(RF_DagNode_t *node) in rf_TerminateUndoFunc() argument
133 rf_DiskReadMirrorIdleFunc(RF_DagNode_t *node) in rf_DiskReadMirrorIdleFunc() argument
138 rf_SelectMirrorDiskIdle(node); in rf_DiskReadMirrorIdleFunc()
139 rf_DiskReadFunc(node); in rf_DiskReadMirrorIdleFunc()
144 rf_DiskReadMirrorPartitionFunc(RF_DagNode_t *node) in rf_DiskReadMirrorPartitionFunc() argument
149 rf_SelectMirrorDiskPartition(node); in rf_DiskReadMirrorPartitionFunc()
[all …]
|
| D | rf_engine.c | 186 BranchDone(RF_DagNode_t *node)
192 switch (node->status) {
202 for (i = 0; i < node->numSuccedents; i++)
203 if (!BranchDone(node->succedents[i]))
228 NodeReady(RF_DagNode_t *node) in NodeReady() argument
234 switch (node->dagHdr->status) { in NodeReady()
237 if ((node->status == rf_wait) && in NodeReady()
238 (node->numAntecedents == node->numAntDone)) in NodeReady()
242 RF_ASSERT(node->numSuccDone <= node->numSuccedents); in NodeReady()
243 RF_ASSERT(node->numSuccFired <= node->numSuccedents); in NodeReady()
[all …]
|
| /netbsd/src/sys/fs/tmpfs/ |
| D | tmpfs_subr.c | 109 tmpfs_init_vnode(struct vnode *vp, tmpfs_node_t *node) in tmpfs_init_vnode() argument
113 KASSERT(node->tn_vnode == NULL); in tmpfs_init_vnode()
116 if (node->tn_type == VREG) { in tmpfs_init_vnode()
117 slock = node->tn_spec.tn_reg.tn_aobj->vmobjlock; in tmpfs_init_vnode()
123 vp->v_type = node->tn_type; in tmpfs_init_vnode()
130 spec_node_init(vp, node->tn_spec.tn_dev.tn_rdev); in tmpfs_init_vnode()
136 if (node->tn_spec.tn_dir.tn_parent == node) in tmpfs_init_vnode()
149 vp->v_data = node; in tmpfs_init_vnode()
150 node->tn_vnode = vp; in tmpfs_init_vnode()
151 uvm_vnp_setsize(vp, node->tn_size); in tmpfs_init_vnode()
[all …]
|
| /netbsd/src/external/bsd/ipf/dist/ |
| D | ipf_rb.h | 40 rotate_left(struct _n##_rb_head *head, _t *node) \
44 parent = node->_f.parent; \
45 tmp1 = node->_f.right; \
47 node->_f.right = tmp2; \
49 tmp2->_f.parent = node; \
52 else if (parent->_f.right == node) \
56 tmp1->_f.left = node; \
58 node->_f.parent = tmp1; \
62 rotate_right(struct _n##_rb_head *head, _t *node) \
66 parent = node->_f.parent; \
[all …]
|
| /netbsd/src/external/gpl3/gcc/dist/libiberty/ |
| D | fibheap.c | 66 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 …]
|
| /netbsd/src/external/gpl3/binutils/dist/libiberty/ |
| D | fibheap.c | 66 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 …]
|
| /netbsd/src/external/gpl3/gdb/dist/libiberty/ |
| D | fibheap.c | 66 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 …]
|
| /netbsd/src/sys/external/bsd/drm2/drm/ |
| D | drm_vma_manager.c | 132 drm_vma_node_init(struct drm_vma_offset_node *node) in drm_vma_node_init() argument
136 *node = zero_node; in drm_vma_node_init()
138 rw_init(&node->von_lock); in drm_vma_node_init()
139 node->von_startpage = 0; in drm_vma_node_init()
140 node->von_npages = 0; in drm_vma_node_init()
141 rb_tree_init(&node->von_files, &drm_vma_file_rb_ops); in drm_vma_node_init()
145 drm_vma_node_destroy(struct drm_vma_offset_node *node) in drm_vma_node_destroy() argument
148 KASSERTMSG((RB_TREE_MIN(&node->von_files) == NULL), in drm_vma_node_destroy()
149 "drm vma node %p not empty", node); in drm_vma_node_destroy()
151 rb_tree_destroy(&node->von_files); in drm_vma_node_destroy()
[all …]
|
| /netbsd/src/external/gpl3/gcc/dist/gcc/lto/ |
| D | lto-partition.cc | 41 static void add_symbol_to_partition (ltrans_partition part, symtab_node *node);
96 symbol_partitioned_p (symtab_node *node) in symbol_partitioned_p() argument
98 return node->aux; in symbol_partitioned_p()
103 add_references_to_partition (ltrans_partition part, symtab_node *node) in add_references_to_partition() argument
109 for (i = 0; node->iterate_reference (i, ref); i++) in add_references_to_partition()
131 add_symbol_to_partition_1 (ltrans_partition part, symtab_node *node) in add_symbol_to_partition_1() argument
133 enum symbol_partitioning_class c = node->get_partitioning_class (); in add_symbol_to_partition_1()
138 if (lto_symtab_encoder_in_partition_p (part->encoder, node)) in add_symbol_to_partition_1()
146 if (c == SYMBOL_PARTITION && !DECL_COMDAT (node->decl) in add_symbol_to_partition_1()
147 && symbol_partitioned_p (node)) in add_symbol_to_partition_1()
[all …]
|
| /netbsd/src/sys/external/bsd/drm2/dist/drm/ |
| D | drm_mm.c | 112 static noinline void save_stack(struct drm_mm_node *node) in save_stack() argument
120 node->stack = stack_depot_save(entries, n, GFP_NOWAIT); in save_stack()
125 struct drm_mm_node *node; in show_leaks() local
134 list_for_each_entry(node, drm_mm_nodes(mm), node_list) { in show_leaks()
135 if (!node->stack) { in show_leaks()
137 node->start, node->size); in show_leaks()
141 nr_entries = stack_depot_fetch(node->stack, &entries); in show_leaks()
144 node->start, node->size, buf); in show_leaks()
153 static void save_stack(struct drm_mm_node *node) { } in save_stack() argument
157 #define START(node) ((node)->start) argument
[all …]
|
| /netbsd/src/external/bsd/wpa/dist/src/utils/ |
| D | xml-utils.c | 19 xml_node_t *node; in get_node_uri_iter() local
26 node = root; in get_node_uri_iter()
27 xml_node_for_each_sibling(ctx, node) { in get_node_uri_iter()
28 xml_node_for_each_check(ctx, node); in get_node_uri_iter()
29 name = xml_node_get_localname(ctx, node); in get_node_uri_iter()
34 if (node == NULL) in get_node_uri_iter()
38 return get_node_uri_iter(ctx, xml_node_first_child(ctx, node), in get_node_uri_iter()
42 return node; in get_node_uri_iter()
50 xml_node_t *node; in get_node_uri() local
56 node = get_node_uri_iter(ctx, root, search); in get_node_uri()
[all …]
|
| /netbsd/src/usr.sbin/makefs/cd9660/ |
| D | iso9660_rrip.c | 56 cd9660_susp_initialize(iso9660_disk *diskStructure, cd9660node *node, in cd9660_susp_initialize() argument
63 assert(node != NULL); in cd9660_susp_initialize()
65 if (!(node->type & CD9660_TYPE_DOT) && in cd9660_susp_initialize()
66 !(node->type & CD9660_TYPE_DOTDOT)) in cd9660_susp_initialize()
67 TAILQ_INIT(&(node->head)); in cd9660_susp_initialize()
68 if (node->dot_record != 0) in cd9660_susp_initialize()
69 TAILQ_INIT(&(node->dot_record->head)); in cd9660_susp_initialize()
70 if (node->dot_dot_record != 0) in cd9660_susp_initialize()
71 TAILQ_INIT(&(node->dot_dot_record->head)); in cd9660_susp_initialize()
74 if ((r = cd9660_susp_initialize_node(diskStructure, node)) < 0) in cd9660_susp_initialize()
[all …]
|
| /netbsd/src/sys/external/bsd/ipf/netinet/ |
| D | ipf_rb.h | 101 rotate_left(struct _n##_rb_head *head, _t *node) \
105 parent = node->_f.parent; \
106 tmp1 = node->_f.right; \
108 node->_f.right = tmp2; \
110 tmp2->_f.parent = node; \
113 else if (parent->_f.right == node) \
117 tmp1->_f.left = node; \
119 node->_f.parent = tmp1; \
123 rotate_right(struct _n##_rb_head *head, _t *node) \
127 parent = node->_f.parent; \
[all …]
|
| /netbsd/src/external/gpl3/gcc/dist/libobjc/ |
| D | hash.c | 80 node_ptr node; in objc_hash_delete() local
90 if ((node = cache->node_table[i])) in objc_hash_delete()
94 while ((next_node = node->next)) in objc_hash_delete()
96 objc_hash_remove (cache,node->key); in objc_hash_delete()
97 node = next_node; in objc_hash_delete()
99 objc_hash_remove (cache,node->key); in objc_hash_delete()
113 node_ptr node = (node_ptr) objc_calloc (1, sizeof (struct cache_node)); in objc_hash_add() local
115 assert (node); in objc_hash_add()
118 node->key = key; in objc_hash_add()
119 node->value = value; in objc_hash_add()
[all …]
|
| /netbsd/src/sys/dev/ic/ |
| D | ath_netbsd.c | 115 struct sysctlnode node; in ath_sysctl_slottime() local
119 node = *rnode; in ath_sysctl_slottime()
120 sc = (struct ath_softc *)node.sysctl_data; in ath_sysctl_slottime()
122 node.sysctl_data = &slottime; in ath_sysctl_slottime()
123 error = sysctl_lookup(SYSCTLFN_CALL(&node)); in ath_sysctl_slottime()
133 struct sysctlnode node; in ath_sysctl_acktimeout() local
137 node = *rnode; in ath_sysctl_acktimeout()
138 sc = (struct ath_softc *)node.sysctl_data; in ath_sysctl_acktimeout()
140 node.sysctl_data = &acktimeout; in ath_sysctl_acktimeout()
141 error = sysctl_lookup(SYSCTLFN_CALL(&node)); in ath_sysctl_acktimeout()
[all …]
|
| /netbsd/src/sys/arch/ofppc/ofppc/ |
| D | cpu.c | 91 int node; in cpu_match() local
96 node = OF_finddevice("/cpus"); in cpu_match()
97 if (node != -1) { in cpu_match()
98 for (node = OF_child(node); node != 0; node = OF_peer(node)) { in cpu_match()
102 l = OF_getprop(node, "reg", &cpunum, sizeof(cpunum)); in cpu_match()
115 int node; in cpu_OFgetspeed() local
116 node = OF_finddevice("/cpus"); in cpu_OFgetspeed()
117 if (node != -1) { in cpu_OFgetspeed()
118 for (node = OF_child(node); node; node = OF_peer(node)) { in cpu_OFgetspeed()
122 l = OF_getprop(node, "reg", &cpunum, sizeof(cpunum)); in cpu_OFgetspeed()
[all …]
|