Commit | Line | Data |
---|---|---|
6ac74c0c PP |
1 | #ifndef BABELTRACE_GRAPH_GRAPH_INTERNAL_H |
2 | #define BABELTRACE_GRAPH_GRAPH_INTERNAL_H | |
c0418dd9 JG |
3 | |
4 | /* | |
e2f7325d | 5 | * Copyright 2017-2018 Philippe Proulx <pproulx@efficios.com> |
f60c8b34 | 6 | * Copyright 2017 Jérémie Galarneau <jeremie.galarneau@efficios.com> |
c0418dd9 | 7 | * |
c0418dd9 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/graph.h> |
3fadfbc0 | 28 | #include <babeltrace2/graph/message-const.h> |
91d81473 | 29 | #include "common/macros.h" |
578e048b MJ |
30 | #include "lib/object.h" |
31 | #include "lib/object-pool.h" | |
32 | #include "common/assert.h" | |
de625d1c | 33 | #include "common/common.h" |
a256a42d | 34 | #include <stdlib.h> |
c0418dd9 JG |
35 | #include <glib.h> |
36 | ||
578e048b MJ |
37 | #include "component.h" |
38 | #include "component-sink.h" | |
39 | #include "connection.h" | |
d24d5663 | 40 | #include "lib/func-status.h" |
578e048b | 41 | |
51375aa9 PP |
42 | /* Protection: this file uses BT_LIB_LOG*() macros directly */ |
43 | #ifndef BT_LIB_LOG_SUPPORTED | |
44 | # error Please include "lib/logging.h" before including this file. | |
45 | #endif | |
46 | ||
47 | /* Protection: this file uses BT_ASSERT_PRE*() macros directly */ | |
48 | #ifndef BT_ASSERT_PRE_SUPPORTED | |
49 | # error Please include "lib/assert-pre.h" before including this file. | |
50 | #endif | |
51 | ||
52 | /* Protection: this file uses BT_ASSERT_POST*() macros directly */ | |
53 | #ifndef BT_ASSERT_POST_SUPPORTED | |
54 | # error Please include "lib/assert-post.h" before including this file. | |
55 | #endif | |
56 | ||
1bf957a0 PP |
57 | struct bt_component; |
58 | struct bt_port; | |
59 | ||
5badd463 PP |
60 | enum bt_graph_configuration_state { |
61 | BT_GRAPH_CONFIGURATION_STATE_CONFIGURING, | |
62 | BT_GRAPH_CONFIGURATION_STATE_PARTIALLY_CONFIGURED, | |
63 | BT_GRAPH_CONFIGURATION_STATE_CONFIGURED, | |
38cda5da | 64 | BT_GRAPH_CONFIGURATION_STATE_FAULTY, |
5badd463 PP |
65 | }; |
66 | ||
f60c8b34 JG |
67 | struct bt_graph { |
68 | /** | |
69 | * A component graph contains components and point-to-point connection | |
70 | * between these components. | |
c0418dd9 | 71 | * |
f60c8b34 JG |
72 | * In terms of ownership: |
73 | * 1) The graph is the components' parent, | |
74 | * 2) The graph is the connnections' parent, | |
75 | * 3) Components share the ownership of their connections, | |
76 | * 4) A connection holds weak references to its two component endpoints. | |
c0418dd9 | 77 | */ |
f60c8b34 JG |
78 | struct bt_object base; |
79 | ||
80 | /* Array of pointers to bt_connection. */ | |
81 | GPtrArray *connections; | |
82 | /* Array of pointers to bt_component. */ | |
83 | GPtrArray *components; | |
84 | /* Queue of pointers (weak references) to sink bt_components. */ | |
85 | GQueue *sinks_to_consume; | |
1bf957a0 | 86 | |
d94d92ac PP |
87 | bool canceled; |
88 | bool in_remove_listener; | |
89 | bool has_sink; | |
8ed535b5 PP |
90 | |
91 | /* | |
d94d92ac | 92 | * If this is false, then the public API's consuming |
8ed535b5 | 93 | * functions (bt_graph_consume() and bt_graph_run()) return |
d24d5663 | 94 | * BT_FUNC_STATUS_CANNOT_CONSUME. The internal "no check" |
8ed535b5 PP |
95 | * functions always work. |
96 | * | |
d6e69534 | 97 | * In bt_port_output_message_iterator_create(), on success, |
8ed535b5 PP |
98 | * this flag is cleared so that the iterator remains the only |
99 | * consumer for the graph's lifetime. | |
100 | */ | |
d94d92ac | 101 | bool can_consume; |
202a3a13 | 102 | |
5badd463 | 103 | enum bt_graph_configuration_state config_state; |
4725a201 | 104 | |
1bf957a0 | 105 | struct { |
d94d92ac PP |
106 | GArray *source_output_port_added; |
107 | GArray *filter_output_port_added; | |
108 | GArray *filter_input_port_added; | |
109 | GArray *sink_input_port_added; | |
d94d92ac PP |
110 | GArray *source_filter_ports_connected; |
111 | GArray *source_sink_ports_connected; | |
9c0a126a | 112 | GArray *filter_filter_ports_connected; |
d94d92ac | 113 | GArray *filter_sink_ports_connected; |
1bf957a0 | 114 | } listeners; |
5c563278 | 115 | |
d6e69534 PP |
116 | /* Pool of `struct bt_message_event *` */ |
117 | struct bt_object_pool event_msg_pool; | |
5c563278 | 118 | |
d6e69534 PP |
119 | /* Pool of `struct bt_message_packet_beginning *` */ |
120 | struct bt_object_pool packet_begin_msg_pool; | |
5c563278 | 121 | |
d6e69534 PP |
122 | /* Pool of `struct bt_message_packet_end *` */ |
123 | struct bt_object_pool packet_end_msg_pool; | |
5c563278 PP |
124 | |
125 | /* | |
d6e69534 | 126 | * Array of `struct bt_message *` (weak). |
5c563278 | 127 | * |
d6e69534 | 128 | * This is an array of all the messages ever created from |
5c563278 | 129 | * this graph. Some of them can be in one of the pools above, |
d6e69534 | 130 | * some of them can be at large. Because each message has a |
5c563278 | 131 | * weak pointer to the graph containing its pool, we need to |
d6e69534 | 132 | * notify each message that the graph is gone on graph |
5c563278 PP |
133 | * destruction. |
134 | * | |
135 | * TODO: When we support a maximum size for object pools, | |
d6e69534 | 136 | * add a way for a message to remove itself from this |
5c563278 PP |
137 | * array (on destruction). |
138 | */ | |
d6e69534 | 139 | GPtrArray *messages; |
c0418dd9 JG |
140 | }; |
141 | ||
8ed535b5 | 142 | static inline |
d94d92ac | 143 | void _bt_graph_set_can_consume(struct bt_graph *graph, bool can_consume) |
8ed535b5 | 144 | { |
f6ccaed9 | 145 | BT_ASSERT(graph); |
8ed535b5 PP |
146 | graph->can_consume = can_consume; |
147 | } | |
148 | ||
ad847455 PP |
149 | #ifdef BT_DEV_MODE |
150 | # define bt_graph_set_can_consume _bt_graph_set_can_consume | |
151 | #else | |
152 | # define bt_graph_set_can_consume(_graph, _can_consume) | |
153 | #endif | |
8ed535b5 PP |
154 | |
155 | BT_HIDDEN | |
d24d5663 | 156 | int bt_graph_consume_sink_no_check(struct bt_graph *graph, |
d94d92ac | 157 | struct bt_component_sink *sink); |
8ed535b5 | 158 | |
1bf957a0 | 159 | BT_HIDDEN |
d24d5663 | 160 | enum bt_graph_listener_func_status bt_graph_notify_port_added(struct bt_graph *graph, |
8cc56726 | 161 | struct bt_port *port); |
1bf957a0 | 162 | |
1bf957a0 | 163 | BT_HIDDEN |
d24d5663 | 164 | enum bt_graph_listener_func_status bt_graph_notify_ports_connected( |
8cc56726 SM |
165 | struct bt_graph *graph, struct bt_port *upstream_port, |
166 | struct bt_port *downstream_port); | |
1bf957a0 | 167 | |
f167d3c0 PP |
168 | BT_HIDDEN |
169 | void bt_graph_remove_connection(struct bt_graph *graph, | |
170 | struct bt_connection *connection); | |
171 | ||
8ed535b5 PP |
172 | /* |
173 | * This only works with a component which is not connected at this | |
174 | * point. | |
175 | * | |
176 | * Also the reference count of `component` should be 0 when you call | |
177 | * this function, which means only `graph` owns the component, so it | |
178 | * is safe to destroy. | |
179 | */ | |
180 | BT_HIDDEN | |
181 | int bt_graph_remove_unconnected_component(struct bt_graph *graph, | |
182 | struct bt_component *component); | |
183 | ||
5c563278 | 184 | BT_HIDDEN |
d6e69534 PP |
185 | void bt_graph_add_message(struct bt_graph *graph, |
186 | struct bt_message *msg); | |
5c563278 | 187 | |
5badd463 PP |
188 | static inline |
189 | const char *bt_graph_configuration_state_string( | |
190 | enum bt_graph_configuration_state state) | |
191 | { | |
192 | switch (state) { | |
193 | case BT_GRAPH_CONFIGURATION_STATE_CONFIGURING: | |
194 | return "BT_GRAPH_CONFIGURATION_STATE_CONFIGURING"; | |
195 | case BT_GRAPH_CONFIGURATION_STATE_PARTIALLY_CONFIGURED: | |
196 | return "BT_GRAPH_CONFIGURATION_STATE_PARTIALLY_CONFIGURED"; | |
197 | case BT_GRAPH_CONFIGURATION_STATE_CONFIGURED: | |
198 | return "BT_GRAPH_CONFIGURATION_STATE_CONFIGURED"; | |
199 | default: | |
200 | return "(unknown)"; | |
201 | } | |
202 | } | |
203 | ||
204 | static inline | |
d24d5663 | 205 | int bt_graph_configure(struct bt_graph *graph) |
5badd463 | 206 | { |
d24d5663 | 207 | int status = BT_FUNC_STATUS_OK; |
5badd463 PP |
208 | uint64_t i; |
209 | ||
38cda5da PP |
210 | BT_ASSERT(graph->config_state != BT_GRAPH_CONFIGURATION_STATE_FAULTY); |
211 | ||
91d81473 | 212 | if (G_LIKELY(graph->config_state == |
5badd463 PP |
213 | BT_GRAPH_CONFIGURATION_STATE_CONFIGURED)) { |
214 | goto end; | |
215 | } | |
216 | ||
cd6128ca | 217 | BT_ASSERT_PRE(graph->has_sink, "Graph has no sink component: %!+g", graph); |
5badd463 PP |
218 | graph->config_state = BT_GRAPH_CONFIGURATION_STATE_PARTIALLY_CONFIGURED; |
219 | ||
220 | for (i = 0; i < graph->components->len; i++) { | |
221 | struct bt_component *comp = graph->components->pdata[i]; | |
222 | struct bt_component_sink *comp_sink = (void *) comp; | |
223 | struct bt_component_class_sink *comp_cls_sink = | |
224 | (void *) comp->class; | |
225 | ||
226 | if (comp->class->type != BT_COMPONENT_CLASS_TYPE_SINK) { | |
227 | continue; | |
228 | } | |
229 | ||
230 | if (comp_sink->graph_is_configured_method_called) { | |
231 | continue; | |
232 | } | |
233 | ||
234 | if (comp_cls_sink->methods.graph_is_configured) { | |
d24d5663 | 235 | enum bt_component_class_sink_graph_is_configured_method_status comp_status; |
5badd463 | 236 | |
5badd463 PP |
237 | BT_LIB_LOGD("Calling user's \"graph is configured\" method: " |
238 | "%![graph-]+g, %![comp-]+c", | |
239 | graph, comp); | |
5badd463 PP |
240 | comp_status = comp_cls_sink->methods.graph_is_configured( |
241 | (void *) comp_sink); | |
5badd463 | 242 | BT_LIB_LOGD("User method returned: status=%s", |
d24d5663 PP |
243 | bt_common_func_status_string(comp_status)); |
244 | BT_ASSERT_POST(comp_status == BT_FUNC_STATUS_OK || | |
245 | comp_status == BT_FUNC_STATUS_ERROR || | |
246 | comp_status == BT_FUNC_STATUS_MEMORY_ERROR, | |
5badd463 | 247 | "Unexpected returned status: status=%s", |
d24d5663 | 248 | bt_common_func_status_string(comp_status)); |
5badd463 | 249 | |
d24d5663 PP |
250 | if (comp_status != BT_FUNC_STATUS_OK) { |
251 | status = BT_FUNC_STATUS_ERROR; | |
5badd463 PP |
252 | BT_LIB_LOGW("User's \"graph is configured\" method failed: " |
253 | "%![comp-]+c, status=%s", | |
d24d5663 | 254 | comp, bt_common_func_status_string( |
5badd463 | 255 | comp_status)); |
5badd463 PP |
256 | goto end; |
257 | } | |
258 | } | |
259 | ||
260 | comp_sink->graph_is_configured_method_called = true; | |
261 | } | |
262 | ||
263 | graph->config_state = BT_GRAPH_CONFIGURATION_STATE_CONFIGURED; | |
264 | ||
265 | end: | |
266 | return status; | |
267 | } | |
268 | ||
8cc56726 SM |
269 | static inline |
270 | void bt_graph_make_faulty(struct bt_graph *graph) | |
271 | { | |
272 | graph->config_state = BT_GRAPH_CONFIGURATION_STATE_FAULTY; | |
3f7d4d90 | 273 | BT_LIB_LOGI("Set graph's state to faulty: %![graph-]+g", graph); |
8cc56726 SM |
274 | } |
275 | ||
6ac74c0c | 276 | #endif /* BABELTRACE_GRAPH_GRAPH_INTERNAL_H */ |