Lines Matching defs:node
35 /* For 0..N node objects with fence */
40 sz += sizeof(struct rte_node *) * graph_node->node->nb_edges;
44 /* For 0..N node objects with xstats */
46 if (graph_node->node->xstats == NULL)
49 sz += sizeof(uint64_t) * graph_node->node->xstats->nb_xstats;
85 struct rte_node *node = RTE_PTR_ADD(graph, off);
86 memset(node, 0, sizeof(*node));
87 node->fence = RTE_GRAPH_FENCE;
88 node->off = off;
90 node->process = graph_pcap_dispatch;
91 node->original_process = graph_node->node->process;
93 node->process = graph_node->node->process;
94 memcpy(node->name, graph_node->node->name, RTE_GRAPH_NAMESIZE);
95 pid = graph_node->node->parent_id;
96 if (pid != RTE_NODE_ID_INVALID) { /* Cloned node */
98 memcpy(node->parent, parent, RTE_GRAPH_NAMESIZE);
100 node->id = graph_node->node->id;
101 node->parent_id = pid;
102 node->dispatch.lcore_id = graph_node->node->lcore_id;
103 nb_edges = graph_node->node->nb_edges;
104 node->nb_edges = nb_edges;
108 node->nodes[count] = (struct rte_node *)&graph_node
110 ->node->name[0];
112 if (graph_node->node->xstats != NULL) {
113 node->xstat_off = xstat_off - off;
114 xstat_off += sizeof(uint64_t) * graph_node->node->xstats->nb_xstats;
120 node->next = off;
121 __rte_node_stream_alloc(graph, node);
130 struct rte_node *node;
132 rte_graph_foreach_node(count, off, graph, node)
133 if (unlikely(node->id == id))
134 return node;
144 struct rte_node *node;
146 rte_graph_foreach_node(count, off, graph, node)
147 if (strncmp(name, node->name, RTE_NODE_NAMESIZE) == 0)
148 return node;
158 struct rte_node *node;
162 rte_graph_foreach_node(count, off, graph, node) {
163 for (val = 0; val < node->nb_edges; val++) {
164 name = (const char *)node->nodes[val];
165 node->nodes[val] = graph_node_name_to_ptr(graph, name);
166 if (node->nodes[val] == NULL)
181 struct rte_node *node;
186 if (graph_node->node->flags & RTE_NODE_SOURCE_F) {
187 name = graph_node->node->name;
188 node = graph_node_name_to_ptr(graph, name);
189 if (node == NULL)
192 __rte_node_stream_alloc(graph, node);
193 graph->cir_start[head--] = node->off;
242 struct rte_node *node;
247 rte_graph_foreach_node(count, off, graph, node)
248 rte_free(node->objs);