- Apr 14, 2008
-
-
Nicolas Geoffray authored
llvm-svn: 49652
-
Chris Lattner authored
llvm-svn: 49651
-
Chris Lattner authored
Matthijs Kooijman llvm-svn: 49648
-
Ted Kremenek authored
llvm-svn: 49647
-
Dan Gohman authored
llvm-svn: 49646
-
Sam Bishop authored
intermixed. llvm-svn: 49645
-
Chris Lattner authored
a nice shiny B+ Tree variant. This fixes the last of the known algorithmic issues with the rewriter, allowing a significant speedup. For example, -emit-html on Ted's 500K .i file speeds up from 26.8s -> 0.64s in a debug build (41x!) and 5.475s -> 0.132s (41x!) in an optimized build. This code is functional but needs to be cleaned up, ifdefs removed, better commented, and moved to a .cpp file. I plan to do this tomorrow. llvm-svn: 49635
-
Duncan Sands authored
much simpler than in LegalizeDAG because calls are not yet expanded into call sequences: that happens after type legalization has finished. llvm-svn: 49634
-
Nate Begeman authored
llvm-svn: 49633
-
Nate Begeman authored
llvm-svn: 49632
-
Douglas Gregor authored
llvm-svn: 49631
-
Douglas Gregor authored
llvm-svn: 49629
-
Argyrios Kyrtzidis authored
llvm-svn: 49628
-
- Apr 13, 2008
-
-
Douglas Gregor authored
inheritance in C++. It'll parse the base-specifier list, e.g., class D : public B1, virtual public B2 { }; and do some of the simpler semantic checks (B1 and B2 are classes; they aren't unions or incomplete types, etc). llvm-svn: 49623
-
Douglas Gregor authored
llvm-svn: 49621
-
Chris Lattner authored
more nice. llvm-svn: 49619
-
Chris Lattner authored
improve the robustness of the test. llvm-svn: 49618
-
Chris Lattner authored
llvm-svn: 49617
-
Chris Lattner authored
llvm-svn: 49616
-
Douglas Gregor authored
llvm-svn: 49615
-
Owen Anderson authored
which is significantly more efficient. llvm-svn: 49614
-
Chris Lattner authored
allows the parsing of "class" in addition to "struct" and "union" to declare a record. So this patch allows: class C { }; class C c1; But it does not contain the lookup bits, so this won't work yet: C c2; Patch by Doug Gregor! llvm-svn: 49613
-
Duncan Sands authored
in its maps. Add some sanity checks that catch this kind of thing. Hopefully these can be removed one day (once all problems are fixed!) but for the moment it seems wise to have them in. llvm-svn: 49612
-
Nicolas Geoffray authored
llvm-svn: 49611
-
Owen Anderson authored
llvm-svn: 49610
-
Chris Lattner authored
This results in an (IMO) simpler algorithm, results in fewer splits, and is more amenable to delta handling (there is no reason to mutate the tree at all when adding a delta to a position that already exists in the tree). llvm-svn: 49609
-
Chris Lattner authored
llvm-svn: 49608
-
Chris Lattner authored
llvm-svn: 49607
-
Chris Lattner authored
llvm-svn: 49606
-
Duncan Sands authored
the result IRBuilder. Patch by Dominic Hamon. llvm-svn: 49604
-
Sam Bishop authored
Kirtzidis! llvm-svn: 49603
-
Chris Lattner authored
not # of operands as an input. llvm-svn: 49599
-
Chris Lattner authored
Doug Gregor! llvm-svn: 49598
-
Anton Korobeynikov authored
llvm-svn: 49593
-
Chris Lattner authored
llvm-svn: 49592
-
Chris Lattner authored
llvm-svn: 49591
-
- Apr 12, 2008
-
-
Chris Lattner authored
llvm-svn: 49587
-
Chris Lattner authored
(but simple!) datastructures in the rewriter with a more complex but more efficient one. This replaces the Deltas vector with a specialized BTree that makes delta lookups much more efficient. This speeds up -emit-html on a 500K .i file from 157.154 to 27.127 seconds on my machine (5.8x). While this code is functional, it isn't very pretty, I have much refactoring planned for it, and will remove the USE_VECTOR ifdef. Stay tuned. llvm-svn: 49586
-
Arnold Schwaighofer authored
optimized x86-64 (and x86) calls so that they work (... at least for my test cases). Should fix the following problems: Problem 1: When i introduced the optimized handling of arguments for tail called functions (using a sequence of copyto/copyfrom virtual registers instead of always lowering to top of the stack) i did not handle byval arguments correctly e.g they did not work at all :). Problem 2: On x86-64 after the arguments of the tail called function are moved to their registers (which include ESI/RSI etc), tail call optimization performs byval lowering which causes xSI,xDI, xCX registers to be overwritten. This is handled in this patch by moving the arguments to virtual registers first and after the byval lowering the arguments are moved from those virtual registers back to RSI/RDI/RCX. llvm-svn: 49584
-
Duncan Sands authored
llvm-svn: 49583
-