Home
last modified time | relevance | path

Searched refs:graph (Results 1 – 25 of 130) sorted by relevance

123456

/f-stack/dpdk/lib/librte_graph/
H A Dgraph.c164 graph_cleanup(struct graph *graph) in graph_cleanup() argument
186 graph->graph, in graph_node_init()
207 graph->graph, in graph_node_fini()
264 struct graph *graph; in rte_graph_create() local
360 struct graph *graph, *tmp; in rte_graph_destroy() local
393 struct graph *graph; in rte_graph_from_name() local
405 struct graph *graph; in rte_graph_id_to_name() local
420 struct graph *graph; in rte_graph_node_get() local
442 struct graph *graph; in rte_graph_node_get_by_name() local
530 struct graph *graph; in rte_graph_export() local
[all …]
H A Dgraph_populate.c16 graph_fp_mem_calc_size(struct graph *graph) in graph_fp_mem_calc_size() argument
30 graph->cir_mask = rte_align32pow2(graph->node_count) - 1; in graph_fp_mem_calc_size()
51 struct rte_graph *graph = _graph->graph; in graph_header_popluate() local
69 struct rte_graph *graph = _graph->graph; in graph_nodes_populate() local
139 const struct rte_graph *graph = _graph->graph; in graph_node_nexts_populate() local
159 struct rte_graph *graph = _graph->graph; in graph_src_nodes_populate() local
183 graph_fp_mem_populate(struct graph *graph) in graph_fp_mem_populate() argument
196 graph_fp_mem_create(struct graph *graph) in graph_fp_mem_create() argument
207 graph->graph = mz->addr; in graph_fp_mem_create()
230 graph_fp_mem_destroy(struct graph *graph) in graph_fp_mem_destroy() argument
[all …]
H A Dgraph_private.h78 struct graph { struct
89 struct rte_graph *graph; argument
177 int graph_bfs(struct graph *graph, struct graph_node *start);
191 int graph_has_isolated_node(struct graph *graph);
205 int graph_node_has_edge_to_src_node(struct graph *graph);
220 int graph_node_has_loop_edge(struct graph *graph);
233 rte_node_t graph_src_nodes_count(struct graph *graph);
246 rte_node_t graph_nodes_count(struct graph *graph);
256 void graph_mark_nodes_as_not_visited(struct graph *graph);
273 int graph_fp_mem_create(struct graph *graph);
[all …]
H A Dgraph_ops.c35 graph_node_has_loop_edge(struct graph *graph) in graph_node_has_loop_edge() argument
39 STAILQ_FOREACH(graph_node, &graph->node_list, next) in graph_node_has_loop_edge()
47 graph_src_nodes_count(struct graph *graph) in graph_src_nodes_count() argument
52 STAILQ_FOREACH(graph_node, &graph->node_list, next) in graph_src_nodes_count()
64 graph_node_has_edge_to_src_node(struct graph *graph) in graph_node_has_edge_to_src_node() argument
87 graph_nodes_count(struct graph *graph) in graph_nodes_count() argument
99 graph_mark_nodes_as_not_visited(struct graph *graph) in graph_mark_nodes_as_not_visited() argument
108 graph_bfs(struct graph *graph, struct graph_node *start) in graph_bfs() argument
144 graph_has_isolated_node(struct graph *graph) in graph_has_isolated_node() argument
148 graph_mark_nodes_as_not_visited(graph); in graph_has_isolated_node()
[all …]
H A Drte_graph_worker.h132 rte_graph_walk(struct rte_graph *graph) in rte_graph_walk() argument
135 const rte_node_t mask = graph->cir_mask; in rte_graph_walk()
136 uint32_t head = graph->head; in rte_graph_walk()
157 while (likely(head != graph->tail)) { in rte_graph_walk()
175 graph->tail = 0; in rte_graph_walk()
195 tail = graph->tail; in __rte_node_enqueue_tail_update()
196 graph->cir_start[tail++] = node->off; in __rte_node_enqueue_tail_update()
197 graph->tail = tail & graph->cir_mask; in __rte_node_enqueue_tail_update()
224 __rte_node_enqueue_tail_update(graph, node); in __rte_node_enqueue_prologue()
227 __rte_node_stream_alloc(graph, node); in __rte_node_enqueue_prologue()
[all …]
H A Dgraph_stats.c19 struct graph **graphs;
151 node = graph_node_id_to_ptr(graph, id); in stats_mem_populate()
156 graph_node->node->name, graph->name); in stats_mem_populate()
175 node = graph_node_id_to_ptr(graph, id); in stats_mem_populate()
203 cluster_add(struct cluster *cluster, struct graph *graph) in cluster_add() argument
210 if (cluster->graphs[count] == graph) in cluster_add()
241 struct graph *graph; in expand_pattern_to_cluster() local
247 if (cluster_add(cluster, graph)) in expand_pattern_to_cluster()
267 struct graph *graph; in rte_graph_cluster_stats_create() local
298 graph = cluster.graphs[i]; in rte_graph_cluster_stats_create()
[all …]
H A Drte_graph.h99 typedef uint16_t (*rte_node_process_t)(struct rte_graph *graph,
119 typedef int (*rte_node_init_t)(const struct rte_graph *graph,
135 typedef void (*rte_node_fini_t)(const struct rte_graph *graph,
340 void rte_graph_obj_dump(FILE *f, struct rte_graph *graph, bool all);
343 #define rte_graph_foreach_node(count, off, graph, node) \ argument
344 for (count = 0, off = graph->nodes_start, \
345 node = RTE_PTR_ADD(graph, off); \
346 count < graph->nb_nodes; \
347 off = node->next, node = RTE_PTR_ADD(graph, off), count++)
375 struct rte_node *rte_graph_node_get_by_name(const char *graph,
/f-stack/freebsd/arm64/coresight/
H A Dcoresight_acpi.c72 if (graph->Package.Count < 2) in cs_acpi_validate_dsd_graph()
75 rev = &graph->Package.Elements[0]; in cs_acpi_validate_dsd_graph()
76 nr_graphs = &graph->Package.Elements[1]; in cs_acpi_validate_dsd_graph()
92 if (graph->Package.Count != (n + 2)) in cs_acpi_validate_dsd_graph()
96 obj = &graph->Package.Elements[i]; in cs_acpi_validate_dsd_graph()
240 if (!cs_is_acpi_coresight_graph(graph)) in cs_get_coresight_graph()
243 return (graph); in cs_get_coresight_graph()
302 const union acpi_object *graph; in coresight_acpi_get_ports() local
308 graph = cs_get_coresight_graph(dev); in coresight_acpi_get_ports()
309 if (graph == NULL) { in coresight_acpi_get_ports()
[all …]
/f-stack/dpdk/doc/guides/sample_app_ug/
H A Dl3_forward_graph.rst14 The application demonstrates the use of the graph framework and graph nodes
19 There is also additional initialization of graph for graph object creation
25 graph using ``rte_graph_walk()`` with graph objects created one per worker lcore.
30 configured and provided to ``ip4_lookup`` graph node and ``ip4_rewrite`` graph node
129 is same as graph id.
133 specific graph object.
190 A graph object returned after graph creation is a per lcore object and
272 /* Add route to ip4 graph infra */
324 graph = qconf->graph;
328 qconf->name, graph);
[all …]
/f-stack/dpdk/doc/guides/prog_guide/
H A Dgraph_lib.rst11 The graph library provides API to enable graph framework operations such as
38 graph.
94 node gets detached to a graph.
173 Create the graph object
179 nodes or graph is not allowed.
193 Multicore graph processing
198 The fast path API works on graph object, So the multi-core graph
226 ``struct rte_graph *`` fast-path graph object while others works on graph ID or name.
231 multiple graph objects. Especially the situation where each graph object bound
236 graph cluster with multiple graph objects and ``rte_graph_cluster_stats_get()``
[all …]
/f-stack/dpdk/lib/librte_node/
H A Dpkt_cls.c34 pkt_cls_node_process(struct rte_graph *graph, struct rte_node *node, in pkt_cls_node_process() argument
62 to_next = rte_node_next_stream_get(graph, node, in pkt_cls_node_process()
111 rte_node_enqueue_x1(graph, node, in pkt_cls_node_process()
121 rte_node_enqueue_x1(graph, node, in pkt_cls_node_process()
131 rte_node_enqueue_x1(graph, node, in pkt_cls_node_process()
141 rte_node_enqueue_x1(graph, node, in pkt_cls_node_process()
151 rte_node_next_stream_put(graph, node, in pkt_cls_node_process()
159 to_next = rte_node_next_stream_get(graph, node, in pkt_cls_node_process()
190 rte_node_enqueue_x1(graph, node, in pkt_cls_node_process()
200 rte_node_next_stream_move(graph, node, next_index); in pkt_cls_node_process()
[all …]
H A Dip4_rewrite.c38 ip4_rewrite_node_process(struct rte_graph *graph, struct rte_node *node, in ip4_rewrite_node_process() argument
158 rte_node_enqueue_x1(graph, node, next0, in ip4_rewrite_node_process()
168 rte_node_enqueue_x1(graph, node, next1, in ip4_rewrite_node_process()
178 rte_node_enqueue_x1(graph, node, next2, in ip4_rewrite_node_process()
188 rte_node_enqueue_x1(graph, node, next3, in ip4_rewrite_node_process()
197 rte_node_next_stream_put(graph, node, in ip4_rewrite_node_process()
204 graph, node, next_index, nb_objs); in ip4_rewrite_node_process()
240 rte_node_enqueue_x1(graph, node, next0, from[0]); in ip4_rewrite_node_process()
249 rte_node_next_stream_move(graph, node, next_index); in ip4_rewrite_node_process()
255 rte_node_next_stream_put(graph, node, next_index, held); in ip4_rewrite_node_process()
[all …]
H A Dip4_lookup.c56 ip4_lookup_node_process_scalar(struct rte_graph *graph, struct rte_node *node, in ip4_lookup_node_process_scalar() argument
77 to_next = rte_node_next_stream_get(graph, node, next_index, nb_objs); in ip4_lookup_node_process_scalar()
107 rte_node_enqueue_x1(graph, node, next, from[0]); in ip4_lookup_node_process_scalar()
116 rte_node_next_stream_move(graph, node, next_index); in ip4_lookup_node_process_scalar()
121 rte_node_next_stream_put(graph, node, next_index, held); in ip4_lookup_node_process_scalar()
183 ip4_lookup_node_init(const struct rte_graph *graph, struct rte_node *node) in ip4_lookup_node_init() argument
189 RTE_SET_USED(graph); in ip4_lookup_node_init()
214 IP4_LOOKUP_NODE_LPM(node->ctx) = ip4_lookup_nm.lpm_tbl[graph->socket]; in ip4_lookup_node_init()
H A Dip4_lookup_sse.h10 ip4_lookup_node_process_vec(struct rte_graph *graph, struct rte_node *node, in ip4_lookup_node_process_vec() argument
44 to_next = rte_node_next_stream_get(graph, node, next_index, nb_objs); in ip4_lookup_node_process_vec()
150 rte_node_enqueue_x1(graph, node, next0, in ip4_lookup_node_process_vec()
160 rte_node_enqueue_x1(graph, node, next1, in ip4_lookup_node_process_vec()
170 rte_node_enqueue_x1(graph, node, next2, in ip4_lookup_node_process_vec()
180 rte_node_enqueue_x1(graph, node, next3, in ip4_lookup_node_process_vec()
221 rte_node_enqueue_x1(graph, node, next0, from[0]); in ip4_lookup_node_process_vec()
230 rte_node_next_stream_move(graph, node, next_index); in ip4_lookup_node_process_vec()
237 rte_node_next_stream_put(graph, node, next_index, held); in ip4_lookup_node_process_vec()
H A Dip4_lookup_neon.h10 ip4_lookup_node_process_vec(struct rte_graph *graph, struct rte_node *node, in ip4_lookup_node_process_vec() argument
47 to_next = rte_node_next_stream_get(graph, node, next_index, nb_objs); in ip4_lookup_node_process_vec()
145 rte_node_enqueue_x1(graph, node, result.u16[1], in ip4_lookup_node_process_vec()
155 rte_node_enqueue_x1(graph, node, result.u16[3], in ip4_lookup_node_process_vec()
165 rte_node_enqueue_x1(graph, node, result.u16[5], in ip4_lookup_node_process_vec()
175 rte_node_enqueue_x1(graph, node, result.u16[7], in ip4_lookup_node_process_vec()
217 rte_node_enqueue_x1(graph, node, next0, from[0]); in ip4_lookup_node_process_vec()
226 rte_node_next_stream_move(graph, node, next_index); in ip4_lookup_node_process_vec()
231 rte_node_next_stream_put(graph, node, next_index, held); in ip4_lookup_node_process_vec()
H A Dethdev_tx.c16 ethdev_tx_node_process(struct rte_graph *graph, struct rte_node *node, in ethdev_tx_node_process() argument
32 rte_node_enqueue(graph, node, ETHDEV_TX_NEXT_PKT_DROP, in ethdev_tx_node_process()
40 ethdev_tx_node_init(const struct rte_graph *graph, struct rte_node *node) in ethdev_tx_node_init() argument
57 ctx->queue = graph->id; in ethdev_tx_node_init()
H A Dethdev_rx.c18 ethdev_rx_node_process_inline(struct rte_graph *graph, struct rte_node *node, in ethdev_rx_node_process_inline() argument
36 rte_node_next_stream_move(graph, node, next_index); in ethdev_rx_node_process_inline()
42 ethdev_rx_node_process(struct rte_graph *graph, struct rte_node *node, in ethdev_rx_node_process() argument
51 n_pkts = ethdev_rx_node_process_inline(graph, node, ctx); in ethdev_rx_node_process()
180 ethdev_rx_node_init(const struct rte_graph *graph, struct rte_node *node) in ethdev_rx_node_init() argument
185 RTE_SET_USED(graph); in ethdev_rx_node_init()
H A Dnull.c8 null(struct rte_graph *graph, struct rte_node *node, void **objs, in null() argument
13 RTE_SET_USED(graph); in null()
H A Dpkt_drop.c10 pkt_drop_process(struct rte_graph *graph, struct rte_node *node, void **objs, in pkt_drop_process() argument
14 RTE_SET_USED(graph); in pkt_drop_process()
/f-stack/dpdk/app/test/
H A Dtest_graph.c24 static uint16_t test_node0_worker(struct rte_graph *graph,
28 static uint16_t test_node1_worker(struct rte_graph *graph,
32 static uint16_t test_node2_worker(struct rte_graph *graph,
36 static uint16_t test_node3_worker(struct rte_graph *graph,
133 RTE_SET_USED(graph); in node_init()
181 rte_node_next_stream_put(graph, node, next, obj_node0); in test_node_worker_source()
271 test_node1_worker(graph, node, objs, nb_objs); in test_node0_worker()
273 test_node2_worker(graph, node, objs, nb_objs); in test_node0_worker()
275 test_node3_worker(graph, node, objs, nb_objs); in test_node0_worker()
651 if (!graph) { in test_graph_walk()
[all …]
H A Dtest_graph_perf.c76 RTE_SET_USED(graph); in test_node_ctx_init()
164 rte_node_next_stream_move(graph, node, node->ctx[1]); in test_perf_node_worker()
176 rte_node_enqueue_x4(graph, node, next, objs[0], in test_perf_node_worker()
182 rte_node_enqueue_x1(graph, node, next, objs[0]); in test_perf_node_worker()
187 rte_node_enqueue_x2(graph, node, next, objs[0], in test_perf_node_worker()
193 rte_node_enqueue_x2(graph, node, next, objs[0], in test_perf_node_worker()
195 rte_node_enqueue_x1(graph, node, next, objs[0]); in test_perf_node_worker()
204 rte_node_enqueue(graph, node, next, objs, nb_objs - enq); in test_perf_node_worker()
222 RTE_SET_USED(graph); in test_perf_node_sink()
605 struct rte_graph *graph; in _graph_perf_wrapper() local
[all …]
/f-stack/freebsd/contrib/device-tree/Bindings/sound/
H A Daudio-graph-card.txt5 see ${LINUX}/Documentation/devicetree/bindings/graph.txt
29 - compatible : "audio-graph-card";
40 compatible = "audio-graph-card";
71 compatible = "audio-graph-card";
143 compatible = "audio-graph-card";
180 compatible = "audio-graph-card";
193 audio-graph-card,prefix = "codec";
194 audio-graph-card,convert-rate = <48000>;
237 compatible = "audio-graph-card";
264 audio-graph-card,prefix = "pcm3168a";
[all …]
/f-stack/freebsd/contrib/octeon-sdk/
H A Dcvmx-dfa.h537 static inline void cvmx_dfa_write_edge_sm(const cvmx_dfa_graph_t *graph, in cvmx_dfa_write_edge_sm() argument
583 static inline void cvmx_dfa_write_node_lg(const cvmx_dfa_graph_t *graph, in cvmx_dfa_write_node_lg() argument
726 command.s.gxor = graph->gxor; // (PASS3/CN58XX) in cvmx_dfa_submit()
727 command.s.nxoren = graph->nxoren; // (PASS3/CN58XX) in cvmx_dfa_submit()
728 command.s.nreplen = graph->nreplen; // (PASS3/CN58XX) in cvmx_dfa_submit()
730 command.s.replication = graph->replication; in cvmx_dfa_submit()
731 command.s.type = graph->type; in cvmx_dfa_submit()
732 command.s.base = graph->base_address>>10; in cvmx_dfa_submit()
750 if (graph->type == CVMX_DFA_GRAPH_TYPE_SM) in cvmx_dfa_submit()
752 command.s.tsize = (graph->num_terminal_nodes + 255) / 256; in cvmx_dfa_submit()
[all …]
/f-stack/app/redis-5.0.5/src/
H A Dlatency.c520 sds graph = sdsempty(); in latencyCommandGenSparkeline() local
550 graph = sdscatprintf(graph, in latencyCommandGenSparkeline()
554 graph = sdscatlen(graph,"-",1); in latencyCommandGenSparkeline()
555 graph = sdscatlen(graph,"\n",1); in latencyCommandGenSparkeline()
556 graph = sparklineRender(graph,seq,LATENCY_GRAPH_COLS,4,SPARKLINE_FILL); in latencyCommandGenSparkeline()
558 return graph; in latencyCommandGenSparkeline()
592 sds graph; in latencyCommand() local
601 graph = latencyCommandGenSparkeline(event,ts); in latencyCommand()
602 addReplyBulkCString(c,graph); in latencyCommand()
603 sdsfree(graph); in latencyCommand()
/f-stack/freebsd/contrib/device-tree/Bindings/display/
H A Dingenic,lcd.yaml42 description: OF graph bindings (specified in bindings/graph.txt).
45 description: OF graph bindings (specified in bindings/graph.txt).

123456