Searched refs:Prev (Results 1 - 25 of 102) sorted by relevance

12345

/external/mesa3d/src/gallium/drivers/r300/compiler/
H A Dradeon_list.c40 new->Prev = NULL;
57 new_value->Prev = temp;
67 rm_value->Prev->Next = rm_value->Next;
69 rm_value->Next->Prev = rm_value->Prev;
H A Dradeon_list.h35 struct rc_list * Prev; member in struct:rc_list
H A Dradeon_program_alu.c235 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_AD
[all...]
H A Dradeon_program.c186 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;
H A Dradeon_program.h134 struct rc_instruction * Prev; member in struct:rc_instruction
154 * Instructions.Prev points to the last instruction.
H A Dradeon_emulate_loops.c73 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);
H A Dradeon_program_tex.c65 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/
H A DUnicodeCharRanges.h76 uint32_t Prev = 0; local
79 if (I != Ranges.begin() && Prev >= I->Lower) {
81 DEBUG(dbgs().write_hex(Prev));
93 Prev = I->Upper;
H A DRegistry.h142 listener *Prev, *Next; member in class:llvm::Registry::listener
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;
H A DTimer.h84 Timer **Prev, *Next; // Doubly linked list of timers in the group. member in class:llvm::Timer
162 TimerGroup **Prev, *Next; // Doubly linked list of TimerGroup's. member in class:llvm::TimerGroup
/external/llvm/include/llvm/ADT/
H A DSparseMultiSet.h85 /// circular in Prev indices, and INVALID-terminated in Next indices. This
93 unsigned Prev; member in struct:llvm::SparseMultiSet::SMSNode
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, unsigne argument
240 unsigned Prev() const { return SMS->Dense[Idx].Prev; } function in class:llvm::SparseMultiSet::iterator_base
[all...]
H A Dilist_node.h31 NodeTy *Prev; member in class:llvm::ilist_half_node
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) {}
/external/llvm/lib/Target/NVPTX/
H A DNVPTXPeephole.cpp110 auto &Prev = *MRI.getUniqueVRegDef(Root.getOperand(1).getReg()); local
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/
H A DANTLRLinkBase.h37 + (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/
H A DANTLRLinkBase.h37 + (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/
H A DANTLRLinkBase.h37 + (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/
H A DANTLRLinkBase.h41 + (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/include/llvm/IR/
H A DUse.h18 /// 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; member in class:llvm::Use
138 void setPrev(Use **NewPrev) { Prev.setPointer(NewPrev); }
147 Use **StrippedPrev = Prev.getPointer();
/external/llvm/lib/CodeGen/
H A DMachineRegisterInfo.cpp177 // 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; local
219 // Prev link
258 MachineOperand *Prev = Src->Contents.Reg.Prev; local
[all...]
/external/llvm/tools/lli/
H A DRemoteTarget.cpp33 sys::MemoryBlock *Prev = Allocations.size() ? &Allocations.back() : nullptr; local
34 sys::MemoryBlock Mem = sys::Memory::AllocateRWX(Size, Prev, &ErrorMsg);
/external/llvm/lib/Support/
H A DTimer.cpp250 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
[all...]
/external/llvm/lib/Option/
H A DOption.cpp148 const char *Prev = Str; local
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;
H A DOptTable.cpp192 unsigned Prev = Index; local
236 if (Prev != Index)
272 unsigned Prev = Index; local
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/
H A DBasicBlock.cpp141 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)) {
H A DUse.cpp98 unsigned Tag = (Current++)->Prev.getInt();
108 unsigned Tag = Current->Prev.getInt();

Completed in 6177 milliseconds

12345