HomeSort by relevance Sort by last modified time
    Searched defs:Known (Results 1 - 15 of 15) sorted by null

  /external/clang/test/Parser/
cxx-template-argument.cpp 50 template<class T1, typename T2> struct Known { }; // expected-note 3 {{template is declared here}}
61 Known<T1> // expected-error {{too few template arguments for class template 'Known'}}
71 Known<T1> // expected-error {{too few template arguments for class template 'Known'}}
82 Known<T1> // expected-error {{too few template arguments for class template 'Known'}}
95 UnknownBase<Known<int,int>,X<int,int>> // expected-error {{unknown template name 'UnknownBase'}} \
100 UnknownBase<Known<int,int>,X<int,X<int,int>>> // expected-error {{unknown template name 'UnknownBase'}} \
  /external/clang/lib/Basic/
FileManager.cpp 240 // subdirectory. This will let us avoid having to waste time on known-to-fail
549 llvm::DenseMap<const DirectoryEntry *, llvm::StringRef>::iterator Known
551 if (Known != CanonicalDirNames.end())
552 return Known->second;
  /external/clang/lib/Serialization/
ModuleManager.cpp 40 llvm::DenseMap<const FileEntry *, ModuleFile *>::iterator Known
42 if (Known == Modules.end())
45 return Known->second;
GlobalModuleIndex.cpp 279 llvm::DenseMap<ModuleFile *, unsigned>::iterator Known
281 if (Known == ModulesByFile.end())
286 ArrayRef<unsigned> StoredDependencies = Modules[Known->second].Dependencies;
304 IdentifierIndexTable::iterator Known = Table.find(Name);
305 if (Known == Table.end()) {
309 SmallVector<unsigned, 2> ModuleIDs = *Known;
322 llvm::StringMap<unsigned>::iterator Known = UnresolvedModules.find(Name);
323 if (Known == UnresolvedModules.end()) {
328 ModuleInfo &Info = Modules[Known->second];
336 ModulesByFile[File] = Known->second
    [all...]
ASTWriter.cpp     [all...]
ASTReader.cpp 494 llvm::StringMap<std::pair<StringRef, bool /*IsUndef*/> >::iterator Known
496 if (Known == ASTFileMacros.end()) {
517 if (Existing.second != Known->second.second) {
520 << MacroName << Known->second.second;
527 if (Existing.second || Existing.first == Known->second.first)
533 << MacroName << Known->second.first << Existing.first;
    [all...]
  /external/llvm/lib/Analysis/IPA/
GlobalsModRef.cpp 55 /// MayReadAnyGlobal - May read global variables, but it is not known which.
80 /// IndirectGlobals - The memory pointed to by this global is known to be
540 unsigned Known = ModRef;
551 Known = FR->getInfoForGlobal(GV);
553 if (Known == NoModRef)
555 return ModRefResult(Known & AliasAnalysis::getModRefInfo(CS, Loc));
  /external/clang/include/clang/Sema/
ScopeInfo.h 175 /// weakVar | 0 (known) | weakVar (VarDecl)
211 /// Returns true if the object base specifies a known object in memory,
539 llvm::DenseMap<VarDecl*, unsigned>::const_iterator Known
541 assert(Known != CaptureMap.end() && "Variable has not been captured");
542 return Captures[Known->second - 1];
  /external/clang/lib/Frontend/
CompilerInstance.cpp     [all...]
  /external/clang/lib/Parse/
ParseExpr.cpp     [all...]
  /external/clang/lib/AST/
RecordLayoutBuilder.cpp 88 auto Known = BaseOffsets.find(RD);
89 if (Known == BaseOffsets.end())
91 BaseOffset = Known->second;
96 auto Known = VirtualBaseOffsets.find(RD);
97 if (Known == VirtualBaseOffsets.end())
99 BaseOffset = Known->second;
118 /// MaxEmptyClassOffset - The highest offset known to contain an empty
272 // We don't have to keep looking past the maximum offset that's known to
380 // We don't have to keep looking past the maximum offset that's known to
432 // We don't have to keep looking past the maximum offset that's known t
    [all...]
  /external/clang/lib/Lex/
ModuleMap.cpp 167 HeadersMap::iterator Known = Headers.find(File);
168 if (Known == Headers.end() && File->getDir() == BuiltinIncludeDir &&
173 return Known;
257 HeadersMap::iterator Known = findKnownHeader(File);
258 if (Known != Headers.end()) {
259 for (const KnownHeader &Header : Known->second) {
337 HeadersMap::iterator Known = findKnownHeader(File);
345 if (Known != Headers.end()) {
349 for (SmallVectorImpl<KnownHeader>::iterator I = Known->second.begin(),
350 E = Known->second.end()
    [all...]
  /external/llvm/lib/Analysis/
ValueTracking.cpp 43 /// conditions to compute known bits. The individual options below control how
208 // If all of the MaskV bits are known to be zero, then we know the
213 // Top bits known zero.
239 // Compute known bits of the carry.
243 // Compute set of known bits (where all three relevant bits are known).
247 APInt Known = LHSKnown & RHSKnown & CarryKnown;
249 assert((PossibleSumZero & Known) == (PossibleSumOne & Known) &&
250 "known bits of sum differ")
    [all...]
  /external/clang/lib/Sema/
SemaCodeComplete.cpp     [all...]
TreeTransform.h 166 /// information is known based on another transformation.
198 /// to short-circuit evaluation when it is known that a given type will
243 /// number of expansions is known a priori (e.g., due to a prior substitution)
244 /// and will be set by the callee when the number of expansions is known.
404 llvm::DenseMap<Decl *, Decl *>::iterator Known
406 if (Known != TransformedLocalDecls.end())
407 return Known->second;
694 /// modifier, size of the array (if known), size expression, and index type
708 /// modifier, (known) size of the array, and index type qualifiers.
    [all...]

Completed in 372 milliseconds