| /src/external/apache2/llvm/dist/llvm/include/llvm/ADT/ |
| PointerSumType.h | 90 typename HelperT::template Lookup<HelperT::MinTag>::PointerT MinTagPointer;
100 void set(typename HelperT::template Lookup<N>::PointerT Pointer) {
101 void *V = HelperT::template Lookup<N>::TraitsT::getAsVoidPointer(Pointer);
110 create(typename HelperT::template Lookup<N>::PointerT Pointer) {
125 template <TagT N> typename HelperT::template Lookup<N>::PointerT get() const {
127 return HelperT::template Lookup<N>::TraitsT::getFromVoidPointer(P);
131 typename HelperT::template Lookup<N>::PointerT cast() const {
133 return HelperT::template Lookup<N>::TraitsT::getFromVoidPointer(
140 typename HelperT::template Lookup<HelperT::MinTag>::PointerT const *
148 typename HelperT::template Lookup<HelperT::MinTag>::PointerT
[all...] |
| DenseMap.h | 195 /// lookup - Return the entry for the specified key, or a default
197 ValueT lookup(const_arg_type_t<KeyT> Val) const { function in class:llvm::DenseMapBase
556 ValueT &&Value, LookupKeyT &Lookup) {
557 TheBucket = InsertIntoBucketImpl(Key, Lookup, TheBucket);
565 BucketT *InsertIntoBucketImpl(const KeyT &Key, const LookupKeyT &Lookup,
576 // table completely filled with tombstones, no lookup would ever succeed,
577 // causing infinite loops in lookup.
582 LookupBucketFor(Lookup, TheBucket);
587 LookupBucketFor(Lookup, TheBucket);
603 /// LookupBucketFor - Lookup the appropriate bucket for Val, returning it i
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/AST/ |
| ComparisonCategories.cpp | 79 // We don't have a cached result. Lookup the variable declaration and create
81 DeclContextLookupResult Lookup = Record->getCanonicalDecl()->lookup(
83 if (Lookup.empty() || !isa<VarDecl>(Lookup.front()))
85 Objects.emplace_back(ValueKind, cast<VarDecl>(Lookup.front()));
92 DeclContextLookupResult Lookup =
93 Ctx.getTranslationUnitDecl()->lookup(&Ctx.Idents.get("std"));
94 if (!Lookup.empty())
95 StdNS = dyn_cast<NamespaceDecl>(Lookup.front())
[all...] |
| /src/external/apache2/llvm/dist/libcxx/utils/google-benchmark/test/ |
| map_test.cc | 46 BENCHMARK_DEFINE_F(MapFixture, Lookup)(benchmark::State& state) {
55 BENCHMARK_REGISTER_F(MapFixture, Lookup)->Range(1 << 3, 1 << 12);
|
| /src/external/apache2/llvm/dist/llvm/utils/benchmark/test/ |
| map_test.cc | 46 BENCHMARK_DEFINE_F(MapFixture, Lookup)(benchmark::State& state) {
55 BENCHMARK_REGISTER_F(MapFixture, Lookup)->Range(1 << 3, 1 << 12);
|
| /src/external/apache2/llvm/dist/llvm/lib/Analysis/ |
| AssumeBundleQueries.cpp | 88 auto Lookup = Result.find(Key);
89 if (Lookup == Result.end() || !Lookup->second.count(&Assume)) {
93 Lookup->second[&Assume].Min = std::min(Val, Lookup->second[&Assume].Min);
94 Lookup->second[&Assume].Max = std::max(Val, Lookup->second[&Assume].Max);
|
| BlockFrequencyInfoImpl.cpp | 665 Lookup[I.Node.Index] = &I;
672 auto L = Lookup.find(Succ.Index);
673 if (L == Lookup.end())
747 if (InSCC.lookup(P))
|
| /src/external/apache2/llvm/lib/libclangToolingRefactoring/ |
| Makefile | 12 Lookup.cpp \
|
| /src/external/mit/xorg/lib/libXmu/ |
| Makefile | 13 GrayPixmap.c Initer.c LocBitmap.c Lookup.c LookupCmap.c \
21 Error.h ExtAgent.h Initer.h Lookup.h Misc.h StdCmap.h \
|
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/ |
| AssumeBundleBuilder.cpp | 180 auto Lookup = AssumedKnowledgeMap.find(Key);
181 if (Lookup == AssumedKnowledgeMap.end()) {
185 assert(((Lookup->second == 0 && RK.ArgValue == 0) ||
186 (Lookup->second != 0 && RK.ArgValue != 0)) &&
191 Lookup->second = std::max(Lookup->second, RK.ArgValue);
442 auto &Lookup = Knowledge[{RK.WasOn, RK.AttrKind}];
443 for (MapValue &Elem : Lookup) {
457 Lookup.push_back({Assume, RK.ArgValue, &BOI});
|
| /src/external/apache2/llvm/dist/llvm/lib/Support/ |
| DynamicLibrary.cpp | 89 void *Lookup(const char *Symbol, DynamicLibrary::SearchOrdering Order) {
191 if (void *Ptr = OpenedHandles->Lookup(SymbolName, SearchOrder))
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/M68k/Disassembler/ |
| M68kDisassembler.cpp | 466 // Check through our lookup table.
469 const M68kInstructionLookup &Lookup = Lookups[I];
470 if (!Lookup.matches(Buffer))
474 Size = Lookup.size() * 2;
475 Buffer.truncate(Lookup.size());
476 Instr.setOpcode(Lookup.OpCode);
477 LLVM_DEBUG(errs() << "decoding instruction " << MCII->getName(Lookup.OpCode)
|
| /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Core/ |
| DynamicType.cpp | 79 const auto *Lookup = State->get<DynamicCastMap>().lookup(MR);
80 if (!Lookup)
86 for (const DynamicCastInfo &Cast : *Lookup)
|
| /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Checkers/ |
| CastValueChecker.cpp | 465 const auto *Lookup = CDM.lookup(Call);
466 if (!Lookup)
469 const CastCheck &Check = Lookup->first;
470 CallKind Kind = Lookup->second;
|
| /src/external/ibm-public/postfix/dist/mantools/ |
| makemanidx | 48 <li> <a href="DATABASE_README.html"> Lookup table overview </a>
|
| /src/external/gpl3/gcc/dist/libsanitizer/sanitizer_common/ |
| sanitizer_dense_map.h | 111 /// lookup - Return the entry for the specified key, or a default
113 ValueT lookup(const KeyT &Key) const { function in class:__sanitizer::DenseMapBase
407 ValueT &&Value, LookupKeyT &Lookup) {
408 TheBucket = InsertIntoBucketImpl(Key, Lookup, TheBucket);
416 BucketT *InsertIntoBucketImpl(const KeyT &Key, const LookupKeyT &Lookup,
425 // table completely filled with tombstones, no lookup would ever succeed,
426 // causing infinite loops in lookup.
431 LookupBucketFor(Lookup, TheBucket);
436 LookupBucketFor(Lookup, TheBucket);
452 /// LookupBucketFor - Lookup the appropriate bucket for Val, returning it i
[all...] |
| /src/crypto/external/bsd/heimdal/dist/tools/ |
| kdc-log-analyze.pl | 411 } elsif (/Lookup (.*) failed: No such entry in the database/) {
416 } elsif (/Lookup .* succeeded$/) {
|
| /src/external/apache2/llvm/dist/llvm/lib/IR/ |
| ConstantsContext.h | 729 /// Hash once, and reuse it for the lookup and the insertion if needed.
730 LookupKeyHashed Lookup(MapInfo::getHashValue(Key), Key);
734 auto I = Map.find_as(Lookup);
736 Result = create(Ty, V, Lookup);
757 /// Hash once, and reuse it for the lookup and the insertion if needed.
758 LookupKeyHashed Lookup(MapInfo::getHashValue(Key), Key);
760 auto ItMap = Map.find_as(Lookup);
776 Map.insert_as(CP, Lookup);
|
| /src/external/apache2/llvm/dist/clang/lib/Sema/ |
| SemaCoroutine.cpp | 262 assert(!Operators.isAmbiguous() && "Operator lookup cannot be ambiguous");
279 UnresolvedLookupExpr *Lookup) {
281 Functions.append(Lookup->decls_begin(), Lookup->decls_end());
835 ExprResult Lookup = buildOperatorCoawaitLookupExpr(*this, S, Loc);
836 if (Lookup.isInvalid())
839 cast<UnresolvedLookupExpr>(Lookup.get()));
843 UnresolvedLookupExpr *Lookup) {
858 new (Context) DependentCoawaitExpr(Loc, Context.DependentTy, E, Lookup);
873 ExprResult Awaitable = buildOperatorCoawaitCall(*this, Loc, E, Lookup);
[all...] |
| SemaAttr.cpp | 19 #include "clang/Sema/Lookup.h"
703 LookupResult Lookup(*this, Name, IdTok.getLocation(), LookupOrdinaryName);
704 LookupParsedName(Lookup, curScope, nullptr, true);
706 if (Lookup.empty()) {
712 VarDecl *VD = Lookup.getAsSingle<VarDecl>();
|
| /src/external/apache2/llvm/dist/llvm/tools/llvm-dwarfdump/ |
| llvm-dwarfdump.cpp | 184 Lookup("lookup",
185 desc("Lookup <address> in the debug information and print out any "
422 /// Handle the --lookup option and dump the DIEs and line info for the given
424 /// TODO: specified Address for --lookup option could relate for several
426 /// need to do something with this: extend lookup option with section
428 static bool lookup(ObjectFile &Obj, DWARFContext &DICtx, uint64_t Address, function
430 auto DIEsForAddr = DICtx.getDIEsForAddress(Lookup);
447 {Lookup, object::SectionedAddress::UndefSection}))
461 // Handle the --lookup option
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Demangle/ |
| MicrosoftDemangle.cpp | 1057 const char *Lookup = ",/\\:. \n\t'-";
1058 char C = Lookup[MangledName[0] - '0'];
1064 char Lookup[26] = {'\xE1', '\xE2', '\xE3', '\xE4', '\xE5', '\xE6', '\xE7',
1068 char C = Lookup[MangledName[0] - 'a'];
1074 char Lookup[26] = {'\xC1', '\xC2', '\xC3', '\xC4', '\xC5', '\xC6', '\xC7',
1078 char C = Lookup[MangledName[0] - 'A'];
|
| /src/external/apache2/llvm/dist/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| ProgramStateTrait.h | 162 static lookup_type Lookup(data_type B, key_type K) {
163 return B.lookup(K);
|
| /src/external/apache2/llvm/dist/clang/lib/Lex/ |
| PPMacroExpansion.cpp | 208 if (NumHiddenOverrides.lookup(LeafMM) == 0)
1261 const DirectoryLookup *Lookup = PP.GetCurDirLookup();
1268 Lookup = nullptr;
1275 Lookup = nullptr;
1276 } else if (!Lookup) {
1280 ++Lookup;
1283 return EvaluateHasIncludeCommon(Tok, II, PP, Lookup, LookupFromFile);
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/ |
| BlockFrequencyInfoImpl.h | 625 SmallDenseMap<uint32_t, IrrNode *, 4> Lookup;
673 StartIrr = Lookup[Start.Index];
680 auto L = Lookup.find(Node.Index);
681 if (L == Lookup.end())
737 /// All other stages make use of this ordering. Save a lookup from BlockT
883 BlockNode getNode(const BlockT *BB) const { return Nodes.lookup(BB).first; }
|
