- Mar 29, 2013
-
-
Eric Christopher authored
entire original compile unit has been constructed. llvm-svn: 178365
-
Adrian Prantl authored
llvm-svn: 178364
-
Hal Finkel authored
Like nearbyint, rint can be implemented on PPC using the frin instruction. The complication comes from the fact that rint needs to set the FE_INEXACT flag when the result does not equal the input value (and frin does not do that). As a result, we use a custom inserter which, after the rounding, compares the rounded value with the original, and if they differ, explicitly sets the XX bit in the FPSCR register (which corresponds to FE_INEXACT). Once LLVM has better modeling of the floating-point environment we should be able to (often) eliminate this extra complexity. llvm-svn: 178362
-
Akira Hatanaka authored
llvm-svn: 178359
-
Andrew Trick authored
A9 uses itinerary classes, Swift uses RW lists. This tripped some verification when we're expanding variants. I had to refine the verification a bit. llvm-svn: 178357
-
Matt Arsenault authored
llvm-svn: 178356
-
Matt Arsenault authored
llvm-svn: 178355
-
Adrian Prantl authored
rdar://problem/12767564 llvm-svn: 178353
-
Benjamin Kramer authored
It was superseded by MachineBlockPlacement and disabled by default since LLVM 3.1. llvm-svn: 178349
-
Nadav Rotem authored
llvm-svn: 178346
-
Jyotsna Verma authored
llvm-svn: 178345
-
Hal Finkel authored
These instructions are available on the P5x (and later) and on the A2. They implement the standard floating-point rounding operations (floor, trunc, etc.). One caveat: frin (round to nearest) does not implement "ties to even", and so is only enabled in fast-math mode. llvm-svn: 178337
-
Rafael Espindola authored
This reverts commit 617330909f0c26a3f2ab8601a029b9bdca48aa61. It broke the bots: /home/clangbuild2/clang-ppc64-2/llvm.src/unittests/ADT/SmallVectorTest.cpp:150: PushPopTest /home/clangbuild2/clang-ppc64-2/llvm.src/unittests/ADT/SmallVectorTest.cpp:118: Failure Value of: v[i].getValue() Actual: 0 Expected: value Which is: 2 llvm-svn: 178334
-
Jean-Luc Duprat authored
being power-of-two sized. llvm-svn: 178332
-
Michael Gottesman authored
llvm-svn: 178329
-
Akira Hatanaka authored
register classes for Mips64 and DSP-ASE. No functionality changes. llvm-svn: 178328
-
Akira Hatanaka authored
No functionality changes. llvm-svn: 178327
-
Akira Hatanaka authored
No functionality changes. llvm-svn: 178326
-
Dan Gohman authored
llvm-svn: 178319
-
Jack Carter authored
Mips assembler supports macros that allows the OR instruction to have an immediate parameter. This patch adds an instruction alias that converts this macro into a Mips ORI instruction. Contributer: Vladimir Medic llvm-svn: 178316
-
Michael Liao authored
llvm-svn: 178314
-
Michael Liao authored
- RDRAND always clears the destination value when a random value is not available (i.e. CF == 0). This value is truncated or zero-extended as the false boolean value to be returned. Boolean simplification needs to skip this 'zext' or 'trunc' node. llvm-svn: 178312
-
Michael Liao authored
To enable a load of a call address to be folded with that call, this load is moved from outside of callseq into callseq. Such a moving adds a non-glued node (that load) into a glued sequence. This non-glue load is only removed when DAG selection folds them into a memory form call instruction. When such instruction selection is disabled, it breaks DAG schedule. To prevent that, such moving is disabled when target favors register indirect call. Previous workaround disabling CALL32m/CALL64m insn selection is removed. llvm-svn: 178308
-
Michael Gottesman authored
Removed dead code from ObjCARCOpts relating to tracking objc_retainBlocks through the ARC Dataflow analysis. By the time we get to the ARC dataflow analysis, any objc_retainBlock calls are not optimizable. llvm-svn: 178306
-
Chad Rosier authored
immediate in a register. I don't believe this should ever fail, but I see no harm in trying to make this code bullet proof. I've added an assert to ensure my assumtion is correct. If the assertion fires something is wrong and we should fix it, rather then just silently fall back to SelectionDAG isel. llvm-svn: 178305
-
Jack Carter authored
Mips assembler allows following to be used as aliased instructions: jal $rs for jalr $rs jal $rd,$rd for jalr $rd,$rs This patch provides alias definitions in td files and test cases to show the usage. Contributer: Vladimir Medic llvm-svn: 178304
-
- Mar 28, 2013
-
-
Nadav Rotem authored
llvm-svn: 178303
-
Bill Wendling authored
Go ahead and use the full path for both the .gcno and .gcda files. llvm-svn: 178302
-
Nadav Rotem authored
llvm-svn: 178301
-
Nadav Rotem authored
llvm-svn: 178300
-
Michael Liao authored
llvm-svn: 178299
-
Eric Christopher authored
llvm-svn: 178293
-
Timur Iskhodzhanov authored
llvm-svn: 178291
-
Hal Finkel authored
Otherwise, the CHECK-NOT's might trigger depending on the host's CPU. llvm-svn: 178287
-
Hal Finkel authored
Compiling in 32-bit mode on a P7 would assert after 64-bit DAG combines were added for bswap with load/store. This is because these combines are really only valid in 64-bit mode, regardless of the CPU (and this was not being checked). llvm-svn: 178286
-
Michael Gottesman authored
Since we handle optimizable objc_retainBlocks through strength reduction in OptimizableIndividualCalls, we know that all code after that point will only see non-optimizable objc_retainBlock calls. IsForwarding is only called by functions after that point, so it is ok to just classify objc_retainBlock as non-forwarding. <rdar://problem/13249661>. llvm-svn: 178285
-
Michael Gottesman authored
If an objc_retainBlock has the copy_on_escape metadata attached to it AND if the block pointer argument only escapes down the stack, we are allowed to strength reduce the objc_retainBlock to to an objc_retain and thus optimize it. Current there is logic in the ARC data flow analysis to handle this case which is complicated and involved making distinctions in between objc_retainBlock and objc_retain in certain places and considering them the same in others. This patch simplifies said code by: 1. Performing the strength reduction in the initial ARC peephole analysis (ObjCARCOpts::OptimizeIndividualCalls). 2. Changes the ARC dataflow analysis (which runs after the peephole analysis) to consider all objc_retainBlock calls to not be optimizable (since if the call was optimizable, we would have strength reduced it already). This patch leaves in the infrastructure in the ARC dataflow analysis to handle this case, which due to 2 will just be dead code. I am doing this on purpose to separate the removal of the old code from the testing of the new code. <rdar://problem/13249661>. llvm-svn: 178284
-
Jyotsna Verma authored
llvm-svn: 178281
-
Hal Finkel authored
Thanks to Bill Schmidt for pointing this out! llvm-svn: 178280
-
Jyotsna Verma authored
llvm-svn: 178279
-