| /src/external/apache2/llvm/dist/clang/lib/AST/Interp/ |
| InterpBlock.cpp | 25 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->Next = To
[all...] |
| InterpStack.h | 90 StackChunk *Prev;
93 StackChunk(StackChunk *Prev = nullptr)
94 : Next(nullptr), Prev(Prev), End(reinterpret_cast<char *>(this + 1)) {}
|
| InterpStack.cpp | 55 Ptr = Ptr->Prev;
72 Chunk = Chunk->Prev;
|
| /src/external/apache2/llvm/dist/llvm/lib/IR/ |
| Use.cpp | 22 std::swap(Prev, RHS.Prev);
24 *Prev = this;
26 Next->Prev = &Next;
28 *RHS.Prev = &RHS;
30 RHS.Next->Prev = &RHS.Next;
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/ADT/ |
| ilist_node_base.h | 22 ilist_node_base *Prev = nullptr;
26 void setPrev(ilist_node_base *Prev) { this->Prev = Prev; }
28 ilist_node_base *getPrev() const { return Prev; }
40 void setPrev(ilist_node_base *Prev) { PrevAndSentinel.setPointer(Prev); }
|
| ilist_base.h | 23 node_base_type &Prev = *Next.getPrev();
25 N.setPrev(&Prev);
26 Prev.setNext(&N);
31 node_base_type *Prev = N.getPrev();
33 Next->setPrev(Prev);
34 Prev->setNext(Next);
42 node_base_type *Prev = First.getPrev();
44 Last.setPrev(Prev);
45 Prev->setNext(&Last);
69 node_base_type &Prev = *Next.getPrev()
[all...] |
| SparseMultiSet.h | 92 /// circular in Prev indices, and INVALID-terminated in Next indices. This
100 unsigned Prev;
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, unsigned Next)
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/IR/ |
| Use.h | 17 /// one of the fields (Prev) of the Use class are used to encode offsets to be
96 Use **Prev = nullptr;
102 Next->Prev = &Next;
103 Prev = List;
104 *Prev = this;
108 *Prev = Next;
110 Next->Prev = Prev;
|
| /src/external/apache2/llvm/dist/llvm/lib/DebugInfo/CodeView/ |
| TypeTableCollection.cpp | 29 Optional<TypeIndex> TypeTableCollection::getNext(TypeIndex Prev) {
30 assert(contains(Prev));
31 ++Prev;
32 if (Prev.toArrayIndex() == size())
34 return Prev;
|
| TypeHashing.cpp | 48 auto Prev = (Ref.Kind == TiRefKind::IndexRef) ? PreviousIds : PreviousTypes;
61 if (TI.toArrayIndex() >= Prev.size() ||
62 Prev[TI.toArrayIndex()].empty()) {
67 BytesToHash = Prev[TI.toArrayIndex()].Hash;
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/Support/ |
| UnicodeCharRanges.h | 72 uint32_t Prev = 0;
75 if (I != Ranges.begin() && Prev >= I->Lower) {
77 LLVM_DEBUG(dbgs().write_hex(Prev));
89 Prev = I->Upper;
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/WebAssembly/ |
| WebAssemblyDebugFixup.cpp | 110 auto Prev = Stack.back();
112 assert(Prev.Reg == MO.getReg() &&
116 if (Prev.DebugValue && !MI.isTerminator()) {
118 // Prev.DebugValue, so now that we're popping it we must insert
121 BuildMI(*Prev.DebugValue->getParent(), std::next(MII),
122 Prev.DebugValue->getDebugLoc(),
124 Prev.DebugValue->getOperand(2).getMetadata(),
125 Prev.DebugValue->getOperand(3).getMetadata());
|
| /src/sys/external/bsd/acpica/dist/compiler/ |
| aslexternal.c | 88 ACPI_PARSE_OBJECT *Prev;
214 Prev = AslGbl_ExternalsListHead;
215 Next = Prev;
218 Prev = Next;
222 Prev->Asl.Next = ListOp;
479 ACPI_PARSE_OBJECT *Prev;
547 Prev = Next = ParentOp->Asl.Child;
553 Prev = Next;
559 if (Prev == ExternalOp)
566 Prev->Asl.Next = ExternalOp->Asl.Next
[all...] |
| /src/sys/external/bsd/compiler_rt/dist/lib/xray/ |
| xray_segmented_array.h | 36 Segment *Prev;
120 DCHECK_NE(S->Prev, &SentinelSegment);
121 S = S->Prev;
223 DCHECK_EQ(Freelist->Prev, &SentinelSegment);
242 Freelist->Prev = &SentinelSegment;
245 FreeSegment->Prev = &SentinelSegment;
248 DCHECK_EQ(Freelist->Prev, &SentinelSegment);
270 DCHECK_EQ(S->Prev, &SentinelSegment);
276 DCHECK_EQ(Tail->Prev, &SentinelSegment);
286 DCHECK_EQ(S->Prev, &SentinelSegment)
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Target/NVPTX/ |
| NVPTXPeephole.cpp | 109 auto &Prev = *MRI.getUniqueVRegDef(Root.getOperand(1).getReg());
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();
|
| /src/sys/external/bsd/acpica/dist/utilities/ |
| utaddress.c | 144 ACPI_ADDRESS_RANGE *Prev;
158 RangeInfo = Prev = AcpiGbl_AddressRangeList[SpaceId];
163 if (RangeInfo == Prev) /* Found at list head */
169 Prev->Next = RangeInfo->Next;
182 Prev = RangeInfo;
|
| /src/external/gpl2/texinfo/dist/util/ |
| prepinfo.awk | 67 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"] = Nam
[all...] |
| /src/sys/external/bsd/acpica/dist/disassembler/ |
| dmnames.c | 297 ACPI_PARSE_OBJECT *Prev;
335 Prev = NULL; /* Start with Root Node */
336 while (Prev != Op)
338 /* Search upwards in the tree to find scope with "prev" as its parent */
343 if (Search->Common.Parent == Prev)
353 if (Prev)
394 Prev = Search;
|
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/ |
| AMDGPUEmitPrintf.cpp | 96 auto *Prev = Builder.GetInsertBlock();
97 Module *M = Prev->getModule();
111 if (Prev->getTerminator()) {
112 Join = Prev->splitBasicBlock(Builder.GetInsertPoint(),
114 Prev->getTerminator()->eraseFromParent();
117 Prev->getParent());
121 Prev->getParent(), Join);
124 Prev->getParent(), Join);
127 Builder.SetInsertPoint(Prev);
130 BranchInst::Create(Join, While, CmpNull, Prev);
[all...] |
| /src/sys/external/bsd/acpica/dist/executer/ |
| exmutex.c | 88 (ObjDesc->Mutex.Next)->Mutex.Prev = ObjDesc->Mutex.Prev;
91 if (ObjDesc->Mutex.Prev)
93 (ObjDesc->Mutex.Prev)->Mutex.Next = ObjDesc->Mutex.Next;
101 (ObjDesc->Mutex.Prev)->Mutex.OriginalSyncLevel =
136 ObjDesc->Mutex.Prev = NULL;
143 ListHead->Mutex.Prev = ObjDesc;
489 "Prev SyncLevel %u, Depth %u TID %p\n",
509 "Prev SyncLevel %u, Depth %u\n",
577 ObjDesc->Mutex.Prev = NULL
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/DebugInfo/GSYM/ |
| GsymCreator.cpp | 225 [&](const auto &Prev, const auto &Curr) {
226 if (Prev.Range.intersects(Curr.Range)) {
228 if (Prev.Range == Curr.Range) {
235 if (Prev == Curr) {
245 if (!Prev.hasRichInfo() && Curr.hasRichInfo()) {
254 << Prev << "\nIn favor of this one:\n"
262 << Prev << "\n"
265 } else if (Prev.Range.size() == 0 &&
266 Curr.Range.contains(Prev.Range.Start)) {
268 << Prev << "\nKeeping:\n
[all...] |
| LineTable.cpp | 193 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 = Curr
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Option/ |
| Option.cpp | 128 const char *Prev = Str;
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;
|
| /src/sys/external/bsd/acpica/dist/parser/ |
| psparse.c | 148 ACPI_PARSE_OBJECT *Prev;
179 Prev = Op->Common.Parent->Common.Value.Arg;
180 if (!Prev)
265 if (Prev == Op)
285 else while (Prev)
289 Next = Prev->Common.Next;
297 Prev->Common.Next = ReplacementOp;
303 Prev->Common.Next = Op->Common.Next;
307 Prev = Next;
|
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| StackProtector.cpp | 479 Instruction *Prev = RI->getPrevNonDebugInstruction();
480 if (Prev && isa<CallInst>(Prev) && cast<CallInst>(Prev)->isMustTailCall())
481 CheckLoc = Prev;
482 else if (Prev) {
483 Prev = Prev->getPrevNonDebugInstruction();
484 if (Prev && isa<CallInst>(Prev) && cast<CallInst>(Prev)->isMustTailCall()
[all...] |
