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
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
|
/********************* -*- C++ -*- */
/** expr_builder.cpp
** This file is part of the CVC4 prototype.
** Copyright (c) 2009 The Analysis of Computer Systems Group (ACSys)
** Courant Institute of Mathematical Sciences
** New York University
** See the file COPYING in the top-level source directory for licensing
** information.
**
**/
#include "expr_builder.h"
#include "expr_manager.h"
#include "expr_value.h"
#include "util/assert.h"
using namespace std;
namespace CVC4 {
ExprBuilder::ExprBuilder() : d_em(ExprManager::currentEM()), d_kind(UNDEFINED_KIND), d_used(false), d_nchildren(0) {}
ExprBuilder::ExprBuilder(Kind k) : d_em(ExprManager::currentEM()), d_kind(k), d_used(false), d_nchildren(0) {}
ExprBuilder::ExprBuilder(const Expr& e) : d_em(ExprManager::currentEM()), d_kind(UNDEFINED_KIND), d_used(false), d_nchildren(1) {
ExprValue *v = e->inc();
d_children.u_arr[0] = v;
}
ExprBuilder& ExprBuilder::reset(const ExprValue* ev) {
this->~ExprBuilder();
d_kind = Kind(ev->d_kind);
d_used = false;
d_nchildren = ev->d_nchildren;
for(Expr::const_iterator i = ev->begin(); i != ev->end(); ++i)
addChild(i->d_ev);
return *this;
}
ExprBuilder::ExprBuilder(const ExprBuilder& eb) : d_em(eb.d_em), d_kind(eb.d_kind), d_used(eb.d_used), d_nchildren(eb.d_nchildren) {
cvc4assert(!d_used);
if(d_nchildren > nchild_thresh) {
d_children.u_vec = new vector<Expr>();
d_children.u_vec->reserve(d_nchildren + 5);
copy(eb.d_children.u_vec->begin(), eb.d_children.u_vec->end(), back_inserter(*d_children.u_vec));
} else {
ev_iterator j = d_children.u_arr;
for(ExprValue* const* i = eb.d_children.u_arr; i != eb.d_children.u_arr + eb.d_nchildren; ++i, ++j)
*j = (*i)->inc();
}
}
ExprBuilder::ExprBuilder(ExprManager* em) : d_em(em), d_kind(UNDEFINED_KIND), d_used(false), d_nchildren(0) {
}
ExprBuilder::ExprBuilder(ExprManager* em, Kind k) : d_em(em), d_kind(k), d_used(false), d_nchildren(0) {
}
ExprBuilder::ExprBuilder(ExprManager* em, const Expr& e) : d_em(em), d_kind(UNDEFINED_KIND), d_used(false), d_nchildren(1) {
ExprValue *v = e->inc();
d_children.u_arr[0] = v;
}
ExprBuilder::~ExprBuilder() {
if(d_nchildren > nchild_thresh) {
delete d_children.u_vec;
} else {
for(ev_iterator i = d_children.u_arr; i != d_children.u_arr + d_nchildren; ++i) {
(*i)->dec();
}
}
}
// Compound expression constructors
ExprBuilder& ExprBuilder::eqExpr(const Expr& right) {
if(d_kind != UNDEFINED_KIND && d_kind != EQUAL)
collapse();
d_kind = EQUAL;
return *this;
}
ExprBuilder& ExprBuilder::notExpr() {
if(d_kind != UNDEFINED_KIND)
collapse();
d_kind = NOT;
return *this;
}
// avoid double-negatives
ExprBuilder& ExprBuilder::negate() {
if(d_kind == NOT)
return reset(d_children.u_arr[0]);
if(d_kind != UNDEFINED_KIND)
collapse();
d_kind = NOT;
return *this;
}
ExprBuilder& ExprBuilder::andExpr(const Expr& right) {
}
ExprBuilder& ExprBuilder::orExpr(const Expr& right) {
}
ExprBuilder& ExprBuilder::iteExpr(const Expr& thenpart, const Expr& elsepart) {
}
ExprBuilder& ExprBuilder::iffExpr(const Expr& right) {
}
ExprBuilder& ExprBuilder::impExpr(const Expr& right) {
}
ExprBuilder& ExprBuilder::xorExpr(const Expr& right) {
}
ExprBuilder& ExprBuilder::skolemExpr(int i) {
}
ExprBuilder& ExprBuilder::substExpr(const std::vector<Expr>& oldTerms,
const std::vector<Expr>& newTerms) {
}
// "Stream" expression constructor syntax
ExprBuilder& ExprBuilder::operator<<(const Kind& op) {
}
ExprBuilder& ExprBuilder::operator<<(const Expr& child) {
}
void ExprBuilder::addChild(const Expr& e) {
if(d_nchildren == nchild_thresh) {
vector<Expr>* v = new vector<Expr>();
v->reserve(nchild_thresh + 5);
for(ExprValue** i = d_children.u_arr; i != d_children.u_arr + nchild_thresh; ++i) {
v->push_back(Expr(*i));
(*i)->dec();
}
v->push_back(e);
d_children.u_vec = v;
++d_nchildren;
} else if(d_nchildren > nchild_thresh) {
d_children.u_vec->push_back(e);
++d_nchildren;
} else {
ExprValue *ev = e.d_ev;
d_children.u_arr[d_nchildren] = ev;
ev->inc();
++d_nchildren;
}
}
void ExprBuilder::addChild(ExprValue* ev) {
if(d_nchildren == nchild_thresh) {
vector<Expr>* v = new vector<Expr>();
v->reserve(nchild_thresh + 5);
for(ExprValue** i = d_children.u_arr; i != d_children.u_arr + nchild_thresh; ++i) {
v->push_back(Expr(*i));
(*i)->dec();
}
v->push_back(Expr(ev));
d_children.u_vec = v;
++d_nchildren;
} else if(d_nchildren > nchild_thresh) {
d_children.u_vec->push_back(Expr(ev));
++d_nchildren;
} else {
d_children.u_arr[d_nchildren] = ev;
ev->inc();
++d_nchildren;
}
}
void ExprBuilder::collapse() {
if(d_nchildren == nchild_thresh) {
vector<Expr>* v = new vector<Expr>();
v->reserve(nchild_thresh + 5);
}
}
// not const
ExprBuilder::operator Expr() {
}
AndExprBuilder ExprBuilder::operator&&(Expr) {
}
OrExprBuilder ExprBuilder::operator||(Expr) {
}
PlusExprBuilder ExprBuilder::operator+ (Expr) {
}
PlusExprBuilder ExprBuilder::operator- (Expr) {
}
MultExprBuilder ExprBuilder::operator* (Expr) {
}
}/* CVC4 namespace */
|
