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: * Abstract base class for backward dataflow analyses.
24: * Provides convenient implementations for isForwards() and getBlockOrder()
25: * methods.
26: *
27: * @author David Hovemeyer
28: * @see Dataflow
29: * @see DataflowAnalysis
30: */
31: public abstract class BackwardDataflowAnalysis<Fact> extends
32: AbstractDataflowAnalysis<Fact> {
33: private ReverseDepthFirstSearch rdfs;
34: private DepthFirstSearch dfs;
35:
36: public BackwardDataflowAnalysis(ReverseDepthFirstSearch rdfs,
37: DepthFirstSearch dfs) {
38: if (rdfs == null || dfs == null)
39: throw new IllegalArgumentException();
40: this .rdfs = rdfs;
41: this .dfs = dfs;
42: }
43:
44: protected ReverseDepthFirstSearch getReverseDepthFirstSearch() {
45: return rdfs;
46: }
47:
48: public boolean isForwards() {
49: return false;
50: }
51:
52: public BlockOrder getBlockOrder(CFG cfg) {
53: return new ReverseDFSOrder(cfg, rdfs, dfs);
54: }
55: }
56:
57: // vim:ts=4
|