------- Comment #7 from rguenth at gcc dot gnu dot org  2008-11-02 12:48 -------
We take a long time in compute_antic in the loop

      for (i = 0; i < last_basic_block - NUM_FIXED_BLOCKS; i++)
        {
          if (TEST_BIT (changed_blocks, postorder[i]))
            {
              basic_block block = BASIC_BLOCK (postorder[i]);
              changed |= compute_antic_aux (block,
                                            TEST_BIT (has_abnormal_preds,
                                                      block->index));
            }
        }

(gdb) print cfun->cfg->x_last_basic_block
$22 = 3220

and some invocations of compute_antic_aux take a really long time during
phi_translate_set because the to translate set is really large (it has
in one case 11885 elements).

probably not much to do here ...


-- 

rguenth at gcc dot gnu dot org changed:

           What    |Removed                     |Added
----------------------------------------------------------------------------
   Last reconfirmed|2008-06-05 11:37:39         |2008-11-02 12:48:47
               date|                            |


http://gcc.gnu.org/bugzilla/show_bug.cgi?id=36439

------- You are receiving this mail because: -------
You reported the bug, or are watching the reporter.


-- 
To UNSUBSCRIBE, email to [EMAIL PROTECTED]
with a subject of "unsubscribe". Trouble? Contact [EMAIL PROTECTED]

Reply via email to