/external/llvm/include/llvm/CodeGen/ |
RegAllocPBQP.h | 35 /// to a register allocation solution. (i.e. The PBQP-node <--> vreg map, 48 /// and the set of allowed pregs for the vreg. 54 void recordVReg(unsigned vreg, PBQP::Graph::NodeItr node, 57 assert(vreg2Node.find(vreg) == vreg2Node.end() && "Re-mapping vreg."); 58 assert(allowedSets[vreg].empty() && "vreg already has pregs."); 60 node2VReg[node] = vreg; 61 vreg2Node[vreg] = node; 62 std::copy(arBegin, arEnd, std::back_inserter(allowedSets[vreg])); [all...] |
MachineRegisterInfo.h | 26 /// registers, including vreg register classes, use/def chains for registers, 42 /// Each element in this list contains the register class of the vreg and the 472 void addLiveIn(unsigned Reg, unsigned vreg = 0) { 473 LiveIns.push_back(std::make_pair(Reg, vreg)); 486 /// getLiveInPhysReg - If VReg is a live-in virtual register, return the 488 unsigned getLiveInPhysReg(unsigned VReg) const;
|
/external/valgrind/main/VEX/priv/ |
host_generic_reg_alloc2.c | 107 vreg. Is safely left at False, and becomes True after a 113 Bound /* in use (holding value of some vreg) */ 116 /* If .disp == Bound, what vreg is it bound to? */ 117 HReg vreg; member in struct:__anon16198 123 (vreg_state) from vreg numbers back to entries in rreg_state. It 125 hregNumber(rreg_state[j].vreg) == i -- that is, the two entries 127 which involve looking for a particular vreg: there is no need to 129 vreg_state. The FAQ "does this vreg already have an associated 132 To indicate, in vreg_state[i], that a given vreg is not currently 165 finding the vreg which is mentioned as far ahead as possible, i 353 HReg rreg, vreg, vregS, vregD; local [all...] |
host_x86_defs.h | 727 HReg vreg, Short spill_off );
|
host_x86_defs.c | [all...] |
/external/llvm/lib/CodeGen/ |
RegAllocPBQP.cpp | 142 /// \brief Finds the initial set of vreg intervals to allocate. 162 assert(vregItr != node2VReg.end() && "No vreg for node."); 166 PBQP::Graph::NodeItr PBQPRAProblem::getNodeForVReg(unsigned vreg) const { 167 VReg2Node::const_iterator nodeItr = vreg2Node.find(vreg); 168 assert(nodeItr != vreg2Node.end() && "No node for vreg."); 174 PBQPRAProblem::getAllowedSet(unsigned vreg) const { 175 AllowedSetMap::const_iterator allowedSetItr = allowedSets.find(vreg); 176 assert(allowedSetItr != allowedSets.end() && "No pregs for vreg."); 181 unsigned PBQPRAProblem::getPRegForOption(unsigned vreg, unsigned option) const { 182 assert(isPRegOption(vreg, option) && "Not a preg option.") 213 unsigned vreg = *vregItr; local 482 unsigned vreg = problem.getVRegForNode(node); local [all...] |
/system/core/libpixelflinger/codeflinger/ |
blending.cpp | 541 int vreg = v.reg; 544 MOV(AL, 0, d.reg, reg_imm(vreg, LSR, vshift)); 545 vreg = d.reg; 548 MOV(AL, 0, d.reg, reg_imm(vreg, LSR, fshift)); 551 if (smulw) SMULW(AL, xy, d.reg, vreg, freg); 552 else SMUL(AL, xy, d.reg, vreg, freg);
|