/external/llvm/include/llvm/ADT/ |
ilist.h | 20 // that the nodes contain next/prev pointers. This list replacement does not 27 // of this, users of the direct next/prev links will see an extra link on the 32 // 1. The user must provide {g|s}et{Next|Prev} methods, or specialize 34 // prev links. 53 /// that provides default next/prev implementations for common operations. 62 static void setPrev(NodeTy *N, NodeTy *Prev) { N->setPrev(Prev); } 73 /// strategy. The sentinel is stored in the prev field of ilist's Head. 180 // can change what next/prev fields are used to store the links... 343 /// holds the next/prev pointers. The only state of the list itself is a singl [all...] |
/external/llvm/lib/Analysis/ |
LoopAccessAnalysis.cpp | 753 UnderlyingObjToAccessMap::iterator Prev = 755 if (Prev != ObjToLastAccess.end()) 756 DepCands.unionSets(Access, Prev->second); [all...] |
/external/llvm/lib/CodeGen/ |
TargetInstrInfo.cpp | 620 // B = A op X (Prev) 645 // possibility for the Prev instruction in the sequence and let the 663 MachineInstr &Root, MachineInstr &Prev, 693 MachineOperand &OpA = Prev.getOperand(OpIdx[Row][0]); 695 MachineOperand &OpX = Prev.getOperand(OpIdx[Row][2]); 729 BuildMI(*MF, Prev.getDebugLoc(), TII->get(Opcode), NewVR) 737 setSpecialOperandAttr(Root, Prev, *MIB1, *MIB2); 742 DelInstrs.push_back(&Prev); 754 MachineInstr *Prev = nullptr; 758 Prev = MRI.getUniqueVRegDef(Root.getOperand(1).getReg()) [all...] |
/external/llvm/lib/IR/ |
ConstantFold.cpp | [all...] |
/external/llvm/lib/MC/ |
MCAssembler.cpp | 580 MCFragment *Prev = F->getPrevNode(); 586 assert((!Prev || isFragmentValid(Prev)) && 592 if (Prev) 593 F->Offset = Prev->Offset + getAssembler().computeFragmentSize(*this, *Prev); 605 // Prev |##########| F | 669 // | Prev |####|####| F | [all...] |
/external/clang/include/clang/AST/ |
DeclBase.h | 912 Decl *Prev = getPreviousDecl(); 916 if (Prev && Prev->getIdentifierNamespace() & IDNS_Ordinary) [all...] |
/external/clang/lib/AST/ |
ASTDumper.cpp | 784 if (Decl *Prev = D->getPreviousDecl()) 785 DumpWithPrev(Prev); 838 const T *Prev = D->getPreviousDecl(); 839 if (Prev) 840 OS << " prev " << Prev; [all...] |
Decl.cpp | [all...] |
/external/llvm/include/llvm/CodeGen/ |
SelectionDAGNodes.h | 227 /// pointer to the SDNode using the value, and Next and Prev pointers, 235 /// Prev, Next - Pointers to the uses list of the SDNode referred by 237 SDUse **Prev, *Next; 243 SDUse() : Val(), User(nullptr), Prev(nullptr), Next(nullptr) {} 298 if (Next) Next->Prev = &Next; 299 Prev = List; 304 *Prev = Next; 305 if (Next) Next->Prev = Prev; [all...] |
/external/llvm/lib/CodeGen/AsmPrinter/ |
DwarfDebug.cpp | [all...] |
/external/llvm/utils/TableGen/ |
AsmMatcherEmitter.cpp | [all...] |
/external/clang/lib/Parse/ |
ParseDecl.cpp | [all...] |
/external/clang/lib/Sema/ |
SemaTemplateInstantiateDecl.cpp | 409 if (TypedefNameDecl *Prev = getPreviousDeclForInstantiation(D)) { 410 NamedDecl *InstPrev = SemaRef.FindInstantiatedDecl(D->getLocation(), Prev, 780 NamedDecl *Prev = SemaRef.FindInstantiatedDecl(D->getLocation(), 783 if (!Prev) return nullptr; 784 PrevDecl = cast<EnumDecl>(Prev); [all...] |
SemaTemplate.cpp | [all...] |
SemaChecking.cpp | [all...] |
SemaDecl.cpp | 9973 VarDecl *prev = var->getPreviousDecl(); local [all...] |
SemaDeclCXX.cpp | [all...] |
SemaExpr.cpp | [all...] |
/external/clang/lib/StaticAnalyzer/Core/ |
BugReporter.cpp | [all...] |
/external/llvm/lib/Transforms/Scalar/ |
GVN.cpp | 665 LeaderTableEntry* Prev = nullptr; 669 Prev = Curr; 676 if (Prev) { 677 Prev->Next = Curr->Next; [all...] |
/external/clang/lib/Analysis/ |
CFG.cpp | 189 /// Create valid iterator. In case when S.Prev is an invalid iterator and 196 *this = Scope->Prev; 215 *this = Scope->Prev; 247 const_iterator Prev; 252 : ctx(std::move(ctx)), Vars(this->ctx, 4), Prev(P) {} 272 F = F.Scope->Prev; [all...] |
/external/clang/lib/Driver/ |
ToolChains.cpp | 789 unsigned Prev = Index; 800 if (!XarchArg || Index > Prev + 1) { [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/ddk/ |
wdm.h | [all...] |