lib: move `bt_value` structures to `value-internal.h`
[babeltrace.git] / include / babeltrace / graph / connection-internal.h
1 #ifndef BABELTRACE_GRAPH_CONNECTION_INTERNAL_H
2 #define BABELTRACE_GRAPH_CONNECTION_INTERNAL_H
3
4 /*
5 * Copyright 2017-2018 Philippe Proulx <pproulx@efficios.com>
6 * Copyright 2017 Jérémie Galarneau <jeremie.galarneau@efficios.com>
7 *
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
27 #include <babeltrace/graph/connection-const.h>
28 #include <babeltrace/graph/message-iterator-const.h>
29 #include <babeltrace/graph/message-iterator-internal.h>
30 #include <babeltrace/object-internal.h>
31 #include <babeltrace/assert-internal.h>
32 #include <stdbool.h>
33
34 struct bt_graph;
35
36 struct bt_connection {
37 /*
38 * The graph is a connection's parent and the connection is the parent
39 * of all iterators it has created.
40 */
41 struct bt_object base;
42 /*
43 * Weak references are held to both ports. Their existence is guaranteed
44 * by the existence of the graph and thus, of their respective
45 * components.
46 */
47 /* Downstream port. */
48 struct bt_port *downstream_port;
49 /* Upstream port. */
50 struct bt_port *upstream_port;
51
52 /*
53 * Weak references to all the message iterators that were
54 * created on this connection.
55 */
56 GPtrArray *iterators;
57
58 bool notified_upstream_port_connected;
59 bool notified_downstream_port_connected;
60 bool notified_graph_ports_connected;
61 };
62
63 BT_HIDDEN
64 struct bt_connection *bt_connection_create(struct bt_graph *graph,
65 struct bt_port *upstream_port,
66 struct bt_port *downstream_port);
67
68 BT_HIDDEN
69 void bt_connection_end(struct bt_connection *conn, bool try_remove_from_graph);
70
71 BT_HIDDEN
72 void bt_connection_remove_iterator(struct bt_connection *conn,
73 struct bt_self_component_port_input_message_iterator *iterator);
74
75 static inline
76 struct bt_graph *bt_connection_borrow_graph(struct bt_connection *conn)
77 {
78 BT_ASSERT(conn);
79 return (void *) conn->base.parent;
80 }
81
82 #endif /* BABELTRACE_GRAPH_CONNECTION_INTERNAL_H */
This page took 0.03843 seconds and 4 git commands to generate.