diff options
| author | Jim Wilson <wilson@gcc.gnu.org> | 1994-01-31 16:02:12 -0800 |
|---|---|---|
| committer | Jim Wilson <wilson@gcc.gnu.org> | 1994-01-31 16:02:12 -0800 |
| commit | f6516aeee4e426b3e08bcc3794ba4256a54a3449 (patch) | |
| tree | 18f4c44ca784cbfb083ef875114f14e1bb48d1c7 | |
| parent | 239b043b8a50413a663bfa220dbde9f3dba44fef (diff) | |
| download | gcc-f6516aeee4e426b3e08bcc3794ba4256a54a3449.zip gcc-f6516aeee4e426b3e08bcc3794ba4256a54a3449.tar.gz gcc-f6516aeee4e426b3e08bcc3794ba4256a54a3449.tar.bz2 | |
(find_best_addr): Limit number of cse_gen_binary calls to
20 per iteration.
From-SVN: r6449
| -rw-r--r-- | gcc/cse.c | 10 |
1 files changed, 9 insertions, 1 deletions
@@ -2649,9 +2649,17 @@ find_best_addr (insn, loc) int best_rtx_cost = (COST (*loc) + 1) >> 1; struct table_elt *best_elt = elt; rtx best_rtx = *loc; + int count; + + /* This is at worst case an O(n^2) algorithm, so limit our search + to the first 32 elements on the list. This avoids trouble + compiling code with very long basic blocks that can easily + call cse_gen_binary so many times that we run out of memory. */ found_better = 0; - for (p = elt->first_same_value; p; p = p->next_same_value) + for (p = elt->first_same_value, count = 0; + p && count < 32; + p = p->next_same_value, count++) if (! p->flag && (GET_CODE (p->exp) == REG || exp_equiv_p (p->exp, p->exp, 1, 0))) |