Lines Matching refs:block

23 static void recordDFSPreOrder(CompilationUnit *cUnit, BasicBlock *block)
26 if (block->visited || block->hidden) return;
27 block->visited = true;
29 /* Enqueue the block id */
30 dvmInsertGrowableList(&cUnit->dfsOrder, block->id);
32 if (block->fallThrough) recordDFSPreOrder(cUnit, block->fallThrough);
33 if (block->taken) recordDFSPreOrder(cUnit, block->taken);
34 if (block->successorBlockList.blockListType != kNotUsed) {
36 dvmGrowableListIteratorInit(&block->successorBlockList.blocks,
42 BasicBlock *succBB = successorBlockInfo->block;
69 * Mark block bit on the per-Dalvik register vector to denote that Dalvik
110 * Also set the incoming parameters as defs in the entry block.
137 /* Enter the current block id */
180 BasicBlock *succBB = successorBlockInfo->block;
230 /* Worker function to compute each block's dominators */
239 * The dominator of the entry block has been preset to itself and we need
278 /* Should not see any dead block */
299 /* Set the immediate dominator block for bb */
302 /* Add bb to the iDominated set of the immediate dominator block */
351 /* Now compute the dominance frontier for each block */
382 * insert a phi node if the variable is live-in to the block.
405 BasicBlock *succBB = successorBlockInfo->block;
508 /* Phi nodes are at the beginning of each block */
568 /* Find out the "Dalvik reg def x block" relation */
580 * Shared temp bit vector used by each block to count the number of defs
614 /* Find out the "Dalvik reg def x block" relation */
626 * Shared temp bit vector used by each block to count the number of defs