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
|
/******************************************************************************
* Top contributors (to current version):
* Aina Niemetz, Andrew Reynolds, Mathias Preiner
*
* This file is part of the cvc5 project.
*
* Copyright (c) 2009-2021 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.
* ****************************************************************************
*
* The preprocessing pass context for passes.
*/
#include "preprocessing/preprocessing_pass_context.h"
#include "expr/node_algorithm.h"
namespace cvc5 {
namespace preprocessing {
PreprocessingPassContext::PreprocessingPassContext(
SmtEngine* smt,
theory::booleans::CircuitPropagator* circuitPropagator,
ProofNodeManager* pnm)
: d_smt(smt),
d_resourceManager(smt->getResourceManager()),
d_topLevelSubstitutions(smt->getUserContext(), pnm),
d_circuitPropagator(circuitPropagator),
d_pnm(pnm),
d_symsInAssertions(smt->getUserContext())
{
}
theory::TrustSubstitutionMap&
PreprocessingPassContext::getTopLevelSubstitutions()
{
return d_topLevelSubstitutions;
}
void PreprocessingPassContext::recordSymbolsInAssertions(
const std::vector<Node>& assertions)
{
std::unordered_set<TNode, TNodeHashFunction> visited;
std::unordered_set<Node, NodeHashFunction> syms;
for (TNode cn : assertions)
{
expr::getSymbols(cn, syms, visited);
}
for (const Node& s : syms)
{
d_symsInAssertions.insert(s);
}
}
ProofNodeManager* PreprocessingPassContext::getProofNodeManager()
{
return d_pnm;
}
} // namespace preprocessing
} // namespace cvc5
|