1 #ifndef BABELTRACE_COMPONENT_COMPONENT_GRAPH_INTERNAL_H
2 #define BABELTRACE_COMPONENT_COMPONENT_GRAPH_INTERNAL_H
5 * BabelTrace - Component Graph Internal
7 * Copyright 2017 Jérémie Galarneau <jeremie.galarneau@efficios.com>
9 * Author: Jérémie Galarneau <jeremie.galarneau@efficios.com>
11 * Permission is hereby granted, free of charge, to any person obtaining a copy
12 * of this software and associated documentation files (the "Software"), to deal
13 * in the Software without restriction, including without limitation the rights
14 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
15 * copies of the Software, and to permit persons to whom the Software is
16 * furnished to do so, subject to the following conditions:
18 * The above copyright notice and this permission notice shall be included in
19 * all copies or substantial portions of the Software.
21 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
22 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
23 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
24 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
25 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
26 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
30 #include <babeltrace/graph/graph.h>
31 #include <babeltrace/babeltrace-internal.h>
32 #include <babeltrace/object-internal.h>
40 * A component graph contains components and point-to-point connection
41 * between these components.
43 * In terms of ownership:
44 * 1) The graph is the components' parent,
45 * 2) The graph is the connnections' parent,
46 * 3) Components share the ownership of their connections,
47 * 4) A connection holds weak references to its two component endpoints.
49 struct bt_object base
;
51 /* Array of pointers to bt_connection. */
52 GPtrArray
*connections
;
53 /* Array of pointers to bt_component. */
54 GPtrArray
*components
;
55 /* Queue of pointers (weak references) to sink bt_components. */
56 GQueue
*sinks_to_consume
;
63 GArray
*ports_connected
;
64 GArray
*ports_disconnected
;
69 void bt_graph_notify_port_added(struct bt_graph
*graph
, struct bt_port
*port
);
72 void bt_graph_notify_port_removed(struct bt_graph
*graph
,
73 struct bt_component
*comp
, struct bt_port
*port
);
76 void bt_graph_notify_ports_connected(struct bt_graph
*graph
,
77 struct bt_port
*upstream_port
, struct bt_port
*downstream_port
);
80 void bt_graph_notify_ports_disconnected(struct bt_graph
*graph
,
81 struct bt_component
*upstream_comp
,
82 struct bt_component
*downstream_comp
,
83 struct bt_port
*upstream_port
,
84 struct bt_port
*downstream_port
);
87 void bt_graph_remove_connection(struct bt_graph
*graph
,
88 struct bt_connection
*connection
);
91 const char *bt_graph_status_string(enum bt_graph_status status
)
94 case BT_GRAPH_STATUS_CANCELED
:
95 return "BT_GRAPH_STATUS_CANCELED";
96 case BT_GRAPH_STATUS_AGAIN
:
97 return "BT_GRAPH_STATUS_AGAIN";
98 case BT_GRAPH_STATUS_END
:
99 return "BT_GRAPH_STATUS_END";
100 case BT_GRAPH_STATUS_OK
:
101 return "BT_GRAPH_STATUS_OK";
102 case BT_GRAPH_STATUS_ALREADY_IN_A_GRAPH
:
103 return "BT_GRAPH_STATUS_ALREADY_IN_A_GRAPH";
104 case BT_GRAPH_STATUS_INVALID
:
105 return "BT_GRAPH_STATUS_INVALID";
106 case BT_GRAPH_STATUS_NO_SINK
:
107 return "BT_GRAPH_STATUS_NO_SINK";
108 case BT_GRAPH_STATUS_ERROR
:
109 return "BT_GRAPH_STATUS_ERROR";
115 #endif /* BABELTRACE_COMPONENT_COMPONENT_GRAPH_INTERNAL_H */