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