Home
last modified time | relevance | path

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

12345678910>>...111

/netbsd-src/external/gpl3/gcc.old/dist/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.c59 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 …]
H A Dlto-cgraph.c103 symtab_node *node) in lto_symtab_encoder_encode() argument
109 lto_encoder_entry entry = {node, false, false, false}; in lto_symtab_encoder_encode()
116 size_t *slot = encoder->map->get (node); in lto_symtab_encoder_encode()
119 lto_encoder_entry entry = {node, false, false, false}; in lto_symtab_encoder_encode()
122 encoder->map->put (node, ref + 1); in lto_symtab_encoder_encode()
135 symtab_node *node) in lto_symtab_encoder_delete_node() argument
140 size_t *slot = encoder->map->get (node); in lto_symtab_encoder_delete_node()
145 gcc_checking_assert (encoder->nodes[index].node == node); in lto_symtab_encoder_delete_node()
150 if (last_node.node != node) in lto_symtab_encoder_delete_node()
152 gcc_assert (encoder->map->put (last_node.node, index + 1)); in lto_symtab_encoder_delete_node()
[all …]
/netbsd-src/external/gpl3/gcc/dist/gcc/
H A Dipa-visibility.cc93 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 …]
H A Dprint-tree.cc59 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 …]
H A Dlto-cgraph.cc107 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 Dsplay-tree-utils.tcc24 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 …]
/netbsd-src/external/gpl2/gettext/dist/gettext-tools/gnulib-lib/
H A Dgl_anylinked_list2.h94 gl_list_node_t node = in gl_linked_create() local
98 node->value = *contents; in gl_linked_create()
100 node->h.hashcode = in gl_linked_create()
102 ? list->base.hashcode_fn (node->value) in gl_linked_create()
103 : (size_t)(uintptr_t) node->value); in gl_linked_create()
106 add_to_bucket (list, node); in gl_linked_create()
110 node->prev = tail; in gl_linked_create()
111 tail->next = node; in gl_linked_create()
112 tail = node; in gl_linked_create()
127 gl_linked_node_value (gl_list_t list, gl_list_node_t node) in gl_linked_node_value() argument
[all …]
/netbsd-src/external/mit/isl/dist/
H A Disl_schedule_node.c31 isl_schedule_node *node; in isl_schedule_node_alloc() local
41 node = isl_calloc_type(ctx, isl_schedule_node); in isl_schedule_node_alloc()
42 if (!node) in isl_schedule_node_alloc()
44 node->ref = 1; in isl_schedule_node_alloc()
45 node->schedule = schedule; in isl_schedule_node_alloc()
46 node->tree = tree; in isl_schedule_node_alloc()
47 node->ancestors = ancestors; in isl_schedule_node_alloc()
48 node->child_pos = isl_alloc_array(ctx, int, n); in isl_schedule_node_alloc()
49 if (n && !node->child_pos) in isl_schedule_node_alloc()
50 return isl_schedule_node_free(node); in isl_schedule_node_alloc()
[all …]
/netbsd-src/external/gpl2/dtc/dist/
H A Dchecks.c31 typedef void (*check_fn)(struct check *c, struct dt_info *dti, struct node *node);
64 struct node *node, in check_msg() argument
78 else if (node && node->srcpos) in check_msg()
79 pos = node->srcpos; in check_msg()
94 if (node) { in check_msg()
96 xasprintf_append(&str, "%s:%s: ", node->fullpath, prop->name); in check_msg()
98 xasprintf_append(&str, "%s: ", node->fullpath); in check_msg()
108 pos = node->srcpos; in check_msg()
121 #define FAIL(c, dti, node, ...) \ argument
125 check_msg((c), dti, node, NULL, __VA_ARGS__); \
[all …]
H A Dlivetree.c90 struct node *build_node(struct property *proplist, struct node *children, in build_node()
93 struct node *new = xmalloc(sizeof(*new)); in build_node()
94 struct node *child; in build_node()
109 struct node *build_node_delete(struct srcpos *srcpos) in build_node_delete()
111 struct node *new = xmalloc(sizeof(*new)); in build_node_delete()
121 struct node *name_node(struct node *node, char *name) in name_node() argument
123 assert(node->name == NULL); in name_node()
125 node->name = name; in name_node()
127 return node; in name_node()
130 struct node *omit_node_if_unused(struct node *node) in omit_node_if_unused() argument
[all …]
/netbsd-src/external/bsd/kyua-cli/dist/utils/config/
H A Dnodes_test.cpp85 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.old/dist/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 …]
/netbsd-src/external/gpl2/groff/dist/src/roff/troff/
H A Dnode.h52 struct node { struct
53 node *next; argument
54 node *last; argument
59 node(); argument
60 node(node *);
61 node(node *, statem *, int);
62 node *add_char(charinfo *, environment *, hunits *, int *, node ** = 0);
64 virtual ~node();
65 virtual node *copy() = 0;
77 virtual node *last_char_node();
[all …]
/netbsd-src/external/gpl3/gcc/dist/gcc/cp/
H A Dptree.cc29 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/
H A Davl.c139 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/
H A Drf_dagfuncs.c106 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 …]
/netbsd-src/external/bsd/unbound/dist/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 …]
/netbsd-src/external/bsd/nsd/dist/
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 …]
/netbsd-src/sys/fs/tmpfs/
H A Dtmpfs_subr.c109 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/mpl/dhcp/bind/dist/lib/isc/
H A Dradix.c216 isc_radix_node_t *node; in isc_radix_process() local
220 RADIX_WALK(radix->head, node) { func(node->prefix, node->data); } in isc_radix_process()
227 isc_radix_node_t *node; in isc_radix_search() local
240 node = radix->head; in isc_radix_search()
242 if (node == NULL) { in isc_radix_search()
249 while (node != NULL && node->bit < bitlen) { in isc_radix_search()
250 if (node->prefix) { in isc_radix_search()
251 stack[cnt++] = node; in isc_radix_search()
254 if (BIT_TEST(addr[node->bit >> 3], 0x80 >> (node->bit & 0x07))) in isc_radix_search()
256 node = node->r; in isc_radix_search()
[all …]
/netbsd-src/external/mpl/bind/dist/lib/isc/
H A Dradix.c151 * if func is supplied, it will be called as func(node->data) in isc_radix_create()
152 * before deleting the node in isc_radix_create()
206 * func will be called as func(node->prefix, node->data) in isc_radix_destroy()
210 isc_radix_node_t *node;
214 RADIX_WALK(radix->head, node) { func(node->prefix, node->data); }
221 isc_radix_node_t *node; in isc_radix_process()
234 node in isc_radix_search()
216 isc_radix_node_t *node; isc_radix_process() local
227 isc_radix_node_t *node; isc_radix_search() local
298 isc_radix_node_t *node, *new_node, *parent, *glue = NULL; isc_radix_insert() local
614 isc_radix_remove(isc_radix_tree_t * radix,isc_radix_node_t * node) isc_radix_remove() argument
[all...]
/netbsd-src/external/apache2/llvm/dist/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.
366 // Intrinsic/Custom node compatibility PatFrags
369 def AMDGPUrcp : PatFrags<(ops node:$src), [(int_amdgcn_rcp node:$src),
370 (AMDGPUrcp_impl node:$src)]>;
371 def AMDGPUrcp_legacy : PatFrags<(ops node:$src), [(int_amdgcn_rcp_legacy node:$src),
372 (AMDGPUrcp_legacy_impl node:$src)]>;
374 def AMDGPUrsq : PatFrags<(ops node:$src), [(int_amdgcn_rsq node:$src),
375 (AMDGPUrsq_impl node:$src)]>;
377 def AMDGPUrsq_clamp : PatFrags<(ops node:$src), [(int_amdgcn_rsq_clamp node:$src),
[all …]
/netbsd-src/external/mit/isl/dist/include/isl/
H A Dschedule_node.h24 __isl_keep isl_schedule_node *node);
26 __isl_take isl_schedule_node *node);
32 isl_ctx *isl_schedule_node_get_ctx(__isl_keep isl_schedule_node *node);
35 __isl_keep isl_schedule_node *node);
37 __isl_keep isl_schedule_node *node);
40 __isl_keep isl_schedule_node *node);
44 __isl_keep isl_schedule_node *node,
45 isl_bool (*fn)(__isl_keep isl_schedule_node *node, void *user),
48 isl_bool isl_schedule_node_every_descendant(__isl_keep isl_schedule_node *node,
49 isl_bool (*test)(__isl_keep isl_schedule_node *node, void *user),
[all …]
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Target/
H A DTargetSelectionDAG.td96 // DAG node.
324 def node;
763 /// can match something on the DAG, from a single node to multiple nested other
934 def not : PatFrag<(ops node:$in), (xor node:$in, -1)>;
935 def vnot : PatFrag<(ops node:$in), (xor node:$in, immAllOnesV)>;
936 def ineg : PatFrag<(ops node:$in), (sub 0, node:$in)>;
938 def zanyext : PatFrags<(ops node:$op),
939 [(zext node:$op),
940 (anyext node:$op)]>;
950 def unindexedload : PatFrag<(ops node:$ptr), (ld node:$ptr)> {
[all …]

12345678910>>...111