Home
last modified time | relevance | path

Searched refs:rte_edge_t (Results 1 – 14 of 14) sorted by relevance

/dpdk/lib/graph/
H A Dnode.c60 rte_edge_t i; in __rte_node_register()
145 rte_edge_t i; in node_clone()
221 rte_edge_t
234 static rte_edge_t
236 const char **next_nodes, rte_edge_t nb_edges) in edge_update()
238 rte_edge_t i, max_edges, count = 0; in edge_update()
289 rte_edge_t
292 rte_edge_t rc = RTE_EDGE_ID_INVALID; in rte_node_edge_shrink()
315 rte_edge_t
319 rte_edge_t rc = RTE_EDGE_ID_INVALID; in rte_node_edge_update()
[all …]
H A Drte_graph.h46 typedef uint16_t rte_edge_t; /**< Edge id type. */ typedef
436 rte_edge_t nb_edges; /**< Number of edges from this node. */
523 rte_edge_t rte_node_edge_count(rte_node_t id);
542 rte_edge_t rte_node_edge_update(rte_node_t id, rte_edge_t from,
557 rte_edge_t rte_node_edge_shrink(rte_node_t id, rte_edge_t size);
629 rte_edge_is_invalid(rte_edge_t id) in rte_edge_is_invalid()
H A Drte_graph_worker.h60 rte_edge_t nb_edges; /**< Number of edges from this node. */
244 __rte_node_next_node_get(struct rte_node *node, rte_edge_t next) in __rte_node_next_node_get()
272 rte_edge_t next, void **objs, uint16_t nb_objs) in rte_node_enqueue()
299 rte_edge_t next, void *obj) in rte_node_enqueue_x1()
329 rte_edge_t next, void *obj0, void *obj1) in rte_node_enqueue_x2()
364 rte_edge_t next, void *obj0, void *obj1, void *obj2, in rte_node_enqueue_x4()
398 rte_edge_t *nexts, void **objs, uint16_t nb_objs) in rte_node_enqueue_next()
428 rte_edge_t next, uint16_t nb_objs) in rte_node_next_stream_get()
459 rte_edge_t next, uint16_t idx) in rte_node_next_stream_put()
488 rte_edge_t next) in rte_node_next_stream_move()
H A Dgraph_debug.c12 rte_edge_t i = 0; in graph_dump()
31 rte_edge_t i; in node_dump()
50 rte_edge_t i; in rte_graph_obj_dump()
H A Dgraph_ops.c16 rte_edge_t i; in node_has_loop_edge()
67 rte_edge_t i; in graph_node_has_edge_to_src_node()
111 rte_edge_t i; in graph_bfs()
H A Dgraph.c95 rte_edge_t i; in graph_node_edges_add()
119 rte_edge_t i; in graph_adjacency_list_update()
498 rte_edge_t i; in graph_to_dot()
H A Dgraph_private.h57 rte_edge_t nb_edges; /**< Number of edges from this node. */
H A Dgraph_populate.c69 rte_edge_t count, nb_edges; in graph_nodes_populate()
/dpdk/lib/node/
H A Dip4_lookup_neon.h19 rte_edge_t next_index; in ip4_lookup_node_process_vec()
126 rte_edge_t fix_spec = ((next_index == result.u16[1]) && in ip4_lookup_node_process_vec()
H A Dip4_lookup_sse.h16 rte_edge_t next0, next1, next2, next3, next_index; in ip4_lookup_node_process_vec()
132 rte_edge_t fix_spec = in ip4_lookup_node_process_vec()
H A Dip4_lookup.c60 rte_edge_t next_index; in ip4_lookup_node_process_scalar()
H A Dip4_rewrite.c136 rte_edge_t fix_spec = in ip4_rewrite_node_process()
/dpdk/app/test/
H A Dtest_graph_perf.c84 rte_edge_t edge = 0; in test_node_ctx_init()
335 rte_edge_t edges; in graph_init()
336 rte_edge_t count; in graph_init()
/dpdk/examples/l3fwd-graph/
H A Dmain.c1033 rte_edge_t i; in main()