1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
|
package org.checkerframework.dataflow.cfg.node;
import java.util.Collection;
import java.util.LinkedList;
import java.util.List;
import org.checkerframework.dataflow.cfg.node.AssignmentContext.MethodParameterContext;
import org.checkerframework.dataflow.util.HashCodeUtils;
import org.checkerframework.javacutil.InternalUtils;
import com.sun.source.tree.MethodInvocationTree;
import com.sun.source.tree.Tree;
import com.sun.source.util.TreePath;
/**
* A node for method invocation
*
* <pre>
* <em>target(arg1, arg2, ...)</em>
* </pre>
*
* CFGs may contain {@link MethodInvocationNode}s that correspond to no AST
* {@link Tree}, in which case, the tree field will be null.
*
* @author Stefan Heule
* @author Charlie Garrett
*
*/
public class MethodInvocationNode extends Node {
protected MethodInvocationTree tree;
protected MethodAccessNode target;
protected List<Node> arguments;
protected TreePath treePath;
public MethodInvocationNode(MethodInvocationTree tree,
MethodAccessNode target, List<Node> arguments, TreePath treePath) {
super(tree != null ? InternalUtils.typeOf(tree) : target.getMethod().getReturnType());
this.tree = tree;
this.target = target;
this.arguments = arguments;
this.treePath = treePath;
// set assignment contexts for parameters
int i = 0;
for (Node arg : arguments) {
AssignmentContext ctx = new MethodParameterContext(target.getMethod(), i++);
arg.setAssignmentContext(ctx);
}
}
public MethodInvocationNode(MethodAccessNode target, List<Node> arguments,
TreePath treePath) {
this(null, target, arguments, treePath);
}
public MethodAccessNode getTarget() {
return target;
}
public List<Node> getArguments() {
return arguments;
}
public Node getArgument(int i) {
return arguments.get(i);
}
public TreePath getTreePath() {
return treePath;
}
@Override
public MethodInvocationTree getTree() {
return tree;
}
@Override
public <R, P> R accept(NodeVisitor<R, P> visitor, P p) {
return visitor.visitMethodInvocation(this, p);
}
@Override
public String toString() {
StringBuffer sb = new StringBuffer();
sb.append(target);
sb.append("(");
boolean needComma = false;
for (Node arg : arguments) {
if (needComma) {
sb.append(", ");
}
sb.append(arg);
needComma = true;
}
sb.append(")");
return sb.toString();
}
@Override
public boolean equals(Object obj) {
if (obj == null || !(obj instanceof MethodInvocationNode)) {
return false;
}
MethodInvocationNode other = (MethodInvocationNode) obj;
return getTarget().equals(other.getTarget())
&& getArguments().equals(other.getArguments());
}
@Override
public int hashCode() {
int hash = 0;
hash = HashCodeUtils.hash(target);
for (Node arg : arguments) {
hash = HashCodeUtils.hash(hash, arg.hashCode());
}
return hash;
}
@Override
public Collection<Node> getOperands() {
List<Node> list = new LinkedList<Node>();
list.add(target);
list.addAll(arguments);
return list;
}
}
|
