2014-11-08 00:08:19 +08:00
|
|
|
set(system_libs)
|
2016-02-10 03:41:14 +08:00
|
|
|
if( MSVC OR MINGW )
|
|
|
|
# libuuid required for FOLDERID_Profile usage in lib/Support/Windows/Path.inc.
|
|
|
|
set(system_libs ${system_libs} psapi shell32 ole32 uuid)
|
|
|
|
elseif( CMAKE_HOST_UNIX )
|
|
|
|
if( HAVE_LIBRT )
|
|
|
|
set(system_libs ${system_libs} rt)
|
|
|
|
endif()
|
|
|
|
if( HAVE_LIBDL )
|
|
|
|
set(system_libs ${system_libs} ${CMAKE_DL_LIBS})
|
|
|
|
endif()
|
2017-04-12 21:51:00 +08:00
|
|
|
if( HAVE_BACKTRACE )
|
|
|
|
set(system_libs ${system_libs} ${Backtrace_LIBRARIES})
|
|
|
|
endif()
|
2016-02-10 03:41:14 +08:00
|
|
|
if(LLVM_ENABLE_TERMINFO)
|
|
|
|
if(HAVE_TERMINFO)
|
|
|
|
set(system_libs ${system_libs} ${TERMINFO_LIBS})
|
2014-11-08 00:08:19 +08:00
|
|
|
endif()
|
2016-02-10 03:41:14 +08:00
|
|
|
endif()
|
|
|
|
if( LLVM_ENABLE_THREADS AND HAVE_LIBATOMIC )
|
|
|
|
set(system_libs ${system_libs} atomic)
|
|
|
|
endif()
|
2017-02-10 09:59:20 +08:00
|
|
|
set(system_libs ${system_libs} ${LLVM_PTHREAD_LIB})
|
2016-02-10 03:41:14 +08:00
|
|
|
if ( LLVM_ENABLE_ZLIB AND HAVE_LIBZ )
|
|
|
|
set(system_libs ${system_libs} z)
|
|
|
|
endif()
|
2016-02-27 01:01:45 +08:00
|
|
|
if( UNIX AND NOT (BEOS OR HAIKU) )
|
|
|
|
set(system_libs ${system_libs} m)
|
|
|
|
endif()
|
2016-02-10 03:41:14 +08:00
|
|
|
endif( MSVC OR MINGW )
|
2014-11-08 00:08:19 +08:00
|
|
|
|
2008-09-22 09:08:49 +08:00
|
|
|
add_llvm_library(LLVMSupport
|
2017-06-07 02:35:50 +08:00
|
|
|
AMDGPUCodeObjectMetadata.cpp
|
2008-09-22 09:08:49 +08:00
|
|
|
APFloat.cpp
|
|
|
|
APInt.cpp
|
|
|
|
APSInt.cpp
|
2014-01-19 16:25:27 +08:00
|
|
|
ARMBuildAttrs.cpp
|
2017-01-13 18:50:01 +08:00
|
|
|
ARMAttributeParser.cpp
|
2014-06-02 09:17:49 +08:00
|
|
|
ARMWinEH.cpp
|
2008-09-22 09:08:49 +08:00
|
|
|
Allocator.cpp
|
2017-03-03 04:52:51 +08:00
|
|
|
BinaryStreamError.cpp
|
|
|
|
BinaryStreamReader.cpp
|
[BinaryStream] Reduce the amount of boiler plate needed to use.
Often you have an array and you just want to use it. With the current
design, you have to first construct a `BinaryByteStream`, and then create
a `BinaryStreamRef` from it. Worse, the `BinaryStreamRef` holds a pointer
to the `BinaryByteStream`, so you can't just create a temporary one to
appease the compiler, you have to actually hold onto both the `ArrayRef`
as well as the `BinaryByteStream` *AND* the `BinaryStreamReader` on top of
that. This makes for very cumbersome code, often requiring one to store a
`BinaryByteStream` in a class just to circumvent this.
At the cost of some added complexity (not exposed to users, but internal
to the library), we can do better than this. This patch allows us to
construct `BinaryStreamReaders` and `BinaryStreamWriters` directly from
source data (e.g. `StringRef`, `MutableArrayRef<uint8_t>`, etc). Not only
does this reduce the amount of code you have to type and make it more
obvious how to use it, but it solves real lifetime issues when it's
inconvenient to hold onto a `BinaryByteStream` for a long time.
The additional complexity is in the form of an added layer of indirection.
Whereas before we simply stored a `BinaryStream*` in the ref, we now store
both a `BinaryStream*` **and** a `std::shared_ptr<BinaryStream>`. When
the user wants to construct a `BinaryStreamRef` directly from an
`ArrayRef` etc, we allocate an internal object that holds ownership over a
`BinaryByteStream` and forwards all calls, and store this in the
`shared_ptr<>`. This also maintains the ref semantics, as you can copy it
by value and references refer to the same underlying stream -- the one
being held in the object stored in the `shared_ptr`.
Differential Revision: https://reviews.llvm.org/D33293
llvm-svn: 303294
2017-05-18 04:23:31 +08:00
|
|
|
BinaryStreamRef.cpp
|
2017-03-03 04:52:51 +08:00
|
|
|
BinaryStreamWriter.cpp
|
2011-07-26 06:24:51 +08:00
|
|
|
BlockFrequency.cpp
|
2011-06-11 09:05:22 +08:00
|
|
|
BranchProbability.cpp
|
2016-04-02 11:28:26 +08:00
|
|
|
CachePruning.cpp
|
2009-12-24 01:03:46 +08:00
|
|
|
circular_raw_ostream.cpp
|
2016-10-20 20:05:50 +08:00
|
|
|
Chrono.cpp
|
2015-04-28 01:19:26 +08:00
|
|
|
COM.cpp
|
2008-09-22 09:08:49 +08:00
|
|
|
CommandLine.cpp
|
2013-04-23 16:28:39 +08:00
|
|
|
Compression.cpp
|
2016-09-30 08:38:45 +08:00
|
|
|
ConvertUTF.cpp
|
2013-01-30 20:05:05 +08:00
|
|
|
ConvertUTFWrapper.cpp
|
2010-07-29 01:17:46 +08:00
|
|
|
CrashRecoveryContext.cpp
|
2011-09-14 03:42:16 +08:00
|
|
|
DataExtractor.cpp
|
2008-09-22 09:08:49 +08:00
|
|
|
Debug.cpp
|
Add initial support for debug counting
Summary:
We have support for bisection, and bugpoint can reduce testcases
often to a single pass. But that doesn't help reduce it to a single
transform by a single pass. Which debug counting lets us do.
Debug counting lets you instrument a pass so that it only executes a
certain thing (rwhatever you want) after skipping it a certain time of
times, and then only does a certain number of executions before saying
"skip" again.
To make it concrete, for predicateinfo, if i instrument use renaming,
i can make it so it skips renaming the first N uses, renames the next
N, and then skips the rest.
This lets you narrow down a miscompilation to, often, a single
transformation, and then also debug it (by using the same command line
parameters).
Reviewers: chandlerc, davide, mehdi_amini
Subscribers: mgorny, llvm-commits
Differential Revision: https://reviews.llvm.org/D29998
llvm-svn: 295593
2017-02-19 12:28:56 +08:00
|
|
|
DebugCounter.cpp
|
2009-12-03 19:12:42 +08:00
|
|
|
DeltaAlgorithm.cpp
|
2010-06-09 00:21:22 +08:00
|
|
|
DAGDeltaAlgorithm.cpp
|
2016-03-24 07:57:28 +08:00
|
|
|
Error.cpp
|
2009-07-08 02:52:14 +08:00
|
|
|
ErrorHandling.cpp
|
2008-09-22 09:08:49 +08:00
|
|
|
FileUtilities.cpp
|
2012-08-01 10:29:50 +08:00
|
|
|
FileOutputBuffer.cpp
|
2008-09-22 09:08:49 +08:00
|
|
|
FoldingSet.cpp
|
2009-07-15 04:44:17 +08:00
|
|
|
FormattedStream.cpp
|
2016-11-12 07:57:40 +08:00
|
|
|
FormatVariadic.cpp
|
2016-12-21 07:09:09 +08:00
|
|
|
GlobPattern.cpp
|
2008-09-22 09:08:49 +08:00
|
|
|
GraphWriter.cpp
|
Rewrite LLVM's generalized support library for hashing to follow the API
of the proposed standard hashing interfaces (N3333), and to use
a modified and tuned version of the CityHash algorithm.
Some of the highlights of this change:
-- Significantly higher quality hashing algorithm with very well
distributed results, and extremely few collisions. Should be close to
a checksum for up to 64-bit keys. Very little clustering or clumping of
hash codes, to better distribute load on probed hash tables.
-- Built-in support for reserved values.
-- Simplified API that composes cleanly with other C++ idioms and APIs.
-- Better scaling performance as keys grow. This is the fastest
algorithm I've found and measured for moderately sized keys (such as
show up in some of the uniquing and folding use cases)
-- Support for enabling per-execution seeds to prevent table ordering
or other artifacts of hashing algorithms to impact the output of
LLVM. The seeding would make each run different and highlight these
problems during bootstrap.
This implementation was tested extensively using the SMHasher test
suite, and pased with flying colors, doing better than the original
CityHash algorithm even.
I've included a unittest, although it is somewhat minimal at the moment.
I've also added (or refactored into the proper location) type traits
necessary to implement this, and converted users of GeneralHash over.
My only immediate concerns with this implementation is the performance
of hashing small keys. I've already started working to improve this, and
will continue to do so. Currently, the only algorithms faster produce
lower quality results, but it is likely there is a better compromise
than the current one.
Many thanks to Jeffrey Yasskin who did most of the work on the N3333
paper, pair-programmed some of this code, and reviewed much of it. Many
thanks also go to Geoff Pike Pike and Jyrki Alakuijala, the original
authors of CityHash on which this is heavily based, and Austin Appleby
who created MurmurHash and the SMHasher test suite.
Also thanks to Nadav, Tobias, Howard, Jay, Nick, Ahmed, and Duncan for
all of the review comments! If there are further comments or concerns,
please let me know and I'll jump on 'em.
llvm-svn: 151822
2012-03-02 02:55:25 +08:00
|
|
|
Hashing.cpp
|
2010-12-21 08:04:46 +08:00
|
|
|
IntEqClasses.cpp
|
2010-11-19 12:47:19 +08:00
|
|
|
IntervalMap.cpp
|
2015-09-02 05:23:58 +08:00
|
|
|
JamCRC.cpp
|
2014-02-22 23:39:39 +08:00
|
|
|
LEB128.cpp
|
2013-12-27 12:28:57 +08:00
|
|
|
LineIterator.cpp
|
2012-04-18 04:03:03 +08:00
|
|
|
Locale.cpp
|
2012-01-30 04:15:10 +08:00
|
|
|
LockFileManager.cpp
|
Recommit: [globalisel] Change LLT constructor string into an LLT-based object that knows how to generate it.
Summary:
This will allow future patches to inspect the details of the LLT. The implementation is now split between
the Support and CodeGen libraries to allow TableGen to use this class without introducing layering concerns.
Thanks to Ahmed Bougacha for finding a reasonable way to avoid the layering issue and providing the version of this patch without that problem.
The problem with the previous commit appears to have been that TableGen was including CodeGen/LowLevelType.h instead of Support/LowLevelTypeImpl.h.
Reviewers: t.p.northover, qcolombet, rovka, aditya_nandakumar, ab, javed.absar
Subscribers: arsenm, nhaehnle, mgorny, dberris, llvm-commits, kristof.beyls
Differential Revision: https://reviews.llvm.org/D30046
llvm-svn: 297241
2017-03-08 07:20:35 +08:00
|
|
|
LowLevelType.cpp
|
2008-09-22 09:08:49 +08:00
|
|
|
ManagedStatic.cpp
|
2014-09-27 22:41:29 +08:00
|
|
|
MathExtras.cpp
|
2008-09-22 09:08:49 +08:00
|
|
|
MemoryBuffer.cpp
|
2013-05-21 09:30:38 +08:00
|
|
|
MD5.cpp
|
2016-10-12 03:24:45 +08:00
|
|
|
NativeFormatting.cpp
|
2014-10-16 05:54:35 +08:00
|
|
|
Options.cpp
|
2017-05-11 08:03:52 +08:00
|
|
|
Parallel.cpp
|
2008-09-22 09:08:49 +08:00
|
|
|
PluginLoader.cpp
|
2009-03-05 17:19:13 +08:00
|
|
|
PrettyStackTrace.cpp
|
2014-06-25 23:21:42 +08:00
|
|
|
RandomNumberGenerator.cpp
|
2009-09-02 01:01:02 +08:00
|
|
|
Regex.cpp
|
2014-06-21 05:47:47 +08:00
|
|
|
ScaledNumber.cpp
|
2016-05-03 08:28:04 +08:00
|
|
|
ScopedPrinter.cpp
|
2016-04-01 12:30:16 +08:00
|
|
|
SHA1.cpp
|
2008-09-22 09:08:49 +08:00
|
|
|
SmallPtrSet.cpp
|
2009-12-16 16:44:24 +08:00
|
|
|
SmallVector.cpp
|
2009-06-21 11:41:50 +08:00
|
|
|
SourceMgr.cpp
|
2014-07-10 03:40:08 +08:00
|
|
|
SpecialCaseList.cpp
|
2008-09-22 09:08:49 +08:00
|
|
|
Statistic.cpp
|
|
|
|
StringExtras.cpp
|
|
|
|
StringMap.cpp
|
|
|
|
StringPool.cpp
|
2015-06-13 20:49:52 +08:00
|
|
|
StringSaver.cpp
|
2009-09-17 06:38:48 +08:00
|
|
|
StringRef.cpp
|
2008-09-22 09:08:49 +08:00
|
|
|
SystemUtils.cpp
|
2017-01-06 10:29:48 +08:00
|
|
|
TarWriter.cpp
|
TargetParser: FPU/ARCH/EXT parsing refactory - NFC
This new class in a global context contain arch-specific knowledge in order
to provide LLVM libraries, tools and projects with the ability to understand
the architectures. For now, only FPU, ARCH and ARCH extensions on ARM are
supported.
Current behaviour it to parse from free-text to enum values and back, so that
all users can share the same parser and codes. This simplifies a lot both the
ASM/Obj streamers in the back-end (where this came from), and the front-end
parsers for command line arguments (where this is going to be used next).
The previous implementation, using .def/.h includes is deprecated due to its
inflexibility to be built without the backend support and for being too
cumbersome. As more architectures join this scheme, and as more features of
such architectures are added (such as hardware features, type sizes, etc) into
a full blown TargetDescription class, having a set of classes is the most
sane implementation.
The ultimate goal of this refactor both LLVM's and Clang's target description
classes into one unique interface, so that we can de-duplicate and standardise
the descriptions, as well as make it available for other front-ends, tools,
etc.
The FPU parsing for command line options in Clang has been converted to use
this new library and a number of aliases were added for compatibility:
* A bogus neon-vfpv3 alias (neon defaults to vfp3)
* armv5/v6
* {fp4/fp5}-{sp/dp}-d16
Next steps:
* Port Clang's ARCH/EXT parsing to use this library.
* Create a TableGen back-end to generate this information.
* Run this TableGen process regardless of which back-ends are built.
* Expose more information and rename it to TargetDescription.
* Continue re-factoring Clang to use as much of it as possible.
llvm-svn: 236900
2015-05-09 05:04:27 +08:00
|
|
|
TargetParser.cpp
|
2015-12-15 08:59:19 +08:00
|
|
|
ThreadPool.cpp
|
2008-09-22 09:08:49 +08:00
|
|
|
Timer.cpp
|
2010-10-08 07:12:15 +08:00
|
|
|
ToolOutputFile.cpp
|
Use trigrams to speed up SpecialCaseList.
Summary:
it's often the case when the rules in the SpecialCaseList
are of the form hel.o*bar. That gives us a chance to build
trigram index to quickly discard 99% of inputs without
running a full regex. A similar idea was used in Google Code Search
as described in the blog post:
https://swtch.com/~rsc/regexp/regexp4.html
The check is defeated, if there's at least one regex
more complicated than that. In this case, all inputs
will go through the regex. That said, the real-world
rules are often simple or can be simplied. That considerably
speeds up compiling Chromium with CFI and UBSan.
As measured on Chromium's content_message_generator.cc:
before, CFI: 44 s
after, CFI: 23 s
after, CFI, no blacklist: 23 s (~1% slower, but 3 runs were unable to show the difference)
after, regular compilation to bitcode: 23 s
Reviewers: pcc
Subscribers: mgorny, llvm-commits
Differential Revision: https://reviews.llvm.org/D27188
llvm-svn: 288303
2016-12-01 10:54:54 +08:00
|
|
|
TrigramIndex.cpp
|
2009-05-28 00:52:17 +08:00
|
|
|
Triple.cpp
|
2009-07-24 15:04:49 +08:00
|
|
|
Twine.cpp
|
2013-09-05 00:00:12 +08:00
|
|
|
Unicode.cpp
|
2012-04-04 07:09:22 +08:00
|
|
|
YAMLParser.cpp
|
2012-12-13 04:46:15 +08:00
|
|
|
YAMLTraits.cpp
|
2009-08-25 08:02:29 +08:00
|
|
|
raw_os_ostream.cpp
|
2008-09-22 09:08:49 +08:00
|
|
|
raw_ostream.cpp
|
2009-08-30 16:24:09 +08:00
|
|
|
regcomp.c
|
|
|
|
regerror.c
|
|
|
|
regexec.c
|
|
|
|
regfree.c
|
|
|
|
regstrlcpy.c
|
2016-09-27 23:45:57 +08:00
|
|
|
xxhash.cpp
|
2010-11-30 02:16:10 +08:00
|
|
|
|
|
|
|
# System
|
|
|
|
Atomic.cpp
|
|
|
|
DynamicLibrary.cpp
|
|
|
|
Errno.cpp
|
|
|
|
Host.cpp
|
|
|
|
Memory.cpp
|
|
|
|
Mutex.cpp
|
2013-06-27 03:33:03 +08:00
|
|
|
Path.cpp
|
2010-11-30 02:16:10 +08:00
|
|
|
Process.cpp
|
|
|
|
Program.cpp
|
|
|
|
RWMutex.cpp
|
|
|
|
Signals.cpp
|
2011-08-25 02:08:43 +08:00
|
|
|
TargetRegistry.cpp
|
2010-11-30 02:16:10 +08:00
|
|
|
ThreadLocal.cpp
|
|
|
|
Threading.cpp
|
|
|
|
Valgrind.cpp
|
2013-03-26 09:29:15 +08:00
|
|
|
Watchdog.cpp
|
2014-01-20 18:20:23 +08:00
|
|
|
|
Teach llvm_add_library() to find include dirs.
Since header files are not compilation units, CMake does not require
you to specify them in the CMakeLists.txt file. As a result, unless a
header file is explicitly added, CMake won't know about it, and when
generating IDE-based projects, CMake won't put the header files into
the IDE project. LLVM currently tries to deal with this in two ways:
1) It looks for all .h files that are in the project directory, and
adds those.
2) llvm_add_library() understands the ADDITIONAL_HEADERS argument,
which allows one to list an arbitrary list of headers.
This patch takes things one step further. It adds the ability for
llvm_add_library() to take an ADDITIONAL_HEADER_DIRS argument, which
will specify a list of folders which CMake will glob for header files.
Furthermore, it will glob not only for .h files, but also for .inc
files.
Included in this CL is an update to one of the existing users of
ADDITIONAL_HEADERS to use this new argument instead, to serve as an
illustration of how this cleans up the CMake.
The big advantage of this new approach is that until now, there was no
way for the IDE projects to locate the header files that are in the
include tree. In other words, if you are in, for example,
lib/DebugInfo/DWARF, the corresponding includes for this project will
be located under include/llvm/DebugInfo/DWARF. Now, in the
CMakeLists.txt for lib/DebugInfo/DWARF, you can simply write:
ADDITIONAL_HEADER_DIRS
../../include/llvm/DebugInfo/DWARF
as an argument to llvm_add_library(), and all header files will get
added to the IDE project.
Differential Revision: http://reviews.llvm.org/D7460
Reviewed By: Chris Bieneman
llvm-svn: 228670
2015-02-10 13:04:37 +08:00
|
|
|
ADDITIONAL_HEADER_DIRS
|
|
|
|
Unix
|
|
|
|
Windows
|
2016-08-23 04:38:53 +08:00
|
|
|
${LLVM_MAIN_INCLUDE_DIR}/llvm/ADT
|
2015-02-11 11:28:02 +08:00
|
|
|
${LLVM_MAIN_INCLUDE_DIR}/llvm/Support
|
2017-04-12 21:51:00 +08:00
|
|
|
${Backtrace_INCLUDE_DIRS}
|
2014-11-08 00:08:19 +08:00
|
|
|
LINK_LIBS ${system_libs}
|
|
|
|
)
|
2014-02-26 20:18:55 +08:00
|
|
|
|
2014-02-23 14:27:04 +08:00
|
|
|
set_property(TARGET LLVMSupport PROPERTY LLVM_SYSTEM_LIBS "${system_libs}")
|