Home
last modified time | relevance | path

Searched refs:Prev (Results 1 – 25 of 96) sorted by relevance

1234

/external/llvm/include/llvm/ADT/
Dilist_node.h28 NodeTy *Prev;
30 NodeTy *getPrev() { return Prev; }
31 const NodeTy *getPrev() const { return Prev; }
32 void setPrev(NodeTy *P) { Prev = P; }
33 ilist_half_node() : Prev(nullptr) {}
59 NodeTy *Prev = this->getPrev();
62 if (!Prev->getNext())
65 return Prev;
70 const NodeTy *Prev = this->getPrev();
73 if (!Prev->getNext())
[all …]
DSparseMultiSet.h93 unsigned Prev; member
96 SMSNode(ValueT D, unsigned P, unsigned N) : Data(D), Prev(P), Next(N) { } in SMSNode()
105 return Prev == INVALID; in isTombstone()
110 bool isValid() const { return Prev != INVALID; } in isValid()
144 return Dense[D.Prev].isTail(); in isHead()
152 return &Dense[N.Prev] == &N; in isSingleton()
157 unsigned addValue(const ValueT& V, unsigned Prev, unsigned Next) { in addValue() argument
159 Dense.push_back(SMSNode(V, Prev, Next)); in addValue()
168 Dense[Idx] = SMSNode(V, Prev, Next); in addValue()
176 Dense[Idx].Prev = SMSNode::INVALID; in makeTombstone()
[all …]
/external/mesa3d/src/gallium/drivers/r300/compiler/
Dradeon_program_alu.c235 emit1(c, inst->Prev, RC_OPCODE_MOV, &inst->U.I, inst->U.I.DstReg, src); in transform_ABS()
253 emit1(c, inst->Prev, RC_OPCODE_FRC, 0, dst, negate(inst->U.I.SrcReg[0])); in transform_CEIL()
254 emit2(c, inst->Prev, RC_OPCODE_ADD, &inst->U.I, inst->U.I.DstReg, in transform_CEIL()
268 emit2(c, inst->Prev, RC_OPCODE_MIN, 0, dst, in transform_CLAMP()
270 emit2(c, inst->Prev, RC_OPCODE_MAX, &inst->U.I, inst->U.I.DstReg, in transform_CLAMP()
286 emit2(c, inst->Prev, RC_OPCODE_DP3, &inst->U.I, inst->U.I.DstReg, src0, src1); in transform_DP2()
297 emit2(c, inst->Prev, RC_OPCODE_DP4, &inst->U.I, inst->U.I.DstReg, src0, inst->U.I.SrcReg[1]); in transform_DPH()
308 emit2(c, inst->Prev, RC_OPCODE_MUL, &inst->U.I, inst->U.I.DstReg, in transform_DST()
318 emit1(c, inst->Prev, RC_OPCODE_FRC, 0, dst, inst->U.I.SrcReg[0]); in transform_FLR()
319 emit2(c, inst->Prev, RC_OPCODE_ADD, &inst->U.I, inst->U.I.DstReg, in transform_FLR()
[all …]
Dradeon_list.c40 new->Prev = NULL; in rc_list()
57 new_value->Prev = temp; in rc_list_add()
67 rm_value->Prev->Next = rm_value->Next; in rc_list_remove()
69 rm_value->Next->Prev = rm_value->Prev; in rc_list_remove()
Dradeon_program.c186 inst->Prev = after; in rc_insert_instruction()
189 inst->Prev->Next = inst; in rc_insert_instruction()
190 inst->Next->Prev = inst; in rc_insert_instruction()
204 inst->Prev->Next = inst->Next; in rc_remove_instruction()
205 inst->Next->Prev = inst->Prev; in rc_remove_instruction()
Dradeon_program_tex.c65 inst_mov = rc_insert_new_instruction(&compiler->Base, inst->Prev); in scale_texcoords()
88 inst_rcp = rc_insert_new_instruction(&compiler->Base, inst->Prev); in projective_divide()
99 inst_mul = rc_insert_new_instruction(&compiler->Base, inst->Prev); in projective_divide()
306 struct rc_instruction *inst_frc = rc_insert_new_instruction(c, inst->Prev); in radeonTransformTEX()
328 inst_mul = rc_insert_new_instruction(c, inst->Prev); in radeonTransformTEX()
337 inst_frc = rc_insert_new_instruction(c, inst->Prev); in radeonTransformTEX()
348 inst_mad = rc_insert_new_instruction(c, inst->Prev); in radeonTransformTEX()
363 inst_add = rc_insert_new_instruction(c, inst->Prev); in radeonTransformTEX()
383 inst_mov = rc_insert_new_instruction(c, inst->Prev); in radeonTransformTEX()
394 inst_mov = rc_insert_new_instruction(c, inst->Prev); in radeonTransformTEX()
[all …]
Dradeon_pair_schedule.c455 inst_begin = rc_insert_new_instruction(s->C, before->Prev); in emit_all_tex()
461 rc_insert_instruction(before->Prev, readytex->Instruction); in emit_all_tex()
716 if (emitted->Prev->Type != RC_INSTRUCTION_PAIR) { in presub_nop()
719 if (emitted->Prev->U.P.RGB.WriteMask) in presub_nop()
720 prev_rgb_index = emitted->Prev->U.P.RGB.DestIndex; in presub_nop()
723 if (emitted->Prev->U.P.Alpha.WriteMask) in presub_nop()
724 prev_alpha_index = emitted->Prev->U.P.Alpha.DestIndex; in presub_nop()
737 emitted->Prev->U.P.Nop = 1; in presub_nop()
753 emitted->Prev->U.P.Nop = 1; in presub_nop()
1125 rc_insert_instruction(before->Prev, max_inst->Instruction); in emit_instruction()
[all …]
Dradeon_emulate_loops.c73 struct rc_instruction * last = loop->EndLoop->Prev; in unroll_loop()
372 || ptr->Prev->U.I.Opcode != RC_OPCODE_IF in build_loop_info()
377 loop->If = ptr->Prev; in build_loop_info()
379 switch(loop->If->Prev->U.I.Opcode){ in build_loop_info()
390 loop->Cond = loop->If->Prev; in build_loop_info()
468 rc_insert_instruction(loop->EndLoop->Prev, loop->EndIf); in transform_loop()
Dradeon_dataflow_deadcode.c230 for(struct rc_instruction * inst = c->Program.Instructions.Prev; in rc_dataflow_deadcode()
232 inst = inst->Prev) { in rc_dataflow_deadcode()
243 for(ptr = inst->Prev; endloops > 0; ptr = ptr->Prev){ in rc_dataflow_deadcode()
336 inst = inst->Prev; in rc_dataflow_deadcode()
/external/llvm/include/llvm/Support/
DRegistry.h145 listener *Prev, *Next; variable
162 listener() : Prev(ListenerTail), Next(0) { in listener()
163 if (Prev) in listener()
164 Prev->Next = this; in listener()
172 Next->Prev = Prev; in ~listener()
174 ListenerTail = Prev; in ~listener()
175 if (Prev) in ~listener()
176 Prev->Next = Next; in ~listener()
DUnicodeCharRanges.h71 uint32_t Prev = 0; in rangesAreValid() local
74 if (I != Ranges.begin() && Prev >= I->Lower) { in rangesAreValid()
76 DEBUG(dbgs().write_hex(Prev)); in rangesAreValid()
88 Prev = I->Upper; in rangesAreValid()
DRecycler.h35 RecyclerStruct *Prev, *Next; member
41 static RecyclerStruct *getPrev(const RecyclerStruct *t) { return t->Prev; }
43 static void setPrev(RecyclerStruct *t, RecyclerStruct *p) { t->Prev = p; }
/external/llvm/lib/CodeGen/
DMachineRegisterInfo.cpp180 MO->Contents.Reg.Prev = MO; in addRegOperandToUseList()
188 MachineOperand *Last = Head->Contents.Reg.Prev; in addRegOperandToUseList()
191 Head->Contents.Reg.Prev = MO; in addRegOperandToUseList()
192 MO->Contents.Reg.Prev = Last; in addRegOperandToUseList()
216 MachineOperand *Prev = MO->Contents.Reg.Prev; in removeRegOperandFromUseList() local
222 Prev->Contents.Reg.Next = Next; in removeRegOperandFromUseList()
224 (Next ? Next : Head)->Contents.Reg.Prev = Prev; in removeRegOperandFromUseList()
226 MO->Contents.Reg.Prev = nullptr; in removeRegOperandFromUseList()
257 MachineOperand *Prev = Src->Contents.Reg.Prev; in moveOperands() local
260 assert(Prev && "Operand was not on use-def list"); in moveOperands()
[all …]
/external/llvm/lib/Support/
DTimer.cpp257 TimerGroupList->Prev = &Next; in TimerGroup()
259 Prev = &TimerGroupList; in TimerGroup()
271 *Prev = Next; in ~TimerGroup()
273 Next->Prev = Prev; in ~TimerGroup()
287 *T.Prev = T.Next; in removeTimer()
289 T.Next->Prev = T.Prev; in removeTimer()
306 FirstTimer->Prev = &T.Next; in addTimer()
308 T.Prev = &FirstTimer; in addTimer()
/external/llvm/lib/Option/
DOption.cpp140 const char *Prev = Str; in accept() local
145 if (Prev != Str) { in accept()
146 char *Value = new char[Str - Prev + 1]; in accept()
147 memcpy(Value, Prev, Str - Prev); in accept()
148 Value[Str - Prev] = '\0'; in accept()
155 Prev = Str + 1; in accept()
DOptTable.cpp194 unsigned Prev = Index; in ParseOneArg() local
238 if (Prev != Index) in ParseOneArg()
275 unsigned Prev = Index; in ParseArgs() local
277 assert(Index > Prev && "Parser failed to consume argument."); in ParseArgs()
282 assert(Index - Prev - 1 && "No missing arguments!"); in ParseArgs()
283 MissingArgIndex = Prev; in ParseArgs()
284 MissingArgCount = Index - Prev - 1; in ParseArgs()
/external/llvm/lib/IR/
DBasicBlock.cpp137 Instruction *Prev = RI->getPrevNode(); in getTerminatingMustTailCall() local
138 if (!Prev) in getTerminatingMustTailCall()
142 if (RV != Prev) in getTerminatingMustTailCall()
146 if (auto *BI = dyn_cast<BitCastInst>(Prev)) { in getTerminatingMustTailCall()
148 Prev = BI->getPrevNode(); in getTerminatingMustTailCall()
149 if (!Prev || RV != Prev) in getTerminatingMustTailCall()
154 if (auto *CI = dyn_cast<CallInst>(Prev)) { in getTerminatingMustTailCall()
DUse.cpp98 unsigned Tag = (Current++)->Prev.getInt(); in getImpliedUser()
108 unsigned Tag = Current->Prev.getInt(); in getImpliedUser()
/external/llvm/include/llvm/IR/
DUse.h91 Use(PrevPtrTag tag) : Val(nullptr) { Prev.setInt(tag); } in Use()
137 PointerIntPair<Use **, 2, PrevPtrTag> Prev; variable
139 void setPrev(Use **NewPrev) { Prev.setPointer(NewPrev); } in setPrev()
148 Use **StrippedPrev = Prev.getPointer(); in removeFromList()
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/A/Headers/
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/
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/Headers/
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/
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/tools/lli/
DRemoteTarget.cpp33 sys::MemoryBlock *Prev = Allocations.size() ? &Allocations.back() : nullptr; in allocateSpace() local
34 sys::MemoryBlock Mem = sys::Memory::AllocateRWX(Size, Prev, &ErrorMsg); in allocateSpace()
/external/llvm/lib/ProfileData/
DCoverageMapping.cpp75 auto Prev = Terms.begin(); in simplify() local
76 for (auto I = Prev + 1, E = Terms.end(); I != E; ++I) { in simplify()
77 if (I->first == Prev->first) { in simplify()
78 Prev->second += I->second; in simplify()
81 ++Prev; in simplify()
82 *Prev = *I; in simplify()
84 Terms.erase(++Prev, Terms.end()); in simplify()

1234