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

12

/external/mesa3d/src/gallium/drivers/r300/compiler/
H A Dradeon_list.h35 struct rc_list * Prev; member in struct:rc_list
H A Dradeon_program.h134 struct rc_instruction * Prev; member in struct:rc_instruction
154 * Instructions.Prev points to the last instruction.
/external/llvm/include/llvm/ADT/
H A Dilist_node.h28 NodeTy *Prev; member in class:llvm::ilist_half_node
30 NodeTy *getPrev() { return Prev; }
31 const NodeTy *getPrev() const { return Prev; }
32 void setPrev(NodeTy *P) { Prev = P; }
33 ilist_half_node() : Prev(nullptr) {}
59 NodeTy *Prev = this->getPrev(); local
62 if (!Prev->getNext())
65 return Prev;
70 const NodeTy *Prev = this->getPrev(); local
73 if (!Prev
[all...]
H A DSparseMultiSet.h85 /// circular in Prev indices, and INVALID-terminated in Next indices. This
93 unsigned Prev; member in struct:llvm::SparseMultiSet::SMSNode
96 SMSNode(ValueT D, unsigned P, unsigned N) : Data(D), Prev(P), Next(N) { }
105 return Prev == INVALID;
108 /// Since the list is circular in Prev, all non-tombstone nodes have a valid
109 /// Prev.
110 bool isValid() const { return Prev != INVALID; }
144 return Dense[D.Prev].isTail();
152 return &Dense[N.Prev] == &N;
157 unsigned addValue(const ValueT& V, unsigned Prev, unsigne argument
240 unsigned Prev() const { return SMS->Dense[Idx].Prev; } function in class:llvm::SparseMultiSet::iterator_base
[all...]
/external/llvm/tools/lli/
H A DRemoteTarget.cpp33 sys::MemoryBlock *Prev = Allocations.size() ? &Allocations.back() : nullptr; local
34 sys::MemoryBlock Mem = sys::Memory::AllocateRWX(Size, Prev, &ErrorMsg);
/external/skia/experimental/PdfViewer/pdfparser/native/pdfapi/
H A DSkPdfFileTrailerDictionary_autogen.cpp23 int64_t SkPdfFileTrailerDictionary::Prev(SkPdfNativeDoc* doc) { function in class:SkPdfFileTrailerDictionary
24 SkPdfNativeObject* ret = get("Prev", "");
32 return get("Prev", "") != NULL;
H A DSkPdfOutlineItemDictionary_autogen.cpp35 SkPdfDictionary* SkPdfOutlineItemDictionary::Prev(SkPdfNativeDoc* doc) { function in class:SkPdfOutlineItemDictionary
36 SkPdfNativeObject* ret = get("Prev", "");
44 return get("Prev", "") != NULL;
/external/llvm/include/llvm/Support/
H A DUnicodeCharRanges.h71 uint32_t Prev = 0; local
74 if (I != Ranges.begin() && Prev >= I->Lower) {
76 DEBUG(dbgs().write_hex(Prev));
88 Prev = I->Upper;
H A DRecycler.h35 RecyclerStruct *Prev, *Next; member in struct:llvm::RecyclerStruct
41 static RecyclerStruct *getPrev(const RecyclerStruct *t) { return t->Prev; }
43 static void setPrev(RecyclerStruct *t, RecyclerStruct *p) { t->Prev = p; }
H A DTimer.h85 Timer **Prev, *Next; // Doubly linked list of timers in the group. member in class:llvm::Timer
165 TimerGroup **Prev, *Next; // Doubly linked list of TimerGroup's. member in class:llvm::TimerGroup
H A DRegistry.h145 listener *Prev, *Next; member in class:llvm::Registry::listener
162 listener() : Prev(ListenerTail), Next(0) {
163 if (Prev)
164 Prev->Next = this;
172 Next->Prev = Prev;
174 ListenerTail = Prev;
175 if (Prev)
176 Prev->Next = Next;
/external/llvm/lib/Option/
H A DOption.cpp140 const char *Prev = Str; local
145 if (Prev != Str) {
146 char *Value = new char[Str - Prev + 1];
147 memcpy(Value, Prev, Str - Prev);
148 Value[Str - Prev] = '\0';
155 Prev = Str + 1;
H A DOptTable.cpp194 unsigned Prev = Index; local
238 if (Prev != Index)
275 unsigned Prev = Index; local
277 assert(Index > Prev && "Parser failed to consume argument.");
282 assert(Index - Prev - 1 && "No missing arguments!");
283 MissingArgIndex = Prev;
284 MissingArgCount = Index - Prev - 1;
/external/clang/lib/Lex/
H A DMacroInfo.cpp218 if (auto *Prev = getPrevious())
219 Out << " prev " << Prev; local
/external/llvm/include/llvm/IR/
H A DUse.h18 /// one of the fields (Prev) of the Use class are used to encode offsets to be
91 Use(PrevPtrTag tag) : Val(nullptr) { Prev.setInt(tag); }
137 PointerIntPair<Use **, 2, PrevPtrTag> Prev; member in class:llvm::Use
139 void setPrev(Use **NewPrev) { Prev.setPointer(NewPrev); }
148 Use **StrippedPrev = Prev.getPointer();
/external/llvm/lib/CodeGen/
H A DMachineRegisterInfo.cpp176 // Prev pointers are circular, so Head->Prev == Last.
180 MO->Contents.Reg.Prev = MO;
187 // Insert MO between Last and Head in the circular Prev chain.
188 MachineOperand *Last = Head->Contents.Reg.Prev;
191 Head->Contents.Reg.Prev = MO;
192 MO->Contents.Reg.Prev = Last;
216 MachineOperand *Prev = MO->Contents.Reg.Prev; local
218 // Prev link
257 MachineOperand *Prev = Src->Contents.Reg.Prev; local
[all...]
/external/clang/test/CXX/class.access/class.friend/
H A Dp1.cpp123 X *Prev; member in class:test2::ilist_half_node
125 X *getPrev() { return Prev; } // expected-note{{member is declared here}}
/external/llvm/lib/Analysis/
H A DBlockFrequencyInfoImpl.cpp698 auto Prev = OuterLoop ? std::prev(Insert) : Loops.end(); local
709 return make_range(std::next(Prev), Insert);
/external/llvm/lib/CodeGen/AsmPrinter/
H A DEHStreamer.cpp285 CallSiteEntry &Prev = CallSites.back(); local
286 if (Site.LPad == Prev.LPad && Site.Action == Prev.Action) {
288 Prev.EndLabel = Site.EndLabel;
/external/llvm/lib/ProfileData/
H A DCoverageMapping.cpp75 auto Prev = Terms.begin(); local
76 for (auto I = Prev + 1, E = Terms.end(); I != E; ++I) {
77 if (I->first == Prev->first) {
78 Prev->second += I->second;
81 ++Prev;
82 *Prev = *I;
84 Terms.erase(++Prev, Terms.end());
/external/clang/include/clang/Analysis/Analyses/
H A DThreadSafetyCommon.h325 CallingContext *Prev; // The previous context; or 0 if none. member in struct:clang::threadSafety::SExprBuilder::CallingContext
333 : Prev(P), AttrDecl(D), SelfArg(nullptr),
/external/clang/include/clang/Lex/
H A DMacroInfo.h382 void setPrevious(MacroDirective *Prev) { argument
383 Previous = Prev;
/external/llvm/include/llvm/CodeGen/
H A DMachineOperand.h165 MachineOperand *Prev; // Access list for register. See MRI. member in struct:llvm::MachineOperand::__anon10138::__anon10139
606 Op.Contents.Reg.Prev = nullptr;
726 return Contents.Reg.Prev != nullptr;
/external/lzma/C/
H A DPpmd7.c49 CPpmd7_Node_Ref Prev; member in struct:CPpmd7_Node_
167 n = NODE(n)->Prev = next;
175 NODE(n)->Prev = head;
190 NODE(node2->Prev)->Next = node2->Next;
191 NODE(node2->Next)->Prev = node2->Prev;
/external/pdfium/fpdfsdk/src/
H A Dfsdk_annothandler.cpp849 CPDFSDK_Annot* CPDFSDK_AnnotIterator::Prev(const CPDFSDK_Annot* pCurrent) function in class:CPDFSDK_AnnotIterator
862 CPDFSDK_Annot* CPDFSDK_AnnotIterator::Prev(int& index ) function in class:CPDFSDK_AnnotIterator

Completed in 577 milliseconds

12