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 depth first search on a CFG.
24: *
25: * @see CFG
26: * @author David Hovemeyer
27: */
28: public class DepthFirstSearch
29: extends
30: edu.umd.cs.findbugs.graph.DepthFirstSearch<CFG, Edge, BasicBlock> {
31: private BasicBlock firstRoot;
32:
33: /**
34: * Constructor.
35: *
36: * @param cfg the CFG to perform the depth first search on
37: */
38: public DepthFirstSearch(CFG cfg) {
39: super (cfg);
40: firstRoot = cfg.getEntry();
41: }
42:
43: @Override
44: protected BasicBlock getNextSearchTreeRoot() {
45: BasicBlock result = firstRoot;
46: firstRoot = null;
47: return result;
48: }
49: }
50:
51: // vim:ts=4
|