PipeWire 1.4.1
All Data Structures Files Functions Variables Typedefs Enumerations Enumerator Macros Modules Pages
graph.h
Go to the documentation of this file.
1/* Simple Plugin API */
2/* SPDX-FileCopyrightText: Copyright © 2018 Wim Taymans */
3/* SPDX-License-Identifier: MIT */
4
5#ifndef SPA_GRAPH_H
6#define SPA_GRAPH_H
7
8#ifdef __cplusplus
9extern "C" {
10#endif
11
21#include <spa/utils/atomic.h>
22#include <spa/utils/defs.h>
23#include <spa/utils/list.h>
24#include <spa/utils/hook.h>
25#include <spa/node/node.h>
26#include <spa/node/io.h>
27
28#ifndef SPA_API_GRAPH
29 #ifdef SPA_API_IMPL
30 #define SPA_API_GRAPH SPA_API_IMPL
31 #else
32 #define SPA_API_GRAPH static inline
33 #endif
34#endif
35
36
37#ifndef spa_debug
38#define spa_debug(...)
39#endif
40
41struct spa_graph;
42struct spa_graph_node;
43struct spa_graph_link;
44struct spa_graph_port;
46struct spa_graph_state {
47 int status;
48 int32_t required;
49 int32_t pending;
50};
51
53{
54 state->pending = state->required;
55}
56
58 struct spa_list link;
60 int (*signal) (void *data);
61 void *signal_data;
62};
64#define spa_graph_link_signal(l) ((l)->signal((l)->signal_data))
65
66#define spa_graph_state_dec(s) (SPA_ATOMIC_DEC(s->pending) == 0)
67
70 struct spa_graph_state *state = link->state;
72 spa_debug("link %p: state %p: pending %d/%d", link, state,
73 state->pending, state->required);
74
78 return state->status;
80struct spa_graph {
81 uint32_t flags; /* flags */
82 struct spa_graph_node *parent; /* parent node or NULL when driver */
83 struct spa_graph_state *state; /* state of graph */
84 struct spa_list nodes; /* list of nodes of this graph */
85};
86
88#define SPA_VERSION_GRAPH_NODE_CALLBACKS 0
89 uint32_t version;
90
91 int (*process) (void *data, struct spa_graph_node *node);
92 int (*reuse_buffer) (void *data, struct spa_graph_node *node,
93 uint32_t port_id, uint32_t buffer_id);
94};
96struct spa_graph_node {
97 struct spa_list link;
98 struct spa_graph *graph;
99 struct spa_list ports[2];
101 uint32_t flags;
102 struct spa_graph_state *state;
106 struct spa_list sched_link;
107};
109#define spa_graph_node_call(n,method,version,...) \
110({ \
111 int __res = 0; \
112 spa_callbacks_call_res(&(n)->callbacks, \
113 struct spa_graph_node_callbacks, __res, \
114 method, (version), ##__VA_ARGS__); \
115 __res; \
118#define spa_graph_node_process(n) spa_graph_node_call((n), process, 0, (n))
119#define spa_graph_node_reuse_buffer(n,p,i) spa_graph_node_call((n), reuse_buffer, 0, (n), (p), (i))
120
122 struct spa_list link;
123 struct spa_graph_node *node;
125 uint32_t port_id;
126 uint32_t flags;
127 struct spa_graph_port *peer;
128};
129
132 struct spa_graph_link *l;
133 spa_debug("node %p trigger", node);
134 spa_list_for_each(l, &node->links, link)
136 return 0;
140{
141 struct spa_graph_node *n, *t;
142 struct spa_list pending;
143
144 spa_graph_state_reset(graph->state);
145 spa_debug("graph %p run with state %p pending %d/%d", graph, graph->state,
146 graph->state->pending, graph->state->required);
147
148 spa_list_init(&pending);
149
150 spa_list_for_each(n, &graph->nodes, link) {
151 struct spa_graph_state *s = n->state;
153 spa_debug("graph %p node %p: state %p pending %d/%d status %d", graph, n,
154 s, s->pending, s->required, s->status);
155 if (--s->pending == 0)
157 }
158 spa_list_for_each_safe(n, t, &pending, sched_link)
160
161 return 0;
162}
163
165{
166 spa_debug("graph %p finish", graph);
167 if (graph->parent)
168 return spa_graph_node_trigger(graph->parent);
169 return 0;
170}
172{
173 struct spa_graph_node *node = (struct spa_graph_node *)data;
174 spa_debug("node %p call process", node);
175 return spa_graph_node_process(node);
177
179{
180 struct spa_graph_node *node = (struct spa_graph_node *)data;
181 return spa_graph_finish(node->graph);
182}
189 spa_debug("graph %p init state %p", graph, state);
191
192SPA_API_GRAPH void
194 struct spa_graph_state *state,
195 struct spa_graph_link *link)
197 link->state = state;
198 state->required++;
199 spa_debug("node %p add link %p to state %p %d", out, link, state, state->required);
200 spa_list_append(&out->links, &link->link);
201}
202
204{
205 link->state->required--;
206 spa_debug("link %p state %p remove %d", link, link->state, link->state->required);
207 spa_list_remove(&link->link);
208}
209
210SPA_API_GRAPH void
212{
213 spa_list_init(&node->ports[SPA_DIRECTION_INPUT]);
214 spa_list_init(&node->ports[SPA_DIRECTION_OUTPUT]);
215 spa_list_init(&node->links);
216 node->flags = 0;
217 node->subgraph = NULL;
218 node->state = state;
219 node->state->required = node->state->pending = 0;
220 node->state->status = SPA_STATUS_OK;
221 node->graph_link.signal = spa_graph_link_signal_graph;
222 node->graph_link.signal_data = node;
223 spa_debug("node %p init state %p", node, state);
224}
225
226
228{
229 struct spa_graph *graph = node->subgraph;
230 spa_debug("node %p: sub process %p", node, graph);
231 return spa_graph_run(graph);
232}
233
237};
238
240 struct spa_graph *subgraph)
241{
242 node->subgraph = subgraph;
243 subgraph->parent = node;
244 spa_debug("node %p set subgraph %p", node, subgraph);
245}
247SPA_API_GRAPH void
249 const struct spa_graph_node_callbacks *callbacks,
250 void *data)
252 node->callbacks = SPA_CALLBACKS_INIT(callbacks, data);
253}
254
255SPA_API_GRAPH void
256spa_graph_node_add(struct spa_graph *graph,
257 struct spa_graph_node *node)
258{
259 node->graph = graph;
260 spa_list_append(&graph->nodes, &node->link);
261 node->state->required++;
262 spa_debug("node %p add to graph %p, state %p required %d",
263 node, graph, node->state, node->state->required);
264 spa_graph_link_add(node, graph->state, &node->graph_link);
265}
266
269 spa_debug("node %p remove from graph %p, state %p required %d",
270 node, node->graph, node->state, node->state->required);
271 spa_graph_link_remove(&node->graph_link);
272 node->state->required--;
273 spa_list_remove(&node->link);
274}
275
276
277SPA_API_GRAPH void
279 enum spa_direction direction,
280 uint32_t port_id,
281 uint32_t flags)
282{
283 spa_debug("port %p init type %d id %d", port, direction, port_id);
284 port->direction = direction;
285 port->port_id = port_id;
286 port->flags = flags;
287}
288
289SPA_API_GRAPH void
291 struct spa_graph_port *port)
292{
293 spa_debug("port %p add to node %p", port, node);
294 port->node = node;
295 spa_list_append(&node->ports[port->direction], &port->link);
296}
297
299{
300 spa_debug("port %p remove", port);
301 spa_list_remove(&port->link);
303
304SPA_API_GRAPH void
306{
307 spa_debug("port %p link to %p %p %p", out, in, in->node, in->node->state);
308 out->peer = in;
309 in->peer = out;
311
312SPA_API_GRAPH void
314{
315 spa_debug("port %p unlink from %p", port, port->peer);
316 if (port->peer) {
317 port->peer->peer = NULL;
318 port->peer = NULL;
319 }
320}
321
322SPA_API_GRAPH int spa_graph_node_impl_process(void *data, struct spa_graph_node *node)
323{
324 struct spa_node *n = (struct spa_node *)data;
325 struct spa_graph_state *state = node->state;
326
327 spa_debug("node %p: process state %p: %d, node %p", node, state, state->status, n);
328 if ((state->status = spa_node_process(n)) != SPA_STATUS_OK)
330
331 return state->status;
332}
333
335 uint32_t port_id, uint32_t buffer_id)
336{
337 struct spa_node *n = (struct spa_node *)data;
338 return spa_node_port_reuse_buffer(n, port_id, buffer_id);
339}
340
344 .reuse_buffer = spa_graph_node_impl_reuse_buffer,
345};
351#ifdef __cplusplus
352} /* extern "C" */
353#endif
354
355#endif /* SPA_GRAPH_H */
spa/utils/defs.h
SPA_API_GRAPH void spa_graph_link_remove(struct spa_graph_link *link)
Definition graph.h:215
SPA_API_GRAPH void spa_graph_state_reset(struct spa_graph_state *state)
Definition graph.h:63
SPA_API_GRAPH void spa_graph_port_init(struct spa_graph_port *port, enum spa_direction direction, uint32_t port_id, uint32_t flags)
Definition graph.h:290
static const struct spa_graph_node_callbacks spa_graph_node_impl_default
Definition graph.h:353
SPA_API_GRAPH void spa_graph_node_remove(struct spa_graph_node *node)
Definition graph.h:279
#define SPA_API_GRAPH
Definition graph.h:39
#define spa_graph_link_signal(l)
Definition graph.h:75
SPA_API_GRAPH void spa_graph_node_init(struct spa_graph_node *node, struct spa_graph_state *state)
Definition graph.h:223
SPA_API_GRAPH int spa_graph_node_trigger(struct spa_graph_node *node)
Definition graph.h:142
SPA_API_GRAPH int spa_graph_finish(struct spa_graph *graph)
Definition graph.h:176
SPA_API_GRAPH int spa_graph_node_impl_process(void *data, struct spa_graph_node *node)
Definition graph.h:334
SPA_API_GRAPH void spa_graph_port_unlink(struct spa_graph_port *port)
Definition graph.h:325
SPA_API_GRAPH void spa_graph_port_remove(struct spa_graph_port *port)
Definition graph.h:310
SPA_API_GRAPH int spa_graph_node_impl_reuse_buffer(void *data, struct spa_graph_node *node, uint32_t port_id, uint32_t buffer_id)
Definition graph.h:346
SPA_API_GRAPH void spa_graph_node_add(struct spa_graph *graph, struct spa_graph_node *node)
Definition graph.h:268
static const struct spa_graph_node_callbacks spa_graph_node_sub_impl_default
Definition graph.h:246
SPA_API_GRAPH void spa_graph_node_set_subgraph(struct spa_graph_node *node, struct spa_graph *subgraph)
Definition graph.h:251
SPA_API_GRAPH int spa_graph_link_trigger(struct spa_graph_link *link)
Definition graph.h:79
#define spa_debug(...)
Definition graph.h:45
SPA_API_GRAPH void spa_graph_port_link(struct spa_graph_port *out, struct spa_graph_port *in)
Definition graph.h:317
SPA_API_GRAPH void spa_graph_port_add(struct spa_graph_node *node, struct spa_graph_port *port)
Definition graph.h:302
SPA_API_GRAPH int spa_graph_run(struct spa_graph *graph)
Definition graph.h:151
#define spa_graph_node_process(n)
Definition graph.h:130
SPA_API_GRAPH void spa_graph_link_add(struct spa_graph_node *out, struct spa_graph_state *state, struct spa_graph_link *link)
Definition graph.h:205
SPA_API_GRAPH void spa_graph_node_set_callbacks(struct spa_graph_node *node, const struct spa_graph_node_callbacks *callbacks, void *data)
Definition graph.h:260
SPA_API_GRAPH int spa_graph_link_signal_node(void *data)
Definition graph.h:183
SPA_API_GRAPH void spa_graph_init(struct spa_graph *graph, struct spa_graph_state *state)
Definition graph.h:196
#define SPA_VERSION_GRAPH_NODE_CALLBACKS
Definition graph.h:100
#define spa_graph_state_dec(s)
Definition graph.h:77
SPA_API_GRAPH int spa_graph_link_signal_graph(void *data)
Definition graph.h:190
SPA_API_GRAPH int spa_graph_node_impl_sub_process(void *data, struct spa_graph_node *node)
Definition graph.h:239
#define SPA_CALLBACKS_INIT(_funcs, _data)
Initialize the set of functions funcs as a spa_callbacks, together with _data.
Definition hook.h:144
SPA_API_LIST void spa_list_init(struct spa_list *list)
Definition list.h:47
SPA_API_LIST void spa_list_remove(struct spa_list *elem)
Definition list.h:77
#define spa_list_for_each(pos, head, member)
Definition list.h:119
#define spa_list_append(list, item)
Definition list.h:89
#define spa_list_for_each_safe(pos, tmp, head, member)
Definition list.h:137
#define SPA_STATUS_OK
Definition io.h:82
SPA_API_NODE int spa_node_port_reuse_buffer(struct spa_node *object, uint32_t port_id, uint32_t buffer_id)
Definition node.h:808
SPA_API_NODE int spa_node_process(struct spa_node *object)
Definition node.h:818
#define SPA_UNUSED
Definition defs.h:307
spa_direction
Definition defs.h:106
@ SPA_DIRECTION_INPUT
Definition defs.h:107
@ SPA_DIRECTION_OUTPUT
Definition defs.h:108
spa/utils/hook.h
spa/node/io.h
spa/utils/list.h
spa/node/node.h
Callbacks, contains the structure with functions and the data passed to the functions.
Definition hook.h:126
Definition graph.h:98
int(* process)(void *data, struct spa_graph_node *node)
Definition graph.h:103
int(* reuse_buffer)(void *data, struct spa_graph_node *node, uint32_t port_id, uint32_t buffer_id)
Definition graph.h:104
uint32_t version
Definition graph.h:101
Definition graph.h:108
uint32_t flags
node flags
Definition graph.h:113
struct spa_list link
link in graph nodes list
Definition graph.h:109
struct spa_callbacks callbacks
Definition graph.h:117
struct spa_graph * graph
owner graph
Definition graph.h:110
struct spa_graph * subgraph
subgraph or NULL
Definition graph.h:116
struct spa_graph_link graph_link
link in graph
Definition graph.h:115
struct spa_list links
list of links to next nodes
Definition graph.h:112
struct spa_graph_state * state
state of the node
Definition graph.h:114
struct spa_list ports[2]
list of input and output ports
Definition graph.h:111
struct spa_list sched_link
link for scheduler
Definition graph.h:118
Definition graph.h:133
struct spa_graph_node * node
owner node
Definition graph.h:135
uint32_t port_id
port id
Definition graph.h:137
struct spa_graph_port * peer
peer
Definition graph.h:139
uint32_t flags
port flags
Definition graph.h:138
enum spa_direction direction
port direction
Definition graph.h:136
struct spa_list link
link in node port list
Definition graph.h:134
Definition graph.h:57
int32_t pending
number of pending signals
Definition graph.h:60
int32_t required
required number of signals
Definition graph.h:59
int status
current status
Definition graph.h:58
Definition graph.h:91
uint32_t flags
Definition graph.h:92
struct spa_list nodes
Definition graph.h:95
struct spa_graph_node * parent
Definition graph.h:93
struct spa_graph_state * state
Definition graph.h:94
Definition list.h:39
Definition node.h:51