blob: 208f9f0859f9ccd1dd9b9a85ee5f7080ac517653 (
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
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
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
|
/*******************************************************************************
* Copyright (c) 2009 Elliott Baron
* All rights reserved. This program and the accompanying materials
* are made available under the terms of the Eclipse Public License v1.0
* which accompanies this distribution, and is available at
* http://www.eclipse.org/legal/epl-v10.html
*
* Contributors:
* Elliott Baron - initial API and implementation
*******************************************************************************/
package org.eclipse.cdt.codan.extension;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import org.eclipse.cdt.core.dom.ast.IVariable;
public class ExecutionState {
private List<ExecutionStateClause> clauses;
private Map<IVariable, Boolean> truthAssignments;
private boolean top;
private boolean bottom;
public ExecutionState() {
truthAssignments = new HashMap<IVariable, Boolean>();
clauses = new ArrayList<ExecutionStateClause>();
top = true;
bottom = false;
}
public void addClause(ExecutionStateClause clause) {
// Cannot get out of bottom, do not add duplicate clauses
if (!bottom && !clauses.contains(clause)) {
top = false; // T AND x = x
if (clauses.contains(clause.getNegation())) {
clauses.clear();
bottom = true; // x AND NOT x = F
}
else {
clauses.add(clause);
}
}
}
public void removeClause(ExecutionStateClause node) {
clauses.remove(node);
if (clauses.size() == 0) {
setTop();
}
}
public void addTruthAssignment(IVariable var, boolean value) {
truthAssignments.put(var, value);
}
public Map<IVariable, Boolean> getTruthAssignments() {
return truthAssignments;
}
public void setTruthAssignments(Map<IVariable, Boolean> truthAssignments) {
this.truthAssignments = truthAssignments;
}
public void bindTruthAssignments() {
boolean unsatisfiable = false;
List<ExecutionStateClause> clausesCopy = new ArrayList<ExecutionStateClause>(clauses);
for (ExecutionStateClause c : clausesCopy) {
Boolean truth = truthAssignments.get(c.getVariable());
if (truth != null) {
if (truth == c.isTrue()) { // does truth value of clause match truth assignment?
removeClause(c);
}
else {
unsatisfiable = true;
}
}
}
if (unsatisfiable) {
setBottom();
}
}
//FIXME
public ExecutionState join(ExecutionState other) {
// Add clauses from other, canceling out negating clauses
for (ExecutionStateClause clause : other.getClauses()) {
ExecutionStateClause negation = clause.getNegation();
if (clauses.contains(negation)) {
removeClause(negation);
other.removeClause(clause);
}
}
return this;
}
public ExecutionStateClause[] getClauses() {
return clauses.toArray(new ExecutionStateClause[clauses.size()]);
}
public boolean isTop() {
return top;
}
public boolean isBottom() {
return bottom;
}
public void setTop() {
top = true;
bottom = false;
clauses.clear();
}
public void setBottom() {
bottom = true;
top = false;
clauses.clear();
}
@Override
public String toString() {
String ret;
if (top) {
ret = "[TOP]";
}
else if (bottom) {
ret = "[BOTTOM]";
}
else {
StringBuffer buf = new StringBuffer();
if (clauses.size() > 0) {
for (ExecutionStateClause c : clauses) {
buf.append(c);
buf.append(" AND ");
}
buf.delete(buf.length() - 5 /* " AND ".length() */, buf.length());
}
ret = buf.toString();
}
return ret;
}
}
|
