HomeSort by: relevance | last modified time | path
    Searched defs:Prev (Results 1 - 25 of 78) sorted by relevancy

1 2 3 4

  /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/apache2/llvm/dist/llvm/include/llvm/ADT/
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...]
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); }
  /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/DebugInfo/CodeView/
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;
LazyRandomTypeCollection.cpp 181 auto Prev = std::prev(Next);
183 TypeIndex TIB = Prev->Type;
200 visitRange(TIB, Prev->Offset, TIE);
213 Optional<TypeIndex> LazyRandomTypeCollection::getNext(TypeIndex Prev) {
217 if (auto EC = ensureTypeExists(Prev + 1)) {
222 return Prev + 1;
  /src/external/apache2/llvm/dist/llvm/tools/llvm-pdbutil/
PrettyClassLayoutGraphicalDumper.cpp 78 uint32_t Prev = RelativeOffset + Item->getLayoutSize() - 1;
79 if (Prev < UseMap.size())
80 NextPaddingByte = UseMap.find_next_unset(Prev);
  /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;
psargs.c 833 ACPI_PARSE_OBJECT *Prev = NULL;
892 if (Prev)
894 Prev->Common.Next = Field;
900 Prev = Field;
  /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/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/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/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 84 ACPI_PARSE_OBJECT *Prev;
158 Prev = AslGbl_ExternalsListHead;
159 Next = Prev;
162 Prev = Next;
166 Prev->Asl.Next = ListOp;
376 ACPI_PARSE_OBJECT *Prev;
444 Prev = Next = ParentOp->Asl.Child;
450 Prev = Next;
456 if (Prev == ExternalOp)
463 Prev->Asl.Next = ExternalOp->Asl.Next
    [all...]
dtfield.c 728 DT_FIELD *Prev;
732 Prev = Next = AslGbl_FieldList;
736 Prev = Next;
740 if (Prev)
742 Prev->Next = Field;
aslerror.c 187 ASL_ERROR_MSG *Prev;
202 Prev = NULL;
207 Prev = Next;
215 if (Prev)
217 Prev->Next = Enode;
  /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/clang/lib/AST/Interp/
InterpBlock.h 129 DeadBlock *Prev;
InterpStack.h 90 StackChunk *Prev;
93 StackChunk(StackChunk *Prev = nullptr)
94 : Next(nullptr), Prev(Prev), End(reinterpret_cast<char *>(this + 1)) {}
  /src/external/apache2/llvm/dist/clang/lib/CodeGen/
CGOpenCLRuntime.cpp 131 const Expr *Prev = nullptr; // to make sure we do not stuck in infinite loop.
132 while(!isa<BlockExpr>(E) && E != Prev) {
133 Prev = E;
  /src/external/apache2/llvm/dist/clang/lib/Lex/
MacroInfo.cpp 225 if (auto *Prev = getPrevious())
226 Out << " prev " << Prev;
  /src/external/gpl3/gcc.old/dist/libsanitizer/tsan/
tsan_ilist.h 55 // Prev links point towards front of the queue.
56 Elem* Prev(Elem* e);
108 INode* prev = n->prev_; local
110 DCHECK(prev);
112 next->prev_ = prev;
113 prev->next_ = next;
145 Elem* IList<Base, Node, Elem>::Prev(Elem* e) {
  /src/external/apache2/llvm/dist/clang/include/clang/AST/
JSONNodeDumper.h 178 const T *Prev = D->getPreviousDecl();
179 if (Prev)
180 JOS.attribute("previousDecl", createPointerRepresentation(Prev));
  /src/external/apache2/llvm/dist/llvm/lib/ProfileData/Coverage/
CoverageMapping.cpp 90 auto Prev = Terms.begin();
91 for (auto I = Prev + 1, E = Terms.end(); I != E; ++I) {
92 if (I->CounterID == Prev->CounterID) {
93 Prev->Factor += I->Factor;
96 ++Prev;
97 *Prev = *I;
99 Terms.erase(++Prev, Terms.end());
  /src/external/apache2/llvm/dist/llvm/lib/Support/
PrettyStackTrace.cpp 70 PrettyStackTraceEntry *Prev = nullptr;
72 std::tie(Prev, Head, Head->NextEntry) =
73 std::make_tuple(Head, Head->NextEntry, Prev);
74 return Prev;

Completed in 53 milliseconds

1 2 3 4