mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2024-08-23 02:29:18 +00:00
0b66c6fca2
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.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@151822 91177308-0d34-0410-b5e6-96231b3b80d8
|
||
|---|---|---|
| .. | ||
| Unix | ||
| Windows | ||
| Allocator.cpp | ||
| APFloat.cpp | ||
| APInt.cpp | ||
| APSInt.cpp | ||
| Atomic.cpp | ||
| BlockFrequency.cpp | ||
| BranchProbability.cpp | ||
| circular_raw_ostream.cpp | ||
| CMakeLists.txt | ||
| CommandLine.cpp | ||
| ConstantRange.cpp | ||
| COPYRIGHT.regex | ||
| CrashRecoveryContext.cpp | ||
| DAGDeltaAlgorithm.cpp | ||
| DataExtractor.cpp | ||
| DataStream.cpp | ||
| Debug.cpp | ||
| DeltaAlgorithm.cpp | ||
| Disassembler.cpp | ||
| Dwarf.cpp | ||
| DynamicLibrary.cpp | ||
| Errno.cpp | ||
| ErrorHandling.cpp | ||
| FileUtilities.cpp | ||
| FoldingSet.cpp | ||
| FormattedStream.cpp | ||
| GraphWriter.cpp | ||
| Host.cpp | ||
| IncludeFile.cpp | ||
| IntEqClasses.cpp | ||
| IntervalMap.cpp | ||
| IntrusiveRefCntPtr.cpp | ||
| IsInf.cpp | ||
| IsNAN.cpp | ||
| JSONParser.cpp | ||
| LLVMBuild.txt | ||
| LockFileManager.cpp | ||
| Makefile | ||
| ManagedStatic.cpp | ||
| Memory.cpp | ||
| MemoryBuffer.cpp | ||
| MemoryObject.cpp | ||
| Mutex.cpp | ||
| Path.cpp | ||
| PathV2.cpp | ||
| PluginLoader.cpp | ||
| PrettyStackTrace.cpp | ||
| Process.cpp | ||
| Program.cpp | ||
| raw_os_ostream.cpp | ||
| raw_ostream.cpp | ||
| README.txt.system | ||
| regcclass.h | ||
| regcname.h | ||
| regcomp.c | ||
| regengine.inc | ||
| regerror.c | ||
| regex2.h | ||
| regex_impl.h | ||
| Regex.cpp | ||
| regexec.c | ||
| regfree.c | ||
| regstrlcpy.c | ||
| regutils.h | ||
| RWMutex.cpp | ||
| SearchForAddressOfSpecialSymbol.cpp | ||
| Signals.cpp | ||
| SmallPtrSet.cpp | ||
| SmallVector.cpp | ||
| SourceMgr.cpp | ||
| Statistic.cpp | ||
| StreamableMemoryObject.cpp | ||
| StringExtras.cpp | ||
| StringMap.cpp | ||
| StringPool.cpp | ||
| StringRef.cpp | ||
| system_error.cpp | ||
| SystemUtils.cpp | ||
| TargetRegistry.cpp | ||
| Threading.cpp | ||
| ThreadLocal.cpp | ||
| Timer.cpp | ||
| TimeValue.cpp | ||
| ToolOutputFile.cpp | ||
| Triple.cpp | ||
| Twine.cpp | ||
| Valgrind.cpp | ||
Design Of lib/System
====================
The software in this directory is designed to completely shield LLVM from any
and all operating system specific functionality. It is not intended to be a
complete operating system wrapper (such as ACE), but only to provide the
functionality necessary to support LLVM.
The software located here, of necessity, has very specific and stringent design
rules. Violation of these rules means that cracks in the shield could form and
the primary goal of the library is defeated. By consistently using this library,
LLVM becomes more easily ported to new platforms since the only thing requiring
porting is this library.
Complete documentation for the library can be found in the file:
llvm/docs/SystemLibrary.html
or at this URL:
http://llvm.org/docs/SystemLibrary.html
While we recommend that you read the more detailed documentation, for the
impatient, here's a high level summary of the library's requirements.
1. No system header files are to be exposed through the interface.
2. Std C++ and Std C header files are okay to be exposed through the interface.
3. No exposed system-specific functions.
4. No exposed system-specific data.
5. Data in lib/System classes must use only simple C++ intrinsic types.
6. Errors are handled by returning "true" and setting an optional std::string
7. Library must not throw any exceptions, period.
8. Interface functions must not have throw() specifications.
9. No duplicate function impementations are permitted within an operating
system class.
To accomplish these requirements, the library has numerous design criteria that
must be satisfied. Here's a high level summary of the library's design criteria:
1. No unused functionality (only what LLVM needs)
2. High-Level Interfaces
3. Use Opaque Classes
4. Common Implementations
5. Multiple Implementations
6. Minimize Memory Allocation
7. No Virtual Methods