Lines Matching defs:node

50  * Structure that holds node internal data.
52 struct node {
53 	STAILQ_ENTRY(node) next;      /**< Next node in the list. */
54 	char name[RTE_NODE_NAMESIZE]; /**< Name of the node. */
61 	rte_node_t id;		      /**< Allocated identifier for the node. */
62 	rte_node_t parent_id;	      /**< Parent node identifier. */
63 	rte_edge_t nb_edges;	      /**< Number of edges from this node. */
71  * Structure that holds the graph scheduling workqueue node stream.
83  * Structure that holds the graph node data.
86 	STAILQ_ENTRY(graph_node) next; /**< Next graph node in the list. */
87 	struct node *node; /**< Pointer to internal node. */
88 	bool visited;      /**< Flag used in BFS to mark node visited. */
89 	struct graph_node *adjacency_list[]; /**< Adjacency list of the node. */
140  * Naming a cloned graph or node by appending a string to base name.
176 STAILQ_HEAD(node_head, node);
181  * Get the head of the node list.
184  *   Pointer to the node head.
191  * Get node pointer from node name.
194  *   Pointer to character string containing the node name.
197  *   Pointer to the node.
199 struct node *node_from_name(const char *name);
244  *   Pointer to the starting graph node.
255  * Check if there is an isolated node in the given graph.
261  *   - 0: No isolated node found.
262  *   - 1: Isolated node found.
269  * Check whether a node in the graph has next_node to a source node.
275  *   - 0: Node has an edge to source node.
276  *   - 1: Node doesn't have an edge to source node.
283  * Checks whether node in the graph has a edge to itself i.e. forms a
366  * Get graph node object from node id.
382  * Get graph node object from node name.
387  *   Pointer to character string holding the node name.
411  * Dump internal node object data.
416  *   Pointer to the internal node object.
418 void node_dump(FILE *f, struct node *n);