| /trueos/contrib/gcc/ |
| HD | print-tree.c | 40 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 …]
|
| HD | cgraph.c | 103 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 …]
|
| HD | ipa.c | 33 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 …]
|
| HD | cgraphunit.c | 194 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 …]
|
| HD | ipa-inline.c | 223 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 …]
|
| /trueos/sys/mips/nlm/hal/ |
| HD | iomap.h | 45 #define XLP_IO_DEV(node, dev) ((dev) + (node) * 8) argument
46 #define XLP_HDR_OFFSET(node, bus, dev, fn) (((bus) << 20) | \ argument
47 ((XLP_IO_DEV(node, dev)) << 15) | ((fn) << 12))
49 #define XLP_IO_BRIDGE_OFFSET(node) XLP_HDR_OFFSET(node, 0, 0, 0) argument
51 #define XLP_IO_CIC0_OFFSET(node) XLP_HDR_OFFSET(node, 0, 0, 1) argument
52 #define XLP_IO_CIC1_OFFSET(node) XLP_HDR_OFFSET(node, 0, 0, 2) argument
53 #define XLP_IO_CIC2_OFFSET(node) XLP_HDR_OFFSET(node, 0, 0, 3) argument
54 #define XLP_IO_PIC_OFFSET(node) XLP_HDR_OFFSET(node, 0, 0, 4) argument
56 #define XLP_IO_PCIE_OFFSET(node, i) XLP_HDR_OFFSET(node, 0, 1, i) argument
57 #define XLP_IO_PCIE0_OFFSET(node) XLP_HDR_OFFSET(node, 0, 1, 0) argument
[all …]
|
| /trueos/contrib/ofed/libibverbs/src/ |
| HD | memory.c | 123 static struct ibv_mem_node *__mm_prev(struct ibv_mem_node *node) in __mm_prev() argument
125 if (node->left) { in __mm_prev()
126 node = node->left; in __mm_prev()
127 while (node->right) in __mm_prev()
128 node = node->right; in __mm_prev()
130 while (node->parent && node == node->parent->left) in __mm_prev()
131 node = node->parent; in __mm_prev()
133 node = node->parent; in __mm_prev()
136 return node; in __mm_prev()
139 static struct ibv_mem_node *__mm_next(struct ibv_mem_node *node) in __mm_next() argument
[all …]
|
| /trueos/contrib/ofed/management/infiniband-diags/src/ |
| HD | grouping.c | 150 static uint64_t xsigo_chassisguid(Node *node) in xsigo_chassisguid() argument
152 if (!is_xsigo_ca(node->sysimgguid)) { in xsigo_chassisguid()
155 if (is_xsigo_switch(node->sysimgguid)) in xsigo_chassisguid()
156 return node->sysimgguid & 0xffffffff00ffffffULL; in xsigo_chassisguid()
158 return node->sysimgguid; in xsigo_chassisguid()
161 if (!node->ports->remoteport) in xsigo_chassisguid()
162 return node->sysimgguid; in xsigo_chassisguid()
165 if (is_xsigo_leafone(node->ports->remoteport->node->sysimgguid)) in xsigo_chassisguid()
166 return node->ports->remoteport->node->sysimgguid & in xsigo_chassisguid()
169 return node->sysimgguid; in xsigo_chassisguid()
[all …]
|
| HD | ibnetdiscover.c | 122 node_type_str2(Node *node) in node_type_str2() argument
124 switch(node->type) { in node_type_str2()
164 get_node(Node *node, Port *port, ib_portid_t *portid) in get_node() argument
168 void *pi = portinfo, *ni = node->nodeinfo, *nd = node->nodedesc; in get_node()
174 mad_decode_field(ni, IB_NODE_GUID_F, &node->nodeguid); in get_node()
175 mad_decode_field(ni, IB_NODE_TYPE_F, &node->type); in get_node()
176 mad_decode_field(ni, IB_NODE_NPORTS_F, &node->numports); in get_node()
177 mad_decode_field(ni, IB_NODE_DEVID_F, &node->devid); in get_node()
178 mad_decode_field(ni, IB_NODE_VENDORID_F, &node->vendid); in get_node()
179 mad_decode_field(ni, IB_NODE_SYSTEM_GUID_F, &node->sysimgguid); in get_node()
[all …]
|
| /trueos/sys/kern/ |
| HD | subr_pctrie.c | 100 struct pctrie_node *node; in pctrie_node_get() local
102 node = allocfn(ptree); in pctrie_node_get()
103 if (node == NULL) in pctrie_node_get()
105 node->pn_owner = owner; in pctrie_node_get()
106 node->pn_count = count; in pctrie_node_get()
107 node->pn_clev = clevel; in pctrie_node_get()
109 return (node); in pctrie_node_get()
116 pctrie_node_put(struct pctrie *ptree, struct pctrie_node *node, in pctrie_node_put() argument
122 KASSERT(node->pn_count == 0, in pctrie_node_put()
123 ("pctrie_node_put: node %p has %d children", node, in pctrie_node_put()
[all …]
|
| /trueos/contrib/groff/src/roff/troff/ |
| HD | node.h | 50 struct node { struct
51 node *next; argument
52 node *last; argument
57 node(); argument
58 node(node *);
59 node(node *, statem *, int);
60 node *add_char(charinfo *, environment *, hunits *, int *, node ** = 0);
62 virtual ~node();
63 virtual node *copy() = 0;
75 virtual node *last_char_node();
[all …]
|
| /trueos/contrib/ldns/ |
| HD | radix.c | 54 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 …]
|
| HD | rbtree.c | 65 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 …]
|
| /trueos/contrib/gcc/cp/ |
| HD | ptree.c | 33 cxx_print_decl (FILE *file, tree node, int indent) in cxx_print_decl() argument
35 if (TREE_CODE (node) == FIELD_DECL) in cxx_print_decl()
37 if (DECL_MUTABLE_P (node)) in cxx_print_decl()
45 if (!CODE_CONTAINS_STRUCT (TREE_CODE (node), TS_DECL_COMMON) in cxx_print_decl()
46 || !DECL_LANG_SPECIFIC (node)) in cxx_print_decl()
49 if (TREE_CODE (node) == FUNCTION_DECL in cxx_print_decl()
50 && DECL_PENDING_INLINE_INFO (node)) in cxx_print_decl()
52 (void *) DECL_PENDING_INLINE_INFO (node)); in cxx_print_decl()
53 if (TREE_CODE (node) == TYPE_DECL in cxx_print_decl()
54 && DECL_SORTED_FIELDS (node)) in cxx_print_decl()
[all …]
|
| /trueos/sys/cddl/contrib/opensolaris/common/avl/ |
| HD | avl.c | 138 avl_node_t *node = AVL_DATA2NODE(oldnode, off); in avl_walk() local
146 if (node == NULL) in avl_walk()
155 if (node->avl_child[left] != NULL) { in avl_walk()
156 for (node = node->avl_child[left]; in avl_walk()
157 node->avl_child[right] != NULL; in avl_walk()
158 node = node->avl_child[right]) in avl_walk()
165 was_child = AVL_XCHILD(node); in avl_walk()
166 node = AVL_XPARENT(node); in avl_walk()
167 if (node == NULL) in avl_walk()
174 return (AVL_NODE2DATA(node, off)); in avl_walk()
[all …]
|
| /trueos/cddl/contrib/opensolaris/common/avl/ |
| HD | avl.c | 138 avl_node_t *node = AVL_DATA2NODE(oldnode, off); in avl_walk() local
146 if (node == NULL) in avl_walk()
155 if (node->avl_child[left] != NULL) { in avl_walk()
156 for (node = node->avl_child[left]; in avl_walk()
157 node->avl_child[right] != NULL; in avl_walk()
158 node = node->avl_child[right]) in avl_walk()
165 was_child = AVL_XCHILD(node); in avl_walk()
166 node = AVL_XPARENT(node); in avl_walk()
167 if (node == NULL) in avl_walk()
174 return (AVL_NODE2DATA(node, off)); in avl_walk()
[all …]
|
| /trueos/contrib/unbound/util/ |
| HD | rbtree.c | 62 static void rbtree_rotate_left(rbtree_t *rbtree, rbnode_t *node);
64 static void rbtree_rotate_right(rbtree_t *rbtree, rbnode_t *node);
66 static void rbtree_insert_fixup(rbtree_t *rbtree, rbnode_t *node);
107 rbtree_rotate_left(rbtree_t *rbtree, rbnode_t *node) in rbtree_rotate_left() argument
109 rbnode_t *right = node->right; in rbtree_rotate_left()
110 node->right = right->left; in rbtree_rotate_left()
112 right->left->parent = node; in rbtree_rotate_left()
114 right->parent = node->parent; in rbtree_rotate_left()
116 if (node->parent != RBTREE_NULL) { in rbtree_rotate_left()
117 if (node == node->parent->left) { in rbtree_rotate_left()
[all …]
|
| /trueos/contrib/llvm/include/llvm/Target/ |
| HD | TargetSelectionDAG.td | 80 // DAG node.
276 def node;
527 // node is matched.
546 /// DAG, from a single node to multiple nested other fragments.
598 def not : PatFrag<(ops node:$in), (xor node:$in, -1)>;
599 def vnot : PatFrag<(ops node:$in), (xor node:$in, immAllOnesV)>;
600 def ineg : PatFrag<(ops node:$in), (sub 0, node:$in)>;
610 def unindexedload : PatFrag<(ops node:$ptr), (ld node:$ptr), [{
613 def load : PatFrag<(ops node:$ptr), (unindexedload node:$ptr), [{
618 def extload : PatFrag<(ops node:$ptr), (unindexedload node:$ptr), [{
[all …]
|
| /trueos/contrib/dtc/ |
| HD | livetree.c | 100 struct node *build_node(struct property *proplist, struct node *children) in build_node()
102 struct node *new = xmalloc(sizeof(*new)); in build_node()
103 struct node *child; in build_node()
117 struct node *build_node_delete(void) in build_node_delete()
119 struct node *new = xmalloc(sizeof(*new)); in build_node_delete()
128 struct node *name_node(struct node *node, char *name) in name_node() argument
130 assert(node->name == NULL); in name_node()
132 node->name = name; in name_node()
134 return node; in name_node()
137 struct node *merge_nodes(struct node *old_node, struct node *new_node) in merge_nodes()
[all …]
|
| HD | checks.c | 43 typedef void (*tree_check_fn)(struct check *c, struct node *dt);
44 typedef void (*node_check_fn)(struct check *c, struct node *dt, struct node *node);
45 typedef void (*prop_check_fn)(struct check *c, struct node *dt,
46 struct node *node, struct property *prop);
125 static void check_nodes_props(struct check *c, struct node *dt, struct node *node) in check_nodes_props() argument
127 struct node *child; in check_nodes_props()
130 TRACE(c, "%s", node->fullpath); in check_nodes_props()
132 c->node_fn(c, dt, node); in check_nodes_props()
135 for_each_property(node, prop) { in check_nodes_props()
136 TRACE(c, "%s\t'%s'", node->fullpath, prop->name); in check_nodes_props()
[all …]
|
| /trueos/contrib/libucl/src/ |
| HD | tree.h | 69 #define TREE_DEFINE(node, field) \ argument
71 struct node *TREE_BALANCE_##node##_##field(struct node *); \
73 struct node *TREE_ROTL_##node##_##field(struct node *self) \
75 struct node *r= self->field.avl_right; \
77 r->field.avl_left= TREE_BALANCE_##node##_##field(self); \
78 return TREE_BALANCE_##node##_##field(r); \
81 struct node *TREE_ROTR_##node##_##field(struct node *self) \
83 struct node *l= self->field.avl_left; \
85 l->field.avl_right= TREE_BALANCE_##node##_##field(self); \
86 return TREE_BALANCE_##node##_##field(l); \
[all …]
|
| /trueos/sys/ofed/include/linux/ |
| HD | linux_radix.c | 58 struct radix_tree_node *node; in radix_tree_lookup() local
63 node = root->rnode; in radix_tree_lookup()
67 while (height && node) in radix_tree_lookup()
68 node = node->slots[radix_pos(index, height--)]; in radix_tree_lookup()
69 if (node) in radix_tree_lookup()
70 item = node->slots[radix_pos(index, 0)]; in radix_tree_lookup()
80 struct radix_tree_node *node; in radix_tree_delete() local
86 node = root->rnode; in radix_tree_delete()
93 while (height && node) { in radix_tree_delete()
94 stack[height] = node; in radix_tree_delete()
[all …]
|
| /trueos/contrib/ipfilter/ |
| HD | ipf_rb.h | 38 rotate_left(struct _n##_rb_head *head, _t *node) \
42 parent = node->_f.parent; \
43 tmp1 = node->_f.right; \
45 node->_f.right = tmp2; \
47 tmp2->_f.parent = node; \
50 else if (parent->_f.right == node) \
54 tmp1->_f.left = node; \
56 node->_f.parent = tmp1; \
60 rotate_right(struct _n##_rb_head *head, _t *node) \
64 parent = node->_f.parent; \
[all …]
|
| /trueos/sys/contrib/ipfilter/netinet/ |
| HD | ipf_rb.h | 38 rotate_left(struct _n##_rb_head *head, _t *node) \
42 parent = node->_f.parent; \
43 tmp1 = node->_f.right; \
45 node->_f.right = tmp2; \
47 tmp2->_f.parent = node; \
50 else if (parent->_f.right == node) \
54 tmp1->_f.left = node; \
56 node->_f.parent = tmp1; \
60 rotate_right(struct _n##_rb_head *head, _t *node) \
64 parent = node->_f.parent; \
[all …]
|
| /trueos/contrib/llvm/lib/Target/SystemZ/ |
| HD | SystemZOperators.td | 176 def z_scmp : PatFrag<(ops node:$a, node:$b), (z_icmp node:$a, node:$b, imm), [{
180 def z_ucmp : PatFrag<(ops node:$a, node:$b), (z_icmp node:$a, node:$b, imm), [{
186 def z_tm_reg : PatFrag<(ops node:$a, node:$b), (z_tm node:$a, node:$b, imm)>;
187 def z_tm_mem : PatFrag<(ops node:$a, node:$b), (z_tm node:$a, node:$b, 0)>;
190 def sext8 : PatFrag<(ops node:$src), (sext_inreg node:$src, i8)>;
191 def sext16 : PatFrag<(ops node:$src), (sext_inreg node:$src, i16)>;
192 def sext32 : PatFrag<(ops node:$src), (sext (i32 node:$src))>;
195 def zext8 : PatFrag<(ops node:$src), (and node:$src, 0xff)>;
196 def zext16 : PatFrag<(ops node:$src), (and node:$src, 0xffff)>;
197 def zext32 : PatFrag<(ops node:$src), (zext (i32 node:$src))>;
[all …]
|