Stepan Dyatkovskiy cb3a147870 Second patch of patch series that improves MergeFunctions performance time from O(N*N) to ... O(N*log(N)). The idea is to introduce total ordering among functions set. It allows to build binary tree and perform function look-up procedure in O(log(N)) time. This patch description: Introduced total ordering among constants implemented in cmpConstants method. Method performs lexicographical comparison between constants represented as hypothetical numbers of next format: <bitcastability-trait><raw-bit-contents> Please, read cmpConstants declaration comments for more details. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@208173 91177308-0d34-0410-b5e6-96231b3b80d8		2014-05-07 09:05:10 +00:00
..
Analysis
AsmParser
Bitcode
CodeGen	Revert "Try simplifying LexicalScopes ownership again."	2014-05-06 21:07:17 +00:00
DebugInfo
ExecutionEngine
IR
IRReader
LineEditor
Linker
LTO
MC	Allow using normal .eh_frame based unwinding on ARM. Use the same	2014-05-07 07:49:34 +00:00
Object
Option
ProfileData
Support	[Support/MemoryBuffer] Remove the assertion that the file size did not shrink.	2014-05-06 23:30:56 +00:00
TableGen
Target
Transforms
CMakeLists.txt
LLVMBuild.txt
Makefile