lib: graph API: remove "listener removed" callback parameters
[babeltrace.git] / src / lib / graph / graph.c
CommitLineData
c0418dd9 1/*
e2f7325d 2 * Copyright 2017-2018 Philippe Proulx <pproulx@efficios.com>
f60c8b34 3 * Copyright 2017 Jérémie Galarneau <jeremie.galarneau@efficios.com>
c0418dd9
JG
4 *
5 * Permission is hereby granted, free of charge, to any person obtaining a copy
6 * of this software and associated documentation files (the "Software"), to deal
7 * in the Software without restriction, including without limitation the rights
8 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
9 * copies of the Software, and to permit persons to whom the Software is
10 * furnished to do so, subject to the following conditions:
11 *
12 * The above copyright notice and this permission notice shall be included in
13 * all copies or substantial portions of the Software.
14 *
15 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
16 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
17 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
18 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
19 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
20 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
21 * SOFTWARE.
22 */
23
350ad6c1 24#define BT_LOG_TAG "LIB/GRAPH"
c2d9d9cf 25#include "lib/logging.h"
262e5473 26
578e048b
MJ
27#include "common/assert.h"
28#include "lib/assert-pre.h"
f6f301d7 29#include "lib/assert-post.h"
3fadfbc0
MJ
30#include <babeltrace2/graph/graph.h>
31#include <babeltrace2/graph/graph-const.h>
3fadfbc0
MJ
32#include <babeltrace2/graph/component-source-const.h>
33#include <babeltrace2/graph/component-filter-const.h>
34#include <babeltrace2/graph/port-const.h>
578e048b
MJ
35#include "lib/graph/message/message.h"
36#include "compat/compiler.h"
37#include "common/common.h"
3fadfbc0
MJ
38#include <babeltrace2/types.h>
39#include <babeltrace2/value.h>
40#include <babeltrace2/value-const.h>
578e048b 41#include "lib/value.h"
f60c8b34 42#include <unistd.h>
c4f23e30 43#include <stdbool.h>
1bf957a0
PP
44#include <glib.h>
45
078033ed 46#include "component-class-sink-simple.h"
578e048b
MJ
47#include "component.h"
48#include "component-sink.h"
49#include "connection.h"
50#include "graph.h"
9b4f9b42 51#include "interrupter.h"
578e048b
MJ
52#include "message/event.h"
53#include "message/packet.h"
54
d24d5663
PP
55typedef enum bt_graph_listener_func_status
56(*port_added_func_t)(const void *, const void *, void *);
0d72b8c3 57
21a9f056 58typedef enum bt_component_class_initialize_method_status
59225a3e 59(*comp_init_method_t)(const void *, void *, const void *, void *);
d24d5663 60
d94d92ac 61struct bt_graph_listener_port_added {
d94d92ac 62 port_added_func_t func;
f3d6b4c2 63 void *data;
d94d92ac 64};
8cc092c9 65
d94d92ac
PP
66#define INIT_LISTENERS_ARRAY(_type, _listeners) \
67 do { \
68 _listeners = g_array_new(FALSE, TRUE, sizeof(_type)); \
69 if (!(_listeners)) { \
870631a2
PP
70 BT_LIB_LOGE_APPEND_CAUSE( \
71 "Failed to allocate one GArray."); \
d94d92ac
PP
72 } \
73 } while (0)
74
f60c8b34 75static
d94d92ac 76void destroy_graph(struct bt_object *obj)
c0418dd9 77{
0d72b8c3 78 struct bt_graph *graph = container_of(obj, struct bt_graph, base);
c0418dd9 79
bd14d768
PP
80 /*
81 * The graph's reference count is 0 if we're here. Increment
82 * it to avoid a double-destroy (possibly infinitely recursive)
83 * in this situation:
84 *
85 * 1. We put and destroy a connection.
d0fea130
PP
86 * 2. This connection's destructor finalizes its active message
87 * iterators.
88 * 3. A message iterator's finalization function gets a new
89 * reference on its component (reference count goes from 0 to
90 * 1).
bd14d768
PP
91 * 4. Since this component's reference count goes to 1, it takes
92 * a reference on its parent (this graph). This graph's
93 * reference count goes from 0 to 1.
d6e69534 94 * 5. The message iterator's finalization function puts its
bd14d768
PP
95 * component reference (reference count goes from 1 to 0).
96 * 6. Since this component's reference count goes from 1 to 0,
97 * it puts its parent (this graph). This graph's reference
98 * count goes from 1 to 0.
d0fea130
PP
99 * 7. Since this graph's reference count goes from 1 to 0, its
100 * destructor is called (this function).
bd14d768
PP
101 *
102 * With the incrementation below, the graph's reference count at
103 * step 4 goes from 1 to 2, and from 2 to 1 at step 6. This
104 * ensures that this function is not called two times.
105 */
3f7d4d90 106 BT_LIB_LOGI("Destroying graph: %!+g", graph);
3fea54f6 107 obj->ref_count++;
9b4f9b42 108 graph->config_state = BT_GRAPH_CONFIGURATION_STATE_DESTROYING;
49682acd 109
d6e69534
PP
110 if (graph->messages) {
111 g_ptr_array_free(graph->messages, TRUE);
112 graph->messages = NULL;
5c563278
PP
113 }
114
c0418dd9 115 if (graph->connections) {
262e5473 116 BT_LOGD_STR("Destroying connections.");
c0418dd9 117 g_ptr_array_free(graph->connections, TRUE);
d94d92ac 118 graph->connections = NULL;
c0418dd9 119 }
5c563278 120
bd14d768 121 if (graph->components) {
262e5473 122 BT_LOGD_STR("Destroying components.");
bd14d768 123 g_ptr_array_free(graph->components, TRUE);
d94d92ac 124 graph->components = NULL;
bd14d768 125 }
5c563278 126
9b4f9b42
PP
127 if (graph->interrupters) {
128 BT_LOGD_STR("Putting interrupters.");
129 g_ptr_array_free(graph->interrupters, TRUE);
130 graph->interrupters = NULL;
131 }
132
133 BT_OBJECT_PUT_REF_AND_RESET(graph->default_interrupter);
134
f60c8b34
JG
135 if (graph->sinks_to_consume) {
136 g_queue_free(graph->sinks_to_consume);
d94d92ac
PP
137 graph->sinks_to_consume = NULL;
138 }
139
140 if (graph->listeners.source_output_port_added) {
141 g_array_free(graph->listeners.source_output_port_added, TRUE);
142 graph->listeners.source_output_port_added = NULL;
143 }
144
145 if (graph->listeners.filter_output_port_added) {
146 g_array_free(graph->listeners.filter_output_port_added, TRUE);
147 graph->listeners.filter_output_port_added = NULL;
148 }
149
150 if (graph->listeners.filter_input_port_added) {
151 g_array_free(graph->listeners.filter_input_port_added, TRUE);
152 graph->listeners.filter_input_port_added = NULL;
c0418dd9 153 }
1bf957a0 154
d94d92ac
PP
155 if (graph->listeners.sink_input_port_added) {
156 g_array_free(graph->listeners.sink_input_port_added, TRUE);
157 graph->listeners.sink_input_port_added = NULL;
1bf957a0
PP
158 }
159
d6e69534
PP
160 bt_object_pool_finalize(&graph->event_msg_pool);
161 bt_object_pool_finalize(&graph->packet_begin_msg_pool);
162 bt_object_pool_finalize(&graph->packet_end_msg_pool);
c0418dd9
JG
163 g_free(graph);
164}
165
5c563278 166static
d6e69534 167void destroy_message_event(struct bt_message *msg,
5c563278
PP
168 struct bt_graph *graph)
169{
d6e69534 170 bt_message_event_destroy(msg);
5c563278
PP
171}
172
173static
d6e69534 174void destroy_message_packet_begin(struct bt_message *msg,
5c563278
PP
175 struct bt_graph *graph)
176{
5df26c89 177 bt_message_packet_destroy(msg);
5c563278
PP
178}
179
180static
d6e69534 181void destroy_message_packet_end(struct bt_message *msg,
5c563278
PP
182 struct bt_graph *graph)
183{
5df26c89 184 bt_message_packet_destroy(msg);
5c563278
PP
185}
186
187static
d6e69534 188void notify_message_graph_is_destroyed(struct bt_message *msg)
5c563278 189{
d6e69534 190 bt_message_unlink_graph(msg);
5c563278
PP
191}
192
056deb59 193struct bt_graph *bt_graph_create(uint64_t mip_version)
c0418dd9 194{
f60c8b34 195 struct bt_graph *graph;
1bf957a0 196 int ret;
c0418dd9 197
17f3083a 198 BT_ASSERT_PRE_NO_ERROR();
056deb59
PP
199 BT_ASSERT_PRE(mip_version <= bt_get_maximal_mip_version(),
200 "Unknown MIP version: mip-version=%" PRIu64 ", "
201 "max-mip-version=%" PRIu64,
202 mip_version, bt_get_maximal_mip_version());
3f7d4d90 203 BT_LOGI_STR("Creating graph object.");
f60c8b34 204 graph = g_new0(struct bt_graph, 1);
c0418dd9 205 if (!graph) {
870631a2 206 BT_LIB_LOGE_APPEND_CAUSE("Failed to allocate one graph.");
c0418dd9
JG
207 goto end;
208 }
209
d94d92ac 210 bt_object_init_shared(&graph->base, destroy_graph);
056deb59 211 graph->mip_version = mip_version;
3fea54f6
PP
212 graph->connections = g_ptr_array_new_with_free_func(
213 (GDestroyNotify) bt_object_try_spec_release);
c0418dd9 214 if (!graph->connections) {
870631a2 215 BT_LIB_LOGE_APPEND_CAUSE("Failed to allocate one GPtrArray.");
c0418dd9
JG
216 goto error;
217 }
3fea54f6
PP
218 graph->components = g_ptr_array_new_with_free_func(
219 (GDestroyNotify) bt_object_try_spec_release);
f60c8b34 220 if (!graph->components) {
870631a2 221 BT_LIB_LOGE_APPEND_CAUSE("Failed to allocate one GPtrArray.");
f60c8b34
JG
222 goto error;
223 }
224 graph->sinks_to_consume = g_queue_new();
225 if (!graph->sinks_to_consume) {
870631a2 226 BT_LIB_LOGE_APPEND_CAUSE("Failed to allocate one GQueue.");
c0418dd9
JG
227 goto error;
228 }
1bf957a0 229
d94d92ac
PP
230 bt_graph_set_can_consume(graph, true);
231 INIT_LISTENERS_ARRAY(struct bt_graph_listener_port_added,
232 graph->listeners.source_output_port_added);
233
234 if (!graph->listeners.source_output_port_added) {
1bf957a0
PP
235 goto error;
236 }
237
d94d92ac
PP
238 INIT_LISTENERS_ARRAY(struct bt_graph_listener_port_added,
239 graph->listeners.filter_output_port_added);
240
241 if (!graph->listeners.filter_output_port_added) {
1bf957a0
PP
242 goto error;
243 }
244
d94d92ac
PP
245 INIT_LISTENERS_ARRAY(struct bt_graph_listener_port_added,
246 graph->listeners.filter_input_port_added);
247
248 if (!graph->listeners.filter_input_port_added) {
1bf957a0
PP
249 goto error;
250 }
251
d94d92ac
PP
252 INIT_LISTENERS_ARRAY(struct bt_graph_listener_port_added,
253 graph->listeners.sink_input_port_added);
254
255 if (!graph->listeners.sink_input_port_added) {
d94d92ac
PP
256 goto error;
257 }
258
9b4f9b42 259 graph->interrupters = g_ptr_array_new_with_free_func(
6871026b 260 (GDestroyNotify) bt_object_put_ref_no_null_check);
9b4f9b42
PP
261 if (!graph->interrupters) {
262 BT_LIB_LOGE_APPEND_CAUSE("Failed to allocate one GPtrArray.");
263 goto error;
264 }
265
266 graph->default_interrupter = bt_interrupter_create();
267 if (!graph->default_interrupter) {
268 BT_LIB_LOGE_APPEND_CAUSE(
269 "Failed to create one interrupter object.");
270 goto error;
271 }
272
273 bt_graph_add_interrupter(graph, graph->default_interrupter);
d6e69534
PP
274 ret = bt_object_pool_initialize(&graph->event_msg_pool,
275 (bt_object_pool_new_object_func) bt_message_event_new,
276 (bt_object_pool_destroy_object_func) destroy_message_event,
5c563278
PP
277 graph);
278 if (ret) {
870631a2
PP
279 BT_LIB_LOGE_APPEND_CAUSE(
280 "Failed to initialize event message pool: ret=%d",
5c563278
PP
281 ret);
282 goto error;
283 }
284
d6e69534
PP
285 ret = bt_object_pool_initialize(&graph->packet_begin_msg_pool,
286 (bt_object_pool_new_object_func) bt_message_packet_beginning_new,
287 (bt_object_pool_destroy_object_func) destroy_message_packet_begin,
5c563278
PP
288 graph);
289 if (ret) {
870631a2
PP
290 BT_LIB_LOGE_APPEND_CAUSE(
291 "Failed to initialize packet beginning message pool: ret=%d",
5c563278
PP
292 ret);
293 goto error;
294 }
295
d6e69534
PP
296 ret = bt_object_pool_initialize(&graph->packet_end_msg_pool,
297 (bt_object_pool_new_object_func) bt_message_packet_end_new,
298 (bt_object_pool_destroy_object_func) destroy_message_packet_end,
5c563278
PP
299 graph);
300 if (ret) {
870631a2
PP
301 BT_LIB_LOGE_APPEND_CAUSE(
302 "Failed to initialize packet end message pool: ret=%d",
5c563278
PP
303 ret);
304 goto error;
305 }
306
d6e69534
PP
307 graph->messages = g_ptr_array_new_with_free_func(
308 (GDestroyNotify) notify_message_graph_is_destroyed);
3f7d4d90 309 BT_LIB_LOGI("Created graph object: %!+g", graph);
262e5473 310
c0418dd9 311end:
a2d06fd5 312 return (void *) graph;
d94d92ac 313
c0418dd9 314error:
65300d60 315 BT_OBJECT_PUT_REF_AND_RESET(graph);
c0418dd9
JG
316 goto end;
317}
318
d24d5663 319enum bt_graph_connect_ports_status bt_graph_connect_ports(
0d72b8c3
PP
320 struct bt_graph *graph,
321 const struct bt_port_output *upstream_port_out,
322 const struct bt_port_input *downstream_port_in,
323 const struct bt_connection **user_connection)
f60c8b34 324{
d24d5663 325 enum bt_graph_connect_ports_status status = BT_FUNC_STATUS_OK;
f60c8b34 326 struct bt_connection *connection = NULL;
d94d92ac
PP
327 struct bt_port *upstream_port = (void *) upstream_port_out;
328 struct bt_port *downstream_port = (void *) downstream_port_in;
f60c8b34
JG
329 struct bt_component *upstream_component = NULL;
330 struct bt_component *downstream_component = NULL;
d24d5663 331 enum bt_component_class_port_connected_method_status port_connected_status;
d94d92ac 332 bool init_can_consume;
f60c8b34 333
17f3083a 334 BT_ASSERT_PRE_NO_ERROR();
d94d92ac
PP
335 BT_ASSERT_PRE_NON_NULL(graph, "Graph");
336 BT_ASSERT_PRE_NON_NULL(upstream_port, "Upstream port");
337 BT_ASSERT_PRE_NON_NULL(downstream_port, "Downstream port port");
5badd463
PP
338 BT_ASSERT_PRE(
339 graph->config_state == BT_GRAPH_CONFIGURATION_STATE_CONFIGURING,
38cda5da 340 "Graph is not in the \"configuring\" state: %!+g", graph);
d94d92ac
PP
341 BT_ASSERT_PRE(!bt_port_is_connected(upstream_port),
342 "Upstream port is already connected: %!+p", upstream_port);
343 BT_ASSERT_PRE(!bt_port_is_connected(downstream_port),
344 "Downstream port is already connected: %!+p", downstream_port);
0d72b8c3 345 BT_ASSERT_PRE(bt_port_borrow_component_inline((void *) upstream_port),
d94d92ac
PP
346 "Upstream port does not belong to a component: %!+p",
347 upstream_port);
0d72b8c3 348 BT_ASSERT_PRE(bt_port_borrow_component_inline((void *) downstream_port),
d94d92ac
PP
349 "Downstream port does not belong to a component: %!+p",
350 downstream_port);
4aa7981f 351 init_can_consume = graph->can_consume;
3f7d4d90 352 BT_LIB_LOGI("Connecting component ports within graph: "
d94d92ac
PP
353 "%![graph-]+g, %![up-port-]+p, %![down-port-]+p",
354 graph, upstream_port, downstream_port);
355 bt_graph_set_can_consume(graph, false);
0d72b8c3 356 upstream_component = bt_port_borrow_component_inline(
d94d92ac 357 (void *) upstream_port);
0d72b8c3 358 downstream_component = bt_port_borrow_component_inline(
d94d92ac 359 (void *) downstream_port);
262e5473 360
262e5473 361 BT_LOGD_STR("Creating connection.");
d94d92ac
PP
362 connection = bt_connection_create(graph, (void *) upstream_port,
363 (void *) downstream_port);
f60c8b34 364 if (!connection) {
870631a2 365 BT_LIB_LOGE_APPEND_CAUSE("Cannot create connection object.");
d24d5663 366 status = BT_FUNC_STATUS_MEMORY_ERROR;
a256a42d 367 goto end;
f60c8b34
JG
368 }
369
d94d92ac 370 BT_LIB_LOGD("Connection object created: %!+x", connection);
262e5473 371
f60c8b34 372 /*
72b913fb
PP
373 * Ownership of upstream_component/downstream_component and of
374 * the connection object is transferred to the graph.
f60c8b34
JG
375 */
376 g_ptr_array_add(graph->connections, connection);
ffeb0eed 377
f60c8b34 378 /*
0d8b4d8e 379 * Notify both components that their port is connected.
f60c8b34 380 */
d94d92ac
PP
381 BT_LIB_LOGD("Notifying upstream component that its port is connected: "
382 "%![comp-]+c, %![port-]+p", upstream_component, upstream_port);
d24d5663 383 port_connected_status = bt_component_port_connected(upstream_component,
d94d92ac 384 (void *) upstream_port, (void *) downstream_port);
d24d5663 385 if (port_connected_status != BT_FUNC_STATUS_OK) {
870631a2
PP
386 if (port_connected_status < 0) {
387 BT_LIB_LOGW_APPEND_CAUSE(
388 "Upstream component's \"port connected\" method failed: "
389 "status=%s, %![graph-]+g, %![up-comp-]+c, "
390 "%![down-comp-]+c, %![up-port-]+p, %![down-port-]+p",
391 bt_common_func_status_string(
392 port_connected_status),
393 graph, upstream_component, downstream_component,
394 upstream_port, downstream_port);
395 }
396
bf55043c 397 bt_connection_end(connection, true);
d24d5663 398 status = (int) port_connected_status;
bf55043c
PP
399 goto end;
400 }
401
85031ceb 402 connection->notified_upstream_port_connected = true;
d94d92ac
PP
403 BT_LIB_LOGD("Notifying downstream component that its port is connected: "
404 "%![comp-]+c, %![port-]+p", downstream_component,
405 downstream_port);
d24d5663 406 port_connected_status = bt_component_port_connected(downstream_component,
d94d92ac 407 (void *) downstream_port, (void *) upstream_port);
d24d5663 408 if (port_connected_status != BT_FUNC_STATUS_OK) {
870631a2
PP
409 if (port_connected_status < 0) {
410 BT_LIB_LOGW_APPEND_CAUSE(
411 "Downstream component's \"port connected\" method failed: "
412 "status=%s, %![graph-]+g, %![up-comp-]+c, "
413 "%![down-comp-]+c, %![up-port-]+p, %![down-port-]+p",
414 bt_common_func_status_string(
415 port_connected_status),
416 graph, upstream_component, downstream_component,
417 upstream_port, downstream_port);
418 }
419
bf55043c 420 bt_connection_end(connection, true);
d24d5663 421 status = (int) port_connected_status;
bf55043c
PP
422 goto end;
423 }
424
85031ceb 425 connection->notified_downstream_port_connected = true;
1bf957a0 426
3f7d4d90 427 BT_LIB_LOGI("Connected component ports within graph: "
d94d92ac
PP
428 "%![graph-]+g, %![up-comp-]+c, %![down-comp-]+c, "
429 "%![up-port-]+p, %![down-port-]+p",
430 graph, upstream_component, downstream_component,
431 upstream_port, downstream_port);
1bf957a0 432
a256a42d 433 if (user_connection) {
1a6a376a
PP
434 /* Move reference to user */
435 *user_connection = connection;
436 connection = NULL;
a256a42d
PP
437 }
438
f60c8b34 439end:
d24d5663 440 if (status != BT_FUNC_STATUS_OK) {
8cc56726 441 bt_graph_make_faulty(graph);
38cda5da
PP
442 }
443
65300d60 444 bt_object_put_ref(connection);
d94d92ac
PP
445 (void) init_can_consume;
446 bt_graph_set_can_consume(graph, init_can_consume);
a256a42d 447 return status;
f60c8b34
JG
448}
449
ad847455 450static inline
d24d5663 451int consume_graph_sink(struct bt_component_sink *comp)
c0418dd9 452{
d24d5663 453 enum bt_component_class_sink_consume_method_status consume_status;
d94d92ac
PP
454 struct bt_component_class_sink *sink_class = NULL;
455
98b15851 456 BT_ASSERT_DBG(comp);
d94d92ac 457 sink_class = (void *) comp->parent.class;
98b15851 458 BT_ASSERT_DBG(sink_class->methods.consume);
d94d92ac 459 BT_LIB_LOGD("Calling user's consume method: %!+c", comp);
d24d5663 460 consume_status = sink_class->methods.consume((void *) comp);
d94d92ac 461 BT_LOGD("User method returned: status=%s",
d24d5663 462 bt_common_func_status_string(consume_status));
bdb288b3 463 BT_ASSERT_POST_DEV(consume_status == BT_FUNC_STATUS_OK ||
d24d5663
PP
464 consume_status == BT_FUNC_STATUS_END ||
465 consume_status == BT_FUNC_STATUS_AGAIN ||
466 consume_status == BT_FUNC_STATUS_ERROR ||
467 consume_status == BT_FUNC_STATUS_MEMORY_ERROR,
d94d92ac 468 "Invalid component status returned by consuming method: "
d24d5663 469 "status=%s", bt_common_func_status_string(consume_status));
6ecdcca3 470 BT_ASSERT_POST_DEV_NO_ERROR_IF_NO_ERROR_STATUS(consume_status);
870631a2
PP
471 if (consume_status) {
472 if (consume_status < 0) {
473 BT_LIB_LOGW_APPEND_CAUSE(
474 "Component's \"consume\" method failed: "
475 "status=%s, %![comp-]+c",
476 bt_common_func_status_string(consume_status),
477 comp);
478 }
479
d94d92ac
PP
480 goto end;
481 }
482
3f7d4d90 483 BT_LIB_LOGD("Consumed from sink: %![comp-]+c, status=%s",
d24d5663 484 comp, bt_common_func_status_string(consume_status));
d94d92ac
PP
485
486end:
d24d5663 487 return consume_status;
8ed535b5
PP
488}
489
490/*
491 * `node` is removed from the queue of sinks to consume when passed to
492 * this function. This function adds it back to the queue if there's
493 * still something to consume afterwards.
494 */
ad847455 495static inline
d24d5663 496int consume_sink_node(struct bt_graph *graph, GList *node)
8ed535b5 497{
d24d5663 498 int status;
d94d92ac 499 struct bt_component_sink *sink;
8ed535b5
PP
500
501 sink = node->data;
502 status = consume_graph_sink(sink);
d24d5663 503 if (G_UNLIKELY(status != BT_FUNC_STATUS_END)) {
8ed535b5 504 g_queue_push_tail_link(graph->sinks_to_consume, node);
f60c8b34
JG
505 goto end;
506 }
507
508 /* End reached, the node is not added back to the queue and free'd. */
8ed535b5 509 g_queue_delete_link(graph->sinks_to_consume, node);
f60c8b34
JG
510
511 /* Don't forward an END status if there are sinks left to consume. */
512 if (!g_queue_is_empty(graph->sinks_to_consume)) {
d24d5663 513 status = BT_FUNC_STATUS_OK;
f60c8b34
JG
514 goto end;
515 }
8ed535b5
PP
516
517end:
3f7d4d90 518 BT_LIB_LOGD("Consumed sink node: %![comp-]+c, status=%s",
d24d5663 519 sink, bt_common_func_status_string(status));
8ed535b5
PP
520 return status;
521}
522
523BT_HIDDEN
d24d5663 524int bt_graph_consume_sink_no_check(struct bt_graph *graph,
d94d92ac 525 struct bt_component_sink *sink)
8ed535b5 526{
d24d5663 527 int status;
8ed535b5
PP
528 GList *sink_node;
529 int index;
530
3f7d4d90 531 BT_LIB_LOGD("Making specific sink consume: %![comp-]+c", sink);
98b15851 532 BT_ASSERT_DBG(bt_component_borrow_graph((void *) sink) == graph);
8ed535b5
PP
533
534 if (g_queue_is_empty(graph->sinks_to_consume)) {
3f7d4d90 535 BT_LOGD_STR("Graph's sink queue is empty: end of graph.");
d24d5663 536 status = BT_FUNC_STATUS_END;
8ed535b5
PP
537 goto end;
538 }
539
540 index = g_queue_index(graph->sinks_to_consume, sink);
541 if (index < 0) {
3f7d4d90
PP
542 BT_LIB_LOGD("Sink component is not marked as consumable: "
543 "component sink is ended: %![comp-]+c", sink);
d24d5663 544 status = BT_FUNC_STATUS_END;
8ed535b5
PP
545 goto end;
546 }
547
548 sink_node = g_queue_pop_nth_link(graph->sinks_to_consume, index);
98b15851 549 BT_ASSERT_DBG(sink_node);
8ed535b5
PP
550 status = consume_sink_node(graph, sink_node);
551
552end:
553 return status;
554}
555
ad847455 556static inline
d24d5663 557int consume_no_check(struct bt_graph *graph)
8ed535b5 558{
d24d5663 559 int status = BT_FUNC_STATUS_OK;
8ed535b5
PP
560 struct bt_component *sink;
561 GList *current_node;
562
bdb288b3 563 BT_ASSERT_PRE_DEV(graph->has_sink,
f6ccaed9 564 "Graph has no sink component: %!+g", graph);
3f7d4d90 565 BT_LIB_LOGD("Making next sink component consume: %![graph-]+g", graph);
8ed535b5 566
91d81473 567 if (G_UNLIKELY(g_queue_is_empty(graph->sinks_to_consume))) {
3f7d4d90 568 BT_LOGD_STR("Graph's sink queue is empty: end of graph.");
d24d5663 569 status = BT_FUNC_STATUS_END;
8ed535b5
PP
570 goto end;
571 }
572
573 current_node = g_queue_pop_head_link(graph->sinks_to_consume);
574 sink = current_node->data;
3f7d4d90 575 BT_LIB_LOGD("Chose next sink to consume: %!+c", sink);
8ed535b5
PP
576 status = consume_sink_node(graph, current_node);
577
f60c8b34
JG
578end:
579 return status;
c0418dd9
JG
580}
581
648dab91 582enum bt_graph_run_once_status bt_graph_run_once(struct bt_graph *graph)
851b70bd 583{
648dab91 584 enum bt_graph_run_once_status status;
1d915789 585
17f3083a 586 BT_ASSERT_PRE_NO_ERROR();
bdb288b3 587 BT_ASSERT_PRE_DEV_NON_NULL(graph, "Graph");
bdb288b3 588 BT_ASSERT_PRE_DEV(graph->can_consume,
f6ccaed9 589 "Cannot consume graph in its current state: %!+g", graph);
bdb288b3
PP
590 BT_ASSERT_PRE_DEV(graph->config_state !=
591 BT_GRAPH_CONFIGURATION_STATE_FAULTY,
38cda5da 592 "Graph is in a faulty state: %!+g", graph);
4725a201 593 bt_graph_set_can_consume(graph, false);
5badd463 594 status = bt_graph_configure(graph);
91d81473 595 if (G_UNLIKELY(status)) {
5badd463
PP
596 /* bt_graph_configure() logs errors */
597 goto end;
598 }
599
d94d92ac 600 status = consume_no_check(graph);
4725a201 601 bt_graph_set_can_consume(graph, true);
5badd463
PP
602
603end:
26a15756 604 return status;
851b70bd
PP
605}
606
d24d5663 607enum bt_graph_run_status bt_graph_run(struct bt_graph *graph)
f60c8b34 608{
d24d5663 609 enum bt_graph_run_status status;
f60c8b34 610
17f3083a 611 BT_ASSERT_PRE_NO_ERROR();
d94d92ac 612 BT_ASSERT_PRE_NON_NULL(graph, "Graph");
ad847455
PP
613 BT_ASSERT_PRE(graph->can_consume,
614 "Cannot consume graph in its current state: %!+g", graph);
38cda5da
PP
615 BT_ASSERT_PRE(graph->config_state != BT_GRAPH_CONFIGURATION_STATE_FAULTY,
616 "Graph is in a faulty state: %!+g", graph);
4725a201 617 bt_graph_set_can_consume(graph, false);
5badd463 618 status = bt_graph_configure(graph);
91d81473 619 if (G_UNLIKELY(status)) {
5badd463
PP
620 /* bt_graph_configure() logs errors */
621 goto end;
622 }
623
3f7d4d90 624 BT_LIB_LOGI("Running graph: %!+g", graph);
262e5473 625
f60c8b34 626 do {
851b70bd 627 /*
9b4f9b42
PP
628 * Check if the graph is interrupted at each iteration.
629 * If the graph was interrupted by another thread or by
630 * a signal handler, this is NOT a warning nor an error;
631 * it was intentional: log with an INFO level only.
851b70bd 632 */
9b4f9b42
PP
633 if (G_UNLIKELY(bt_graph_is_interrupted(graph))) {
634 BT_LIB_LOGI("Stopping the graph: "
635 "graph was interrupted: %!+g", graph);
636 status = BT_FUNC_STATUS_AGAIN;
851b70bd
PP
637 goto end;
638 }
639
d94d92ac 640 status = consume_no_check(graph);
d24d5663 641 if (G_UNLIKELY(status == BT_FUNC_STATUS_AGAIN)) {
f60c8b34 642 /*
202a3a13
PP
643 * If AGAIN is received and there are multiple
644 * sinks, go ahead and consume from the next
645 * sink.
f60c8b34 646 *
202a3a13
PP
647 * However, in the case where a single sink is
648 * left, the caller can decide to busy-wait and
0d72b8c3 649 * call bt_graph_run() continuously
d94d92ac
PP
650 * until the source is ready or it can decide to
651 * sleep for an arbitrary amount of time.
f60c8b34
JG
652 */
653 if (graph->sinks_to_consume->length > 1) {
d24d5663 654 status = BT_FUNC_STATUS_OK;
f60c8b34
JG
655 }
656 }
d24d5663 657 } while (status == BT_FUNC_STATUS_OK);
f60c8b34 658
9669d693
PP
659 if (status == BT_FUNC_STATUS_END) {
660 /*
661 * The last call to consume_no_check() returned
662 * `BT_FUNC_STATUS_END`, but bt_graph_run() has no
663 * `BT_GRAPH_RUN_STATUS_END` status: replace with
664 * `BT_GRAPH_RUN_STATUS_OK` (success: graph ran
665 * completely).
666 */
667 status = BT_FUNC_STATUS_OK;
f60c8b34 668 }
262e5473 669
202a3a13 670end:
3f7d4d90 671 BT_LIB_LOGI("Graph ran: %![graph-]+g, status=%s", graph,
d24d5663 672 bt_common_func_status_string(status));
4725a201 673 bt_graph_set_can_consume(graph, true);
72b913fb 674 return status;
f60c8b34 675}
1bf957a0 676
d24d5663 677enum bt_graph_add_listener_status
0d72b8c3
PP
678bt_graph_add_source_component_output_port_added_listener(
679 struct bt_graph *graph,
680 bt_graph_source_component_output_port_added_listener_func func,
f3d6b4c2 681 void *data, bt_listener_id *out_listener_id)
1bf957a0 682{
d94d92ac 683 struct bt_graph_listener_port_added listener = {
d94d92ac 684 .func = (port_added_func_t) func,
f3d6b4c2 685 .data = data,
1bf957a0 686 };
2054a0d1 687 bt_listener_id listener_id;
1bf957a0 688
17f3083a 689 BT_ASSERT_PRE_NO_ERROR();
d94d92ac
PP
690 BT_ASSERT_PRE_NON_NULL(graph, "Graph");
691 BT_ASSERT_PRE_NON_NULL(func, "Listener");
d94d92ac
PP
692 g_array_append_val(graph->listeners.source_output_port_added, listener);
693 listener_id = graph->listeners.source_output_port_added->len - 1;
3f7d4d90 694 BT_LIB_LOGD("Added \"source component output port added\" listener to graph: "
d94d92ac
PP
695 "%![graph-]+g, listener-addr=%p, id=%d", graph, listener,
696 listener_id);
697
698 if (listener_id) {
699 *out_listener_id = listener_id;
700 }
701
d24d5663 702 return BT_FUNC_STATUS_OK;
1bf957a0
PP
703}
704
d24d5663 705enum bt_graph_add_listener_status
0d72b8c3
PP
706bt_graph_add_filter_component_output_port_added_listener(
707 struct bt_graph *graph,
708 bt_graph_filter_component_output_port_added_listener_func func,
f3d6b4c2 709 void *data, bt_listener_id *out_listener_id)
1bf957a0 710{
d94d92ac 711 struct bt_graph_listener_port_added listener = {
d94d92ac 712 .func = (port_added_func_t) func,
f3d6b4c2 713 .data = data,
d94d92ac 714 };
2054a0d1 715 bt_listener_id listener_id;
1bf957a0 716
17f3083a 717 BT_ASSERT_PRE_NO_ERROR();
d94d92ac
PP
718 BT_ASSERT_PRE_NON_NULL(graph, "Graph");
719 BT_ASSERT_PRE_NON_NULL(func, "Listener");
d94d92ac
PP
720 g_array_append_val(graph->listeners.filter_output_port_added, listener);
721 listener_id = graph->listeners.filter_output_port_added->len - 1;
3f7d4d90 722 BT_LIB_LOGD("Added \"filter component output port added\" listener to graph: "
d94d92ac
PP
723 "%![graph-]+g, listener-addr=%p, id=%d", graph, listener,
724 listener_id);
725
726 if (listener_id) {
727 *out_listener_id = listener_id;
728 }
729
d24d5663 730 return BT_FUNC_STATUS_OK;
d94d92ac 731}
262e5473 732
d24d5663 733enum bt_graph_add_listener_status
0d72b8c3
PP
734bt_graph_add_filter_component_input_port_added_listener(
735 struct bt_graph *graph,
736 bt_graph_filter_component_input_port_added_listener_func func,
f3d6b4c2 737 void *data, bt_listener_id *out_listener_id)
d94d92ac 738{
d94d92ac 739 struct bt_graph_listener_port_added listener = {
d94d92ac 740 .func = (port_added_func_t) func,
f3d6b4c2 741 .data = data,
d94d92ac 742 };
2054a0d1 743 bt_listener_id listener_id;
8cc092c9 744
17f3083a 745 BT_ASSERT_PRE_NO_ERROR();
d94d92ac
PP
746 BT_ASSERT_PRE_NON_NULL(graph, "Graph");
747 BT_ASSERT_PRE_NON_NULL(func, "Listener");
d94d92ac
PP
748 g_array_append_val(graph->listeners.filter_input_port_added, listener);
749 listener_id = graph->listeners.filter_input_port_added->len - 1;
3f7d4d90 750 BT_LIB_LOGD("Added \"filter component input port added\" listener to graph: "
d94d92ac
PP
751 "%![graph-]+g, listener-addr=%p, id=%d", graph, listener,
752 listener_id);
753
754 if (listener_id) {
755 *out_listener_id = listener_id;
756 }
757
d24d5663 758 return BT_FUNC_STATUS_OK;
d94d92ac 759}
1bf957a0 760
d24d5663 761enum bt_graph_add_listener_status
0d72b8c3
PP
762bt_graph_add_sink_component_input_port_added_listener(
763 struct bt_graph *graph,
764 bt_graph_sink_component_input_port_added_listener_func func,
f3d6b4c2 765 void *data, bt_listener_id *out_listener_id)
d94d92ac 766{
d94d92ac 767 struct bt_graph_listener_port_added listener = {
d94d92ac 768 .func = (port_added_func_t) func,
f3d6b4c2 769 .data = data,
d94d92ac 770 };
2054a0d1 771 bt_listener_id listener_id;
1bf957a0 772
17f3083a 773 BT_ASSERT_PRE_NO_ERROR();
d94d92ac
PP
774 BT_ASSERT_PRE_NON_NULL(graph, "Graph");
775 BT_ASSERT_PRE_NON_NULL(func, "Listener");
d94d92ac
PP
776 g_array_append_val(graph->listeners.sink_input_port_added, listener);
777 listener_id = graph->listeners.sink_input_port_added->len - 1;
3f7d4d90 778 BT_LIB_LOGD("Added \"sink component input port added\" listener to graph: "
d94d92ac
PP
779 "%![graph-]+g, listener-addr=%p, id=%d", graph, listener,
780 listener_id);
781
782 if (listener_id) {
783 *out_listener_id = listener_id;
784 }
785
d24d5663 786 return BT_FUNC_STATUS_OK;
1bf957a0
PP
787}
788
1bf957a0 789BT_HIDDEN
d24d5663 790enum bt_graph_listener_func_status bt_graph_notify_port_added(
8cc56726 791 struct bt_graph *graph, struct bt_port *port)
1bf957a0 792{
d94d92ac
PP
793 uint64_t i;
794 GArray *listeners;
795 struct bt_component *comp;
d24d5663 796 enum bt_graph_listener_func_status status = BT_FUNC_STATUS_OK;
1bf957a0 797
d94d92ac
PP
798 BT_ASSERT(graph);
799 BT_ASSERT(port);
3f7d4d90 800 BT_LIB_LOGD("Notifying graph listeners that a port was added: "
d94d92ac 801 "%![graph-]+g, %![port-]+p", graph, port);
0d72b8c3 802 comp = bt_port_borrow_component_inline(port);
d94d92ac
PP
803 BT_ASSERT(comp);
804
805 switch (comp->class->type) {
806 case BT_COMPONENT_CLASS_TYPE_SOURCE:
807 {
808 switch (port->type) {
809 case BT_PORT_TYPE_OUTPUT:
810 listeners = graph->listeners.source_output_port_added;
811 break;
812 default:
498e7994 813 bt_common_abort();
d94d92ac
PP
814 }
815
816 break;
817 }
818 case BT_COMPONENT_CLASS_TYPE_FILTER:
819 {
820 switch (port->type) {
821 case BT_PORT_TYPE_INPUT:
822 listeners = graph->listeners.filter_input_port_added;
823 break;
824 case BT_PORT_TYPE_OUTPUT:
825 listeners = graph->listeners.filter_output_port_added;
826 break;
827 default:
498e7994 828 bt_common_abort();
d94d92ac 829 }
262e5473 830
d94d92ac
PP
831 break;
832 }
833 case BT_COMPONENT_CLASS_TYPE_SINK:
834 {
835 switch (port->type) {
836 case BT_PORT_TYPE_INPUT:
837 listeners = graph->listeners.sink_input_port_added;
838 break;
839 default:
498e7994 840 bt_common_abort();
d94d92ac 841 }
1bf957a0 842
d94d92ac
PP
843 break;
844 }
845 default:
498e7994 846 bt_common_abort();
d94d92ac
PP
847 }
848
849 for (i = 0; i < listeners->len; i++) {
850 struct bt_graph_listener_port_added *listener =
851 &g_array_index(listeners,
852 struct bt_graph_listener_port_added, i);
853
8cc56726 854
d94d92ac 855 BT_ASSERT(listener->func);
f3d6b4c2 856 status = listener->func(comp, port, listener->data);
6ecdcca3 857 BT_ASSERT_POST_NO_ERROR_IF_NO_ERROR_STATUS(status);
d24d5663 858 if (status != BT_FUNC_STATUS_OK) {
8cc56726
SM
859 goto end;
860 }
1bf957a0 861 }
8cc56726
SM
862
863end:
864 return status;
1bf957a0
PP
865}
866
f167d3c0
PP
867BT_HIDDEN
868void bt_graph_remove_connection(struct bt_graph *graph,
869 struct bt_connection *connection)
870{
f6ccaed9
PP
871 BT_ASSERT(graph);
872 BT_ASSERT(connection);
3f7d4d90 873 BT_LIB_LOGD("Removing graph's connection: %![graph-]+g, %![conn-]+x",
262e5473 874 graph, connection);
f167d3c0
PP
875 g_ptr_array_remove(graph->connections, connection);
876}
36712f1d 877
d94d92ac
PP
878static inline
879bool component_name_exists(struct bt_graph *graph, const char *name)
880{
881 bool exists = false;
882 uint64_t i;
883
884 for (i = 0; i < graph->components->len; i++) {
885 struct bt_component *other_comp = graph->components->pdata[i];
886
887 if (strcmp(name, bt_component_get_name(other_comp)) == 0) {
888 BT_ASSERT_PRE_MSG("Another component with the same name already exists in the graph: "
889 "%![other-comp-]+c, name=\"%s\"",
890 other_comp, name);
891 exists = true;
892 goto end;
893 }
894 }
895
896end:
897 return exists;
898}
899
900static
d24d5663 901int add_component_with_init_method_data(
0d72b8c3 902 struct bt_graph *graph,
d94d92ac
PP
903 struct bt_component_class *comp_cls,
904 comp_init_method_t init_method,
05e21286 905 const char *name, const struct bt_value *params,
e874da19 906 void *init_method_data, bt_logging_level log_level,
9628043c 907 const struct bt_component **user_component)
36712f1d 908{
d24d5663 909 int status = BT_FUNC_STATUS_OK;
21a9f056 910 enum bt_component_class_initialize_method_status init_status;
36712f1d 911 struct bt_component *component = NULL;
d94d92ac
PP
912 int ret;
913 bool init_can_consume;
05e21286 914 struct bt_value *new_params = NULL;
36712f1d 915
d94d92ac
PP
916 BT_ASSERT(comp_cls);
917 BT_ASSERT_PRE_NON_NULL(graph, "Graph");
918 BT_ASSERT_PRE_NON_NULL(name, "Name");
5badd463
PP
919 BT_ASSERT_PRE(
920 graph->config_state == BT_GRAPH_CONFIGURATION_STATE_CONFIGURING,
38cda5da 921 "Graph is not in the \"configuring\" state: %!+g", graph);
d94d92ac
PP
922 BT_ASSERT_PRE(!component_name_exists(graph, name),
923 "Duplicate component name: %!+g, name=\"%s\"", graph, name);
924 BT_ASSERT_PRE(!params || bt_value_is_map(params),
925 "Parameter value is not a map value: %!+v", params);
4aa7981f 926 init_can_consume = graph->can_consume;
d94d92ac 927 bt_graph_set_can_consume(graph, false);
3f7d4d90 928 BT_LIB_LOGI("Adding component to graph: "
e874da19
PP
929 "%![graph-]+g, %![cc-]+C, name=\"%s\", log-level=%s, "
930 "%![params-]+v, init-method-data-addr=%p",
931 graph, comp_cls, name,
932 bt_common_logging_level_string(log_level), params,
933 init_method_data);
36712f1d 934
d94d92ac 935 if (!params) {
05e21286
PP
936 new_params = bt_value_map_create();
937 if (!new_params) {
870631a2
PP
938 BT_LIB_LOGE_APPEND_CAUSE(
939 "Cannot create empty map value object.");
d24d5663 940 status = BT_FUNC_STATUS_MEMORY_ERROR;
36712f1d
PP
941 goto end;
942 }
05e21286
PP
943
944 params = new_params;
36712f1d
PP
945 }
946
e874da19 947 ret = bt_component_create(comp_cls, name, log_level, &component);
d94d92ac 948 if (ret) {
870631a2
PP
949 BT_LIB_LOGE_APPEND_CAUSE(
950 "Cannot create empty component object: ret=%d",
d94d92ac 951 ret);
d24d5663 952 status = BT_FUNC_STATUS_MEMORY_ERROR;
36712f1d
PP
953 goto end;
954 }
955
956 /*
957 * The user's initialization method needs to see that this
958 * component is part of the graph. If the user method fails, we
959 * immediately remove the component from the graph's components.
960 */
961 g_ptr_array_add(graph->components, component);
962 bt_component_set_graph(component, graph);
0d47d31b 963 bt_value_freeze(params);
36712f1d 964
d94d92ac 965 if (init_method) {
59225a3e
SM
966 /*
967 * There is no use for config objects right now, so just pass
968 * NULL.
969 */
36712f1d 970 BT_LOGD_STR("Calling user's initialization method.");
59225a3e 971 init_status = init_method(component, NULL, params, init_method_data);
36712f1d 972 BT_LOGD("User method returned: status=%s",
d24d5663 973 bt_common_func_status_string(init_status));
6ecdcca3 974 BT_ASSERT_POST_DEV_NO_ERROR_IF_NO_ERROR_STATUS(init_status);
d24d5663 975 if (init_status != BT_FUNC_STATUS_OK) {
870631a2
PP
976 if (init_status < 0) {
977 BT_LIB_LOGW_APPEND_CAUSE(
978 "Component initialization method failed: "
979 "status=%s, %![comp-]+c",
980 bt_common_func_status_string(init_status),
981 component);
982 }
983
d24d5663 984 status = init_status;
36712f1d
PP
985 bt_component_set_graph(component, NULL);
986 g_ptr_array_remove_fast(graph->components, component);
987 goto end;
988 }
989 }
990
991 /*
992 * Mark the component as initialized so that its finalization
993 * method is called when it is destroyed.
994 */
995 component->initialized = true;
996
997 /*
998 * If it's a sink component, it needs to be part of the graph's
648dab91
PP
999 * sink queue to be consumed by bt_graph_run() or
1000 * bt_graph_run_once().
36712f1d
PP
1001 */
1002 if (bt_component_is_sink(component)) {
d94d92ac 1003 graph->has_sink = true;
36712f1d
PP
1004 g_queue_push_tail(graph->sinks_to_consume, component);
1005 }
1006
1007 /*
1008 * Freeze the component class now that it's instantiated at
1009 * least once.
1010 */
1011 BT_LOGD_STR("Freezing component class.");
d94d92ac 1012 bt_component_class_freeze(comp_cls);
3f7d4d90 1013 BT_LIB_LOGI("Added component to graph: "
e874da19
PP
1014 "%![graph-]+g, %![cc-]+C, name=\"%s\", log-level=%s, "
1015 "%![params-]+v, init-method-data-addr=%p, %![comp-]+c",
1016 graph, comp_cls, name,
1017 bt_common_logging_level_string(log_level), params,
1018 init_method_data, component);
36712f1d
PP
1019
1020 if (user_component) {
1021 /* Move reference to user */
1022 *user_component = component;
1023 component = NULL;
1024 }
1025
1026end:
d24d5663 1027 if (status != BT_FUNC_STATUS_OK) {
8cc56726 1028 bt_graph_make_faulty(graph);
38cda5da
PP
1029 }
1030
65300d60 1031 bt_object_put_ref(component);
05e21286 1032 bt_object_put_ref(new_params);
d94d92ac
PP
1033 (void) init_can_consume;
1034 bt_graph_set_can_consume(graph, init_can_consume);
d24d5663 1035 return status;
36712f1d
PP
1036}
1037
d24d5663 1038enum bt_graph_add_component_status
21a9f056 1039bt_graph_add_source_component_with_initialize_method_data(
0d72b8c3
PP
1040 struct bt_graph *graph,
1041 const struct bt_component_class_source *comp_cls,
05e21286 1042 const char *name, const struct bt_value *params,
e874da19 1043 void *init_method_data, bt_logging_level log_level,
0d72b8c3 1044 const struct bt_component_source **component)
d94d92ac 1045{
17f3083a 1046 BT_ASSERT_PRE_NO_ERROR();
d94d92ac
PP
1047 BT_ASSERT_PRE_NON_NULL(comp_cls, "Component class");
1048 return add_component_with_init_method_data(graph,
1049 (void *) comp_cls, (comp_init_method_t) comp_cls->methods.init,
e874da19 1050 name, params, init_method_data, log_level, (void *) component);
d94d92ac
PP
1051}
1052
d24d5663 1053enum bt_graph_add_component_status bt_graph_add_source_component(
0d72b8c3
PP
1054 struct bt_graph *graph,
1055 const struct bt_component_class_source *comp_cls,
05e21286 1056 const char *name, const struct bt_value *params,
9628043c 1057 enum bt_logging_level log_level,
0d72b8c3 1058 const struct bt_component_source **component)
d94d92ac 1059{
17f3083a 1060 BT_ASSERT_PRE_NO_ERROR();
21a9f056 1061 return bt_graph_add_source_component_with_initialize_method_data(
e874da19 1062 graph, comp_cls, name, params, NULL, log_level, component);
d94d92ac
PP
1063}
1064
d24d5663 1065enum bt_graph_add_component_status
21a9f056 1066bt_graph_add_filter_component_with_initialize_method_data(
0d72b8c3
PP
1067 struct bt_graph *graph,
1068 const struct bt_component_class_filter *comp_cls,
05e21286 1069 const char *name, const struct bt_value *params,
9628043c 1070 void *init_method_data, enum bt_logging_level log_level,
0d72b8c3 1071 const struct bt_component_filter **component)
d94d92ac 1072{
17f3083a 1073 BT_ASSERT_PRE_NO_ERROR();
d94d92ac
PP
1074 BT_ASSERT_PRE_NON_NULL(comp_cls, "Component class");
1075 return add_component_with_init_method_data(graph,
1076 (void *) comp_cls, (comp_init_method_t) comp_cls->methods.init,
e874da19 1077 name, params, init_method_data, log_level, (void *) component);
d94d92ac
PP
1078}
1079
d24d5663 1080enum bt_graph_add_component_status bt_graph_add_filter_component(
0d72b8c3
PP
1081 struct bt_graph *graph,
1082 const struct bt_component_class_filter *comp_cls,
05e21286 1083 const char *name, const struct bt_value *params,
9628043c 1084 enum bt_logging_level log_level,
0d72b8c3 1085 const struct bt_component_filter **component)
d94d92ac 1086{
17f3083a 1087 BT_ASSERT_PRE_NO_ERROR();
21a9f056 1088 return bt_graph_add_filter_component_with_initialize_method_data(
e874da19 1089 graph, comp_cls, name, params, NULL, log_level, component);
d94d92ac
PP
1090}
1091
d24d5663 1092enum bt_graph_add_component_status
21a9f056 1093bt_graph_add_sink_component_with_initialize_method_data(
0d72b8c3
PP
1094 struct bt_graph *graph,
1095 const struct bt_component_class_sink *comp_cls,
05e21286 1096 const char *name, const struct bt_value *params,
9628043c 1097 void *init_method_data, enum bt_logging_level log_level,
0d72b8c3 1098 const struct bt_component_sink **component)
36712f1d 1099{
17f3083a 1100 BT_ASSERT_PRE_NO_ERROR();
d94d92ac
PP
1101 BT_ASSERT_PRE_NON_NULL(comp_cls, "Component class");
1102 return add_component_with_init_method_data(graph,
1103 (void *) comp_cls, (comp_init_method_t) comp_cls->methods.init,
e874da19 1104 name, params, init_method_data, log_level, (void *) component);
d94d92ac
PP
1105}
1106
d24d5663 1107enum bt_graph_add_component_status bt_graph_add_sink_component(
0d72b8c3
PP
1108 struct bt_graph *graph,
1109 const struct bt_component_class_sink *comp_cls,
05e21286 1110 const char *name, const struct bt_value *params,
9628043c 1111 enum bt_logging_level log_level,
0d72b8c3 1112 const struct bt_component_sink **component)
d94d92ac 1113{
17f3083a 1114 BT_ASSERT_PRE_NO_ERROR();
21a9f056 1115 return bt_graph_add_sink_component_with_initialize_method_data(
e874da19 1116 graph, comp_cls, name, params, NULL, log_level, component);
36712f1d 1117}
8ed535b5 1118
078033ed
PP
1119enum bt_graph_add_component_status
1120bt_graph_add_simple_sink_component(struct bt_graph *graph, const char *name,
21a9f056 1121 bt_graph_simple_sink_component_initialize_func init_func,
078033ed
PP
1122 bt_graph_simple_sink_component_consume_func consume_func,
1123 bt_graph_simple_sink_component_finalize_func finalize_func,
1124 void *user_data, const bt_component_sink **component)
1125{
1126 enum bt_graph_add_component_status status;
1127 struct bt_component_class_sink *comp_cls;
1128 struct simple_sink_init_method_data init_method_data = {
1129 .init_func = init_func,
1130 .consume_func = consume_func,
1131 .finalize_func = finalize_func,
1132 .user_data = user_data,
1133 };
1134
17f3083a
SM
1135 BT_ASSERT_PRE_NO_ERROR();
1136
078033ed
PP
1137 /*
1138 * Other preconditions are checked by
1139 * bt_graph_add_sink_component_with_init_method_data().
1140 */
1141 BT_ASSERT_PRE_NON_NULL(consume_func, "Consume function");
1142
1143 comp_cls = bt_component_class_sink_simple_borrow();
1144 if (!comp_cls) {
1145 BT_LIB_LOGE_APPEND_CAUSE(
1146 "Cannot borrow simple sink component class.");
1147 status = BT_FUNC_STATUS_MEMORY_ERROR;
1148 goto end;
1149 }
1150
21a9f056 1151 status = bt_graph_add_sink_component_with_initialize_method_data(graph,
078033ed
PP
1152 comp_cls, name, NULL, &init_method_data,
1153 BT_LOGGING_LEVEL_NONE, component);
1154
1155end:
1156 return status;
1157}
1158
5c563278 1159BT_HIDDEN
d6e69534
PP
1160void bt_graph_add_message(struct bt_graph *graph,
1161 struct bt_message *msg)
5c563278
PP
1162{
1163 BT_ASSERT(graph);
d6e69534 1164 BT_ASSERT(msg);
5c563278
PP
1165
1166 /*
1167 * It's okay not to take a reference because, when a
d6e69534 1168 * message's reference count drops to 0, either:
5c563278
PP
1169 *
1170 * * It is recycled back to one of this graph's pool.
1171 * * It is destroyed because it doesn't have any link to any
1172 * graph, which means the original graph is already destroyed.
1173 */
d6e69534 1174 g_ptr_array_add(graph->messages, msg);
5c563278 1175}
c5b9b441 1176
9b4f9b42
PP
1177BT_HIDDEN
1178bool bt_graph_is_interrupted(const struct bt_graph *graph)
1179{
98b15851 1180 BT_ASSERT_DBG(graph);
9b4f9b42
PP
1181 return bt_interrupter_array_any_is_set(graph->interrupters);
1182}
1183
1184enum bt_graph_add_interrupter_status bt_graph_add_interrupter(
1185 struct bt_graph *graph, const struct bt_interrupter *intr)
1186{
17f3083a 1187 BT_ASSERT_PRE_NO_ERROR();
9b4f9b42
PP
1188 BT_ASSERT_PRE_NON_NULL(graph, "Graph");
1189 BT_ASSERT_PRE_NON_NULL(intr, "Interrupter");
1190 g_ptr_array_add(graph->interrupters, (void *) intr);
6871026b 1191 bt_object_get_ref_no_null_check(intr);
9b4f9b42
PP
1192 BT_LIB_LOGD("Added interrupter to graph: %![graph-]+g, %![intr-]+z",
1193 graph, intr);
1194 return BT_FUNC_STATUS_OK;
1195}
1196
1197void bt_graph_interrupt(struct bt_graph *graph)
1198{
1199 BT_ASSERT_PRE_NON_NULL(graph, "Graph");
1200 bt_interrupter_set(graph->default_interrupter);
1201 BT_LIB_LOGI("Interrupted graph: %!+g", graph);
1202}
1203
c5b9b441
PP
1204void bt_graph_get_ref(const struct bt_graph *graph)
1205{
1206 bt_object_get_ref(graph);
1207}
1208
1209void bt_graph_put_ref(const struct bt_graph *graph)
1210{
1211 bt_object_put_ref(graph);
1212}
This page took 0.132463 seconds and 4 git commands to generate.