isl_scheduler_scc.h File Reference

#include <isl/ctx.h>
#include "isl_scheduler.h"
#include "isl_scheduler_clustering.h"

Go to the source code of this file.

Functions
struct isl_scc_graph *	isl_scc_graph_from_sched_graph (isl_ctx *ctx, struct isl_sched_graph *graph, struct isl_clustering *c)
__isl_give isl_schedule_node *	isl_scc_graph_decompose (struct isl_scc_graph *scc_graph, __isl_take isl_schedule_node *node)
struct isl_scc_graph *	isl_scc_graph_free (struct isl_scc_graph *scc_graph)
void	isl_scc_graph_dump (struct isl_scc_graph *scc_graph)

Function Documentation

isl_scc_graph_decompose()

__isl_give isl_schedule_node * isl_scc_graph_decompose	(	struct isl_scc_graph *	scc_graph,
		__isl_take isl_schedule_node *	node
	)

Definition at line 1176 of file isl_scheduler_scc.c.

References best_split(), detect_components_at(), extract_split_scc(), isl_scc_graph_chain(), isl_scc_graph_finish_band(), isl_scc_graph_init_component(), isl_schedule_node_free(), isl_schedule_node_grandchild(), isl_schedule_node_grandparent(), isl_schedule_node_insert_sequence(), isl_schedule_node_sequence_splice_children(), isl_union_set_list, isl_scc_graph::n, isl_merge_src_dst_data::scc_graph, and split().

Referenced by finish_bands_decompose(), and recurse().

isl_scc_graph_dump()

void isl_scc_graph_dump

(

struct isl_scc_graph *

scc_graph

)

Definition at line 106 of file isl_scheduler_scc.c.

References isl_scc_graph::ctx, isl_scc_graph::edge_table, isl_scc_graph::graph_scc, isl_hash_table_foreach(), isl_scc_graph::n, print_edge(), and isl_scc_graph::reverse_edge_table.

isl_scc_graph_free()

struct isl_scc_graph * isl_scc_graph_free

(

struct isl_scc_graph *

scc_graph

)

Definition at line 135 of file isl_scheduler_scc.c.

References isl_scc_graph::component, isl_scc_graph::ctx, isl_scc_graph::edge_table, isl_scc_graph::graph_scc, isl_ctx_deref(), isl_hash_table_free(), isl_scc_graph::n, isl_scc_graph::pos, isl_scc_graph::reverse_edge_table, isl_scc_graph::size, and isl_scc_graph::sorted.

Referenced by finish_bands_decompose(), isl_scc_graph_add_reverse_edges(), isl_scc_graph_alloc(), isl_scc_graph_from_sched_graph(), isl_scc_graph_reduce(), isl_scc_graph_sub(), and recurse().

isl_scc_graph_from_sched_graph()

struct isl_scc_graph * isl_scc_graph_from_sched_graph	(	isl_ctx *	ctx,
		struct isl_sched_graph *	graph,
		struct isl_clustering *	c
	)

Definition at line 575 of file isl_scheduler_scc.c.

References add_scc_edge(), isl_scc_graph::c, isl_scc_graph::ctx, isl_sched_graph::edge_table, isl_scc_graph::graph, isl_scc_graph::graph_scc, if(), isl_edge_conditional_validity, isl_edge_validity, isl_hash_table_foreach(), isl_scc_graph_add_reverse_edges(), isl_scc_graph_alloc(), isl_scc_graph_free(), isl_scc_graph_reduce(), and isl_sched_graph::scc.

Referenced by finish_bands_decompose().