Home
last modified time | relevance | path

Searched refs:nb_edges (Results 1 – 16 of 16) sorted by relevance

/dpdk/lib/graph/
H A Dnode.c94 node->nb_edges = reg->nb_edges; in __rte_node_register()
96 for (i = 0; i < reg->nb_edges; i++) { in __rte_node_register()
164 reg->nb_edges = node->nb_edges; in node_clone()
229 return node->nb_edges; in rte_node_edge_count()
244 from = node->nb_edges; in edge_update()
247 if (from > node->nb_edges) { in edge_update()
256 max_edges = from + nb_edges; in edge_update()
283 node->nb_edges = max_edges; in edge_update()
300 if (node->nb_edges < size) { in rte_node_edge_shrink()
304 node->nb_edges = size; in rte_node_edge_shrink()
[all …]
H A Dgraph_populate.c39 sz += sizeof(struct rte_node *) * graph_node->node->nb_edges; in graph_fp_mem_calc_size()
69 rte_edge_t count, nb_edges; in graph_nodes_populate() local
87 nb_edges = graph_node->node->nb_edges; in graph_nodes_populate()
88 node->nb_edges = nb_edges; in graph_nodes_populate()
91 for (count = 0; count < nb_edges; count++) in graph_nodes_populate()
96 off += sizeof(struct rte_node *) * nb_edges; in graph_nodes_populate()
141 for (val = 0; val < node->nb_edges; val++) { in graph_node_nexts_populate()
H A Dgraph_debug.c38 fprintf(f, " nb_edges=%d\n", n->nb_edges); in node_dump()
40 for (i = 0; i < n->nb_edges; i++) in node_dump()
72 fprintf(f, " nb_edges=%" PRId32 "\n", n->nb_edges); in rte_graph_obj_dump()
78 for (i = 0; i < n->nb_edges; i++) in rte_graph_obj_dump()
H A Dgraph_ops.c20 for (i = 0; i < node->nb_edges; i++) { in node_has_loop_edge()
70 for (i = 0; i < graph_node->node->nb_edges; i++) { in graph_node_has_edge_to_src_node()
125 for (i = 0; i < v->node->nb_edges; i++) { in graph_bfs()
151 if (graph_node->node->nb_edges == 0) in graph_has_isolated_node()
H A Dgraph.c56 sz = sizeof(*graph_node) + node->nb_edges * sizeof(struct node *); in graph_node_add()
98 for (i = 0; i < graph_node->node->nb_edges; i++) { in graph_node_edges_add()
122 for (i = 0; i < graph_node->node->nb_edges; i++) { in graph_adjacency_list_update()
507 for (i = 0; i < graph_node->node->nb_edges; i++) { in graph_to_dot()
H A Drte_graph.h436 rte_edge_t nb_edges; /**< Number of edges from this node. */ member
543 const char **next_nodes, uint16_t nb_edges);
H A Drte_graph_worker.h60 rte_edge_t nb_edges; /**< Number of edges from this node. */ member
246 RTE_ASSERT(next < node->nb_edges); in __rte_node_next_node_get()
H A Dgraph_private.h57 rte_edge_t nb_edges; /**< Number of edges from this node. */ member
/dpdk/app/test/
H A Dtest_graph.c87 uint16_t nb_edges; member
106 .nb_edges = 2,
117 .nb_edges = 1,
126 .nb_edges = 1,
135 .nb_edges = 1,
155 .nb_edges = 2,
497 if (count != tm->test_node[i].node.nb_edges) { in test_lookup_functions()
596 tm->test_node[0].node.nb_edges); in test_update_edges()
597 if (count != tm->test_node[0].node.nb_edges) { in test_update_edges()
606 tm->test_node[i].node.nb_edges); in test_update_edges()
[all …]
H A Dtest_graph_perf.c94 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()
/dpdk/lib/node/
H A Dethdev_tx.c73 .nb_edges = ETHDEV_TX_NEXT_MAX,
H A Dpkt_cls.c214 .nb_edges = PKT_CLS_NEXT_MAX,
H A Dip4_lookup.c228 .nb_edges = RTE_NODE_IP4_LOOKUP_NEXT_MAX,
H A Dethdev_rx.c216 .nb_edges = ETHDEV_RX_NEXT_MAX,
H A Dip4_rewrite.c334 .nb_edges = 1,
/dpdk/doc/guides/prog_guide/
H A Dgraph_lib.rst104 nb_edges:
150 …de the ``next_nodes[]`` at the node registration time. See ``struct rte_node_register::nb_edges``.