| /external/llvm/include/llvm/CodeGen/ |
| RegAllocPBQP.h | 36 /// to a register allocation solution. (i.e. The PBQP-node <--> vreg map,
49 /// and the set of allowed pregs for the vreg.
55 void recordVReg(unsigned vreg, PBQP::Graph::NodeItr node,
58 assert(vreg2Node.find(vreg) == vreg2Node.end() && "Re-mapping vreg.");
59 assert(allowedSets[vreg].empty() && "vreg already has pregs.");
61 node2VReg[node] = vreg;
62 vreg2Node[vreg] = node;
63 std::copy(arBegin, arEnd, std::back_inserter(allowedSets[vreg]));
[all...] |
| MachineRegisterInfo.h | 27 /// registers, including vreg register classes, use/def chains for registers,
43 /// Each element in this list contains the register class of the vreg and the
487 void addLiveIn(unsigned Reg, unsigned vreg = 0) {
488 LiveIns.push_back(std::make_pair(Reg, vreg));
501 /// getLiveInPhysReg - If VReg is a live-in virtual register, return the
503 unsigned getLiveInPhysReg(unsigned VReg) const;
|
| /art/runtime/ |
| root_visitor.h | 27 typedef void (VerifyRootVisitor)(const mirror::Object* root, void* arg, size_t vreg,
|
| stack.h | 41 // The kind of vreg being accessed in calls to Set/GetVReg.
58 // - JNI - just VRegs, but where every VReg holds a reference.
127 const uint32_t* vreg = &vregs_[i]; local
128 return *reinterpret_cast<const int32_t*>(vreg);
134 const uint32_t* vreg = &vregs_[i]; local
135 return *reinterpret_cast<const float*>(vreg);
140 const uint32_t* vreg = &vregs_[i]; local
141 return *reinterpret_cast<const int64_t*>(vreg);
146 const uint32_t* vreg = &vregs_[i]; local
147 return *reinterpret_cast<const double*>(vreg);
155 const uint32_t* vreg = &vregs_[i]; local
167 uint32_t* vreg = &vregs_[i]; local
173 uint32_t* vreg = &vregs_[i]; local
179 uint32_t* vreg = &vregs_[i]; local
185 uint32_t* vreg = &vregs_[i]; local
191 uint32_t* vreg = &vregs_[i]; local
[all...] |
| stack.cc | 135 uint32_t StackVisitor::GetVReg(mirror::ArtMethod* m, uint16_t vreg, VRegKind kind) const {
142 if (vmap_table.IsInContext(vreg, kind, &vmap_offset)) {
152 frame_size, vreg);
155 return cur_shadow_frame_->GetVReg(vreg);
159 void StackVisitor::SetVReg(mirror::ArtMethod* m, uint16_t vreg, uint32_t new_value,
167 if (vmap_table.IsInContext(vreg, kind, &vmap_offset)) {
178 int offset = GetVRegOffset(code_item, core_spills, fp_spills, frame_size, vreg);
183 return cur_shadow_frame_->SetVReg(vreg, new_value);
|
| vmap_table.h | 48 // Is the dex register 'vreg' in the context or on the stack? Should not be called when the
50 bool IsInContext(size_t vreg, VRegKind kind, uint32_t* vmap_offset) const {
65 if ((entry == vreg) && (in_floats == is_float)) {
|
| /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:__anon29056
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 );
|
| /external/llvm/lib/CodeGen/ |
| RegAllocPBQP.cpp | 143 /// \brief Finds the initial set of vreg intervals to allocate.
163 assert(vregItr != node2VReg.end() && "No vreg for node.");
167 PBQP::Graph::NodeItr PBQPRAProblem::getNodeForVReg(unsigned vreg) const {
168 VReg2Node::const_iterator nodeItr = vreg2Node.find(vreg);
169 assert(nodeItr != vreg2Node.end() && "No node for vreg.");
175 PBQPRAProblem::getAllowedSet(unsigned vreg) const {
176 AllowedSetMap::const_iterator allowedSetItr = allowedSets.find(vreg);
177 assert(allowedSetItr != allowedSets.end() && "No pregs for vreg.");
182 unsigned PBQPRAProblem::getPRegForOption(unsigned vreg, unsigned option) const {
183 assert(isPRegOption(vreg, option) && "Not a preg option.")
213 unsigned vreg = *vregItr; local
483 unsigned vreg = problem.getVRegForNode(node); local
[all...] |
| /external/chromium_org/third_party/mesa/src/src/mesa/drivers/dri/i965/ |
| brw_wm_debug.c | 45 else if( value - c->vreg >= 0 &&
46 value - c->vreg < BRW_WM_MAX_VREG)
47 printf("r%ld", (long) (value - c->vreg));
|
| brw_wm_pass0.c | 52 memset(&c->vreg[c->nr_vreg], 0, sizeof(*c->vreg));
53 return &c->vreg[c->nr_vreg++];
|
| brw_wm.c | 285 void *vreg = c->vreg; local
290 c->vreg = vreg;
311 c->vreg = rzalloc_array(c, struct brw_wm_value, BRW_WM_MAX_VREG);
|
| brw_wm_pass2.c | 242 dst[i] = &c->vreg[c->nr_vreg++];
|
| brw_wm.h | 225 struct brw_wm_value *vreg; member in struct:brw_wm_compile
|
| /external/mesa3d/src/mesa/drivers/dri/i965/ |
| brw_wm_debug.c | 45 else if( value - c->vreg >= 0 &&
46 value - c->vreg < BRW_WM_MAX_VREG)
47 printf("r%ld", (long) (value - c->vreg));
|
| brw_wm_pass0.c | 52 memset(&c->vreg[c->nr_vreg], 0, sizeof(*c->vreg));
53 return &c->vreg[c->nr_vreg++];
|
| brw_wm.c | 285 void *vreg = c->vreg; local
290 c->vreg = vreg;
311 c->vreg = rzalloc_array(c, struct brw_wm_value, BRW_WM_MAX_VREG);
|
| brw_wm_pass2.c | 242 dst[i] = &c->vreg[c->nr_vreg++];
|
| brw_wm.h | 225 struct brw_wm_value *vreg; member in struct:brw_wm_compile
|
| /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);
|
| /bionic/libc/arch-arm/bionic/ |
| memcpy.a9.S | 112 .macro cpy_line_vfp vreg, base
113 vstr \vreg, [dst, #\base]
114 vldr \vreg, [src, #\base]
121 vstr \vreg, [dst, #\base + 32]
122 vldr \vreg, [src, #\base + prefetch_lines * 64 - 32]
131 .macro cpy_tail_vfp vreg, base
132 vstr \vreg, [dst, #\base]
133 vldr \vreg, [src, #\base]
140 vstr \vreg, [dst, #\base + 32]
|
| /art/compiler/dex/ |
| mir_graph.h | 187 * In general, vreg/sreg describe Dalvik registers that originated with dx. However,
295 * Whereas a SSA name describes a definition of a Dalvik vreg, the RegLocation describes
487 int GetUseCount(int vreg) const {
488 return use_counts_.Get(vreg);
491 int GetRawUseCount(int vreg) const {
492 return raw_use_counts_.Get(vreg);
|
| /art/runtime/gc/collector/ |
| mark_sweep.h | 317 static void VerifyRootCallback(const mirror::Object* root, void* arg, size_t vreg,
320 void VerifyRoot(const mirror::Object* root, size_t vreg, const StackVisitor* visitor)
|
| mark_sweep.cc | 542 void MarkSweep::VerifyRootCallback(const Object* root, void* arg, size_t vreg,
544 reinterpret_cast<MarkSweep*>(arg)->VerifyRoot(root, vreg, visitor);
547 void MarkSweep::VerifyRoot(const Object* root, size_t vreg, const StackVisitor* visitor) {
554 LOG(ERROR) << visitor->DescribeLocation() << " in VReg: " << vreg;
[all...] |
| /external/chromium_org/v8/src/ |
| lithium-allocator.cc | 862 int vreg = GetVirtualRegister(); local
864 cur_input->set_virtual_register(vreg);
2044 int vreg = GetVirtualRegister(); local
[all...] |
