/* Detection of Static Control Parts (SCoP) for Graphite.
- Copyright (C) 2009 Free Software Foundation, Inc.
+ Copyright (C) 2009, 2010 Free Software Foundation, Inc.
Contributed by Sebastian Pop <sebastian.pop@amd.com> and
Tobias Grosser <grosser@fim.uni-passau.de>.
case MULT_EXPR:
if (chrec_contains_symbols (TREE_OPERAND (e, 0)))
- return host_integerp (TREE_OPERAND (e, 1), 0);
+ return graphite_can_represent_init (TREE_OPERAND (e, 0))
+ && host_integerp (TREE_OPERAND (e, 1), 0);
else
- return host_integerp (TREE_OPERAND (e, 0), 0);
+ return graphite_can_represent_init (TREE_OPERAND (e, 1))
+ && host_integerp (TREE_OPERAND (e, 0), 0);
case PLUS_EXPR:
case POINTER_PLUS_EXPR:
if (chrec_contains_undetermined (scev))
return false;
- if (TREE_CODE (scev) == POLYNOMIAL_CHREC
+ switch (TREE_CODE (scev))
+ {
+ case PLUS_EXPR:
+ case MINUS_EXPR:
+ return graphite_can_represent_scev (TREE_OPERAND (scev, 0), outermost_loop)
+ && graphite_can_represent_scev (TREE_OPERAND (scev, 1), outermost_loop);
+ case MULT_EXPR:
+ return !CONVERT_EXPR_CODE_P (TREE_CODE (TREE_OPERAND (scev, 0)))
+ && !CONVERT_EXPR_CODE_P (TREE_CODE (TREE_OPERAND (scev, 1)))
+ && !(chrec_contains_symbols (TREE_OPERAND (scev, 0))
+ && chrec_contains_symbols (TREE_OPERAND (scev, 1)))
+ && graphite_can_represent_init (scev)
+ && graphite_can_represent_scev (TREE_OPERAND (scev, 0), outermost_loop)
+ && graphite_can_represent_scev (TREE_OPERAND (scev, 1), outermost_loop);
+
+ case POLYNOMIAL_CHREC:
/* Check for constant strides. With a non constant stride of
- 'n' we would have a value of 'iv * n'. */
- && (!evolution_function_right_is_integer_cst (scev)
+ 'n' we would have a value of 'iv * n'. Also check that the
+ initial value can represented: for example 'n * m' cannot be
+ represented. */
+ if (!evolution_function_right_is_integer_cst (scev)
+ || !graphite_can_represent_init (scev))
+ return false;
- /* Check the initial value: 'n * m' cannot be represented. */
- || !graphite_can_represent_init (scev)))
- return false;
+ default:
+ break;
+ }
/* Only affine functions can be represented. */
if (!scev_is_linear_expression (scev))
return graphite_can_represent_scev (scev, outermost_loop->num);
}
-/* Return false if the tree_code of the operand OP or any of its operands
- is component_ref. */
-
-static bool
-exclude_component_ref (tree op)
-{
- int i;
- int len;
-
- if (!op)
- return true;
-
- if (TREE_CODE (op) == COMPONENT_REF)
- return false;
-
- len = TREE_OPERAND_LENGTH (op);
- for (i = 0; i < len; ++i)
- if (!exclude_component_ref (TREE_OPERAND (op, i)))
- return false;
-
- return true;
-}
-
/* Return true if the data references of STMT can be represented by
Graphite. */
return res;
}
-/* Return true if we can create an affine data-ref for OP in STMT
- in regards to OUTERMOST_LOOP. */
-
-static bool
-stmt_simple_memref_p (loop_p outermost_loop, gimple stmt, tree op)
-{
- data_reference_p dr;
- unsigned int i;
- VEC(tree,heap) *fns;
- tree t;
- bool res = true;
-
- dr = create_data_ref (outermost_loop, op, stmt, true);
- fns = DR_ACCESS_FNS (dr);
-
- for (i = 0; VEC_iterate (tree, fns, i, t); i++)
- if (!graphite_can_represent_scev (t, outermost_loop->num))
- {
- res = false;
- break;
- }
-
- free_data_ref (dr);
- return res;
-}
-
-/* Return true if the operand OP used in STMT is simple in regards to
- OUTERMOST_LOOP. */
-
-static bool
-is_simple_operand (loop_p outermost_loop, gimple stmt, tree op)
-{
- /* It is not a simple operand when it is a declaration, */
- if (DECL_P (op))
- return false;
-
- /* or a structure, */
- if (AGGREGATE_TYPE_P (TREE_TYPE (op)))
- return false;
-
- /* or a memory access that cannot be analyzed by the data reference
- analysis. */
- if (handled_component_p (op) || INDIRECT_REF_P (op))
- if (!stmt_simple_memref_p (outermost_loop, stmt, op))
- return false;
-
- return exclude_component_ref (op);
-}
-
/* Return true only when STMT is simple enough for being handled by
Graphite. This depends on SCOP_ENTRY, as the parameters are
initialized relatively to this basic block, the linear functions
|| (gimple_code (stmt) == GIMPLE_ASM))
return false;
+ if (is_gimple_debug (stmt))
+ return true;
+
if (!stmt_has_simple_data_refs_p (outermost_loop, stmt))
return false;
}
case GIMPLE_ASSIGN:
- {
- enum tree_code code = gimple_assign_rhs_code (stmt);
-
- switch (get_gimple_rhs_class (code))
- {
- case GIMPLE_UNARY_RHS:
- case GIMPLE_SINGLE_RHS:
- return (is_simple_operand (outermost_loop, stmt,
- gimple_assign_lhs (stmt))
- && is_simple_operand (outermost_loop, stmt,
- gimple_assign_rhs1 (stmt)));
-
- case GIMPLE_BINARY_RHS:
- return (is_simple_operand (outermost_loop, stmt,
- gimple_assign_lhs (stmt))
- && is_simple_operand (outermost_loop, stmt,
- gimple_assign_rhs1 (stmt))
- && is_simple_operand (outermost_loop, stmt,
- gimple_assign_rhs2 (stmt)));
-
- case GIMPLE_INVALID_RHS:
- default:
- gcc_unreachable ();
- }
- }
-
case GIMPLE_CALL:
- {
- size_t i;
- size_t n = gimple_call_num_args (stmt);
- tree lhs = gimple_call_lhs (stmt);
-
- if (lhs && !is_simple_operand (outermost_loop, stmt, lhs))
- return false;
-
- for (i = 0; i < n; i++)
- if (!is_simple_operand (outermost_loop, stmt,
- gimple_call_arg (stmt, i)))
- return false;
-
- return true;
- }
+ return true;
default:
/* These nodes cut a new scope. */
edge forwarder = NULL;
basic_block exit;
- if (find_single_exit_edge (region))
- return;
-
/* We create a forwarder bb (5) for all edges leaving this region
(3->5, 4->5). All other edges leading to the same bb, are moved
to a new bb (6). If these edges where part of another region (2->5)
mark_exit_edges (regions);
for (i = 0; VEC_iterate (sd_region, regions, i, s); i++)
- create_single_exit_edge (s);
+ /* Don't handle multiple edges exiting the function. */
+ if (!find_single_exit_edge (s)
+ && s->exit != EXIT_BLOCK_PTR)
+ create_single_exit_edge (s);
unmark_exit_edges (regions);
{
edge entry = find_single_entry_edge (s);
edge exit = find_single_exit_edge (s);
- scop_p scop = new_scop (new_sese (entry, exit));
+ scop_p scop;
+
+ if (!exit)
+ continue;
+
+ scop = new_scop (new_sese (entry, exit));
VEC_safe_push (scop_p, heap, *scops, scop);
/* Are there overlapping SCoPs? */
print_graphite_scop_statistics (file, scop);
}
-/* Version of free_scops special cased for limit_scops. */
-
-static void
-free_scops_1 (VEC (scop_p, heap) **scops)
-{
- int i;
- scop_p scop;
-
- for (i = 0; VEC_iterate (scop_p, *scops, i, scop); i++)
- {
- sese region = SCOP_REGION (scop);
- free (SESE_PARAMS_NAMES (region));
- SESE_PARAMS_NAMES (region) = 0;
- }
-
- free_scops (*scops);
-}
-
/* We limit all SCoPs to SCoPs, that are completely surrounded by a loop.
Example:
int j;
loop_p loop;
sese region = SCOP_REGION (scop);
- build_scop_bbs (scop);
build_sese_loop_nests (region);
for (j = 0; VEC_iterate (loop_p, SESE_LOOP_NEST (region), j, loop); j++)
}
}
- free_scops_1 (scops);
+ free_scops (*scops);
*scops = VEC_alloc (scop_p, heap, 3);
create_sese_edges (regions);
loop_p loop;
#ifdef ENABLE_CHECKING
- verify_loop_closed_ssa ();
+ verify_loop_closed_ssa (true);
#endif
FOR_EACH_LOOP (li, loop, 0)
update_ssa (TODO_update_ssa);
#ifdef ENABLE_CHECKING
- verify_loop_closed_ssa ();
+ verify_loop_closed_ssa (true);
#endif
}
canonicalize_loop_closed_ssa_form ();
build_scops_1 (single_succ (ENTRY_BLOCK_PTR), ENTRY_BLOCK_PTR->loop_father,
- ®ions, loop);
+ ®ions, loop);
create_sese_edges (regions);
build_graphite_scops (regions, scops);
VEC_length (scop_p, *scops));
}
-/* Pretty print all SCoPs in DOT format and mark them with different colors.
- If there are not enough colors, paint later SCoPs gray.
+/* Pretty print to FILE all the SCoPs in DOT format and mark them with
+ different colors. If there are not enough colors, paint the
+ remaining SCoPs in gray.
+
Special nodes:
- - "*" after the node number: entry of a SCoP,
- - "#" after the node number: exit of a SCoP,
- - "()" entry or exit not part of SCoP. */
+ - "*" after the node number denotes the entry of a SCoP,
+ - "#" after the node number denotes the exit of a SCoP,
+ - "()" around the node number denotes the entry or the
+ exit nodes of the SCOP. These are not part of SCoP. */
static void
dot_all_scops_1 (FILE *file, VEC (scop_p, heap) *scops)
dot_all_scops_1 (stream, scops);
fclose (stream);
- x = system ("dotty /tmp/allscops.dot");
+ x = system ("dotty /tmp/allscops.dot &");
#else
dot_all_scops_1 (stderr, scops);
#endif
dot_all_scops_1 (stream, scops);
fclose (stream);
- x = system ("dotty /tmp/allscops.dot");
+ x = system ("dotty /tmp/allscops.dot &");
}
#else
dot_all_scops_1 (stderr, scops);
OSDN Git Service
