| /system/core/libsparse/ |
| backed_block.c | 247 static int queue_bb(struct backed_block_list *bbl, struct backed_block *new_bb)
252 bbl->data_blocks = new_bb;
256 if (bbl->data_blocks->block > new_bb->block) {
257 new_bb->next = bbl->data_blocks;
258 bbl->data_blocks = new_bb;
265 if (bbl->last_used && new_bb->block > bbl->last_used->block)
269 bbl->last_used = new_bb;
271 for (; bb->next && bb->next->block < new_bb->block; bb = bb->next)
275 bb->next = new_bb;
277 new_bb->next = bb->next
364 struct backed_block *new_bb; local
[all...] |
| /external/e2fsprogs/lib/ext2fs/ |
| tst_badblocks.c | 173 badblocks_list new_bb = 0; local
190 retval = ext2fs_read_bb_FILE2(0, f, &new_bb, 0, 0);
197 if (ext2fs_badblocks_equal(bb, new_bb)) {
219 badblocks_list new_bb = 0; local
247 retval = ext2fs_read_bb_FILE(fs, f, &new_bb, invalid_proc);
259 if (ext2fs_badblocks_equal(bb, new_bb)) {
|
| /art/compiler/dex/ |
| ssa_transformation.cc | 191 BasicBlock* new_bb = GetBasicBlock(**curr_idom_iter); local
193 new_bb->visited = true;
194 work_stack.push_back(std::make_pair(new_bb, new_bb->i_dominated->Indexes().begin()));
|
| mir_graph.cc | [all...] |
| mir_graph.h | 445 * @brief Replace the edge going to old_bb to now go towards new_bb.
447 bool ReplaceChild(BasicBlockId old_bb, BasicBlockId new_bb);
[all...] |
| /external/valgrind/callgrind/ |
| bb.c | 119 static BB* new_bb(obj_node* obj, PtrdiffT offset, function
160 VG_(printf)(" new_bb (instr %d, jmps %d, inv %s) [now %d]: ",
278 bb = new_bb(obj, addr - obj->offset, n_instrs, n_jmps, cjmp_inverted);
|
