Split notification iterator API into base and specialized functions
[babeltrace.git] / lib / graph / graph.c
CommitLineData
c0418dd9 1/*
7d55361f 2 * graph.c
c0418dd9
JG
3 *
4 * Babeltrace Plugin Component Graph
5 *
f60c8b34 6 * Copyright 2017 Jérémie Galarneau <jeremie.galarneau@efficios.com>
262e5473 7 * Copyright 2017 Philippe Proulx <pproulx@efficios.com>
c0418dd9
JG
8 *
9 * Permission is hereby granted, free of charge, to any person obtaining a copy
10 * of this software and associated documentation files (the "Software"), to deal
11 * in the Software without restriction, including without limitation the rights
12 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
13 * copies of the Software, and to permit persons to whom the Software is
14 * furnished to do so, subject to the following conditions:
15 *
16 * The above copyright notice and this permission notice shall be included in
17 * all copies or substantial portions of the Software.
18 *
19 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
20 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
21 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
22 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
23 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
24 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
25 * SOFTWARE.
26 */
27
262e5473
PP
28#define BT_LOG_TAG "GRAPH"
29#include <babeltrace/lib-logging-internal.h>
30
b2e0c907
PP
31#include <babeltrace/graph/component-internal.h>
32#include <babeltrace/graph/graph-internal.h>
33#include <babeltrace/graph/connection-internal.h>
34#include <babeltrace/graph/component-sink-internal.h>
35#include <babeltrace/graph/component-source.h>
36#include <babeltrace/graph/component-filter.h>
37#include <babeltrace/graph/port.h>
3d9990ac 38#include <babeltrace/compiler-internal.h>
c55a9f58 39#include <babeltrace/types.h>
36712f1d
PP
40#include <babeltrace/values.h>
41#include <babeltrace/values-internal.h>
f60c8b34 42#include <unistd.h>
1bf957a0
PP
43#include <glib.h>
44
45struct bt_graph_listener {
46 void *func;
8cc092c9 47 bt_graph_listener_removed removed;
1bf957a0
PP
48 void *data;
49};
c0418dd9 50
8cc092c9
PP
51static
52int init_listeners_array(GArray **listeners)
53{
54 int ret = 0;
55
56 assert(listeners);
57 *listeners = g_array_new(FALSE, TRUE, sizeof(struct bt_graph_listener));
58 if (!*listeners) {
59 BT_LOGE_STR("Failed to allocate one GArray.");
60 ret = -1;
61 goto end;
62 }
63
64end:
65 return ret;
66}
67
68static
69void call_remove_listeners(GArray *listeners)
70{
71 size_t i;
72
73 for (i = 0; i < listeners->len; i++) {
74 struct bt_graph_listener listener =
75 g_array_index(listeners, struct bt_graph_listener, i);
76
77 if (listener.removed) {
78 listener.removed(listener.data);
79 }
80 }
81}
82
f60c8b34
JG
83static
84void bt_graph_destroy(struct bt_object *obj)
c0418dd9 85{
f60c8b34
JG
86 struct bt_graph *graph = container_of(obj,
87 struct bt_graph, base);
c0418dd9 88
bd14d768
PP
89 /*
90 * The graph's reference count is 0 if we're here. Increment
91 * it to avoid a double-destroy (possibly infinitely recursive)
92 * in this situation:
93 *
94 * 1. We put and destroy a connection.
95 * 2. This connection's destructor finalizes its active
96 * notification iterators.
97 * 3. A notification iterator's finalization function gets a
98 * new reference on its component (reference count goes from
99 * 0 to 1).
100 * 4. Since this component's reference count goes to 1, it takes
101 * a reference on its parent (this graph). This graph's
102 * reference count goes from 0 to 1.
103 * 5. The notification iterator's finalization function puts its
104 * component reference (reference count goes from 1 to 0).
105 * 6. Since this component's reference count goes from 1 to 0,
106 * it puts its parent (this graph). This graph's reference
107 * count goes from 1 to 0.
108 * 7. Since this graph's reference count goes from 1 to 0,
109 * its destructor is called (this function).
110 *
111 * With the incrementation below, the graph's reference count at
112 * step 4 goes from 1 to 2, and from 2 to 1 at step 6. This
113 * ensures that this function is not called two times.
114 */
262e5473 115 BT_LOGD("Destroying graph: addr=%p", graph);
bd14d768
PP
116 obj->ref_count.count++;
117
49682acd
PP
118 /*
119 * Cancel the graph to disallow some operations, like creating
120 * notification iterators and adding ports to components.
121 */
122 (void) bt_graph_cancel(graph);
123
8cc092c9
PP
124 /* Call all remove listeners */
125 call_remove_listeners(graph->listeners.port_added);
126 call_remove_listeners(graph->listeners.port_removed);
127 call_remove_listeners(graph->listeners.ports_connected);
128 call_remove_listeners(graph->listeners.ports_disconnected);
129
c0418dd9 130 if (graph->connections) {
262e5473 131 BT_LOGD_STR("Destroying connections.");
c0418dd9
JG
132 g_ptr_array_free(graph->connections, TRUE);
133 }
bd14d768 134 if (graph->components) {
262e5473 135 BT_LOGD_STR("Destroying components.");
bd14d768
PP
136 g_ptr_array_free(graph->components, TRUE);
137 }
f60c8b34
JG
138 if (graph->sinks_to_consume) {
139 g_queue_free(graph->sinks_to_consume);
c0418dd9 140 }
1bf957a0
PP
141
142 if (graph->listeners.port_added) {
143 g_array_free(graph->listeners.port_added, TRUE);
144 }
145
146 if (graph->listeners.port_removed) {
147 g_array_free(graph->listeners.port_removed, TRUE);
148 }
149
f345f8bb
PP
150 if (graph->listeners.ports_connected) {
151 g_array_free(graph->listeners.ports_connected, TRUE);
1bf957a0
PP
152 }
153
f345f8bb
PP
154 if (graph->listeners.ports_disconnected) {
155 g_array_free(graph->listeners.ports_disconnected, TRUE);
1bf957a0
PP
156 }
157
c0418dd9
JG
158 g_free(graph);
159}
160
f60c8b34 161struct bt_graph *bt_graph_create(void)
c0418dd9 162{
f60c8b34 163 struct bt_graph *graph;
1bf957a0 164 int ret;
c0418dd9 165
262e5473 166 BT_LOGD_STR("Creating graph object.");
f60c8b34 167 graph = g_new0(struct bt_graph, 1);
c0418dd9 168 if (!graph) {
262e5473 169 BT_LOGE_STR("Failed to allocate one graph.");
c0418dd9
JG
170 goto end;
171 }
172
f60c8b34 173 bt_object_init(graph, bt_graph_destroy);
c0418dd9 174
f60c8b34 175 graph->connections = g_ptr_array_new_with_free_func(bt_object_release);
c0418dd9 176 if (!graph->connections) {
262e5473 177 BT_LOGE_STR("Failed to allocate one GPtrArray.");
c0418dd9
JG
178 goto error;
179 }
f60c8b34
JG
180 graph->components = g_ptr_array_new_with_free_func(bt_object_release);
181 if (!graph->components) {
262e5473 182 BT_LOGE_STR("Failed to allocate one GPtrArray.");
f60c8b34
JG
183 goto error;
184 }
185 graph->sinks_to_consume = g_queue_new();
186 if (!graph->sinks_to_consume) {
262e5473 187 BT_LOGE_STR("Failed to allocate one GQueue.");
c0418dd9
JG
188 goto error;
189 }
1bf957a0 190
1d915789 191 graph->can_consume = BT_TRUE;
1bf957a0
PP
192 ret = init_listeners_array(&graph->listeners.port_added);
193 if (ret) {
262e5473 194 BT_LOGE_STR("Cannot create the \"port added\" listener array.");
1bf957a0
PP
195 goto error;
196 }
197
198 ret = init_listeners_array(&graph->listeners.port_removed);
199 if (ret) {
262e5473 200 BT_LOGE_STR("Cannot create the \"port removed\" listener array.");
1bf957a0
PP
201 goto error;
202 }
203
f345f8bb 204 ret = init_listeners_array(&graph->listeners.ports_connected);
1bf957a0 205 if (ret) {
262e5473 206 BT_LOGE_STR("Cannot create the \"port connected\" listener array.");
1bf957a0
PP
207 goto error;
208 }
209
f345f8bb 210 ret = init_listeners_array(&graph->listeners.ports_disconnected);
1bf957a0 211 if (ret) {
262e5473 212 BT_LOGE_STR("Cannot create the \"port disconneted\" listener array.");
1bf957a0
PP
213 goto error;
214 }
215
262e5473
PP
216 BT_LOGD("Created graph object: addr=%p", graph);
217
c0418dd9
JG
218end:
219 return graph;
220error:
221 BT_PUT(graph);
222 goto end;
223}
224
a256a42d
PP
225enum bt_graph_status bt_graph_connect_ports(struct bt_graph *graph,
226 struct bt_port *upstream_port, struct bt_port *downstream_port,
227 struct bt_connection **user_connection)
f60c8b34 228{
a256a42d 229 enum bt_graph_status status = BT_GRAPH_STATUS_OK;
f60c8b34
JG
230 struct bt_connection *connection = NULL;
231 struct bt_graph *upstream_graph = NULL;
232 struct bt_graph *downstream_graph = NULL;
233 struct bt_component *upstream_component = NULL;
234 struct bt_component *downstream_component = NULL;
235 enum bt_component_status component_status;
1d915789 236 const bt_bool init_can_consume = graph->can_consume;
f60c8b34 237
262e5473
PP
238 if (!graph) {
239 BT_LOGW_STR("Invalid parameter: graph is NULL.");
a256a42d 240 status = BT_GRAPH_STATUS_INVALID;
262e5473
PP
241 goto end;
242 }
243
244 if (!upstream_port) {
245 BT_LOGW_STR("Invalid parameter: upstream port is NULL.");
a256a42d 246 status = BT_GRAPH_STATUS_INVALID;
262e5473
PP
247 goto end;
248 }
249
250 if (!downstream_port) {
251 BT_LOGW_STR("Invalid parameter: downstream port is NULL.");
a256a42d 252 status = BT_GRAPH_STATUS_INVALID;
f60c8b34
JG
253 goto end;
254 }
255
262e5473
PP
256 BT_LOGD("Connecting component ports within graph: "
257 "graph-addr=%p, "
258 "upstream-port-addr=%p, upstream-port-name=\"%s\", "
259 "downstream-port-addr=%p, downstream-port-name=\"%s\"",
260 graph, upstream_port, bt_port_get_name(upstream_port),
261 downstream_port, bt_port_get_name(downstream_port));
262
202a3a13 263 if (graph->canceled) {
262e5473 264 BT_LOGW_STR("Invalid parameter: graph is canceled.");
a256a42d 265 status = BT_GRAPH_STATUS_CANCELED;
202a3a13
PP
266 goto end;
267 }
268
1d915789
PP
269 graph->can_consume = BT_FALSE;
270
72b913fb 271 /* Ensure appropriate types for upstream and downstream ports. */
f60c8b34 272 if (bt_port_get_type(upstream_port) != BT_PORT_TYPE_OUTPUT) {
262e5473 273 BT_LOGW_STR("Invalid parameter: upstream port is not an output port.");
a256a42d 274 status = BT_GRAPH_STATUS_INVALID;
f60c8b34
JG
275 goto end;
276 }
277 if (bt_port_get_type(downstream_port) != BT_PORT_TYPE_INPUT) {
262e5473 278 BT_LOGW_STR("Invalid parameter: downstream port is not an input port.");
a256a42d 279 status = BT_GRAPH_STATUS_INVALID;
f60c8b34
JG
280 goto end;
281 }
282
72b913fb 283 /* Ensure that both ports are currently unconnected. */
0d8b4d8e 284 if (bt_port_is_connected(upstream_port)) {
262e5473 285 BT_LOGW_STR("Invalid parameter: upstream port is already connected.");
a256a42d 286 status = BT_GRAPH_STATUS_INVALID;
72b913fb
PP
287 goto end;
288 }
289
0d8b4d8e 290 if (bt_port_is_connected(downstream_port)) {
262e5473 291 BT_LOGW_STR("Invalid parameter: downstream port is already connected.");
a256a42d 292 status = BT_GRAPH_STATUS_INVALID;
72b913fb
PP
293 goto end;
294 }
295
296 /*
297 * Ensure that both ports are still attached to their creating
298 * component.
299 */
f60c8b34 300 upstream_component = bt_port_get_component(upstream_port);
72b913fb 301 if (!upstream_component) {
262e5473 302 BT_LOGW_STR("Invalid parameter: upstream port is loose (does not belong to a component)");
a256a42d 303 status = BT_GRAPH_STATUS_INVALID;
72b913fb
PP
304 goto end;
305 }
306
307 downstream_component = bt_port_get_component(downstream_port);
308 if (!downstream_component) {
262e5473 309 BT_LOGW_STR("Invalid parameter: downstream port is loose (does not belong to a component)");
a256a42d 310 status = BT_GRAPH_STATUS_INVALID;
72b913fb
PP
311 goto end;
312 }
313
262e5473
PP
314 BT_LOGD("Connecting component ports: "
315 "upstream-comp-addr=%p, upstream-comp-name=\"%s\", "
316 "downstream-comp-addr=%p, downstream-comp-name=\"%s\"",
317 upstream_component, bt_component_get_name(upstream_component),
318 downstream_component, bt_component_get_name(downstream_component));
319
0d8b4d8e
PP
320 /*
321 * At this point the ports are not connected yet. Both
322 * components need to accept an eventual connection to their
323 * port by the other port before we continue.
324 */
262e5473 325 BT_LOGD_STR("Asking upstream component to accept the connection.");
0d8b4d8e
PP
326 component_status = bt_component_accept_port_connection(
327 upstream_component, upstream_port, downstream_port);
328 if (component_status != BT_COMPONENT_STATUS_OK) {
262e5473
PP
329 if (component_status == BT_COMPONENT_STATUS_REFUSE_PORT_CONNECTION) {
330 BT_LOGD_STR("Upstream component refused the connection.");
331 } else {
332 BT_LOGW("Cannot ask upstream component to accept the connection: "
333 "status=%s", bt_component_status_string(component_status));
334 }
335
a256a42d
PP
336 status = bt_graph_status_from_component_status(
337 component_status);
338 goto end;
0d8b4d8e 339 }
262e5473
PP
340
341 BT_LOGD_STR("Asking downstream component to accept the connection.");
0d8b4d8e
PP
342 component_status = bt_component_accept_port_connection(
343 downstream_component, downstream_port, upstream_port);
344 if (component_status != BT_COMPONENT_STATUS_OK) {
262e5473
PP
345 if (component_status == BT_COMPONENT_STATUS_REFUSE_PORT_CONNECTION) {
346 BT_LOGD_STR("Downstream component refused the connection.");
347 } else {
348 BT_LOGW("Cannot ask downstream component to accept the connection: "
349 "status=%s", bt_component_status_string(component_status));
350 }
351
a256a42d
PP
352 status = bt_graph_status_from_component_status(
353 component_status);
354 goto end;
0d8b4d8e
PP
355 }
356
262e5473 357 BT_LOGD_STR("Creating connection.");
f60c8b34
JG
358 connection = bt_connection_create(graph, upstream_port,
359 downstream_port);
360 if (!connection) {
262e5473 361 BT_LOGW("Cannot create connection object.");
a256a42d
PP
362 status = BT_GRAPH_STATUS_NOMEM;
363 goto end;
f60c8b34
JG
364 }
365
262e5473
PP
366 BT_LOGD("Connection object created: conn-addr=%p", connection);
367
f60c8b34 368 /*
72b913fb
PP
369 * Ownership of upstream_component/downstream_component and of
370 * the connection object is transferred to the graph.
f60c8b34
JG
371 */
372 g_ptr_array_add(graph->connections, connection);
ffeb0eed 373
f60c8b34 374 /*
0d8b4d8e 375 * Notify both components that their port is connected.
f60c8b34 376 */
262e5473 377 BT_LOGD_STR("Notifying upstream component that its port is connected.");
0d8b4d8e
PP
378 bt_component_port_connected(upstream_component, upstream_port,
379 downstream_port);
262e5473 380 BT_LOGD_STR("Notifying downstream component that its port is connected.");
0d8b4d8e
PP
381 bt_component_port_connected(downstream_component, downstream_port,
382 upstream_port);
1bf957a0
PP
383
384 /*
0d8b4d8e 385 * Notify the graph's creator that both ports are connected.
1bf957a0 386 */
262e5473 387 BT_LOGD_STR("Notifying graph's user that new component ports are connected.");
f345f8bb 388 bt_graph_notify_ports_connected(graph, upstream_port, downstream_port);
262e5473
PP
389 BT_LOGD("Connected component ports within graph: "
390 "graph-addr=%p, "
391 "upstream-comp-addr=%p, upstream-comp-name=\"%s\", "
392 "downstream-comp-addr=%p, downstream-comp-name=\"%s\", "
393 "upstream-port-addr=%p, upstream-port-name=\"%s\", "
394 "downstream-port-addr=%p, downstream-port-name=\"%s\"",
395 graph,
396 upstream_component, bt_component_get_name(upstream_component),
397 downstream_component, bt_component_get_name(downstream_component),
398 upstream_port, bt_port_get_name(upstream_port),
399 downstream_port, bt_port_get_name(downstream_port));
1bf957a0 400
a256a42d 401 if (user_connection) {
1a6a376a
PP
402 /* Move reference to user */
403 *user_connection = connection;
404 connection = NULL;
a256a42d
PP
405 }
406
f60c8b34
JG
407end:
408 bt_put(upstream_graph);
409 bt_put(downstream_graph);
3eeacbb9
JG
410 bt_put(upstream_component);
411 bt_put(downstream_component);
a256a42d 412 bt_put(connection);
1d915789 413 graph->can_consume = init_can_consume;
a256a42d 414 return status;
f60c8b34
JG
415}
416
851b70bd
PP
417static
418enum bt_graph_status bt_graph_consume_no_check(struct bt_graph *graph)
c0418dd9 419{
f60c8b34 420 struct bt_component *sink;
72b913fb
PP
421 enum bt_graph_status status = BT_GRAPH_STATUS_OK;
422 enum bt_component_status comp_status;
f60c8b34
JG
423 GList *current_node;
424
851b70bd 425 BT_LOGV("Making next sink consume: addr=%p", graph);
202a3a13 426
2de524b3
PP
427 if (!graph->has_sink) {
428 BT_LOGW_STR("Graph has no sink component.");
429 status = BT_GRAPH_STATUS_NO_SINK;
430 goto end;
431 }
432
f60c8b34 433 if (g_queue_is_empty(graph->sinks_to_consume)) {
262e5473 434 BT_LOGV_STR("Graph's sink queue is empty: end of graph.");
72b913fb 435 status = BT_GRAPH_STATUS_END;
f60c8b34
JG
436 goto end;
437 }
438
439 current_node = g_queue_pop_head_link(graph->sinks_to_consume);
440 sink = current_node->data;
262e5473
PP
441 BT_LOGV("Chose next sink to consume: comp-addr=%p, comp-name=\"%s\"",
442 sink, bt_component_get_name(sink));
72b913fb 443 comp_status = bt_component_sink_consume(sink);
262e5473
PP
444 BT_LOGV("Consumed from sink: status=%s",
445 bt_component_status_string(comp_status));
72b913fb
PP
446 switch (comp_status) {
447 case BT_COMPONENT_STATUS_OK:
448 break;
449 case BT_COMPONENT_STATUS_END:
450 status = BT_GRAPH_STATUS_END;
451 break;
452 case BT_COMPONENT_STATUS_AGAIN:
453 status = BT_GRAPH_STATUS_AGAIN;
454 break;
455 case BT_COMPONENT_STATUS_INVALID:
456 status = BT_GRAPH_STATUS_INVALID;
457 break;
458 default:
459 status = BT_GRAPH_STATUS_ERROR;
460 break;
461 }
462
463 if (status != BT_GRAPH_STATUS_END) {
f60c8b34
JG
464 g_queue_push_tail_link(graph->sinks_to_consume, current_node);
465 goto end;
466 }
467
468 /* End reached, the node is not added back to the queue and free'd. */
469 g_queue_delete_link(graph->sinks_to_consume, current_node);
470
471 /* Don't forward an END status if there are sinks left to consume. */
472 if (!g_queue_is_empty(graph->sinks_to_consume)) {
473 status = BT_GRAPH_STATUS_OK;
474 goto end;
475 }
476end:
262e5473 477 BT_LOGV("Graph consumed: status=%s", bt_graph_status_string(status));
f60c8b34 478 return status;
c0418dd9
JG
479}
480
851b70bd
PP
481enum bt_graph_status bt_graph_consume(struct bt_graph *graph)
482{
483 enum bt_graph_status status = BT_GRAPH_STATUS_OK;
484
485 if (!graph) {
486 BT_LOGW_STR("Invalid parameter: graph is NULL.");
487 status = BT_GRAPH_STATUS_INVALID;
488 goto end;
489 }
490
491 if (graph->canceled) {
492 BT_LOGW("Invalid parameter: graph is canceled: "
493 "graph-addr=%p", graph);
494 status = BT_GRAPH_STATUS_CANCELED;
495 goto end;
496 }
497
1d915789
PP
498 if (!graph->can_consume) {
499 BT_LOGW_STR("Cannot consume graph in its current state.");
500 status = BT_GRAPH_STATUS_CANNOT_CONSUME;
501 goto end;
502 }
503
504 graph->can_consume = BT_FALSE;
851b70bd 505 status = bt_graph_consume_no_check(graph);
1d915789 506 graph->can_consume = BT_TRUE;
851b70bd
PP
507
508end:
509 return status;
510}
511
72b913fb 512enum bt_graph_status bt_graph_run(struct bt_graph *graph)
f60c8b34 513{
72b913fb 514 enum bt_graph_status status = BT_GRAPH_STATUS_OK;
f60c8b34
JG
515
516 if (!graph) {
262e5473 517 BT_LOGW_STR("Invalid parameter: graph is NULL.");
72b913fb 518 status = BT_GRAPH_STATUS_INVALID;
202a3a13 519 goto end;
f60c8b34
JG
520 }
521
851b70bd
PP
522 if (graph->canceled) {
523 BT_LOGW("Invalid parameter: graph is canceled: "
524 "graph-addr=%p", graph);
525 status = BT_GRAPH_STATUS_CANCELED;
526 goto end;
527 }
528
1d915789
PP
529 if (!graph->can_consume) {
530 BT_LOGW_STR("Cannot run graph in its current state.");
531 status = BT_GRAPH_STATUS_CANNOT_CONSUME;
532 goto end;
533 }
534
535 graph->can_consume = BT_FALSE;
262e5473
PP
536 BT_LOGV("Running graph: addr=%p", graph);
537
f60c8b34 538 do {
851b70bd
PP
539 /*
540 * Check if the graph is canceled at each iteration. If
541 * the graph was canceled by another thread or by a
542 * signal, this is not a warning nor an error, it was
543 * intentional: log with a DEBUG level only.
544 */
545 if (graph->canceled) {
546 BT_LOGD("Stopping the graph: graph is canceled: "
547 "graph-addr=%p", graph);
548 status = BT_GRAPH_STATUS_CANCELED;
549 goto end;
550 }
551
4fef099a 552 status = bt_graph_consume_no_check(graph);
72b913fb 553 if (status == BT_GRAPH_STATUS_AGAIN) {
f60c8b34 554 /*
202a3a13
PP
555 * If AGAIN is received and there are multiple
556 * sinks, go ahead and consume from the next
557 * sink.
f60c8b34 558 *
202a3a13
PP
559 * However, in the case where a single sink is
560 * left, the caller can decide to busy-wait and
561 * call bt_graph_run() continuously until the
562 * source is ready or it can decide to sleep for
563 * an arbitrary amount of time.
f60c8b34
JG
564 */
565 if (graph->sinks_to_consume->length > 1) {
72b913fb 566 status = BT_GRAPH_STATUS_OK;
f60c8b34 567 }
2de524b3
PP
568 } else if (status == BT_GRAPH_STATUS_NO_SINK) {
569 goto end;
f60c8b34 570 }
72b913fb 571 } while (status == BT_GRAPH_STATUS_OK);
f60c8b34
JG
572
573 if (g_queue_is_empty(graph->sinks_to_consume)) {
72b913fb 574 status = BT_GRAPH_STATUS_END;
f60c8b34 575 }
262e5473 576
202a3a13 577end:
262e5473 578 BT_LOGV("Graph ran: status=%s", bt_graph_status_string(status));
1d915789 579 graph->can_consume = BT_TRUE;
72b913fb 580 return status;
f60c8b34 581}
1bf957a0
PP
582
583static
8cc092c9 584int add_listener(GArray *listeners, void *func, void *removed, void *data)
1bf957a0
PP
585{
586 struct bt_graph_listener listener = {
587 .func = func,
8cc092c9 588 .removed = removed,
1bf957a0
PP
589 .data = data,
590 };
591
592 g_array_append_val(listeners, listener);
0d107cdd 593 return listeners->len - 1;
1bf957a0
PP
594}
595
0d107cdd 596int bt_graph_add_port_added_listener(
1bf957a0 597 struct bt_graph *graph,
8cc092c9
PP
598 bt_graph_port_added_listener listener,
599 bt_graph_listener_removed listener_removed, void *data)
1bf957a0 600{
0d107cdd 601 int ret;
1bf957a0 602
262e5473
PP
603 if (!graph) {
604 BT_LOGW_STR("Invalid parameter: graph is NULL.");
0d107cdd 605 ret = -1;
262e5473
PP
606 goto end;
607 }
608
8cc092c9
PP
609 if (graph->in_remove_listener) {
610 BT_LOGW("Cannot call this function during the execution of a remove listener: "
611 "addr=%p", graph);
612 ret = -1;
613 goto end;
614 }
615
262e5473
PP
616 if (!listener) {
617 BT_LOGW_STR("Invalid parameter: listener is NULL.");
0d107cdd 618 ret = -1;
1bf957a0
PP
619 goto end;
620 }
621
8cc092c9
PP
622 ret = add_listener(graph->listeners.port_added, listener,
623 listener_removed, data);
262e5473 624 BT_LOGV("Added \"port added\" listener to graph: "
0d107cdd
PP
625 "graph-addr=%p, listener-addr=%p, pos=%d",
626 graph, listener, ret);
1bf957a0
PP
627
628end:
0d107cdd 629 return ret;
1bf957a0
PP
630}
631
0d107cdd 632int bt_graph_add_port_removed_listener(
1bf957a0 633 struct bt_graph *graph,
8cc092c9
PP
634 bt_graph_port_removed_listener listener,
635 bt_graph_listener_removed listener_removed, void *data)
1bf957a0 636{
0d107cdd 637 int ret;
1bf957a0 638
262e5473
PP
639 if (!graph) {
640 BT_LOGW_STR("Invalid parameter: graph is NULL.");
0d107cdd 641 ret = -1;
262e5473
PP
642 goto end;
643 }
644
8cc092c9
PP
645 if (graph->in_remove_listener) {
646 BT_LOGW("Cannot call this function during the execution of a remove listener: "
647 "addr=%p", graph);
648 ret = -1;
649 goto end;
650 }
651
262e5473
PP
652 if (!listener) {
653 BT_LOGW_STR("Invalid parameter: listener is NULL.");
0d107cdd 654 ret = -1;
1bf957a0
PP
655 goto end;
656 }
657
8cc092c9
PP
658 ret = add_listener(graph->listeners.port_removed, listener,
659 listener_removed, data);
262e5473 660 BT_LOGV("Added \"port removed\" listener to graph: "
0d107cdd
PP
661 "graph-addr=%p, listener-addr=%p, pos=%d",
662 graph, listener, ret);
1bf957a0
PP
663
664end:
0d107cdd 665 return ret;
1bf957a0
PP
666}
667
0d107cdd 668int bt_graph_add_ports_connected_listener(
1bf957a0 669 struct bt_graph *graph,
8cc092c9
PP
670 bt_graph_ports_connected_listener listener,
671 bt_graph_listener_removed listener_removed, void *data)
1bf957a0 672{
0d107cdd 673 int ret;
1bf957a0 674
262e5473
PP
675 if (!graph) {
676 BT_LOGW_STR("Invalid parameter: graph is NULL.");
0d107cdd 677 ret = -1;
262e5473
PP
678 goto end;
679 }
680
8cc092c9
PP
681 if (graph->in_remove_listener) {
682 BT_LOGW("Cannot call this function during the execution of a remove listener: "
683 "addr=%p", graph);
684 ret = -1;
685 goto end;
686 }
687
262e5473
PP
688 if (!listener) {
689 BT_LOGW_STR("Invalid parameter: listener is NULL.");
0d107cdd 690 ret = -1;
1bf957a0
PP
691 goto end;
692 }
693
8cc092c9
PP
694 ret = add_listener(graph->listeners.ports_connected, listener,
695 listener_removed, data);
262e5473 696 BT_LOGV("Added \"port connected\" listener to graph: "
0d107cdd
PP
697 "graph-addr=%p, listener-addr=%p, pos=%d",
698 graph, listener, ret);
1bf957a0
PP
699
700end:
0d107cdd 701 return ret;
1bf957a0
PP
702}
703
0d107cdd 704int bt_graph_add_ports_disconnected_listener(
1bf957a0 705 struct bt_graph *graph,
8cc092c9
PP
706 bt_graph_ports_disconnected_listener listener,
707 bt_graph_listener_removed listener_removed, void *data)
1bf957a0 708{
0d107cdd 709 int ret;
1bf957a0 710
262e5473
PP
711 if (!graph) {
712 BT_LOGW_STR("Invalid parameter: graph is NULL.");
0d107cdd 713 ret = -1;
262e5473
PP
714 goto end;
715 }
716
8cc092c9
PP
717 if (graph->in_remove_listener) {
718 BT_LOGW("Cannot call this function during the execution of a remove listener: "
719 "addr=%p", graph);
720 ret = -1;
721 goto end;
722 }
723
262e5473
PP
724 if (!listener) {
725 BT_LOGW_STR("Invalid parameter: listener is NULL.");
0d107cdd 726 ret = -1;
1bf957a0
PP
727 goto end;
728 }
729
8cc092c9
PP
730 ret = add_listener(graph->listeners.ports_disconnected, listener,
731 listener_removed, data);
262e5473 732 BT_LOGV("Added \"port disconnected\" listener to graph: "
0d107cdd
PP
733 "graph-addr=%p, listener-addr=%p, pos=%d",
734 graph, listener, ret);
1bf957a0
PP
735
736end:
0d107cdd 737 return ret;
1bf957a0
PP
738}
739
740BT_HIDDEN
741void bt_graph_notify_port_added(struct bt_graph *graph, struct bt_port *port)
742{
743 size_t i;
744
262e5473
PP
745 BT_LOGV("Notifying graph listeners that a port was added: "
746 "graph-addr=%p, port-addr=%p, port-name=\"%s\"",
747 graph, port, bt_port_get_name(port));
748
1bf957a0
PP
749 for (i = 0; i < graph->listeners.port_added->len; i++) {
750 struct bt_graph_listener listener =
751 g_array_index(graph->listeners.port_added,
752 struct bt_graph_listener, i);
753 bt_graph_port_added_listener func = listener.func;
754
755 assert(func);
756 func(port, listener.data);
757 }
758}
759
760BT_HIDDEN
761void bt_graph_notify_port_removed(struct bt_graph *graph,
762 struct bt_component *comp, struct bt_port *port)
763{
764 size_t i;
765
262e5473
PP
766 BT_LOGV("Notifying graph listeners that a port was removed: "
767 "graph-addr=%p, port-addr=%p, port-name=\"%s\"",
768 graph, port, bt_port_get_name(port));
769
1bf957a0
PP
770 for (i = 0; i < graph->listeners.port_removed->len; i++) {
771 struct bt_graph_listener listener =
772 g_array_index(graph->listeners.port_removed,
773 struct bt_graph_listener, i);
774 bt_graph_port_removed_listener func = listener.func;
775
776 assert(func);
777 func(comp, port, listener.data);
778 }
779}
780
781BT_HIDDEN
f345f8bb
PP
782void bt_graph_notify_ports_connected(struct bt_graph *graph,
783 struct bt_port *upstream_port, struct bt_port *downstream_port)
1bf957a0
PP
784{
785 size_t i;
786
262e5473
PP
787 BT_LOGV("Notifying graph listeners that two ports were connected: "
788 "graph-addr=%p, "
789 "upstream-port-addr=%p, upstream-port-name=\"%s\", "
790 "downstream-port-addr=%p, downstream-port-name=\"%s\"",
791 graph, upstream_port, bt_port_get_name(upstream_port),
792 downstream_port, bt_port_get_name(downstream_port));
793
f345f8bb 794 for (i = 0; i < graph->listeners.ports_connected->len; i++) {
1bf957a0 795 struct bt_graph_listener listener =
f345f8bb 796 g_array_index(graph->listeners.ports_connected,
1bf957a0 797 struct bt_graph_listener, i);
f345f8bb 798 bt_graph_ports_connected_listener func = listener.func;
1bf957a0
PP
799
800 assert(func);
f345f8bb 801 func(upstream_port, downstream_port, listener.data);
1bf957a0
PP
802 }
803}
804
805BT_HIDDEN
f345f8bb
PP
806void bt_graph_notify_ports_disconnected(struct bt_graph *graph,
807 struct bt_component *upstream_comp,
808 struct bt_component *downstream_comp,
809 struct bt_port *upstream_port, struct bt_port *downstream_port)
1bf957a0
PP
810{
811 size_t i;
812
262e5473
PP
813 BT_LOGV("Notifying graph listeners that two ports were disconnected: "
814 "graph-addr=%p, "
815 "upstream-port-addr=%p, upstream-port-name=\"%s\", "
816 "downstream-port-addr=%p, downstream-port-name=\"%s\"",
817 graph, upstream_port, bt_port_get_name(upstream_port),
818 downstream_port, bt_port_get_name(downstream_port));
819
f345f8bb 820 for (i = 0; i < graph->listeners.ports_disconnected->len; i++) {
1bf957a0 821 struct bt_graph_listener listener =
f345f8bb 822 g_array_index(graph->listeners.ports_disconnected,
1bf957a0 823 struct bt_graph_listener, i);
f345f8bb 824 bt_graph_ports_disconnected_listener func = listener.func;
1bf957a0
PP
825
826 assert(func);
f345f8bb
PP
827 func(upstream_comp, downstream_comp, upstream_port,
828 downstream_port, listener.data);
1bf957a0
PP
829 }
830}
202a3a13 831
c7eee084 832enum bt_graph_status bt_graph_cancel(struct bt_graph *graph)
202a3a13
PP
833{
834 enum bt_graph_status ret = BT_GRAPH_STATUS_OK;
835
836 if (!graph) {
262e5473 837 BT_LOGW_STR("Invalid parameter: graph is NULL.");
202a3a13
PP
838 ret = BT_GRAPH_STATUS_INVALID;
839 goto end;
840 }
841
842 graph->canceled = BT_TRUE;
262e5473 843 BT_LOGV("Canceled graph: addr=%p", graph);
202a3a13
PP
844
845end:
846 return ret;
847}
848
c7eee084 849bt_bool bt_graph_is_canceled(struct bt_graph *graph)
202a3a13 850{
c7eee084
PP
851 bt_bool canceled = BT_FALSE;
852
853 if (!graph) {
854 BT_LOGW_STR("Invalid parameter: graph is NULL.");
855 goto end;
856 }
857
858 canceled = graph->canceled;
859
860end:
861 return canceled;
202a3a13 862}
f167d3c0
PP
863
864BT_HIDDEN
865void bt_graph_remove_connection(struct bt_graph *graph,
866 struct bt_connection *connection)
867{
868 assert(graph);
869 assert(connection);
262e5473
PP
870 BT_LOGV("Removing graph's connection: graph-addr=%p, conn-addr=%p",
871 graph, connection);
f167d3c0
PP
872 g_ptr_array_remove(graph->connections, connection);
873}
36712f1d
PP
874
875enum bt_graph_status bt_graph_add_component_with_init_method_data(
876 struct bt_graph *graph,
877 struct bt_component_class *component_class,
878 const char *name, struct bt_value *params,
879 void *init_method_data,
880 struct bt_component **user_component)
881{
882 enum bt_graph_status graph_status = BT_GRAPH_STATUS_OK;
883 enum bt_component_status comp_status;
884 struct bt_component *component = NULL;
885 enum bt_component_class_type type;
886 size_t i;
1d915789 887 const bt_bool init_can_consume = graph->can_consume;
36712f1d
PP
888
889 bt_get(params);
890
891 if (!graph) {
892 BT_LOGW_STR("Invalid parameter: graph is NULL.");
893 graph_status = BT_GRAPH_STATUS_INVALID;
894 goto end;
895 }
896
897 if (!component_class) {
898 BT_LOGW_STR("Invalid parameter: component class is NULL.");
899 graph_status = BT_GRAPH_STATUS_INVALID;
900 goto end;
901 }
902
1d915789 903 graph->can_consume = BT_FALSE;
36712f1d
PP
904 type = bt_component_class_get_type(component_class);
905 BT_LOGD("Adding component to graph: "
906 "graph-addr=%p, comp-cls-addr=%p, "
907 "comp-cls-type=%s, name=\"%s\", params-addr=%p, "
908 "init-method-data-addr=%p",
909 graph, component_class, bt_component_class_type_string(type),
910 name, params, init_method_data);
911
912 if (!name) {
913 BT_LOGW_STR("Invalid parameter: name is NULL.");
914 graph_status = BT_GRAPH_STATUS_INVALID;
915 goto end;
916 }
917
918 if (graph->canceled) {
919 BT_LOGW_STR("Invalid parameter: graph is canceled.");
920 graph_status = BT_GRAPH_STATUS_CANCELED;
921 goto end;
922 }
923
924 if (type != BT_COMPONENT_CLASS_TYPE_SOURCE &&
925 type != BT_COMPONENT_CLASS_TYPE_FILTER &&
926 type != BT_COMPONENT_CLASS_TYPE_SINK) {
927 BT_LOGW("Invalid parameter: unknown component class type: "
928 "type=%d", type);
929 graph_status = BT_GRAPH_STATUS_INVALID;
930 goto end;
931 }
932
933 for (i = 0; i < graph->components->len; i++) {
934 void *other_comp = graph->components->pdata[i];
935
936 if (strcmp(name, bt_component_get_name(other_comp)) == 0) {
937 BT_LOGW("Invalid parameter: another component with the same name already exists in the graph: "
938 "other-comp-addr=%p, name=\"%s\"",
939 other_comp, name);
940 graph_status = BT_GRAPH_STATUS_INVALID;
941 goto end;
942 }
943 }
944
945 /*
946 * Parameters must be a map value, but we create a convenient
947 * empty one if it's NULL.
948 */
949 if (params) {
950 if (!bt_value_is_map(params)) {
951 BT_LOGW("Invalid parameter: initialization parameters must be a map value: "
952 "type=%s",
953 bt_value_type_string(bt_value_get_type(params)));
954 graph_status = BT_GRAPH_STATUS_INVALID;
955 goto end;
956 }
957 } else {
958 params = bt_value_map_create();
959 if (!params) {
960 BT_LOGE_STR("Cannot create map value object.");
961 graph_status = BT_GRAPH_STATUS_NOMEM;
962 goto end;
963 }
964 }
965
966 comp_status = bt_component_create(component_class, name, &component);
967 if (comp_status != BT_COMPONENT_STATUS_OK) {
968 BT_LOGE("Cannot create empty component object: status=%s",
969 bt_component_status_string(comp_status));
970 graph_status = bt_graph_status_from_component_status(
971 comp_status);
972 goto end;
973 }
974
975 /*
976 * The user's initialization method needs to see that this
977 * component is part of the graph. If the user method fails, we
978 * immediately remove the component from the graph's components.
979 */
980 g_ptr_array_add(graph->components, component);
981 bt_component_set_graph(component, graph);
982
983 if (component_class->methods.init) {
984 BT_LOGD_STR("Calling user's initialization method.");
985 comp_status = component_class->methods.init(
986 bt_private_component_from_component(component), params,
987 init_method_data);
988 BT_LOGD("User method returned: status=%s",
989 bt_component_status_string(comp_status));
990 if (comp_status != BT_COMPONENT_STATUS_OK) {
991 BT_LOGW_STR("Initialization method failed.");
992 graph_status = bt_graph_status_from_component_status(
993 comp_status);
994 bt_component_set_graph(component, NULL);
995 g_ptr_array_remove_fast(graph->components, component);
996 goto end;
997 }
998 }
999
1000 /*
1001 * Mark the component as initialized so that its finalization
1002 * method is called when it is destroyed.
1003 */
1004 component->initialized = true;
1005
1006 /*
1007 * If it's a sink component, it needs to be part of the graph's
1008 * sink queue to be consumed by bt_graph_consume().
1009 */
1010 if (bt_component_is_sink(component)) {
2de524b3 1011 graph->has_sink = BT_TRUE;
36712f1d
PP
1012 g_queue_push_tail(graph->sinks_to_consume, component);
1013 }
1014
1015 /*
1016 * Freeze the component class now that it's instantiated at
1017 * least once.
1018 */
1019 BT_LOGD_STR("Freezing component class.");
1020 bt_component_class_freeze(component->class);
1021 BT_LOGD("Added component to graph: "
1022 "graph-addr=%p, comp-cls-addr=%p, "
1023 "comp-cls-type=%s, name=\"%s\", params-addr=%p, "
1024 "init-method-data-addr=%p, comp-addr=%p",
1025 graph, component_class, bt_component_class_type_string(type),
1026 name, params, init_method_data, component);
1027
1028 if (user_component) {
1029 /* Move reference to user */
1030 *user_component = component;
1031 component = NULL;
1032 }
1033
1034end:
1035 bt_put(component);
1036 bt_put(params);
1d915789 1037 graph->can_consume = init_can_consume;
36712f1d
PP
1038 return graph_status;
1039}
1040
1041enum bt_graph_status bt_graph_add_component(
1042 struct bt_graph *graph,
1043 struct bt_component_class *component_class,
1044 const char *name, struct bt_value *params,
1045 struct bt_component **component)
1046{
1047 return bt_graph_add_component_with_init_method_data(graph,
1048 component_class, name, params, NULL, component);
1049}
This page took 0.082067 seconds and 4 git commands to generate.