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