| /external/mesa3d/src/gallium/drivers/r300/compiler/ |
| radeon_list.h | 35 struct rc_list * Prev;
|
| radeon_program.h | 134 struct rc_instruction * Prev;
154 * Instructions.Prev points to the last instruction.
|
| /external/llvm/tools/lli/ |
| RemoteTarget.cpp | 33 sys::MemoryBlock *Prev = Allocations.size() ? &Allocations.back() : nullptr;
34 sys::MemoryBlock Mem = sys::Memory::AllocateRWX(Size, Prev, &ErrorMsg);
|
| /external/llvm/include/llvm/ADT/ |
| ilist_node.h | 25 /// ilist_half_node - Base class that provides prev services for sentinels.
31 NodeTy *Prev;
33 NodeTy *getPrev() { return Prev; }
34 const NodeTy *getPrev() const { return Prev; }
35 void setPrev(NodeTy *P) { Prev = P; }
36 ilist_half_node() : Prev(nullptr) {}
44 /// ilist_node - Base class that provides next/prev services for nodes
|
| SparseMultiSet.h | 85 /// circular in Prev indices, and INVALID-terminated in Next indices. This
93 unsigned Prev;
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, unsigned Next)
[all...] |
| /external/llvm/include/llvm/Support/ |
| UnicodeCharRanges.h | 76 uint32_t Prev = 0;
79 if (I != Ranges.begin() && Prev >= I->Lower) {
81 DEBUG(dbgs().write_hex(Prev));
93 Prev = I->Upper;
|
| Timer.h | 84 Timer **Prev, *Next; // Doubly linked list of timers in the group.
162 TimerGroup **Prev, *Next; // Doubly linked list of TimerGroup's.
|
| Registry.h | 142 listener *Prev, *Next;
159 listener() : Prev(ListenerTail), Next(nullptr) {
160 if (Prev)
161 Prev->Next = this;
169 Next->Prev = Prev;
171 ListenerTail = Prev;
172 if (Prev)
173 Prev->Next = Next;
|
| /external/llvm/lib/Option/ |
| Option.cpp | 148 const char *Prev = Str;
153 if (Prev != Str) {
154 char *Value = new char[Str - Prev + 1];
155 memcpy(Value, Prev, Str - Prev);
156 Value[Str - Prev] = '\0';
163 Prev = Str + 1;
|
| OptTable.cpp | 192 unsigned Prev = Index;
236 if (Prev != Index)
272 unsigned Prev = Index;
274 assert(Index > Prev && "Parser failed to consume argument.");
279 assert(Index - Prev - 1 && "No missing arguments!");
280 MissingArgIndex = Prev;
281 MissingArgCount = Index - Prev - 1;
|
| /external/llvm/lib/Target/NVPTX/ |
| NVPTXPeephole.cpp | 110 auto &Prev = *MRI.getUniqueVRegDef(Root.getOperand(1).getReg());
113 BuildMI(MF, Root.getDebugLoc(), TII->get(Prev.getOpcode()),
116 .addOperand(Prev.getOperand(2));
121 if (MRI.hasOneNonDBGUse(Prev.getOperand(0).getReg())) {
122 Prev.eraseFromParentAndMarkDBGValuesForRemoval();
|
| /external/clang/lib/Lex/ |
| MacroInfo.cpp | 222 if (auto *Prev = getPrevious())
223 Out << " prev " << Prev;
|
| /external/llvm/include/llvm/IR/ |
| Use.h | 18 /// one of the fields (Prev) of the Use class are used to encode offsets to be
90 Use(PrevPtrTag tag) : Val(nullptr) { Prev.setInt(tag); }
136 PointerIntPair<Use **, 2, PrevPtrTag> Prev;
138 void setPrev(Use **NewPrev) { Prev.setPointer(NewPrev); }
147 Use **StrippedPrev = Prev.getPointer();
|
| /external/llvm/lib/CodeGen/ |
| MachineRegisterInfo.cpp | 177 // Prev pointers are circular, so Head->Prev == Last.
181 MO->Contents.Reg.Prev = MO;
188 // Insert MO between Last and Head in the circular Prev chain.
189 MachineOperand *Last = Head->Contents.Reg.Prev;
192 Head->Contents.Reg.Prev = MO;
193 MO->Contents.Reg.Prev = Last;
217 MachineOperand *Prev = MO->Contents.Reg.Prev;
219 // Prev links are circular, next link is NULL instead of looping back to Head
[all...] |
| /external/llvm/lib/ProfileData/ |
| CoverageMapping.cpp | 78 auto Prev = Terms.begin();
79 for (auto I = Prev + 1, E = Terms.end(); I != E; ++I) {
80 if (I->first == Prev->first) {
81 Prev->second += I->second;
84 ++Prev;
85 *Prev = *I;
87 Terms.erase(++Prev, Terms.end());
|
| /external/clang/test/CXX/class.access/class.friend/ |
| p1.cpp | 124 X *Prev;
126 X *getPrev() { return Prev; } // expected-note{{member is declared here}}
|
| /external/llvm/include/llvm/CodeGen/ |
| MachineOperand.h | 166 MachineOperand *Prev; // Access list for register. See MRI.
617 Op.Contents.Reg.Prev = nullptr;
740 return Contents.Reg.Prev != nullptr;
|
| /external/llvm/lib/Analysis/ |
| BlockFrequencyInfoImpl.cpp | 708 auto Prev = OuterLoop ? std::prev(Insert) : Loops.end();
719 return make_range(std::next(Prev), Insert);
|
| /external/llvm/lib/CodeGen/AsmPrinter/ |
| EHStreamer.cpp | 285 CallSiteEntry &Prev = CallSites.back();
286 if (Site.LPad == Prev.LPad && Site.Action == Prev.Action) {
288 Prev.EndLabel = Site.EndLabel;
|
| /external/lzma/CPP/7zip/UI/Common/ |
| Bench.cpp | 332 clock_t Prev;
336 Prev = clock();
343 Sum += v - Prev;
344 Prev = v;
848 UInt64 prev = 0;
860 if (printCallback && bi.UnpackSize - prev > (1 << 20))
863 prev = bi.UnpackSize;
960 UInt64 prev = 0;
970 if (printCallback && pi->BenchInfo.UnpackSize - prev > (1 << 20))
973 prev = pi->BenchInfo.UnpackSize;
[all...] |
| /external/clang/include/clang/Analysis/Analyses/ |
| ThreadSafetyCommon.h | 327 CallingContext *Prev; // The previous context; or 0 if none.
335 : Prev(P), AttrDecl(D), SelfArg(nullptr),
|
| /external/lzma/C/ |
| Ppmd7.c | 51 CPpmd7_Node_Ref Prev;
169 n = NODE(n)->Prev = next;
177 NODE(n)->Prev = head;
192 NODE(node2->Prev)->Next = node2->Next;
193 NODE(node2->Next)->Prev = node2->Prev;
|
| /external/webrtc/webrtc/libjingle/xmpp/ |
| chatroommoduleimpl.cc | 120 virtual bool Prev();
689 XmppChatroomMemberEnumeratorImpl::Prev() {
|
| /external/clang/lib/Format/ |
| Format.cpp | [all...] |
| TokenAnnotator.cpp | 169 FormatToken *Prev = CurrentToken->getPreviousNonComment();
170 if (Prev) {
171 FormatToken *PrevPrev = Prev->getPreviousNonComment();
174 Prev->isOneOf(tok::star, tok::amp, tok::ampamp) &&
176 Prev->Type = TT_BinaryOperator;
[all...] |
