RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-12-14 07:09:08 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity
23,115 Commits 4 Branches 5 Tags 634 MiB
fa0acde009
Commit Graph

706 Commits

Author SHA1 Message Date
Chris Lattner
fa0acde009 generate side-effect info 
llvm-svn: 26672
 2006-03-09 22:37:52 +00:00
Chris Lattner
67900dea61 Parse mod/ref properties, autogen mod/ref information 
llvm-svn: 26669
 2006-03-09 22:30:49 +00:00
Chris Lattner
35d32c232a parse intrinsic types 
autogenerate an intrinsic verifier

llvm-svn: 26666
 2006-03-09 22:05:04 +00:00
Chris Lattner
f4bb4b3b11 autogenerate the function name recognizer 
llvm-svn: 26663
 2006-03-09 20:34:19 +00:00
Evan Cheng
df3c89dd52 Temporary hack to enable more (store (op (load ...))) folding. This makes 
it possible when a TokenFactor is between the load and store. But is still
missing some cases due to ordering issue.

llvm-svn: 26638
 2006-03-09 08:19:11 +00:00
Evan Cheng
71c62ae1f4 Don't generate silly matching code like this: 
if (N1.getOpcode() == ISD::ADD &&
     ...)
   if (... &&
       (N1.getNumOperands() == 1 || !isNonImmUse(N1.Val, N10.Val))) &&
       ...)

TableGen knows N1 must have more than one operand.

llvm-svn: 26592
 2006-03-07 08:31:27 +00:00
Chris Lattner
a31ef8a613 Silence a warning. 
llvm-svn: 26508
 2006-03-03 19:34:28 +00:00
Chris Lattner
d2068344fc Fix pasteo 
llvm-svn: 26499
 2006-03-03 06:13:41 +00:00
Chris Lattner
c8db4dd179 remove a bunch of long-dead testing code 
llvm-svn: 26497
 2006-03-03 02:34:28 +00:00
Chris Lattner
0b3c1c1fe2 initial implementation of intrinsic parsing 
llvm-svn: 26495
 2006-03-03 02:32:46 +00:00
Chris Lattner
b878804a5f remove out of date comment 
llvm-svn: 26492
 2006-03-03 02:04:07 +00:00
Chris Lattner
29d28e02b0 Add support for "-Ifoo" in addition to "-I foo" 
llvm-svn: 26487
 2006-03-03 01:53:40 +00:00
Chris Lattner
90eecf3882 Regenerate 
llvm-svn: 26486
 2006-03-03 01:47:37 +00:00
Chris Lattner
10c2fb116d add support for multiple include directories 
llvm-svn: 26485
 2006-03-03 01:47:14 +00:00
Evan Cheng
9539ab3ecc New vector type v2f32. 
llvm-svn: 26437
 2006-03-01 01:10:52 +00:00
Chris Lattner
1ffa8d3666 Select inline asm memory operands. 
llvm-svn: 26349
 2006-02-24 02:13:31 +00:00
Evan Cheng
6a9422ce1c Added x86 integer vector types: 64-bit packed byte integer (v16i8), 64-bit 
packed word integer (v8i16), and 64-bit packed doubleword integer (v2i32).

llvm-svn: 26294
 2006-02-20 22:34:53 +00:00
Jeff Cohen
6e4fbcce8f Fix bugs identified by VC++. 
llvm-svn: 26287
 2006-02-18 03:20:33 +00:00
Evan Cheng
110f651cba Bump up pattern cost if the resulting instruction is marked 
usesCustomDAGSchedInserter.

llvm-svn: 26282
 2006-02-18 02:33:09 +00:00
Chris Lattner
0974ebab7b Check the new form for bison output into CVS 
llvm-svn: 26208
 2006-02-15 07:24:01 +00:00
Chris Lattner
be28034223 Adjust to new form of handling lexer dependencies, this way shouldn't have 
the problems the old way did.

llvm-svn: 26161
 2006-02-14 05:13:13 +00:00
Evan Cheng
e8a0e56482 Call InsertISelMapEntry rather than map insertion operator to prevent overly 
aggrssive inlining. This reduces Select_store frame size from 24k to 10k.

llvm-svn: 26095
 2006-02-09 22:12:27 +00:00
Evan Cheng
fd9315eaaa Match getTargetNode() changes (now returns SDNode* instead of SDOperand). 
llvm-svn: 26084
 2006-02-09 07:16:09 +00:00
Evan Cheng
521e5a1bfe Change Select() from 
SDOperand Select(SDOperand N);
to
void Select(SDOperand &Result, SDOperand N);

llvm-svn: 26067
 2006-02-09 00:37:58 +00:00
Evan Cheng
bde468bac5 Added options -cflag, -cxxflags, and -ldflags to override the default C 
compilation, C++ compilation, and linker options.
e.g. This is the options I use for testing on my x86 iMac:
nice ./NightlyTest.pl -release -cflags "-Os -DNDEBUG -fomit-frame-pointer" -cxxflags "-Os -DNDEBUG -finline-functions -felide-constructors -fomit-frame-pointer"

llvm-svn: 26057
 2006-02-08 09:08:06 +00:00
Evan Cheng
c66d006526 Remove -pedantic. It no longer works. 
llvm-svn: 26055
 2006-02-08 07:28:22 +00:00
Evan Cheng
0ff5d88abd Hoist all SDOperand declarations within a Select_{opcode}() to the top level 
to reduce stack memory usage. This is intended to work around the gcc bug.

llvm-svn: 26026
 2006-02-07 00:37:41 +00:00
Chris Lattner
cf81cdcf95 Add support for modifier strings in machine instr descriptions. This allows 
us to avoid creating lots of "Operand" types with different printers, instead
we can fold several together and use modifiers.  For example, we can now use:

${target:call} to say that the operand should be printed like a 'call' operand.

llvm-svn: 26024
 2006-02-06 23:40:48 +00:00
Chris Lattner
232dd5c069 Simplify the variant handling code, no functionality change. 
llvm-svn: 26023
 2006-02-06 22:43:28 +00:00
Evan Cheng
2af9230f1e At the end of isel, select a replacement node for each handle that does not 
have one. This can happen if a load's real uses are dead (i.e. they do not
have uses themselves).

llvm-svn: 26014
 2006-02-06 08:12:55 +00:00
Evan Cheng
6f1778d4e1 Name change. 
llvm-svn: 26013
 2006-02-06 06:03:35 +00:00
Evan Cheng
09b5e544a9 Handle HANDLENODE: just return itself. 
llvm-svn: 26011
 2006-02-05 08:46:14 +00:00
Evan Cheng
0b5d4a10a9 Allow more loads to be folded which were previously prevented from happening 
due to ordering issue. i.e. they were selected for chain use first.
Now at load select time, check if it is being selected for a chain use and if
it has only a single real use. If so, return a HANDLENODE (with the load as
its operand) in its place and record it.
When it is folded or the load is selected for a real use, the isel records it
as the replacement for the HANDLENODE. The replacement is done when all nodes
are selected.
This scheme exposed a couple of problems where cycles can happen. (See comments
in EmitMatchCode() for descriptions of the problems and their workaround /
solutions.) These problems have been resolved with a small compile time
penality.

llvm-svn: 25995
 2006-02-05 06:43:12 +00:00
Evan Cheng
d5d3d7ad9e Re-committing the last bit of change. It shouldn't break PPC this time. 
llvm-svn: 25982
 2006-02-05 05:22:18 +00:00
Chris Lattner
951217976d Temporarily revert the last change, which breaks PPC and other targets that 
DO select things.

llvm-svn: 25970
 2006-02-04 09:23:06 +00:00
Evan Cheng
6a366c5eda Complex pattern's custom matcher should not call Select() on any operands. 
Select them afterwards if it returns true.

llvm-svn: 25968
 2006-02-04 08:50:49 +00:00
Chris Lattner
21f305febf node predicates add to the complexity of a pattern. This ensures that the 
X86 backend attempts to match small-immediate versions of instructions before
the full size immediate versions.

llvm-svn: 25937
 2006-02-03 18:06:02 +00:00
Evan Cheng
7c8bab62e5 (store (op (load ...))) folding problem. In the generated matching code, 
Chain is initially set to the chain operand of store node, when it reaches
load, if it matches the load then Chain is set to the chain operand of the
load.

However, if the matching code that follows this fails, isel moves on to the
next pattern but it does not restore Chain to the chain operand of the store.
So when it tries to match the next store / op / load pattern it would fail on
the Chain == load.getOperand(0) test.

The solution is for each chain operand to get a unique name. e.g. Chain10.

llvm-svn: 25931
 2006-02-03 06:22:41 +00:00
Chris Lattner
c9a001a67d add a note, ya knoe 
llvm-svn: 25880
 2006-02-01 19:12:23 +00:00
Evan Cheng
efdfb534a7 If a pattern's root node is a constant, its size should be 3 rather than 2. 
llvm-svn: 25870
 2006-02-01 06:06:31 +00:00
Chris Lattner
b79e962b6b solaris won't clobber an existing symlink with ln -sf apparently 
llvm-svn: 25849
 2006-01-31 16:10:53 +00:00
Chris Lattner
8d9da62be7 implement test/Regression/TableGen/DagIntSubst.ll 
llvm-svn: 25836
 2006-01-31 06:02:35 +00:00
Chris Lattner
b7616b85bc simplify some code 
llvm-svn: 25791
 2006-01-29 20:01:35 +00:00
Andrew Lenharth
1ba3cfd622 it is nice not to chop off bits for those blessed with lots of bits 
llvm-svn: 25766
 2006-01-29 05:22:37 +00:00
Andrew Lenharth
fde505e9f5 make the casts actually cast to the variable type 
llvm-svn: 25765
 2006-01-29 05:17:22 +00:00
Andrew Lenharth
896015b24f start of the 64bit safety cleanup 
llvm-svn: 25764
 2006-01-29 05:07:04 +00:00
Chris Lattner
024ea8e7ca Emit series of conditionals with &&, emitting stuff like this: 
if (N1.getOpcode() == ISD::LOAD &&
        N1.hasOneUse() &&
        !CodeGenMap.count(N1.getValue(0)) &&
        !CodeGenMap.count(N1.getValue(1))) {

instead of this:

    if (N1.getOpcode() == ISD::LOAD) {
      if (N1.hasOneUse()) {
        if (!CodeGenMap.count(N1.getValue(0))) {
          if (!CodeGenMap.count(N1.getValue(1))) {

llvm-svn: 25763
 2006-01-29 04:41:05 +00:00
Chris Lattner
8624868903 Factor matching code that is common between patterns. This works around 
GCC not jump-threading across this common code, and produces far nicer
output.

llvm-svn: 25762
 2006-01-29 04:25:26 +00:00
Chris Lattner
f94049edf9 Split out code generation from analysis from emission 
llvm-svn: 25759
 2006-01-29 02:57:39 +00:00
Chris Lattner
6be3b584f4 move some code around, no change in the generated code 
llvm-svn: 25758
 2006-01-29 02:43:35 +00:00