Searched refs:IsBitSet (Results 1 - 25 of 25) sorted by relevance

/art/compiler/dex/
H A Dtype_inference.h155 return IsBitSet(kFlagNonNull);
159 return IsBitSet(kFlagWide);
163 return IsBitSet(kFlagNarrow);
167 return IsBitSet(kFlagFp);
171 return IsBitSet(kFlagCore);
175 return IsBitSet(kFlagRef);
179 return IsBitSet(kFlagLowWord);
183 return IsBitSet(kFlagHighWord);
333 bool IsBitSet(uint32_t flag) const { function in struct:art::TypeInference::Type
H A Dgvn_dead_code_elimination.cc104 : vreg_high_words_.IsBitSet(v_reg);
115 : !vreg_high_words_.IsBitSet(v_reg + 1);
131 DCHECK(!vreg_high_words_.IsBitSet(data->vreg_def));
138 DCHECK(vreg_high_words_.IsBitSet(data->vreg_def + 1));
225 DCHECK(!vreg_high_words_.IsBitSet(v_reg)); // Keep marked as low word.
241 DCHECK(!vreg_high_words_.IsBitSet(v_reg)); // Keep marked as low word.
253 DCHECK(!vreg_high_words_.IsBitSet(v_reg + 1)); // Keep marked as low word.
320 DCHECK_EQ(vreg_high_words_.IsBitSet(v_reg), v_reg == old_data->vreg_def + 1);
338 DCHECK_EQ(vreg_high_words_.IsBitSet(v_reg), v_reg == data->vreg_def + 1);
892 if (data->has_def && vregs_to_kill_->IsBitSet(dat
[all...]
H A Dmir_graph.cc600 bool in_try_block = try_block_addr->IsBitSet(cur_offset);
1875 !current_loop->IsBitSet(candidate->id))) {
1893 !current_loop->IsBitSet(child_bb->id))) {
1896 if (!candidate_reachable.IsBitSet(child_bb->id)) {
1927 if (!pred_bb->visited && !reachable->IsBitSet(pred_bb->id)) {
1997 if (reachable == nullptr || reachable->IsBitSet(candidate_id)) {
2030 !loop_head_reachable_from[loop_head_stack.back()]->IsBitSet(candidate->id))) {
2038 !pred_bb->dominators->IsBitSet(candidate->id)) {
2080 loop_head_reachable_from[loop_head_stack.back()]->IsBitSet(successor->id)) {
2083 DCHECK(!loop_exit_blocks.IsBitSet(successo
[all...]
H A Dmir_optimization.cc105 if (!is_constant_v_->IsBitSet(mir->ssa_rep->uses[i])) break;
984 if (!copied_first || !vregs_to_check->IsBitSet(pred_bb->last_mir_insn->dalvikInsn.vA)) {
1027 if (!vregs_to_check->IsBitSet(src_vreg)) {
1079 if (vregs_to_check->IsBitSet(mir->dalvikInsn.vB)) {
1303 if (!classes_to_check->IsBitSet(check_dex_cache_index)) {
1314 if (!classes_to_check->IsBitSet(check_clinit_index)) {
1464 if (temp_.smi.processed_indexes->IsBitSet(method_index)) {
H A Dmir_dataflow.cc914 if (!def_v->IsBitSet(dalvik_reg_id)) {
1196 if (temp_.ssa.phi_node_blocks[dalvik_reg]->IsBitSet(bb_id)) {
1197 if (!bb->data_flow_info->live_in_v->IsBitSet(dalvik_reg)) {
H A Dtype_inference.cc234 if (data.def_phi_blocks_->IsBitSet(bb_id)) {
289 if (entry.second.def_phi_blocks_->IsBitSet(bb->id)) {
378 if (!bb->data_flow_info->live_in_v->IsBitSet(v_reg)) {
H A Dlocal_value_numbering.cc531 bool live = live_in_v->IsBitSet(gvn_->GetMirGraph()->SRegToVReg(entry.first));
554 bool live_and_same = live_in_v->IsBitSet(gvn_->GetMirGraph()->SRegToVReg(entry.first));
H A Dmir_graph.h784 return is_constant_v_->IsBitSet(s_reg);
/art/runtime/base/
H A Dbit_vector_test.cc37 EXPECT_FALSE(bv.IsBitSet(i));
50 EXPECT_TRUE(bv.IsBitSet(0));
52 EXPECT_FALSE(bv.IsBitSet(i));
54 EXPECT_TRUE(bv.IsBitSet(kBits - 1));
166 EXPECT_TRUE(first.IsBitSet(64));
H A Dbit_vector.h155 bool IsBitSet(uint32_t idx) const { function in class:art::BitVector
158 return (idx < (storage_size_ * kWordBits)) && IsBitSet(storage_, idx);
232 static bool IsBitSet(const uint32_t* storage, uint32_t idx) { function in class:art::BitVector
H A Dbit_vector.cc347 buffer << IsBitSet(i);
/art/compiler/optimizing/
H A Ddead_code_elimination.cc25 if (visited->IsBitSet(block_id)) {
78 if (live_blocks.IsBitSet(id)) {
79 if (affected_loops.IsBitSet(id)) {
H A Dgvn.cc83 if (!buckets_owned_.IsBitSet(index)) {
173 DCHECK(!buckets_owned_.IsBitSet(index));
213 if (!buckets_owned_.IsBitSet(i)) {
232 DCHECK(buckets_owned_.IsBitSet(i) || node == nullptr);
H A Dstack_map_stream.cc155 if (entry.live_dex_registers_mask->IsBitSet(dex_register_number)) {
266 if (entry.live_dex_registers_mask->IsBitSet(dex_register_number)) {
342 if (a.live_dex_registers_mask->IsBitSet(i) != b.live_dex_registers_mask->IsBitSet(i)) {
345 if (a.live_dex_registers_mask->IsBitSet(i)) {
H A Dlicm.cc102 DCHECK(visited.IsBitSet(inner->GetBlockId()));
H A Dnodes.cc55 if (!visited.IsBitSet(i)) {
67 if (!visited.IsBitSet(i)) {
84 if (visited->IsBitSet(id)) return;
90 if (visiting->IsBitSet(successor->GetBlockId())) {
154 if (visited.IsBitSet(second->GetBlockId())) {
358 if (blocks_.IsBitSet(block->GetBlockId())) {
428 return blocks_.IsBitSet(block.GetBlockId());
432 return other.blocks_.IsBitSet(header_->GetBlockId());
H A Dliveness_test.cc41 buffer << vector->IsBitSet(i);
H A Dgraph_checker.cc137 if (seen_ids_.IsBitSet(instruction->GetId())) {
361 if (!loop_blocks.IsBitSet(back_edge_id)) {
H A Dfind_loops_test.cc134 ASSERT_TRUE(blocks.IsBitSet(blocks_in_loop[i]));
H A Dregister_allocator.cc494 if (liveness_of_spill_slot->IsBitSet(j)) {
511 if (liveness_of_register->IsBitSet(j)) {
H A Dnodes.h4091 if (!blocks_in_loop_.IsBitSet(index_)) {
4101 if (blocks_in_loop_.IsBitSet(index_)) {
4124 if (!blocks_in_loop_.IsBitSet(blocks_.Get(index_)->GetBlockId())) {
4134 if (blocks_in_loop_.IsBitSet(blocks_.Get(index_)->GetBlockId())) {
H A Dstack_map_test.cc27 if (region.LoadBit(i) != bit_vector.IsBitSet(i)) {
/art/runtime/
H A Dstack_map.h585 region_.StoreBit(live_bit_mask_offset_in_bits + i, live_dex_registers_mask.IsBitSet(i));
715 region.StoreBit(i, sp_map.IsBitSet(i));
H A Doat_file.cc725 if (!BitVector::IsBitSet(bitmap_, method_index)) {
/art/runtime/verifier/
H A Dreg_type_test.cc483 EXPECT_TRUE(unresolved_parts.IsBitSet(ref_type_0.GetId()));
484 EXPECT_TRUE(unresolved_parts.IsBitSet(ref_type_1.GetId()));

Completed in 326 milliseconds