- Apr 11, 2013
-
-
Joey Gouly authored
llvm-svn: 179239
-
Fariborz Jahanian authored
// rdar://12379053 llvm-svn: 179238
-
Adrian Prantl authored
llvm-svn: 179237
-
Adrian Prantl authored
llvm-svn: 179236
-
Anna Zaks authored
llvm-svn: 179235
-
Anna Zaks authored
llvm-svn: 179234
-
Tobias Grosser authored
Statements with an empty iteration domain may not have a schedule assigned by the isl schedule optimizer. As Polly expects each statement to have a schedule, we keep the old schedule for such statements. This fixes http://llvm.org/PR15645` Reported-by:
Johannes Doerfert <johannesdoerfert@gmx.de> llvm-svn: 179233
-
Anton Yartsev authored
llvm-svn: 179232
-
Anton Yartsev authored
Now the check is also applied to arguments for Objective-C method calls and to 'this' pointer. llvm-svn: 179230
-
Jack Carter authored
These changes are based on commit responses for r179135. llvm-svn: 179229
-
Anna Zaks authored
Fixes PR13476 llvm-svn: 179228
-
Hal Finkel authored
In the simple and triangle if-conversion cases, when CopyAndPredicateBlock is used because the to-be-predicated block has other predecessors, we need to explicitly remove the old copied block from the successors list. Normally if conversion relies on TII->AnalyzeBranch combined with BB->CorrectExtraCFGEdges to cleanup the successors list, but if the predicated block contained an un-analyzable branch (such as a now-predicated return), then this will fail. These extra successors were causing a problem on PPC because it was causing later passes (such as PPCEarlyReturm) to leave dead return-only basic blocks in the code. llvm-svn: 179227
-
Bill Wendling authored
llvm-svn: 179226
-
Jack Carter authored
These changes are based on commit responses for r179135. llvm-svn: 179225
-
- Apr 10, 2013
-
-
Bill Wendling authored
llvm-svn: 179224
-
Kay Tiong Khoo authored
llvm-svn: 179223
-
Eric Christopher authored
temporarily while we work on plumbing through some changes to continue supporting gdb on darwin. This reverts commit r179122. llvm-svn: 179222
-
Anna Zaks authored
[analyzer] When reporting a leak in RetainCount checker due to an early exit from init, step into init. The heuristic here (proposed by Jordan) is that, usually, if a leak is due to an early exit from init, the allocation site will be a call to alloc. Note that in other cases init resets self to [super init], which becomes the allocation site of the object. llvm-svn: 179221
-
Bill Wendling authored
Compact unwind has an encoding for when we're not able to generate compact unwind and must generate an EH frame instead. Track that, but still emit that CU encoding. llvm-svn: 179220
-
Anna Zaks authored
llvm-svn: 179219
-
Eric Christopher authored
just assembling a file and have passed the option. llvm-svn: 179218
-
Chad Rosier authored
llvm-svn: 179217
-
Chad Rosier authored
-fstrict-aliasing. rdar://13622687 llvm-svn: 179216
-
Kay Tiong Khoo authored
llvm-svn: 179215
-
Reid Kleckner authored
The escaping interaction between Python and grep doesn't work on my system. This change fixes the tests for me. llvm-svn: 179214
-
Benjamin Kramer authored
This avoids a nasty const correctness issue (AnalysisIDs are const, Pass* isn't). llvm-svn: 179213
-
Bill Wendling authored
If anyone objects please let me know. llvm-svn: 179212
-
Preston Gurd authored
In the X86 back end, getMemoryOperandNo() returns the offset into the operand array of the start of the memory reference descriptor. Additional code in EncodeInstruction provides an additional adjustment. This patch places that additional code in a separate function, called getOperandBias, so that any caller of getMemoryOperandNo can also call getOperandBias. llvm-svn: 179211
-
Chad Rosier authored
wasn't always the start of the operand. If there was a symbol reference, then Start pointed to that token. It's very likely there are other places that need to be updated. llvm-svn: 179210
-
Jyotsna Verma authored
to disable following tests for Hexagon that require direct object generation support. DebugInfo/dwarf-public-names.ll DebugInfo/dwarf-version.ll DebugInfo/member-pointers.ll DebugInfo/namespace.ll DebugInfo/two-cus-from-same-file.ll Fixes bug 15616 - http://llvm.org/bugs/show_bug.cgi?id=15616 llvm-svn: 179209
-
Howard Hinnant authored
llvm-svn: 179208
-
Nadav Rotem authored
Make the SLP store-merger less paranoid about function calls. We check for function calls when we check if it is safe to sink instructions. llvm-svn: 179207
-
Nadav Rotem authored
llvm-svn: 179206
-
Chad Rosier authored
llvm-svn: 179205
-
Dmitri Gribenko authored
llvm-svn: 179204
-
Hal Finkel authored
I've not seen this happen in practice, and probably can't until we start allowing decrement-counter-based conditional branches to be double predicated, but just in case, don't allow predication of a diamond in which both sides have ctr-defining branches. Even though the branching behavior of these can be predicated, the counter-decrementing behavior cannot be. llvm-svn: 179199
-
Chad Rosier authored
version as lea is only available in 64-bit mode. llvm-svn: 179190
-
Chad Rosier authored
Test cases that regressed due to r179115, plus a few more, were added in r179182. Original commit message below: [ms-inline asm] Use parsePrimaryExpr in lieu of parseExpression if we need to parse an identifier. Otherwise, parseExpression may parse multiple tokens, which makes it impossible to properly compute an immediate displacement. An example of such a case is the source operand (i.e., [Symbol + ImmDisp]) in the below example: __asm mov eax, [Symbol + ImmDisp] Part of rdar://13611297 llvm-svn: 179187
-
Michel Danzer authored
21 more little piglits with radeonsi. Reviewed-by:
Tom Stellard <thomas.stellard@amd.com> llvm-svn: 179186
-
Reed Kotler authored
Mips32 code as Mips16 unless it can't be compiled as Mips 16. For now this would happen as long as floating point instructions are not needed. Probably it would also make sense to compile as mips32 if atomic operations are needed too. There may be other cases too. A module pass prescans the IR and adds the mips16 or nomips16 attribute to functions depending on the functions needs. Mips 16 mode can result in a 40% code compression by utililizing 16 bit encoding of many instructions. The hope is for this to replace the traditional gcc way of dealing with Mips16 code using floating point which involves essentially using soft float but with a library implemented using mips32 floating point. This gcc method also requires creating stubs so that Mips32 code can interact with these Mips 16 functions that have floating point needs. My conjecture is that in reality this traditional gcc method would never win over this new method. I will be implementing the traditional gcc method also. Some of it is already done but I needed to do the stubs to finish the work and those required this mips16/32 mixed mode capability. I have more ideas for to make this new method much better and I think the old method will just live in llvm for anyone that needs the backward compatibility but I don't for what reason that would be needed. llvm-svn: 179185
-