Searched refs:Prev (Results 1 - 25 of 131) sorted by relevance

123456

/freebsd-11-stable/contrib/llvm-project/clang/lib/AST/Interp/
H A DBlock.cpp25 Pointers->Prev = P;
27 P->Prev = nullptr;
36 if (P->Prev)
37 P->Prev->Next = P->Next;
39 P->Next->Prev = P->Prev;
50 To->Prev = From->Prev;
51 if (To->Prev)
52 To->Prev
[all...]
H A DInterpStack.h90 StackChunk *Prev; member in struct:clang::interp::final::StackChunk
93 StackChunk(StackChunk *Prev = nullptr)
94 : Next(nullptr), Prev(Prev), End(reinterpret_cast<char *>(this + 1)) {}
H A DInterpStack.cpp55 Ptr = Ptr->Prev;
72 Chunk = Chunk->Prev;
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/ADT/
H A Dilist_node_base.h22 ilist_node_base *Prev = nullptr; member in class:llvm::ilist_node_base
26 void setPrev(ilist_node_base *Prev) { this->Prev = Prev; } argument
28 ilist_node_base *getPrev() const { return Prev; }
40 void setPrev(ilist_node_base *Prev) { PrevAndSentinel.setPointer(Prev); } argument
H A Dilist_base.h23 node_base_type &Prev = *Next.getPrev(); local
25 N.setPrev(&Prev);
26 Prev.setNext(&N);
31 node_base_type *Prev = N.getPrev(); local
33 Next->setPrev(Prev);
34 Prev->setNext(Next);
42 node_base_type *Prev = First.getPrev(); local
44 Last.setPrev(Prev);
45 Prev->setNext(&Last);
69 node_base_type &Prev local
[all...]
H A DSparseMultiSet.h92 /// circular in Prev indices, and INVALID-terminated in Next indices. This
100 unsigned Prev; member in struct:llvm::SparseMultiSet::SMSNode
103 SMSNode(ValueT D, unsigned P, unsigned N) : Data(D), Prev(P), Next(N) {}
112 return Prev == INVALID;
115 /// Since the list is circular in Prev, all non-tombstone nodes have a valid
116 /// Prev.
117 bool isValid() const { return Prev != INVALID; }
146 return Dense[D.Prev].isTail();
154 return &Dense[N.Prev] == &N;
159 unsigned addValue(const ValueT& V, unsigned Prev, unsigne argument
243 unsigned Prev() const { return SMS->Dense[Idx].Prev; } function in class:llvm::SparseMultiSet::iterator_base
[all...]
/freebsd-11-stable/contrib/llvm-project/compiler-rt/lib/scudo/standalone/
H A Dlist.h113 void extract(T *Prev, T *X) { argument
115 DCHECK_NE(Prev, nullptr);
117 DCHECK_EQ(Prev->Next, X);
118 Prev->Next = X->Next;
120 Last = Prev;
146 X->Prev = nullptr;
150 DCHECK_EQ(First->Prev, nullptr);
151 First->Prev = X;
162 T *Prev = Y->Prev;
200 T *Prev = X->Prev; local
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/DebugInfo/CodeView/
H A DTypeTableCollection.cpp29 Optional<TypeIndex> TypeTableCollection::getNext(TypeIndex Prev) { argument
30 assert(contains(Prev));
31 ++Prev;
32 if (Prev.toArrayIndex() == size())
34 return Prev;
H A DAppendingTypeTableBuilder.cpp46 Optional<TypeIndex> AppendingTypeTableBuilder::getNext(TypeIndex Prev) { argument
47 if (++Prev == nextTypeIndex())
49 return Prev;
H A DGlobalTypeTableBuilder.cpp48 Optional<TypeIndex> GlobalTypeTableBuilder::getNext(TypeIndex Prev) { argument
49 if (++Prev == nextTypeIndex())
51 return Prev;
H A DTypeHashing.cpp48 auto Prev = (Ref.Kind == TiRefKind::IndexRef) ? PreviousIds : PreviousTypes; local
61 if (TI.toArrayIndex() >= Prev.size() ||
62 Prev[TI.toArrayIndex()].empty()) {
67 BytesToHash = Prev[TI.toArrayIndex()].Hash;
H A DMergingTypeTableBuilder.cpp48 Optional<TypeIndex> MergingTypeTableBuilder::getNext(TypeIndex Prev) { argument
49 if (++Prev == nextTypeIndex())
51 return Prev;
/freebsd-11-stable/sys/contrib/dev/acpica/compiler/
H A Daslexternal.c192 ACPI_PARSE_OBJECT *Prev; local
216 Prev = Gbl_ExternalsListHead;
217 Next = Prev;
220 Prev = Next;
224 Prev->Asl.Next = ListOp;
434 ACPI_PARSE_OBJECT *Prev; local
502 Prev = Next = ParentOp->Asl.Child;
508 Prev = Next;
514 if (Prev == ExternalOp)
521 Prev
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Support/
H A DUnicodeCharRanges.h72 uint32_t Prev = 0; local
75 if (I != Ranges.begin() && Prev >= I->Lower) {
77 LLVM_DEBUG(dbgs().write_hex(Prev));
89 Prev = I->Upper;
/freebsd-11-stable/contrib/llvm-project/llvm/lib/DebugInfo/GSYM/
H A DGsymCreator.cpp192 auto Prev = Funcs.end(); local
196 if (Prev != Funcs.end()) {
197 if (Prev->Range.intersects(Curr->Range)) {
199 if (Prev->Range == Curr->Range) {
204 if (*Prev == *Curr) {
209 Curr = Funcs.erase(Prev);
211 if (!Prev->hasRichInfo() && Curr->hasRichInfo()) {
214 Curr = Funcs.erase(Prev);
218 << *Prev << "\nIn favor of this one:\n"
220 Curr = Funcs.erase(Prev);
[all...]
H A DLineTable.cpp193 LineEntry Prev(BaseAddr, 1, Lines.front().Line);
199 Out.writeULEB(Prev.Line);
207 if (Curr.Addr < Prev.Addr)
210 const uint64_t AddrDelta = Curr.Addr - Prev.Addr;
212 if (Curr.Line > Prev.Line)
213 LineDelta = Curr.Line - Prev.Line;
214 else if (Prev.Line > Curr.Line)
215 LineDelta = -((int32_t)(Prev.Line - Curr.Line));
218 if (Curr.File != Prev.File) {
242 Prev
[all...]
/freebsd-11-stable/contrib/llvm-project/compiler-rt/lib/xray/
H A Dxray_segmented_array.h35 Segment *Prev; member in struct:__xray::Array::Segment
119 DCHECK_NE(S->Prev, &SentinelSegment);
120 S = S->Prev;
222 DCHECK_EQ(Freelist->Prev, &SentinelSegment);
241 Freelist->Prev = &SentinelSegment;
244 FreeSegment->Prev = &SentinelSegment;
247 DCHECK_EQ(Freelist->Prev, &SentinelSegment);
269 DCHECK_EQ(S->Prev, &SentinelSegment);
275 DCHECK_EQ(Tail->Prev, &SentinelSegment);
285 DCHECK_EQ(S->Prev,
[all...]
/freebsd-11-stable/sys/contrib/dev/acpica/components/utilities/
H A Dutaddress.c252 ACPI_ADDRESS_RANGE *Prev; local
266 RangeInfo = Prev = AcpiGbl_AddressRangeList[SpaceId];
271 if (RangeInfo == Prev) /* Found at list head */
277 Prev->Next = RangeInfo->Next;
290 Prev = RangeInfo;
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/NVPTX/
H A DNVPTXPeephole.cpp109 auto &Prev = *MRI.getUniqueVRegDef(Root.getOperand(1).getReg()); local
112 BuildMI(MF, Root.getDebugLoc(), TII->get(Prev.getOpcode()),
115 .add(Prev.getOperand(2));
120 if (MRI.hasOneNonDBGUse(Prev.getOperand(0).getReg())) {
121 Prev.eraseFromParentAndMarkDBGValuesForRemoval();
/freebsd-11-stable/sys/contrib/dev/acpica/components/disassembler/
H A Ddmnames.c405 ACPI_PARSE_OBJECT *Prev; local
443 Prev = NULL; /* Start with Root Node */
444 while (Prev != Op)
451 if (Search->Common.Parent == Prev)
461 if (Prev)
502 Prev = Search;
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/IR/
H A DUse.h17 /// one of the fields (Prev) of the Use class are used to encode offsets to be
79 /// Pointer traits for the Prev PointerIntPair. This ensures we always use
101 Use(PrevPtrTag tag) { Prev.setInt(tag); }
143 PointerIntPair<Use **, 2, PrevPtrTag, PrevPointerTraits> Prev; member in class:llvm::Use
145 void setPrev(Use **NewPrev) { Prev.setPointer(NewPrev); }
156 Use **StrippedPrev = Prev.getPointer();
/freebsd-11-stable/sys/contrib/dev/acpica/components/executer/
H A Dexmutex.c196 (ObjDesc->Mutex.Next)->Mutex.Prev = ObjDesc->Mutex.Prev;
199 if (ObjDesc->Mutex.Prev)
201 (ObjDesc->Mutex.Prev)->Mutex.Next = ObjDesc->Mutex.Next;
209 (ObjDesc->Mutex.Prev)->Mutex.OriginalSyncLevel =
244 ObjDesc->Mutex.Prev = NULL;
251 ListHead->Mutex.Prev = ObjDesc;
597 "Prev SyncLevel %u, Depth %u TID %p\n",
617 "Prev SyncLevel %u, Depth %u\n",
685 ObjDesc->Mutex.Prev
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Option/
H A DOption.cpp128 const char *Prev = Str; local
133 if (Prev != Str) {
134 char *Value = new char[Str - Prev + 1];
135 memcpy(Value, Prev, Str - Prev);
136 Value[Str - Prev] = '\0';
143 Prev = Str + 1;
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/DebugInfo/CodeView/
H A DTypeCollection.h26 virtual Optional<TypeIndex> getNext(TypeIndex Prev) = 0;
H A DTypeTableCollection.h25 Optional<TypeIndex> getNext(TypeIndex Prev) override;

Completed in 138 milliseconds

123456