4 * Babeltrace Plugin Component Graph
6 * Copyright 2017 Jérémie Galarneau <jeremie.galarneau@efficios.com>
7 * Copyright 2017 Philippe Proulx <pproulx@efficios.com>
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:
16 * The above copyright notice and this permission notice shall be included in
17 * all copies or substantial portions of the Software.
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
28 #define BT_LOG_TAG "GRAPH"
29 #include <babeltrace/lib-logging-internal.h>
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/graph/notification-internal.h>
39 #include <babeltrace/graph/notification-event-internal.h>
40 #include <babeltrace/graph/notification-packet-internal.h>
41 #include <babeltrace/compiler-internal.h>
42 #include <babeltrace/types.h>
43 #include <babeltrace/values.h>
44 #include <babeltrace/values-internal.h>
45 #include <babeltrace/assert-internal.h>
46 #include <babeltrace/assert-pre-internal.h>
50 struct bt_graph_listener
{
52 bt_graph_listener_removed removed
;
57 int init_listeners_array(GArray
**listeners
)
62 *listeners
= g_array_new(FALSE
, TRUE
, sizeof(struct bt_graph_listener
));
64 BT_LOGE_STR("Failed to allocate one GArray.");
74 void call_remove_listeners(GArray
*listeners
)
78 for (i
= 0; i
< listeners
->len
; i
++) {
79 struct bt_graph_listener listener
=
80 g_array_index(listeners
, struct bt_graph_listener
, i
);
82 if (listener
.removed
) {
83 listener
.removed(listener
.data
);
89 void bt_graph_destroy(struct bt_object
*obj
)
91 struct bt_graph
*graph
= container_of(obj
,
92 struct bt_graph
, base
);
95 * The graph's reference count is 0 if we're here. Increment
96 * it to avoid a double-destroy (possibly infinitely recursive)
99 * 1. We put and destroy a connection.
100 * 2. This connection's destructor finalizes its active
101 * notification iterators.
102 * 3. A notification iterator's finalization function gets a
103 * new reference on its component (reference count goes from
105 * 4. Since this component's reference count goes to 1, it takes
106 * a reference on its parent (this graph). This graph's
107 * reference count goes from 0 to 1.
108 * 5. The notification iterator's finalization function puts its
109 * component reference (reference count goes from 1 to 0).
110 * 6. Since this component's reference count goes from 1 to 0,
111 * it puts its parent (this graph). This graph's reference
112 * count goes from 1 to 0.
113 * 7. Since this graph's reference count goes from 1 to 0,
114 * its destructor is called (this function).
116 * With the incrementation below, the graph's reference count at
117 * step 4 goes from 1 to 2, and from 2 to 1 at step 6. This
118 * ensures that this function is not called two times.
120 BT_LOGD("Destroying graph: addr=%p", graph
);
124 * Cancel the graph to disallow some operations, like creating
125 * notification iterators and adding ports to components.
127 (void) bt_graph_cancel(graph
);
129 /* Call all remove listeners */
130 call_remove_listeners(graph
->listeners
.port_added
);
131 call_remove_listeners(graph
->listeners
.port_removed
);
132 call_remove_listeners(graph
->listeners
.ports_connected
);
133 call_remove_listeners(graph
->listeners
.ports_disconnected
);
135 if (graph
->notifications
) {
136 g_ptr_array_free(graph
->notifications
, TRUE
);
139 if (graph
->connections
) {
140 BT_LOGD_STR("Destroying connections.");
141 g_ptr_array_free(graph
->connections
, TRUE
);
144 if (graph
->components
) {
145 BT_LOGD_STR("Destroying components.");
146 g_ptr_array_free(graph
->components
, TRUE
);
149 if (graph
->sinks_to_consume
) {
150 g_queue_free(graph
->sinks_to_consume
);
153 if (graph
->listeners
.port_added
) {
154 g_array_free(graph
->listeners
.port_added
, TRUE
);
157 if (graph
->listeners
.port_removed
) {
158 g_array_free(graph
->listeners
.port_removed
, TRUE
);
161 if (graph
->listeners
.ports_connected
) {
162 g_array_free(graph
->listeners
.ports_connected
, TRUE
);
165 if (graph
->listeners
.ports_disconnected
) {
166 g_array_free(graph
->listeners
.ports_disconnected
, TRUE
);
169 bt_object_pool_finalize(&graph
->event_notif_pool
);
170 bt_object_pool_finalize(&graph
->packet_begin_notif_pool
);
171 bt_object_pool_finalize(&graph
->packet_end_notif_pool
);
176 void destroy_notification_event(struct bt_notification
*notif
,
177 struct bt_graph
*graph
)
179 bt_notification_event_destroy(notif
);
183 void destroy_notification_packet_begin(struct bt_notification
*notif
,
184 struct bt_graph
*graph
)
186 bt_notification_packet_begin_destroy(notif
);
190 void destroy_notification_packet_end(struct bt_notification
*notif
,
191 struct bt_graph
*graph
)
193 bt_notification_packet_end_destroy(notif
);
197 void notify_notification_graph_is_destroyed(struct bt_notification
*notif
)
199 bt_notification_unlink_graph(notif
);
202 struct bt_graph
*bt_graph_create(void)
204 struct bt_graph
*graph
;
207 BT_LOGD_STR("Creating graph object.");
208 graph
= g_new0(struct bt_graph
, 1);
210 BT_LOGE_STR("Failed to allocate one graph.");
214 bt_object_init_shared(&graph
->base
, bt_graph_destroy
);
215 graph
->connections
= g_ptr_array_new_with_free_func(
216 (GDestroyNotify
) bt_object_try_spec_release
);
217 if (!graph
->connections
) {
218 BT_LOGE_STR("Failed to allocate one GPtrArray.");
221 graph
->components
= g_ptr_array_new_with_free_func(
222 (GDestroyNotify
) bt_object_try_spec_release
);
223 if (!graph
->components
) {
224 BT_LOGE_STR("Failed to allocate one GPtrArray.");
227 graph
->sinks_to_consume
= g_queue_new();
228 if (!graph
->sinks_to_consume
) {
229 BT_LOGE_STR("Failed to allocate one GQueue.");
233 graph
->can_consume
= BT_TRUE
;
234 ret
= init_listeners_array(&graph
->listeners
.port_added
);
236 BT_LOGE_STR("Cannot create the \"port added\" listener array.");
240 ret
= init_listeners_array(&graph
->listeners
.port_removed
);
242 BT_LOGE_STR("Cannot create the \"port removed\" listener array.");
246 ret
= init_listeners_array(&graph
->listeners
.ports_connected
);
248 BT_LOGE_STR("Cannot create the \"port connected\" listener array.");
252 ret
= init_listeners_array(&graph
->listeners
.ports_disconnected
);
254 BT_LOGE_STR("Cannot create the \"port disconneted\" listener array.");
258 ret
= bt_object_pool_initialize(&graph
->event_notif_pool
,
259 (bt_object_pool_new_object_func
) bt_notification_event_new
,
260 (bt_object_pool_destroy_object_func
) destroy_notification_event
,
263 BT_LOGE("Failed to initialize event notification pool: ret=%d",
268 ret
= bt_object_pool_initialize(&graph
->packet_begin_notif_pool
,
269 (bt_object_pool_new_object_func
) bt_notification_packet_begin_new
,
270 (bt_object_pool_destroy_object_func
) destroy_notification_packet_begin
,
273 BT_LOGE("Failed to initialize packet beginning notification pool: ret=%d",
278 ret
= bt_object_pool_initialize(&graph
->packet_end_notif_pool
,
279 (bt_object_pool_new_object_func
) bt_notification_packet_end_new
,
280 (bt_object_pool_destroy_object_func
) destroy_notification_packet_end
,
283 BT_LOGE("Failed to initialize packet end notification pool: ret=%d",
288 graph
->notifications
= g_ptr_array_new_with_free_func(
289 (GDestroyNotify
) notify_notification_graph_is_destroyed
);
290 BT_LOGD("Created graph object: addr=%p", graph
);
299 enum bt_graph_status
bt_graph_connect_ports(struct bt_graph
*graph
,
300 struct bt_port
*upstream_port
, struct bt_port
*downstream_port
,
301 struct bt_connection
**user_connection
)
303 enum bt_graph_status status
= BT_GRAPH_STATUS_OK
;
304 struct bt_connection
*connection
= NULL
;
305 struct bt_graph
*upstream_graph
= NULL
;
306 struct bt_graph
*downstream_graph
= NULL
;
307 struct bt_component
*upstream_component
= NULL
;
308 struct bt_component
*downstream_component
= NULL
;
309 enum bt_component_status component_status
;
310 bt_bool init_can_consume
;
313 BT_LOGW_STR("Invalid parameter: graph is NULL.");
314 status
= BT_GRAPH_STATUS_INVALID
;
317 init_can_consume
= graph
->can_consume
;
319 if (!upstream_port
) {
320 BT_LOGW_STR("Invalid parameter: upstream port is NULL.");
321 status
= BT_GRAPH_STATUS_INVALID
;
325 if (!downstream_port
) {
326 BT_LOGW_STR("Invalid parameter: downstream port is NULL.");
327 status
= BT_GRAPH_STATUS_INVALID
;
331 BT_LOGD("Connecting component ports within graph: "
333 "upstream-port-addr=%p, upstream-port-name=\"%s\", "
334 "downstream-port-addr=%p, downstream-port-name=\"%s\"",
335 graph
, upstream_port
, bt_port_get_name(upstream_port
),
336 downstream_port
, bt_port_get_name(downstream_port
));
338 if (graph
->canceled
) {
339 BT_LOGW_STR("Invalid parameter: graph is canceled.");
340 status
= BT_GRAPH_STATUS_CANCELED
;
344 graph
->can_consume
= BT_FALSE
;
346 /* Ensure appropriate types for upstream and downstream ports. */
347 if (bt_port_get_type(upstream_port
) != BT_PORT_TYPE_OUTPUT
) {
348 BT_LOGW_STR("Invalid parameter: upstream port is not an output port.");
349 status
= BT_GRAPH_STATUS_INVALID
;
352 if (bt_port_get_type(downstream_port
) != BT_PORT_TYPE_INPUT
) {
353 BT_LOGW_STR("Invalid parameter: downstream port is not an input port.");
354 status
= BT_GRAPH_STATUS_INVALID
;
358 /* Ensure that both ports are currently unconnected. */
359 if (bt_port_is_connected(upstream_port
)) {
360 BT_LOGW_STR("Invalid parameter: upstream port is already connected.");
361 status
= BT_GRAPH_STATUS_INVALID
;
365 if (bt_port_is_connected(downstream_port
)) {
366 BT_LOGW_STR("Invalid parameter: downstream port is already connected.");
367 status
= BT_GRAPH_STATUS_INVALID
;
372 * Ensure that both ports are still attached to their creating
375 upstream_component
= bt_port_get_component(upstream_port
);
376 if (!upstream_component
) {
377 BT_LOGW_STR("Invalid parameter: upstream port is loose (does not belong to a component)");
378 status
= BT_GRAPH_STATUS_INVALID
;
382 downstream_component
= bt_port_get_component(downstream_port
);
383 if (!downstream_component
) {
384 BT_LOGW_STR("Invalid parameter: downstream port is loose (does not belong to a component)");
385 status
= BT_GRAPH_STATUS_INVALID
;
389 BT_LOGD("Connecting component ports: "
390 "upstream-comp-addr=%p, upstream-comp-name=\"%s\", "
391 "downstream-comp-addr=%p, downstream-comp-name=\"%s\"",
392 upstream_component
, bt_component_get_name(upstream_component
),
393 downstream_component
, bt_component_get_name(downstream_component
));
396 * At this point the ports are not connected yet. Both
397 * components need to accept an eventual connection to their
398 * port by the other port before we continue.
400 BT_LOGD_STR("Asking upstream component to accept the connection.");
401 component_status
= bt_component_accept_port_connection(
402 upstream_component
, upstream_port
, downstream_port
);
403 if (component_status
!= BT_COMPONENT_STATUS_OK
) {
404 if (component_status
== BT_COMPONENT_STATUS_REFUSE_PORT_CONNECTION
) {
405 BT_LOGD_STR("Upstream component refused the connection.");
407 BT_LOGW("Cannot ask upstream component to accept the connection: "
408 "status=%s", bt_component_status_string(component_status
));
411 status
= bt_graph_status_from_component_status(
416 BT_LOGD_STR("Asking downstream component to accept the connection.");
417 component_status
= bt_component_accept_port_connection(
418 downstream_component
, downstream_port
, upstream_port
);
419 if (component_status
!= BT_COMPONENT_STATUS_OK
) {
420 if (component_status
== BT_COMPONENT_STATUS_REFUSE_PORT_CONNECTION
) {
421 BT_LOGD_STR("Downstream component refused the connection.");
423 BT_LOGW("Cannot ask downstream component to accept the connection: "
424 "status=%s", bt_component_status_string(component_status
));
427 status
= bt_graph_status_from_component_status(
432 BT_LOGD_STR("Creating connection.");
433 connection
= bt_connection_create(graph
, upstream_port
,
436 BT_LOGW("Cannot create connection object.");
437 status
= BT_GRAPH_STATUS_NOMEM
;
441 BT_LOGD("Connection object created: conn-addr=%p", connection
);
444 * Ownership of upstream_component/downstream_component and of
445 * the connection object is transferred to the graph.
447 g_ptr_array_add(graph
->connections
, connection
);
450 * Notify both components that their port is connected.
452 BT_LOGD_STR("Notifying upstream component that its port is connected.");
453 bt_component_port_connected(upstream_component
, upstream_port
,
455 BT_LOGD_STR("Notifying downstream component that its port is connected.");
456 bt_component_port_connected(downstream_component
, downstream_port
,
460 * Notify the graph's creator that both ports are connected.
462 BT_LOGD_STR("Notifying graph's user that new component ports are connected.");
463 bt_graph_notify_ports_connected(graph
, upstream_port
, downstream_port
);
464 BT_LOGD("Connected component ports within graph: "
466 "upstream-comp-addr=%p, upstream-comp-name=\"%s\", "
467 "downstream-comp-addr=%p, downstream-comp-name=\"%s\", "
468 "upstream-port-addr=%p, upstream-port-name=\"%s\", "
469 "downstream-port-addr=%p, downstream-port-name=\"%s\"",
471 upstream_component
, bt_component_get_name(upstream_component
),
472 downstream_component
, bt_component_get_name(downstream_component
),
473 upstream_port
, bt_port_get_name(upstream_port
),
474 downstream_port
, bt_port_get_name(downstream_port
));
476 if (user_connection
) {
477 /* Move reference to user */
478 *user_connection
= connection
;
483 bt_put(upstream_graph
);
484 bt_put(downstream_graph
);
485 bt_put(upstream_component
);
486 bt_put(downstream_component
);
489 graph
->can_consume
= init_can_consume
;
495 enum bt_graph_status
consume_graph_sink(struct bt_component
*sink
)
497 enum bt_graph_status status
= BT_GRAPH_STATUS_OK
;
498 enum bt_component_status comp_status
;
501 comp_status
= bt_component_sink_consume(sink
);
502 BT_LOGV("Consumed from sink: addr=%p, name=\"%s\", status=%s",
503 sink
, bt_component_get_name(sink
),
504 bt_component_status_string(comp_status
));
506 switch (comp_status
) {
507 case BT_COMPONENT_STATUS_OK
:
509 case BT_COMPONENT_STATUS_END
:
510 status
= BT_GRAPH_STATUS_END
;
512 case BT_COMPONENT_STATUS_AGAIN
:
513 status
= BT_GRAPH_STATUS_AGAIN
;
515 case BT_COMPONENT_STATUS_INVALID
:
516 status
= BT_GRAPH_STATUS_INVALID
;
519 status
= BT_GRAPH_STATUS_ERROR
;
527 * `node` is removed from the queue of sinks to consume when passed to
528 * this function. This function adds it back to the queue if there's
529 * still something to consume afterwards.
532 enum bt_graph_status
consume_sink_node(struct bt_graph
*graph
,
535 enum bt_graph_status status
;
536 struct bt_component
*sink
;
539 status
= consume_graph_sink(sink
);
540 if (status
!= BT_GRAPH_STATUS_END
) {
541 g_queue_push_tail_link(graph
->sinks_to_consume
, node
);
545 /* End reached, the node is not added back to the queue and free'd. */
546 g_queue_delete_link(graph
->sinks_to_consume
, node
);
548 /* Don't forward an END status if there are sinks left to consume. */
549 if (!g_queue_is_empty(graph
->sinks_to_consume
)) {
550 status
= BT_GRAPH_STATUS_OK
;
555 BT_LOGV("Consumed sink node: status=%s", bt_graph_status_string(status
));
560 enum bt_graph_status
bt_graph_consume_sink_no_check(struct bt_graph
*graph
,
561 struct bt_component
*sink
)
563 enum bt_graph_status status
;
567 BT_LOGV("Making specific sink consume: addr=%p, "
568 "comp-addr=%p, comp-name=\"%s\"",
569 graph
, sink
, bt_component_get_name(sink
));
571 BT_ASSERT(bt_component_borrow_graph(sink
) == graph
);
573 if (g_queue_is_empty(graph
->sinks_to_consume
)) {
574 BT_LOGV_STR("Graph's sink queue is empty: end of graph.");
575 status
= BT_GRAPH_STATUS_END
;
579 index
= g_queue_index(graph
->sinks_to_consume
, sink
);
581 BT_LOGV_STR("Sink is not marked as consumable: sink is ended.");
582 status
= BT_GRAPH_STATUS_END
;
586 sink_node
= g_queue_pop_nth_link(graph
->sinks_to_consume
, index
);
587 BT_ASSERT(sink_node
);
588 status
= consume_sink_node(graph
, sink_node
);
595 enum bt_graph_status
bt_graph_consume_no_check(struct bt_graph
*graph
)
597 enum bt_graph_status status
= BT_GRAPH_STATUS_OK
;
598 struct bt_component
*sink
;
601 BT_LOGV("Making next sink consume: addr=%p", graph
);
602 BT_ASSERT_PRE(graph
->has_sink
,
603 "Graph has no sink component: %!+g", graph
);
605 if (g_queue_is_empty(graph
->sinks_to_consume
)) {
606 BT_LOGV_STR("Graph's sink queue is empty: end of graph.");
607 status
= BT_GRAPH_STATUS_END
;
611 current_node
= g_queue_pop_head_link(graph
->sinks_to_consume
);
612 sink
= current_node
->data
;
613 BT_LOGV("Chose next sink to consume: comp-addr=%p, comp-name=\"%s\"",
614 sink
, bt_component_get_name(sink
));
615 status
= consume_sink_node(graph
, current_node
);
621 enum bt_graph_status
bt_graph_consume(struct bt_graph
*graph
)
623 enum bt_graph_status status
;
625 BT_ASSERT_PRE_NON_NULL(graph
, "Graph");
626 BT_ASSERT_PRE(!graph
->canceled
, "Graph is canceled: %!+g", graph
);
627 BT_ASSERT_PRE(graph
->can_consume
,
628 "Cannot consume graph in its current state: %!+g", graph
);
629 graph
->can_consume
= BT_FALSE
;
630 status
= bt_graph_consume_no_check(graph
);
631 graph
->can_consume
= BT_TRUE
;
635 enum bt_graph_status
bt_graph_run(struct bt_graph
*graph
)
637 enum bt_graph_status status
= BT_GRAPH_STATUS_OK
;
640 BT_LOGW_STR("Invalid parameter: graph is NULL.");
641 status
= BT_GRAPH_STATUS_INVALID
;
645 if (graph
->canceled
) {
646 BT_LOGW("Invalid parameter: graph is canceled: "
647 "graph-addr=%p", graph
);
648 status
= BT_GRAPH_STATUS_CANCELED
;
652 if (!graph
->can_consume
) {
653 BT_LOGW_STR("Cannot run graph in its current state.");
654 status
= BT_GRAPH_STATUS_CANNOT_CONSUME
;
658 graph
->can_consume
= BT_FALSE
;
659 BT_LOGV("Running graph: addr=%p", graph
);
663 * Check if the graph is canceled at each iteration. If
664 * the graph was canceled by another thread or by a
665 * signal, this is not a warning nor an error, it was
666 * intentional: log with a DEBUG level only.
668 if (graph
->canceled
) {
669 BT_LOGD("Stopping the graph: graph is canceled: "
670 "graph-addr=%p", graph
);
671 status
= BT_GRAPH_STATUS_CANCELED
;
675 status
= bt_graph_consume_no_check(graph
);
676 if (status
== BT_GRAPH_STATUS_AGAIN
) {
678 * If AGAIN is received and there are multiple
679 * sinks, go ahead and consume from the next
682 * However, in the case where a single sink is
683 * left, the caller can decide to busy-wait and
684 * call bt_graph_run() continuously until the
685 * source is ready or it can decide to sleep for
686 * an arbitrary amount of time.
688 if (graph
->sinks_to_consume
->length
> 1) {
689 status
= BT_GRAPH_STATUS_OK
;
691 } else if (status
== BT_GRAPH_STATUS_NO_SINK
) {
694 } while (status
== BT_GRAPH_STATUS_OK
);
696 if (g_queue_is_empty(graph
->sinks_to_consume
)) {
697 status
= BT_GRAPH_STATUS_END
;
701 BT_LOGV("Graph ran: status=%s", bt_graph_status_string(status
));
703 graph
->can_consume
= BT_TRUE
;
709 int add_listener(GArray
*listeners
, void *func
, void *removed
, void *data
)
711 struct bt_graph_listener listener
= {
717 g_array_append_val(listeners
, listener
);
718 return listeners
->len
- 1;
721 int bt_graph_add_port_added_listener(
722 struct bt_graph
*graph
,
723 bt_graph_port_added_listener listener
,
724 bt_graph_listener_removed listener_removed
, void *data
)
729 BT_LOGW_STR("Invalid parameter: graph is NULL.");
734 if (graph
->in_remove_listener
) {
735 BT_LOGW("Cannot call this function during the execution of a remove listener: "
742 BT_LOGW_STR("Invalid parameter: listener is NULL.");
747 ret
= add_listener(graph
->listeners
.port_added
, listener
,
748 listener_removed
, data
);
749 BT_LOGV("Added \"port added\" listener to graph: "
750 "graph-addr=%p, listener-addr=%p, pos=%d",
751 graph
, listener
, ret
);
757 int bt_graph_add_port_removed_listener(
758 struct bt_graph
*graph
,
759 bt_graph_port_removed_listener listener
,
760 bt_graph_listener_removed listener_removed
, void *data
)
765 BT_LOGW_STR("Invalid parameter: graph is NULL.");
770 if (graph
->in_remove_listener
) {
771 BT_LOGW("Cannot call this function during the execution of a remove listener: "
778 BT_LOGW_STR("Invalid parameter: listener is NULL.");
783 ret
= add_listener(graph
->listeners
.port_removed
, listener
,
784 listener_removed
, data
);
785 BT_LOGV("Added \"port removed\" listener to graph: "
786 "graph-addr=%p, listener-addr=%p, pos=%d",
787 graph
, listener
, ret
);
793 int bt_graph_add_ports_connected_listener(
794 struct bt_graph
*graph
,
795 bt_graph_ports_connected_listener listener
,
796 bt_graph_listener_removed listener_removed
, void *data
)
801 BT_LOGW_STR("Invalid parameter: graph is NULL.");
806 if (graph
->in_remove_listener
) {
807 BT_LOGW("Cannot call this function during the execution of a remove listener: "
814 BT_LOGW_STR("Invalid parameter: listener is NULL.");
819 ret
= add_listener(graph
->listeners
.ports_connected
, listener
,
820 listener_removed
, data
);
821 BT_LOGV("Added \"port connected\" listener to graph: "
822 "graph-addr=%p, listener-addr=%p, pos=%d",
823 graph
, listener
, ret
);
829 int bt_graph_add_ports_disconnected_listener(
830 struct bt_graph
*graph
,
831 bt_graph_ports_disconnected_listener listener
,
832 bt_graph_listener_removed listener_removed
, void *data
)
837 BT_LOGW_STR("Invalid parameter: graph is NULL.");
842 if (graph
->in_remove_listener
) {
843 BT_LOGW("Cannot call this function during the execution of a remove listener: "
850 BT_LOGW_STR("Invalid parameter: listener is NULL.");
855 ret
= add_listener(graph
->listeners
.ports_disconnected
, listener
,
856 listener_removed
, data
);
857 BT_LOGV("Added \"port disconnected\" listener to graph: "
858 "graph-addr=%p, listener-addr=%p, pos=%d",
859 graph
, listener
, ret
);
866 void bt_graph_notify_port_added(struct bt_graph
*graph
, struct bt_port
*port
)
870 BT_LOGV("Notifying graph listeners that a port was added: "
871 "graph-addr=%p, port-addr=%p, port-name=\"%s\"",
872 graph
, port
, bt_port_get_name(port
));
874 for (i
= 0; i
< graph
->listeners
.port_added
->len
; i
++) {
875 struct bt_graph_listener listener
=
876 g_array_index(graph
->listeners
.port_added
,
877 struct bt_graph_listener
, i
);
878 bt_graph_port_added_listener func
= listener
.func
;
881 func(port
, listener
.data
);
886 void bt_graph_notify_port_removed(struct bt_graph
*graph
,
887 struct bt_component
*comp
, struct bt_port
*port
)
891 BT_LOGV("Notifying graph listeners that a port was removed: "
892 "graph-addr=%p, port-addr=%p, port-name=\"%s\"",
893 graph
, port
, bt_port_get_name(port
));
895 for (i
= 0; i
< graph
->listeners
.port_removed
->len
; i
++) {
896 struct bt_graph_listener listener
=
897 g_array_index(graph
->listeners
.port_removed
,
898 struct bt_graph_listener
, i
);
899 bt_graph_port_removed_listener func
= listener
.func
;
902 func(comp
, port
, listener
.data
);
907 void bt_graph_notify_ports_connected(struct bt_graph
*graph
,
908 struct bt_port
*upstream_port
, struct bt_port
*downstream_port
)
912 BT_LOGV("Notifying graph listeners that two ports were connected: "
914 "upstream-port-addr=%p, upstream-port-name=\"%s\", "
915 "downstream-port-addr=%p, downstream-port-name=\"%s\"",
916 graph
, upstream_port
, bt_port_get_name(upstream_port
),
917 downstream_port
, bt_port_get_name(downstream_port
));
919 for (i
= 0; i
< graph
->listeners
.ports_connected
->len
; i
++) {
920 struct bt_graph_listener listener
=
921 g_array_index(graph
->listeners
.ports_connected
,
922 struct bt_graph_listener
, i
);
923 bt_graph_ports_connected_listener func
= listener
.func
;
926 func(upstream_port
, downstream_port
, listener
.data
);
931 void bt_graph_notify_ports_disconnected(struct bt_graph
*graph
,
932 struct bt_component
*upstream_comp
,
933 struct bt_component
*downstream_comp
,
934 struct bt_port
*upstream_port
, struct bt_port
*downstream_port
)
938 BT_LOGV("Notifying graph listeners that two ports were disconnected: "
940 "upstream-port-addr=%p, upstream-port-name=\"%s\", "
941 "downstream-port-addr=%p, downstream-port-name=\"%s\"",
942 graph
, upstream_port
, bt_port_get_name(upstream_port
),
943 downstream_port
, bt_port_get_name(downstream_port
));
945 for (i
= 0; i
< graph
->listeners
.ports_disconnected
->len
; i
++) {
946 struct bt_graph_listener listener
=
947 g_array_index(graph
->listeners
.ports_disconnected
,
948 struct bt_graph_listener
, i
);
949 bt_graph_ports_disconnected_listener func
= listener
.func
;
952 func(upstream_comp
, downstream_comp
, upstream_port
,
953 downstream_port
, listener
.data
);
957 enum bt_graph_status
bt_graph_cancel(struct bt_graph
*graph
)
959 enum bt_graph_status ret
= BT_GRAPH_STATUS_OK
;
962 BT_LOGW_STR("Invalid parameter: graph is NULL.");
963 ret
= BT_GRAPH_STATUS_INVALID
;
967 graph
->canceled
= BT_TRUE
;
968 BT_LOGV("Canceled graph: addr=%p", graph
);
974 bt_bool
bt_graph_is_canceled(struct bt_graph
*graph
)
976 bt_bool canceled
= BT_FALSE
;
979 BT_LOGW_STR("Invalid parameter: graph is NULL.");
983 canceled
= graph
->canceled
;
990 void bt_graph_remove_connection(struct bt_graph
*graph
,
991 struct bt_connection
*connection
)
994 BT_ASSERT(connection
);
995 BT_LOGV("Removing graph's connection: graph-addr=%p, conn-addr=%p",
997 g_ptr_array_remove(graph
->connections
, connection
);
1000 enum bt_graph_status
bt_graph_add_component_with_init_method_data(
1001 struct bt_graph
*graph
,
1002 struct bt_component_class
*component_class
,
1003 const char *name
, struct bt_value
*params
,
1004 void *init_method_data
,
1005 struct bt_component
**user_component
)
1007 enum bt_graph_status graph_status
= BT_GRAPH_STATUS_OK
;
1008 enum bt_component_status comp_status
;
1009 struct bt_component
*component
= NULL
;
1010 enum bt_component_class_type type
;
1012 bt_bool init_can_consume
;
1017 BT_LOGW_STR("Invalid parameter: graph is NULL.");
1018 graph_status
= BT_GRAPH_STATUS_INVALID
;
1021 init_can_consume
= graph
->can_consume
;
1023 if (!component_class
) {
1024 BT_LOGW_STR("Invalid parameter: component class is NULL.");
1025 graph_status
= BT_GRAPH_STATUS_INVALID
;
1029 graph
->can_consume
= BT_FALSE
;
1030 type
= bt_component_class_get_type(component_class
);
1031 BT_LOGD("Adding component to graph: "
1032 "graph-addr=%p, comp-cls-addr=%p, "
1033 "comp-cls-type=%s, name=\"%s\", params-addr=%p, "
1034 "init-method-data-addr=%p",
1035 graph
, component_class
, bt_component_class_type_string(type
),
1036 name
, params
, init_method_data
);
1039 BT_LOGW_STR("Invalid parameter: name is NULL.");
1040 graph_status
= BT_GRAPH_STATUS_INVALID
;
1044 if (graph
->canceled
) {
1045 BT_LOGW_STR("Invalid parameter: graph is canceled.");
1046 graph_status
= BT_GRAPH_STATUS_CANCELED
;
1050 if (type
!= BT_COMPONENT_CLASS_TYPE_SOURCE
&&
1051 type
!= BT_COMPONENT_CLASS_TYPE_FILTER
&&
1052 type
!= BT_COMPONENT_CLASS_TYPE_SINK
) {
1053 BT_LOGW("Invalid parameter: unknown component class type: "
1055 graph_status
= BT_GRAPH_STATUS_INVALID
;
1059 for (i
= 0; i
< graph
->components
->len
; i
++) {
1060 void *other_comp
= graph
->components
->pdata
[i
];
1062 if (strcmp(name
, bt_component_get_name(other_comp
)) == 0) {
1063 BT_LOGW("Invalid parameter: another component with the same name already exists in the graph: "
1064 "other-comp-addr=%p, name=\"%s\"",
1066 graph_status
= BT_GRAPH_STATUS_INVALID
;
1072 * Parameters must be a map value, but we create a convenient
1073 * empty one if it's NULL.
1076 if (!bt_value_is_map(params
)) {
1077 BT_LOGW("Invalid parameter: initialization parameters must be a map value: "
1079 bt_value_type_string(bt_value_get_type(params
)));
1080 graph_status
= BT_GRAPH_STATUS_INVALID
;
1084 params
= bt_value_map_create();
1086 BT_LOGE_STR("Cannot create map value object.");
1087 graph_status
= BT_GRAPH_STATUS_NOMEM
;
1092 comp_status
= bt_component_create(component_class
, name
, &component
);
1093 if (comp_status
!= BT_COMPONENT_STATUS_OK
) {
1094 BT_LOGE("Cannot create empty component object: status=%s",
1095 bt_component_status_string(comp_status
));
1096 graph_status
= bt_graph_status_from_component_status(
1102 * The user's initialization method needs to see that this
1103 * component is part of the graph. If the user method fails, we
1104 * immediately remove the component from the graph's components.
1106 g_ptr_array_add(graph
->components
, component
);
1107 bt_component_set_graph(component
, graph
);
1109 if (component_class
->methods
.init
) {
1110 BT_LOGD_STR("Calling user's initialization method.");
1111 comp_status
= component_class
->methods
.init(
1112 bt_private_component_from_component(component
), params
,
1114 BT_LOGD("User method returned: status=%s",
1115 bt_component_status_string(comp_status
));
1116 if (comp_status
!= BT_COMPONENT_STATUS_OK
) {
1117 BT_LOGW_STR("Initialization method failed.");
1118 graph_status
= bt_graph_status_from_component_status(
1120 bt_component_set_graph(component
, NULL
);
1121 g_ptr_array_remove_fast(graph
->components
, component
);
1127 * Mark the component as initialized so that its finalization
1128 * method is called when it is destroyed.
1130 component
->initialized
= true;
1133 * If it's a sink component, it needs to be part of the graph's
1134 * sink queue to be consumed by bt_graph_consume().
1136 if (bt_component_is_sink(component
)) {
1137 graph
->has_sink
= BT_TRUE
;
1138 g_queue_push_tail(graph
->sinks_to_consume
, component
);
1142 * Freeze the component class now that it's instantiated at
1145 BT_LOGD_STR("Freezing component class.");
1146 bt_component_class_freeze(component
->class);
1147 BT_LOGD("Added component to graph: "
1148 "graph-addr=%p, comp-cls-addr=%p, "
1149 "comp-cls-type=%s, name=\"%s\", params-addr=%p, "
1150 "init-method-data-addr=%p, comp-addr=%p",
1151 graph
, component_class
, bt_component_class_type_string(type
),
1152 name
, params
, init_method_data
, component
);
1154 if (user_component
) {
1155 /* Move reference to user */
1156 *user_component
= component
;
1164 graph
->can_consume
= init_can_consume
;
1166 return graph_status
;
1169 enum bt_graph_status
bt_graph_add_component(
1170 struct bt_graph
*graph
,
1171 struct bt_component_class
*component_class
,
1172 const char *name
, struct bt_value
*params
,
1173 struct bt_component
**component
)
1175 return bt_graph_add_component_with_init_method_data(graph
,
1176 component_class
, name
, params
, NULL
, component
);
1180 int bt_graph_remove_unconnected_component(struct bt_graph
*graph
,
1181 struct bt_component
*component
)
1183 bt_bool init_can_consume
;
1189 BT_ASSERT(component
);
1190 BT_ASSERT(component
->base
.ref_count
== 0);
1191 BT_ASSERT(bt_component_borrow_graph(component
) == graph
);
1193 init_can_consume
= graph
->can_consume
;
1194 count
= bt_component_get_input_port_count(component
);
1196 for (i
= 0; i
< count
; i
++) {
1197 struct bt_port
*port
=
1198 bt_component_get_input_port_by_index(component
, i
);
1203 if (bt_port_is_connected(port
)) {
1204 BT_LOGW("Cannot remove component from graph: "
1205 "an input port is connected: "
1206 "graph-addr=%p, comp-addr=%p, "
1207 "comp-name=\"%s\", connected-port-addr=%p, "
1208 "connected-port-name=\"%s\"",
1210 bt_component_get_name(component
),
1211 port
, bt_port_get_name(port
));
1216 count
= bt_component_get_output_port_count(component
);
1218 for (i
= 0; i
< count
; i
++) {
1219 struct bt_port
*port
=
1220 bt_component_get_output_port_by_index(component
, i
);
1225 if (bt_port_is_connected(port
)) {
1226 BT_LOGW("Cannot remove component from graph: "
1227 "an output port is connected: "
1228 "graph-addr=%p, comp-addr=%p, "
1229 "comp-name=\"%s\", connected-port-addr=%p, "
1230 "connected-port-name=\"%s\"",
1232 bt_component_get_name(component
),
1233 port
, bt_port_get_name(port
));
1238 graph
->can_consume
= BT_FALSE
;
1240 /* Possibly remove from sinks to consume */
1241 (void) g_queue_remove(graph
->sinks_to_consume
, component
);
1243 if (graph
->sinks_to_consume
->length
== 0) {
1244 graph
->has_sink
= BT_FALSE
;
1248 * This calls bt_object_try_spec_release() on the component, and
1249 * since its reference count is 0, its destructor is called. Its
1250 * destructor calls the user's finalization method (if set).
1252 g_ptr_array_remove(graph
->components
, component
);
1259 graph
->can_consume
= init_can_consume
;
1264 void bt_graph_add_notification(struct bt_graph
*graph
,
1265 struct bt_notification
*notif
)
1271 * It's okay not to take a reference because, when a
1272 * notification's reference count drops to 0, either:
1274 * * It is recycled back to one of this graph's pool.
1275 * * It is destroyed because it doesn't have any link to any
1276 * graph, which means the original graph is already destroyed.
1278 g_ptr_array_add(graph
->notifications
, notif
);