Searched defs:Prev (Results 26 - 50 of 50) sorted by relevance

12

/external/clang/lib/Format/
H A DTokenAnnotator.cpp160 FormatToken *Prev = CurrentToken->getPreviousNonComment(); local
161 if (Prev) {
162 FormatToken *PrevPrev = Prev->getPreviousNonComment();
165 Prev->isOneOf(tok::star, tok::amp, tok::ampamp) &&
167 Prev->Type = TT_BinaryOperator;
1008 FormatToken *Prev = Tok.Previous; local
1009 if (Prev && Prev->isOneOf(tok::amp, tok::star))
1010 Prev = Prev
1464 const FormatToken *Prev = Current->Previous; local
[all...]
/external/clang/lib/StaticAnalyzer/Core/
H A DBugReporterVisitors.cpp1150 const ExplodedNode *Prev,
1153 PathDiagnosticPiece *piece = VisitNodeImpl(N, Prev, BRC, BR);
1163 const ExplodedNode *Prev,
1169 ProgramStateRef PrevState = Prev->getState();
1149 VisitNode(const ExplodedNode *N, const ExplodedNode *Prev, BugReporterContext &BRC, BugReport &BR) argument
1162 VisitNodeImpl(const ExplodedNode *N, const ExplodedNode *Prev, BugReporterContext &BRC, BugReport &BR) argument
H A DBugReporter.cpp1966 PathPieces::iterator Prev = pieces.end(); local
1967 for (PathPieces::iterator I = pieces.begin(), E = Prev; I != E;
1968 Prev = I, ++I) {
2010 if (Prev != E) {
2012 dyn_cast<PathDiagnosticControlFlowPiece>(*Prev);
/external/llvm/include/llvm/ADT/
H A Dilist.h32 // 1. The user must provide {g|s}et{Next|Prev} methods, or specialize
62 static void setPrev(NodeTy *N, NodeTy *Prev) { N->setPrev(Prev); } argument
502 NodeTy *First = &*first, *Prev = this->getPrev(First); local
504 if (Prev)
505 this->setNext(Prev, Next);
508 this->setPrev(Next, Prev);
/external/llvm/lib/Analysis/
H A DLoopAccessAnalysis.cpp482 UnderlyingObjToAccessMap::iterator Prev = local
484 if (Prev != ObjToLastAccess.end())
485 DepCands.unionSets(Access, Prev->second);
/external/llvm/lib/IR/
H A DConstantFold.cpp2163 Type *Prev = nullptr; local
2165 Prev = Ty, Ty = cast<CompositeType>(Ty)->getTypeAtIndex(Idxs[i]), ++i) {
2170 if (isa<SequentialType>(Prev)) {
/external/llvm/lib/MC/
H A DMCAssembler.cpp603 MCFragment *Prev = F->getPrevNode(); local
609 assert((!Prev || isFragmentValid(Prev)) &&
615 if (Prev)
616 F->Offset = Prev->Offset + getAssembler().computeFragmentSize(*this, *Prev);
628 // Prev |##########| F |
683 // | Prev |####|####| F |
/external/clang/include/clang/AST/
H A DDeclBase.h875 Decl *Prev = getPreviousDecl(); local
879 if (Prev && Prev->getIdentifierNamespace() & IDNS_Ordinary)
908 Decl *Prev = getPreviousDecl(); local
914 (Prev && Prev->getIdentifierNamespace() & IDNS_Tag))
921 (Prev && Prev->getIdentifierNamespace() & IDNS_Ordinary))
/external/clang/lib/AST/
H A DDeclCXX.cpp2090 UsingShadowDecl *Prev = FirstUsingShadow.getPointer(); local
2091 while (Prev->UsingOrNextShadow != S)
2092 Prev = cast<UsingShadowDecl>(Prev->UsingOrNextShadow);
2093 Prev->UsingOrNextShadow = S->UsingOrNextShadow;
H A DASTDumper.cpp778 if (Decl *Prev = D->getPreviousDecl())
779 DumpWithPrev(Prev);
832 const T *Prev = D->getPreviousDecl(); local
833 if (Prev)
834 OS << " prev " << Prev; local
H A DDecl.cpp1163 if (const VarDecl *Prev = Var->getPreviousDecl()) {
1164 LinkageInfo PrevLV = getLVForDecl(Prev, computation);
2766 const FunctionDecl *Prev = this; local
2768 while ((Prev = Prev->getPreviousDecl())) {
2769 FoundBody |= Prev->Body.isValid();
2771 if (Prev->Body) {
2774 if (!Prev->isInlineSpecified() ||
2775 Prev->getStorageClass() != SC_Extern)
2777 } else if (Prev
2794 const FunctionDecl *Prev = this; local
[all...]
/external/llvm/lib/CodeGen/AsmPrinter/
H A DDwarfDebug.cpp1688 const SymbolCU &Prev = List[n - 1]; local
1692 if (Cur.CU != Prev.CU) {
1696 Spans[Prev.CU].push_back(Span);
/external/llvm/utils/TableGen/
H A DAsmMatcherEmitter.cpp808 unsigned Prev = 0; local
820 AsmOperands.push_back(AsmOperand(String.slice(Prev, i)));
825 Prev = i + 1;
830 AsmOperands.push_back(AsmOperand(String.slice(Prev, i)));
836 Prev = i + 1;
841 AsmOperands.push_back(AsmOperand(String.slice(Prev, i)));
847 Prev = i;
855 Prev = EndPos + 1;
863 AsmOperands.push_back(AsmOperand(String.slice(Prev, i)));
864 Prev
[all...]
/external/clang/lib/Sema/
H A DSemaTemplateInstantiateDecl.cpp377 if (TypedefNameDecl *Prev = getPreviousDeclForInstantiation(D)) {
378 NamedDecl *InstPrev = SemaRef.FindInstantiatedDecl(D->getLocation(), Prev,
748 NamedDecl *Prev = SemaRef.FindInstantiatedDecl(D->getLocation(), local
751 if (!Prev) return nullptr;
752 PrevDecl = cast<EnumDecl>(Prev);
1227 NamedDecl *Prev = SemaRef.FindInstantiatedDecl(D->getLocation(), local
1230 if (!Prev) return nullptr;
1231 PrevDecl = cast<CXXRecordDecl>(Prev);
2237 LookupResult Prev(SemaRef, NameInfo, Sema::LookupUsingDeclName,
2249 Prev
[all...]
H A DSemaTemplate.cpp2606 for (Decl *Prev = PrevDecl; Prev; Prev = Prev->getPreviousDecl()) {
2608 if (getTemplateSpecializationKind(Prev) == TSK_ExplicitSpecialization) {
6344 for (Decl *Prev = PrevDecl; Prev; Prev = Prev->getPreviousDecl()) {
6346 if (getTemplateSpecializationKind(Prev)
7712 NamedDecl *Prev = *P; local
[all...]
H A DSemaChecking.cpp7370 : Self(Self), Prev(Self.EvalTracker), EvalOK(true) {
7374 Self.EvalTracker = Prev;
7375 if (Prev)
7376 Prev->EvalOK &= EvalOK;
7388 EvaluationTracker *Prev; member in class:__anon1145::SequenceChecker::EvaluationTracker
H A DSemaDecl.cpp6095 NamedDecl *Prev = S.findLocallyScopedExternCDecl(ND->getDeclName()); local
6097 if (!Prev && IsGlobal && !isIncompleteDeclExternC(S, ND)) {
6103 if (Prev) {
6108 Previous.addDecl(Prev);
6126 Prev = *I;
6136 Prev = *I;
6147 if (!Prev)
6153 assert(Prev && "should have found a previous declaration to diagnose");
6154 if (FunctionDecl *FD = dyn_cast<FunctionDecl>(Prev))
6155 Prev
11071 CheckEnumRedeclaration(SourceLocation EnumLoc, bool IsScoped, QualType EnumUnderlyingTy, const EnumDecl *Prev) argument
[all...]
H A DSemaDeclCXX.cpp8250 const LookupResult &Prev) {
8263 for (LookupResult::iterator I = Prev.begin(), E = Prev.end(); I != E; ++I) {
12734 if (const FunctionDecl *Prev = Fn->getPreviousDecl()) {
12737 if ((Prev->getTemplateSpecializationKind() != TSK_ExplicitSpecialization ||
12738 Prev->getPreviousDecl()) &&
12739 !Prev->isDefined()) {
12741 Diag(Prev->getLocation().isInvalid() ? DelLoc : Prev->getLocation(),
12742 Prev
8246 CheckUsingDeclRedeclaration(SourceLocation UsingLoc, bool HasTypenameKeyword, const CXXScopeSpec &SS, SourceLocation NameLoc, const LookupResult &Prev) argument
[all...]
H A DSemaExpr.cpp8973 DeclContext *DC = S.CurContext, *Prev = nullptr; local
8975 Prev = DC;
8980 DC = Prev;
/external/llvm/lib/Transforms/Scalar/
H A DGVN.cpp656 LeaderTableEntry* Prev = nullptr; local
660 Prev = Curr;
664 if (Prev) {
665 Prev->Next = Curr->Next;
/external/clang/lib/Analysis/
H A DCFG.cpp117 /// Create valid iterator. In case when S.Prev is an invalid iterator and
124 *this = Scope->Prev;
143 *this = Scope->Prev;
175 const_iterator Prev; member in class:__anon890::LocalScope
180 : ctx(ctx), Vars(ctx, 4), Prev(P) {}
200 F = F.Scope->Prev;
/external/clang/lib/Driver/
H A DToolChains.cpp676 unsigned Prev = Index; local
687 if (!XarchArg || Index > Prev + 1) {
/external/llvm/include/llvm/CodeGen/
H A DSelectionDAGNodes.h230 /// pointer to the SDNode using the value, and Next and Prev pointers,
238 /// Prev, Next - Pointers to the uses list of the SDNode referred by
240 SDUse **Prev, *Next; member in class:llvm::SDUse
246 SDUse() : Val(), User(nullptr), Prev(nullptr), Next(nullptr) {}
301 if (Next) Next->Prev = &Next;
302 Prev = List;
307 *Prev = Next;
308 if (Next) Next->Prev = Prev;
/external/llvm/lib/Transforms/Vectorize/
H A DLoopVectorize.cpp836 ReductionInstDesc &Prev);
4232 ReductionInstDesc &Prev) {
4244 return ReductionInstDesc(Select, Prev.MinMaxKind);
4283 ReductionInstDesc &Prev) {
4293 return ReductionInstDesc(I, Prev.MinMaxKind);
4316 return isMinMaxSelectCmpPattern(I, Prev);
4231 isMinMaxSelectCmpPattern(Instruction *I, ReductionInstDesc &Prev) argument
4281 isReductionInstr(Instruction *I, ReductionKind Kind, ReductionInstDesc &Prev) argument
/external/clang/lib/Serialization/
H A DASTReader.cpp2000 MacroDirective *Prev = PP.getMacroDirective(II); local
2001 if (!Prev && Overrides.empty())
2004 DefMacroDirective *PrevDef = Prev ? Prev->getDefinition().getDirective()
2050 AmbiguousMacros *Prev = local
2059 if (!Prev) {
2063 assert(!Prev->empty());
2069 MacroInfo *NewMI = Prev->back()->getInfo();
2070 Prev->pop_back();
2083 while (!Prev
8041 NestedNameSpecifier *NNS = nullptr, *Prev = nullptr; local
[all...]

Completed in 1962 milliseconds

12