28 public class BasicBlock {  class
31     public BasicBlock[] exit;   // null if the block is a leaf.
35     protected BasicBlock(int pos) {  in BasicBlock()  method in BasicBlock
41     public static BasicBlock find(BasicBlock[] blocks, int pos)  in find()
55         BasicBlock body;
57         Catch(BasicBlock b, int i, Catch c) {  in Catch()
97         BasicBlock block;
98         BasicBlock[] jump;
121         void setJump(BasicBlock[] bb, int s, boolean always) {
132         protected BasicBlock makeBlock(int pos) {
133             return new BasicBlock(pos);
136         protected BasicBlock[] makeArray(int size) {
137             return new BasicBlock[size];
140         private BasicBlock[] makeArray(BasicBlock b) {
141             BasicBlock[] array = makeArray(1);
146         private BasicBlock[] makeArray(BasicBlock b1, BasicBlock b2) {
147             BasicBlock[] array = makeArray(2);
153         public BasicBlock[] make(MethodInfo minfo) throws BadBytecode {
162         public BasicBlock[] make(CodeIterator ci, int begin, int end,
167             BasicBlock[] bb = makeBlocks(marks);
181         private Mark makeMark(HashMap table, int pos, BasicBlock[] jump,
243                         BasicBlock[] to = makeArray(ncases + 1);
257                         BasicBlock[] to = makeArray(ncases + 1);
292             BasicBlock[] jumps = makeArray(to.block);
308         private BasicBlock[] makeBlocks(HashMap markTable) {
314             BasicBlock prev;
323                 BasicBlock bb = getBBlock(m);
360             return (BasicBlock[])blocks.toArray(makeArray(blocks.size()));
363         private static BasicBlock getBBlock(Mark m) {
364             BasicBlock b = m.block;
374         private void addCatchers(BasicBlock[] blocks, ExceptionTable et)
382                 BasicBlock handler = find(blocks, et.handlerPc(i));
388                     BasicBlock bb = blocks[k];