Home
last modified time | relevance | path

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

12345678910>>...91

/f-stack/freebsd/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 …]
/f-stack/app/nginx-1.16.1/src/core/
H A Dngx_rbtree.c48 while (node != *root && ngx_rbt_is_red(node->parent)) { in ngx_rbtree_insert()
50 if (node->parent == node->parent->parent->left) { in ngx_rbtree_insert()
57 node = node->parent->parent; in ngx_rbtree_insert()
60 if (node == node->parent->right) { in ngx_rbtree_insert()
61 node = node->parent; in ngx_rbtree_insert()
77 node = node->parent->parent; in ngx_rbtree_insert()
80 if (node == node->parent->left) { in ngx_rbtree_insert()
81 node = node->parent; in ngx_rbtree_insert()
229 if (node == node->parent->left) { in ngx_rbtree_delete()
341 } else if (node == node->parent->left) { in ngx_rbtree_left_rotate()
[all …]
H A Dngx_radix_tree.c184 node = node->right; in ngx_radix32tree_delete()
187 node = node->left; in ngx_radix32tree_delete()
197 if (node->right || node->left) { in ngx_radix32tree_delete()
217 node = node->parent; in ngx_radix32tree_delete()
253 node = node->right; in ngx_radix32tree_find()
256 node = node->left; in ngx_radix32tree_find()
364 node = node->right; in ngx_radix128tree_delete()
367 node = node->left; in ngx_radix128tree_delete()
405 node = node->parent; in ngx_radix128tree_delete()
443 node = node->right; in ngx_radix128tree_find()
[all …]
H A Dngx_rbtree.h35 ngx_rbtree_node_t *node, ngx_rbtree_node_t *sentinel);
56 ngx_rbtree_node_t *node, ngx_rbtree_node_t *sentinel);
58 ngx_rbtree_node_t *node);
61 #define ngx_rbt_red(node) ((node)->color = 1) argument
62 #define ngx_rbt_black(node) ((node)->color = 0) argument
63 #define ngx_rbt_is_red(node) ((node)->color) argument
64 #define ngx_rbt_is_black(node) (!ngx_rbt_is_red(node)) argument
70 #define ngx_rbtree_sentinel_init(node) ngx_rbt_black(node) argument
76 while (node->left != sentinel) { in ngx_rbtree_min()
77 node = node->left; in ngx_rbtree_min()
[all …]
/f-stack/dpdk/lib/librte_graph/
H A Dnode.c32 struct node *node; in node_from_name() local
44 struct node *node; in node_has_duplicate_entry() local
60 struct node *node; in __rte_node_register() local
193 struct node *node; in rte_node_clone() local
207 struct node *node; in rte_node_from_name() local
219 struct node *node; in rte_node_id_to_name() local
233 struct node *node; in rte_node_edge_count() local
244 edge_update(struct node *node, struct node *prev, rte_edge_t from, in edge_update() argument
304 struct node *node; in rte_node_edge_shrink() local
365 struct node *node; in rte_node_edge_get() local
[all …]
H A Drte_graph_worker.h165 rc = node->process(graph, node, objs, node->idx); in rte_graph_walk()
170 node->process(graph, node, objs, node->idx); in rte_graph_walk()
172 node->idx = 0; in rte_graph_walk()
248 node = node->nodes[next]; in __rte_node_next_node_get()
251 return node; in __rte_node_next_node_get()
274 node = __rte_node_next_node_get(node, next); in rte_node_enqueue()
301 node = __rte_node_next_node_get(node, next); in rte_node_enqueue_x1()
331 node = __rte_node_next_node_get(node, next); in rte_node_enqueue_x2()
367 node = __rte_node_next_node_get(node, next); in rte_node_enqueue_x4()
430 node = __rte_node_next_node_get(node, next); in rte_node_next_stream_get()
[all …]
H A Dgraph_populate.c77 memset(node, 0, sizeof(*node)); in graph_nodes_populate()
79 node->off = off; in graph_nodes_populate()
80 node->process = graph_node->node->process; in graph_nodes_populate()
81 memcpy(node->name, graph_node->node->name, RTE_GRAPH_NAMESIZE); in graph_nodes_populate()
87 node->id = graph_node->node->id; in graph_nodes_populate()
100 node->next = off; in graph_nodes_populate()
110 struct rte_node *node; in graph_node_id_to_ptr() local
114 return node; in graph_node_id_to_ptr()
124 struct rte_node *node; in graph_node_name_to_ptr() local
128 return node; in graph_node_name_to_ptr()
[all …]
H A Dgraph.c44 graph_node_add(struct graph *graph, struct node *node) in graph_node_add() argument
51 if (strncmp(node->name, graph_node->node->name, in graph_node_add()
56 sz = sizeof(*graph_node) + node->nb_edges * sizeof(struct node *); in graph_node_add()
61 node->name); in graph_node_add()
64 graph_node->node = node; in graph_node_add()
76 node_to_graph_node(struct graph *graph, struct node *node) in node_to_graph_node() argument
81 if (graph_node->node == node) in node_to_graph_node()
145 struct node *node; in expand_pattern_to_node() local
428 node) { in rte_graph_node_get()
430 return node; in rte_graph_node_get()
[all …]
/f-stack/freebsd/contrib/openzfs/module/avl/
H A Davl.c161 for (node = node->avl_child[left]; in avl_walk()
163 node = node->avl_child[right]) in avl_walk()
171 node = AVL_XPARENT(node); in avl_walk()
193 for (node = tree->avl_root; node != NULL; node = node->avl_child[0]) in avl_first()
212 for (node = tree->avl_root; node != NULL; node = node->avl_child[1]) in avl_last()
268 node = node->avl_child[child]) { in avl_find()
607 node = node->avl_child[child]; in avl_insert_here()
617 node = node->avl_child[child]; in avl_insert_here()
712 node = node->avl_child[right]) in avl_remove()
1028 node = node->avl_child[0]; in avl_destroy_nodes()
[all …]
/f-stack/freebsd/kern/
H A Dsubr_pctrie.c114 pctrie_node_store(&node->pn_child[node->pn_last - 1], NULL, in pctrie_node_get()
121 return (node); in pctrie_node_get()
329 node = mem; in pctrie_zone_init()
331 memset(node->pn_child, 0, sizeof(node->pn_child)); in pctrie_zone_init()
393 pctrie_addval(node, index, node->pn_clev, val, in pctrie_insert()
397 node = tmp; in pctrie_insert()
444 node = pctrie_node_load(&node->pn_child[slot], smr, access); in _pctrie_lookup()
588 node = child; in pctrie_lookup_ge()
705 node = child; in pctrie_lookup_le()
772 node = tmp; in pctrie_remove()
[all …]
/f-stack/freebsd/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 …]
H A Dip_dstlist.c280 for (node = softd->dstlist[i + 1]; node != NULL; node = next) {
530 bzero((char *)node, sizeof(*node) + dest.fd_name);
533 node->ipfd_size = sizeof(*node) + dest.fd_name;
545 KFREES(node, node->ipfd_size);
559 KFREES(node, node->ipfd_size);
579 *node->ipfd_pnext = node;
629 KFREES(node, node->ipfd_size);
690 for (node = *d->ipld_dests; node != NULL; node = node->ipfd_next) {
745 *node->ipfd_pnext = node->ipfd_next;
747 node->ipfd_next->ipfd_pnext = node->ipfd_pnext;
[all …]
/f-stack/app/redis-5.0.5/src/
H A Dadlist.c90 listNode *node; in listAddNodeHead() local
92 if ((node = zmalloc(sizeof(*node))) == NULL) in listAddNodeHead()
97 node->prev = node->next = NULL; in listAddNodeHead()
118 if ((node = zmalloc(sizeof(*node))) == NULL) in listAddNodeTail()
123 node->prev = node->next = NULL; in listAddNodeTail()
137 if ((node = zmalloc(sizeof(*node))) == NULL) in listInsertNode()
154 node->prev->next = node; in listInsertNode()
157 node->next->prev = node; in listInsertNode()
170 node->prev->next = node->next; in listDelNode()
174 node->next->prev = node->prev; in listDelNode()
[all …]
/f-stack/dpdk/lib/librte_vhost/
H A Diotlb.c47 struct vhost_iotlb_entry *node; in vhost_user_iotlb_pending_miss() local
53 if ((node->iova == iova) && (node->perm == perm)) { in vhost_user_iotlb_pending_miss()
68 struct vhost_iotlb_entry *node; in vhost_user_iotlb_pending_insert() local
85 node->iova = iova; in vhost_user_iotlb_pending_insert()
86 node->perm = perm; in vhost_user_iotlb_pending_insert()
104 if (node->iova < iova) in vhost_user_iotlb_pending_remove()
108 if ((node->perm & perm) != node->perm) in vhost_user_iotlb_pending_remove()
226 if (iova < node->iova + node->size) { in vhost_user_iotlb_cache_remove()
251 if (iova >= node->iova + node->size) in vhost_user_iotlb_cache_find()
259 offset = iova - node->iova; in vhost_user_iotlb_cache_find()
[all …]
/f-stack/freebsd/arm64/acpica/
H A Dacpi_iort.c113 switch(node->type) { in iort_entry_get_id_mapping_index()
129 if (node->data.smmu_v3.IdMappingIndex >= node->nentries) in iort_entry_get_id_mapping_index()
231 node->usecount = 0; in iort_copy_data()
262 node->usecount = 0; in iort_copy_its()
284 node = malloc(sizeof(*node), M_DEVBUF, M_WAITOK | M_ZERO); in iort_add_nodes()
330 node = NULL; in iort_resolve_node()
334 node = np; in iort_resolve_node()
342 node = np; in iort_resolve_node()
348 node->usecount++; in iort_resolve_node()
561 if (node == NULL) in acpi_iort_map_pci_msi()
[all …]
/f-stack/dpdk/lib/librte_acl/
H A Dacl_gen.c68 RTE_ACL_VERIFY(node->dfa_gr64[i] < node->fanout); in acl_dfa_gen_idx()
201 if (node->fanout != 0) in acl_count_fanout()
202 return node->fanout; in acl_count_fanout()
213 return node->fanout; in acl_count_fanout()
231 if (node->match_flag != 0 || node->num_ptrs == 0) { in acl_count_trie_types()
258 node->fanout = n; in acl_count_trie_types()
261 node->fanout = acl_dfa_count_gr64(dfa, node->dfa_gr64); in acl_count_trie_types()
346 node->node_index = acl_dfa_gen_idx(node, index->dfa_index); in acl_gen_node()
354 node->node_type; in acl_gen_node()
365 node->node_index |= index->quad_index | node->node_type; in acl_gen_node()
[all …]
/f-stack/lib/
H A Dff_ng_base.c744 if (node->nd_type && node->nd_type->close) in ng_rmnode()
745 (*node->nd_type->close)(node); in ng_rmnode()
764 (*node->nd_type->shutdown)(node); in ng_rmnode()
847 return (node ? NG_NODE_ID(node) : 0); in ng_node2ID()
2147 node->nd_ID, node);
3304 node->nd_numhooks, node->nd_flags, in dumpnode()
3305 node->nd_refs, node->nd_name); in dumpnode()
3307 node->lastfile, node->lastline); in dumpnode()
3442 __func__, node->nd_ID, node); in ngthread()
3498 node->nd_ID, node); in ng_worklist_add()
[all …]
/f-stack/app/redis-5.0.5/deps/jemalloc/include/jemalloc/internal/
H A Drb.h469 a_type *node; \
476 int cmp = pathp->cmp = a_cmp(node, pathp->node); \
486 pathp->node = node; \
539 a_type *node; \
546 int cmp = pathp->cmp = a_cmp(node, pathp->node); \
566 assert(nodep->node == node); \
568 if (pathp->node != node) { \
584 nodep->node = pathp->node; \
585 pathp->node = node; \
883 a_field, node), cb, arg)) != NULL || (ret = cb(rbtree, node, \
[all …]
/f-stack/freebsd/netgraph/
H A Dng_base.c741 (*node->nd_type->close)(node); in ng_rmnode()
758 (*node->nd_type->shutdown)(node); in ng_rmnode()
841 return (node ? NG_NODE_ID(node) : 0); in ng_node2ID()
1956 node->nd_ID, node, ngq->q_flags); in ng_dequeue()
2140 node->nd_ID, node);
3276 node->nd_numhooks, node->nd_flags, in dumpnode()
3277 node->nd_refs, node->nd_name); in dumpnode()
3279 node->lastfile, node->lastline); in dumpnode()
3413 __func__, node->nd_ID, node); in ngthread()
3469 node->nd_ID, node); in ng_worklist_add()
[all …]
H A Dnetgraph.h400 #define _NG_NODE_NAME(node) ((node)->nd_name + 0) argument
402 #define _NG_NODE_ID(node) ((node)->nd_ID + 0) argument
404 #define _NG_NODE_UNREF(node) ng_unref_node(node) argument
406 #define _NG_NODE_PRIVATE(node) ((node)->nd_private) argument
577 #define NG_NODE_ID(node) _ng_node_id(node, _NN_) argument
578 #define NG_NODE_REF(node) _ng_node_ref(node, _NN_) argument
596 #define NG_NODE_NAME(node) _NG_NODE_NAME(node) argument
598 #define NG_NODE_ID(node) _NG_NODE_ID(node) argument
599 #define NG_NODE_REF(node) _NG_NODE_REF(node) argument
600 #define NG_NODE_UNREF(node) _NG_NODE_UNREF(node) argument
[all …]
/f-stack/tools/compat/include/netgraph/
H A Dnetgraph.h402 #define _NG_NODE_NAME(node) ((node)->nd_name + 0) argument
404 #define _NG_NODE_ID(node) ((node)->nd_ID + 0) argument
406 #define _NG_NODE_UNREF(node) ng_unref_node(node) argument
408 #define _NG_NODE_PRIVATE(node) ((node)->nd_private) argument
579 #define NG_NODE_ID(node) _ng_node_id(node, _NN_) argument
580 #define NG_NODE_REF(node) _ng_node_ref(node, _NN_) argument
598 #define NG_NODE_NAME(node) _NG_NODE_NAME(node) argument
600 #define NG_NODE_ID(node) _NG_NODE_ID(node) argument
601 #define NG_NODE_REF(node) _NG_NODE_REF(node) argument
602 #define NG_NODE_UNREF(node) _NG_NODE_UNREF(node) argument
[all …]
/f-stack/dpdk/drivers/common/dpaax/
H A Ddpaa_of.c180 d->node.node.full_name); in linear_dir()
185 d->node.node.full_name); in linear_dir()
190 d->node.node.full_name); in linear_dir()
195 d->node.node.full_name); in linear_dir()
200 d->node.node.full_name); in linear_dir()
205 d->node.node.full_name); in linear_dir()
321 return &d->node.node; in of_find_compatible_node()
369 return &d->node.node; in of_find_node_by_phandle()
385 return &d->parent->node.node; in of_get_parent()
408 return &c->node.node; in of_get_next_child()
[all …]
/f-stack/freebsd/contrib/device-tree/Bindings/
H A Dnuma.txt18 2 - numa-node-id
25 A device node is associated with a NUMA node by the presence of a
26 numa-node-id property which contains the node id of the device.
29 /* numa node 0 */
32 /* numa node 1 */
115 /* node 0 */
122 /* node 1 */
135 /* node 0 */
192 /* node 1 */
254 /* node 0 */
[all …]
/f-stack/dpdk/app/test/
H A Dtest_rib.c129 RTE_TEST_ASSERT(node == NULL, in test_insert_invalid()
138 RTE_TEST_ASSERT(node == NULL, in test_insert_invalid()
162 struct rte_rib_node *node; in test_get_fn() local
242 struct rte_rib_node *node; in test_basic() local
264 node = rte_rib_lookup(rib, ip); in test_basic()
272 RTE_TEST_ASSERT(node != NULL, in test_basic()
282 RTE_TEST_ASSERT(node == NULL, in test_basic()
285 RTE_TEST_ASSERT(node == NULL, in test_basic()
297 struct rte_rib_node *node; in test_tree_traversal() local
316 node = NULL; in test_tree_traversal()
[all …]
H A Dtest_rib6.c130 RTE_TEST_ASSERT(node == NULL, in test_insert_invalid()
139 RTE_TEST_ASSERT(node == NULL, in test_insert_invalid()
163 struct rte_rib6_node *node; in test_get_fn() local
244 struct rte_rib6_node *node; in test_basic() local
267 node = rte_rib6_lookup(rib, ip); in test_basic()
275 RTE_TEST_ASSERT(node != NULL, in test_basic()
285 RTE_TEST_ASSERT(node == NULL, in test_basic()
288 RTE_TEST_ASSERT(node == NULL, in test_basic()
300 struct rte_rib6_node *node; in test_tree_traversal() local
322 node = NULL; in test_tree_traversal()
[all …]

12345678910>>...91