Lines Matching refs:node
12 * "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
106 * Pointer to the node object.
115 struct rte_node *node);
125 * @param node
126 * Pointer to the node object.
131 struct rte_node *node);
137 * Flag to denote that stats are of the first node.
139 * Flag to denote that stats are of the last node.
159 uint16_t nb_node_patterns; /**< Number of node patterns. */
161 /**< Array of node patterns based on shell pattern. */
232 char name[RTE_NODE_NAMESIZE]; /**< Name of the node. */
243 * Graph parameter, includes node names and count to be included
383 * Dump graph information along with node info to file
395 #define rte_graph_foreach_node(count, off, graph, node) \
397 node = RTE_PTR_ADD(graph, off); \
399 off = node->next, node = RTE_PTR_ADD(graph, off), count++)
402 * Get node object with in graph from id.
405 * Graph id to get node pointer from.
407 * Node id to get node pointer.
415 * Get node pointer with in graph from name.
418 * Graph name to get node pointer from.
420 * Node name to get the node pointer.
429 * Create graph stats cluster to aggregate runtime node stats.
469 * Structure defines the number of xstats a given node has and each xstat
478 * Structure defines the node registration parameters.
483 char name[RTE_NODE_NAMESIZE]; /**< Name of the node. */
491 rte_node_t parent_id; /**< Identifier of parent node. */
492 rte_edge_t nb_edges; /**< Number of edges from this node. */
497 * Register new packet processing node. Nodes can be registered
501 * @param node
502 * Valid node pointer with name, process function and next_nodes.
505 * Valid node id on success, RTE_NODE_ID_INVALID otherwise.
509 rte_node_t __rte_node_register(const struct rte_node_register *node);
512 * Register a static node.
514 * The static node is registered through the constructor scheme, thereby, it can
517 * @param node
518 * Valid node pointer with name, process function, and next_nodes.
520 #define RTE_NODE_REGISTER(node) \
521 RTE_INIT(rte_node_register_##node) \
523 node.parent_id = RTE_NODE_ID_INVALID; \
524 node.id = __rte_node_register(&node); \
528 * Clone a node from static node(node created from RTE_NODE_REGISTER).
531 * Static node id to clone from.
533 * Name of the new node. The library prepends the parent node name to the
534 * user-specified name. The final node name will be,
535 * "parent node name" + "-" + name.
538 * Valid node id on success, RTE_NODE_ID_INVALID otherwise.
543 * Get node id from node name.
546 * Valid node name. In the case of the cloned node, the name will be
547 * "parent node name" + "-" + name.
550 * Valid node id on success, RTE_NODE_ID_INVALID otherwise.
555 * Get node name from node id.
558 * Valid node id.
561 * Valid node name on success, NULL otherwise.
566 * Get the number of edges(next-nodes) for a node from node id.
569 * Valid node id.
577 * Update the edges for a node from node id.
580 * Valid node id.
599 * Valid node id.
609 * Get the edge names from a given node.
612 * Valid node id.
632 * Dump node info to file.
635 * File pointer to dump the node info.
642 * Dump all node info to file.
645 * File pointer to dump the node info.
650 * Test the validity of node id.
668 * Edge node id to check.