blob: a17e2fa2e80a320f4ab47b1752570c5292d495b2 (
plain)
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
|
package org.checkerframework.dataflow.cfg.node;
/*>>>
import org.checkerframework.checker.nullness.qual.Nullable;
*/
/*
* This represents the start and end of synchronized code block.
* If startOfBlock == true it is the node preceding a synchronized code block.
* Otherwise it is the node immediately after a synchronized code block.
*/
import com.sun.source.tree.Tree;
import java.util.Collection;
import java.util.Collections;
import javax.lang.model.type.TypeKind;
import javax.lang.model.util.Types;
import org.checkerframework.dataflow.util.HashCodeUtils;
public class SynchronizedNode extends Node {
protected /*@Nullable*/ Tree tree;
protected Node expression;
protected boolean startOfBlock;
public SynchronizedNode(
/*@Nullable*/ Tree tree, Node expression, boolean startOfBlock, Types types) {
super(types.getNoType(TypeKind.NONE));
this.tree = tree;
this.expression = expression;
this.startOfBlock = startOfBlock;
}
@Override
public Tree getTree() {
return tree;
}
public Node getExpression() {
return expression;
}
public boolean getIsStartOfBlock() {
return startOfBlock;
}
@Override
public <R, P> R accept(NodeVisitor<R, P> visitor, P p) {
return visitor.visitSynchronized(this, p);
}
@Override
public String toString() {
StringBuffer sb = new StringBuffer();
sb.append("synchronized ");
sb.append("(" + expression + ")");
return sb.toString();
}
@Override
public boolean equals(Object obj) {
if (obj == null || !(obj instanceof SynchronizedNode)) {
return false;
}
SynchronizedNode other = (SynchronizedNode) obj;
if (tree == null && other.getTree() != null) {
return false;
}
return getTree().equals(other.getTree())
&& getExpression().equals(other.getExpression())
&& startOfBlock == other.startOfBlock;
}
@Override
public int hashCode() {
int hash = 0;
if (tree != null) {
hash = HashCodeUtils.hash(tree);
}
hash = HashCodeUtils.hash(startOfBlock);
return HashCodeUtils.hash(hash, getExpression());
}
@Override
public Collection<Node> getOperands() {
return Collections.emptyList();
}
}
|
