Commit message (Collapse) | Author | Age | Files | Lines | |
---|---|---|---|---|---|
* | reduce redundant are's | Chris Lattner | 2010-01-20 | 1 | -1/+1 |
| | | | | llvm-svn: 94009 | ||||
* | Be more careful with anonymous namespaces, since Clang diagnoses the ↵ | Douglas Gregor | 2009-11-17 | 1 | -19/+9 |
| | | | | | | ambiguity here llvm-svn: 89054 | ||||
* | Remove tabs, and whitespace cleanups. | Mike Stump | 2009-09-09 | 1 | -53/+53 |
| | | | | llvm-svn: 81346 | ||||
* | Fix a corner case that ted hit in -emit-html, rdar://5863212 | Chris Lattner | 2008-04-15 | 1 | -1/+1 |
| | | | | llvm-svn: 49703 | ||||
* | Change the RewriteRope::Chunks data structure from an std::list into | Chris Lattner | 2008-04-14 | 1 | -6/+8 |
| | | | | | | | | | | | | 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 | ||||
* | Change the btree algorithm to split nodes bottom-up instead of top-down. | Chris Lattner | 2008-04-13 | 1 | -77/+115 |
| | | | | | | | | 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 | ||||
* | split node splitting from interior node restructuring. | Chris Lattner | 2008-04-13 | 1 | -37/+61 |
| | | | | llvm-svn: 49608 | ||||
* | final cleanup, the code is now in a reviewable state. | Chris Lattner | 2008-04-12 | 1 | -1/+6 |
| | | | | llvm-svn: 49592 | ||||
* | move the DeltaTree implementation out of line, remove debugging printfs etc. | Chris Lattner | 2008-04-12 | 1 | -0/+416 |
llvm-svn: 49591 |