Home
last modified time | relevance | path

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

12345678910>>...39

/dflybsd-src/contrib/gcc-8.0/gcc/
H A Dipa-visibility.c93 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.thunk_p 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 …]
H A Dprint-tree.c58 print_node_brief (FILE *file, const char *prefix, const_tree node, int indent) in print_node_brief() argument
62 if (node == 0) in print_node_brief()
65 tclass = TREE_CODE_CLASS (TREE_CODE (node)); in print_node_brief()
71 fprintf (file, "%s <%s", prefix, get_tree_code_name (TREE_CODE (node))); in print_node_brief()
72 dump_addr (file, " ", node); in print_node_brief()
76 if (DECL_NAME (node)) in print_node_brief()
77 fprintf (file, " %s", IDENTIFIER_POINTER (DECL_NAME (node))); in print_node_brief()
78 else if (TREE_CODE (node) == LABEL_DECL in print_node_brief()
79 && LABEL_DECL_UID (node) != -1) in print_node_brief()
84 fprintf (file, " L.%d", (int) LABEL_DECL_UID (node)); in print_node_brief()
[all …]
H A Dlto-cgraph.c107 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 …]
H A Dtree-pretty-print.c49 #define NIY do_niy (pp, node, flags)
56 do_niy (pretty_printer *pp, const_tree node, dump_flags_t flags) in do_niy() argument
61 pp_string (pp, get_tree_code_name (TREE_CODE (node))); in do_niy()
63 if (EXPR_P (node)) in do_niy()
65 len = TREE_OPERAND_LENGTH (node); in do_niy()
69 dump_generic_node (pp, TREE_OPERAND (node, i), 2, flags, false); in do_niy()
248 dump_decl_name (pretty_printer *pp, tree node, dump_flags_t flags) in dump_decl_name() argument
250 tree name = DECL_NAME (node); in dump_decl_name()
254 && HAS_DECL_ASSEMBLER_NAME_P (node) in dump_decl_name()
255 && DECL_ASSEMBLER_NAME_SET_P (node)) in dump_decl_name()
[all …]
/dflybsd-src/contrib/gcc-4.7/gcc/
H A Dvarpool.c84 varpool_node_name (struct varpool_node *node) in varpool_node_name() argument
86 return lang_hooks.decl_printable_name (node->decl, 2); in varpool_node_name()
131 struct varpool_node key, *node, **slot; in varpool_node() local
144 node = ggc_alloc_cleared_varpool_node (); in varpool_node()
145 node->decl = decl; in varpool_node()
146 node->order = cgraph_order++; in varpool_node()
147 node->next = varpool_nodes; in varpool_node()
148 ipa_empty_ref_list (&node->ref_list); in varpool_node()
150 varpool_nodes->prev = node; in varpool_node()
151 varpool_nodes = node; in varpool_node()
[all …]
H A Dprint-tree.c43 tree node; member
54 debug_tree (tree node) in debug_tree() argument
57 print_node (stderr, "", node, 0); in debug_tree()
90 print_node_brief (FILE *file, const char *prefix, const_tree node, int indent) in print_node_brief() argument
94 if (node == 0) in print_node_brief()
97 tclass = TREE_CODE_CLASS (TREE_CODE (node)); in print_node_brief()
103 fprintf (file, "%s <%s", prefix, tree_code_name[(int) TREE_CODE (node)]); in print_node_brief()
104 dump_addr (file, " ", node); in print_node_brief()
108 if (DECL_NAME (node)) in print_node_brief()
109 fprintf (file, " %s", IDENTIFIER_POINTER (DECL_NAME (node))); in print_node_brief()
[all …]
H A Dipa.c40 update_inlined_to_pointer (struct cgraph_node *node, struct cgraph_node *inlined_to) in update_inlined_to_pointer() argument
43 for (e = node->callees; e; e = e->next_callee) in update_inlined_to_pointer()
60 enqueue_cgraph_node (struct cgraph_node *node, struct cgraph_node **first) in enqueue_cgraph_node() argument
63 if (node->aux && node->aux != (void *) 2) in enqueue_cgraph_node()
67 if (node->aux == (void *)2 && !node->reachable) in enqueue_cgraph_node()
69 node->aux = *first; in enqueue_cgraph_node()
70 *first = node; in enqueue_cgraph_node()
76 enqueue_varpool_node (struct varpool_node *node, struct varpool_node **first) in enqueue_varpool_node() argument
78 node->aux = *first; in enqueue_varpool_node()
79 *first = node; in enqueue_varpool_node()
[all …]
H A Dcgraph.c117 static void cgraph_node_remove_callers (struct cgraph_node *node);
292 cgraph_call_node_removal_hooks (struct cgraph_node *node) in cgraph_call_node_removal_hooks() argument
297 entry->hook (node, entry->data); in cgraph_call_node_removal_hooks()
333 cgraph_call_function_insertion_hooks (struct cgraph_node *node) in cgraph_call_function_insertion_hooks() argument
338 entry->hook (node, entry->data); in cgraph_call_function_insertion_hooks()
452 struct cgraph_node *node; in cgraph_allocate_node() local
456 node = free_nodes; in cgraph_allocate_node()
457 free_nodes = NEXT_FREE_NODE (node); in cgraph_allocate_node()
461 node = ggc_alloc_cleared_cgraph_node (); in cgraph_allocate_node()
462 node->uid = cgraph_max_uid++; in cgraph_allocate_node()
[all …]
H A Dcgraphunit.c160 cgraph_decide_is_function_needed (struct cgraph_node *node, tree decl) in cgraph_decide_is_function_needed() argument
163 if (node->local.externally_visible) in cgraph_decide_is_function_needed()
170 && (!node->thunk.thunk_p && !node->same_body_alias) in cgraph_decide_is_function_needed()
185 if (node->needed) in cgraph_decide_is_function_needed()
198 && !node->same_body_alias in cgraph_decide_is_function_needed()
220 struct cgraph_node *node; in cgraph_process_new_functions() local
227 node = cgraph_new_nodes; in cgraph_process_new_functions()
228 fndecl = node->decl; in cgraph_process_new_functions()
236 node->next_needed = NULL; in cgraph_process_new_functions()
238 cgraph_mark_reachable_node (node); in cgraph_process_new_functions()
[all …]
H A Dlto-cgraph.c107 struct cgraph_node *node) in lto_cgraph_encoder_encode() argument
112 slot = pointer_map_contains (encoder->map, node); in lto_cgraph_encoder_encode()
116 slot = pointer_map_insert (encoder->map, node); in lto_cgraph_encoder_encode()
118 VEC_safe_push (cgraph_node_ptr, heap, encoder->nodes, node); in lto_cgraph_encoder_encode()
133 struct cgraph_node *node) in lto_cgraph_encoder_lookup() argument
135 void **slot = pointer_map_contains (encoder->map, node); in lto_cgraph_encoder_lookup()
156 struct cgraph_node *node) in lto_cgraph_encoder_encode_body_p() argument
158 return pointer_set_contains (encoder->body, node); in lto_cgraph_encoder_encode_body_p()
165 struct cgraph_node *node) in lto_set_cgraph_encoder_encode_body() argument
167 pointer_set_insert (encoder->body, node); in lto_set_cgraph_encoder_encode_body()
[all …]
H A Dcgraph.h477 void cgraph_insert_node_to_hashtable (struct cgraph_node *node);
483 void cgraph_node_remove_callees (struct cgraph_node *node);
544 (struct cgraph_node *node);
546 (struct cgraph_node *node);
547 bool cgraph_can_remove_if_no_direct_calls_p (struct cgraph_node *node);
558 VEC (cgraph_edge_p, heap) * collect_callers_of_node (struct cgraph_node *node);
611 void cgraph_call_function_insertion_hooks (struct cgraph_node *node);
618 bool cgraph_propagate_frequency (struct cgraph_node *node);
672 void varpool_remove_node (struct varpool_node *node);
673 void varpool_finalize_named_section_flags (struct varpool_node *node);
[all …]
H A Dtree-pretty-print.c49 #define NIY do_niy(buffer,node)
57 do_niy (pretty_printer *buffer, const_tree node) in do_niy() argument
62 pp_string (buffer, tree_code_name[(int) TREE_CODE (node)]); in do_niy()
64 if (EXPR_P (node)) in do_niy()
66 len = TREE_OPERAND_LENGTH (node); in do_niy()
70 dump_generic_node (buffer, TREE_OPERAND (node, i), 2, 0, false); in do_niy()
171 dump_decl_name (pretty_printer *buffer, tree node, int flags) in dump_decl_name() argument
173 if (DECL_NAME (node)) in dump_decl_name()
175 if ((flags & TDF_ASMNAME) && DECL_ASSEMBLER_NAME_SET_P (node)) in dump_decl_name()
176 pp_tree_identifier (buffer, DECL_ASSEMBLER_NAME (node)); in dump_decl_name()
[all …]
/dflybsd-src/contrib/gcc-8.0/gcc/cp/
H A Dptree.c29 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()
44 if (TREE_CODE (node) == FUNCTION_DECL) in cxx_print_decl()
49 fprintf (file, " full-name \"%s\"", decl_as_string (node, flags)); in cxx_print_decl()
51 else if (TREE_CODE (node) == TEMPLATE_DECL) in cxx_print_decl()
53 print_node (file, "parms", DECL_TEMPLATE_PARMS (node), indent + 4); in cxx_print_decl()
56 decl_as_string (node, TFF_TEMPLATE_HEADER)); in cxx_print_decl()
[all …]
/dflybsd-src/contrib/gcc-4.7/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()
47 if (TREE_CODE (node) == FUNCTION_DECL) in cxx_print_decl()
52 fprintf (file, " full-name \"%s\"", decl_as_string (node, flags)); in cxx_print_decl()
54 else if (TREE_CODE (node) == TEMPLATE_DECL) in cxx_print_decl()
58 decl_as_string (node, TFF_TEMPLATE_HEADER)); in cxx_print_decl()
62 if (DECL_EXTERNAL (node) && DECL_NOT_REALLY_EXTERN (node)) in cxx_print_decl()
[all …]
/dflybsd-src/contrib/ldns/
H A Dradix.c54 static int ldns_radix_array_space(ldns_radix_node_t* node, uint8_t byte);
55 static int ldns_radix_array_grow(ldns_radix_node_t* node, unsigned need);
67 static ldns_radix_node_t* ldns_radix_next_in_subtree(ldns_radix_node_t* node);
68 static ldns_radix_node_t* ldns_radix_prev_from_index(ldns_radix_node_t* node,
71 ldns_radix_node_t* node);
72 static ldns_radix_node_t* ldns_radix_last_in_subtree(ldns_radix_node_t* node);
73 static void ldns_radix_del_fix(ldns_radix_t* tree, ldns_radix_node_t* node);
74 static void ldns_radix_cleanup_onechild(ldns_radix_node_t* node);
75 static void ldns_radix_cleanup_leaf(ldns_radix_node_t* node);
76 static void ldns_radix_node_free(ldns_radix_node_t* node, void* arg);
[all …]
H A Drbtree.c65 static void ldns_rbtree_rotate_left(ldns_rbtree_t *rbtree, ldns_rbnode_t *node);
67 static void ldns_rbtree_rotate_right(ldns_rbtree_t *rbtree, ldns_rbnode_t *node);
69 static void ldns_rbtree_insert_fixup(ldns_rbtree_t *rbtree, ldns_rbnode_t *node);
116 ldns_rbtree_rotate_left(ldns_rbtree_t *rbtree, ldns_rbnode_t *node) in ldns_rbtree_rotate_left() argument
118 ldns_rbnode_t *right = node->right; in ldns_rbtree_rotate_left()
119 node->right = right->left; in ldns_rbtree_rotate_left()
121 right->left->parent = node; in ldns_rbtree_rotate_left()
123 right->parent = node->parent; in ldns_rbtree_rotate_left()
125 if (node->parent != LDNS_RBTREE_NULL) { in ldns_rbtree_rotate_left()
126 if (node == node->parent->left) { in ldns_rbtree_rotate_left()
[all …]
/dflybsd-src/sys/vfs/tmpfs/
H A Dtmpfs_subr.c98 struct tmpfs_node **node) in tmpfs_alloc_node() argument
187 *node = nnode; in tmpfs_alloc_node()
213 tmpfs_free_node(struct tmpfs_mount *tmp, struct tmpfs_node *node) in tmpfs_free_node() argument
218 TMPFS_ASSERT_ELOCKED(node); in tmpfs_free_node()
219 KKASSERT(node->tn_vnode == NULL); in tmpfs_free_node()
222 LIST_REMOVE(node, tn_entries); in tmpfs_free_node()
225 TMPFS_NODE_UNLOCK(node); /* Caller has this lock */ in tmpfs_free_node()
227 switch (node->tn_type) { in tmpfs_free_node()
246 node->tn_size = 0; in tmpfs_free_node()
247 KKASSERT(node->tn_dir.tn_parent == NULL); in tmpfs_free_node()
[all …]
/dflybsd-src/sbin/newfs/
H A Dfscopy.c59 fsnode_t node = malloc(offsetof(struct FSNode, fs_Name[pathlen+1])); in fsmknode() local
61 if (node == NULL) { in fsmknode()
65 bzero(node, sizeof(*node)); in fsmknode()
66 bcopy(path, node->fs_Name, pathlen + 1); in fsmknode()
67 if (lstat(path, &node->fs_St) < 0) { in fsmknode()
69 free(node); in fsmknode()
72 return(node); in fsmknode()
76 fsgethlink(fsnode_t hlinks, fsnode_t node) in fsgethlink() argument
81 if (scan->fs_St.st_dev == node->fs_St.st_dev && in fsgethlink()
82 scan->fs_St.st_ino == node->fs_St.st_ino in fsgethlink()
[all …]
/dflybsd-src/sys/dev/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 …]
/dflybsd-src/contrib/gcc-8.0/libiberty/
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 …]
/dflybsd-src/contrib/gcc-4.7/libiberty/
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 …]
/dflybsd-src/contrib/binutils-2.34/libiberty/
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 …]
/dflybsd-src/contrib/binutils-2.27/libiberty/
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 …]
/dflybsd-src/usr.sbin/makefs/cd9660/
H A Diso9660_rrip.c57 cd9660_susp_initialize(iso9660_disk *diskStructure, cd9660node *node, in cd9660_susp_initialize() argument
64 assert(node != NULL); in cd9660_susp_initialize()
66 if (!(node->type & CD9660_TYPE_DOT) && in cd9660_susp_initialize()
67 !(node->type & CD9660_TYPE_DOTDOT)) in cd9660_susp_initialize()
68 TAILQ_INIT(&(node->head)); in cd9660_susp_initialize()
69 if (node->dot_record != 0) in cd9660_susp_initialize()
70 TAILQ_INIT(&(node->dot_record->head)); in cd9660_susp_initialize()
71 if (node->dot_dot_record != 0) in cd9660_susp_initialize()
72 TAILQ_INIT(&(node->dot_dot_record->head)); in cd9660_susp_initialize()
75 if ((r = cd9660_susp_initialize_node(diskStructure, node)) < 0) in cd9660_susp_initialize()
[all …]
/dflybsd-src/sys/vfs/hammer/
H A Dhammer_cursor.c51 hammer_node_t node; in hammer_init_cursor() local
135 if (cache && cache->node) { in hammer_init_cursor()
136 node = hammer_ref_node_safe(trans, cache, &error); in hammer_init_cursor()
138 hammer_lock_sh(&node->lock); in hammer_init_cursor()
139 if (node->flags & HAMMER_NODE_DELETED) { in hammer_init_cursor()
140 hammer_unlock(&node->lock); in hammer_init_cursor()
141 hammer_rel_node(node); in hammer_init_cursor()
142 node = NULL; in hammer_init_cursor()
145 if (node == NULL) in hammer_init_cursor()
148 node = NULL; in hammer_init_cursor()
[all …]

12345678910>>...39