This is the mail archive of the
gcc-bugs@gcc.gnu.org
mailing list for the GCC project.
[Bug middle-end/38474] slow compilation at -O0 (callgraph optimization, inline heuristics, expand )
- From: "steven at gcc dot gnu dot org" <gcc-bugzilla at gcc dot gnu dot org>
- To: gcc-bugs at gcc dot gnu dot org
- Date: 15 Dec 2008 21:55:12 -0000
- Subject: [Bug middle-end/38474] slow compilation at -O0 (callgraph optimization, inline heuristics, expand )
- References: <bug-38474-6642@http.gcc.gnu.org/bugzilla/>
- Reply-to: gcc-bugzilla at gcc dot gnu dot org
------- Comment #15 from steven at gcc dot gnu dot org 2008-12-15 21:55 -------
>From cfgexpand.c:
static void
add_alias_set_conflicts (void)
{
size_t i, j, n = stack_vars_num;
for (i = 0; i < n; ++i)
{
tree type_i = TREE_TYPE (stack_vars[i].decl);
bool aggr_i = AGGREGATE_TYPE_P (type_i);
bool contains_union;
contains_union = aggregate_contains_union_type (type_i);
for (j = 0; j < i; ++j)
{
Classic example of quadratic algorithm...
--
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=38474