| Commit message (Collapse) | Author | Age | Files | Lines | ||
|---|---|---|---|---|---|---|
| ... | ||||||
| * | Don't eliminate bitcast instructions that change the type of a pointer | Nate Begeman | 2008-03-31 | 2 | -19/+26 | |
| | | | | | llvm-svn: 48971 | |||||
| * | Tweak build system to allow for installing the tutorial and uninstalling the ↵ | Erick Tryzelaar | 2008-03-30 | 3 | -3/+35 | |
| | | | | | | | docs. llvm-svn: 48968 | |||||
| * | Fix comment typo. | Duncan Sands | 2008-03-30 | 1 | -1/+1 | |
| | | | | | llvm-svn: 48967 | |||||
| * | Fix some documentation for the tutorial. | Erick Tryzelaar | 2008-03-30 | 2 | -40/+40 | |
| | | | | | llvm-svn: 48966 | |||||
| * | Moved from PR1570. | Nick Lewycky | 2008-03-30 | 1 | -0/+26 | |
| | | | | | llvm-svn: 48965 | |||||
| * | stop building llvmc. | Chris Lattner | 2008-03-30 | 1 | -1/+1 | |
| | | | | | llvm-svn: 48964 | |||||
| * | Fix "Control reaches the end of non-void function" warnings, | Chris Lattner | 2008-03-30 | 11 | -0/+19 | |
| | | | | | | | patch by David Chisnall. llvm-svn: 48963 | |||||
| * | minor code cleanups, allow constant folding sinf/cosf. | Chris Lattner | 2008-03-30 | 1 | -20/+26 | |
| | | | | | llvm-svn: 48961 | |||||
| * | fix typo, PR2181 | Chris Lattner | 2008-03-30 | 1 | -2/+2 | |
| | | | | | llvm-svn: 48954 | |||||
| * | Add chapter 3 and 4 of the ocaml/kaleidoscope tutorial. | Erick Tryzelaar | 2008-03-30 | 2 | -0/+2115 | |
| | | | | | llvm-svn: 48949 | |||||
| * | Cosmetic changes. | Evan Cheng | 2008-03-29 | 1 | -24/+3 | |
| | | | | | llvm-svn: 48947 | |||||
| * | Honour another bunch of parameter attributes in llvm2cpp | Anton Korobeynikov | 2008-03-29 | 1 | -0/+8 | |
| | | | | | llvm-svn: 48942 | |||||
| * | Honour ByVal parameter attribute in llvm2cpp | Anton Korobeynikov | 2008-03-29 | 1 | -0/+2 | |
| | | | | | llvm-svn: 48941 | |||||
| * | change iterator invalidation avoidance to just move the iterator backward | Chris Lattner | 2008-03-29 | 1 | -18/+25 | |
| | | | | | | | | | | | | | | | | | | | | | | when something changes, instead of moving forward. This allows us to simplify memset lowering, inserting the memset at the end of the range of stuff we're touching instead of at the start. This, in turn, allows us to make use of the addressing instructions already used in the function instead of inserting our own. For example, we now codegen: %tmp41 = getelementptr [8 x i8]* %ref_idx, i32 0, i32 0 ; <i8*> [#uses=2] call void @llvm.memset.i64( i8* %tmp41, i8 -1, i64 8, i32 1 ) instead of: %tmp20 = getelementptr [8 x i8]* %ref_idx, i32 0, i32 7 ; <i8*> [#uses=1] %ptroffset = getelementptr i8* %tmp20, i64 -7 ; <i8*> [#uses=1] call void @llvm.memset.i64( i8* %ptroffset, i8 -1, i64 8, i32 1 ) llvm-svn: 48940 | |||||
| * | make the common case of a single store (which clearly shouldn't be turned | Chris Lattner | 2008-03-29 | 1 | -3/+12 | |
| | | | | | | | into a memset!) faster by avoiding an allocation of an std::list node. llvm-svn: 48939 | |||||
| * | add a testcase for forming memset from noncontiguous stores. | Chris Lattner | 2008-03-29 | 2 | -1/+100 | |
| | | | | | llvm-svn: 48938 | |||||
| * | give form-memset a significantly more sane heuristic, enable it by default. | Chris Lattner | 2008-03-29 | 1 | -7/+49 | |
| | | | | | llvm-svn: 48937 | |||||
| * | Remove some unneeded code for LiveInterval joining, and fix a bug in the Phi ↵ | Owen Anderson | 2008-03-29 | 1 | -58/+25 | |
| | | | | | | | | | elimination algorithm where we were accidentally reasoning about the source rather than the destination. llvm-svn: 48936 | |||||
| * | Cosmetic change. | Evan Cheng | 2008-03-29 | 1 | -1/+1 | |
| | | | | | llvm-svn: 48935 | |||||
| * | Fix a tokenfactor node to use the load chain rather than the | Dan Gohman | 2008-03-28 | 2 | -1/+36 | |
| | | | | | | | load value. This fixes PR2177. llvm-svn: 48932 | |||||
| * | Backing out 48911 for now. It's breaking stuff. | Evan Cheng | 2008-03-28 | 1 | -12/+8 | |
| | | | | | llvm-svn: 48922 | |||||
| * | ifdef out a dead function. Should this be removed? | Chris Lattner | 2008-03-28 | 1 | -0/+2 | |
| | | | | | llvm-svn: 48916 | |||||
| * | Rename getAnyLoad to getLoad is suggested by Evan. | Duncan Sands | 2008-03-28 | 3 | -22/+22 | |
| | | | | | llvm-svn: 48914 | |||||
| * | New entry. | Evan Cheng | 2008-03-28 | 1 | -0/+44 | |
| | | | | | llvm-svn: 48912 | |||||
| * | Load from stub is already re-materializable. | Evan Cheng | 2008-03-28 | 1 | -8/+12 | |
| | | | | | llvm-svn: 48911 | |||||
| * | Update example to new syntax. | Nick Lewycky | 2008-03-28 | 2 | -3/+9 | |
| | | | | | llvm-svn: 48910 | |||||
| * | make memset inference significantly more powerful: it can now handle | Chris Lattner | 2008-03-28 | 1 | -82/+184 | |
| | | | | | | | | | | | memsets that initialize "structs of arrays" and other store sequences that are not sequential. This is still only enabled if you pass -form-memset-from-stores. The flag is not heavily tested and I haven't analyzed the perf regressions when -form-memset-from-stores is passed either, but this causes no make check regressions. llvm-svn: 48909 | |||||
| * | New entry. | Evan Cheng | 2008-03-28 | 1 | -0/+2 | |
| | | | | | llvm-svn: 48908 | |||||
| * | Simplify the conversion from "0x" numbers to a single digit number. | Bill Wendling | 2008-03-28 | 1 | -17/+1 | |
| | | | | | llvm-svn: 48907 | |||||
| * | Implement LegalizeTypes support for softfloat LOAD. | Duncan Sands | 2008-03-27 | 4 | -78/+69 | |
| | | | | | | | | | In order to handle indexed nodes I had to introduce a new constructor, and since I was there I factorized the code in the various load constructors. llvm-svn: 48894 | |||||
| * | Avoid creating chain dependencies from CopyToReg nodes to load and store | Dan Gohman | 2008-03-27 | 2 | -56/+73 | |
| | | | | | | | | | | | | | | | | | | | nodes. This doesn't currently have much impact the generated code, but it does produce simpler-looking SelectionDAGs, and consequently simpler-looking ScheduleDAGs, because there are fewer spurious dependencies. In particular, CopyValueToVirtualRegister now uses the entry node as the input chain dependency for new CopyToReg nodes instead of calling getRoot and depending on the most recent memory reference. Also, rename UnorderedChains to PendingExports and pull it up from being a local variable in SelectionDAGISel::BuildSelectionDAG to being a member variable of SelectionDAGISel, so that it doesn't have to be passed around to all the places that need it. llvm-svn: 48893 | |||||
| * | PHI->removeIncomingValue may remove PHInode. | Devang Patel | 2008-03-27 | 1 | -1/+2 | |
| | | | | | | | Increment iterator in advance. llvm-svn: 48890 | |||||
| * | add another testcase | Devang Patel | 2008-03-27 | 1 | -0/+13 | |
| | | | | | llvm-svn: 48881 | |||||
| * | Fix build breakage on Windows with GCC 4.3. References bug #2176. | Mikhail Glushenkov | 2008-03-27 | 1 | -1/+1 | |
| | | | | | llvm-svn: 48874 | |||||
| * | Fix spelling. Thanks, Duncan! :-) | Roman Levenstein | 2008-03-27 | 1 | -1/+1 | |
| | | | | | llvm-svn: 48873 | |||||
| * | Speed-up the SumOfUnscheduledPredsOfSuccs by introducing a new function | Roman Levenstein | 2008-03-27 | 1 | -2/+25 | |
| | | | | | | | | | | | called LimitedSumOfUnscheduledPredsOfSuccs. It terminates the computation after a given treshold is reached. This new function is always faster, but brings real wins only on bigger test-cases. The old function SumOfUnscheduledPredsOfSuccs is left in-place for now and therefore a warning about an unused static function is produced. llvm-svn: 48872 | |||||
| * | Adding the first two chapters of the ocaml/kaleidoscope tutorial. | Erick Tryzelaar | 2008-03-27 | 3 | -0/+1421 | |
| | | | | | llvm-svn: 48871 | |||||
| * | when a node is removed from an ilist, set its next/prev pointers to | Chris Lattner | 2008-03-27 | 1 | -0/+8 | |
| | | | | | | | | | | | null. This means that uses of invalidated iterators will explode violently with: ilist:143: failed assertion `NodePtr && "++'d off the end of an ilist!"' instead of happening to work "most of the time". llvm-svn: 48859 | |||||
| * | New test case. | Devang Patel | 2008-03-27 | 1 | -0/+7 | |
| | | | | | llvm-svn: 48858 | |||||
| * | Code clean up. | Evan Cheng | 2008-03-27 | 1 | -14/+16 | |
| | | | | | llvm-svn: 48856 | |||||
| * | Allow certain lea instructions to be rematerialized. | Evan Cheng | 2008-03-27 | 3 | -35/+68 | |
| | | | | | llvm-svn: 48855 | |||||
| * | Remove an unused command line option. | Evan Cheng | 2008-03-27 | 1 | -6/+0 | |
| | | | | | llvm-svn: 48854 | |||||
| * | Fix a memory bug: increment an iterator of a deleted machine instr. | Evan Cheng | 2008-03-27 | 2 | -2/+31 | |
| | | | | | llvm-svn: 48853 | |||||
| * | Expose ExecutionEngine::getTargetData() to c and ocaml bindings. | Erick Tryzelaar | 2008-03-27 | 6 | -2/+24 | |
| | | | | | llvm-svn: 48851 | |||||
| * | Updating win32 VStudio project files with new file references and removing ↵ | Chuck Rose III | 2008-03-27 | 4 | -29/+37 | |
| | | | | | | | dead references. llvm-svn: 48849 | |||||
| * | Fix a bug in Darwin EH: FDE->CIE pointer must | Dale Johannesen | 2008-03-26 | 2 | -15/+18 | |
| | | | | | | | be relocatable. Describe why .set is needed better. llvm-svn: 48848 | |||||
| * | Another test commit (with git-svn) | Mikhail Glushenkov | 2008-03-26 | 2 | -0/+4 | |
| | | | | | llvm-svn: 48843 | |||||
| * | Test commit | Mikhail Glushenkov | 2008-03-26 | 1 | -9/+0 | |
| | | | | | llvm-svn: 48840 | |||||
| * | One more coalescer fix wrt deadness propagation. | Evan Cheng | 2008-03-26 | 2 | -14/+50 | |
| | | | | | llvm-svn: 48837 | |||||
| * | Avoid commuting a def MI in order to coalesce a copy instruction away if any ↵ | Evan Cheng | 2008-03-26 | 3 | -2/+62 | |
| | | | | | | | use of the same val# is a copy instruction that has already been coalesced. llvm-svn: 48833 | |||||

