1 |
|
/****************************************************************************** |
2 |
|
* Top contributors (to current version): |
3 |
|
* Liana Hadarean, Aina Niemetz, Clark Barrett |
4 |
|
* |
5 |
|
* This file is part of the cvc5 project. |
6 |
|
* |
7 |
|
* Copyright (c) 2009-2021 by the authors listed in the file AUTHORS |
8 |
|
* in the top-level source directory and their institutional affiliations. |
9 |
|
* All rights reserved. See the file COPYING in the top-level source |
10 |
|
* directory for licensing information. |
11 |
|
* **************************************************************************** |
12 |
|
* |
13 |
|
* [[ Add one-line brief description here ]] |
14 |
|
* |
15 |
|
* [[ Add lengthier description here ]] |
16 |
|
* \todo document this file |
17 |
|
*/ |
18 |
|
|
19 |
|
#include "cvc5_private.h" |
20 |
|
|
21 |
|
#pragma once |
22 |
|
|
23 |
|
#include <unordered_map> |
24 |
|
#include <unordered_set> |
25 |
|
|
26 |
|
#include "expr/node_algorithm.h" |
27 |
|
#include "theory/bv/theory_bv_rewrite_rules.h" |
28 |
|
#include "theory/bv/theory_bv_utils.h" |
29 |
|
#include "theory/rewriter.h" |
30 |
|
#include "util/bitvector.h" |
31 |
|
|
32 |
|
namespace cvc5 { |
33 |
|
namespace theory { |
34 |
|
namespace bv { |
35 |
|
|
36 |
|
/** |
37 |
|
* ExtractBitwise |
38 |
|
* (x bvop y) [i:j] ==> x[i:j] bvop y[i:j] |
39 |
|
* where bvop is bvand,bvor, bvxor |
40 |
|
*/ |
41 |
|
template<> inline |
42 |
|
bool RewriteRule<ExtractBitwise>::applies(TNode node) { |
43 |
|
return (node.getKind() == kind::BITVECTOR_EXTRACT && |
44 |
|
(node[0].getKind() == kind::BITVECTOR_AND || |
45 |
|
node[0].getKind() == kind::BITVECTOR_OR || |
46 |
|
node[0].getKind() == kind::BITVECTOR_XOR )); |
47 |
|
} |
48 |
|
|
49 |
|
template<> inline |
50 |
|
Node RewriteRule<ExtractBitwise>::apply(TNode node) { |
51 |
|
Debug("bv-rewrite") << "RewriteRule<ExtractBitwise>(" << node << ")" << std::endl; |
52 |
|
unsigned high = utils::getExtractHigh(node); |
53 |
|
unsigned low = utils::getExtractLow(node); |
54 |
|
std::vector<Node> children; |
55 |
|
for (unsigned i = 0; i < node[0].getNumChildren(); ++i) { |
56 |
|
children.push_back(utils::mkExtract(node[0][i], high, low)); |
57 |
|
} |
58 |
|
Kind kind = node[0].getKind(); |
59 |
|
return utils::mkSortedNode(kind, children); |
60 |
|
} |
61 |
|
|
62 |
|
/** |
63 |
|
* ExtractNot |
64 |
|
* |
65 |
|
* (~ a) [i:j] ==> ~ (a[i:j]) |
66 |
|
*/ |
67 |
|
template<> inline |
68 |
143950 |
bool RewriteRule<ExtractNot>::applies(TNode node) { |
69 |
431850 |
return (node.getKind() == kind::BITVECTOR_EXTRACT && |
70 |
431850 |
node[0].getKind() == kind::BITVECTOR_NOT); |
71 |
|
} |
72 |
|
|
73 |
|
template <> |
74 |
1662 |
inline Node RewriteRule<ExtractNot>::apply(TNode node) |
75 |
|
{ |
76 |
1662 |
Debug("bv-rewrite") << "RewriteRule<ExtractNot>(" << node << ")" << std::endl; |
77 |
1662 |
unsigned low = utils::getExtractLow(node); |
78 |
1662 |
unsigned high = utils::getExtractHigh(node); |
79 |
3324 |
Node a = utils::mkExtract(node[0][0], high, low); |
80 |
3324 |
return NodeManager::currentNM()->mkNode(kind::BITVECTOR_NOT, a); |
81 |
|
} |
82 |
|
|
83 |
|
/** |
84 |
|
* ExtractSignExtend |
85 |
|
* |
86 |
|
* (sign_extend k x) [i:j] => pushes extract in |
87 |
|
* |
88 |
|
* @return |
89 |
|
*/ |
90 |
|
|
91 |
|
template<> inline |
92 |
143354 |
bool RewriteRule<ExtractSignExtend>::applies(TNode node) { |
93 |
573416 |
if (node.getKind() == kind::BITVECTOR_EXTRACT && |
94 |
430062 |
node[0].getKind() == kind::BITVECTOR_SIGN_EXTEND) { |
95 |
1066 |
return true; |
96 |
|
} |
97 |
142288 |
return false; |
98 |
|
} |
99 |
|
|
100 |
|
template <> |
101 |
533 |
inline Node RewriteRule<ExtractSignExtend>::apply(TNode node) |
102 |
|
{ |
103 |
1066 |
Debug("bv-rewrite") << "RewriteRule<ExtractSignExtend>(" << node << ")" |
104 |
533 |
<< std::endl; |
105 |
1066 |
TNode extendee = node[0][0]; |
106 |
533 |
unsigned extendee_size = utils::getSize(extendee); |
107 |
|
|
108 |
533 |
unsigned high = utils::getExtractHigh(node); |
109 |
533 |
unsigned low = utils::getExtractLow(node); |
110 |
|
|
111 |
533 |
Node resultNode; |
112 |
|
// extract falls on extendee |
113 |
533 |
if (high < extendee_size) |
114 |
|
{ |
115 |
187 |
resultNode = utils::mkExtract(extendee, high, low); |
116 |
|
} |
117 |
346 |
else if (low < extendee_size && high >= extendee_size) |
118 |
|
{ |
119 |
|
// if extract overlaps sign extend and extendee |
120 |
122 |
Node low_extract = utils::mkExtract(extendee, extendee_size - 1, low); |
121 |
61 |
unsigned new_amount = high - extendee_size + 1; |
122 |
122 |
resultNode = utils::mkSignExtend(low_extract, new_amount); |
123 |
|
} |
124 |
|
else |
125 |
|
{ |
126 |
|
// extract only over sign extend |
127 |
285 |
Assert(low >= extendee_size); |
128 |
285 |
unsigned top = utils::getSize(extendee) - 1; |
129 |
570 |
Node most_significant_bit = utils::mkExtract(extendee, top, top); |
130 |
570 |
std::vector<Node> bits; |
131 |
753 |
for (unsigned i = 0; i < high - low + 1; ++i) |
132 |
|
{ |
133 |
468 |
bits.push_back(most_significant_bit); |
134 |
|
} |
135 |
285 |
resultNode = utils::mkConcat(bits); |
136 |
|
} |
137 |
1066 |
Debug("bv-rewrite") << " =>" << resultNode |
138 |
533 |
<< std::endl; |
139 |
1066 |
return resultNode; |
140 |
|
} |
141 |
|
|
142 |
|
/** |
143 |
|
* ExtractArith |
144 |
|
* |
145 |
|
* (a bvop b) [k:0] ==> (a[k:0] bvop b[k:0]) |
146 |
|
*/ |
147 |
|
|
148 |
|
template<> inline |
149 |
|
bool RewriteRule<ExtractArith>::applies(TNode node) { |
150 |
|
return (node.getKind() == kind::BITVECTOR_EXTRACT |
151 |
|
&& utils::getExtractLow(node) == 0 |
152 |
|
&& (node[0].getKind() == kind::BITVECTOR_ADD |
153 |
|
|| node[0].getKind() == kind::BITVECTOR_MULT)); |
154 |
|
} |
155 |
|
|
156 |
|
template <> |
157 |
|
inline Node RewriteRule<ExtractArith>::apply(TNode node) |
158 |
|
{ |
159 |
|
Debug("bv-rewrite") << "RewriteRule<ExtractArith>(" << node << ")" |
160 |
|
<< std::endl; |
161 |
|
unsigned low = utils::getExtractLow(node); |
162 |
|
Assert(low == 0); |
163 |
|
unsigned high = utils::getExtractHigh(node); |
164 |
|
std::vector<Node> children; |
165 |
|
for (unsigned i = 0; i < node[0].getNumChildren(); ++i) |
166 |
|
{ |
167 |
|
children.push_back(utils::mkExtract(node[0][i], high, low)); |
168 |
|
} |
169 |
|
Kind kind = node[0].getKind(); |
170 |
|
return utils::mkNaryNode(kind, children); |
171 |
|
} |
172 |
|
|
173 |
|
/** |
174 |
|
* ExtractArith2 |
175 |
|
* |
176 |
|
* (a bvop b) [i:j] ==> (a[i:0] bvop b[i:0]) [i:j] |
177 |
|
*/ |
178 |
|
|
179 |
|
// careful not to apply in a loop |
180 |
|
template<> inline |
181 |
|
bool RewriteRule<ExtractArith2>::applies(TNode node) { |
182 |
|
return (node.getKind() == kind::BITVECTOR_EXTRACT |
183 |
|
&& (node[0].getKind() == kind::BITVECTOR_ADD |
184 |
|
|| node[0].getKind() == kind::BITVECTOR_MULT)); |
185 |
|
} |
186 |
|
|
187 |
|
template <> |
188 |
|
inline Node RewriteRule<ExtractArith2>::apply(TNode node) |
189 |
|
{ |
190 |
|
Debug("bv-rewrite") << "RewriteRule<ExtractArith2>(" << node << ")" |
191 |
|
<< std::endl; |
192 |
|
unsigned low = utils::getExtractLow(node); |
193 |
|
unsigned high = utils::getExtractHigh(node); |
194 |
|
std::vector<Node> children; |
195 |
|
for (unsigned i = 0; i < node[0].getNumChildren(); ++i) |
196 |
|
{ |
197 |
|
children.push_back(utils::mkExtract(node[0][i], high, 0)); |
198 |
|
} |
199 |
|
Kind kind = node[0].getKind(); |
200 |
|
Node op_children = utils::mkNaryNode(kind, children); |
201 |
|
|
202 |
|
return utils::mkExtract(op_children, high, low); |
203 |
|
} |
204 |
|
|
205 |
|
template<> inline |
206 |
400826 |
bool RewriteRule<FlattenAssocCommut>::applies(TNode node) { |
207 |
400826 |
Kind kind = node.getKind(); |
208 |
400826 |
if (kind != kind::BITVECTOR_ADD && kind != kind::BITVECTOR_MULT |
209 |
9188 |
&& kind != kind::BITVECTOR_OR && kind != kind::BITVECTOR_XOR |
210 |
|
&& kind != kind::BITVECTOR_AND) |
211 |
|
return false; |
212 |
400826 |
TNode::iterator child_it = node.begin(); |
213 |
2726648 |
for(; child_it != node.end(); ++child_it) { |
214 |
1215453 |
if ((*child_it).getKind() == kind) { |
215 |
52542 |
return true; |
216 |
|
} |
217 |
|
} |
218 |
348284 |
return false; |
219 |
|
} |
220 |
|
|
221 |
|
template <> |
222 |
26275 |
inline Node RewriteRule<FlattenAssocCommut>::apply(TNode node) |
223 |
|
{ |
224 |
52550 |
Debug("bv-rewrite") << "RewriteRule<FlattenAssocCommut>(" << node << ")" |
225 |
26275 |
<< std::endl; |
226 |
52550 |
std::vector<Node> processingStack; |
227 |
26275 |
processingStack.push_back(node); |
228 |
52550 |
std::vector<Node> children; |
229 |
26275 |
Kind kind = node.getKind(); |
230 |
|
|
231 |
452585 |
while (!processingStack.empty()) |
232 |
|
{ |
233 |
426310 |
TNode current = processingStack.back(); |
234 |
213155 |
processingStack.pop_back(); |
235 |
|
|
236 |
|
// flatten expression |
237 |
213155 |
if (current.getKind() == kind) |
238 |
|
{ |
239 |
248274 |
for (unsigned i = 0; i < current.getNumChildren(); ++i) |
240 |
|
{ |
241 |
186880 |
processingStack.push_back(current[i]); |
242 |
|
} |
243 |
|
} |
244 |
|
else |
245 |
|
{ |
246 |
151761 |
children.push_back(current); |
247 |
|
} |
248 |
|
} |
249 |
52550 |
if (node.getKind() == kind::BITVECTOR_ADD |
250 |
26275 |
|| node.getKind() == kind::BITVECTOR_MULT) |
251 |
|
{ |
252 |
26200 |
return utils::mkNaryNode(kind, children); |
253 |
|
} |
254 |
|
else |
255 |
|
{ |
256 |
75 |
return utils::mkSortedNode(kind, children); |
257 |
|
} |
258 |
|
} |
259 |
|
|
260 |
576568 |
static inline void addToCoefMap(std::map<Node, BitVector>& map, |
261 |
|
TNode term, const BitVector& coef) { |
262 |
576568 |
if (map.find(term) != map.end()) { |
263 |
440 |
map[term] = map[term] + coef; |
264 |
|
} else { |
265 |
576128 |
map[term] = coef; |
266 |
|
} |
267 |
576568 |
} |
268 |
|
|
269 |
|
|
270 |
736480 |
static inline void updateCoefMap(TNode current, unsigned size, |
271 |
|
std::map<Node, BitVector>& factorToCoefficient, |
272 |
|
BitVector& constSum) { |
273 |
736480 |
switch (current.getKind()) { |
274 |
246456 |
case kind::BITVECTOR_MULT: { |
275 |
|
// look for c * term, where c is a constant |
276 |
492912 |
BitVector coeff; |
277 |
492912 |
Node term; |
278 |
246456 |
if (current.getNumChildren() == 2) { |
279 |
|
// Mult should be normalized with only one constant at end |
280 |
57993 |
Assert(!current[0].isConst()); |
281 |
57993 |
if (current[1].isConst()) { |
282 |
44482 |
coeff = current[1].getConst<BitVector>(); |
283 |
44482 |
term = current[0]; |
284 |
|
} |
285 |
|
} |
286 |
188463 |
else if (current[current.getNumChildren()-1].isConst()) { |
287 |
359816 |
NodeBuilder nb(kind::BITVECTOR_MULT); |
288 |
179908 |
TNode::iterator child_it = current.begin(); |
289 |
1192980 |
for(; (child_it+1) != current.end(); ++child_it) { |
290 |
506536 |
Assert(!(*child_it).isConst()); |
291 |
506536 |
nb << (*child_it); |
292 |
|
} |
293 |
179908 |
term = nb; |
294 |
179908 |
coeff = (*child_it).getConst<BitVector>(); |
295 |
|
} |
296 |
246456 |
if (term.isNull()) { |
297 |
22066 |
coeff = BitVector(size, (unsigned)1); |
298 |
22066 |
term = current; |
299 |
|
} |
300 |
246456 |
if(term.getKind() == kind::BITVECTOR_SUB) { |
301 |
|
TNode a = term[0]; |
302 |
|
TNode b = term[1]; |
303 |
|
addToCoefMap(factorToCoefficient, a, coeff); |
304 |
|
addToCoefMap(factorToCoefficient, b, -coeff); |
305 |
|
} |
306 |
246456 |
else if(term.getKind() == kind::BITVECTOR_NEG) { |
307 |
|
addToCoefMap(factorToCoefficient, term[0], -BitVector(size, coeff)); |
308 |
|
} |
309 |
|
else { |
310 |
246456 |
addToCoefMap(factorToCoefficient, term, coeff); |
311 |
|
} |
312 |
246456 |
break; |
313 |
|
} |
314 |
|
case kind::BITVECTOR_SUB: |
315 |
|
// turn into a + (-1)*b |
316 |
|
Assert(current.getNumChildren() == 2); |
317 |
|
addToCoefMap(factorToCoefficient, current[0], BitVector(size, (unsigned)1)); |
318 |
|
addToCoefMap(factorToCoefficient, current[1], -BitVector(size, (unsigned)1)); |
319 |
|
break; |
320 |
73756 |
case kind::BITVECTOR_NEG: |
321 |
73756 |
addToCoefMap(factorToCoefficient, current[0], -BitVector(size, (unsigned)1)); |
322 |
73756 |
break; |
323 |
159912 |
case kind::CONST_BITVECTOR: { |
324 |
319824 |
BitVector constValue = current.getConst<BitVector>(); |
325 |
159912 |
constSum = constSum + constValue; |
326 |
159912 |
break; |
327 |
|
} |
328 |
256356 |
default: |
329 |
|
// store as 1 * current |
330 |
256356 |
addToCoefMap(factorToCoefficient, current, BitVector(size, (unsigned)1)); |
331 |
256356 |
break; |
332 |
|
} |
333 |
736480 |
} |
334 |
|
|
335 |
573450 |
static inline void addToChildren(TNode term, |
336 |
|
unsigned size, |
337 |
|
BitVector coeff, |
338 |
|
std::vector<Node> &children) |
339 |
|
{ |
340 |
573450 |
NodeManager *nm = NodeManager::currentNM(); |
341 |
573450 |
if (coeff == BitVector(size, (unsigned)0)) |
342 |
|
{ |
343 |
86 |
return; |
344 |
|
} |
345 |
573364 |
else if (coeff == BitVector(size, (unsigned)1)) |
346 |
|
{ |
347 |
276260 |
children.push_back(term); |
348 |
|
} |
349 |
297104 |
else if (coeff == -BitVector(size, (unsigned)1)) |
350 |
|
{ |
351 |
|
// avoid introducing an extra multiplication |
352 |
72434 |
children.push_back(nm->mkNode(kind::BITVECTOR_NEG, term)); |
353 |
|
} |
354 |
224670 |
else if (term.getKind() == kind::BITVECTOR_MULT) |
355 |
|
{ |
356 |
359808 |
NodeBuilder nb(kind::BITVECTOR_MULT); |
357 |
179904 |
TNode::iterator child_it = term.begin(); |
358 |
1192940 |
for (; child_it != term.end(); ++child_it) |
359 |
|
{ |
360 |
506518 |
nb << *child_it; |
361 |
|
} |
362 |
179904 |
nb << utils::mkConst(coeff); |
363 |
179904 |
children.push_back(Node(nb)); |
364 |
|
} |
365 |
|
else |
366 |
|
{ |
367 |
89532 |
Node coeffNode = utils::mkConst(coeff); |
368 |
89532 |
Node product = nm->mkNode(kind::BITVECTOR_MULT, term, coeffNode); |
369 |
44766 |
children.push_back(product); |
370 |
|
} |
371 |
|
} |
372 |
|
|
373 |
|
template <> |
374 |
147298 |
inline bool RewriteRule<AddCombineLikeTerms>::applies(TNode node) |
375 |
|
{ |
376 |
147298 |
return (node.getKind() == kind::BITVECTOR_ADD); |
377 |
|
} |
378 |
|
|
379 |
|
template <> |
380 |
73649 |
inline Node RewriteRule<AddCombineLikeTerms>::apply(TNode node) |
381 |
|
{ |
382 |
147298 |
Debug("bv-rewrite") << "RewriteRule<AddCombineLikeTerms>(" << node << ")" |
383 |
73649 |
<< std::endl; |
384 |
73649 |
unsigned size = utils::getSize(node); |
385 |
147298 |
BitVector constSum(size, (unsigned)0); |
386 |
147298 |
std::map<Node, BitVector> factorToCoefficient; |
387 |
|
|
388 |
|
// combine like-terms |
389 |
479944 |
for (size_t i = 0, n = node.getNumChildren(); i < n; ++i) |
390 |
|
{ |
391 |
812590 |
TNode current = node[i]; |
392 |
406295 |
updateCoefMap(current, size, factorToCoefficient, constSum); |
393 |
|
} |
394 |
|
|
395 |
147298 |
std::vector<Node> children; |
396 |
|
|
397 |
|
// construct result |
398 |
73649 |
std::map<Node, BitVector>::const_iterator it = factorToCoefficient.begin(); |
399 |
|
|
400 |
714905 |
for (; it != factorToCoefficient.end(); ++it) |
401 |
|
{ |
402 |
320628 |
addToChildren(it->first, size, it->second, children); |
403 |
|
} |
404 |
|
|
405 |
73649 |
if (constSum != BitVector(size, (unsigned)0)) |
406 |
|
{ |
407 |
46066 |
children.push_back(utils::mkConst(constSum)); |
408 |
|
} |
409 |
|
|
410 |
73649 |
size_t csize = children.size(); |
411 |
73649 |
if (csize == node.getNumChildren()) |
412 |
|
{ |
413 |
|
// If we couldn't combine any terms, we don't perform the rewrite. This is |
414 |
|
// important because we are otherwise reordering terms in the addition |
415 |
|
// based on the node ids of the terms that are multiplied with the |
416 |
|
// coefficients. Due to garbage collection we may see different id orders |
417 |
|
// for those nodes even when we perform one rewrite directly after the |
418 |
|
// other, so the rewrite wouldn't be idempotent. |
419 |
36265 |
return node; |
420 |
|
} |
421 |
|
|
422 |
|
return csize == 0 ? utils::mkZero(size) |
423 |
37384 |
: utils::mkNaryNode(kind::BITVECTOR_ADD, children); |
424 |
|
} |
425 |
|
|
426 |
|
template<> inline |
427 |
469536 |
bool RewriteRule<MultSimplify>::applies(TNode node) { |
428 |
469536 |
return node.getKind() == kind::BITVECTOR_MULT; |
429 |
|
} |
430 |
|
|
431 |
|
template <> |
432 |
234768 |
inline Node RewriteRule<MultSimplify>::apply(TNode node) |
433 |
|
{ |
434 |
469536 |
Debug("bv-rewrite") << "RewriteRule<MultSimplify>(" << node << ")" |
435 |
234768 |
<< std::endl; |
436 |
234768 |
NodeManager *nm = NodeManager::currentNM(); |
437 |
234768 |
unsigned size = utils::getSize(node); |
438 |
469536 |
BitVector constant(size, Integer(1)); |
439 |
|
|
440 |
234768 |
bool isNeg = false; |
441 |
469536 |
std::vector<Node> children; |
442 |
880068 |
for (const TNode ¤t : node) |
443 |
|
{ |
444 |
1300090 |
Node c = current; |
445 |
654790 |
if (c.getKind() == kind::BITVECTOR_NEG) |
446 |
|
{ |
447 |
1363 |
isNeg = !isNeg; |
448 |
1363 |
c = c[0]; |
449 |
|
} |
450 |
|
|
451 |
654790 |
if (c.getKind() == kind::CONST_BITVECTOR) |
452 |
|
{ |
453 |
461278 |
BitVector value = c.getConst<BitVector>(); |
454 |
235384 |
constant = constant * value; |
455 |
235384 |
if (constant == BitVector(size, (unsigned)0)) |
456 |
|
{ |
457 |
9490 |
return utils::mkConst(size, 0); |
458 |
|
} |
459 |
|
} |
460 |
|
else |
461 |
|
{ |
462 |
419406 |
children.push_back(c); |
463 |
|
} |
464 |
|
} |
465 |
450556 |
BitVector oValue = BitVector(size, static_cast<unsigned>(1)); |
466 |
450556 |
BitVector noValue = BitVector::mkOnes(size); |
467 |
|
|
468 |
225278 |
if (children.empty()) |
469 |
|
{ |
470 |
20799 |
return utils::mkConst(isNeg ? -constant : constant); |
471 |
|
} |
472 |
|
|
473 |
204479 |
std::sort(children.begin(), children.end()); |
474 |
|
|
475 |
204479 |
if (constant == noValue) |
476 |
|
{ |
477 |
1686 |
isNeg = !isNeg; |
478 |
|
} |
479 |
202793 |
else if (constant != oValue) |
480 |
|
{ |
481 |
174647 |
if (isNeg) |
482 |
|
{ |
483 |
1168 |
isNeg = !isNeg; |
484 |
1168 |
constant = -constant; |
485 |
|
} |
486 |
174647 |
children.push_back(utils::mkConst(constant)); |
487 |
|
} |
488 |
|
|
489 |
408958 |
Node ret = utils::mkNaryNode(kind::BITVECTOR_MULT, children); |
490 |
|
|
491 |
|
// if negative, negate entire node |
492 |
204479 |
if (isNeg && size > 1) |
493 |
|
{ |
494 |
893 |
ret = nm->mkNode(kind::BITVECTOR_NEG, ret); |
495 |
|
} |
496 |
204479 |
return ret; |
497 |
|
} |
498 |
|
|
499 |
|
template<> inline |
500 |
90210 |
bool RewriteRule<MultDistribConst>::applies(TNode node) { |
501 |
159286 |
if (node.getKind() != kind::BITVECTOR_MULT || |
502 |
69076 |
node.getNumChildren() != 2) { |
503 |
64024 |
return false; |
504 |
|
} |
505 |
26186 |
Assert(!node[0].isConst()); |
506 |
26186 |
if (!node[1].isConst()) { |
507 |
11541 |
return false; |
508 |
|
} |
509 |
29290 |
TNode factor = node[0]; |
510 |
14645 |
return (factor.getKind() == kind::BITVECTOR_ADD |
511 |
12481 |
|| factor.getKind() == kind::BITVECTOR_SUB |
512 |
27126 |
|| factor.getKind() == kind::BITVECTOR_NEG); |
513 |
|
} |
514 |
|
|
515 |
|
template <> |
516 |
1082 |
inline Node RewriteRule<MultDistribConst>::apply(TNode node) |
517 |
|
{ |
518 |
2164 |
Debug("bv-rewrite") << "RewriteRule<MultDistribConst>(" << node << ")" |
519 |
1082 |
<< std::endl; |
520 |
|
|
521 |
1082 |
NodeManager *nm = NodeManager::currentNM(); |
522 |
2164 |
TNode constant = node[1]; |
523 |
2164 |
TNode factor = node[0]; |
524 |
1082 |
Assert(constant.getKind() == kind::CONST_BITVECTOR); |
525 |
|
|
526 |
1082 |
if (factor.getKind() == kind::BITVECTOR_NEG) |
527 |
|
{ |
528 |
|
// push negation on the constant part |
529 |
|
BitVector const_bv = constant.getConst<BitVector>(); |
530 |
|
return nm->mkNode( |
531 |
|
kind::BITVECTOR_MULT, factor[0], utils::mkConst(-const_bv)); |
532 |
|
} |
533 |
|
|
534 |
2164 |
std::vector<Node> children; |
535 |
11332 |
for (unsigned i = 0; i < factor.getNumChildren(); ++i) |
536 |
|
{ |
537 |
10250 |
children.push_back(nm->mkNode(kind::BITVECTOR_MULT, factor[i], constant)); |
538 |
|
} |
539 |
|
|
540 |
1082 |
return utils::mkNaryNode(factor.getKind(), children); |
541 |
|
} |
542 |
|
|
543 |
|
template<> inline |
544 |
89514 |
bool RewriteRule<MultDistrib>::applies(TNode node) { |
545 |
156812 |
if (node.getKind() != kind::BITVECTOR_MULT || |
546 |
67298 |
node.getNumChildren() != 2) { |
547 |
65106 |
return false; |
548 |
|
} |
549 |
73224 |
if (node[0].getKind() == kind::BITVECTOR_ADD |
550 |
73224 |
|| node[0].getKind() == kind::BITVECTOR_SUB) |
551 |
|
{ |
552 |
186 |
return node[1].getKind() != kind::BITVECTOR_ADD |
553 |
186 |
&& node[1].getKind() != kind::BITVECTOR_SUB; |
554 |
|
} |
555 |
73038 |
return node[1].getKind() == kind::BITVECTOR_ADD |
556 |
73038 |
|| node[1].getKind() == kind::BITVECTOR_SUB; |
557 |
|
} |
558 |
|
|
559 |
|
template <> |
560 |
386 |
inline Node RewriteRule<MultDistrib>::apply(TNode node) |
561 |
|
{ |
562 |
772 |
Debug("bv-rewrite") << "RewriteRule<MultDistrib>(" << node << ")" |
563 |
386 |
<< std::endl; |
564 |
|
|
565 |
386 |
NodeManager *nm = NodeManager::currentNM(); |
566 |
1158 |
bool is_rhs_factor = node[0].getKind() == kind::BITVECTOR_ADD |
567 |
1158 |
|| node[0].getKind() == kind::BITVECTOR_SUB; |
568 |
772 |
TNode factor = !is_rhs_factor ? node[0] : node[1]; |
569 |
772 |
TNode sum = is_rhs_factor ? node[0] : node[1]; |
570 |
386 |
Assert(factor.getKind() != kind::BITVECTOR_ADD |
571 |
|
&& factor.getKind() != kind::BITVECTOR_SUB |
572 |
|
&& (sum.getKind() == kind::BITVECTOR_ADD |
573 |
|
|| sum.getKind() == kind::BITVECTOR_SUB)); |
574 |
|
|
575 |
772 |
std::vector<Node> children; |
576 |
20994 |
for (unsigned i = 0; i < sum.getNumChildren(); ++i) |
577 |
|
{ |
578 |
20608 |
children.push_back(nm->mkNode(kind::BITVECTOR_MULT, sum[i], factor)); |
579 |
|
} |
580 |
|
|
581 |
772 |
return utils::mkNaryNode(sum.getKind(), children); |
582 |
|
} |
583 |
|
|
584 |
|
template<> inline |
585 |
|
bool RewriteRule<ConcatToMult>::applies(TNode node) { |
586 |
|
if (node.getKind() != kind::BITVECTOR_CONCAT) return false; |
587 |
|
if (node.getNumChildren() != 2) return false; |
588 |
|
if (node[0].getKind()!= kind::BITVECTOR_EXTRACT) return false; |
589 |
|
if (!node[1].isConst()) return false; |
590 |
|
TNode extract = node[0]; |
591 |
|
TNode c = node[1]; |
592 |
|
unsigned amount = utils::getSize(c); |
593 |
|
|
594 |
|
if (utils::getSize(node) != utils::getSize(extract[0])) return false; |
595 |
|
if (c != utils::mkZero(amount)) return false; |
596 |
|
|
597 |
|
unsigned low = utils::getExtractLow(extract); |
598 |
|
if (low != 0) return false; |
599 |
|
unsigned high = utils::getExtractHigh(extract); |
600 |
|
if (high + amount + 1 != utils::getSize(node)) return false; |
601 |
|
return true; |
602 |
|
} |
603 |
|
|
604 |
|
template <> |
605 |
|
inline Node RewriteRule<ConcatToMult>::apply(TNode node) |
606 |
|
{ |
607 |
|
Debug("bv-rewrite") << "RewriteRule<ConcatToMult>(" << node << ")" |
608 |
|
<< std::endl; |
609 |
|
unsigned size = utils::getSize(node); |
610 |
|
Node factor = node[0][0]; |
611 |
|
Assert(utils::getSize(factor) == utils::getSize(node)); |
612 |
|
BitVector amount = BitVector(size, utils::getSize(node[1])); |
613 |
|
Node coef = utils::mkConst(BitVector(size, 1u).leftShift(amount)); |
614 |
|
return NodeManager::currentNM()->mkNode(kind::BITVECTOR_MULT, factor, coef); |
615 |
|
} |
616 |
|
|
617 |
|
template <> |
618 |
384339 |
inline bool RewriteRule<SolveEq>::applies(TNode node) |
619 |
|
{ |
620 |
768678 |
if (node.getKind() != kind::EQUAL |
621 |
727093 |
|| (node[0].isVar() && !expr::hasSubterm(node[1], node[0])) |
622 |
1060380 |
|| (node[1].isVar() && !expr::hasSubterm(node[0], node[1]))) |
623 |
|
{ |
624 |
116589 |
return false; |
625 |
|
} |
626 |
267750 |
return true; |
627 |
|
} |
628 |
|
|
629 |
|
// Doesn't do full solving (yet), instead, if a term appears both on lhs and |
630 |
|
// rhs, it subtracts from both sides so that one side's coeff is zero |
631 |
|
template <> |
632 |
133875 |
inline Node RewriteRule<SolveEq>::apply(TNode node) |
633 |
|
{ |
634 |
133875 |
Debug("bv-rewrite") << "RewriteRule<SolveEq>(" << node << ")" << std::endl; |
635 |
|
|
636 |
267750 |
TNode left = node[0]; |
637 |
267750 |
TNode right = node[1]; |
638 |
|
|
639 |
133875 |
unsigned size = utils::getSize(left); |
640 |
267750 |
BitVector zero(size, (unsigned)0); |
641 |
267750 |
BitVector leftConst(size, (unsigned)0); |
642 |
267750 |
BitVector rightConst(size, (unsigned)0); |
643 |
267750 |
std::map<Node, BitVector> leftMap, rightMap; |
644 |
|
|
645 |
|
// Collect terms and coefficients plus constant for left |
646 |
133875 |
if (left.getKind() == kind::BITVECTOR_ADD) |
647 |
|
{ |
648 |
72837 |
for (unsigned i = 0; i < left.getNumChildren(); ++i) |
649 |
|
{ |
650 |
63665 |
updateCoefMap(left[i], size, leftMap, leftConst); |
651 |
|
} |
652 |
|
} |
653 |
124703 |
else if (left.getKind() == kind::BITVECTOR_NOT && left[0] == right) |
654 |
|
{ |
655 |
40 |
return utils::mkFalse(); |
656 |
|
} |
657 |
|
else |
658 |
|
{ |
659 |
124663 |
updateCoefMap(left, size, leftMap, leftConst); |
660 |
|
} |
661 |
|
|
662 |
|
// Collect terms and coefficients plus constant for right |
663 |
133835 |
if (right.getKind() == kind::BITVECTOR_ADD) |
664 |
|
{ |
665 |
23224 |
for (unsigned i = 0; i < right.getNumChildren(); ++i) |
666 |
|
{ |
667 |
15623 |
updateCoefMap(right[i], size, rightMap, rightConst); |
668 |
|
} |
669 |
|
} |
670 |
126234 |
else if (right.getKind() == kind::BITVECTOR_NOT && right[0] == left) |
671 |
|
{ |
672 |
|
return utils::mkFalse(); |
673 |
|
} |
674 |
|
else |
675 |
|
{ |
676 |
126234 |
updateCoefMap(right, size, rightMap, rightConst); |
677 |
|
} |
678 |
|
|
679 |
267670 |
std::vector<Node> childrenLeft, childrenRight; |
680 |
|
|
681 |
133835 |
std::map<Node, BitVector>::const_iterator iLeft = leftMap.begin(), |
682 |
133835 |
iLeftEnd = leftMap.end(); |
683 |
133835 |
std::map<Node, BitVector>::const_iterator iRight = rightMap.begin(), |
684 |
133835 |
iRightEnd = rightMap.end(); |
685 |
|
|
686 |
267670 |
BitVector coeffLeft; |
687 |
267670 |
TNode termLeft; |
688 |
133835 |
if (iLeft != iLeftEnd) |
689 |
|
{ |
690 |
131097 |
coeffLeft = iLeft->second; |
691 |
131097 |
termLeft = iLeft->first; |
692 |
|
} |
693 |
|
|
694 |
267670 |
BitVector coeffRight; |
695 |
267670 |
TNode termRight; |
696 |
133835 |
if (iRight != iRightEnd) |
697 |
|
{ |
698 |
75398 |
coeffRight = iRight->second; |
699 |
75398 |
termRight = iRight->first; |
700 |
|
} |
701 |
|
|
702 |
|
// Changed tracks whether there have been any changes to the coefficients or |
703 |
|
// constants of the left- or right-hand side. We perform a rewrite only if |
704 |
|
// that is the case. This is important because we are otherwise reordering |
705 |
|
// terms in the addition based on the node ids of the terms that are |
706 |
|
// multiplied with the coefficients. Due to garbage collection we may see |
707 |
|
// different id orders for those nodes even when we perform one rewrite |
708 |
|
// directly after the other, so the rewrite wouldn't be idempotent. |
709 |
133835 |
bool changed = false; |
710 |
|
bool incLeft, incRight; |
711 |
|
|
712 |
642095 |
while (iLeft != iLeftEnd || iRight != iRightEnd) |
713 |
|
{ |
714 |
254130 |
incLeft = incRight = false; |
715 |
254130 |
if (iLeft != iLeftEnd && (iRight == iRightEnd || termLeft < termRight)) |
716 |
|
{ |
717 |
176735 |
addToChildren(termLeft, size, coeffLeft, childrenLeft); |
718 |
176735 |
incLeft = true; |
719 |
|
} |
720 |
77395 |
else if (iLeft == iLeftEnd || termRight < termLeft) |
721 |
|
{ |
722 |
76025 |
Assert(iRight != iRightEnd); |
723 |
76025 |
addToChildren(termRight, size, coeffRight, childrenRight); |
724 |
76025 |
incRight = true; |
725 |
|
} |
726 |
|
else |
727 |
|
{ |
728 |
1370 |
if (coeffLeft > coeffRight) |
729 |
|
{ |
730 |
62 |
addToChildren(termLeft, size, coeffLeft - coeffRight, childrenLeft); |
731 |
|
} |
732 |
1308 |
else if (coeffRight > coeffLeft) |
733 |
|
{ |
734 |
|
addToChildren(termRight, size, coeffRight - coeffLeft, childrenRight); |
735 |
|
} |
736 |
1370 |
incLeft = incRight = true; |
737 |
1370 |
changed = true; |
738 |
|
} |
739 |
254130 |
if (incLeft) |
740 |
|
{ |
741 |
178105 |
++iLeft; |
742 |
178105 |
if (iLeft != iLeftEnd) |
743 |
|
{ |
744 |
47008 |
Assert(termLeft < iLeft->first); |
745 |
47008 |
coeffLeft = iLeft->second; |
746 |
47008 |
termLeft = iLeft->first; |
747 |
|
} |
748 |
|
} |
749 |
254130 |
if (incRight) |
750 |
|
{ |
751 |
77395 |
++iRight; |
752 |
77395 |
if (iRight != iRightEnd) |
753 |
|
{ |
754 |
1997 |
Assert(termRight < iRight->first); |
755 |
1997 |
coeffRight = iRight->second; |
756 |
1997 |
termRight = iRight->first; |
757 |
|
} |
758 |
|
} |
759 |
|
} |
760 |
|
|
761 |
|
// construct result |
762 |
|
|
763 |
|
// If both constants are nonzero, combine on right, otherwise leave them where |
764 |
|
// they are |
765 |
133835 |
if (rightConst != zero) |
766 |
|
{ |
767 |
46559 |
changed |= (leftConst != zero); |
768 |
46559 |
rightConst = rightConst - leftConst; |
769 |
46559 |
leftConst = zero; |
770 |
46559 |
if (rightConst != zero) |
771 |
|
{ |
772 |
46010 |
childrenRight.push_back(utils::mkConst(rightConst)); |
773 |
|
} |
774 |
|
} |
775 |
87276 |
else if (leftConst != zero) |
776 |
|
{ |
777 |
6930 |
childrenLeft.push_back(utils::mkConst(leftConst)); |
778 |
|
} |
779 |
|
|
780 |
267670 |
Node newLeft, newRight; |
781 |
|
|
782 |
133835 |
if (childrenRight.size() == 0 && leftConst != zero) |
783 |
|
{ |
784 |
570 |
Assert(childrenLeft.back().isConst() |
785 |
|
&& childrenLeft.back().getConst<BitVector>() == leftConst); |
786 |
570 |
if (childrenLeft.size() == 1) |
787 |
|
{ |
788 |
|
// c = 0 ==> false |
789 |
132 |
return utils::mkFalse(); |
790 |
|
} |
791 |
|
// special case - if right is empty and left has a constant, move the |
792 |
|
// constant |
793 |
438 |
childrenRight.push_back(utils::mkConst(-leftConst)); |
794 |
438 |
childrenLeft.pop_back(); |
795 |
438 |
changed = true; |
796 |
|
} |
797 |
|
|
798 |
133703 |
if (childrenLeft.size() == 0) |
799 |
|
{ |
800 |
2013 |
if (rightConst != zero) |
801 |
|
{ |
802 |
1513 |
Assert(childrenRight.back().isConst() |
803 |
|
&& childrenRight.back().getConst<BitVector>() == rightConst); |
804 |
1513 |
if (childrenRight.size() == 1) |
805 |
|
{ |
806 |
|
// 0 = c ==> false |
807 |
1128 |
return utils::mkFalse(); |
808 |
|
} |
809 |
|
// special case - if left is empty and right has a constant, move the |
810 |
|
// constant |
811 |
385 |
newLeft = utils::mkConst(-rightConst); |
812 |
385 |
childrenRight.pop_back(); |
813 |
385 |
changed = true; |
814 |
|
} |
815 |
|
else |
816 |
|
{ |
817 |
500 |
newLeft = utils::mkConst(size, (unsigned)0); |
818 |
|
} |
819 |
|
} |
820 |
|
else |
821 |
|
{ |
822 |
131690 |
newLeft = utils::mkNaryNode(kind::BITVECTOR_ADD, childrenLeft); |
823 |
|
} |
824 |
|
|
825 |
132575 |
if (childrenRight.size() == 0) |
826 |
|
{ |
827 |
17686 |
newRight = utils::mkConst(size, (unsigned)0); |
828 |
|
} |
829 |
|
else |
830 |
|
{ |
831 |
114889 |
newRight = utils::mkNaryNode(kind::BITVECTOR_ADD, childrenRight); |
832 |
|
} |
833 |
|
|
834 |
132575 |
if (!changed) |
835 |
|
{ |
836 |
130370 |
return node; |
837 |
|
} |
838 |
|
|
839 |
2205 |
if (newLeft == newRight) |
840 |
|
{ |
841 |
14 |
Assert(newLeft == utils::mkConst(size, (unsigned)0)); |
842 |
14 |
return utils::mkTrue(); |
843 |
|
} |
844 |
|
|
845 |
2191 |
if (newLeft < newRight) |
846 |
|
{ |
847 |
851 |
Assert((newRight == left && newLeft == right) |
848 |
|
|| Rewriter::rewrite(newRight) != left |
849 |
|
|| Rewriter::rewrite(newLeft) != right); |
850 |
851 |
return newRight.eqNode(newLeft); |
851 |
|
} |
852 |
|
|
853 |
1340 |
Assert((newLeft == left && newRight == right) |
854 |
|
|| Rewriter::rewrite(newLeft) != left |
855 |
|
|| Rewriter::rewrite(newRight) != right); |
856 |
1340 |
return newLeft.eqNode(newRight); |
857 |
|
} |
858 |
|
|
859 |
|
template<> inline |
860 |
|
bool RewriteRule<BitwiseEq>::applies(TNode node) { |
861 |
|
if (node.getKind() != kind::EQUAL || |
862 |
|
utils::getSize(node[0]) != 1) { |
863 |
|
return false; |
864 |
|
} |
865 |
|
TNode term; |
866 |
|
BitVector c; |
867 |
|
if (node[0].getKind() == kind::CONST_BITVECTOR) { |
868 |
|
c = node[0].getConst<BitVector>(); |
869 |
|
term = node[1]; |
870 |
|
} |
871 |
|
else if (node[1].getKind() == kind::CONST_BITVECTOR) { |
872 |
|
c = node[1].getConst<BitVector>(); |
873 |
|
term = node[0]; |
874 |
|
} |
875 |
|
else { |
876 |
|
return false; |
877 |
|
} |
878 |
|
switch (term.getKind()) { |
879 |
|
case kind::BITVECTOR_AND: |
880 |
|
case kind::BITVECTOR_OR: |
881 |
|
//operator BITVECTOR_XOR 2: "bitwise xor" |
882 |
|
case kind::BITVECTOR_NOT: |
883 |
|
case kind::BITVECTOR_NAND: |
884 |
|
case kind::BITVECTOR_NOR: |
885 |
|
//operator BITVECTOR_XNOR 2 "bitwise xnor" |
886 |
|
case kind::BITVECTOR_COMP: |
887 |
|
case kind::BITVECTOR_NEG: |
888 |
|
return true; |
889 |
|
break; |
890 |
|
default: |
891 |
|
break; |
892 |
|
} |
893 |
|
return false; |
894 |
|
} |
895 |
|
|
896 |
|
|
897 |
|
static inline Node mkNodeKind(Kind k, TNode node, TNode c) { |
898 |
|
unsigned i = 0; |
899 |
|
unsigned nc = node.getNumChildren(); |
900 |
|
NodeBuilder nb(k); |
901 |
|
for(; i < nc; ++i) { |
902 |
|
nb << node[i].eqNode(c); |
903 |
|
} |
904 |
|
return nb; |
905 |
|
} |
906 |
|
|
907 |
|
|
908 |
|
template<> inline |
909 |
|
Node RewriteRule<BitwiseEq>::apply(TNode node) { |
910 |
|
Debug("bv-rewrite") << "RewriteRule<BitwiseEq>(" << node << ")" << std::endl; |
911 |
|
|
912 |
|
TNode term; |
913 |
|
BitVector c; |
914 |
|
|
915 |
|
if (node[0].getKind() == kind::CONST_BITVECTOR) { |
916 |
|
c = node[0].getConst<BitVector>(); |
917 |
|
term = node[1]; |
918 |
|
} |
919 |
|
else if (node[1].getKind() == kind::CONST_BITVECTOR) { |
920 |
|
c = node[1].getConst<BitVector>(); |
921 |
|
term = node[0]; |
922 |
|
} |
923 |
|
|
924 |
|
bool eqOne = (c == BitVector(1,(unsigned)1)); |
925 |
|
|
926 |
|
switch (term.getKind()) { |
927 |
|
case kind::BITVECTOR_AND: |
928 |
|
if (eqOne) { |
929 |
|
return mkNodeKind(kind::AND, term, utils::mkConst(1, (unsigned)1)); |
930 |
|
} |
931 |
|
else { |
932 |
|
return mkNodeKind(kind::OR, term, utils::mkConst(1, (unsigned)0)); |
933 |
|
} |
934 |
|
break; |
935 |
|
case kind::BITVECTOR_NAND: |
936 |
|
if (eqOne) { |
937 |
|
return mkNodeKind(kind::OR, term, utils::mkConst(1, (unsigned)0)); |
938 |
|
} |
939 |
|
else { |
940 |
|
return mkNodeKind(kind::AND, term, utils::mkConst(1, (unsigned)1)); |
941 |
|
} |
942 |
|
break; |
943 |
|
case kind::BITVECTOR_OR: |
944 |
|
if (eqOne) { |
945 |
|
return mkNodeKind(kind::OR, term, utils::mkConst(1, (unsigned)1)); |
946 |
|
} |
947 |
|
else { |
948 |
|
return mkNodeKind(kind::AND, term, utils::mkConst(1, (unsigned)0)); |
949 |
|
} |
950 |
|
break; |
951 |
|
case kind::BITVECTOR_NOR: |
952 |
|
if (eqOne) { |
953 |
|
return mkNodeKind(kind::AND, term, utils::mkConst(1, (unsigned)0)); |
954 |
|
} |
955 |
|
else { |
956 |
|
return mkNodeKind(kind::OR, term, utils::mkConst(1, (unsigned)1)); |
957 |
|
} |
958 |
|
break; |
959 |
|
case kind::BITVECTOR_NOT: |
960 |
|
return term[0].eqNode(utils::mkConst(~c)); |
961 |
|
case kind::BITVECTOR_COMP: |
962 |
|
Assert(term.getNumChildren() == 2); |
963 |
|
if (eqOne) { |
964 |
|
return term[0].eqNode(term[1]); |
965 |
|
} |
966 |
|
else { |
967 |
|
return term[0].eqNode(term[1]).notNode(); |
968 |
|
} |
969 |
|
case kind::BITVECTOR_NEG: |
970 |
|
return term[0].eqNode(utils::mkConst(c)); |
971 |
|
default: |
972 |
|
break; |
973 |
|
} |
974 |
|
Unreachable(); |
975 |
|
} |
976 |
|
|
977 |
|
|
978 |
|
/** |
979 |
|
* -(c * expr) ==> (-c * expr) |
980 |
|
* where c is a constant |
981 |
|
*/ |
982 |
|
template<> inline |
983 |
17330 |
bool RewriteRule<NegMult>::applies(TNode node) { |
984 |
69320 |
if(node.getKind()!= kind::BITVECTOR_NEG || |
985 |
51990 |
node[0].getKind() != kind::BITVECTOR_MULT) { |
986 |
16258 |
return false; |
987 |
|
} |
988 |
1072 |
return node[node.getNumChildren()-1].isConst(); |
989 |
|
} |
990 |
|
|
991 |
|
template<> inline |
992 |
|
Node RewriteRule<NegMult>::apply(TNode node) { |
993 |
|
Debug("bv-rewrite") << "RewriteRule<NegMult>(" << node << ")" << std::endl; |
994 |
|
TNode mult = node[0]; |
995 |
|
NodeBuilder nb(kind::BITVECTOR_MULT); |
996 |
|
BitVector bv(utils::getSize(node), (unsigned)1); |
997 |
|
TNode::iterator child_it = mult.begin(); |
998 |
|
for(; (child_it+1) != mult.end(); ++child_it) { |
999 |
|
nb << (*child_it); |
1000 |
|
} |
1001 |
|
Assert((*child_it).isConst()); |
1002 |
|
bv = (*child_it).getConst<BitVector>(); |
1003 |
|
nb << utils::mkConst(-bv); |
1004 |
|
return Node(nb); |
1005 |
|
} |
1006 |
|
|
1007 |
|
template<> inline |
1008 |
33329 |
bool RewriteRule<NegSub>::applies(TNode node) { |
1009 |
84595 |
return (node.getKind() == kind::BITVECTOR_NEG && |
1010 |
84595 |
node[0].getKind() == kind::BITVECTOR_SUB); |
1011 |
|
} |
1012 |
|
|
1013 |
|
template <> |
1014 |
207 |
inline Node RewriteRule<NegSub>::apply(TNode node) |
1015 |
|
{ |
1016 |
207 |
Debug("bv-rewrite") << "RewriteRule<NegSub>(" << node << ")" << std::endl; |
1017 |
|
return NodeManager::currentNM()->mkNode( |
1018 |
207 |
kind::BITVECTOR_SUB, node[0][1], node[0][0]); |
1019 |
|
} |
1020 |
|
|
1021 |
|
template <> |
1022 |
34372 |
inline bool RewriteRule<NegAdd>::applies(TNode node) |
1023 |
|
{ |
1024 |
34372 |
return (node.getKind() == kind::BITVECTOR_NEG |
1025 |
68744 |
&& node[0].getKind() == kind::BITVECTOR_ADD); |
1026 |
|
} |
1027 |
|
|
1028 |
|
template <> |
1029 |
1250 |
inline Node RewriteRule<NegAdd>::apply(TNode node) |
1030 |
|
{ |
1031 |
1250 |
Debug("bv-rewrite") << "RewriteRule<NegAdd>(" << node << ")" << std::endl; |
1032 |
1250 |
NodeManager *nm = NodeManager::currentNM(); |
1033 |
2500 |
std::vector<Node> children; |
1034 |
3758 |
for (unsigned i = 0; i < node[0].getNumChildren(); ++i) |
1035 |
|
{ |
1036 |
2508 |
children.push_back(nm->mkNode(kind::BITVECTOR_NEG, node[0][i])); |
1037 |
|
} |
1038 |
2500 |
return utils::mkNaryNode(kind::BITVECTOR_ADD, children); |
1039 |
|
} |
1040 |
|
|
1041 |
|
struct Count { |
1042 |
|
unsigned pos; |
1043 |
|
unsigned neg; |
1044 |
839365 |
Count() : pos(0), neg(0) {} |
1045 |
839365 |
Count(unsigned p, unsigned n): |
1046 |
|
pos(p), |
1047 |
839365 |
neg(n) |
1048 |
839365 |
{} |
1049 |
|
}; |
1050 |
|
|
1051 |
840133 |
inline static void insert(std::unordered_map<TNode, Count>& map, |
1052 |
|
TNode node, |
1053 |
|
bool neg) |
1054 |
|
{ |
1055 |
840133 |
if(map.find(node) == map.end()) { |
1056 |
839365 |
Count c = neg? Count(0,1) : Count(1, 0); |
1057 |
839365 |
map[node] = c; |
1058 |
|
} else { |
1059 |
768 |
if (neg) { |
1060 |
257 |
++(map[node].neg); |
1061 |
|
} else { |
1062 |
511 |
++(map[node].pos); |
1063 |
|
} |
1064 |
|
} |
1065 |
840133 |
} |
1066 |
|
|
1067 |
|
template<> inline |
1068 |
238768 |
bool RewriteRule<AndSimplify>::applies(TNode node) { |
1069 |
238768 |
return (node.getKind() == kind::BITVECTOR_AND); |
1070 |
|
} |
1071 |
|
|
1072 |
|
template <> |
1073 |
119384 |
inline Node RewriteRule<AndSimplify>::apply(TNode node) |
1074 |
|
{ |
1075 |
238768 |
Debug("bv-rewrite") << "RewriteRule<AndSimplify>(" << node << ")" |
1076 |
119384 |
<< std::endl; |
1077 |
|
|
1078 |
119384 |
NodeManager *nm = NodeManager::currentNM(); |
1079 |
|
// this will remove duplicates |
1080 |
238768 |
std::unordered_map<TNode, Count> subterms; |
1081 |
119384 |
unsigned size = utils::getSize(node); |
1082 |
238768 |
BitVector constant = BitVector::mkOnes(size); |
1083 |
384109 |
for (unsigned i = 0; i < node.getNumChildren(); ++i) |
1084 |
|
{ |
1085 |
529450 |
TNode current = node[i]; |
1086 |
|
// simplify constants |
1087 |
264725 |
if (current.getKind() == kind::CONST_BITVECTOR) |
1088 |
|
{ |
1089 |
190040 |
BitVector bv = current.getConst<BitVector>(); |
1090 |
95020 |
constant = constant & bv; |
1091 |
|
} |
1092 |
|
else |
1093 |
|
{ |
1094 |
169705 |
if (current.getKind() == kind::BITVECTOR_NOT) |
1095 |
|
{ |
1096 |
55214 |
insert(subterms, current[0], true); |
1097 |
|
} |
1098 |
|
else |
1099 |
|
{ |
1100 |
114491 |
insert(subterms, current, false); |
1101 |
|
} |
1102 |
|
} |
1103 |
|
} |
1104 |
|
|
1105 |
238768 |
std::vector<Node> children; |
1106 |
|
|
1107 |
119384 |
if (constant == BitVector(size, (unsigned)0)) |
1108 |
|
{ |
1109 |
28488 |
return utils::mkZero(size); |
1110 |
|
} |
1111 |
|
|
1112 |
90896 |
if (constant != BitVector::mkOnes(size)) |
1113 |
|
{ |
1114 |
31826 |
children.push_back(utils::mkConst(constant)); |
1115 |
|
} |
1116 |
|
|
1117 |
90896 |
std::unordered_map<TNode, Count>::const_iterator it = subterms.begin(); |
1118 |
|
|
1119 |
407604 |
for (; it != subterms.end(); ++it) |
1120 |
|
{ |
1121 |
158440 |
if (it->second.pos > 0 && it->second.neg > 0) |
1122 |
|
{ |
1123 |
|
// if we have a and ~a |
1124 |
86 |
return utils::mkZero(size); |
1125 |
|
} |
1126 |
|
else |
1127 |
|
{ |
1128 |
|
// idempotence |
1129 |
158354 |
if (it->second.neg > 0) |
1130 |
|
{ |
1131 |
|
// if it only occured negated |
1132 |
50613 |
children.push_back(nm->mkNode(kind::BITVECTOR_NOT, it->first)); |
1133 |
|
} |
1134 |
|
else |
1135 |
|
{ |
1136 |
|
// if it only occured positive |
1137 |
107741 |
children.push_back(it->first); |
1138 |
|
} |
1139 |
|
} |
1140 |
|
} |
1141 |
90810 |
if (children.size() == 0) |
1142 |
|
{ |
1143 |
231 |
return utils::mkOnes(size); |
1144 |
|
} |
1145 |
|
|
1146 |
90579 |
return utils::mkSortedNode(kind::BITVECTOR_AND, children); |
1147 |
|
} |
1148 |
|
|
1149 |
|
template<> inline |
1150 |
292112 |
bool RewriteRule<FlattenAssocCommutNoDuplicates>::applies(TNode node) { |
1151 |
292112 |
Kind kind = node.getKind(); |
1152 |
292112 |
if (kind != kind::BITVECTOR_OR && |
1153 |
|
kind != kind::BITVECTOR_AND) |
1154 |
|
return false; |
1155 |
292112 |
TNode::iterator child_it = node.begin(); |
1156 |
2123890 |
for(; child_it != node.end(); ++child_it) { |
1157 |
952745 |
if ((*child_it).getKind() == kind) { |
1158 |
36856 |
return true; |
1159 |
|
} |
1160 |
|
} |
1161 |
255256 |
return false; |
1162 |
|
} |
1163 |
|
|
1164 |
|
template<> inline |
1165 |
18428 |
Node RewriteRule<FlattenAssocCommutNoDuplicates>::apply(TNode node) { |
1166 |
18428 |
Debug("bv-rewrite") << "RewriteRule<FlattenAssocCommut>(" << node << ")" << std::endl; |
1167 |
36856 |
std::vector<Node> processingStack; |
1168 |
18428 |
processingStack.push_back(node); |
1169 |
36856 |
std::unordered_set<TNode> processed; |
1170 |
36856 |
std::vector<Node> children; |
1171 |
18428 |
Kind kind = node.getKind(); |
1172 |
|
|
1173 |
459178 |
while (! processingStack.empty()) { |
1174 |
439583 |
TNode current = processingStack.back(); |
1175 |
220375 |
processingStack.pop_back(); |
1176 |
220375 |
if (processed.count(current)) |
1177 |
1167 |
continue; |
1178 |
|
|
1179 |
219208 |
processed.insert(current); |
1180 |
|
|
1181 |
|
// flatten expression |
1182 |
219208 |
if (current.getKind() == kind) { |
1183 |
242980 |
for (unsigned i = 0; i < current.getNumChildren(); ++i) { |
1184 |
201947 |
processingStack.push_back(current[i]); |
1185 |
|
} |
1186 |
|
} else { |
1187 |
178175 |
children.push_back(current); |
1188 |
|
} |
1189 |
|
} |
1190 |
36856 |
return utils::mkSortedNode(kind, children); |
1191 |
|
} |
1192 |
|
|
1193 |
|
|
1194 |
|
template<> inline |
1195 |
308592 |
bool RewriteRule<OrSimplify>::applies(TNode node) { |
1196 |
308592 |
return (node.getKind() == kind::BITVECTOR_OR); |
1197 |
|
} |
1198 |
|
|
1199 |
|
template <> |
1200 |
154292 |
inline Node RewriteRule<OrSimplify>::apply(TNode node) |
1201 |
|
{ |
1202 |
154292 |
Debug("bv-rewrite") << "RewriteRule<OrSimplify>(" << node << ")" << std::endl; |
1203 |
|
|
1204 |
154292 |
NodeManager *nm = NodeManager::currentNM(); |
1205 |
|
// this will remove duplicates |
1206 |
308584 |
std::unordered_map<TNode, Count> subterms; |
1207 |
154292 |
unsigned size = utils::getSize(node); |
1208 |
308584 |
BitVector constant(size, (unsigned)0); |
1209 |
|
|
1210 |
965697 |
for (unsigned i = 0; i < node.getNumChildren(); ++i) |
1211 |
|
{ |
1212 |
1622810 |
TNode current = node[i]; |
1213 |
|
// simplify constants |
1214 |
811405 |
if (current.getKind() == kind::CONST_BITVECTOR) |
1215 |
|
{ |
1216 |
313838 |
BitVector bv = current.getConst<BitVector>(); |
1217 |
156919 |
constant = constant | bv; |
1218 |
|
} |
1219 |
|
else |
1220 |
|
{ |
1221 |
654486 |
if (current.getKind() == kind::BITVECTOR_NOT) |
1222 |
|
{ |
1223 |
22729 |
insert(subterms, current[0], true); |
1224 |
|
} |
1225 |
|
else |
1226 |
|
{ |
1227 |
631757 |
insert(subterms, current, false); |
1228 |
|
} |
1229 |
|
} |
1230 |
|
} |
1231 |
|
|
1232 |
308584 |
std::vector<Node> children; |
1233 |
|
|
1234 |
154292 |
if (constant == BitVector::mkOnes(size)) |
1235 |
|
{ |
1236 |
8116 |
return utils::mkOnes(size); |
1237 |
|
} |
1238 |
|
|
1239 |
146176 |
if (constant != BitVector(size, (unsigned)0)) |
1240 |
|
{ |
1241 |
65311 |
children.push_back(utils::mkConst(constant)); |
1242 |
|
} |
1243 |
|
|
1244 |
146176 |
std::unordered_map<TNode, Count>::const_iterator it = subterms.begin(); |
1245 |
|
|
1246 |
1447814 |
for (; it != subterms.end(); ++it) |
1247 |
|
{ |
1248 |
650957 |
if (it->second.pos > 0 && it->second.neg > 0) |
1249 |
|
{ |
1250 |
|
// if we have a or ~a |
1251 |
138 |
return utils::mkOnes(size); |
1252 |
|
} |
1253 |
|
else |
1254 |
|
{ |
1255 |
|
// idempotence |
1256 |
650819 |
if (it->second.neg > 0) |
1257 |
|
{ |
1258 |
|
// if it only occured negated |
1259 |
22376 |
children.push_back(nm->mkNode(kind::BITVECTOR_NOT, it->first)); |
1260 |
|
} |
1261 |
|
else |
1262 |
|
{ |
1263 |
|
// if it only occured positive |
1264 |
628443 |
children.push_back(it->first); |
1265 |
|
} |
1266 |
|
} |
1267 |
|
} |
1268 |
|
|
1269 |
146038 |
if (children.size() == 0) |
1270 |
|
{ |
1271 |
1075 |
return utils::mkZero(size); |
1272 |
|
} |
1273 |
144963 |
return utils::mkSortedNode(kind::BITVECTOR_OR, children); |
1274 |
|
} |
1275 |
|
|
1276 |
|
template<> inline |
1277 |
18226 |
bool RewriteRule<XorSimplify>::applies(TNode node) { |
1278 |
18226 |
return (node.getKind() == kind::BITVECTOR_XOR); |
1279 |
|
} |
1280 |
|
|
1281 |
|
template <> |
1282 |
9113 |
inline Node RewriteRule<XorSimplify>::apply(TNode node) |
1283 |
|
{ |
1284 |
18226 |
Debug("bv-rewrite") << "RewriteRule<XorSimplify>(" << node << ")" |
1285 |
9113 |
<< std::endl; |
1286 |
|
|
1287 |
9113 |
NodeManager *nm = NodeManager::currentNM(); |
1288 |
18226 |
std::unordered_map<TNode, Count> subterms; |
1289 |
9113 |
unsigned size = utils::getSize(node); |
1290 |
18226 |
BitVector constant; |
1291 |
9113 |
bool const_set = false; |
1292 |
|
|
1293 |
27519 |
for (unsigned i = 0; i < node.getNumChildren(); ++i) |
1294 |
|
{ |
1295 |
36812 |
TNode current = node[i]; |
1296 |
|
// simplify constants |
1297 |
18406 |
if (current.getKind() == kind::CONST_BITVECTOR) |
1298 |
|
{ |
1299 |
4928 |
BitVector bv = current.getConst<BitVector>(); |
1300 |
2464 |
if (const_set) |
1301 |
|
{ |
1302 |
465 |
constant = constant ^ bv; |
1303 |
|
} |
1304 |
|
else |
1305 |
|
{ |
1306 |
1999 |
const_set = true; |
1307 |
1999 |
constant = bv; |
1308 |
|
} |
1309 |
|
} |
1310 |
|
else |
1311 |
|
{ |
1312 |
|
// collect number of occurances of each term and its negation |
1313 |
15942 |
if (current.getKind() == kind::BITVECTOR_NOT) |
1314 |
|
{ |
1315 |
916 |
insert(subterms, current[0], true); |
1316 |
|
} |
1317 |
|
else |
1318 |
|
{ |
1319 |
15026 |
insert(subterms, current, false); |
1320 |
|
} |
1321 |
|
} |
1322 |
|
} |
1323 |
|
|
1324 |
18226 |
std::vector<Node> children; |
1325 |
|
|
1326 |
9113 |
std::unordered_map<TNode, Count>::const_iterator it = subterms.begin(); |
1327 |
9113 |
unsigned true_count = 0; |
1328 |
9113 |
bool seen_false = false; |
1329 |
40845 |
for (; it != subterms.end(); ++it) |
1330 |
|
{ |
1331 |
15866 |
unsigned pos = it->second.pos; // number of positive occurances |
1332 |
15866 |
unsigned neg = it->second.neg; // number of negated occurances |
1333 |
|
|
1334 |
|
// remove duplicates using the following rules |
1335 |
|
// a xor a ==> false |
1336 |
|
// false xor false ==> false |
1337 |
15866 |
seen_false = seen_false ? seen_false : (pos > 1 || neg > 1); |
1338 |
|
// check what did not reduce |
1339 |
15866 |
if (pos % 2 && neg % 2) |
1340 |
|
{ |
1341 |
|
// we have a xor ~a ==> true |
1342 |
5 |
++true_count; |
1343 |
|
} |
1344 |
15861 |
else if (pos % 2) |
1345 |
|
{ |
1346 |
|
// we had a positive occurence left |
1347 |
14879 |
children.push_back(it->first); |
1348 |
|
} |
1349 |
982 |
else if (neg % 2) |
1350 |
|
{ |
1351 |
|
// we had a negative occurence left |
1352 |
911 |
children.push_back(nm->mkNode(kind::BITVECTOR_NOT, it->first)); |
1353 |
|
} |
1354 |
|
// otherwise both reduced to false |
1355 |
|
} |
1356 |
|
|
1357 |
18226 |
std::vector<BitVector> xorConst; |
1358 |
18226 |
BitVector true_bv = BitVector::mkOnes(size); |
1359 |
18226 |
BitVector false_bv(size, (unsigned)0); |
1360 |
|
|
1361 |
9113 |
if (true_count) |
1362 |
|
{ |
1363 |
|
// true xor ... xor true ==> true (odd) |
1364 |
|
// ==> false (even) |
1365 |
5 |
xorConst.push_back(true_count % 2 ? true_bv : false_bv); |
1366 |
|
} |
1367 |
9113 |
if (seen_false) |
1368 |
|
{ |
1369 |
71 |
xorConst.push_back(false_bv); |
1370 |
|
} |
1371 |
9113 |
if (const_set) |
1372 |
|
{ |
1373 |
1999 |
xorConst.push_back(constant); |
1374 |
|
} |
1375 |
|
|
1376 |
9113 |
if (xorConst.size() > 0) |
1377 |
|
{ |
1378 |
4146 |
BitVector result = xorConst[0]; |
1379 |
2075 |
for (unsigned i = 1; i < xorConst.size(); ++i) |
1380 |
|
{ |
1381 |
2 |
result = result ^ xorConst[i]; |
1382 |
|
} |
1383 |
2073 |
children.push_back(utils::mkConst(result)); |
1384 |
|
} |
1385 |
|
|
1386 |
9113 |
Assert(children.size()); |
1387 |
|
|
1388 |
18226 |
return utils::mkSortedNode(kind::BITVECTOR_XOR, children); |
1389 |
|
} |
1390 |
|
|
1391 |
|
/** |
1392 |
|
* BitwiseSlicing |
1393 |
|
* |
1394 |
|
* (a bvand c) ==> (concat (bvand a[i0:j0] c0) ... (bvand a[in:jn] cn)) |
1395 |
|
* where c0,..., cn are maximally continuous substrings of 0 or 1 in the constant c |
1396 |
|
* |
1397 |
|
* Note: this rule assumes AndSimplify has already been called on the node |
1398 |
|
*/ |
1399 |
|
template<> inline |
1400 |
151208 |
bool RewriteRule<BitwiseSlicing>::applies(TNode node) { |
1401 |
421954 |
if ((node.getKind() != kind::BITVECTOR_AND && |
1402 |
193743 |
node.getKind() != kind::BITVECTOR_OR && |
1403 |
553295 |
node.getKind() != kind::BITVECTOR_XOR) || |
1404 |
327882 |
utils::getSize(node) == 1) |
1405 |
112767 |
return false; |
1406 |
|
// find the first constant and return true if it's not only 1..1 or only 0..0 |
1407 |
|
// (there could be more than one constant) |
1408 |
116441 |
for (unsigned i = 0; i < node.getNumChildren(); ++i) { |
1409 |
81037 |
if (node[i].getKind() == kind::CONST_BITVECTOR) { |
1410 |
6074 |
BitVector constant = node[i].getConst<BitVector>(); |
1411 |
|
// we do not apply the rule if the constant is all 0s or all 1s |
1412 |
3037 |
if (constant == BitVector(utils::getSize(node), 0u)) return false; |
1413 |
|
|
1414 |
5924 |
for (unsigned j = 0, csize = constant.getSize(); j < csize; ++j) |
1415 |
|
{ |
1416 |
5819 |
if (!constant.isBitSet(j)) return true; |
1417 |
|
} |
1418 |
105 |
return false; |
1419 |
|
} |
1420 |
|
} |
1421 |
35404 |
return false; |
1422 |
|
} |
1423 |
|
|
1424 |
|
template <> |
1425 |
1466 |
inline Node RewriteRule<BitwiseSlicing>::apply(TNode node) |
1426 |
|
{ |
1427 |
2932 |
Debug("bv-rewrite") << "RewriteRule<BitwiseSlicing>(" << node << ")" |
1428 |
1466 |
<< std::endl; |
1429 |
1466 |
NodeManager *nm = NodeManager::currentNM(); |
1430 |
|
// get the constant |
1431 |
1466 |
bool found_constant = false; |
1432 |
2932 |
TNode constant; |
1433 |
2932 |
std::vector<Node> other_children; |
1434 |
4455 |
for (unsigned i = 0; i < node.getNumChildren(); ++i) |
1435 |
|
{ |
1436 |
2989 |
if (node[i].getKind() == kind::CONST_BITVECTOR && !found_constant) |
1437 |
|
{ |
1438 |
1466 |
constant = node[i]; |
1439 |
1466 |
found_constant = true; |
1440 |
|
} |
1441 |
|
else |
1442 |
|
{ |
1443 |
1523 |
other_children.push_back(node[i]); |
1444 |
|
} |
1445 |
|
} |
1446 |
1466 |
Assert(found_constant && other_children.size() == node.getNumChildren() - 1); |
1447 |
|
|
1448 |
2932 |
Node other = utils::mkNaryNode(node.getKind(), other_children); |
1449 |
|
|
1450 |
2932 |
BitVector bv_constant = constant.getConst<BitVector>(); |
1451 |
2932 |
std::vector<Node> concat_children; |
1452 |
1466 |
int start = bv_constant.getSize() - 1; |
1453 |
1466 |
int end = start; |
1454 |
27633 |
for (int i = end - 1; i >= 0; --i) |
1455 |
|
{ |
1456 |
26167 |
if (bv_constant.isBitSet(i + 1) != bv_constant.isBitSet(i)) |
1457 |
|
{ |
1458 |
5070 |
Node other_extract = utils::mkExtract(other, end, start); |
1459 |
5070 |
Node const_extract = utils::mkExtract(constant, end, start); |
1460 |
|
Node bitwise_op = |
1461 |
5070 |
nm->mkNode(node.getKind(), const_extract, other_extract); |
1462 |
2535 |
concat_children.push_back(bitwise_op); |
1463 |
2535 |
start = end = i; |
1464 |
|
} |
1465 |
|
else |
1466 |
|
{ |
1467 |
23632 |
start--; |
1468 |
|
} |
1469 |
26167 |
if (i == 0) |
1470 |
|
{ |
1471 |
2932 |
Node other_extract = utils::mkExtract(other, end, 0); |
1472 |
2932 |
Node const_extract = utils::mkExtract(constant, end, 0); |
1473 |
|
Node bitwise_op = |
1474 |
2932 |
nm->mkNode(node.getKind(), const_extract, other_extract); |
1475 |
1466 |
concat_children.push_back(bitwise_op); |
1476 |
|
} |
1477 |
|
} |
1478 |
1466 |
Node result = utils::mkConcat(concat_children); |
1479 |
1466 |
Debug("bv-rewrite") << " =>" << result << std::endl; |
1480 |
2932 |
return result; |
1481 |
|
} |
1482 |
|
|
1483 |
|
template <> |
1484 |
|
inline bool RewriteRule<NormalizeEqAddNeg>::applies(TNode node) |
1485 |
|
{ |
1486 |
|
return node.getKind() == kind::EQUAL |
1487 |
|
&& (node[0].getKind() == kind::BITVECTOR_ADD |
1488 |
|
|| node[1].getKind() == kind::BITVECTOR_ADD); |
1489 |
|
} |
1490 |
|
|
1491 |
|
template <> |
1492 |
|
inline Node RewriteRule<NormalizeEqAddNeg>::apply(TNode node) |
1493 |
|
{ |
1494 |
|
Debug("bv-rewrite") << "RewriteRule<NormalizeEqAddNeg>(" << node << ")" |
1495 |
|
<< std::endl; |
1496 |
|
|
1497 |
|
NodeBuilder nb_lhs(kind::BITVECTOR_ADD); |
1498 |
|
NodeBuilder nb_rhs(kind::BITVECTOR_ADD); |
1499 |
|
NodeManager *nm = NodeManager::currentNM(); |
1500 |
|
|
1501 |
|
if (node[0].getKind() == kind::BITVECTOR_ADD) |
1502 |
|
{ |
1503 |
|
for (const TNode &n : node[0]) |
1504 |
|
{ |
1505 |
|
if (n.getKind() == kind::BITVECTOR_NEG) |
1506 |
|
nb_rhs << n[0]; |
1507 |
|
else |
1508 |
|
nb_lhs << n; |
1509 |
|
} |
1510 |
|
} |
1511 |
|
else |
1512 |
|
{ |
1513 |
|
nb_lhs << node[0]; |
1514 |
|
} |
1515 |
|
|
1516 |
|
if (node[1].getKind() == kind::BITVECTOR_ADD) |
1517 |
|
{ |
1518 |
|
for (const TNode &n : node[1]) |
1519 |
|
{ |
1520 |
|
if (n.getKind() == kind::BITVECTOR_NEG) |
1521 |
|
nb_lhs << n[0]; |
1522 |
|
else |
1523 |
|
nb_rhs << n; |
1524 |
|
} |
1525 |
|
} |
1526 |
|
else |
1527 |
|
{ |
1528 |
|
nb_rhs << node[1]; |
1529 |
|
} |
1530 |
|
|
1531 |
|
Node zero = utils::mkZero(utils::getSize(node[0])); |
1532 |
|
|
1533 |
|
Node lhs, rhs; |
1534 |
|
if (nb_lhs.getNumChildren() == 0) |
1535 |
|
{ |
1536 |
|
lhs = zero; |
1537 |
|
} |
1538 |
|
else if (nb_lhs.getNumChildren() == 1) |
1539 |
|
{ |
1540 |
|
lhs = nb_lhs[0]; |
1541 |
|
} |
1542 |
|
else |
1543 |
|
{ |
1544 |
|
lhs = nb_lhs.constructNode(); |
1545 |
|
} |
1546 |
|
if (nb_rhs.getNumChildren() == 0) |
1547 |
|
{ |
1548 |
|
rhs = zero; |
1549 |
|
} |
1550 |
|
else if (nb_rhs.getNumChildren() == 1) |
1551 |
|
{ |
1552 |
|
rhs = nb_rhs[0]; |
1553 |
|
} |
1554 |
|
else |
1555 |
|
{ |
1556 |
|
rhs = nb_rhs.constructNode(); |
1557 |
|
} |
1558 |
|
return nm->mkNode(node.getKind(), lhs, rhs); |
1559 |
|
} |
1560 |
|
|
1561 |
|
// template<> inline |
1562 |
|
// bool RewriteRule<>::applies(TNode node) { |
1563 |
|
// return (node.getKind() == kind::BITVECTOR_CONCAT); |
1564 |
|
// } |
1565 |
|
|
1566 |
|
// template<> inline |
1567 |
|
// Node RewriteRule<>::apply(TNode node) { |
1568 |
|
// Debug("bv-rewrite") << "RewriteRule<>(" << node << ")" << std::endl; |
1569 |
|
// return resultNode; |
1570 |
|
// } |
1571 |
|
|
1572 |
|
|
1573 |
|
|
1574 |
|
} |
1575 |
|
} |
1576 |
|
} // namespace cvc5 |