Home
last modified time | relevance | path

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

1234567

/dpdk/lib/graph/
H A Dnode.c29 struct node *
32 struct node *node; in node_from_name() local
34 STAILQ_FOREACH(node, &node_list, next) in node_from_name()
35 if (strncmp(node->name, name, RTE_NODE_NAMESIZE) == 0) in node_from_name()
36 return node; in node_from_name()
44 struct node *node; in node_has_duplicate_entry() local
47 STAILQ_FOREACH(node, &node_list, next) { in node_has_duplicate_entry()
48 if (strncmp(node in node_has_duplicate_entry()
60 struct node *node; __rte_node_register() local
119 node_clone(struct node * node,const char * name) node_clone() argument
162 struct node *node; rte_node_clone() local
176 struct node *node; rte_node_from_name() local
188 struct node *node; rte_node_id_to_name() local
202 struct node *node; rte_node_edge_count() local
213 edge_update(struct node * node,struct node * prev,rte_edge_t from,const char ** next_nodes,rte_edge_t nb_edges) edge_update() argument
271 struct node *node; rte_node_edge_shrink() local
318 node_copy_edges(struct node * node,char * next_nodes[]) node_copy_edges() argument
332 struct node *node; rte_node_edge_get() local
355 struct node *node; node_scan_dump() local
[all...]
H A Drte_graph_worker_common.h57 rte_graph_off_t nodes_start; /**< Offset at which node memory starts. */
90 * Data structure to hold node data.
95 rte_graph_off_t next; /**< Index to next node. */
98 rte_edge_t nb_edges; /**< Number of edges from this node. */
101 char parent[RTE_NODE_NAMESIZE]; /**< Parent node name. */
102 char name[RTE_NODE_NAMESIZE]; /**< Name of the node. */
132 rte_graph_off_t off; /**< Offset of node in the graph reel. */
133 uint64_t total_cycles; /**< Cycles spent in this node. */
134 uint64_t total_calls; /**< Calls done to this node. */
135 uint64_t total_objs; /**< Objects processed by this node
177 __rte_node_process(struct rte_graph * graph,struct rte_node * node) __rte_node_process() argument
210 __rte_node_enqueue_tail_update(struct rte_graph * graph,struct rte_node * node) __rte_node_enqueue_tail_update() argument
237 __rte_node_enqueue_prologue(struct rte_graph * graph,struct rte_node * node,const uint16_t idx,const uint16_t space) __rte_node_enqueue_prologue() argument
263 __rte_node_next_node_get(struct rte_node * node,rte_edge_t next) __rte_node_next_node_get() argument
289 rte_node_enqueue(struct rte_graph * graph,struct rte_node * node,rte_edge_t next,void ** objs,uint16_t nb_objs) rte_node_enqueue() argument
315 rte_node_enqueue_x1(struct rte_graph * graph,struct rte_node * node,rte_edge_t next,void * obj) rte_node_enqueue_x1() argument
344 rte_node_enqueue_x2(struct rte_graph * graph,struct rte_node * node,rte_edge_t next,void * obj0,void * obj1) rte_node_enqueue_x2() argument
378 rte_node_enqueue_x4(struct rte_graph * graph,struct rte_node * node,rte_edge_t next,void * obj0,void * obj1,void * obj2,void * obj3) rte_node_enqueue_x4() argument
411 rte_node_enqueue_next(struct rte_graph * graph,struct rte_node * node,rte_edge_t * nexts,void ** objs,uint16_t nb_objs) rte_node_enqueue_next() argument
440 rte_node_next_stream_get(struct rte_graph * graph,struct rte_node * node,rte_edge_t next,uint16_t nb_objs) rte_node_next_stream_get() argument
470 rte_node_next_stream_put(struct rte_graph * graph,struct rte_node * node,rte_edge_t next,uint16_t idx) rte_node_next_stream_put() argument
[all...]
H A Dgraph_populate.c35 /* For 0..N node objects with fence */ in graph_fp_mem_calc_size()
40 sz += sizeof(struct rte_node *) * graph_node->node->nb_edges; in graph_fp_mem_calc_size()
44 /* For 0..N node objects with xstats */ in graph_fp_mem_calc_size()
46 if (graph_node->node->xstats == NULL)
49 sz += sizeof(uint64_t) * graph_node->node->xstats->nb_xstats; in graph_header_popluate()
85 struct rte_node *node = RTE_PTR_ADD(graph, off); in graph_nodes_populate()
86 memset(node, 0, sizeof(*node)); in graph_nodes_populate()
87 node->fence = RTE_GRAPH_FENCE; in graph_nodes_populate()
88 node in graph_nodes_populate()
75 struct rte_node *node = RTE_PTR_ADD(graph, off); graph_nodes_populate() local
114 struct rte_node *node; graph_node_id_to_ptr() local
128 struct rte_node *node; graph_node_name_to_ptr() local
142 struct rte_node *node; graph_node_nexts_populate() local
165 struct rte_node *node; graph_src_nodes_populate() local
226 struct rte_node *node; graph_nodes_mem_destroy() local
[all...]
H A Drte_graph_model_mcore_dispatch.c79 __graph_sched_node_enqueue(struct rte_node *node, struct rte_graph *graph) in __graph_sched_node_enqueue() argument
89 size = RTE_MIN(node->idx, RTE_DIM(wq_node->objs)); in __graph_sched_node_enqueue()
90 wq_node->node_off = node->off; in __graph_sched_node_enqueue()
92 rte_memcpy(wq_node->objs, &node->objs[off], size * sizeof(void *)); in __graph_sched_node_enqueue()
99 node->dispatch.total_sched_objs += size; in __graph_sched_node_enqueue()
100 node->idx -= size; in __graph_sched_node_enqueue()
101 if (node->idx > 0) in __graph_sched_node_enqueue()
108 memmove(&node->objs[0], &node->objs[off], in __graph_sched_node_enqueue()
109 node->idx * sizeof(void *)); in __graph_sched_node_enqueue()
111 node->dispatch.total_sched_fail += node->idx; in __graph_sched_node_enqueue()
[all …]
H A Dgraph_ops.c15 node_has_loop_edge(struct node *node) in node_has_loop_edge() argument
21 for (i = 0; i < node->nb_edges; i++) { in node_has_loop_edge()
22 if (strncmp(node->name, node->next_nodes[i], in node_has_loop_edge()
24 name = node->name; in node_has_loop_edge()
40 if (node_has_loop_edge(graph_node->node)) in graph_node_has_loop_edge()
53 if (graph_node->node->flags & RTE_NODE_SOURCE_F) in graph_src_nodes_count()
67 struct node *node; in graph_node_has_edge_to_src_node() local
71 for (i = 0; i < graph_node->node->nb_edges; i++) { in graph_node_has_edge_to_src_node()
72 node = graph_node->adjacency_list[i]->node; in graph_node_has_edge_to_src_node()
73 if (node->flags & RTE_NODE_SOURCE_F) in graph_node_has_edge_to_src_node()
[all …]
H A Dgraph.c95 graph_node_add(struct graph *graph, struct node *node) in graph_node_add() argument
102 if (strncmp(node->name, graph_node->node->name, in graph_node_add()
106 /* Allocate new graph node object */ in graph_node_add()
107 sz = sizeof(*graph_node) + node->nb_edges * sizeof(struct node *); in graph_node_add()
112 node->name); in graph_node_add()
114 /* Initialize the graph node */ in graph_node_add()
115 graph_node->node in graph_node_add()
127 node_to_graph_node(struct graph * graph,struct node * node) node_to_graph_node() argument
196 struct node *node; expand_pattern_to_node() local
266 struct rte_node *node; graph_mem_fixup_node_ctx() local
646 struct rte_node *node; rte_graph_node_get() local
669 struct rte_node *node; rte_graph_node_get_by_name() local
689 __rte_node_stream_alloc(struct rte_graph * graph,struct rte_node * node) __rte_node_stream_alloc() argument
704 __rte_node_stream_alloc_size(struct rte_graph * graph,struct rte_node * node,uint16_t req_size) __rte_node_stream_alloc_size() argument
[all...]
H A Dgraph_stats.c23 /* Capture same node ID across cluster */
224 rte_node_t id = graph_node->node->id; in stats_mem_populate()
226 struct rte_node *node; in stats_mem_populate()
232 /* Iterate over cluster node array to find node ID match */ in stats_mem_populate()
234 /* Found an existing node in the reel */ in stats_mem_populate()
236 node = graph_node_id_to_ptr(graph, id); in stats_mem_populate()
237 if (node == NULL) in stats_mem_populate()
240 "Failed to find node %s in graph %s", in stats_mem_populate()
241 graph_node->node in stats_mem_populate()
204 struct rte_node *node; stats_mem_populate() local
400 struct rte_node *node; cluster_node_arregate_stats() local
471 struct rte_graph_cluster_node_stats *node = &cluster->stat; rte_graph_cluster_stats_reset() local
[all...]
H A Drte_graph_model_mcore_dispatch.h11 * These APIs allow to set core affinity with the node and only used for mcore
33 * Schedule the node to the right graph's work queue for mcore dispatch model.
35 * @param node
36 * Pointer to the scheduled node object.
47 bool __rte_noinline __rte_graph_mcore_dispatch_sched_node_enqueue(struct rte_node *node,
65 * Set lcore affinity with the node used for mcore dispatch model.
68 * Valid node name. In the case of the cloned node, the name will be
69 * "parent node name" + "-" + name.
94 struct rte_node *node; in rte_graph_walk_mcore_dispatch() local
[all...]
H A Drte_graph.h12 * "node" and "link" them together to create a complex "graph" to enable
16 * dump and destroy on graph and node operations such as clone,
18 * cluster to monitor per graph and per node stats.
31 #define RTE_NODE_NAMESIZE 64 /**< Max length of node name. */
32 #define RTE_NODE_XSTAT_DESC_SIZE 64 /**< Max length of node xstat description. */
35 #define RTE_NODE_ID_INVALID UINT32_MAX /**< Invalid node id. */
82 * @param node
83 * Pointer to the node object.
95 struct rte_node *node, void **objs,
105 * @param node
390 rte_graph_foreach_node(count,off,graph,node) global() argument
505 RTE_NODE_REGISTER(node) global() argument
[all...]
/dpdk/lib/vhost/
H A Diotlb.c57 vhost_user_iotlb_set_dump(struct virtio_net *dev, struct vhost_iotlb_entry *node) in vhost_user_iotlb_set_dump() argument
61 start = node->uaddr + node->uoffset; in vhost_user_iotlb_set_dump()
62 mem_set_dump(dev, (void *)(uintptr_t)start, node->size, true, RTE_BIT64(node->page_shift)); in vhost_user_iotlb_set_dump()
66 vhost_user_iotlb_clear_dump(struct virtio_net *dev, struct vhost_iotlb_entry *node, in vhost_user_iotlb_clear_dump() argument
71 start = node->uaddr + node->uoffset; in vhost_user_iotlb_clear_dump()
72 end = start + node->size; in vhost_user_iotlb_clear_dump()
75 if (vhost_user_iotlb_share_page(prev, node)) in vhost_user_iotlb_clear_dump()
76 start = RTE_ALIGN_CEIL(start, RTE_BIT64(node->page_shift)); in vhost_user_iotlb_clear_dump()
79 if (vhost_user_iotlb_share_page(node, next)) in vhost_user_iotlb_clear_dump()
80 end = RTE_ALIGN_FLOOR(end, RTE_BIT64(node->page_shift)); in vhost_user_iotlb_clear_dump()
[all …]
/dpdk/lib/acl/
H A Dacl_gen.c61 acl_dfa_gen_idx(const struct rte_acl_node *node, uint32_t index) in acl_dfa_gen_idx() argument
67 for (i = 0; i != RTE_DIM(node->dfa_gr64); i++) { in acl_dfa_gen_idx()
68 RTE_ACL_VERIFY(node->dfa_gr64[i] < RTE_ACL_DFA_GR64_NUM); in acl_dfa_gen_idx()
69 RTE_ACL_VERIFY(node->dfa_gr64[i] < node->fanout); in acl_dfa_gen_idx()
70 idx |= (i - node->dfa_gr64[i]) << in acl_dfa_gen_idx()
74 return idx << (CHAR_BIT * sizeof(index)) | index | node->node_type; in acl_dfa_gen_idx()
78 acl_dfa_fill_gr64(const struct rte_acl_node *node, in acl_dfa_fill_gr64() argument
83 for (i = 0; i != RTE_DIM(node->dfa_gr64); i++) { in acl_dfa_fill_gr64()
84 memcpy(dst + node->dfa_gr64[i] * RTE_ACL_DFA_GR64_SIZE, in acl_dfa_fill_gr64()
113 acl_node_fill_dfa(const struct rte_acl_node *node, in acl_node_fill_dfa() argument
[all …]
H A Dacl_bld.c78 uint32_t node; member
102 struct rte_acl_node *node, int index);
162 struct rte_acl_node *node; in acl_alloc_node() local
165 node = context->node_free_list; in acl_alloc_node()
166 context->node_free_list = node->next; in acl_alloc_node()
167 memset(node, 0, sizeof(struct rte_acl_node)); in acl_alloc_node()
169 node = acl_build_alloc(context, sizeof(struct rte_acl_node), 1); in acl_alloc_node()
172 if (node != NULL) { in acl_alloc_node()
173 node->num_ptrs = 0; in acl_alloc_node()
174 node->level = level; in acl_alloc_node()
[all …]
/dpdk/drivers/common/dpaax/
H A Ddpaa_of.c64 f->node.is_file = 1; in process_file()
65 strlcpy(f->node.node.name, dent->d_name, NAME_MAX); in process_file()
66 snprintf(f->node.node.full_name, PATH_MAX, "%s/%s", in process_file()
67 parent->node.node.full_name, dent->d_name); in process_file()
69 fd = of_open_file(f->node.node.full_name); in process_file()
82 list_add_tail(&f->node.list, &parent->files); in process_file()
89 struct dt_node, node); in node2dir()
90 const struct dt_dir *d = container_of(dn, struct dt_dir, node); in node2dir()
122 strlcpy(subdir->node.node.name, d[loop]->d_name, in iterate_dir()
124 snprintf(subdir->node.node.full_name, PATH_MAX, in iterate_dir()
[all …]
/dpdk/app/test/
H A Dtest_rib.c119 struct rte_rib_node *node, *node1; in test_insert_invalid() local
128 node = rte_rib_insert(NULL, ip, depth); in test_insert_invalid()
129 RTE_TEST_ASSERT(node == NULL, in test_insert_invalid()
137 node = rte_rib_insert(rib, ip, MAX_DEPTH + 1); in test_insert_invalid()
138 RTE_TEST_ASSERT(node == NULL, in test_insert_invalid()
142 node = rte_rib_insert(rib, ip, depth); in test_insert_invalid()
143 RTE_TEST_ASSERT(node != NULL, "Failed to insert rule\n"); in test_insert_invalid()
162 struct rte_rib_node *node; in test_get_fn() local
179 node = rte_rib_insert(rib, ip, depth); in test_get_fn()
180 RTE_TEST_ASSERT(node != NULL, "Failed to insert rule\n"); in test_get_fn()
[all …]
H A Dtest_graph.c34 struct rte_node *node, void **objs,
38 struct rte_node *node, void **objs,
42 struct rte_node *node, void **objs,
46 struct rte_node *node, void **objs,
50 struct rte_node *node, void **objs,
94 struct test_node_register node; member
104 .node = {
115 .node = {
124 .node = {
133 .node = {
[all …]
H A Dtest_graph_perf.c78 test_node_ctx_init(const struct rte_graph *graph, struct rte_node *node) in test_node_ctx_init() argument
83 rte_node_t nid = node->id; in test_node_ctx_init()
94 node->ctx[0] = node->nb_edges; in test_node_ctx_init()
95 for (i = 0; i < node->nb_edges && !node_data->is_sink; i++, edge++) { in test_node_ctx_init()
96 node->ctx[i + 1] = edge; in test_node_ctx_init()
97 node->ctx[i + 9] = node_data->next_percentage[i]; in test_node_ctx_init()
105 test_perf_node_worker_source(struct rte_graph *graph, struct rte_node *node, in test_perf_node_worker_source() argument
115 for (i = 0; i < node->ctx[0]; i++) { in test_perf_node_worker_source()
116 count = (node->ctx[i + 9] * RTE_GRAPH_BURST_SIZE) / 100; in test_perf_node_worker_source()
117 rte_node_next_stream_get(graph, node, node->ctx[i + 1], count); in test_perf_node_worker_source()
[all …]
/dpdk/drivers/bus/dpaa/include/
H A Ddpaa_rbtree.h52 struct rb_node *node = tree->head; \
53 if (!node) { \
58 while (node) { \
59 type *item = QMAN_NODE2OBJ(node, type, node_field); \
63 if (tree->head == node) \
66 node->prev->next = &obj->node_field; \
67 obj->node_field.prev = node->prev; \
68 obj->node_field.next = node; \
69 node->prev = &obj->node_field; \
72 node = node->next; \
[all …]
/dpdk/examples/server_node_efd/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()
229 if (rte_ring_enqueue_bulk(cl->rx_q, (void **)cl_rx_buf[node].buffer, in flush_rx_queue()
230 cl_rx_buf[node].count, NULL) != cl_rx_buf[node].count){ in flush_rx_queue()
231 for (j = 0; j < cl_rx_buf[node].count; j++) in flush_rx_queue()
232 rte_pktmbuf_free(cl_rx_buf[node].buffer[j]); in flush_rx_queue()
233 cl->stats.rx_drop += cl_rx_buf[node].count; in flush_rx_queue()
235 cl->stats.rx += cl_rx_buf[node].count; in flush_rx_queue()
[all …]
/dpdk/lib/node/
H A Dkernel_rx.c109 kernel_rx_node_do(struct rte_graph *graph, struct rte_node *node, kernel_rx_node_ctx_t *ctx) in kernel_rx_node_do() argument
124 nb_cnt = (node->size >= RTE_GRAPH_BURST_SIZE) ? RTE_GRAPH_BURST_SIZE : node->size; in kernel_rx_node_do()
126 mbufs = (struct rte_mbuf **)node->objs; in kernel_rx_node_do()
143 m->port = node->id; in kernel_rx_node_do()
150 recv_pkt_parse(node->objs, count); in kernel_rx_node_do()
151 node->idx = count; in kernel_rx_node_do()
154 rte_node_next_stream_move(graph, node, next_index); in kernel_rx_node_do()
164 kernel_rx_node_process(struct rte_graph *graph, struct rte_node *node, void **objs, in kernel_rx_node_process() argument
167 kernel_rx_node_ctx_t *ctx = (kernel_rx_node_ctx_t *)node->ctx; in kernel_rx_node_process()
182 return kernel_rx_node_do(graph, node, ctx); in kernel_rx_node_process()
[all …]
H A Dkernel_tx.c20 kernel_tx_process_mbuf(struct rte_node *node, struct rte_mbuf **mbufs, uint16_t cnt) in kernel_tx_process_mbuf() argument
22 kernel_tx_node_ctx_t *ctx = (kernel_tx_node_ctx_t *)node->ctx; in kernel_tx_process_mbuf()
44 kernel_tx_node_process(struct rte_graph *graph __rte_unused, struct rte_node *node, void **objs, in kernel_tx_node_process() argument
65 kernel_tx_process_mbuf(node, pkts, PREFETCH_CNT); in kernel_tx_node_process()
72 kernel_tx_process_mbuf(node, pkts, 1); in kernel_tx_node_process()
84 kernel_tx_node_init(const struct rte_graph *graph __rte_unused, struct rte_node *node) in kernel_tx_node_init() argument
86 kernel_tx_node_ctx_t *ctx = (kernel_tx_node_ctx_t *)node->ctx; in kernel_tx_node_init()
96 kernel_tx_node_fini(const struct rte_graph *graph __rte_unused, struct rte_node *node) in kernel_tx_node_fini() argument
98 kernel_tx_node_ctx_t *ctx = (kernel_tx_node_ctx_t *)node->ctx; in kernel_tx_node_fini()
H A Dpkt_cls.c45 pkt_cls_node_process(struct rte_graph *graph, struct rte_node *node, in pkt_cls_node_process() argument
68 ctx = (struct pkt_cls_node_ctx *)node->ctx; in pkt_cls_node_process()
73 to_next = rte_node_next_stream_get(graph, node, in pkt_cls_node_process()
122 rte_node_enqueue_x1(graph, node, in pkt_cls_node_process()
132 rte_node_enqueue_x1(graph, node, in pkt_cls_node_process()
142 rte_node_enqueue_x1(graph, node, in pkt_cls_node_process()
152 rte_node_enqueue_x1(graph, node, in pkt_cls_node_process()
162 rte_node_next_stream_put(graph, node, in pkt_cls_node_process()
170 to_next = rte_node_next_stream_get(graph, node, in pkt_cls_node_process()
201 rte_node_enqueue_x1(graph, node, in pkt_cls_node_process()
[all …]
H A Dip6_rewrite.c34 ip6_rewrite_node_process(struct rte_graph *graph, struct rte_node *node, in ip6_rewrite_node_process() argument
39 const int dyn = IP6_REWRITE_NODE_PRIV1_OFF(node->ctx); in ip6_rewrite_node_process()
50 next_index = IP6_REWRITE_NODE_LAST_NEXT(node->ctx); in ip6_rewrite_node_process()
61 to_next = rte_node_next_stream_get(graph, node, next_index, nb_objs); in ip6_rewrite_node_process()
144 rte_node_enqueue_x1(graph, node, next0, in ip6_rewrite_node_process()
154 rte_node_enqueue_x1(graph, node, next1, in ip6_rewrite_node_process()
164 rte_node_enqueue_x1(graph, node, next2, in ip6_rewrite_node_process()
174 rte_node_enqueue_x1(graph, node, next3, in ip6_rewrite_node_process()
183 rte_node_next_stream_put(graph, node, in ip6_rewrite_node_process()
190 graph, node, next_index, nb_objs); in ip6_rewrite_node_process()
[all …]
/dpdk/lib/eal/common/
H A Deal_common_uuid.c19 uint8_t node[6]; member
51 memcpy(out+10, uu->node, 6); in uuid_pack()
77 memcpy(uu->node, ptr, 6); in uuid_unpack()
110 return memcmp(uuid1.node, uuid2.node, 6); in rte_uuid_compare()
148 uuid.node[i] = strtoul(buf, NULL, 16); in rte_uuid_parse()
165 uuid.node[0], uuid.node[1], uuid.node[2], in rte_uuid_unparse()
166 uuid.node[3], uuid.node[4], uuid.node[5]); in rte_uuid_unparse()
/dpdk/drivers/net/txgbe/
H A Dtxgbe_fdir.c794 struct txgbe_fdir_filter *node; in txgbe_fdir_filter_program() local
850 node = txgbe_fdir_filter_lookup(info, &rule->input); in txgbe_fdir_filter_program()
851 if (node) { in txgbe_fdir_filter_program()
856 node->fdirflags = rule->fdirflags; in txgbe_fdir_filter_program()
857 node->fdirhash = fdirhash; in txgbe_fdir_filter_program()
858 node->queue = queue; in txgbe_fdir_filter_program()
860 node = rte_zmalloc("txgbe_fdir", in txgbe_fdir_filter_program()
862 if (!node) in txgbe_fdir_filter_program()
864 rte_memcpy(&node->input, &rule->input, in txgbe_fdir_filter_program()
866 node->fdirflags = rule->fdirflags; in txgbe_fdir_filter_program()
[all …]
/dpdk/lib/rib/
H A Drte_rib.c56 is_valid_node(const struct rte_rib_node *node) in is_valid_node() argument
58 return (node->flag & RTE_RIB_VALID_NODE) == RTE_RIB_VALID_NODE; in is_valid_node()
62 is_right_node(const struct rte_rib_node *node) in is_right_node() argument
64 return node->parent->right == node; in is_right_node()
77 get_nxt_node(struct rte_rib_node *node, uint32_t ip) in get_nxt_node() argument
79 if (node->depth == RIB_MAXDEPTH) in get_nxt_node()
81 return (ip & (1 << (31 - node->depth))) ? node->right : node->left; in get_nxt_node()
350 rte_rib_get_ip(const struct rte_rib_node *node, uint32_t *ip) in rte_rib_get_ip() argument
352 if (unlikely(node == NULL || ip == NULL)) { in rte_rib_get_ip()
356 *ip = node->ip; in rte_rib_get_ip()
[all …]

1234567