Home
last modified time | relevance | path

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

12345678910>>...66

/freebsd-12.1/contrib/gcc/
H A Dprint-tree.c40 tree node; member
130 TREE_INT_CST_HIGH (node), TREE_INT_CST_LOW (node)); in print_node_brief()
215 if (b->node == node) in print_node()
223 b->node = node; in print_node()
273 if (!TYPE_P (node) && TREE_SIDE_EFFECTS (node)) in print_node()
276 if (TYPE_P (node) ? TYPE_READONLY (node) : TREE_READONLY (node)) in print_node()
278 if (!TYPE_P (node) && TREE_CONSTANT (node)) in print_node()
280 else if (TYPE_P (node) && TYPE_SIZES_GIMPLIFIED (node)) in print_node()
443 || DECL_INLINE (node) || DECL_BUILT_IN (node)) in print_node()
606 TYPE_ALIGN (node), TYPE_SYMTAB_ADDRESS (node), in print_node()
[all …]
H A Dcgraph.c216 node->master_clone = node; in cgraph_node()
227 node->origin->nested = node; in cgraph_node()
228 node->master_clone = node; in cgraph_node()
289 for (node = cgraph_nodes; node ; node = node->next) in cgraph_node_for_asm()
550 node->previous->next = node->next; in cgraph_remove_node()
710 if (node->master_clone && node->master_clone->uid != node->uid) in dump_cgraph_node()
717 if (node->global.insns && node->global.insns != node->local.self_insns) in dump_cgraph_node()
780 for (node = cgraph_nodes; node; node = node->next) in dump_cgraph()
816 for (node = cgraph_varpool_nodes; node; node = node->next_needed) in dump_varpool()
871 for (node = cgraph_varpool_nodes; node ; node = node->next) in cgraph_varpool_node_for_asm()
[all …]
H A Dipa.c45 for (node = cgraph_nodes; node; node = node->next) in cgraph_postorder()
47 for (node = cgraph_nodes; node; node = node->next) in cgraph_postorder()
50 node2 = node; in cgraph_postorder()
54 node->aux = node->callers; in cgraph_postorder()
86 for (node = cgraph_nodes; node; node = node->next) in cgraph_postorder()
110 for (node = cgraph_nodes; node; node = node->next) in cgraph_remove_unreachable_nodes()
113 for (node = cgraph_nodes; node; node = node->next) in cgraph_remove_unreachable_nodes()
114 if (node->needed && !node->global.inlined_to in cgraph_remove_unreachable_nodes()
154 for (node = cgraph_nodes; node; node = next) in cgraph_remove_unreachable_nodes()
169 if (!node->analyzed || !DECL_EXTERNAL (node->decl) in cgraph_remove_unreachable_nodes()
[all …]
H A Dcgraphunit.c863 for (node = cgraph_nodes; node; node = node->next) in verify_cgraph()
1018 for (node = cgraph_nodes; node != first; node = node->next) in process_function_and_variable_attributes()
1106 for (node = cgraph_nodes; node != first_analyzed; node = node->next) in cgraph_finalize_compilation_unit()
1156 for (node = cgraph_nodes; node != first_analyzed; node = node->next) in cgraph_finalize_compilation_unit()
1202 for (node = cgraph_nodes; node; node = node->next) in cgraph_mark_functions_to_output()
1452 for (node = cgraph_nodes; node; node = node->next) in cgraph_function_and_variable_visibility()
1494 for (node = cgraph_nodes; node; node = node->next) in cgraph_function_and_variable_visibility()
1499 for (node = cgraph_nodes; node; node = node->next) in cgraph_function_and_variable_visibility()
1518 for (node = cgraph_node (decl); node; node = node->next_clone) in cgraph_preserve_function_body_p()
1622 for (node = cgraph_nodes; node; node = node->next) in cgraph_optimize()
[all …]
/freebsd-12.1/sys/dev/ocs_fc/
H A Docs_device.c70 ocs_node_t *node = io->node; in ocs_d_send_prli_rsp() local
124 if (node->init && !node->targ) { in __ocs_d_initiate_shutdown()
127 node->display_name, node->wwpn, node->wwnn); in __ocs_d_initiate_shutdown()
140 node->display_name, node->wwpn, node->wwnn); in __ocs_d_initiate_shutdown()
153 node->display_name, node->wwpn, node->wwnn); in __ocs_d_initiate_shutdown()
201 if (!node->init && !node->targ){ in __ocs_d_initiate_shutdown()
478 ocs_node_t *node = io->node; in ocs_send_ls_acc_after_attach() local
528 ocs_node_t *node = io->node; in ocs_process_abts() local
1630 node->wwpn, node->wwnn); in __ocs_d_device_ready()
1636 node->wwpn, node->wwnn); in __ocs_d_device_ready()
[all …]
H A Docs_node.c120 ocs_node_t *node = rnode->node; in ocs_remote_node_cb() local
357 return node->attached ? node : NULL; in ocs_node_get_instance()
403 ocs_memset(node, 0, sizeof(*node)); in ocs_node_alloc()
442 node->rnode.node = node; in ocs_node_alloc()
443 node->sm.app = node; in ocs_node_alloc()
639 ocs_node_build_eui_name(node->wwpn, sizeof(node->wwpn), ocs_node_get_wwpn(node)); in ocs_node_attach()
640 ocs_node_build_eui_name(node->wwnn, sizeof(node->wwnn), ocs_node_get_wwnn(node)); in ocs_node_attach()
741 node->display_name, node->ls_acc_oxid); in ocs_node_send_ls_io_cleanup()
827 if (node->sport->enable_ini && node->targ) { in __ocs_node_shutdown()
1401 if ((node->evtdepth == 0) && node->req_free) { in ocs_node_post_event()
[all …]
H A Docs_fabric.c174 node->els_req_cnt--; in __ocs_fabric_flogi_wait_rsp()
194 ocs_domain_attach(node->sport->domain, node->sport->p2p_port_id); in __ocs_fabric_flogi_wait_rsp()
235 node->els_req_cnt--; in __ocs_fabric_flogi_wait_rsp()
315 node->els_req_cnt--; in __ocs_fabric_fdisc_wait_rsp()
329 node->els_req_cnt--; in __ocs_fabric_fdisc_wait_rsp()
493 node->els_req_cnt--; in __ocs_ns_plogi_wait_rsp()
662 node->els_req_cnt--; in __ocs_ns_rftid_wait_rsp()
709 node->els_req_cnt--; in __ocs_ns_rffid_wait_rsp()
762 node->els_req_cnt--; in __ocs_ns_gidpt_wait_rsp()
1217 node = ctx->app; in __ocs_fabric_common()
[all …]
H A Docs_node.h49 #define node_printf(node, fmt, ...) ocs_log_debug(node->ocs, "[%s] " fmt, node->display_name, ##__V… argument
52 ocs_node_t *node = NULL; \
54 node = ctx->app; \
55 ocs_assert(node, NULL); \
56 ocs = node->ocs; \
61 ocs_strncpy(node->prev_state_name, node->current_state_name, sizeof(node->prev_state_name)); \
64 node->prev_evt = node->current_evt; \
65 node->current_evt = evt;
100 ocs_assert(node); in ocs_node_hold_frames()
118 ocs_assert(node); in ocs_node_accept_frames()
[all …]
/freebsd-12.1/sys/mips/nlm/hal/
H A Diomap.h47 #define XLP_IO_DEV(node, dev) ((dev) + (node) * 8) argument
53 #define XLP_IO_CIC0_OFFSET(node) XLP_HDR_OFFSET(node, 0, 0, 1) argument
54 #define XLP_IO_CIC1_OFFSET(node) XLP_HDR_OFFSET(node, 0, 0, 2) argument
55 #define XLP_IO_CIC2_OFFSET(node) XLP_HDR_OFFSET(node, 0, 0, 3) argument
56 #define XLP_IO_PIC_OFFSET(node) XLP_HDR_OFFSET(node, 0, 0, 4) argument
59 #define XLP_IO_PCIE0_OFFSET(node) XLP_HDR_OFFSET(node, 0, 1, 0) argument
60 #define XLP_IO_PCIE1_OFFSET(node) XLP_HDR_OFFSET(node, 0, 1, 1) argument
61 #define XLP_IO_PCIE2_OFFSET(node) XLP_HDR_OFFSET(node, 0, 1, 2) argument
72 #define XLP_IO_NAE_OFFSET(node) XLP_HDR_OFFSET(node, 0, 3, 0) argument
73 #define XLP_IO_POE_OFFSET(node) XLP_HDR_OFFSET(node, 0, 3, 1) argument
[all …]
/freebsd-12.1/contrib/ofed/libibverbs/
H A Dmemory.c180 node = node->left; in __mm_prev()
182 node = node->right; in __mm_prev()
185 node = node->parent; in __mm_prev()
187 node = node->parent; in __mm_prev()
196 node = node->right; in __mm_next()
198 node = node->left; in __mm_next()
201 node = node->parent; in __mm_next()
203 node = node->parent; in __mm_next()
349 node = node->right; in __mm_add()
351 node = node->left; in __mm_add()
[all …]
/freebsd-12.1/sys/kern/
H A Dsubr_pctrie.c93 if (node == NULL) in pctrie_node_get()
99 return (node); in pctrie_node_get()
264 node = mem; in pctrie_zone_init()
265 memset(node->pn_child, 0, sizeof(node->pn_child)); in pctrie_zone_init()
322 pctrie_addval(node, index, node->pn_clev, val); in pctrie_insert()
326 node = node->pn_child[slot]; in pctrie_insert()
370 node = node->pn_child[slot]; in pctrie_lookup()
482 node = child; in pctrie_lookup_ge()
595 node = child; in pctrie_lookup_le()
650 node = node->pn_child[slot]; in pctrie_remove()
[all …]
/freebsd-12.1/contrib/dtc/
H A Dlivetree.c128 struct node *name_node(struct node *node, char *name) in name_node() argument
219 struct node *chain_node(struct node *first, struct node *list) in chain_node()
282 node = node->next_sibling; in delete_node_by_name()
400 struct node **node) in get_property_by_label() argument
492 struct node *child, *node; in get_node_by_label() local
512 struct node *child, *node; in get_node_by_phandle() local
735 struct node *node; in build_and_name_child_node() local
773 struct node *an, struct node *node, in generate_label_tree_internal() argument
856 struct node *node) in generate_fixups_tree_internal() argument
900 struct node *lfn, struct node *node, in add_local_fixup_entry() argument
[all …]
/freebsd-12.1/contrib/ldns/
H A Dradix.c346 return node->data?node:NULL; in ldns_radix_search()
368 node = node->array[byte].edge; in ldns_radix_search()
462 node = node->array[byte].edge; in ldns_radix_find_less_equal()
528 node = node->parent; in ldns_radix_next()
564 node = node->parent; in ldns_radix_prev()
866 if (node->len + need > node->capacity) { in ldns_radix_array_space()
899 memset(&node->array[node->len], 0, in ldns_radix_array_space()
930 assert(node->len <= node->capacity); in ldns_radix_array_grow()
1535 while (n < node->len && node->array[node->len-1-n].edge == NULL) { in ldns_radix_node_array_free_end()
1560 if (node->len <= node->capacity/2 && node->len != node->capacity) { in ldns_radix_array_reduce()
[all …]
H A Drbtree.c190 node = node->parent; in ldns_rbtree_insert_fixup()
215 node = node->parent; in ldns_rbtree_insert_fixup()
260 node = node->left; in ldns_rbtree_insert()
262 node = node->right; in ldns_rbtree_insert()
533 node = node->left; in ldns_rbtree_find_less_equal()
537 node = node->right; in ldns_rbtree_find_less_equal()
553 for (node = rbtree->root; node->left != LDNS_RBTREE_NULL; node = node->left); in ldns_rbtree_first()
564 for (node = rbtree->root; node->right != LDNS_RBTREE_NULL; node = node->right); in ldns_rbtree_last()
582 node = node->left); in ldns_rbtree_next()
601 for (node = node->left; in ldns_rbtree_previous()
[all …]
/freebsd-12.1/contrib/ofed/libibnetdisc/
H A Dchassis.c120 node->ch_slotnum, node->ch_anafanum); in ibnd_get_chassis_slot_str()
207 if (!node->ports || !node->ports[1]) in xsigo_chassisguid()
742 chassis->linenode[node->ch_slotnum] = node; in insert_mellanox_line_and_spine()
749 chassis->spinenode[node->ch_slotnum] = node; in insert_mellanox_line_and_spine()
865 if (is_spine_9288(node) || is_spine_2012(node)) in get_spine_index()
920 if (!(node && is_line(node))) in pass_on_lines_catch_spines()
1162 ibnd_node_t *node = port->node; in voltaire_portmap() local
1255 for (node = fabric->switches; node; node = node->type_next) { in group_nodes()
1270 for (node = fabric->switches; node; node = node->type_next) { in group_nodes()
1287 for (node = fabric->nodes; node; node = node->next) { in group_nodes()
[all …]
/freebsd-12.1/contrib/gcc/cp/
H A Dptree.c37 if (DECL_MUTABLE_P (node)) in cxx_print_decl()
57 if ((TREE_CODE (node) == FUNCTION_DECL || TREE_CODE (node) == VAR_DECL) in cxx_print_decl()
66 switch (TREE_CODE (node)) in cxx_print_type()
74 TEMPLATE_TYPE_IDX (node), TEMPLATE_TYPE_LEVEL (node), in cxx_print_type()
92 if (TYPE_PTRMEMFUNC_P (node)) in cxx_print_type()
96 if (! CLASS_TYPE_P (node)) in cxx_print_type()
107 if (TYPE_HAS_CONVERSION (node)) in cxx_print_type()
109 if (TYPE_HAS_INIT_REF (node)) in cxx_print_type()
129 if (TYPE_BINFO (node)) in cxx_print_type()
171 switch (TREE_CODE (node)) in cxx_print_xnode()
[all …]
/freebsd-12.1/sys/cddl/contrib/opensolaris/common/avl/
H A Davl.c157 for (node = node->avl_child[left]; in avl_walk()
159 node = node->avl_child[right]) in avl_walk()
167 node = AVL_XPARENT(node); in avl_walk()
189 for (node = tree->avl_root; node != NULL; node = node->avl_child[0]) in avl_first()
208 for (node = tree->avl_root; node != NULL; node = node->avl_child[1]) in avl_last()
264 node = node->avl_child[child]) { in avl_find()
603 node = node->avl_child[child]; in avl_insert_here()
613 node = node->avl_child[child]; in avl_insert_here()
720 node = node->avl_child[right]) in avl_remove()
1036 node = node->avl_child[0]; in avl_destroy_nodes()
[all …]
/freebsd-12.1/contrib/ntp/lib/isc/
H A Dradix.c231 func(node->prefix, node->data); in isc_radix_process()
267 node = node->r; in isc_radix_search()
269 node = node->l; in isc_radix_search()
275 if (node && node->prefix) in isc_radix_search()
338 node->l = node->r = NULL; in isc_radix_insert()
383 node = node->r; in isc_radix_insert()
387 node = node->l; in isc_radix_insert()
574 } else if (node->parent->r == node) { in isc_radix_insert()
601 } else if (node->parent->r == node) { in isc_radix_insert()
620 if (node->r && node->l) { in isc_radix_remove()
[all …]
/freebsd-12.1/contrib/unbound/util/
H A Drbtree.c178 node = node->parent->parent; in rbtree_insert_fixup()
182 node = node->parent; in rbtree_insert_fixup()
207 node = node->parent; in rbtree_insert_fixup()
247 node = node->left; in rbtree_insert()
249 node = node->right; in rbtree_insert()
534 node = node->left; in rbtree_find_less_equal()
538 node = node->right; in rbtree_find_less_equal()
553 for (node = rbtree->root; node->left != RBTREE_NULL; node = node->left); in rbtree_first()
562 for (node = rbtree->root; node->right != RBTREE_NULL; node = node->right); in rbtree_last()
577 for (node = node->right; node->left != RBTREE_NULL; node = node->left); in rbtree_next()
[all …]
/freebsd-12.1/contrib/libucl/src/
H A Dtree.h78 static struct node *_HU_FUNCTION(TREE_BALANCE_##node##_##field)(struct node *); \
80 static struct node *_HU_FUNCTION(TREE_ROTL_##node##_##field)(struct node *self) \
88 static struct node *_HU_FUNCTION(TREE_ROTR_##node##_##field)(struct node *self) \
96 static struct node *_HU_FUNCTION(TREE_BALANCE_##node##_##field)(struct node *self) \
122 (struct node *self, struct node *elm, int (*compare)(struct node *lhs, struct node *rhs)) \
133 static struct node *_HU_FUNCTION(TREE_FIND_##node##_##field) \
134 (struct node *self, struct node *elm, int (*compare)(struct node *lhs, struct node *rhs)) \
146 static struct node *_HU_FUNCTION(TREE_MOVE_RIGHT)(struct node *self, struct node *rhs) \
155 (struct node *self, struct node *elm, int (*compare)(struct node *lhs, struct node *rhs)) \
174 (struct node *self, void (*function)(struct node *node, void *data), void *data) \
[all …]
/freebsd-12.1/contrib/llvm/lib/Target/X86/
H A DX86InstrFragmentsSIMD.td798 (X86masked_gather node:$src1, node:$src2, node:$src3) , [{
804 (X86masked_gather node:$src1, node:$src2, node:$src3) , [{
810 (X86masked_gather node:$src1, node:$src2, node:$src3) , [{
815 (X86masked_gather node:$src1, node:$src2, node:$src3) , [{
820 (X86masked_gather node:$src1, node:$src2, node:$src3) , [{
825 (X86masked_gather node:$src1, node:$src2, node:$src3) , [{
831 (X86masked_scatter node:$src1, node:$src2, node:$src3) , [{
837 (X86masked_scatter node:$src1, node:$src2, node:$src3) , [{
1043 PatFrag<(ops node:$src1, node:$src2, node:$src3),
1048 PatFrag<(ops node:$src1, node:$src2, node:$src3),
[all …]
/freebsd-12.1/sys/compat/linuxkpi/common/src/
H A Dlinux_radix.c71 node = node->slots[radix_pos(index, height--)]; in radix_tree_lookup()
72 if (node) in radix_tree_lookup()
89 if (node == NULL) in radix_tree_iter_find()
110 node = next; in radix_tree_iter_find()
137 node = node->slots[radix_pos(index, height--)]; in radix_tree_delete()
140 if (node) in radix_tree_delete()
148 node->count--; in radix_tree_delete()
226 node = node->slots[idx]; in radix_tree_insert()
250 node->count++; in radix_tree_insert()
251 node = node->slots[idx]; in radix_tree_insert()
[all …]
/freebsd-12.1/tests/sys/cddl/zfs/tests/acl/nontrivial/
H A Dzfs_acl_chmod_rwacl_001_pos.ksh74 typeset node=$1
92 typeset node=$1
106 after_cnt=$(count_ACE $node)
126 typeset node=$1
139 typeset node=$1
161 typeset node=$1
183 typeset node=$1
205 typeset node=$1
222 typeset node=$1
252 typeset func node
[all …]
/freebsd-12.1/sys/contrib/ipfilter/netinet/
H A Dipf_rb.h97 *p = node; \
149 while ((node == &_n##_rb_zero || node->_f.colour == C_BLACK) && \
235 node = node->_f.right; \
311 node = node->_f.left; \
316 while ((node->_f.parent->_f.right == node) && \
319 node = node->_f.parent; \
323 for (node = node->_f.parent->_f.right; node != &_n##_rb_zero;\
324 node = node->_f.left) \
341 _t *node; \
348 node = node->_f.left; \
[all …]
/freebsd-12.1/contrib/ipfilter/
H A Dipf_rb.h97 *p = node; \
149 while ((node == &_n##_rb_zero || node->_f.colour == C_BLACK) && \
235 node = node->_f.right; \
311 node = node->_f.left; \
316 while ((node->_f.parent->_f.right == node) && \
319 node = node->_f.parent; \
323 for (node = node->_f.parent->_f.right; node != &_n##_rb_zero;\
324 node = node->_f.left) \
341 _t *node; \
348 node = node->_f.left; \
[all …]

12345678910>>...66