forked from OSchip/llvm-project
9854edd817
Build the trie by performing a three-way radix quicksort: We start by sorting the strings by their first characters, then sort the strings with the same first characters by their second characters, and so on recursively. Each time the prefixes diverge, we add a node to the trie. Thanks to @ruiu for the idea. I used llvm-mc's radix quicksort implementation as a starting point. The trie offset fixpoint code was taken from MachONormalizedFileBinaryWriter.cpp. Differential Revision: https://reviews.llvm.org/D76977 |
||
|---|---|---|
| .. | ||
| Inputs | ||
| alignment-too-large.yaml | ||
| arch.s | ||
| duplicate-symbol.s | ||
| dylib.s | ||
| dylink.s | ||
| entry-symbol.s | ||
| export-trie.s | ||
| invalid-executable.s | ||
| load-commands.s | ||
| missing-dylib.s | ||
| no-exports-dylib.s | ||
| no-id-dylink.s | ||
| no-such-file.s | ||
| relocations.s | ||
| search-paths.test | ||
| section-headers.s | ||
| segments.s | ||
| silent-ignore.test | ||
| symtab.s | ||