| Commit message (Collapse) | Author | Age | Files | Lines | ||
|---|---|---|---|---|---|---|
| ... | ||||||
| * | Add a couple of more functions that cannot access memory (the intrinsics) and | Chris Lattner | 2004-04-10 | 1 | -0/+7 | |
| | | | | | | | don't write to memory llvm-svn: 12808 | |||||
| * | Fix a bug Brian found. | Chris Lattner | 2004-04-07 | 1 | -2/+3 | |
| | | | | | llvm-svn: 12754 | |||||
| * | Sparc don't got not "sqrtl", bum bum bum | Chris Lattner | 2004-04-05 | 1 | -1/+1 | |
| | | | | | llvm-svn: 12670 | |||||
| * | Kill warnings during an optimized compile where assert() disappears. | Misha Brukman | 2004-04-05 | 1 | -0/+2 | |
| | | | | | llvm-svn: 12669 | |||||
| * | Fix PR312 and IndVarsSimplify/2004-04-05-InvokeCastCrash.llx | Chris Lattner | 2004-04-05 | 1 | -0/+2 | |
| | | | | | llvm-svn: 12668 | |||||
| * | Support getelementptr instructions which use uint's to index into structure | Chris Lattner | 2004-04-05 | 2 | -15/+37 | |
| | | | | | | | | types and can have arbitrary 32- and 64-bit integer types indexing into sequential types. llvm-svn: 12653 | |||||
| * | Implement test/Regression/Transforms/GCSE/undefined_load.ll | Chris Lattner | 2004-04-03 | 1 | -0/+14 | |
| | | | | | llvm-svn: 12641 | |||||
| * | Add a break in the default case | Chris Lattner | 2004-04-03 | 1 | -0/+1 | |
| | | | | | llvm-svn: 12639 | |||||
| * | Remove obsolete files | Chris Lattner | 2004-04-02 | 1 | -324/+0 | |
| | | | | | llvm-svn: 12633 | |||||
| * | Comment out debugging printouts | Chris Lattner | 2004-04-02 | 1 | -1/+5 | |
| | | | | | llvm-svn: 12623 | |||||
| * | Add a new analysis | Chris Lattner | 2004-04-02 | 1 | -0/+2482 | |
| | | | | | llvm-svn: 12619 | |||||
| * | Minor efficiency improvement, finegrainify namespacification | Chris Lattner | 2004-03-25 | 1 | -5/+10 | |
| | | | | | llvm-svn: 12517 | |||||
| * | Fix a HORRIBLY NASTY bug that caused siod to stop working last night. | Chris Lattner | 2004-03-17 | 1 | -1/+1 | |
| | | | | | llvm-svn: 12479 | |||||
| * | Add some missing functions. Make sure to handle calls together in case the | Chris Lattner | 2004-03-16 | 2 | -3/+21 | |
| | | | | | | | client has another VN implementation that can VN calls. llvm-svn: 12427 | |||||
| * | Ok, the assertion was bogus. Calls that do not read/write memory should not | Chris Lattner | 2004-03-15 | 1 | -0/+6 | |
| | | | | | | | have an alias set, just like adds and subtracts don't. llvm-svn: 12422 | |||||
| * | This assertion is bogus now that calls do not necessarily read/write memory | Chris Lattner | 2004-03-15 | 1 | -2/+0 | |
| | | | | | llvm-svn: 12421 | |||||
| * | Implement CSE of call instructions in the most trivial case. This implements | Chris Lattner | 2004-03-15 | 1 | -11/+139 | |
| | | | | | | | GCSE/call_cse.ll llvm-svn: 12419 | |||||
| * | Fix a minor bug, implementing GCSE/call_pure_function.ll | Chris Lattner | 2004-03-15 | 1 | -3/+6 | |
| | | | | | | | Also, add some stuff I missed before. llvm-svn: 12417 | |||||
| * | Don't be COMPLETELY pessimistic in the face of function calls | Chris Lattner | 2004-03-15 | 1 | -4/+20 | |
| | | | | | llvm-svn: 12413 | |||||
| * | Deinline some virtual methods, provide better mod/ref answers through the | Chris Lattner | 2004-03-15 | 1 | -5/+21 | |
| | | | | | | | use of the boolean queries llvm-svn: 12410 | |||||
| * | Pass through the boolean queries | Chris Lattner | 2004-03-15 | 1 | -0/+12 | |
| | | | | | llvm-svn: 12409 | |||||
| * | Teach basicaa about some stdc functions. | Chris Lattner | 2004-03-15 | 1 | -5/+100 | |
| | | | | | llvm-svn: 12408 | |||||
| * | Fix a tiny bug that caused an incorrect assertion failure poolallocating | Chris Lattner | 2004-03-13 | 1 | -4/+6 | |
| | | | | | | | boxed-sim. llvm-svn: 12358 | |||||
| * | Rename the intrinsic enum values for llvm.va_* from Intrinsic::va_* to | Chris Lattner | 2004-03-13 | 1 | -5/+3 | |
| | | | | | | | Intrinsic::va*. This avoid conflicting with macros in the stdlib.h file. llvm-svn: 12356 | |||||
| * | Fix a couple of minor problems. Because PHI nodes can use themselves, this | Chris Lattner | 2004-03-12 | 1 | -4/+1 | |
| | | | | | | | could cause infinite loops. Also, getUnderlyingObject can return null llvm-svn: 12351 | |||||
| * | Implement mod/ref analysis for a trivial case where locals don't escape. | Chris Lattner | 2004-03-12 | 1 | -0/+52 | |
| | | | | | | | | This comes up when you have a local array on the stack and you never pass the address of elements around. llvm-svn: 12349 | |||||
| * | Simplify code to process CallSites (thanks to Chris). | Misha Brukman | 2004-03-12 | 1 | -4/+2 | |
| | | | | | llvm-svn: 12334 | |||||
| * | Evaluate ModRef information in addition to regular ol' pointer analysis. | Misha Brukman | 2004-03-12 | 1 | -24/+93 | |
| | | | | | llvm-svn: 12331 | |||||
| * | Implement getModRefInfo() for DSA to calculate whether a function modifies or | Misha Brukman | 2004-03-12 | 1 | -5/+39 | |
| | | | | | | | references a pointer. llvm-svn: 12330 | |||||
| * | Make code more readable. | Misha Brukman | 2004-03-12 | 1 | -35/+31 | |
| | | | | | llvm-svn: 12305 | |||||
| * | Fix PR284: [indvars] Induction variable analysis violates LLVM invariants | Chris Lattner | 2004-03-10 | 1 | -1/+5 | |
| | | | | | llvm-svn: 12275 | |||||
| * | implement new method | Chris Lattner | 2004-03-09 | 1 | -0/+24 | |
| | | | | | llvm-svn: 12264 | |||||
| * | Switch to using edge profiling information as the basic source of profile info | Chris Lattner | 2004-03-08 | 2 | -5/+73 | |
| | | | | | | | from using basic block counts. llvm-svn: 12242 | |||||
| * | Refactor implementations | Chris Lattner | 2004-03-08 | 2 | -10/+3 | |
| | | | | | llvm-svn: 12240 | |||||
| * | Import the trace class from the reoptimizer | Chris Lattner | 2004-03-08 | 1 | -0/+50 | |
| | | | | | llvm-svn: 12236 | |||||
| * | If we have edge counts, we can produce block counts. I've verified that | Chris Lattner | 2004-03-08 | 1 | -11/+67 | |
| | | | | | | | | using an edge profile to produce block counts gives the exact same numbers as using a block count directly. llvm-svn: 12232 | |||||
| * | Add initial support for reading edge counts. This will be improved to enable | Chris Lattner | 2004-03-08 | 1 | -0/+29 | |
| | | | | | | | translation of edge counts into block/function counts when possible. llvm-svn: 12229 | |||||
| * | Fix a bug handling globals that are constants, but are still external | Chris Lattner | 2004-03-08 | 1 | -1/+1 | |
| | | | | | llvm-svn: 12208 | |||||
| * | Fix a minor bug | Chris Lattner | 2004-03-05 | 1 | -1/+2 | |
| | | | | | llvm-svn: 12169 | |||||
| * | Unbreak the build on Sparc. | Misha Brukman | 2004-03-05 | 1 | -0/+2 | |
| | | | | | llvm-svn: 12161 | |||||
| * | Fix a bug in a previous checkin that broke 175.vpr | Chris Lattner | 2004-03-04 | 1 | -1/+1 | |
| | | | | | llvm-svn: 12128 | |||||
| * | Add support for strto* and v*printf | Chris Lattner | 2004-03-04 | 1 | -0/+66 | |
| | | | | | llvm-svn: 12127 | |||||
| * | Add non-crappy support for varargs | Chris Lattner | 2004-03-04 | 1 | -6/+32 | |
| | | | | | llvm-svn: 12126 | |||||
| * | Implement a FIXME, improving the efficiency of DSA on povray. | Chris Lattner | 2004-03-04 | 1 | -2/+16 | |
| | | | | | | | | This reduces CBU time from 145s -> 122s (debug build), reduces # allocated nodes from 129420 to 116477. llvm-svn: 12125 | |||||
| * | Speed up the cbu pass from taking somewhere near the age of the universe to ↵ | Chris Lattner | 2004-03-04 | 1 | -6/+28 | |
| | | | | | | | about 90s on povray llvm-svn: 12123 | |||||
| * | Fix BU datastructures with povray! | Chris Lattner | 2004-03-04 | 1 | -11/+25 | |
| | | | | | | | | | The problem was that we were merging a field of a node with a value that was deleted. Thanks to bugpoint for reducing povray to a nice small 3 function example. :) llvm-svn: 12116 | |||||
| * | Minor changes, remove some debugging code that got checked in somehow. | Chris Lattner | 2004-03-04 | 1 | -7/+10 | |
| | | | | | | | | Make sure to scope the NodeMap passed into cloneInto so that it doesn't point to nodes that are deleted. Add some FIXME's for future performance enhancements. llvm-svn: 12115 | |||||
| * | Only clone nodes that are needed in the caller, don't clone ALL aux calls. ↵ | Chris Lattner | 2004-03-04 | 1 | -20/+48 | |
| | | | | | | | | | This improves povray from having ~600K nodes and 300K call nodes to 65K nodes and 25K call nodes. llvm-svn: 12109 | |||||
| * | Fix a minor bug handling incomplete programs | Chris Lattner | 2004-03-03 | 1 | -1/+1 | |
| | | | | | llvm-svn: 12105 | |||||
| * | Fix a DSA bug that caused DSA to generate incredibly huge graphs and take ↵ | Chris Lattner | 2004-03-03 | 1 | -1/+34 | |
| | | | | | | | | | | | forever to do it on povray. The problem is that we were not copying globals from callees to callers unless the existed in both graphs. We should have copied them in the case where the global pointed to a node that was copied as well. llvm-svn: 12104 | |||||

