projects / babeltrace.git / blame
| Commit | Line | Data |
|---|---|---|
| 6ac74c0c PP |
1 | #ifndef BABELTRACE_GRAPH_CONNECTION_INTERNAL_H |
| 2 | #define BABELTRACE_GRAPH_CONNECTION_INTERNAL_H | |
| 784cdc68 JG |
3 | |
| 4 | /* | |
| e2f7325d | 5 | * Copyright 2017-2018 Philippe Proulx <pproulx@efficios.com> |
| 784cdc68 JG |
6 | * Copyright 2017 Jérémie Galarneau <jeremie.galarneau@efficios.com> |
| 7 | * | |
| 784cdc68 JG |
8 | * Permission is hereby granted, free of charge, to any person obtaining a copy |
| 9 | * of this software and associated documentation files (the "Software"), to deal | |
| 10 | * in the Software without restriction, including without limitation the rights | |
| 11 | * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell | |
| 12 | * copies of the Software, and to permit persons to whom the Software is | |
| 13 | * furnished to do so, subject to the following conditions: | |
| 14 | * | |
| 15 | * The above copyright notice and this permission notice shall be included in | |
| 16 | * all copies or substantial portions of the Software. | |
| 17 | * | |
| 18 | * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR | |
| 19 | * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, | |
| 20 | * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE | |
| 21 | * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER | |
| 22 | * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, | |
| 23 | * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE | |
| 24 | * SOFTWARE. | |
| 25 | */ | |
| 26 | ||
| 3fadfbc0 | 27 | #include <babeltrace2/graph/connection-const.h> |
| 578e048b MJ |
28 | #include "lib/object.h" |
| 29 | #include "common/assert.h" | |
| 91d81473 | 30 | #include "common/macros.h" |
| c42ea0af | 31 | #include <stdbool.h> |
| 784cdc68 | 32 | |
| 578e048b MJ |
33 | #include "message/iterator.h" |
| 34 | ||
| 784cdc68 JG |
35 | struct bt_graph; |
| 36 | ||
| 37 | struct bt_connection { | |
| 38 | /* | |
| 39 | * The graph is a connection's parent and the connection is the parent | |
| 40 | * of all iterators it has created. | |
| 41 | */ | |
| 42 | struct bt_object base; | |
| 43 | /* | |
| 44 | * Weak references are held to both ports. Their existence is guaranteed | |
| 45 | * by the existence of the graph and thus, of their respective | |
| 46 | * components. | |
| 47 | */ | |
| 48 | /* Downstream port. */ | |
| 72b913fb | 49 | struct bt_port *downstream_port; |
| 784cdc68 | 50 | /* Upstream port. */ |
| 72b913fb | 51 | struct bt_port *upstream_port; |
| bd14d768 PP |
52 | |
| 53 | /* | |
| d6e69534 | 54 | * Weak references to all the message iterators that were |
| bd14d768 PP |
55 | * created on this connection. |
| 56 | */ | |
| 57 | GPtrArray *iterators; | |
| bf55043c | 58 | |
| 85031ceb | 59 | bool notified_upstream_port_connected; |
| 85031ceb | 60 | bool notified_downstream_port_connected; |
| 85031ceb | 61 | bool notified_graph_ports_connected; |
| 784cdc68 JG |
62 | }; |
| 63 | ||
| 64 | BT_HIDDEN | |
| 65 | struct bt_connection *bt_connection_create(struct bt_graph *graph, | |
| 72b913fb PP |
66 | struct bt_port *upstream_port, |
| 67 | struct bt_port *downstream_port); | |
| 68 | ||
| 69 | BT_HIDDEN | |
| c42ea0af | 70 | void bt_connection_end(struct bt_connection *conn, bool try_remove_from_graph); |
| 784cdc68 | 71 | |
| bd14d768 PP |
72 | BT_HIDDEN |
| 73 | void bt_connection_remove_iterator(struct bt_connection *conn, | |
| d6e69534 | 74 | struct bt_self_component_port_input_message_iterator *iterator); |
| bd14d768 | 75 | |
| c28d097c PP |
76 | static inline |
| 77 | struct bt_graph *bt_connection_borrow_graph(struct bt_connection *conn) | |
| 78 | { | |
| f6ccaed9 | 79 | BT_ASSERT(conn); |
| c28d097c PP |
80 | return (void *) conn->base.parent; |
| 81 | } | |
| 82 | ||
| 6ac74c0c | 83 | #endif /* BABELTRACE_GRAPH_CONNECTION_INTERNAL_H */ |