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
|
/********************* */
/*! \file example_eval_cache.cpp
** \verbatim
** Top contributors (to current version):
** Andrew Reynolds
** This file is part of the CVC4 project.
** Copyright (c) 2009-2020 by the authors listed in the file AUTHORS
** in the top-level source directory) and their institutional affiliations.
** All rights reserved. See the file COPYING in the top-level source
** directory for licensing information.\endverbatim
**
** \brief
**
**/
#include "theory/quantifiers/sygus/example_eval_cache.h"
#include "theory/quantifiers/sygus/example_min_eval.h"
#include "theory/quantifiers/sygus/synth_conjecture.h"
using namespace CVC4;
using namespace CVC4::kind;
namespace CVC4 {
namespace theory {
namespace quantifiers {
ExampleEvalCache::ExampleEvalCache(TermDbSygus* tds,
SynthConjecture* p,
Node f,
Node e)
: d_tds(tds), d_stn(e.getType())
{
ExampleInfer* ei = p->getExampleInfer();
Assert(ei->hasExamples(f));
for (unsigned i = 0, nex = ei->getNumExamples(f); i < nex; i++)
{
std::vector<Node> input;
ei->getExample(f, i, input);
d_examples.push_back(input);
}
d_indexSearchVals = !d_tds->isVariableAgnosticEnumerator(e);
}
ExampleEvalCache::~ExampleEvalCache() {}
Node ExampleEvalCache::addSearchVal(TypeNode tn, Node bv)
{
if (!d_indexSearchVals)
{
// not indexing search values
return Node::null();
}
std::vector<Node> vals;
evaluateVec(bv, vals, true);
Trace("sygus-pbe-debug") << "Add to trie..." << std::endl;
Node ret = d_trie[tn].addOrGetTerm(bv, vals);
Trace("sygus-pbe-debug") << "...got " << ret << std::endl;
// Only save the cache data if necessary: if the enumerated term
// is redundant, its cached data will not be used later and thus should
// be discarded. This applies also to the case where the evaluation
// was cached prior to this call.
if (ret != bv)
{
clearEvaluationCache(bv);
}
Assert(ret.getType().isComparableTo(bv.getType()));
return ret;
}
void ExampleEvalCache::evaluateVec(Node bv,
std::vector<Node>& exOut,
bool doCache)
{
// is it in the cache?
std::map<Node, std::vector<Node>>::iterator it = d_exOutCache.find(bv);
if (it != d_exOutCache.end())
{
exOut.insert(exOut.end(), it->second.begin(), it->second.end());
return;
}
// get the evaluation
evaluateVecInternal(bv, exOut);
// store in cache if necessary
if (doCache)
{
std::vector<Node>& eocv = d_exOutCache[bv];
eocv.insert(eocv.end(), exOut.begin(), exOut.end());
}
}
void ExampleEvalCache::evaluateVecInternal(Node bv,
std::vector<Node>& exOut) const
{
// use ExampleMinEval
SygusTypeInfo& ti = d_tds->getTypeInfo(d_stn);
const std::vector<Node>& varlist = ti.getVarList();
EmeEvalTds emetds(d_tds, d_stn);
ExampleMinEval eme(bv, varlist, &emetds);
for (size_t j = 0, esize = d_examples.size(); j < esize; j++)
{
Node res = eme.evaluate(d_examples[j]);
exOut.push_back(res);
}
}
Node ExampleEvalCache::evaluate(Node bn, unsigned i) const
{
Assert(i < d_examples.size());
return d_tds->evaluateBuiltin(d_stn, bn, d_examples[i]);
}
void ExampleEvalCache::clearEvaluationCache(Node bv)
{
Assert(d_exOutCache.find(bv) != d_exOutCache.end());
d_exOutCache.erase(bv);
}
void ExampleEvalCache::clearEvaluationAll() { d_exOutCache.clear(); }
} // namespace quantifiers
} // namespace theory
} // namespace CVC4
|
