Lines Matching full:blocks
41 /** basic blocks, indexed by block index */
42 private ArrayList<SsaBasicBlock> blocks;
131 * @param blocks Rop blocks
135 static BitSet bitSetFromLabelList(BasicBlockList blocks,
137 BitSet result = new BitSet(blocks.size());
140 result.set(blocks.indexOfLabel(labelList.get(i)));
150 * @param ropBlocks Rop blocks
170 blocks = new ArrayList<SsaBasicBlock>(sz + 2);
174 blocks.add(sbb);
182 = blocks.get(origEntryBlockIndex).insertNewPredecessor();
199 exitBlockIndex = blocks.size();
203 blocks.add(exitBlock);
205 for (SsaBasicBlock block : blocks) {
211 blocks.remove(exitBlockIndex);
238 int newIndex = blocks.size();
242 blocks.add(newBlock);
258 return blocks.get(entryBlockIndex);
273 return exitBlockIndex < 0 ? null : blocks.get(exitBlockIndex);
284 return blocks.get(bi).getRopLabel();
338 return blocks;
342 * Returns the count of reachable blocks in this method: blocks that have
345 * @return {@code >= 0;} number of reachable basic blocks
350 for (SsaBasicBlock b : blocks) {
351 // Blocks that have been disconnected don't count.
361 * Computes reachability for all blocks in the method. First clears old
362 * values from all blocks, then starts with the entry block and walks down
363 * the control flow graph, marking all blocks it finds as reachable.
366 for (SsaBasicBlock block : blocks) {
381 blockList.add(blocks.get(i));
727 for (SsaBasicBlock block : blocks) {
738 for (SsaBasicBlock block : blocks) {
755 BitSet visited = new BitSet(blocks.size());
780 stack.add(blocks.get(i));
789 * Visits blocks in dom-tree order, starting at the current node.
