en Copyright 2015 Java http://172.16.0.5:8080/history/llvm-project-15.0.7/llvm/unittests/Support/DJBTest.cpp#2946cd70 Update the file headers across all of the LLVM projects in the monorepoto reflect the new license.We understand that people may be surprised that we're moving the headerentirely to discuss the new license. We checked this carefully with theFoundation's lawyer and we believe this is the correct approach.Essentially, all code in the project is now made available by the LLVMproject under our new license, so you will see that the license headersinclude that license only. Some of our contributors have contributedcode under our old license, and accordingly, we have retained a copy ofour old license notice in the top-level files in each project andrepository.llvm-svn: 351636 List of files: /llvm-project-15.0.7/llvm/unittests/Support/DJBTest.cpp Sat, 19 Jan 2019 08:50:56 +0000 Chandler Carruth <chandlerc@gmail.com> http://172.16.0.5:8080/history/llvm-project-15.0.7/llvm/unittests/Support/DJBTest.cpp#3b17b84b Resubmit r325107 (case folding DJB hash)The issue was that the has function was generating different results dependingon the signedness of char on the host platform. This commit fixes the issue byexplicitly using an unsigned char type to prevent sign extension andadds some extra tests.The original commit message was:This patch implements a variant of the DJB hash function which folds theinput according to the algorithm in the Dwarf 5 specification (Section6.1.1.4.5), which in turn references the Unicode Standard (Section 5.18,"Case Mappings").To achieve this, I have added a llvm::sys::unicode::foldCharSimplefunction, which performs this mapping. The implementation of thisfunction was generated from the CaseMatching.txt file from the Unicodespec using a python script (which is also included in this patch). Thescript tries to optimize the function by coalescing adjecant mappingswith the same shift and stride (terms I made up). Theoretically, itcould be made a bit smarter and merge adjecant blocks that wereinterrupted by only one or two characters with exceptional mapping, butthis would save only a couple of branches, while it would greatlycomplicate the implementation, so I deemed it was not worth it.Since we assume that the vast majority of the input characters will beUS-ASCII, the folding hash function has a fast-path for handling these,and only whips out the full decode+fold+encode logic if we encounter acharacter outside of this range. It might be possible to implement thefolding directly on utf8 sequences, but this would also bring a lot ofcomplexity for the few cases where we will actually need to processnon-ascii characters.Reviewers: JDevlieghere, aprantl, probinson, dblaikieSubscribers: mgorny, hintonda, echristo, clayborg, vleschuk, llvm-commitsDifferential Revision: https://reviews.llvm.org/D42740llvm-svn: 325732 List of files: /llvm-project-15.0.7/llvm/unittests/Support/DJBTest.cpp Wed, 21 Feb 2018 22:36:31 +0000 Pavel Labath <labath@google.com> http://172.16.0.5:8080/history/llvm-project-15.0.7/llvm/unittests/Support/DJBTest.cpp#84e59046 Fix build broken by r325107Older gcc versions need an extra pair of {}s to convert a string literalinto llvm::StringLiteral.llvm-svn: 325109 List of files: /llvm-project-15.0.7/llvm/unittests/Support/DJBTest.cpp Wed, 14 Feb 2018 10:25:32 +0000 Pavel Labath <labath@google.com> http://172.16.0.5:8080/history/llvm-project-15.0.7/llvm/unittests/Support/DJBTest.cpp#f1440978 Implement a case-folding version of DJB hashSummary:This patch implements a variant of the DJB hash function which folds theinput according to the algorithm in the Dwarf 5 specification (Section6.1.1.4.5), which in turn references the Unicode Standard (Section 5.18,"Case Mappings").To achieve this, I have added a llvm::sys::unicode::foldCharSimplefunction, which performs this mapping. The implementation of thisfunction was generated from the CaseMatching.txt file from the Unicodespec using a python script (which is also included in this patch). Thescript tries to optimize the function by coalescing adjecant mappingswith the same shift and stride (terms I made up). Theoretically, itcould be made a bit smarter and merge adjecant blocks that wereinterrupted by only one or two characters with exceptional mapping, butthis would save only a couple of branches, while it would greatlycomplicate the implementation, so I deemed it was not worth it.Since we assume that the vast majority of the input characters will beUS-ASCII, the folding hash function has a fast-path for handling these,and only whips out the full decode+fold+encode logic if we encounter acharacter outside of this range. It might be possible to implement thefolding directly on utf8 sequences, but this would also bring a lot ofcomplexity for the few cases where we will actually need to processnon-ascii characters.Reviewers: JDevlieghere, aprantl, probinson, dblaikieSubscribers: mgorny, hintonda, echristo, clayborg, vleschuk, llvm-commitsDifferential Revision: https://reviews.llvm.org/D42740llvm-svn: 325107 List of files: /llvm-project-15.0.7/llvm/unittests/Support/DJBTest.cpp Wed, 14 Feb 2018 10:05:09 +0000 Pavel Labath <labath@google.com>