Searched refs:rte_node_t (Results 1 – 13 of 13) sorted by relevance
45 typedef uint32_t rte_node_t; /**< Node id type. */ typedef209 rte_node_t id; /**< Node identifier of stats. */434 rte_node_t id; /**< Node Identifier. */486 rte_node_t rte_node_clone(rte_node_t id, const char *name);499 rte_node_t rte_node_from_name(const char *name);511 char *rte_node_id_to_name(rte_node_t id);523 rte_edge_t rte_node_edge_count(rte_node_t id);573 rte_node_t rte_node_edge_get(rte_node_t id, char *next_nodes[]);582 rte_node_t rte_node_max_count(void);593 void rte_node_dump(FILE *f, rte_node_t id);[all …]
17 static rte_node_t node_id;56 rte_node_t140 static rte_node_t143 rte_node_t rc = RTE_NODE_ID_INVALID; in node_clone()181 rte_node_t195 rte_node_t208 rte_node_id_to_name(rte_node_t id) in rte_node_id_to_name()222 rte_node_edge_count(rte_node_t id) in rte_node_edge_count()339 static rte_node_t350 rte_node_t[all …]
55 rte_node_t id; /**< Allocated identifier for the node. */56 rte_node_t parent_id; /**< Parent node identifier. */87 rte_node_t src_node_count;91 rte_node_t node_count;233 rte_node_t graph_src_nodes_count(struct graph *graph);246 rte_node_t graph_nodes_count(struct graph *graph);304 rte_node_t id);
17 rte_node_t val; in graph_fp_mem_calc_size()71 rte_node_t pid; in graph_nodes_populate()104 graph_node_id_to_ptr(const struct rte_graph *graph, rte_node_t id) in graph_node_id_to_ptr()106 rte_node_t count; in graph_node_id_to_ptr()120 rte_node_t count; in graph_node_name_to_ptr()134 rte_node_t count, val; in graph_node_nexts_populate()216 rte_node_t count; in graph_nodes_mem_destroy()
45 rte_node_t49 rte_node_t rc = 0; in graph_src_nodes_count()85 rte_node_t89 rte_node_t count = 0; in graph_nodes_count()
25 rte_node_t nb_nodes;34 rte_node_t max_nodes;140 rte_node_t id = graph_node->node->id; in stats_mem_populate()143 rte_node_t count; in stats_mem_populate()336 rte_node_t count; in cluster_node_arregate_stats()369 rte_node_t count; in rte_graph_cluster_stats_get()390 rte_node_t count; in rte_graph_cluster_stats_reset()
40 rte_node_t nb_nodes; /**< Number of nodes in the graph. */58 rte_node_t id; /**< Node identifier. */59 rte_node_t parent_id; /**< Parent Node identifier. */135 const rte_node_t mask = graph->cir_mask; in rte_graph_walk()
218 rte_node_t count; in graph_mem_fixup_node_ctx()263 rte_node_t src_node_count; in rte_graph_create()422 rte_node_t count; in rte_graph_node_get()444 rte_node_t count; in rte_graph_node_get_by_name()
47 rte_node_t count; in rte_graph_obj_dump()
83 rte_node_t nid = node->id; in test_node_ctx_init()265 static inline rte_node_t268 rte_node_t pnode_id = rte_node_from_name(pname); in graph_node_get()270 rte_node_t node_id; in graph_node_get()288 rte_node_t **node_map) in graph_node_count_edges()330 rte_node_t *src_nodes; in graph_init()331 rte_node_t *snk_nodes; in graph_init()332 rte_node_t **node_map; in graph_init()363 src_nodes = malloc(sizeof(rte_node_t) * nb_srcs); in graph_init()369 snk_nodes = malloc(sizeof(rte_node_t) * nb_sinks); in graph_init()[all …]
176 rte_node_t next; in test_node_worker_source()742 rte_node_t id = rte_node_from_name(node_patterns[i]); in graph_cluster_stats_cb_t()
35 rte_node_t nid;
100 gives the ID as ``rte_node_t`` type. Both ID or Name shall be used lookup the