Lines Matching refs:ii

79     for (uint32_t ii = 0; ii < num_static_bb; ++ii) {
80 trace->ReadStatic(&blocks[ii].bb);
81 blocks[ii].is_thumb = blocks[ii].bb.bb_addr & 1;
82 blocks[ii].bb.bb_addr &= ~1;
83 uint32_t num_insns = blocks[ii].bb.num_insns;
84 blocks[ii].insns = new uint32_t[num_insns];
85 blocks[ii].cycles = new uint32_t[num_insns];
86 memset(blocks[ii].cycles, 0, num_insns * sizeof(uint32_t));
87 trace->ReadStaticInsns(num_insns, blocks[ii].insns);
88 blocks[ii].elapsed = 0;
89 blocks[ii].freq = 0;
90 blocks[ii].inner = NULL;
115 for (uint32_t ii = 0; num_insns && ii < bb_num_insns; ++ii, --num_insns) {
124 cycle_ptr = &bptr->cycles[ii];
138 for (uint32_t ii = 0; ii < num_static_bb; ++ii) {
140 sorted[ii]->bb.bb_num, sorted[ii]->bb.bb_addr,
141 sorted[ii]->bb.num_insns, sorted[ii]->freq,
142 sorted[ii]->elapsed);
143 int num_insns = sorted[ii]->bb.num_insns;
144 uint32_t addr = sorted[ii]->bb.bb_addr;
146 uint32_t elapsed = sorted[ii]->cycles[jj];
147 uint32_t insn = sorted[ii]->insns[jj];
159 insn2 = sorted[ii]->insns[jj + 1];
188 int ii;
193 for (ii = 0; ii < num_blocks; ++ii) {
194 sorted[ii] = &blocks[ii];
202 for (ii = 0; ii < num_blocks - 1; ++ii) {
204 if (sorted[ii]->is_thumb)
205 num_bytes = sorted[ii]->bb.num_insns << 1;
207 num_bytes = sorted[ii]->bb.num_insns << 2;
208 addr_end = sorted[ii]->bb.bb_addr + num_bytes;
209 if (addr_end > sorted[ii + 1]->bb.bb_addr) {
210 sorted[ii]->inner = sorted[ii + 1];
211 addr_diff = sorted[ii + 1]->bb.bb_addr - sorted[ii]->bb.bb_addr;
213 if (sorted[ii]->is_thumb)
217 sorted[ii]->bb.num_insns = num_insns;