Searched defs:cur_offset (Results 1 - 4 of 4) sorted by relevance

/art/compiler/
H A Doat_writer.cc410 int cur_offset = cfi_info->size(); local
413 // Set the 'CIE_pointer' field to cur_offset+4.
414 uint32_t CIE_pointer = cur_offset + 4;
415 uint32_t offset_to_update = cur_offset + sizeof(uint32_t);
422 offset_to_update = cur_offset + 2*sizeof(uint32_t);
/art/compiler/dex/
H A Dmir_graph.cc399 BasicBlock* MIRGraph::ProcessCanBranch(BasicBlock* cur_block, MIR* insn, DexOffset cur_offset, argument
402 DexOffset target = cur_offset;
438 BasicBlock* fallthrough_block = FindBlock(cur_offset + width,
459 FindBlock(cur_offset + width, /* split */ false, /* create */ true,
466 BasicBlock* MIRGraph::ProcessCanSwitch(BasicBlock* cur_block, MIR* insn, DexOffset cur_offset, argument
469 reinterpret_cast<const uint16_t*>(GetCurrentInsns() + cur_offset + insn->dalvikInsn.vB);
520 BasicBlock* case_block = FindBlock(cur_offset + target_table[i], /* split */ true,
534 BasicBlock* fallthrough_block = FindBlock(cur_offset + width, /* split */ false,
542 BasicBlock* MIRGraph::ProcessCanThrow(BasicBlock* cur_block, MIR* insn, DexOffset cur_offset, argument
545 bool in_try_block = try_block_addr->IsBitSet(cur_offset);
[all...]
/art/compiler/dex/quick/arm64/
H A Dint_arm64.cc1494 int cur_offset = 2; // What's the starting offset after the first stp? We expect the base slot local
1519 cur_offset = 0; // That core reg needs to go into the upper half.
1555 cur_offset); local
1559 RegStorage::FloatSolo64(reg1).GetReg(), base.GetReg(), cur_offset); local
1560 cur_offset += 2;
1571 cur_offset + 1); local
1572 cur_offset += 2; // Half-slot filled now.
1578 for (; core_reg_mask != 0; cur_offset += 2) {
1581 RegStorage::Solo64(reg1).GetReg(), base.GetReg(), cur_offset); local
1584 DCHECK_EQ(cur_offset, all_offse
[all...]
/art/runtime/verifier/
H A Dmethod_verifier.cc860 bool MethodVerifier::CheckArrayData(uint32_t cur_offset) { argument
862 const uint16_t* insns = code_item_->insns_ + cur_offset;
866 DCHECK_LT(cur_offset, insn_count);
869 if ((int32_t) cur_offset + array_data_offset < 0 ||
870 cur_offset + array_data_offset + 2 >= insn_count) {
871 Fail(VERIFY_ERROR_BAD_CLASS_HARD) << "invalid array data start: at " << cur_offset
880 Fail(VERIFY_ERROR_BAD_CLASS_HARD) << "unaligned array data table: at " << cur_offset
888 if (cur_offset + array_data_offset + table_size > insn_count) {
889 Fail(VERIFY_ERROR_BAD_CLASS_HARD) << "invalid array data end: at " << cur_offset
891 << cur_offset
898 CheckBranchTarget(uint32_t cur_offset) argument
930 GetBranchOffset(uint32_t cur_offset, int32_t* pOffset, bool* pConditional, bool* selfOkay) argument
968 CheckSwitchTargets(uint32_t cur_offset) argument
[all...]

Completed in 359 milliseconds