[babeltrace.git] / src / lib / graph / graph.h

#ifndef BABELTRACE_GRAPH_GRAPH_INTERNAL_H
#define BABELTRACE_GRAPH_GRAPH_INTERNAL_H

/*
 * Copyright 2017-2018 Philippe Proulx <pproulx@efficios.com>
 * Copyright 2017 Jérémie Galarneau <jeremie.galarneau@efficios.com>
 *
 * Permission is hereby granted, free of charge, to any person obtaining a copy
 * of this software and associated documentation files (the "Software"), to deal
 * in the Software without restriction, including without limitation the rights
 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
 * copies of the Software, and to permit persons to whom the Software is
 * furnished to do so, subject to the following conditions:
 *
 * The above copyright notice and this permission notice shall be included in
 * all copies or substantial portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
 * SOFTWARE.
 */

/* Protection: this file uses BT_LIB_LOG*() macros directly */
#ifndef BT_LIB_LOG_SUPPORTED
# error Please include "lib/logging.h" before including this file.
#endif

#include <babeltrace2/graph/graph.h>
#include <babeltrace2/graph/message-const.h>
#include "common/macros.h"
#include "lib/object.h"
#include "lib/object-pool.h"
#include "common/assert.h"
#include "common/common.h"
#include <stdlib.h>
#include <glib.h>

#include "component.h"
#include "component-sink.h"
#include "connection.h"
#include "lib/func-status.h"

/* Protection: this file uses BT_LIB_LOG*() macros directly */
#ifndef BT_LIB_LOG_SUPPORTED
# error Please include "lib/logging.h" before including this file.
#endif

/* Protection: this file uses BT_ASSERT_PRE*() macros directly */
#ifndef BT_ASSERT_PRE_SUPPORTED
# error Please include "lib/assert-pre.h" before including this file.
#endif

/* Protection: this file uses BT_ASSERT_POST*() macros directly */
#ifndef BT_ASSERT_POST_SUPPORTED
# error Please include "lib/assert-post.h" before including this file.
#endif

struct bt_component;
struct bt_port;

enum bt_graph_configuration_state {
	BT_GRAPH_CONFIGURATION_STATE_CONFIGURING,
	BT_GRAPH_CONFIGURATION_STATE_PARTIALLY_CONFIGURED,
	BT_GRAPH_CONFIGURATION_STATE_CONFIGURED,
	BT_GRAPH_CONFIGURATION_STATE_FAULTY,
	BT_GRAPH_CONFIGURATION_STATE_DESTROYING,
};

struct bt_graph {
	/**
	 * A component graph contains components and point-to-point connection
	 * between these components.
	 *
	 * In terms of ownership:
	 * 1) The graph is the components' parent,
	 * 2) The graph is the connnections' parent,
	 * 3) Components share the ownership of their connections,
	 * 4) A connection holds weak references to its two component endpoints.
	 */
	struct bt_object base;

	/* Array of pointers to bt_connection. */
	GPtrArray *connections;
	/* Array of pointers to bt_component. */
	GPtrArray *components;
	/* Queue of pointers (weak references) to sink bt_components. */
	GQueue *sinks_to_consume;

	/*
	 * Array of `struct bt_interrupter *`, each one owned by this.
	 * If any interrupter is set, then this graph is deemed
	 * interrupted.
	 */
	GPtrArray *interrupters;

	/*
	 * Default interrupter to support bt_graph_interrupt(); owned
	 * by this.
	 */
	struct bt_interrupter *default_interrupter;

	bool in_remove_listener;
	bool has_sink;

	/*
	 * If this is false, then the public API's consuming
	 * functions (bt_graph_consume() and bt_graph_run()) return
	 * BT_FUNC_STATUS_CANNOT_CONSUME. The internal "no check"
	 * functions always work.
	 *
	 * In bt_port_output_message_iterator_create(), on success,
	 * this flag is cleared so that the iterator remains the only
	 * consumer for the graph's lifetime.
	 */
	bool can_consume;

	enum bt_graph_configuration_state config_state;

	struct {
		GArray *source_output_port_added;
		GArray *filter_output_port_added;
		GArray *filter_input_port_added;
		GArray *sink_input_port_added;
		GArray *source_filter_ports_connected;
		GArray *source_sink_ports_connected;
		GArray *filter_filter_ports_connected;
		GArray *filter_sink_ports_connected;
	} listeners;

	/* Pool of `struct bt_message_event *` */
	struct bt_object_pool event_msg_pool;

	/* Pool of `struct bt_message_packet_beginning *` */
	struct bt_object_pool packet_begin_msg_pool;

	/* Pool of `struct bt_message_packet_end *` */
	struct bt_object_pool packet_end_msg_pool;

	/*
	 * Array of `struct bt_message *` (weak).
	 *
	 * This is an array of all the messages ever created from
	 * this graph. Some of them can be in one of the pools above,
	 * some of them can be at large. Because each message has a
	 * weak pointer to the graph containing its pool, we need to
	 * notify each message that the graph is gone on graph
	 * destruction.
	 *
	 * TODO: When we support a maximum size for object pools,
	 * add a way for a message to remove itself from this
	 * array (on destruction).
	 */
	GPtrArray *messages;
};

static inline
void bt_graph_set_can_consume(struct bt_graph *graph, bool can_consume)
{
	BT_ASSERT(graph);
	graph->can_consume = can_consume;
}

BT_HIDDEN
int bt_graph_consume_sink_no_check(struct bt_graph *graph,
		struct bt_component_sink *sink);

BT_HIDDEN
enum bt_graph_listener_func_status bt_graph_notify_port_added(struct bt_graph *graph,
		struct bt_port *port);

BT_HIDDEN
enum bt_graph_listener_func_status bt_graph_notify_ports_connected(
		struct bt_graph *graph, struct bt_port *upstream_port,
		struct bt_port *downstream_port);

BT_HIDDEN
void bt_graph_remove_connection(struct bt_graph *graph,
		struct bt_connection *connection);

/*
 * This only works with a component which is not connected at this
 * point.
 *
 * Also the reference count of `component` should be 0 when you call
 * this function, which means only `graph` owns the component, so it
 * is safe to destroy.
 */
BT_HIDDEN
int bt_graph_remove_unconnected_component(struct bt_graph *graph,
		struct bt_component *component);

BT_HIDDEN
void bt_graph_add_message(struct bt_graph *graph,
		struct bt_message *msg);

BT_HIDDEN
bool bt_graph_is_interrupted(const struct bt_graph *graph);

static inline
const char *bt_graph_configuration_state_string(
		enum bt_graph_configuration_state state)
{
	switch (state) {
	case BT_GRAPH_CONFIGURATION_STATE_CONFIGURING:
		return "CONFIGURING";
	case BT_GRAPH_CONFIGURATION_STATE_PARTIALLY_CONFIGURED:
		return "PARTIALLY_CONFIGURED";
	case BT_GRAPH_CONFIGURATION_STATE_CONFIGURED:
		return "CONFIGURED";
	case BT_GRAPH_CONFIGURATION_STATE_FAULTY:
		return "FAULTY";
	case BT_GRAPH_CONFIGURATION_STATE_DESTROYING:
		return "DESTROYING";
	default:
		return "(unknown)";
	}
}

static inline
int bt_graph_configure(struct bt_graph *graph)
{
	int status = BT_FUNC_STATUS_OK;
	uint64_t i;

	BT_ASSERT(graph->config_state != BT_GRAPH_CONFIGURATION_STATE_FAULTY);

	if (G_LIKELY(graph->config_state ==
			BT_GRAPH_CONFIGURATION_STATE_CONFIGURED)) {
		goto end;
	}

	BT_ASSERT_PRE(graph->has_sink, "Graph has no sink component: %!+g", graph);
	graph->config_state = BT_GRAPH_CONFIGURATION_STATE_PARTIALLY_CONFIGURED;

	for (i = 0; i < graph->components->len; i++) {
		struct bt_component *comp = graph->components->pdata[i];
		struct bt_component_sink *comp_sink = (void *) comp;
		struct bt_component_class_sink *comp_cls_sink =
			(void *) comp->class;

		if (comp->class->type != BT_COMPONENT_CLASS_TYPE_SINK) {
			continue;
		}

		if (comp_sink->graph_is_configured_method_called) {
			continue;
		}

		if (comp_cls_sink->methods.graph_is_configured) {
			enum bt_component_class_sink_graph_is_configured_method_status comp_status;

			BT_LIB_LOGD("Calling user's \"graph is configured\" method: "
				"%![graph-]+g, %![comp-]+c",
				graph, comp);
			comp_status = comp_cls_sink->methods.graph_is_configured(
				(void *) comp_sink);
			BT_LIB_LOGD("User method returned: status=%s",
				bt_common_func_status_string(comp_status));
			BT_ASSERT_POST(comp_status == BT_FUNC_STATUS_OK ||
				comp_status == BT_FUNC_STATUS_ERROR ||
				comp_status == BT_FUNC_STATUS_MEMORY_ERROR,
				"Unexpected returned status: status=%s",
				bt_common_func_status_string(comp_status));
			if (comp_status != BT_FUNC_STATUS_OK) {
				if (comp_status < 0) {
					BT_LIB_LOGW_APPEND_CAUSE(
						"Component's \"graph is configured\" method failed: "
						"%![comp-]+c, status=%s",
						comp,
						bt_common_func_status_string(
							comp_status));
				}

				status = comp_status;
				goto end;
			}
		}

		comp_sink->graph_is_configured_method_called = true;
	}

	graph->config_state = BT_GRAPH_CONFIGURATION_STATE_CONFIGURED;

end:
	return status;
}

static inline
void bt_graph_make_faulty(struct bt_graph *graph)
{
	graph->config_state = BT_GRAPH_CONFIGURATION_STATE_FAULTY;
	BT_LIB_LOGI("Set graph's state to faulty: %![graph-]+g", graph);
}

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