| /external/mesa3d/src/gallium/drivers/r300/compiler/ |
| radeon_list.c | 40 new->Prev = NULL;
57 new_value->Prev = temp;
67 rm_value->Prev->Next = rm_value->Next;
69 rm_value->Next->Prev = rm_value->Prev;
|
| radeon_list.h | 35 struct rc_list * Prev;
|
| radeon_program_alu.c | 235 emit1(c, inst->Prev, RC_OPCODE_MOV, &inst->U.I, inst->U.I.DstReg, src);
253 emit1(c, inst->Prev, RC_OPCODE_FRC, 0, dst, negate(inst->U.I.SrcReg[0]));
254 emit2(c, inst->Prev, RC_OPCODE_ADD, &inst->U.I, inst->U.I.DstReg,
268 emit2(c, inst->Prev, RC_OPCODE_MIN, 0, dst,
270 emit2(c, inst->Prev, RC_OPCODE_MAX, &inst->U.I, inst->U.I.DstReg,
286 emit2(c, inst->Prev, RC_OPCODE_DP3, &inst->U.I, inst->U.I.DstReg, src0, src1);
297 emit2(c, inst->Prev, RC_OPCODE_DP4, &inst->U.I, inst->U.I.DstReg, src0, inst->U.I.SrcReg[1]);
308 emit2(c, inst->Prev, RC_OPCODE_MUL, &inst->U.I, inst->U.I.DstReg,
318 emit1(c, inst->Prev, RC_OPCODE_FRC, 0, dst, inst->U.I.SrcReg[0]);
319 emit2(c, inst->Prev, RC_OPCODE_ADD, &inst->U.I, inst->U.I.DstReg
[all...] |
| radeon_program.c | 186 inst->Prev = after;
189 inst->Prev->Next = inst;
190 inst->Next->Prev = inst;
204 inst->Prev->Next = inst->Next;
205 inst->Next->Prev = inst->Prev;
|
| radeon_program.h | 134 struct rc_instruction * Prev;
154 * Instructions.Prev points to the last instruction.
|
| radeon_emulate_loops.c | 73 struct rc_instruction * last = loop->EndLoop->Prev;
372 || ptr->Prev->U.I.Opcode != RC_OPCODE_IF
377 loop->If = ptr->Prev;
379 switch(loop->If->Prev->U.I.Opcode){
390 loop->Cond = loop->If->Prev;
468 rc_insert_instruction(loop->EndLoop->Prev, loop->EndIf);
|
| radeon_program_tex.c | 65 inst_mov = rc_insert_new_instruction(&compiler->Base, inst->Prev);
88 inst_rcp = rc_insert_new_instruction(&compiler->Base, inst->Prev);
99 inst_mul = rc_insert_new_instruction(&compiler->Base, inst->Prev);
306 struct rc_instruction *inst_frc = rc_insert_new_instruction(c, inst->Prev);
328 inst_mul = rc_insert_new_instruction(c, inst->Prev);
337 inst_frc = rc_insert_new_instruction(c, inst->Prev);
348 inst_mad = rc_insert_new_instruction(c, inst->Prev);
363 inst_add = rc_insert_new_instruction(c, inst->Prev);
383 inst_mov = rc_insert_new_instruction(c, inst->Prev);
394 inst_mov = rc_insert_new_instruction(c, inst->Prev);
[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;
|
| 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;
|
| Timer.h | 84 Timer **Prev, *Next; // Doubly linked list of timers in the group.
162 TimerGroup **Prev, *Next; // Doubly linked list of TimerGroup's.
|
| /external/llvm/include/llvm/ADT/ |
| 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...] |
| 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
|
| /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/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/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/ |
| ANTLRLinkBase.h | 37 + (id<ANTLRLinkList>)newANTLRLinkBase:(id<ANTLRLinkList>)np Prev:(id<ANTLRLinkList>)pp;
60 + (id<ANTLRLinkList>)newANTLRLinkBase:(id<ANTLRLinkList>)np Prev:(id<ANTLRLinkList>)pp;
62 - (id<ANTLRLinkList>)initWithPtr:(id)np Prev:(id)pp;
|
| /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/A/Headers/ |
| ANTLRLinkBase.h | 37 + (id<ANTLRLinkList>)newANTLRLinkBase:(id<ANTLRLinkList>)np Prev:(id<ANTLRLinkList>)pp;
60 + (id<ANTLRLinkList>)newANTLRLinkBase:(id<ANTLRLinkList>)np Prev:(id<ANTLRLinkList>)pp;
62 - (id<ANTLRLinkList>)initWithPtr:(id)np Prev:(id)pp;
|
| /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/Current/Headers/ |
| ANTLRLinkBase.h | 37 + (id<ANTLRLinkList>)newANTLRLinkBase:(id<ANTLRLinkList>)np Prev:(id<ANTLRLinkList>)pp;
60 + (id<ANTLRLinkList>)newANTLRLinkBase:(id<ANTLRLinkList>)np Prev:(id<ANTLRLinkList>)pp;
62 - (id<ANTLRLinkList>)initWithPtr:(id)np Prev:(id)pp;
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
| ANTLRLinkBase.h | 41 + (id<ANTLRLinkList>)newANTLRLinkBase:(id<ANTLRLinkList>)np Prev:(id<ANTLRLinkList>)pp;
66 + (id<ANTLRLinkList>)newANTLRLinkBase:(id<ANTLRLinkList>)np Prev:(id<ANTLRLinkList>)pp;
68 - (id<ANTLRLinkList>)initWithPtr:(id)np Prev:(id)pp;
|
| /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/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/lib/Support/ |
| Timer.cpp | 250 TimerGroupList->Prev = &Next;
252 Prev = &TimerGroupList;
264 *Prev = Next;
266 Next->Prev = Prev;
280 *T.Prev = T.Next;
282 T.Next->Prev = T.Prev;
298 FirstTimer->Prev = &T.Next;
300 T.Prev = &FirstTimer
[all...] |
| /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/IR/ |
| BasicBlock.cpp | 141 Instruction *Prev = RI->getPrevNode();
142 if (!Prev)
146 if (RV != Prev)
150 if (auto *BI = dyn_cast<BitCastInst>(Prev)) {
152 Prev = BI->getPrevNode();
153 if (!Prev || RV != Prev)
158 if (auto *CI = dyn_cast<CallInst>(Prev)) {
|
| Use.cpp | 98 unsigned Tag = (Current++)->Prev.getInt();
108 unsigned Tag = Current->Prev.getInt();
|
