Searched refs:IsBitSet (Results 1 – 18 of 18) sorted by relevance
36 EXPECT_FALSE(bv.IsBitSet(i)); in TEST()49 EXPECT_TRUE(bv.IsBitSet(0)); in TEST()51 EXPECT_FALSE(bv.IsBitSet(i)); in TEST()53 EXPECT_TRUE(bv.IsBitSet(kBits - 1)); in TEST()
62 bool BitVector::IsBitSet(uint32_t num) const { in IsBitSet() function in art::BitVector69 return IsBitSet(storage_, num); in IsBitSet()378 bool BitVector::IsBitSet(const uint32_t* storage, uint32_t num) { in IsBitSet() function in art::BitVector436 if (IsBitSet(i)) { in DumpIndicesHelper()450 buffer << IsBitSet(i); in DumpHelper()
156 bool IsBitSet(uint32_t num) const;203 static bool IsBitSet(const uint32_t* storage, uint32_t num);
35 if (!visited.IsBitSet(i)) { in RemoveDeadBlocks()54 if (visited->IsBitSet(id)) return; in VisitBlockForBackEdges()60 if (visiting->IsBitSet(successor->GetBlockId())) { in VisitBlockForBackEdges()104 if (visited.IsBitSet(second->GetBlockId())) { in FindCommonDominator()235 if (blocks_.IsBitSet(block->GetBlockId())) { in PopulateRecursive()271 return blocks_.IsBitSet(block.GetBlockId()); in Contains()275 return other.blocks_.IsBitSet(header_->GetBlockId()); in IsIn()
27 if (region.LoadBit(i) != bit_vector.IsBitSet(i)) { in SameBits()
37 buffer << vector->IsBitSet(i); in DumpBitVector()
53 if (visited->IsBitSet(block->GetBlockId())) { in VisitBlockForLinearization()
129 ASSERT_TRUE(blocks.IsBitSet(blocks_in_loop[i])); in TestBlock()
254 if (liveness_of_spill_slot->IsBitSet(j)) { in ValidateIntervals()271 if (liveness_of_register->IsBitSet(j)) { in ValidateIntervals()
545 bool in_try_block = try_block_addr->IsBitSet(cur_offset); in ProcessCanThrow()1556 !current_loop->IsBitSet(candidate->id))) { in SelectTopologicalSortOrderFallBack()1574 !current_loop->IsBitSet(child_bb->id))) { in SelectTopologicalSortOrderFallBack()1577 if (!candidate_reachable.IsBitSet(child_bb->id)) { in SelectTopologicalSortOrderFallBack()1608 if (!pred_bb->visited && !reachable->IsBitSet(pred_bb->id)) { in ComputeUnvisitedReachableFrom()1687 if (reachable == nullptr || reachable->IsBitSet(candidate_id)) { in ComputeTopologicalSortOrder()1720 !loop_head_reachable_from[loop_head_stack.back()]->IsBitSet(candidate->id))) { in ComputeTopologicalSortOrder()1728 !pred_bb->dominators->IsBitSet(candidate->id)) { in ComputeTopologicalSortOrder()1768 loop_head_reachable_from[loop_head_stack.back()]->IsBitSet(successor->id)) { in ComputeTopologicalSortOrder()1771 DCHECK(!loop_exit_blocks.IsBitSet(successor->id)); in ComputeTopologicalSortOrder()[all …]
92 if (!is_constant_v_->IsBitSet(mir->ssa_rep->uses[i])) break; in DoConstantPropagation()846 if (!ssa_regs_to_check->IsBitSet(src_sreg)) { in EliminateNullChecksAndInferTypes()921 needs_null_check |= ssa_regs_to_check->IsBitSet(mir->ssa_rep->uses[i]); in EliminateNullChecksAndInferTypes()1110 if (!classes_to_check->IsBitSet(index)) { in EliminateClassInitChecks()1210 if (temp_bit_vector_->IsBitSet(method_index)) { in ComputeInlineIFieldLoweringInfo()
217 if ((curr_bb->taken != NullBasicBlockId) && curr_bb->dominators->IsBitSet(curr_bb->taken)) { in ComputeDomPostOrderTraversal()530 if (!phi_bb->data_flow_info->live_in_v->IsBitSet(dalvik_reg)) { in InsertPhiNodes()
446 loc[i].is_const = is_constant_v_->IsBitSet(i); in InitRegLocations()
710 return is_constant_v_->IsBitSet(s_reg); in IsConst()
509 bool live = live_in_v->IsBitSet(gvn_->GetMirGraph()->SRegToVReg(entry.first)); in CopyLiveSregValues()532 bool live_and_same = live_in_v->IsBitSet(gvn_->GetMirGraph()->SRegToVReg(entry.first)); in IntersectSregValueMaps()
902 if (!def_v->IsBitSet(dalvik_reg_id)) { in HandleLiveInUse()
187 region.StoreBit(i, sp_map.IsBitSet(i)); in SetStackMask()
562 if (!BitVector::IsBitSet(bitmap_, method_index)) { in GetOatMethodOffsets()