KickJava   Java API By Example, From Geeks To Geeks.

Java > Open Source Codes > edu > umd > cs > findbugs > ba > AbstractBlockOrder


1 /*
2  * Bytecode Analysis Framework
3  * Copyright (C) 2003,2004 University of Maryland
4  *
5  * This library is free software; you can redistribute it and/or
6  * modify it under the terms of the GNU Lesser General Public
7  * License as published by the Free Software Foundation; either
8  * version 2.1 of the License, or (at your option) any later version.
9  *
10  * This library is distributed in the hope that it will be useful,
11  * but WITHOUT ANY WARRANTY; without even the implied warranty of
12  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13  * Lesser General Public License for more details.
14  *
15  * You should have received a copy of the GNU Lesser General Public
16  * License along with this library; if not, write to the Free Software
17  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
18  */
19
20 package edu.umd.cs.findbugs.ba;
21
22 import java.util.ArrayList JavaDoc;
23 import java.util.Arrays JavaDoc;
24 import java.util.Comparator JavaDoc;
25 import java.util.Iterator JavaDoc;
26
27 /**
28  * Abstract base class for BlockOrder variants.
29  * It allows the subclass to specify just a Comparator for
30  * BasicBlocks, and handles the work of doing the sorting
31  * and providing Iterators.
32  *
33  * @see BlockOrder
34  */
35 public abstract class AbstractBlockOrder implements BlockOrder {
36     private ArrayList JavaDoc<BasicBlock> blockList;
37
38     public AbstractBlockOrder(CFG cfg, Comparator JavaDoc<BasicBlock> comparator) {
39         // Put the blocks in an array
40 int numBlocks = cfg.getNumBasicBlocks(), count = 0;
41         BasicBlock[] blocks = new BasicBlock[numBlocks];
42         for (Iterator JavaDoc<BasicBlock> i = cfg.blockIterator(); i.hasNext();) {
43             blocks[count++] = i.next();
44         }
45         assert count == numBlocks;
46
47         // Sort the blocks according to the comparator
48 Arrays.sort(blocks, comparator);
49
50         // Put the ordered blocks into an array list
51 blockList = new ArrayList JavaDoc<BasicBlock>(numBlocks);
52         for (int i = 0; i < numBlocks; ++i)
53             blockList.add(blocks[i]);
54     }
55
56     public Iterator JavaDoc<BasicBlock> blockIterator() {
57         return blockList.iterator();
58     }
59 }
60
61 // vim:ts=4
62
Popular Tags