1 |
| |
2 |
| |
3 |
| |
4 |
| package net.sourceforge.pmd.dfa; |
5 |
| |
6 |
| import net.sourceforge.pmd.ast.SimpleNode; |
7 |
| |
8 |
| import java.util.LinkedList; |
9 |
| import java.util.List; |
10 |
| import java.util.Stack; |
11 |
| |
12 |
| |
13 |
| |
14 |
| |
15 |
| |
16 |
| |
17 |
| |
18 |
| |
19 |
| public class Structure { |
20 |
| |
21 |
| private LinkedList dataFlow = new LinkedList(); |
22 |
| private Stack braceStack = new Stack(); |
23 |
| private Stack continueBreakReturnStack = new Stack(); |
24 |
| |
25 |
| |
26 |
| |
27 |
| |
28 |
| |
29 |
| |
30 |
| |
31 |
211
| public IDataFlowNode createNewNode(SimpleNode node) {
|
32 |
211
| return new DataFlowNode(node, this.dataFlow);
|
33 |
| } |
34 |
| |
35 |
40
| public IDataFlowNode createStartNode(int line) {
|
36 |
40
| return new StartOrEndDataFlowNode(this.dataFlow, line, true);
|
37 |
| } |
38 |
| |
39 |
40
| public IDataFlowNode createEndNode(int line) {
|
40 |
40
| return new StartOrEndDataFlowNode(this.dataFlow, line, false);
|
41 |
| } |
42 |
| |
43 |
203
| public IDataFlowNode getLast() {
|
44 |
203
| return (IDataFlowNode) this.dataFlow.getLast();
|
45 |
| } |
46 |
| |
47 |
0
| public IDataFlowNode getFirst() {
|
48 |
0
| return (IDataFlowNode) this.dataFlow.getFirst();
|
49 |
| } |
50 |
| |
51 |
| |
52 |
| |
53 |
| |
54 |
| |
55 |
| |
56 |
| |
57 |
| |
58 |
| |
59 |
203
| protected void pushOnStack(int type, IDataFlowNode node) {
|
60 |
203
| StackObject obj = new StackObject(type, node);
|
61 |
203
| if (type == NodeType.RETURN_STATEMENT || type == NodeType.BREAK_STATEMENT || type == NodeType.CONTINUE_STATEMENT) {
|
62 |
| |
63 |
6
| continueBreakReturnStack.push(obj);
|
64 |
| } else { |
65 |
197
| braceStack.push(obj);
|
66 |
| } |
67 |
203
| ((DataFlowNode) node).setType(type);
|
68 |
| } |
69 |
| |
70 |
40
| public List getBraceStack() {
|
71 |
40
| return braceStack;
|
72 |
| } |
73 |
| |
74 |
40
| public List getContinueBreakReturnStack() {
|
75 |
40
| return continueBreakReturnStack;
|
76 |
| } |
77 |
| |
78 |
| } |