/** * Inserts Z nodes as new predecessors for every node that has multiple * successors and multiple predecessors. * * @param result {@code non-null;} method to process */ private static void edgeSplitPredecessors(SsaMethod result) { ArrayList<SsaBasicBlock> blocks = result.getBlocks(); /* * New blocks are added to the end of the block list during * this iteration. */ for (int i = blocks.size() - 1; i >= 0; i-- ) { SsaBasicBlock block = blocks.get(i); if (nodeNeedsUniquePredecessor(block)) { block.insertNewPredecessor(); } } }
/** * Inserts Z nodes as new predecessors for every node that has multiple * successors and multiple predecessors. * * @param result {@code non-null;} method to process */ private static void edgeSplitPredecessors(SsaMethod result) { ArrayList<SsaBasicBlock> blocks = result.getBlocks(); /* * New blocks are added to the end of the block list during * this iteration. */ for (int i = blocks.size() - 1; i >= 0; i-- ) { SsaBasicBlock block = blocks.get(i); if (nodeNeedsUniquePredecessor(block)) { block.insertNewPredecessor(); } } }
/** * Inserts Z nodes as new predecessors for every node that has multiple * successors and multiple predecessors. * * @param result {@code non-null;} method to process */ private static void edgeSplitPredecessors(SsaMethod result) { ArrayList<SsaBasicBlock> blocks = result.getBlocks(); /* * New blocks are added to the end of the block list during * this iteration. */ for (int i = blocks.size() - 1; i >= 0; i-- ) { SsaBasicBlock block = blocks.get(i); if (nodeNeedsUniquePredecessor(block)) { block.insertNewPredecessor(); } } }
/** * Inserts Z nodes as new predecessors for every node that has multiple * successors and multiple predecessors. * * @param result {@code non-null;} method to process */ private static void edgeSplitPredecessors(SsaMethod result) { ArrayList<SsaBasicBlock> blocks = result.getBlocks(); /* * New blocks are added to the end of the block list during * this iteration. */ for (int i = blocks.size() - 1; i >= 0; i-- ) { SsaBasicBlock block = blocks.get(i); if (nodeNeedsUniquePredecessor(block)) { block.insertNewPredecessor(); } } }
/** * Inserts Z nodes as new predecessors for every node that has multiple * successors and multiple predecessors. * * @param result {@code non-null;} method to process */ private static void edgeSplitPredecessors(SsaMethod result) { ArrayList<SsaBasicBlock> blocks = result.getBlocks(); /* * New blocks are added to the end of the block list during * this iteration. */ for (int i = blocks.size() - 1; i >= 0; i-- ) { SsaBasicBlock block = blocks.get(i); if (nodeNeedsUniquePredecessor(block)) { block.insertNewPredecessor(); } } }
/** * Inserts Z nodes as new predecessors for every node that has multiple * successors and multiple predecessors. * * @param result {@code non-null;} method to process */ private static void edgeSplitPredecessors(SsaMethod result) { ArrayList<SsaBasicBlock> blocks = result.getBlocks(); /* * New blocks are added to the end of the block list during * this iteration. */ for (int i = blocks.size() - 1; i >= 0; i-- ) { SsaBasicBlock block = blocks.get(i); if (nodeNeedsUniquePredecessor(block)) { block.insertNewPredecessor(); } } }
/** * Inserts Z nodes as new predecessors for every node that has multiple * successors and multiple predecessors. * * @param result {@code non-null;} method to process */ private static void edgeSplitPredecessors(SsaMethod result) { ArrayList<SsaBasicBlock> blocks = result.getBlocks(); /* * New blocks are added to the end of the block list during * this iteration. */ for (int i = blocks.size() - 1; i >= 0; i-- ) { SsaBasicBlock block = blocks.get(i); if (nodeNeedsUniquePredecessor(block)) { block.insertNewPredecessor(); } } }
/** * Inserts Z nodes as new predecessors for every node that has multiple * successors and multiple predecessors. * * @param result {@code non-null;} method to process */ private static void edgeSplitPredecessors(SsaMethod result) { ArrayList<SsaBasicBlock> blocks = result.getBlocks(); /* * New blocks are added to the end of the block list during * this iteration. */ for (int i = blocks.size() - 1; i >= 0; i-- ) { SsaBasicBlock block = blocks.get(i); if (nodeNeedsUniquePredecessor(block)) { block.insertNewPredecessor(); } } }