| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | Fix up 'adding an intrinsic' section a bit, first draft of 'adding a new | Nate Begeman | 2006-01-16 | 1 | -36/+111 |
| | | | | | | | sdnode' section. llvm-svn: 25354 | ||||
| * | fix division! again!! pattern isel, prepare to die. | Duraid Madina | 2006-01-16 | 2 | -101/+118 |
| | | | | | llvm-svn: 25353 | ||||
| * | Silly Sparc is big endian. If we have to load args out of incoming stack slots | Chris Lattner | 2006-01-16 | 1 | -0/+4 |
| | | | | | | | | that are smaller than an int, make sure to adjust the frame pointer to take this into consideration. llvm-svn: 25351 | ||||
| * | This pass has been removed. | Chris Lattner | 2006-01-16 | 2 | -197/+0 |
| | | | | | llvm-svn: 25350 | ||||
| * | This pass has never worked correctly. Remove. | Chris Lattner | 2006-01-16 | 1 | -629/+0 |
| | | | | | llvm-svn: 25349 | ||||
| * | Remove a never-working pass | Chris Lattner | 2006-01-16 | 1 | -1/+0 |
| | | | | | llvm-svn: 25348 | ||||
| * | PRE is no more | Chris Lattner | 2006-01-16 | 1 | -1/+1 |
| | | | | | llvm-svn: 25347 | ||||
| * | Make sure that bool,byte and short arguments are the right type when loaded | Chris Lattner | 2006-01-15 | 1 | -0/+1 |
| | | | | | | | from memory. llvm-svn: 25346 | ||||
| * | Thanks to Daniel Berlin's ETForest fix, we can now use it again for the verifier | Chris Lattner | 2006-01-15 | 1 | -2/+0 |
| | | | | | llvm-svn: 25345 | ||||
| * | Initialize DFSnum's to -1, in case a node is not reachable. | Chris Lattner | 2006-01-15 | 1 | -2/+3 |
| | | | | | llvm-svn: 25344 | ||||
| * | add an assert, patch by Daniel Berlin | Chris Lattner | 2006-01-15 | 1 | -0/+1 |
| | | | | | llvm-svn: 25343 | ||||
| * | Added spec for insertelement operation. | Robert Bocchino | 2006-01-15 | 1 | -1/+54 |
| | | | | | llvm-svn: 25342 | ||||
| * | ET-Forest has issues with unreachable blocks. Temporarily disable verifiers use | Chris Lattner | 2006-01-15 | 1 | -0/+2 |
| | | | | | | | of it until they are resolved. llvm-svn: 25341 | ||||
| * | Disable a broken optimization | Chris Lattner | 2006-01-15 | 1 | -1/+2 |
| | | | | | llvm-svn: 25340 | ||||
| * | Disable two transformations that contribute to bus errors on SparcV8. | Chris Lattner | 2006-01-15 | 1 | -2/+6 |
| | | | | | llvm-svn: 25339 | ||||
| * | Added patterns for 8-bit multiply | Evan Cheng | 2006-01-15 | 1 | -2/+11 |
| | | | | | llvm-svn: 25338 | ||||
| * | Type inferencing bug | Evan Cheng | 2006-01-15 | 1 | -0/+2 |
| | | | | | llvm-svn: 25337 | ||||
| * | explain that r12 is the stack pointer reg | Duraid Madina | 2006-01-15 | 2 | -33/+5 |
| | | | | | llvm-svn: 25336 | ||||
| * | Don't print a label for the first MBB in a function. | Chris Lattner | 2006-01-15 | 2 | -5/+13 |
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | Compile this: %_2E_str_8 = external global [75 x sbyte] implementation ; Functions: declare int %printf(sbyte*, ...) void %test() %tmp.101 = call int (sbyte*, ...)* %printf( sbyte* getelementptr ([75 x sbyte]* %_2E_str_8, int 0, int 0) ) ; <int> [#uses=0] unreachable } to this: main_endif_2E_8: save -96, %o6, %o6 sethi %hi(_2E_str_8), %l0 add %l0, %lo(_2E_str_8), %o0 call printf nop instead of this: main_endif_2E_8: save -96, %o6, %o6 sethi %hi(_2E_str_8), %l0 or %g0, %lo(_2E_str_8), %l1 ;; extra instruction add %l1, %l0, %o0 call printf nop llvm-svn: 25335 | ||||
| * | Use the default impl of DYNAMIC_STACKALLOC, allowing us to delete some code. | Chris Lattner | 2006-01-15 | 2 | -41/+4 |
| | | | | | llvm-svn: 25334 | ||||
| * | Use the default lowering of ISD::DYNAMIC_STACKALLOC, delete now dead code. | Chris Lattner | 2006-01-15 | 3 | -84/+4 |
| | | | | | llvm-svn: 25333 | ||||
| * | Have legalize take care of DYNAMIC_STACKALLOC for us, implement ↵ | Chris Lattner | 2006-01-15 | 1 | -18/+4 |
| | | | | | | | llvm.stacksave/stackrestore. llvm-svn: 25332 | ||||
| * | Allow the target to specify 'expand' if they just require the amount to | Chris Lattner | 2006-01-15 | 1 | -9/+19 |
| | | | | | | | be subtracted from the stack pointer. llvm-svn: 25331 | ||||
| * | Implement DYNAMIC_STACKALLOC for V8 | Chris Lattner | 2006-01-15 | 1 | -1/+18 |
| | | | | | llvm-svn: 25330 | ||||
| * | Fix custom lowering of dynamic_stackalloc | Chris Lattner | 2006-01-15 | 1 | -6/+9 |
| | | | | | llvm-svn: 25329 | ||||
| * | add a missing break that Reid noticed. | Chris Lattner | 2006-01-15 | 1 | -0/+1 |
| | | | | | llvm-svn: 25328 | ||||
| * | add a missing node name | Chris Lattner | 2006-01-15 | 1 | -0/+1 |
| | | | | | llvm-svn: 25327 | ||||
| * | reorder passes | Chris Lattner | 2006-01-15 | 1 | -4/+6 |
| | | | | | llvm-svn: 25326 | ||||
| * | Token chain results are not always the first or last result. Consider ↵ | Chris Lattner | 2006-01-14 | 1 | -3/+17 |
| | | | | | | | copyfromreg nodes, where they are the middle result (the flag result is last) llvm-svn: 25325 | ||||
| * | Cleanup IA64ISD, tell the graph drawer what the symbolic names for the enums ↵ | Chris Lattner | 2006-01-14 | 2 | -14/+11 |
| | | | | | | | are. llvm-svn: 25324 | ||||
| * | Change ET-Forest to automatically recalculate its DFSnum's if too many slow | Chris Lattner | 2006-01-14 | 4 | -14/+41 |
| | | | | | | | | | queries are made. Patch by Daniel Berlin! llvm-svn: 25323 | ||||
| * | silence a warning | Chris Lattner | 2006-01-14 | 1 | -0/+1 |
| | | | | | llvm-svn: 25322 | ||||
| * | Let the inliner update the callgraph to reflect the changes it makes, instead | Chris Lattner | 2006-01-14 | 1 | -12/+2 |
| | | | | | | | of doing it ourselves. This fixes Transforms/Inline/2006-01-14-CallGraphUpdate.ll llvm-svn: 25321 | ||||
| * | Teach the inliner to update the CallGraph itself, and have it add edges to | Chris Lattner | 2006-01-14 | 1 | -4/+53 |
| | | | | | | | llvm.stacksave/restore when it inserts calls to them. llvm-svn: 25320 | ||||
| * | New testcase for a regression last night: the -inline pass wasn't updating | Chris Lattner | 2006-01-14 | 1 | -0/+26 |
| | | | | | | | | callgraph to include new edges do to inserted llvm.stacksave/llvm.stackrestore calls. llvm-svn: 25319 | ||||
| * | Teach inline function how to update the callgraph when it makes changes. | Chris Lattner | 2006-01-14 | 1 | -9/+13 |
| | | | | | llvm-svn: 25318 | ||||
| * | Add a new CallGraph::getOrInsertFunction for clients to use when updating | Chris Lattner | 2006-01-14 | 1 | -16/+19 |
| | | | | | | | the callgraph. llvm-svn: 25317 | ||||
| * | Add CallGraph::getOrInsertFunction, to allow clients to update the callgraph | Chris Lattner | 2006-01-14 | 1 | -0/+5 |
| | | | | | | | when they change the program llvm-svn: 25316 | ||||
| * | FunctionPass's cannot do IPO things. | Chris Lattner | 2006-01-14 | 1 | -4/+0 |
| | | | | | llvm-svn: 25315 | ||||
| * | add a dump method to CallGraph | Chris Lattner | 2006-01-14 | 2 | -1/+6 |
| | | | | | llvm-svn: 25314 | ||||
| * | Remove some duplicated code | Nate Begeman | 2006-01-14 | 1 | -8/+0 |
| | | | | | llvm-svn: 25313 | ||||
| * | bswap implementation | Nate Begeman | 2006-01-14 | 11 | -2/+118 |
| | | | | | llvm-svn: 25312 | ||||
| * | Fix generous source of VC++ truncation warnings. | Jeff Cohen | 2006-01-14 | 1 | -2/+2 |
| | | | | | llvm-svn: 25311 | ||||
| * | Fix the instructions for adding an intrinsic. | Nate Begeman | 2006-01-14 | 1 | -3/+7 |
| | | | | | llvm-svn: 25310 | ||||
| * | Add bswap intrinsics as documented in the Language Reference | Nate Begeman | 2006-01-14 | 8 | -10/+114 |
| | | | | | llvm-svn: 25309 | ||||
| * | Remove some redundant stuff out of the readme. | Nate Begeman | 2006-01-14 | 1 | -18/+0 |
| | | | | | llvm-svn: 25308 | ||||
| * | A typo. | Evan Cheng | 2006-01-14 | 1 | -1/+1 |
| | | | | | llvm-svn: 25307 | ||||
| * | testcase for PR676: http://llvm.cs.uiuc.edu/PR676 | Jim Laskey | 2006-01-14 | 1 | -0/+9 |
| | | | | | llvm-svn: 25306 | ||||
| * | Implement a new InvalidateStructLayoutInfo method and add some comments | Chris Lattner | 2006-01-14 | 1 | -0/+18 |
| | | | | | llvm-svn: 25304 | ||||
| * | Add a new InvalidateStructLayoutInfo method and some comments. | Chris Lattner | 2006-01-14 | 1 | -0/+9 |
| | | | | | llvm-svn: 25303 | ||||

