| Tanya Lattner | e9af5d1 | 2004-11-06 22:41:00 +0000 | [diff] [blame] | 1 | // RUN: %llvmgcc -S %s -o - | llvm-as -f -o /dev/null |
| 2 | |
| Chris Lattner | df72341 | 2002-03-14 19:40:44 +0000 | [diff] [blame] | 3 | /* GCC was generating PHI nodes with an arity < #pred of the basic block the |
| 4 | * PHI node lived in. This was breaking LLVM because the number of entries |
| 5 | * in a PHI node must equal the number of predecessors for a basic block. |
| 6 | */ |
| 7 | |
| 8 | int trys(char *s, int x) |
| 9 | { |
| 10 | int asa; |
| 11 | double Val; |
| 12 | int LLS; |
| 13 | if (x) { |
| 14 | asa = LLS + asa; |
| 15 | } else { |
| 16 | } |
| 17 | return asa+(int)Val; |
| 18 | } |
| 19 | |