chains.h File Reference

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Enumerations
enum	chain_type {   USE_PROPER_EFFECTS = 1 , USE_REGIONS , USE_IN_OUT_REGIONS , USE_PROPER_EFFECTS = 1 ,   USE_REGIONS , USE_IN_OUT_REGIONS }
	Warning! Do not modify this file that is automatically generated! More...

Functions
graph	statement_dependence_graph (statement)
	cproto-generated files More...
bool	atomic_chains (const string)
	Phase to compute atomic chains based on proper effects (simple memory accesses) More...
bool	region_chains (const string)
	Phase to compute atomic chains based on array regions. More...
bool	in_out_regions_chains (const string)
	Phase to compute atomic chains based on in-out array regions. More...

Enumeration Type Documentation

chain_type

enum chain_type

Warning! Do not modify this file that is automatically generated!

Modify src/Libs/chains/chains-local.h instead, to add your own modifications. header file built by cproto chains-local.h To choose the concepts used to compute dependence chains

Enumerator
USE_PROPER_EFFECTS
USE_REGIONS
USE_IN_OUT_REGIONS
USE_PROPER_EFFECTS
USE_REGIONS
USE_IN_OUT_REGIONS

Definition at line 35 of file chains.h.

                {
  USE_PROPER_EFFECTS = 1,
  USE_REGIONS,
  USE_IN_OUT_REGIONS
};

Function Documentation

atomic_chains()

bool atomic_chains

(

const

string

)

Phase to compute atomic chains based on proper effects (simple memory accesses)

Parameters

string

odule_name

Definition at line 1442 of file chains.c.

                                             {
  return chains( module_name, USE_PROPER_EFFECTS );
}

References chains(), module_name(), and USE_PROPER_EFFECTS.

Here is the call graph for this function:

in_out_regions_chains()

bool in_out_regions_chains

(

const

string

)

Phase to compute atomic chains based on in-out array regions.

Parameters

string

odule_name

Definition at line 1456 of file chains.c.

                                                     {
  return chains( module_name, USE_IN_OUT_REGIONS );
}

References chains(), module_name(), and USE_IN_OUT_REGIONS.

Here is the call graph for this function:

region_chains()

bool region_chains

(

const

string

)

Phase to compute atomic chains based on array regions.

Parameters

string

odule_name

Definition at line 1449 of file chains.c.

                                             {
  return chains( module_name, USE_REGIONS );
}

References chains(), module_name(), and USE_REGIONS.

Here is the call graph for this function:

statement_dependence_graph()

graph statement_dependence_graph

(

statement

s

)

cproto-generated files

chains.c

cproto-generated files

@description Statement s is assumed "controlized", i.e. GOTO have been replaced by unstructured.

FIXME FI: this function is bugged. As Pierre said, you have to start with an unstructured for the use-def chain computation to be correct.

Initialize some properties

Initialize global hashtables

Initialize the dg

Initialize data structures for all the statements

It recursively initializes the sets of gens, ins and outs for the statements that appear in st. Note that not only call statements are there, but also enclosing statements (e.g, blocks and loops).

Compute genref phase

Compute inout phase and create conflicts

Definition at line 1218 of file chains.c.

                                                {
  /* Initialize some properties */
  one_trip_do_p = get_bool_property( "ONE_TRIP_DO" );
  keep_read_read_dependences_p = get_bool_property( "KEEP_READ_READ_DEPENDENCE" );
  mask_effects_p = get_bool_property("CHAINS_MASK_EFFECTS");
  dataflow_dependence_only_p = get_bool_property("CHAINS_DATAFLOW_DEPENDENCE_ONLY");
 
  /* Initialize global hashtables */
  effects2statement = hash_table_make( hash_pointer, 0 );
  Gen = hash_table_make( hash_pointer, INIT_STATEMENT_SIZE );
  Ref = hash_table_make( hash_pointer, INIT_STATEMENT_SIZE );
  Def_in = hash_table_make( hash_pointer, INIT_STATEMENT_SIZE );
  Def_out = hash_table_make( hash_pointer, INIT_STATEMENT_SIZE );
  Ref_in = hash_table_make( hash_pointer, INIT_STATEMENT_SIZE );
  Ref_out = hash_table_make( hash_pointer, INIT_STATEMENT_SIZE );
  Vertex_statement = hash_table_make( hash_pointer, INIT_STATEMENT_SIZE );
  current_defs = set_make(set_pointer);
  current_refs = set_make(set_pointer);
 
  /* Initialize the dg */
  dg = make_graph( NIL );
 
  /* Initialize data structures for all the statements
 
   It recursively initializes the sets of gens, ins and outs for
   the statements that appear in st. Note that not only call statements are
   there, but also enclosing statements (e.g, blocks and loops). */
  gen_recurse(s, statement_domain, init_one_statement, gen_null);
 
  /* Compute genref phase */
  genref_statement( s );
 
  /* Compute inout phase and create conflicts*/
  inout_statement( s );
 
#define TABLE_FREE(t)                                                   \
  {HASH_MAP( k, v, {set_free( (set)v ) ;}, t ) ; hash_table_free(t);}
 
  TABLE_FREE(Gen);
  TABLE_FREE(Ref);
  TABLE_FREE(Def_in);
  TABLE_FREE(Def_out);
  TABLE_FREE(Ref_in);
  TABLE_FREE(Ref_out);
 
  hash_table_free( Vertex_statement );
  hash_table_free( effects2statement );
 
  set_free(current_defs);
  set_free(current_refs);
 
  return ( dg );
}

References current_defs, current_refs, dataflow_dependence_only_p, Def_in, Def_out, dg, effects2statement, Gen, gen_null(), gen_recurse, genref_statement(), get_bool_property(), hash_pointer, hash_table_free(), hash_table_make(), init_one_statement(), INIT_STATEMENT_SIZE, inout_statement(), keep_read_read_dependences_p, make_graph(), mask_effects_p, NIL, one_trip_do_p, Ref, Ref_in, Ref_out, set_free(), set_make(), set_pointer, statement_domain, TABLE_FREE, and Vertex_statement.

Referenced by chains().

Here is the call graph for this function:

Here is the caller graph for this function: