Home
last modified time | relevance | path

Searched refs:num_regs_ (Results 1 – 4 of 4) sorted by relevance

/art/runtime/verifier/
Dregister_line.h148 DCHECK_EQ(num_regs_, src->num_regs_); in CopyFromLine()
149 memcpy(&line_, &src->line_, num_regs_ * sizeof(uint16_t)); in CopyFromLine()
158 memset(&line_, 0xf1, num_regs_ * sizeof(uint16_t)); in FillWithGarbage()
211 return memcmp(&line_, &line2->line_, num_regs_ * sizeof(uint16_t)); in CompareLine()
215 return num_regs_; in NumRegs()
429 const uint32_t num_regs_; variable
Dregister_line-inl.h36 DCHECK_LT(vsrc, num_regs_); in GetRegisterType()
43 DCHECK_LT(vdst, num_regs_); in SetRegisterType()
69 DCHECK_LT(vdst + 1, num_regs_); in SetRegisterTypeWide()
200 : num_regs_(num_regs), in RegisterLine()
205 std::uninitialized_fill_n(line_, num_regs_, 0u); in RegisterLine()
Dregister_line.cc34 for (size_t i = 0; i < num_regs_; i++) { in CheckConstructorReturn()
101 for (uint32_t i = 0; i < num_regs_; i++) { in MarkRefsAsInitialized()
117 for (uint32_t i = 0; i < num_regs_; i++) { in MarkAllRegistersAsConflicts()
124 for (uint32_t i = 0; i < num_regs_; i++) { in MarkAllRegistersAsConflictsExcept()
133 for (uint32_t i = 0; i < num_regs_; i++) { in MarkAllRegistersAsConflictsExceptWide()
142 for (size_t i = 0; i < num_regs_; i++) { in Dump()
159 for (size_t i = 0; i < num_regs_; i++) { in MarkUninitRefsAsInvalid()
433 for (size_t idx = 0; idx < num_regs_; idx++) { in MergeRegisters()
452 for (uint32_t idx = 0; idx < num_regs_; idx++) { in MergeRegisters()
/art/compiler/optimizing/
Dregister_allocator_graph_color.cc440 num_regs_(num_regs), in ColoringIteration()
528 const size_t num_regs_; member in art::ColoringIteration
1474 if (IsLowDegreeNode(node, num_regs_)) { in PruneInterferenceGraph()
1502 DCHECK_LT(node->GetOutDegree(), num_regs_) << "Nodes in simplify list should be low degree"; in PruneInterferenceGraph()
1517 DCHECK_LT(node->GetOutDegree(), num_regs_) << "Nodes in freeze list should be low degree"; in PruneInterferenceGraph()
1528 DCHECK_GE(node->GetOutDegree(), num_regs_) << "Nodes in spill list should be high degree"; in PruneInterferenceGraph()
1562 bool was_high_degree = IsHighDegreeNode(adj, num_regs_); in PruneNode()
1568 if (was_high_degree && IsLowDegreeNode(adj, num_regs_)) { in PruneNode()
1588 if (IsLowDegreeNode(node, num_regs_) && !node->IsMoveRelated()) { in CheckTransitionFromFreezeWorklist()
1607 DCHECK(IsLowDegreeNode(node, num_regs_)); in FreezeMoves()
[all …]