Make bt_graph_add_*_listener() function return a listener ID
[babeltrace.git] / lib / graph / graph.c
1 /*
2 * graph.c
3 *
4 * Babeltrace Plugin Component Graph
5 *
6 * Copyright 2017 Jérémie Galarneau <jeremie.galarneau@efficios.com>
7 * Copyright 2017 Philippe Proulx <pproulx@efficios.com>
8 *
9 * Permission is hereby granted, free of charge, to any person obtaining a copy
10 * of this software and associated documentation files (the "Software"), to deal
11 * in the Software without restriction, including without limitation the rights
12 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
13 * copies of the Software, and to permit persons to whom the Software is
14 * furnished to do so, subject to the following conditions:
15 *
16 * The above copyright notice and this permission notice shall be included in
17 * all copies or substantial portions of the Software.
18 *
19 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
20 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
21 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
22 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
23 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
24 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
25 * SOFTWARE.
26 */
27
28 #define BT_LOG_TAG "GRAPH"
29 #include <babeltrace/lib-logging-internal.h>
30
31 #include <babeltrace/graph/component-internal.h>
32 #include <babeltrace/graph/graph-internal.h>
33 #include <babeltrace/graph/connection-internal.h>
34 #include <babeltrace/graph/component-sink-internal.h>
35 #include <babeltrace/graph/component-source.h>
36 #include <babeltrace/graph/component-filter.h>
37 #include <babeltrace/graph/port.h>
38 #include <babeltrace/compiler-internal.h>
39 #include <babeltrace/types.h>
40 #include <unistd.h>
41 #include <glib.h>
42
43 struct bt_graph_listener {
44 void *func;
45 void *data;
46 };
47
48 static
49 void bt_graph_destroy(struct bt_object *obj)
50 {
51 struct bt_graph *graph = container_of(obj,
52 struct bt_graph, base);
53
54 /*
55 * The graph's reference count is 0 if we're here. Increment
56 * it to avoid a double-destroy (possibly infinitely recursive)
57 * in this situation:
58 *
59 * 1. We put and destroy a connection.
60 * 2. This connection's destructor finalizes its active
61 * notification iterators.
62 * 3. A notification iterator's finalization function gets a
63 * new reference on its component (reference count goes from
64 * 0 to 1).
65 * 4. Since this component's reference count goes to 1, it takes
66 * a reference on its parent (this graph). This graph's
67 * reference count goes from 0 to 1.
68 * 5. The notification iterator's finalization function puts its
69 * component reference (reference count goes from 1 to 0).
70 * 6. Since this component's reference count goes from 1 to 0,
71 * it puts its parent (this graph). This graph's reference
72 * count goes from 1 to 0.
73 * 7. Since this graph's reference count goes from 1 to 0,
74 * its destructor is called (this function).
75 *
76 * With the incrementation below, the graph's reference count at
77 * step 4 goes from 1 to 2, and from 2 to 1 at step 6. This
78 * ensures that this function is not called two times.
79 */
80 BT_LOGD("Destroying graph: addr=%p", graph);
81 obj->ref_count.count++;
82
83 if (graph->connections) {
84 BT_LOGD_STR("Destroying connections.");
85 g_ptr_array_free(graph->connections, TRUE);
86 }
87 if (graph->components) {
88 BT_LOGD_STR("Destroying components.");
89 g_ptr_array_free(graph->components, TRUE);
90 }
91 if (graph->sinks_to_consume) {
92 g_queue_free(graph->sinks_to_consume);
93 }
94
95 if (graph->listeners.port_added) {
96 g_array_free(graph->listeners.port_added, TRUE);
97 }
98
99 if (graph->listeners.port_removed) {
100 g_array_free(graph->listeners.port_removed, TRUE);
101 }
102
103 if (graph->listeners.ports_connected) {
104 g_array_free(graph->listeners.ports_connected, TRUE);
105 }
106
107 if (graph->listeners.ports_disconnected) {
108 g_array_free(graph->listeners.ports_disconnected, TRUE);
109 }
110
111 g_free(graph);
112 }
113
114 static
115 int init_listeners_array(GArray **listeners)
116 {
117 int ret = 0;
118
119 assert(listeners);
120 *listeners = g_array_new(FALSE, TRUE, sizeof(struct bt_graph_listener));
121 if (!*listeners) {
122 BT_LOGE_STR("Failed to allocate one GArray.");
123 ret = -1;
124 goto end;
125 }
126
127 end:
128 return ret;
129 }
130
131 struct bt_graph *bt_graph_create(void)
132 {
133 struct bt_graph *graph;
134 int ret;
135
136 BT_LOGD_STR("Creating graph object.");
137 graph = g_new0(struct bt_graph, 1);
138 if (!graph) {
139 BT_LOGE_STR("Failed to allocate one graph.");
140 goto end;
141 }
142
143 bt_object_init(graph, bt_graph_destroy);
144
145 graph->connections = g_ptr_array_new_with_free_func(bt_object_release);
146 if (!graph->connections) {
147 BT_LOGE_STR("Failed to allocate one GPtrArray.");
148 goto error;
149 }
150 graph->components = g_ptr_array_new_with_free_func(bt_object_release);
151 if (!graph->components) {
152 BT_LOGE_STR("Failed to allocate one GPtrArray.");
153 goto error;
154 }
155 graph->sinks_to_consume = g_queue_new();
156 if (!graph->sinks_to_consume) {
157 BT_LOGE_STR("Failed to allocate one GQueue.");
158 goto error;
159 }
160
161 ret = init_listeners_array(&graph->listeners.port_added);
162 if (ret) {
163 BT_LOGE_STR("Cannot create the \"port added\" listener array.");
164 goto error;
165 }
166
167 ret = init_listeners_array(&graph->listeners.port_removed);
168 if (ret) {
169 BT_LOGE_STR("Cannot create the \"port removed\" listener array.");
170 goto error;
171 }
172
173 ret = init_listeners_array(&graph->listeners.ports_connected);
174 if (ret) {
175 BT_LOGE_STR("Cannot create the \"port connected\" listener array.");
176 goto error;
177 }
178
179 ret = init_listeners_array(&graph->listeners.ports_disconnected);
180 if (ret) {
181 BT_LOGE_STR("Cannot create the \"port disconneted\" listener array.");
182 goto error;
183 }
184
185 BT_LOGD("Created graph object: addr=%p", graph);
186
187 end:
188 return graph;
189 error:
190 BT_PUT(graph);
191 goto end;
192 }
193
194 struct bt_connection *bt_graph_connect_ports(struct bt_graph *graph,
195 struct bt_port *upstream_port,
196 struct bt_port *downstream_port)
197 {
198 struct bt_connection *connection = NULL;
199 struct bt_graph *upstream_graph = NULL;
200 struct bt_graph *downstream_graph = NULL;
201 struct bt_component *upstream_component = NULL;
202 struct bt_component *downstream_component = NULL;
203 enum bt_component_status component_status;
204 bt_bool upstream_was_already_in_graph;
205 bt_bool downstream_was_already_in_graph;
206
207 if (!graph) {
208 BT_LOGW_STR("Invalid parameter: graph is NULL.");
209 goto end;
210 }
211
212 if (!upstream_port) {
213 BT_LOGW_STR("Invalid parameter: upstream port is NULL.");
214 goto end;
215 }
216
217 if (!downstream_port) {
218 BT_LOGW_STR("Invalid parameter: downstream port is NULL.");
219 goto end;
220 }
221
222 BT_LOGD("Connecting component ports within graph: "
223 "graph-addr=%p, "
224 "upstream-port-addr=%p, upstream-port-name=\"%s\", "
225 "downstream-port-addr=%p, downstream-port-name=\"%s\"",
226 graph, upstream_port, bt_port_get_name(upstream_port),
227 downstream_port, bt_port_get_name(downstream_port));
228
229 if (graph->canceled) {
230 BT_LOGW_STR("Invalid parameter: graph is canceled.");
231 goto end;
232 }
233
234 /* Ensure appropriate types for upstream and downstream ports. */
235 if (bt_port_get_type(upstream_port) != BT_PORT_TYPE_OUTPUT) {
236 BT_LOGW_STR("Invalid parameter: upstream port is not an output port.");
237 goto end;
238 }
239 if (bt_port_get_type(downstream_port) != BT_PORT_TYPE_INPUT) {
240 BT_LOGW_STR("Invalid parameter: downstream port is not an input port.");
241 goto end;
242 }
243
244 /* Ensure that both ports are currently unconnected. */
245 if (bt_port_is_connected(upstream_port)) {
246 BT_LOGW_STR("Invalid parameter: upstream port is already connected.");
247 goto end;
248 }
249
250 if (bt_port_is_connected(downstream_port)) {
251 BT_LOGW_STR("Invalid parameter: downstream port is already connected.");
252 goto end;
253 }
254
255 /*
256 * Ensure that both ports are still attached to their creating
257 * component.
258 */
259 upstream_component = bt_port_get_component(upstream_port);
260 if (!upstream_component) {
261 BT_LOGW_STR("Invalid parameter: upstream port is loose (does not belong to a component)");
262 goto end;
263 }
264
265 downstream_component = bt_port_get_component(downstream_port);
266 if (!downstream_component) {
267 BT_LOGW_STR("Invalid parameter: downstream port is loose (does not belong to a component)");
268 goto end;
269 }
270
271 BT_LOGD("Connecting component ports: "
272 "upstream-comp-addr=%p, upstream-comp-name=\"%s\", "
273 "downstream-comp-addr=%p, downstream-comp-name=\"%s\"",
274 upstream_component, bt_component_get_name(upstream_component),
275 downstream_component, bt_component_get_name(downstream_component));
276
277 /* Ensure the components are not already part of another graph. */
278 upstream_graph = bt_component_get_graph(upstream_component);
279 if (upstream_graph && (graph != upstream_graph)) {
280 BT_LOGW("Invalid parameter: upstream port's component is already part of another graph: "
281 "other-graph-addr=%p", upstream_graph);
282 goto error;
283 }
284 upstream_was_already_in_graph = (graph == upstream_graph);
285 downstream_graph = bt_component_get_graph(downstream_component);
286 if (downstream_graph && (graph != downstream_graph)) {
287 BT_LOGW("Invalid parameter: downstream port's component is already part of another graph: "
288 "other-graph-addr=%p", downstream_graph);
289 goto error;
290 }
291 downstream_was_already_in_graph = (graph == downstream_graph);
292
293 /*
294 * At this point the ports are not connected yet. Both
295 * components need to accept an eventual connection to their
296 * port by the other port before we continue.
297 */
298 BT_LOGD_STR("Asking upstream component to accept the connection.");
299 component_status = bt_component_accept_port_connection(
300 upstream_component, upstream_port, downstream_port);
301 if (component_status != BT_COMPONENT_STATUS_OK) {
302 if (component_status == BT_COMPONENT_STATUS_REFUSE_PORT_CONNECTION) {
303 BT_LOGD_STR("Upstream component refused the connection.");
304 } else {
305 BT_LOGW("Cannot ask upstream component to accept the connection: "
306 "status=%s", bt_component_status_string(component_status));
307 }
308
309 goto error;
310 }
311
312 BT_LOGD_STR("Asking downstream component to accept the connection.");
313 component_status = bt_component_accept_port_connection(
314 downstream_component, downstream_port, upstream_port);
315 if (component_status != BT_COMPONENT_STATUS_OK) {
316 if (component_status == BT_COMPONENT_STATUS_REFUSE_PORT_CONNECTION) {
317 BT_LOGD_STR("Downstream component refused the connection.");
318 } else {
319 BT_LOGW("Cannot ask downstream component to accept the connection: "
320 "status=%s", bt_component_status_string(component_status));
321 }
322
323 goto error;
324 }
325
326 BT_LOGD_STR("Creating connection.");
327 connection = bt_connection_create(graph, upstream_port,
328 downstream_port);
329 if (!connection) {
330 BT_LOGW("Cannot create connection object.");
331 goto error;
332 }
333
334 BT_LOGD("Connection object created: conn-addr=%p", connection);
335
336 /*
337 * Ownership of upstream_component/downstream_component and of
338 * the connection object is transferred to the graph.
339 */
340 g_ptr_array_add(graph->connections, connection);
341
342 if (!upstream_was_already_in_graph) {
343 g_ptr_array_add(graph->components, upstream_component);
344 bt_component_set_graph(upstream_component, graph);
345 }
346 if (!downstream_was_already_in_graph) {
347 g_ptr_array_add(graph->components, downstream_component);
348 bt_component_set_graph(downstream_component, graph);
349 if (bt_component_get_class_type(downstream_component) ==
350 BT_COMPONENT_CLASS_TYPE_SINK) {
351 g_queue_push_tail(graph->sinks_to_consume,
352 downstream_component);
353 }
354 }
355
356 /*
357 * The graph is now the parent of these components which
358 * garantees their existence for the duration of the graph's
359 * lifetime.
360 */
361
362 /*
363 * Notify both components that their port is connected.
364 */
365 BT_LOGD_STR("Notifying upstream component that its port is connected.");
366 bt_component_port_connected(upstream_component, upstream_port,
367 downstream_port);
368 BT_LOGD_STR("Notifying downstream component that its port is connected.");
369 bt_component_port_connected(downstream_component, downstream_port,
370 upstream_port);
371
372 /*
373 * Notify the graph's creator that both ports are connected.
374 */
375 BT_LOGD_STR("Notifying graph's user that new component ports are connected.");
376 bt_graph_notify_ports_connected(graph, upstream_port, downstream_port);
377 BT_LOGD("Connected component ports within graph: "
378 "graph-addr=%p, "
379 "upstream-comp-addr=%p, upstream-comp-name=\"%s\", "
380 "downstream-comp-addr=%p, downstream-comp-name=\"%s\", "
381 "upstream-port-addr=%p, upstream-port-name=\"%s\", "
382 "downstream-port-addr=%p, downstream-port-name=\"%s\"",
383 graph,
384 upstream_component, bt_component_get_name(upstream_component),
385 downstream_component, bt_component_get_name(downstream_component),
386 upstream_port, bt_port_get_name(upstream_port),
387 downstream_port, bt_port_get_name(downstream_port));
388
389 end:
390 bt_put(upstream_graph);
391 bt_put(downstream_graph);
392 bt_put(upstream_component);
393 bt_put(downstream_component);
394 return connection;
395
396 error:
397 BT_PUT(upstream_component);
398 BT_PUT(downstream_component);
399 goto end;
400 }
401
402 enum bt_graph_status bt_graph_consume(struct bt_graph *graph)
403 {
404 struct bt_component *sink;
405 enum bt_graph_status status = BT_GRAPH_STATUS_OK;
406 enum bt_component_status comp_status;
407 GList *current_node;
408
409 if (!graph) {
410 BT_LOGW_STR("Invalid parameter: graph is NULL.");
411 status = BT_GRAPH_STATUS_INVALID;
412 goto end;
413 }
414
415 BT_LOGV("Making sink consume: addr=%p", graph);
416
417 if (graph->canceled) {
418 BT_LOGW_STR("Invalid parameter: graph is canceled.");
419 status = BT_GRAPH_STATUS_CANCELED;
420 goto end;
421 }
422
423 if (g_queue_is_empty(graph->sinks_to_consume)) {
424 BT_LOGV_STR("Graph's sink queue is empty: end of graph.");
425 status = BT_GRAPH_STATUS_END;
426 goto end;
427 }
428
429 current_node = g_queue_pop_head_link(graph->sinks_to_consume);
430 sink = current_node->data;
431 BT_LOGV("Chose next sink to consume: comp-addr=%p, comp-name=\"%s\"",
432 sink, bt_component_get_name(sink));
433 comp_status = bt_component_sink_consume(sink);
434 BT_LOGV("Consumed from sink: status=%s",
435 bt_component_status_string(comp_status));
436 switch (comp_status) {
437 case BT_COMPONENT_STATUS_OK:
438 break;
439 case BT_COMPONENT_STATUS_END:
440 status = BT_GRAPH_STATUS_END;
441 break;
442 case BT_COMPONENT_STATUS_AGAIN:
443 status = BT_GRAPH_STATUS_AGAIN;
444 break;
445 case BT_COMPONENT_STATUS_INVALID:
446 status = BT_GRAPH_STATUS_INVALID;
447 break;
448 default:
449 status = BT_GRAPH_STATUS_ERROR;
450 break;
451 }
452
453 if (status != BT_GRAPH_STATUS_END) {
454 g_queue_push_tail_link(graph->sinks_to_consume, current_node);
455 goto end;
456 }
457
458 /* End reached, the node is not added back to the queue and free'd. */
459 g_queue_delete_link(graph->sinks_to_consume, current_node);
460
461 /* Don't forward an END status if there are sinks left to consume. */
462 if (!g_queue_is_empty(graph->sinks_to_consume)) {
463 status = BT_GRAPH_STATUS_OK;
464 goto end;
465 }
466 end:
467 BT_LOGV("Graph consumed: status=%s", bt_graph_status_string(status));
468 return status;
469 }
470
471 enum bt_graph_status bt_graph_run(struct bt_graph *graph)
472 {
473 enum bt_graph_status status = BT_GRAPH_STATUS_OK;
474
475 if (!graph) {
476 BT_LOGW_STR("Invalid parameter: graph is NULL.");
477 status = BT_GRAPH_STATUS_INVALID;
478 goto end;
479 }
480
481 BT_LOGV("Running graph: addr=%p", graph);
482
483 do {
484 status = bt_graph_consume(graph);
485 if (status == BT_GRAPH_STATUS_AGAIN) {
486 /*
487 * If AGAIN is received and there are multiple
488 * sinks, go ahead and consume from the next
489 * sink.
490 *
491 * However, in the case where a single sink is
492 * left, the caller can decide to busy-wait and
493 * call bt_graph_run() continuously until the
494 * source is ready or it can decide to sleep for
495 * an arbitrary amount of time.
496 */
497 if (graph->sinks_to_consume->length > 1) {
498 status = BT_GRAPH_STATUS_OK;
499 }
500 }
501 } while (status == BT_GRAPH_STATUS_OK);
502
503 if (g_queue_is_empty(graph->sinks_to_consume)) {
504 status = BT_GRAPH_STATUS_END;
505 }
506
507 end:
508 BT_LOGV("Graph ran: status=%s", bt_graph_status_string(status));
509 return status;
510 }
511
512 static
513 int add_listener(GArray *listeners, void *func, void *data)
514 {
515 struct bt_graph_listener listener = {
516 .func = func,
517 .data = data,
518 };
519
520 g_array_append_val(listeners, listener);
521 return listeners->len - 1;
522 }
523
524 int bt_graph_add_port_added_listener(
525 struct bt_graph *graph,
526 bt_graph_port_added_listener listener, void *data)
527 {
528 int ret;
529
530 if (!graph) {
531 BT_LOGW_STR("Invalid parameter: graph is NULL.");
532 ret = -1;
533 goto end;
534 }
535
536 if (!listener) {
537 BT_LOGW_STR("Invalid parameter: listener is NULL.");
538 ret = -1;
539 goto end;
540 }
541
542 ret = add_listener(graph->listeners.port_added, listener, data);
543 BT_LOGV("Added \"port added\" listener to graph: "
544 "graph-addr=%p, listener-addr=%p, pos=%d",
545 graph, listener, ret);
546
547 end:
548 return ret;
549 }
550
551 int bt_graph_add_port_removed_listener(
552 struct bt_graph *graph,
553 bt_graph_port_removed_listener listener, void *data)
554 {
555 int ret;
556
557 if (!graph) {
558 BT_LOGW_STR("Invalid parameter: graph is NULL.");
559 ret = -1;
560 goto end;
561 }
562
563 if (!listener) {
564 BT_LOGW_STR("Invalid parameter: listener is NULL.");
565 ret = -1;
566 goto end;
567 }
568
569 ret = add_listener(graph->listeners.port_removed, listener, data);
570 BT_LOGV("Added \"port removed\" listener to graph: "
571 "graph-addr=%p, listener-addr=%p, pos=%d",
572 graph, listener, ret);
573
574 end:
575 return ret;
576 }
577
578 int bt_graph_add_ports_connected_listener(
579 struct bt_graph *graph,
580 bt_graph_ports_connected_listener listener, void *data)
581 {
582 int ret;
583
584 if (!graph) {
585 BT_LOGW_STR("Invalid parameter: graph is NULL.");
586 ret = -1;
587 goto end;
588 }
589
590 if (!listener) {
591 BT_LOGW_STR("Invalid parameter: listener is NULL.");
592 ret = -1;
593 goto end;
594 }
595
596 ret = add_listener(graph->listeners.ports_connected, listener, data);
597 BT_LOGV("Added \"port connected\" listener to graph: "
598 "graph-addr=%p, listener-addr=%p, pos=%d",
599 graph, listener, ret);
600
601 end:
602 return ret;
603 }
604
605 int bt_graph_add_ports_disconnected_listener(
606 struct bt_graph *graph,
607 bt_graph_ports_disconnected_listener listener, void *data)
608 {
609 int ret;
610
611 if (!graph) {
612 BT_LOGW_STR("Invalid parameter: graph is NULL.");
613 ret = -1;
614 goto end;
615 }
616
617 if (!listener) {
618 BT_LOGW_STR("Invalid parameter: listener is NULL.");
619 ret = -1;
620 goto end;
621 }
622
623 ret = add_listener(graph->listeners.ports_disconnected, listener, data);
624 BT_LOGV("Added \"port disconnected\" listener to graph: "
625 "graph-addr=%p, listener-addr=%p, pos=%d",
626 graph, listener, ret);
627
628 end:
629 return ret;
630 }
631
632 BT_HIDDEN
633 void bt_graph_notify_port_added(struct bt_graph *graph, struct bt_port *port)
634 {
635 size_t i;
636
637 BT_LOGV("Notifying graph listeners that a port was added: "
638 "graph-addr=%p, port-addr=%p, port-name=\"%s\"",
639 graph, port, bt_port_get_name(port));
640
641 for (i = 0; i < graph->listeners.port_added->len; i++) {
642 struct bt_graph_listener listener =
643 g_array_index(graph->listeners.port_added,
644 struct bt_graph_listener, i);
645 bt_graph_port_added_listener func = listener.func;
646
647 assert(func);
648 func(port, listener.data);
649 }
650 }
651
652 BT_HIDDEN
653 void bt_graph_notify_port_removed(struct bt_graph *graph,
654 struct bt_component *comp, struct bt_port *port)
655 {
656 size_t i;
657
658 BT_LOGV("Notifying graph listeners that a port was removed: "
659 "graph-addr=%p, port-addr=%p, port-name=\"%s\"",
660 graph, port, bt_port_get_name(port));
661
662 for (i = 0; i < graph->listeners.port_removed->len; i++) {
663 struct bt_graph_listener listener =
664 g_array_index(graph->listeners.port_removed,
665 struct bt_graph_listener, i);
666 bt_graph_port_removed_listener func = listener.func;
667
668 assert(func);
669 func(comp, port, listener.data);
670 }
671 }
672
673 BT_HIDDEN
674 void bt_graph_notify_ports_connected(struct bt_graph *graph,
675 struct bt_port *upstream_port, struct bt_port *downstream_port)
676 {
677 size_t i;
678
679 BT_LOGV("Notifying graph listeners that two ports were connected: "
680 "graph-addr=%p, "
681 "upstream-port-addr=%p, upstream-port-name=\"%s\", "
682 "downstream-port-addr=%p, downstream-port-name=\"%s\"",
683 graph, upstream_port, bt_port_get_name(upstream_port),
684 downstream_port, bt_port_get_name(downstream_port));
685
686 for (i = 0; i < graph->listeners.ports_connected->len; i++) {
687 struct bt_graph_listener listener =
688 g_array_index(graph->listeners.ports_connected,
689 struct bt_graph_listener, i);
690 bt_graph_ports_connected_listener func = listener.func;
691
692 assert(func);
693 func(upstream_port, downstream_port, listener.data);
694 }
695 }
696
697 BT_HIDDEN
698 void bt_graph_notify_ports_disconnected(struct bt_graph *graph,
699 struct bt_component *upstream_comp,
700 struct bt_component *downstream_comp,
701 struct bt_port *upstream_port, struct bt_port *downstream_port)
702 {
703 size_t i;
704
705 BT_LOGV("Notifying graph listeners that two ports were disconnected: "
706 "graph-addr=%p, "
707 "upstream-port-addr=%p, upstream-port-name=\"%s\", "
708 "downstream-port-addr=%p, downstream-port-name=\"%s\"",
709 graph, upstream_port, bt_port_get_name(upstream_port),
710 downstream_port, bt_port_get_name(downstream_port));
711
712 for (i = 0; i < graph->listeners.ports_disconnected->len; i++) {
713 struct bt_graph_listener listener =
714 g_array_index(graph->listeners.ports_disconnected,
715 struct bt_graph_listener, i);
716 bt_graph_ports_disconnected_listener func = listener.func;
717
718 assert(func);
719 func(upstream_comp, downstream_comp, upstream_port,
720 downstream_port, listener.data);
721 }
722 }
723
724 extern enum bt_graph_status bt_graph_cancel(struct bt_graph *graph)
725 {
726 enum bt_graph_status ret = BT_GRAPH_STATUS_OK;
727
728 if (!graph) {
729 BT_LOGW_STR("Invalid parameter: graph is NULL.");
730 ret = BT_GRAPH_STATUS_INVALID;
731 goto end;
732 }
733
734 graph->canceled = BT_TRUE;
735 BT_LOGV("Canceled graph: addr=%p", graph);
736
737 end:
738 return ret;
739 }
740
741 extern bt_bool bt_graph_is_canceled(struct bt_graph *graph)
742 {
743 return graph ? graph->canceled : BT_FALSE;
744 }
745
746 BT_HIDDEN
747 void bt_graph_remove_connection(struct bt_graph *graph,
748 struct bt_connection *connection)
749 {
750 assert(graph);
751 assert(connection);
752 BT_LOGV("Removing graph's connection: graph-addr=%p, conn-addr=%p",
753 graph, connection);
754 g_ptr_array_remove(graph->connections, connection);
755 }
This page took 0.047468 seconds and 5 git commands to generate.