- Jul 29, 2014
-
-
Jiangning Liu authored
llvm-svn: 214159
-
Jiangning Liu authored
llvm-svn: 214158
-
Duncan P. N. Exon Smith authored
Fix the sort of expected order in the reader to correctly return `false` when comparing a `Use` against itself. This was caught by test/Bitcode/binaryIntInstructions.3.2.ll, so I'm adding a `RUN` line using `llvm-uselistorder` for every test in `test/Bitcode` that passes. A few tests still fail, so I'll investigate those next. This is part of PR5680. llvm-svn: 214157
-
Duncan P. N. Exon Smith authored
A follow-up commit is adding a RUN line to each of these tests, so fix the line endings first. This is a whitespace-only change. llvm-svn: 214156
-
Duncan P. N. Exon Smith authored
llvm-svn: 214155
-
Rafael Espindola authored
It was added 12 years ago, but never used (and in the case of sort, never implemented). llvm-svn: 214150
-
Matt Arsenault authored
llvm-svn: 214147
-
Matt Arsenault authored
llvm-svn: 214146
-
Duncan P. N. Exon Smith authored
llvm-svn: 214144
-
Kevin Enderby authored
to just print the symbol name. So it matches darwin’s nm(1) -u option. llvm-svn: 214143
-
Manman Ren authored
llvm-svn: 214142
-
Manman Ren authored
The enum types array by design contains pointers to MDNodes rather than DIRefs. Unique them when handling the enum types in DwarfDebug. rdar://17628609 llvm-svn: 214139
-
Manman Ren authored
llvm-svn: 214137
-
Duncan P. N. Exon Smith authored
Since we're storing lots of these, save two-pointers per vector with a custom type rather than using the relatively heavy `SmallVector`. Part of PR5680. llvm-svn: 214135
-
Manman Ren authored
DITypeArray is an array of DITypeRef, at its creation, we will create DITypeRef (i.e use the identifier if the type node has an identifier). This is the last patch to unique the type array of a subroutine type. rdar://17628609 llvm-svn: 214132
-
Hans Wennborg authored
We branched 3.5, it's now time to work on 3.6. This is Sylvestre's patch from [1] plus regenerated configure file by me, and minus the release notes reset, which Sean pointed out [2] should happen later. 1. http://reviews.llvm.org/D4660 2. http://lists.cs.uiuc.edu/pipermail/cfe-commits/Week-of-Mon-20140721/111137.html llvm-svn: 214131
-
Eric Christopher authored
been updating configure. llvm-svn: 214129
-
- Jul 28, 2014
-
-
Duncan P. N. Exon Smith authored
Somehow this wasn't being built before (only noticed now since the test was XFAILed). llvm-svn: 214128
-
Duncan P. N. Exon Smith authored
Predict and serialize use-list order in bitcode. This makes the option `-preserve-bc-use-list-order` work *most* of the time, but this is still experimental. - Builds a full value-table up front in the writer, sets up a list of use-list orders to write out, and discards the table. This is a simpler first step than determining the order from the various overlapping IDs of values on-the-fly. - The shuffles stored in the use-list order list have an unnecessarily large memory footprint. - `blockaddress` expressions cause functions to be materialized out-of-order. For now I've ignored this problem, so use-list orders will be wrong for constants used by functions that have block addresses taken. There are a couple of ways to fix this, but I don't have a concrete plan yet. - When materializing functions lazily, the use-lists for constants will not be correct. This use case is out of scope: what should the use-list order be, if it's incomplete? This is part of PR5680. llvm-svn: 214125
-
Duncan P. N. Exon Smith authored
This is part of PR5680. llvm-svn: 214123
-
Duncan P. N. Exon Smith authored
This is part of PR5680. llvm-svn: 214122
-
Duncan P. N. Exon Smith authored
A follow-up commit for PR5680 needs to visit functions in reverse order. Expose iterators to allow that. llvm-svn: 214121
-
Lang Hames authored
llvm-svn: 214117
-
Rafael Espindola authored
llvm-svn: 214116
-
Manman Ren authored
Typedef DIArray to DITypedArray<DIDescriptor>. Also typedef DITypeArray as DITypedArray<DITypeRef>. This is the third of a series of patches to handle type uniqueing of the type array for a subroutine type. This commit should have no functionality change. llvm-svn: 214115
-
Manman Ren authored
This is the second of a series of patches to handle type uniqueing of the type array for a subroutine type. For vector and array types, getElements returns the array of subranges, so it is a better name than getTypeArray. Even for class, struct and enum types, getElements returns the members, which can be subprograms. setArrays can set up to two arrays, the second is the templates. This commit should have no functionality change. llvm-svn: 214112
-
Manman Ren authored
This is the first of a series of patches to handle type uniqueing of the type array for a subroutine type. This commit makes sure unspecified_parameter is a DIType to enable converting the type array for a subroutine type to an array of DITypes. This commit should have no functionality change. With this commit, we may change unspecified type to be a DITrivialType instead of a DIType. llvm-svn: 214111
-
Matt Arsenault authored
llvm-svn: 214108
-
Alex Lorenz authored
The gcov compatible code is moved to its own file and llvm-cov is updated to be a wrapper that always calls the gcov main function. llvm-svn: 214107
-
Matt Arsenault authored
All the others use bool, so these should too. llvm-svn: 214106
-
Chandler Carruth authored
inspection in the proccess, and shuffle the logging in the DAG combiner around a bit. With this it is much easier to follow what the legalizer is doing. It should even accurately present most of the strange legalization operations where a single node is replaced by multiple nodes, etc. There is still some information lost (we log SDNodes not SDValues so we don't log which result is used for which thing), but I think this is much closer to a usable system. Notably, this will make it *much* more apparant when legalization is actually happening inside the combiner, or when there is a cycle caused by interactions of the legalizer and the combiner. The "bug" I fixed here I'm not sure is remotely possible to trigger. We were only adding one of the nodes in a replacement to the updated set rather than all of the nodes in the replacement. Realistically, the worst result of this are nodes not getting back onto the worklist in the DAG combiner. I doubt it is possible to trigger this today, and I certainly don't have any ideas about how, but this at least brings the code into alignment with the principled operation of the routine. llvm-svn: 214105
-
Matt Arsenault authored
The default guess uses i32. This needs an address space argument to really do the right thing in all cases. llvm-svn: 214104
-
Rafael Espindola authored
llvm-svn: 214102
-
Matt Arsenault authored
llvm-svn: 214101
-
Matt Arsenault authored
llvm-svn: 214100
-
Rafael Espindola authored
llvm-svn: 214087
-
Robert Khasanov authored
Instructions: KAND{BWDQ}, KANDN{BWDQ}, KOR{BWDQ}, KXOR{BWDQ}, KXNOR{BWDQ} Reviewed by Elena Demikhovsky <elena.demikhovsky@intel.com> llvm-svn: 214081
-
Dan Liew authored
use is deprecated in favour of llvm_map_components_to_libnames() Although message(DEPRECATION "msg") would probably be a better fit this does nothing if CMAKE_ERROR_DEPRECATED and CMAKE_WARNING_DEPRECATED are both off, which is the default. llvm-svn: 214078
-
Dan Liew authored
libraries. With many contributions from Brad King. llvm-svn: 214077
-
Dan Liew authored
llvm-svn: 214076
-