Home
last modified time | relevance | path

Searched refs:Prev (Results 1 – 25 of 192) sorted by relevance

12345678

/openbsd/src/gnu/llvm/compiler-rt/lib/scudo/standalone/
Dlist.h114 void insert(T *Prev, T *X) { in insert()
116 DCHECK_NE(Prev, nullptr); in insert()
118 X->Next = Prev->Next; in insert()
119 Prev->Next = X; in insert()
120 if (Last == Prev) in insert()
125 void extract(T *Prev, T *X) { in extract()
127 DCHECK_NE(Prev, nullptr); in extract()
129 DCHECK_EQ(Prev->Next, X); in extract()
130 Prev->Next = X->Next; in extract()
132 Last = Prev; in extract()
[all …]
/openbsd/src/gnu/llvm/clang/lib/AST/Interp/
DInterpBlock.cpp25 Pointers->Prev = P; in addPointer()
27 P->Prev = nullptr; in addPointer()
36 if (P->Prev) in removePointer()
37 P->Prev->Next = P->Next; in removePointer()
39 P->Next->Prev = P->Prev; in removePointer()
50 To->Prev = From->Prev; in movePointer()
51 if (To->Prev) in movePointer()
52 To->Prev->Next = To; in movePointer()
55 To->Next->Prev = To; in movePointer()
59 From->Prev = nullptr; in movePointer()
[all …]
/openbsd/src/gnu/llvm/clang/include/clang/Serialization/
DSourceLocationEncoding.h94 UIntTy &Prev; variable
104 SourceLocationSequence(UIntTy &Prev) : Prev(Prev) {} in SourceLocationSequence() argument
110 if (Prev == 0) in encodeRaw()
111 return Prev = Rotated; in encodeRaw()
112 UIntTy Delta = Rotated - Prev; in encodeRaw()
113 Prev = Rotated; in encodeRaw()
121 if (Prev == 0) in decodeRaw()
122 return SourceLocationEncoding::decodeRaw(Prev = Encoded); in decodeRaw()
123 return SourceLocationEncoding::decodeRaw(Prev += zagZig(Encoded - 1)); in decodeRaw()
139 UIntTy Prev = 0; variable
[all …]
/openbsd/src/gnu/llvm/llvm/include/llvm/ADT/
DSparseMultiSet.h100 unsigned Prev; member
103 SMSNode(ValueT D, unsigned P, unsigned N) : Data(D), Prev(P), Next(N) {} in SMSNode()
112 return Prev == INVALID; in isTombstone()
117 bool isValid() const { return Prev != INVALID; } in isValid()
146 return Dense[D.Prev].isTail(); in isHead()
154 return &Dense[N.Prev] == &N; in isSingleton()
159 unsigned addValue(const ValueT& V, unsigned Prev, unsigned Next) { in addValue() argument
161 Dense.push_back(SMSNode(V, Prev, Next)); in addValue()
170 Dense[Idx] = SMSNode(V, Prev, Next); in addValue()
178 Dense[Idx].Prev = SMSNode::INVALID; in makeTombstone()
[all …]
Dilist_base.h23 node_base_type &Prev = *Next.getPrev(); in insertBeforeImpl() local
25 N.setPrev(&Prev); in insertBeforeImpl()
26 Prev.setNext(&N); in insertBeforeImpl()
31 node_base_type *Prev = N.getPrev(); in removeImpl() local
33 Next->setPrev(Prev); in removeImpl()
34 Prev->setNext(Next); in removeImpl()
42 node_base_type *Prev = First.getPrev(); in removeRangeImpl() local
44 Last.setPrev(Prev); in removeRangeImpl()
45 Prev->setNext(&Last); in removeRangeImpl()
69 node_base_type &Prev = *Next.getPrev(); in transferBeforeImpl() local
[all …]
Dilist_node_base.h22 ilist_node_base *Prev = nullptr; variable
26 void setPrev(ilist_node_base *Prev) { this->Prev = Prev; } in setPrev() argument
28 ilist_node_base *getPrev() const { return Prev; } in getPrev()
40 void setPrev(ilist_node_base *Prev) { PrevAndSentinel.setPointer(Prev); } in setPrev() argument
/openbsd/src/gnu/llvm/llvm/lib/IR/
DUse.cpp20 std::swap(Prev, RHS.Prev); in swap()
22 *Prev = this; in swap()
24 Next->Prev = &Next; in swap()
26 *RHS.Prev = &RHS; in swap()
28 RHS.Next->Prev = &RHS.Next; in swap()
DBasicBlock.cpp157 const Instruction *Prev = RI->getPrevNode(); in getTerminatingMustTailCall() local
158 if (!Prev) in getTerminatingMustTailCall()
162 if (RV != Prev) in getTerminatingMustTailCall()
166 if (auto *BI = dyn_cast<BitCastInst>(Prev)) { in getTerminatingMustTailCall()
168 Prev = BI->getPrevNode(); in getTerminatingMustTailCall()
169 if (!Prev || RV != Prev) in getTerminatingMustTailCall()
174 if (auto *CI = dyn_cast<CallInst>(Prev)) { in getTerminatingMustTailCall()
559 const Instruction *Prev = nullptr; in validateInstrOrdering() local
561 assert((!Prev || Prev->comesBefore(&I)) && in validateInstrOrdering()
563 Prev = &I; in validateInstrOrdering()
/openbsd/src/gnu/llvm/compiler-rt/lib/xray/
Dxray_segmented_array.h35 Segment *Prev; member
119 DCHECK_NE(S->Prev, &SentinelSegment);
120 S = S->Prev;
222 DCHECK_EQ(Freelist->Prev, &SentinelSegment); in NewSegment()
241 Freelist->Prev = &SentinelSegment; in NewSegment()
244 FreeSegment->Prev = &SentinelSegment; in NewSegment()
247 DCHECK_EQ(Freelist->Prev, &SentinelSegment); in NewSegment()
269 DCHECK_EQ(S->Prev, &SentinelSegment); in InitHeadAndTail()
275 DCHECK_EQ(Tail->Prev, &SentinelSegment); in InitHeadAndTail()
285 DCHECK_EQ(S->Prev, &SentinelSegment); in AppendNewSegment()
[all …]
/openbsd/src/gnu/llvm/llvm/include/llvm/IR/
DUse.h95 Use **Prev = nullptr; variable
101 Next->Prev = &Next; in addToList()
102 Prev = List; in addToList()
103 *Prev = this; in addToList()
107 *Prev = Next; in removeFromList()
109 Next->Prev = Prev; in removeFromList()
/openbsd/src/gnu/llvm/llvm/lib/Transforms/Utils/
DAMDGPUEmitPrintf.cpp83 auto *Prev = Builder.GetInsertBlock(); in getStrlenWithNull() local
84 Module *M = Prev->getModule(); in getStrlenWithNull()
98 if (Prev->getTerminator()) { in getStrlenWithNull()
99 Join = Prev->splitBasicBlock(Builder.GetInsertPoint(), in getStrlenWithNull()
101 Prev->getTerminator()->eraseFromParent(); in getStrlenWithNull()
104 Prev->getParent()); in getStrlenWithNull()
108 Prev->getParent(), Join); in getStrlenWithNull()
111 Prev->getParent(), Join); in getStrlenWithNull()
114 Builder.SetInsertPoint(Prev); in getStrlenWithNull()
117 BranchInst::Create(Join, While, CmpNull, Prev); in getStrlenWithNull()
[all …]
/openbsd/src/gnu/llvm/llvm/lib/Target/WebAssembly/
DWebAssemblyDebugFixup.cpp128 auto Prev = Stack.back(); in runOnMachineFunction() local
130 assert(Prev.Reg == MO.getReg() && in runOnMachineFunction()
134 if (Prev.DebugValue && !MI.isTerminator()) { in runOnMachineFunction()
139 BuildMI(*Prev.DebugValue->getParent(), std::next(MII), in runOnMachineFunction()
140 Prev.DebugValue->getDebugLoc(), in runOnMachineFunction()
142 Prev.DebugValue->getOperand(2).getMetadata(), in runOnMachineFunction()
143 Prev.DebugValue->getOperand(3).getMetadata()); in runOnMachineFunction()
/openbsd/src/gnu/usr.bin/texinfo/util/
Dprepinfo.awk67 Prev[0] = "(dir)"
135 if (levelnum in Prev) {
136 Node[Prev[levelnum] ".next"] = Name
137 Node[Name ".prev"] = Prev[levelnum]
139 Prev[levelnum] = Name
144 if (levelnum in Prev) {
145 Node[Name ".prev"] = Prev[levelnum]
146 Node[Prev[levelnum] ".next"] = Name
148 Prev[levelnum] = Name
154 Prev[levelnum] = Name
/openbsd/src/gnu/llvm/llvm/lib/DebugInfo/CodeView/
DTypeTableCollection.cpp30 std::optional<TypeIndex> TypeTableCollection::getNext(TypeIndex Prev) { in getNext() argument
31 assert(contains(Prev)); in getNext()
32 ++Prev; in getNext()
33 if (Prev.toArrayIndex() == size()) in getNext()
35 return Prev; in getNext()
DTypeHashing.cpp48 auto Prev = (Ref.Kind == TiRefKind::IndexRef) ? PreviousIds : PreviousTypes; in hashType() local
61 if (TI.toArrayIndex() >= Prev.size() || in hashType()
62 Prev[TI.toArrayIndex()].empty()) { in hashType()
67 BytesToHash = Prev[TI.toArrayIndex()].Hash; in hashType()
DLazyRandomTypeCollection.cpp180 auto Prev = std::prev(Next); in visitRangeForType() local
182 TypeIndex TIB = Prev->Type; in visitRangeForType()
199 visitRange(TIB, Prev->Offset, TIE); in visitRangeForType()
212 std::optional<TypeIndex> LazyRandomTypeCollection::getNext(TypeIndex Prev) { in getNext() argument
216 if (auto EC = ensureTypeExists(Prev + 1)) { in getNext()
221 return Prev + 1; in getNext()
/openbsd/src/gnu/llvm/llvm/lib/DebugInfo/GSYM/
DLineTable.cpp193 LineEntry Prev(BaseAddr, 1, Lines.front().Line); in encode() local
199 Out.writeULEB(Prev.Line); in encode()
207 if (Curr.Addr < Prev.Addr) in encode()
210 const uint64_t AddrDelta = Curr.Addr - Prev.Addr; in encode()
212 if (Curr.Line > Prev.Line) in encode()
213 LineDelta = Curr.Line - Prev.Line; in encode()
214 else if (Prev.Line > Curr.Line) in encode()
215 LineDelta = -((int32_t)(Prev.Line - Curr.Line)); in encode()
218 if (Curr.File != Prev.File) { in encode()
242 Prev = Curr; in encode()
DGsymCreator.cpp226 [&](const auto &Prev, const auto &Curr) { in finalize() argument
230 const bool ranges_equal = Prev.Range == Curr.Range; in finalize()
231 if (ranges_equal || Prev.Range.intersects(Curr.Range)) { in finalize()
240 if (Prev == Curr) { in finalize()
250 if (!Prev.hasRichInfo() && Curr.hasRichInfo()) { in finalize()
260 << Prev << "\nIn favor of this one:\n" in finalize()
269 << Prev << "\n" in finalize()
273 } else if (Prev.Range.size() == 0 && in finalize()
274 Curr.Range.contains(Prev.Range.start())) { in finalize()
277 << Prev << "\nKeeping:\n" in finalize()
/openbsd/src/gnu/llvm/llvm/lib/CodeGen/
DMachineRegisterInfo.cpp276 MO->Contents.Reg.Prev = MO; in addRegOperandToUseList()
284 MachineOperand *Last = Head->Contents.Reg.Prev; in addRegOperandToUseList()
287 Head->Contents.Reg.Prev = MO; in addRegOperandToUseList()
288 MO->Contents.Reg.Prev = Last; in addRegOperandToUseList()
312 MachineOperand *Prev = MO->Contents.Reg.Prev; in removeRegOperandFromUseList() local
318 Prev->Contents.Reg.Next = Next; in removeRegOperandFromUseList()
320 (Next ? Next : Head)->Contents.Reg.Prev = Prev; in removeRegOperandFromUseList()
322 MO->Contents.Reg.Prev = nullptr; in removeRegOperandFromUseList()
353 MachineOperand *Prev = Src->Contents.Reg.Prev; in moveOperands() local
356 assert(Prev && "Operand was not on use-def list"); in moveOperands()
[all …]
DStackProtector.cpp500 Instruction *Prev = CheckLoc->getPrevNonDebugInstruction(); in InsertStackProtectors() local
501 if (Prev && isa<CallInst>(Prev) && cast<CallInst>(Prev)->isTailCall()) in InsertStackProtectors()
502 CheckLoc = Prev; in InsertStackProtectors()
503 else if (Prev) { in InsertStackProtectors()
504 Prev = Prev->getPrevNonDebugInstruction(); in InsertStackProtectors()
505 if (Prev && isa<CallInst>(Prev) && cast<CallInst>(Prev)->isTailCall()) in InsertStackProtectors()
506 CheckLoc = Prev; in InsertStackProtectors()
/openbsd/src/gnu/llvm/compiler-rt/lib/tsan/tests/unit/
Dtsan_ilist_test.cpp48 EXPECT_EQ(list.Prev(&node), nullptr); in TEST()
70 EXPECT_EQ(list.Prev(&nodes[0]), &nodes[1]); in TEST()
73 EXPECT_EQ(list.Prev(&nodes[1]), &nodes[2]); in TEST()
76 EXPECT_EQ(list.Prev(&nodes[2]), nullptr); in TEST()
106 EXPECT_EQ(list1.Prev(&nodes[1]), &nodes[2]); in TEST()
109 EXPECT_EQ(list2.Prev(&nodes[1]), nullptr); in TEST()
/openbsd/src/gnu/llvm/llvm/lib/Target/NVPTX/
DNVPTXPeephole.cpp114 auto &Prev = *MRI.getUniqueVRegDef(Root.getOperand(1).getReg()); in CombineCVTAToLocal() local
120 BuildMI(MF, Root.getDebugLoc(), TII->get(Prev.getOpcode()), in CombineCVTAToLocal()
123 .add(Prev.getOperand(2)); in CombineCVTAToLocal()
128 if (MRI.hasOneNonDBGUse(Prev.getOperand(0).getReg())) { in CombineCVTAToLocal()
129 Prev.eraseFromParent(); in CombineCVTAToLocal()
/openbsd/src/gnu/llvm/llvm/include/llvm/Support/
DUnicodeCharRanges.h72 uint32_t Prev = 0; in rangesAreValid() local
75 if (I != Ranges.begin() && Prev >= I->Lower) { in rangesAreValid()
77 LLVM_DEBUG(dbgs().write_hex(Prev)); in rangesAreValid()
89 Prev = I->Upper; in rangesAreValid()
/openbsd/src/gnu/llvm/llvm/lib/Option/
DOption.cpp128 const char *Prev = Str; in acceptInternal() local
133 if (Prev != Str) { in acceptInternal()
134 char *Value = new char[Str - Prev + 1]; in acceptInternal()
135 memcpy(Value, Prev, Str - Prev); in acceptInternal()
136 Value[Str - Prev] = '\0'; in acceptInternal()
143 Prev = Str + 1; in acceptInternal()
/openbsd/src/gnu/llvm/llvm/lib/Support/
DTimer.cpp293 TimerGroupList->Prev = &Next; in TimerGroup()
295 Prev = &TimerGroupList; in TimerGroup()
317 *Prev = Next; in ~TimerGroup()
319 Next->Prev = Prev; in ~TimerGroup()
333 *T.Prev = T.Next; in removeTimer()
335 T.Next->Prev = T.Prev; in removeTimer()
351 FirstTimer->Prev = &T.Next; in addTimer()
353 T.Prev = &FirstTimer; in addTimer()

12345678