- Jul 30, 2008
-
-
Owen Anderson authored
Use existing LiveInterval methods to simplify live interval merging. Thanks to Evan for pointing these out. llvm-svn: 54225
-
Dan Gohman authored
subreg form on x86-64, to avoid the problem with x86-32 having GPRs that don't have 8-bit subregs. Also, change several 16-bit instructions to use equivalent 32-bit instructions. These have a smaller encoding and avoid partial-register updates. llvm-svn: 54223
-
Owen Anderson authored
llvm-svn: 54218
-
Bruno Cardoso Lopes authored
llvm-svn: 54215
-
Bruno Cardoso Lopes authored
llvm-svn: 54214
-
Bruno Cardoso Lopes authored
llvm-svn: 54213
-
Bruno Cardoso Lopes authored
llvm-svn: 54212
-
Mon P Wang authored
to different address spaces. This alters the naming scheme for those intrinsics, e.g., atomic.load.add.i32 => atomic.load.add.i32.p0i32 llvm-svn: 54195
-
Eli Friedman authored
time applying to the implicit comparison in smin expressions. The correct way to transform an inequality into the opposite inequality, either signed or unsigned, is with a not expression. I looked through the SCEV code, and I don't think there are any more occurrences of this issue. llvm-svn: 54194
-
Owen Anderson authored
llvm-svn: 54186
-
Owen Anderson authored
When merging live intervals, we also need to merge in any live ranges that are inputs to two-address instructions that themselves define a range we already care about. llvm-svn: 54185
-
Eli Friedman authored
SGT exit condition. Essentially, the correct way to flip an inequality in 2's complement is the not operator, not the negation operator. That said, the difference only affects cases involving INT_MIN. Also, enhance the pre-test search logic to be a bit smarter about inequalities flipped with a not operator, so it can eliminate the smax from the iteration count for simple loops. llvm-svn: 54184
-
- Jul 29, 2008
-
-
Owen Anderson authored
When merging a PHI operand's live interval into the PHI's live interval, we need to merge over all liveranges in the operand's interval that share the relevant value number, not just the range that immediately precedes the PHI. llvm-svn: 54174
-
Owen Anderson authored
llvm-svn: 54173
-
Duncan Sands authored
to be marked invalid regardless of whether it is a debug, an exception handling or (hopefully) a GC label. llvm-svn: 54172
-
Bruno Cardoso Lopes authored
llvm-svn: 54169
-
Nate Begeman authored
llvm-svn: 54168
-
Bruno Cardoso Lopes authored
llvm-svn: 54167
-
Nate Begeman authored
The CellSPU codegen is broken, but needs to be fixed before we can put this back in. llvm-svn: 54164
-
Nate Begeman authored
CodeGen & Clang work coming next. llvm-svn: 54161
-
Matthijs Kooijman authored
partially unroll a loop when fully unrolling would not fit under the threshold. Patch by Mikael Lepistö. llvm-svn: 54160
-
Matthijs Kooijman authored
that says "unconditional loads from this argument are safe", we now keep track of the safety per set of indices from which loads happen. This prevents ArgPromotion from promoting loads that aren't really valid. As an added effect, this will now disregard the the type of the indices passed to a GEP, so "load GEP %A, i32 1" and "load GEP %A, i64 1" will result in a single argument, not two. This fixes PR2598, for which a testcase has been added as well. llvm-svn: 54159
-
Matthijs Kooijman authored
llvm-svn: 54157
-
Evan Cheng authored
Fix for PR2578. Do not split off a block whose size is less than FreeRangeHeader::getMinBlockSize(). Patch by Damien. llvm-svn: 54152
-
Dan Gohman authored
llvm-svn: 54148
-
Dan Gohman authored
which is represented in codegen as an 'and' operation. This matches them with movz instructions, instead of leaving them to be matched by and instructions with an immediate field. llvm-svn: 54147
-
- Jul 28, 2008
-
-
Dan Gohman authored
a new ilist_node class, and remove them. Unlike alist_node, ilist_node doesn't attempt to manage storage itself, so it avoids the associated problems, including being opaque in gdb. Adjust the Recycler class so that it doesn't depend on alist_node. Also, change it to use explicit Size and Align parameters, allowing it to work when the largest-sized node doesn't have the greatest alignment requirement. Change MachineInstr's MachineMemOperand list from a pool-backed alist to a std::list for now. llvm-svn: 54146
-
Owen Anderson authored
llvm-svn: 54144
-
Bruno Cardoso Lopes authored
llvm-svn: 54142
-
Duncan Sands authored
of operands should be -1 not 0. llvm-svn: 54141
-
Bruno Cardoso Lopes authored
Fixed COMM asm directive usage. ConstantPool using custom FourByteConstantSection. llvm-svn: 54139
-
Dan Gohman authored
llvm-svn: 54136
-
Owen Anderson authored
This fixes PR2599. llvm-svn: 54133
-
Owen Anderson authored
circumstances we could end up remapping a dependee to the same instruction that we're trying to remove. Handle this properly by just falling back to a conservative solution. llvm-svn: 54132
-
Bill Wendling authored
llvm-svn: 54131
-
Dan Gohman authored
the SelectionDAG's. llvm-svn: 54129
-
- Jul 27, 2008
-
-
Dan Gohman authored
llvm-svn: 54128
-
Dan Gohman authored
parallel its analogue, Value::value_use_iterator. The operator* method now returns the user, rather than the use. llvm-svn: 54127
-
Dan Gohman authored
llvm-svn: 54124
-
Duncan Sands authored
unary operations! Add support for softening some additional unary operations like fp_to_sint. llvm-svn: 54122
-