HomeSort by relevance Sort by last modified time
    Searched defs:Known (Results 1 - 14 of 14) 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
518 llvm::DenseMap<const DirectoryEntry *, llvm::StringRef>::iterator Known
520 if (Known != CanonicalDirNames.end())
521 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 280 llvm::DenseMap<ModuleFile *, unsigned>::iterator Known
282 if (Known == ModulesByFile.end())
287 ArrayRef<unsigned> StoredDependencies = Modules[Known->second].Dependencies;
305 IdentifierIndexTable::iterator Known = Table.find(Name);
306 if (Known == Table.end()) {
310 SmallVector<unsigned, 2> ModuleIDs = *Known;
323 llvm::StringMap<unsigned>::iterator Known = UnresolvedModules.find(Name);
324 if (Known == UnresolvedModules.end()) {
329 ModuleInfo &Info = Modules[Known->second];
337 ModulesByFile[File] = Known->second
    [all...]
ASTReader.cpp 474 llvm::StringMap<std::pair<StringRef, bool /*IsUndef*/> >::iterator Known
476 if (Known == ASTFileMacros.end()) {
497 if (Existing.second != Known->second.second) {
500 << MacroName << Known->second.second;
507 if (Existing.second || Existing.first == Known->second.first)
513 << MacroName << Known->second.first << Existing.first;
    [all...]
ASTWriter.cpp     [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
539 unsigned Known = ModRef;
549 Known = FR->getInfoForGlobal(GV);
551 if (Known == NoModRef)
553 return ModRefResult(Known & AliasAnalysis::getModRefInfo(CS, Loc));
  /external/clang/include/clang/Sema/
ScopeInfo.h 166 /// weakVar | 0 (known) | weakVar (VarDecl)
204 /// Returns true if the object base specifies a known object in memory,
506 llvm::DenseMap<VarDecl*, unsigned>::const_iterator Known
508 assert(Known != CaptureMap.end() && "Variable has not been captured");
509 return Captures[Known->second - 1];
  /external/clang/lib/Frontend/
CompilerInstance.cpp     [all...]
  /external/clang/lib/Parse/
Parser.cpp     [all...]
  /external/clang/lib/AST/
RecordLayoutBuilder.cpp 72 /// MaxEmptyClassOffset - The highest offset known to contain an empty
226 // We don't have to keep looking past the maximum offset that's known to
336 // We don't have to keep looking past the maximum offset that's known to
388 // We don't have to keep looking past the maximum offset that's known to
410 // We don't have to keep looking past the maximum offset that's known to
    [all...]
  /external/clang/lib/Lex/
ModuleMap.cpp 164 HeadersMap::iterator Known = Headers.find(File);
165 if (Known == Headers.end() && File->getDir() == BuiltinIncludeDir &&
170 return Known;
253 HeadersMap::iterator Known = findKnownHeader(File);
254 if (Known != Headers.end()) {
255 for (const KnownHeader &Header : Known->second) {
319 HeadersMap::iterator Known = findKnownHeader(File);
321 if (Known != Headers.end()) {
325 for (SmallVectorImpl<KnownHeader>::iterator I = Known->second.begin(),
326 E = Known->second.end()
    [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.
383 llvm::DenseMap<Decl *, Decl *>::iterator Known
385 if (Known != TransformedLocalDecls.end())
386 return Known->second;
667 /// modifier, size of the array (if known), size expression, and index type
681 /// modifier, (known) size of the array, and index type qualifiers.
    [all...]

Completed in 1111 milliseconds