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