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

  /external/clang/lib/Basic/
FileManager.cpp 296 // subdirectory. This will let us avoid having to waste time on known-to-fail
562 llvm::DenseMap<const DirectoryEntry *, llvm::StringRef>::iterator Known
564 if (Known != CanonicalDirNames.end())
565 return Known->second;
  /external/clang/lib/Serialization/
ModuleManager.cpp 39 llvm::DenseMap<const FileEntry *, ModuleFile *>::iterator Known
41 if (Known == Modules.end())
44 return Known->second;
GlobalModuleIndex.cpp 266 llvm::DenseMap<ModuleFile *, unsigned>::iterator Known
268 if (Known == ModulesByFile.end())
273 ArrayRef<unsigned> StoredDependencies = Modules[Known->second].Dependencies;
291 IdentifierIndexTable::iterator Known = Table.find(Name);
292 if (Known == Table.end()) {
296 SmallVector<unsigned, 2> ModuleIDs = *Known;
309 llvm::StringMap<unsigned>::iterator Known = UnresolvedModules.find(Name);
310 if (Known == UnresolvedModules.end()) {
315 ModuleInfo &Info = Modules[Known->second];
323 ModulesByFile[File] = Known->second
    [all...]
ASTWriter.cpp     [all...]
ASTReader.cpp 277 llvm::StringMap<std::pair<StringRef, bool /*IsUndef*/> >::iterator Known
279 if (Known == ASTFileMacros.end()) {
300 if (Existing.second != Known->second.second) {
303 << MacroName << Known->second.second;
310 if (Existing.second || Existing.first == Known->second.first)
316 << MacroName << Known->second.first << Existing.first;
    [all...]
  /external/llvm/lib/Analysis/IPA/
GlobalsModRef.cpp 54 /// MayReadAnyGlobal - May read global variables, but it is not known which.
79 /// IndirectGlobals - The memory pointed to by this global is known to be
547 unsigned Known = ModRef;
557 Known = FR->getInfoForGlobal(GV);
559 if (Known == NoModRef)
561 return ModRefResult(Known & AliasAnalysis::getModRefInfo(CS, Loc));
  /external/clang/include/clang/Sema/
ScopeInfo.h 145 /// weakVar | 0 (known) | weakVar (VarDecl)
183 /// Returns true if the object base specifies a known object in memory,
500 llvm::DenseMap<VarDecl*, unsigned>::const_iterator Known
502 assert(Known != CaptureMap.end() && "Variable has not been captured");
503 return Captures[Known->second - 1];
  /external/clang/lib/Frontend/
CompilerInstance.cpp     [all...]
  /external/clang/lib/Parse/
ParseExpr.cpp 749 llvm::SmallDenseMap<IdentifierInfo *, tok::TokenKind>::iterator Known
751 if (Known != RevertableTypeTraits.end()) {
752 Tok.setKind(Known->second);
    [all...]
  /external/clang/lib/AST/
RecordLayoutBuilder.cpp 72 /// MaxEmptyClassOffset - The highest offset known to contain an empty
230 // We don't have to keep looking past the maximum offset that's known to
340 // We don't have to keep looking past the maximum offset that's known to
396 // We don't have to keep looking past the maximum offset that's known to
420 // We don't have to keep looking past the maximum offset that's known to
    [all...]
  /external/clang/lib/Lex/
ModuleMap.cpp 172 HeadersMap::iterator Known = Headers.find(File);
173 if (Known != Headers.end()) {
175 if (!Known->second.isAvailable())
178 return Known->second;
189 Known = Headers.find(File);
190 if (Known != Headers.end()) {
192 if (!Known->second.isAvailable())
195 return Known->second;
290 HeadersMap::const_iterator Known = Headers.find(Header);
291 if (Known != Headers.end()
    [all...]
  /external/clang/lib/Sema/
SemaCodeComplete.cpp     [all...]
TreeTransform.h 163 /// information is known based on another transformation.
195 /// to short-circuit evaluation when it is known that a given type will
240 /// number of expansions is known a priori (e.g., due to a prior substitution)
241 /// and will be set by the callee when the number of expansions is known.
380 llvm::DenseMap<Decl *, Decl *>::iterator Known
382 if (Known != TransformedLocalDecls.end())
383 return Known->second;
645 /// modifier, size of the array (if known), size expression, and index type
659 /// modifier, (known) size of the array, and index type qualifiers.
    [all...]

Completed in 251 milliseconds