HomeSort by: relevance | last modified time | path
    Searched defs:Lookup (Results 1 - 17 of 17) sorted by relevancy

  /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);
  /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/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/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/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/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...]
  /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/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/llvm/lib/Target/X86/
X86FloatingPoint.cpp 581 // Efficient Lookup Table Support
599 static int Lookup(ArrayRef<TableEntry> Table, unsigned Opcode) {
614 "All lookup tables must be sorted for efficient access!"); \
792 int Opc = Lookup(OpcodeTable, Opcode);
846 int Opcode = Lookup(PopTable, I->getOpcode());
1357 int Opcode = Lookup(InstTable, MI.getOpcode());
  /src/external/apache2/llvm/dist/clang/lib/Lex/
PPDirectives.cpp 450 // Enter raw mode to disable identifier lookup (and thus macro expansion),
521 // that we can't use Tok.getIdentifierInfo() because its lookup is disabled
755 // If the header lookup mechanism may be relative to the current inclusion
823 // Do a standard file entry lookup.
1773 // Try the lookup again, skipping the cache.
1790 // brackets, we can attempt a lookup as though it were a quoted path to
1874 /// directory lookup.
1876 /// lookup.
2001 // extra lookup step?
2316 const DirectoryLookup *Lookup = CurDirLookup
    [all...]
  /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...]
SemaDecl.cpp 40 #include "clang/Sema/Lookup.h"
176 /// Tries to perform unqualified lookup of the type decls in bases for
214 for (NamedDecl *ND : BaseRD->lookup(&II)) {
239 // Lookup in the parent class template context, if any.
257 // lookup during template instantiation.
279 /// This routine performs ordinary name lookup of the identifier II
297 // Determine where we will perform name lookup.
315 // We therefore do not perform any name lookup if the result would
340 // lookup for class-names.
345 // Perform "qualified" name lookup into the declaration context w
    [all...]
TreeTransform.h 34 #include "clang/Sema/Lookup.h"
1131 llvm_unreachable("Tag lookup cannot find non-tags");
1479 UnresolvedLookupExpr *Lookup) {
1480 return getSema().BuildUnresolvedCoawaitExpr(CoawaitLoc, Result, Lookup);
2830 /// argument-dependent lookup, etc. Subclasses may override this routine to
3588 DeclContext::lookup_result Lookup = TUDecl->lookup(DeclarationName(&Name));
3589 assert(!Lookup.empty() && "No __builtin_shufflevector?");
3592 FunctionDecl *Builtin = cast<FunctionDecl>(Lookup.front());
9845 // the previous user-defined mapper lookup in dependent environment
    [all...]
  /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; }
  /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/lib/CodeGen/
TargetInfo.cpp 2529 bool CallerHasFeat = CallerMap.lookup(Feature);
2530 bool CalleeHasFeat = CalleeMap.lookup(Feature);
6994 // Lookup `addrspacecast` through the constant pointer if any.
10257 int Lookup = 0;
10259 Lookup += 1<<0;
10261 Lookup += 1<<1;
10263 Lookup += 1<<2;
10264 Enc += Table[Lookup];
CodeGenModule.cpp 1280 // allows us to lookup the version that was emitted when this wasn't a
2510 llvm::Constant *&Lookup = AnnotationArgs[ID.ComputeHash()];
2511 if (Lookup)
2512 return Lookup;
2530 Lookup = Bitcasted;
3339 GlobalDecl ExistingDecl = Manglings.lookup(MangledName);
3497 // Lookup the entry, lazily creating it if necessary.
3694 for (const auto *Result : DC->lookup(&CII))
3709 for (const auto *Result : DC->lookup(&NS)) {
3712 for (const auto *Result : LSD->lookup(&NS)
    [all...]

Completed in 74 milliseconds