01: /*
02: * Bytecode Analysis Framework
03: * Copyright (C) 2003,2004 University of Maryland
04: *
05: * This library is free software; you can redistribute it and/or
06: * modify it under the terms of the GNU Lesser General Public
07: * License as published by the Free Software Foundation; either
08: * version 2.1 of the License, or (at your option) any later version.
09: *
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: /**
23: * Algorithm to perform a reverse depth first search on a CFG.
24: * (I.e., depth first search on reversed CFG.)
25: *
26: * @see CFG
27: * @author David Hovemeyer
28: */
29: public class ReverseDepthFirstSearch
30: extends
31: edu.umd.cs.findbugs.graph.ReverseDepthFirstSearch<CFG, Edge, BasicBlock> {
32: private BasicBlock firstRoot;
33:
34: /**
35: * Constructor.
36: *
37: * @param cfg the CFG to perform the reverse depth first search on
38: */
39: public ReverseDepthFirstSearch(CFG cfg) {
40: super (cfg);
41: this .firstRoot = cfg.getExit();
42: }
43:
44: @Override
45: protected BasicBlock getNextSearchTreeRoot() {
46: BasicBlock result = firstRoot;
47: firstRoot = null;
48: return result;
49: }
50: }
51:
52: // vim:ts=4
|