Polly 19.0.0git
Public Attributes | List of all members
isl_sched_graph Struct Reference

#include <isl_scheduler.h>

Public Attributes

isl_map_to_basic_set * intra_hmap
 
isl_map_to_basic_set * intra_hmap_param
 
isl_map_to_basic_set * inter_hmap
 
struct isl_sched_nodenode
 
int n
 
int maxvar
 
int max_row
 
int n_row
 
int * sorted
 
int n_total_row
 
int band_start
 
struct isl_sched_graphroot
 
struct isl_sched_edgeedge
 
int n_edge
 
int max_edge [isl_edge_last+1]
 
struct isl_hash_tableedge_table [isl_edge_last+1]
 
struct isl_hash_tablenode_table
 
struct isl_trivial_regionregion
 
isl_basic_setlp
 
int src_scc
 
int dst_scc
 
int scc
 
int weak
 
int max_weight
 

Detailed Description

Definition at line 221 of file isl_scheduler.h.

Member Data Documentation

◆ band_start

int isl_sched_graph::band_start

◆ dst_scc

int isl_sched_graph::dst_scc

◆ edge

struct isl_sched_edge* isl_sched_graph::edge

◆ edge_table

struct isl_hash_table* isl_sched_graph::edge_table[isl_edge_last+1]

◆ inter_hmap

isl_map_to_basic_set* isl_sched_graph::inter_hmap

Definition at line 224 of file isl_scheduler.h.

Referenced by graph_alloc(), inter_coefficients(), and isl_sched_graph_free().

◆ intra_hmap

isl_map_to_basic_set* isl_sched_graph::intra_hmap

Definition at line 222 of file isl_scheduler.h.

Referenced by graph_alloc(), intra_coefficients(), and isl_sched_graph_free().

◆ intra_hmap_param

isl_map_to_basic_set* isl_sched_graph::intra_hmap_param

Definition at line 223 of file isl_scheduler.h.

Referenced by graph_alloc(), intra_coefficients(), and isl_sched_graph_free().

◆ lp

isl_basic_set* isl_sched_graph::lp

◆ max_edge

int isl_sched_graph::max_edge[isl_edge_last+1]

◆ max_row

int isl_sched_graph::max_row

◆ max_weight

int isl_sched_graph::max_weight

Definition at line 255 of file isl_scheduler.h.

Referenced by any_no_merge(), compute_weights(), and has_bounded_distances().

◆ maxvar

int isl_sched_graph::maxvar

◆ n

int isl_sched_graph::n

◆ n_edge

int isl_sched_graph::n_edge

◆ n_row

int isl_sched_graph::n_row

◆ n_total_row

int isl_sched_graph::n_total_row

◆ node

struct isl_sched_node* isl_sched_graph::node

◆ node_table

struct isl_hash_table* isl_sched_graph::node_table

◆ region

struct isl_trivial_region* isl_sched_graph::region

Definition at line 245 of file isl_scheduler.h.

Referenced by graph_alloc(), isl_sched_graph_free(), and solve_lp().

◆ root

struct isl_sched_graph* isl_sched_graph::root

◆ scc

int isl_sched_graph::scc

◆ sorted

int* isl_sched_graph::sorted

◆ src_scc

int isl_sched_graph::src_scc

◆ weak

int isl_sched_graph::weak

Definition at line 253 of file isl_scheduler.h.

Referenced by compute_component_schedule(), detect_sccs(), and detect_wccs().


The documentation for this struct was generated from the following file: