Searched refs:end_pc (Results 1 – 3 of 3) sorted by relevance
233 if (begin_pc <= pc && pc < try_block.boundaries.end_pc) { in EnumerateTryBlocksCoveredPc()248 if (try_boundaries.end_pc == iter->second.boundaries.end_pc) { in InsertTryBlockInfo()252 if (try_boundaries.end_pc > iter->second.boundaries.end_pc) { in InsertTryBlockInfo()272 auto end_pc = start_pc + try_block.GetLength(); in CreateTryCatchBoundariesBlocks() local273 auto try_info = InsertTryBlockInfo({start_pc, end_pc}); in CreateTryCatchBoundariesBlocks()289 CreateBlock(try_block.boundaries.end_pc); in CreateTryCatchBoundariesBlocks()351 …ry_blocks_.remove_if([pc](TryCodeBlock *try_block) { return try_block->boundaries.end_pc == pc; }); in TrackTryBoundaries()357 if (try_block.boundaries.end_pc > pc) { in TrackTryBoundaries()363 ASSERT(try_block.boundaries.end_pc == pc); in TrackTryBoundaries()502 auto last_try_bb = GetPrevBlockForPc(try_block.boundaries.end_pc); in ConnectTryCodeBlock()[all …]
37 uint32_t end_pc; member61 end_bb = graph->CreateEmptyBlock(boundaries.end_pc); in Init()
253 uint32_t end_pc = 0; in EstimateMaxDistance() local258 end_pc = target_pc - bias; in EstimateMaxDistance()262 end_pc = insn_pc - bias; in EstimateMaxDistance()268 while (it != branches_.end() && it->first < end_pc) { in EstimateMaxDistance()