Home
last modified time | relevance | path

Searched refs:Trie (Results 1 – 22 of 22) sorted by relevance

/netbsd-src/sys/external/bsd/compiler_rt/dist/lib/xray/tests/unit/
H A Dfunction_call_trie_test.cc24 FunctionCallTrie Trie(Allocators); in TEST() local
30 FunctionCallTrie Trie(A); in TEST() local
34 Trie.enterFunction(1, TSC++, CPU++); in TEST()
35 Trie.exitFunction(1, TSC++, CPU++); in TEST()
36 const auto &R = Trie.getRoots(); in TEST()
47 FunctionCallTrie Trie(A); in TEST() local
49 Trie.enterFunction(1, std::numeric_limits<uint64_t>::max(), 0); in TEST()
50 Trie.exitFunction(1, 1, 0); in TEST()
51 const auto &R = Trie.getRoots(); in TEST()
62 FunctionCallTrie Trie(A); in TEST() local
[all …]
/netbsd-src/external/apache2/llvm/dist/llvm/tools/llvm-objcopy/MachO/
H A DMachOWriter.cpp76 assert((DyLdInfoCommand.export_size == O.Exports.Trie.size()) && in totalSize()
383 assert((DyLdInfoCommand.export_size == O.Exports.Trie.size()) && in writeExportInfo()
385 memcpy(Out, O.Exports.Trie.data(), O.Exports.Trie.size()); in writeExportInfo()
H A DMachOLayoutBuilder.cpp252 uint64_t StartOfFunctionStarts = StartOfExportTrie + O.Exports.Trie.size(); in layoutTail()
343 O.Exports.Trie.empty() ? 0 : StartOfExportTrie; in layoutTail()
344 MLC.dyld_info_command_data.export_size = O.Exports.Trie.size(); in layoutTail()
H A DObject.h292 ArrayRef<uint8_t> Trie; member
H A DMachOReader.cpp258 O.Exports.Trie = MachOObj.getDyldInfoExportsTrie(); in readExportInfo()
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Object/
H A DMachOObjectFile.cpp2818 ArrayRef<uint8_t> T) : E(E), O(O), Trie(T) {} in ExportEntry()
2853 uint64_t Result = decodeULEB128(Ptr, &Count, Trie.end(), error); in readULEB128()
2855 if (Ptr > Trie.end()) in readULEB128()
2856 Ptr = Trie.end(); in readULEB128()
2884 return Stack.back().Start - Trie.begin(); in nodeOffset()
2892 const uint8_t *Ptr = Trie.begin() + offset; in pushNode()
2905 if (Children > Trie.end()) { in pushNode()
2960 if (End >= Trie.end()) { in pushNode()
2968 while(*End != '\0' && End < Trie.end()) in pushNode()
3011 if (State.ChildCount != 0 && Children + 1 >= Trie.end()) { in pushNode()
[all …]
/netbsd-src/external/gpl3/gcc.old/dist/libphobos/src/std/regex/internal/
H A Dir.d26 alias Trie = CodepointSetTrie!(13, 8); variable
120 Trie = 0b1_00011_00, //CodepointSet implemented as Trie
434 case IR.Backref: case IR.CodepointSet: case IR.Trie:
772 Trie trie; // slow path for Unicode
H A Dthompson.d655 static bool op(IR code:IR.Trie)(E* e, S* state)
661 t.pc += IRL!(IR.Trie); in with()
681 || code == IR.Trie || code == IR.Char || code == IR.Any)
707 && code != IR.Trie && code != IR.Char && code != IR.Any && code != IR.Backref)
H A Dgenerator.d59 case IR.Trie: in SampleGenerator()
H A Dbacktracking.d352 case IR.Trie: in BacktrackingMatcher()
356 pc += IRL!(IR.Trie); in BacktrackingMatcher()
1300 case IR.Trie:
H A Dparser.d331 put(Bytecode(IR.Trie, cast(uint) n)); in charsetToIr()
339 put(Bytecode(IR.Trie, cast(uint) matchers.length)); in charsetToIr()
1696 case Trie, CodepointSet: in optimize()
H A Dkickstart.d228 case IR.Trie: in ShiftOr()
/netbsd-src/sys/external/bsd/compiler_rt/dist/lib/xray/
H A Dxray_profile_collector.cc169 const FunctionCallTrie &Trie) XRAY_NEVER_INSTRUMENT { in populateRecords() argument
174 for (const auto *R : Trie.getRoots()) { in populateRecords()
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Object/
H A DMachO.h74 ExportEntry(Error *Err, const MachOObjectFile *O, ArrayRef<uint8_t> Trie);
116 ArrayRef<uint8_t> Trie; variable
385 ArrayRef<uint8_t> Trie,
/netbsd-src/external/gpl3/gcc/dist/libphobos/src/std/regex/internal/
H A Dir.d26 alias Trie = CodepointSetTrie!(13, 8); variable
111 Trie = 0b1_00011_00, //CodepointSet implemented as Trie
437 case IR.Backref: case IR.CodepointSet: case IR.Trie:
965 Trie trie; // slow path for Unicode
H A Dgenerator.d59 case IR.Trie: in SampleGenerator()
H A Dthompson.d653 static bool op(IR code:IR.Trie)(E e, S* state)
659 t.pc += IRL!(IR.Trie); in with()
679 || code == IR.Trie || code == IR.Char || code == IR.Any)
705 && code != IR.Trie && code != IR.Char && code != IR.Any && code != IR.Backref)
H A Dparser.d250 put(Bytecode(IR.Trie, cast(uint) n)); in charsetToIr()
258 put(Bytecode(IR.Trie, cast(uint) matchers.length)); in charsetToIr()
1160 case Trie, CodepointSet: in optimize()
H A Dbacktracking.d380 case IR.Trie: in matchImpl()
384 pc += IRL!(IR.Trie); in matchImpl()
1324 case IR.Trie: in ctAtomCode()
H A Dkickstart.d228 case IR.Trie: in ShiftOr()
/netbsd-src/external/gpl3/gcc.old/dist/libphobos/src/std/
H A Duni.d442 $(HTTP en.wikipedia.org/wiki/Trie, Trie) data structure with integer
448 $(P Taking a 2-level Trie as an example the principle of operation is as follows.
4110 return Trie!(V, Key, maxIndex, Prefix)(table); in build()
4124 @trusted private struct Trie(Value, Key, Args...)
5445 packed Trie from any $(D set) of $(CODEPOINTS).
/netbsd-src/external/gpl3/gcc/dist/libphobos/src/std/uni/
H A Dpackage.d440 $(HTTP en.wikipedia.org/wiki/Trie, Trie) data structure with integer
446 $(P Taking a 2-level Trie as an example the principle of operation is as follows.
4099 return Trie!(V, Key, maxIndex, Prefix)(table);
4113 @trusted private struct Trie(Value, Key, Args...)
5445 packed Trie from any `set` of $(CODEPOINTS).