HomeSort by relevance Sort by last modified time
    Searched defs:vreg (Results 1 - 2 of 2) sorted by null

  /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:__anon13376
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
352 HReg rreg, vreg, vregS, vregD; local
    [all...]
  /external/llvm/lib/CodeGen/
RegAllocPBQP.cpp 146 /// \brief Finds the initial set of vreg intervals to allocate.
166 assert(vregItr != node2VReg.end() && "No vreg for node.");
170 PBQP::Graph::NodeItr PBQPRAProblem::getNodeForVReg(unsigned vreg) const {
171 VReg2Node::const_iterator nodeItr = vreg2Node.find(vreg);
172 assert(nodeItr != vreg2Node.end() && "No node for vreg.");
178 PBQPRAProblem::getAllowedSet(unsigned vreg) const {
179 AllowedSetMap::const_iterator allowedSetItr = allowedSets.find(vreg);
180 assert(allowedSetItr != allowedSets.end() && "No pregs for vreg.");
185 unsigned PBQPRAProblem::getPRegForOption(unsigned vreg, unsigned option) const {
186 assert(isPRegOption(vreg, option) && "Not a preg option.")
221 unsigned vreg = *vregItr; local
542 unsigned vreg = problem.getVRegForNode(node); local
    [all...]

Completed in 40 milliseconds