Evan Cheng | 197d19d | 2007-03-28 08:30:04 +0000 | [diff] [blame] | 1 | //===---------------------------------------------------------------------===// |
| 2 | |
Evan Cheng | c3c7088 | 2007-03-20 22:22:38 +0000 | [diff] [blame] | 3 | Common register allocation / spilling problem: |
| 4 | |
Anton Korobeynikov | bed2946 | 2007-04-16 18:10:23 +0000 | [diff] [blame] | 5 | mul lr, r4, lr |
| 6 | str lr, [sp, #+52] |
| 7 | ldr lr, [r1, #+32] |
| 8 | sxth r3, r3 |
| 9 | ldr r4, [sp, #+52] |
| 10 | mla r4, r3, lr, r4 |
Evan Cheng | c3c7088 | 2007-03-20 22:22:38 +0000 | [diff] [blame] | 11 | |
| 12 | can be: |
| 13 | |
Anton Korobeynikov | bed2946 | 2007-04-16 18:10:23 +0000 | [diff] [blame] | 14 | mul lr, r4, lr |
Evan Cheng | c3c7088 | 2007-03-20 22:22:38 +0000 | [diff] [blame] | 15 | mov r4, lr |
Anton Korobeynikov | bed2946 | 2007-04-16 18:10:23 +0000 | [diff] [blame] | 16 | str lr, [sp, #+52] |
| 17 | ldr lr, [r1, #+32] |
| 18 | sxth r3, r3 |
| 19 | mla r4, r3, lr, r4 |
Evan Cheng | c3c7088 | 2007-03-20 22:22:38 +0000 | [diff] [blame] | 20 | |
| 21 | and then "merge" mul and mov: |
| 22 | |
Anton Korobeynikov | bed2946 | 2007-04-16 18:10:23 +0000 | [diff] [blame] | 23 | mul r4, r4, lr |
| 24 | str lr, [sp, #+52] |
| 25 | ldr lr, [r1, #+32] |
| 26 | sxth r3, r3 |
| 27 | mla r4, r3, lr, r4 |
Evan Cheng | c3c7088 | 2007-03-20 22:22:38 +0000 | [diff] [blame] | 28 | |
| 29 | It also increase the likelyhood the store may become dead. |
Evan Cheng | 197d19d | 2007-03-28 08:30:04 +0000 | [diff] [blame] | 30 | |
| 31 | //===---------------------------------------------------------------------===// |
| 32 | |
| 33 | I think we should have a "hasSideEffects" flag (which is automatically set for |
| 34 | stuff that "isLoad" "isCall" etc), and the remat pass should eventually be able |
| 35 | to remat any instruction that has no side effects, if it can handle it and if |
| 36 | profitable. |
| 37 | |
| 38 | For now, I'd suggest having the remat stuff work like this: |
| 39 | |
| 40 | 1. I need to spill/reload this thing. |
| 41 | 2. Check to see if it has side effects. |
| 42 | 3. Check to see if it is simple enough: e.g. it only has one register |
| 43 | destination and no register input. |
| 44 | 4. If so, clone the instruction, do the xform, etc. |
| 45 | |
| 46 | Advantages of this are: |
| 47 | |
| 48 | 1. the .td file describes the behavior of the instructions, not the way the |
| 49 | algorithm should work. |
| 50 | 2. as remat gets smarter in the future, we shouldn't have to be changing the .td |
| 51 | files. |
| 52 | 3. it is easier to explain what the flag means in the .td file, because you |
| 53 | don't have to pull in the explanation of how the current remat algo works. |
| 54 | |
| 55 | Some potential added complexities: |
| 56 | |
| 57 | 1. Some instructions have to be glued to it's predecessor or successor. All of |
| 58 | the PC relative instructions and condition code setting instruction. We could |
| 59 | mark them as hasSideEffects, but that's not quite right. PC relative loads |
| 60 | from constantpools can be remat'ed, for example. But it requires more than |
| 61 | just cloning the instruction. Some instructions can be remat'ed but it |
| 62 | expands to more than one instruction. But allocator will have to make a |
| 63 | decision. |
| 64 | |
| 65 | 4. As stated in 3, not as simple as cloning in some cases. The target will have |
| 66 | to decide how to remat it. For example, an ARM 2-piece constant generation |
| 67 | instruction is remat'ed as a load from constantpool. |
Evan Cheng | 9747778 | 2007-03-29 02:48:56 +0000 | [diff] [blame] | 68 | |
| 69 | //===---------------------------------------------------------------------===// |
| 70 | |
| 71 | bb27 ... |
| 72 | ... |
Anton Korobeynikov | bed2946 | 2007-04-16 18:10:23 +0000 | [diff] [blame] | 73 | %reg1037 = ADDri %reg1039, 1 |
| 74 | %reg1038 = ADDrs %reg1032, %reg1039, %NOREG, 10 |
Evan Cheng | 9747778 | 2007-03-29 02:48:56 +0000 | [diff] [blame] | 75 | Successors according to CFG: 0x8b03bf0 (#5) |
| 76 | |
| 77 | bb76 (0x8b03bf0, LLVM BB @0x8b032d0, ID#5): |
| 78 | Predecessors according to CFG: 0x8b0c5f0 (#3) 0x8b0a7c0 (#4) |
Anton Korobeynikov | bed2946 | 2007-04-16 18:10:23 +0000 | [diff] [blame] | 79 | %reg1039 = PHI %reg1070, mbb<bb76.outer,0x8b0c5f0>, %reg1037, mbb<bb27,0x8b0a7c0> |
Evan Cheng | 9747778 | 2007-03-29 02:48:56 +0000 | [diff] [blame] | 80 | |
| 81 | Note ADDri is not a two-address instruction. However, its result %reg1037 is an |
| 82 | operand of the PHI node in bb76 and its operand %reg1039 is the result of the |
| 83 | PHI node. We should treat it as a two-address code and make sure the ADDri is |
| 84 | scheduled after any node that reads %reg1039. |
| 85 | |
| 86 | //===---------------------------------------------------------------------===// |
| 87 | |
| 88 | Re-Materialize load from frame index. |