Home
last modified time | relevance | path

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

12345678910

/dpdk/lib/graph/
H A Dnode.c31 struct node *node; in node_from_name() local
43 struct node *node; in node_has_duplicate_entry() local
59 struct node *node; in __rte_node_register() local
184 struct node *node; in rte_node_clone() local
198 struct node *node; in rte_node_from_name() local
210 struct node *node; in rte_node_id_to_name() local
224 struct node *node; in rte_node_edge_count() local
235 edge_update(struct node *node, struct node *prev, rte_edge_t from, in edge_update() argument
293 struct node *node; in rte_node_edge_shrink() local
354 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.c75 memset(node, 0, sizeof(*node)); in graph_nodes_populate()
77 node->off = off; in graph_nodes_populate()
78 node->process = graph_node->node->process; in graph_nodes_populate()
79 memcpy(node->name, graph_node->node->name, RTE_GRAPH_NAMESIZE); in graph_nodes_populate()
85 node->id = graph_node->node->id; in graph_nodes_populate()
98 node->next = off; in graph_nodes_populate()
108 struct rte_node *node; in graph_node_id_to_ptr() local
112 return node; in graph_node_id_to_ptr()
122 struct rte_node *node; in graph_node_name_to_ptr() local
126 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 …]
H A Dgraph_ops.c14 node_has_loop_edge(struct node *node) in node_has_loop_edge() argument
20 for (i = 0; i < node->nb_edges; i++) { in node_has_loop_edge()
21 if (strncmp(node->name, node->next_nodes[i], in node_has_loop_edge()
23 name = node->name; in node_has_loop_edge()
66 struct node *node; in graph_node_has_edge_to_src_node() local
71 node = graph_node->adjacency_list[i]->node; in graph_node_has_edge_to_src_node()
72 if (node->flags & RTE_NODE_SOURCE_F) in graph_node_has_edge_to_src_node()
76 graph_node->node->name, node->name); in graph_node_has_edge_to_src_node()
151 if (graph_node->node->nb_edges == 0) in graph_has_isolated_node()
154 graph_node->node->name); in graph_has_isolated_node()
[all …]
H A Dgraph_stats.c142 struct rte_node *node; in stats_mem_populate() local
152 if (node == NULL) in stats_mem_populate()
177 if (node == NULL) in stats_mem_populate()
335 struct rte_node *node; in cluster_node_arregate_stats() local
397 node->ts = 0; in rte_graph_cluster_stats_reset()
398 node->calls = 0; in rte_graph_cluster_stats_reset()
399 node->objs = 0; in rte_graph_cluster_stats_reset()
400 node->cycles = 0; in rte_graph_cluster_stats_reset()
401 node->prev_ts = 0; in rte_graph_cluster_stats_reset()
402 node->prev_calls = 0; in rte_graph_cluster_stats_reset()
[all …]
H A Drte_graph.h100 struct rte_node *node, void **objs,
120 struct rte_node *node);
136 struct rte_node *node);
343 #define rte_graph_foreach_node(count, off, graph, node) \ argument
345 node = RTE_PTR_ADD(graph, off); \
347 off = node->next, node = RTE_PTR_ADD(graph, off), count++)
454 rte_node_t __rte_node_register(const struct rte_node_register *node);
465 #define RTE_NODE_REGISTER(node) \ argument
466 RTE_INIT(rte_node_register_##node) \
468 node.parent_id = RTE_NODE_ID_INVALID; \
[all …]
/dpdk/drivers/common/cnxk/
H A Droc_nix_tm.c113 TAILQ_FOREACH(node, list, node) { in nix_tm_txsch_reg_config()
356 TAILQ_FOREACH(node, list, node) { in nix_tm_bp_config_set()
420 TAILQ_FOREACH(node, list, node) { in nix_tm_bp_config_get()
507 if (!node || !nix_tm_is_leaf(nix, node->lvl) || !node->parent || in nix_tm_leaf_data_get()
922 nix_tm_hwlvl2str(node->hw_lvl), hw_id, node->lvl, node->id, in nix_tm_free_node_resource()
1002 TAILQ_REMOVE(list, node, node); in nix_tm_node_delete()
1006 nix_tm_hwlvl2str(node->hw_lvl), node->lvl, node->id, in nix_tm_node_delete()
1007 node->priority, node->weight, in nix_tm_node_delete()
1621 next_node = TAILQ_NEXT(node, node); in nix_tm_free_resources()
1645 node->id, node); in nix_tm_free_resources()
[all …]
H A Droc_nix_tm_ops.c309 if (!node) in roc_nix_tm_node_pkt_mode_update()
385 TAILQ_FOREACH(node, list, node) { in roc_nix_smq_flush()
400 TAILQ_FOREACH(node, list, node) { in roc_nix_smq_flush()
454 TAILQ_FOREACH(node, list, node) { in roc_nix_tm_hierarchy_disable()
506 TAILQ_FOREACH(node, list, node) { in roc_nix_tm_hierarchy_disable()
610 TAILQ_FOREACH(node, list, node) { in roc_nix_tm_hierarchy_enable()
619 TAILQ_FOREACH(node, list, node) { in roc_nix_tm_hierarchy_enable()
632 TAILQ_FOREACH(node, list, node) { in roc_nix_tm_hierarchy_enable()
645 TAILQ_FOREACH(node, list, node) { in roc_nix_tm_hierarchy_enable()
766 if (!node || nix_tm_is_leaf(nix, node->lvl)) in roc_nix_tm_node_shaper_update()
[all …]
H A Droc_nix_tm_utils.c121 TAILQ_FOREACH(node, list, node) { in nix_tm_node_search()
365 TAILQ_FOREACH(node, list, node) { in nix_tm_check_rr()
440 TAILQ_FOREACH(node, list, node) { in nix_tm_validate_prio()
550 parent, node->lvl, node->id, child, rr_prio, node); in nix_tm_topology_reg_prep()
669 nix_tm_hwlvl2str(node->hw_lvl), schq, node->lvl, node->id, in nix_tm_sched_reg_prep()
730 nix_tm_hwlvl2str(node->hw_lvl), schq, node->lvl, node->id, in nix_tm_shaper_reg_prep()
732 node->pkt_mode, node); in nix_tm_shaper_reg_prep()
845 node); in nix_tm_sw_xoff_prep()
995 TAILQ_FOREACH(node, list, node) { in roc_nix_tm_leaf_cnt()
1090 if (!node || node->free_fn == NULL) in nix_tm_node_free()
[all …]
H A Dcnxk_telemetry_nix.c28 TAILQ_FOREACH(node, &nix_list, node) { in nix_tel_node_get()
45 if (node) { in nix_tel_node_add()
54 if (!node) in nix_tel_node_add()
58 node->rqs = in nix_tel_node_add()
60 node->cqs = in nix_tel_node_add()
62 node->sqs = in nix_tel_node_add()
64 TAILQ_INSERT_TAIL(&nix_list, node, node); in nix_tel_node_add()
74 TAILQ_FOREACH(node, &nix_list, node) { in nix_tel_node_del()
79 TAILQ_REMOVE(&nix_list, node, node); in nix_tel_node_del()
91 TAILQ_FOREACH(node, &nix_list, node) { in nix_tel_node_get_by_pcidev_name()
[all …]
/dpdk/lib/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 …]
H A Dacl_bld.c174 return node; in acl_alloc_node()
194 node->mrt); in acl_free_node()
195 node->mrt = NULL; in acl_free_node()
202 node->ptrs); in acl_free_node()
269 if (node->num_ptrs >= node->max_ptrs) { in acl_add_ptr()
279 node->ptrs); in acl_add_ptr()
286 for (n = node->min_add; n < node->max_ptrs; n++) { in acl_add_ptr()
443 if (node != NULL && node->ptrs[index].ptr != NULL) { in acl_deref_ptr()
791 prev = node; in acl_gen_full_range()
879 prev = node; in acl_gen_range_trie()
[all …]
/dpdk/lib/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
89 node->iova = iova; in vhost_user_iotlb_pending_insert()
90 node->perm = perm; in vhost_user_iotlb_pending_insert()
109 if (node->iova < iova) in vhost_user_iotlb_pending_remove()
113 if ((node->perm & perm) != node->perm) in vhost_user_iotlb_pending_remove()
236 if (iova < node->iova + node->size) { in vhost_user_iotlb_cache_remove()
261 if (iova >= node->iova + node->size) in vhost_user_iotlb_cache_find()
269 offset = iova - node->iova; in vhost_user_iotlb_cache_find()
[all …]
/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 …]
/dpdk/app/test/
H A Dtest_rib.c146 RTE_TEST_ASSERT(node == NULL, in test_insert_invalid()
155 RTE_TEST_ASSERT(node == NULL, in test_insert_invalid()
179 struct rte_rib_node *node; in test_get_fn() local
259 struct rte_rib_node *node; in test_basic() local
281 node = rte_rib_lookup(rib, ip); in test_basic()
289 RTE_TEST_ASSERT(node != NULL, in test_basic()
299 RTE_TEST_ASSERT(node == NULL, in test_basic()
302 RTE_TEST_ASSERT(node == NULL, in test_basic()
314 struct rte_rib_node *node; in test_tree_traversal() local
333 node = NULL; in test_tree_traversal()
[all …]
H A Dtest_rib6.c147 RTE_TEST_ASSERT(node == NULL, in test_insert_invalid()
156 RTE_TEST_ASSERT(node == NULL, in test_insert_invalid()
180 struct rte_rib6_node *node; in test_get_fn() local
261 struct rte_rib6_node *node; in test_basic() local
284 node = rte_rib6_lookup(rib, ip); in test_basic()
292 RTE_TEST_ASSERT(node != NULL, in test_basic()
302 RTE_TEST_ASSERT(node == NULL, in test_basic()
305 RTE_TEST_ASSERT(node == NULL, in test_basic()
317 struct rte_rib6_node *node; in test_tree_traversal() local
339 node = NULL; in test_tree_traversal()
[all …]
H A Dtest_graph.c33 struct rte_node *node, void **objs,
37 struct rte_node *node, void **objs,
93 struct test_node_register node; member
103 .node = {
114 .node = {
123 .node = {
132 .node = {
146 *(uint32_t *)node->ctx = node->id; in node_init()
683 struct rte_node *node; in test_graph_lookup_functions() local
688 if (!node) { in test_graph_lookup_functions()
[all …]
H A Dtest_graph_perf.c83 rte_node_t nid = node->id; in test_node_ctx_init()
94 node->ctx[0] = node->nb_edges; in test_node_ctx_init()
96 node->ctx[i + 1] = edge; in test_node_ctx_init()
117 rte_node_next_stream_get(graph, node, node->ctx[i + 1], count); in test_perf_node_worker_source()
118 rte_node_next_stream_put(graph, node, node->ctx[i + 1], count); in test_perf_node_worker_source()
147 rte_node_next_stream_get(graph, node, node->ctx[i + 1], count); in test_perf_node_worker_source_burst_one()
148 rte_node_next_stream_put(graph, node, node->ctx[i + 1], count); in test_perf_node_worker_source_burst_one()
174 if (node->ctx[0] == 1) { in test_perf_node_worker()
175 rte_node_next_stream_move(graph, node, node->ctx[1]); in test_perf_node_worker()
181 next = node->ctx[i + 1]; in test_perf_node_worker()
[all …]
/dpdk/drivers/net/mvpp2/
H A Dmrvl_tm.c105 while (node) { in mrvl_tm_deinit()
110 node = next; in mrvl_tm_deinit()
160 if (!node) in mrvl_node_type_get()
325 if (!node) in mrvl_node_capabilities_get()
655 if (node) in mrvl_node_add()
661 if (!node) in mrvl_node_add()
715 if (!node) in mrvl_node_delete()
778 if (!node) in mrvl_node_suspend()
824 if (!node) in mrvl_node_resume()
982 if (!node) in mrvl_node_stats_read()
[all …]
/dpdk/drivers/net/dpaa2/
H A Ddpaa2_tm.c47 while (node) { in dpaa2_tm_deinit()
51 rte_free(node); in dpaa2_tm_deinit()
52 node = next; in dpaa2_tm_deinit()
63 return node; in dpaa2_node_from_id()
196 if (!node) in dpaa2_node_capabilities_get()
246 if (!node) in dpaa2_node_type_get()
478 if (node) in dpaa2_node_add()
484 if (!node) in dpaa2_node_add()
542 if (!node) in dpaa2_node_delete()
559 rte_free(node); in dpaa2_node_delete()
[all …]
/dpdk/doc/guides/prog_guide/
H A Dgraph_lib.rst64 Anatomy of a node
68 A node consists of:
99 It is the name of the node. When a node registers to graph library, the library
101 node. ``rte_node_from_name()``, ``rte_node_id_to_name()`` are the node
117 node should not be current node itself or a source node.
119 Source node:
163 of the node and creates a new one. The name for cloned node shall be
283 pointer from current node's stream to next node's stream could be avoided.
316 7. Update the ``node->ctx`` with more probable next node.
372 This node is an intermediate node that does LPM lookup for the received
[all …]
/dpdk/drivers/bus/dpaa/include/
H A Ddpaa_rbtree.h52 struct rb_node *node = tree->head; \
53 if (!node) { \
58 while (node) { \
63 if (tree->head == node) \
67 obj->node_field.prev = node->prev; \
68 obj->node_field.next = node; \
69 node->prev = &obj->node_field; \
72 node = node->next; \
105 struct rb_node *node = tree->head; \
106 while (node) { \
[all …]
/dpdk/examples/server_node_efd/server/
H A Dmain.c220 flush_rx_queue(uint16_t node) in flush_rx_queue() argument
223 struct node *cl; in flush_rx_queue()
225 if (cl_rx_buf[node].count == 0) in flush_rx_queue()
228 cl = &nodes[node]; in flush_rx_queue()
230 cl_rx_buf[node].count, NULL) != cl_rx_buf[node].count){ in flush_rx_queue()
235 cl->stats.rx += cl_rx_buf[node].count; in flush_rx_queue()
237 cl_rx_buf[node].count = 0; in flush_rx_queue()
247 cl_rx_buf[node].buffer[cl_rx_buf[node].count++] = buf; in enqueue_rx_packet()
262 uint8_t node; in process_packets() local
282 if (node >= num_nodes) { in process_packets()
[all …]
/dpdk/drivers/net/ice/base/
H A Dice_sched.c180 if (!node) in ice_sched_add_node()
349 if (pi->sib_head[node->tc_num][node->tx_sched_layer] == node) in ice_free_sched_node()
350 pi->sib_head[node->tc_num][node->tx_sched_layer] = in ice_free_sched_node()
1152 node = node->children[0]; in ice_rm_dflt_leaf_node()
1190 node = node->children[0]; in ice_sched_rm_dflt_nodes()
1319 if (!node) in ice_sched_get_node()
1570 node = node->sibling; in ice_sched_get_vsi_node()
1602 node = node->sibling; in ice_sched_get_agg_node()
1709 node = node->sibling; in ice_sched_add_vsi_child_nodes()
1754 node = node->sibling; in ice_sched_calc_vsi_support_nodes()
[all …]

12345678910