1
/* VerifyPN - TAPAAL Petri Net Engine
2
* Copyright (C) 2017 Peter Gjøl Jensen <root@petergjoel.dk>
3
* This program is free software: you can redistribute it and/or modify
4
* it under the terms of the GNU General Public License as published by
5
* the Free Software Foundation, either version 3 of the License, or
6
* (at your option) any later version.
8
* This program is distributed in the hope that it will be useful,
9
* but WITHOUT ANY WARRANTY; without even the implied warranty of
10
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
11
* GNU General Public License for more details.
13
* You should have received a copy of the GNU General Public License
14
* along with this program. If not, see <http://www.gnu.org/licenses/>.
19
#include "QueryBinaryParser.h"
20
#include "PetriEngine/PQL/Expressions.h"
22
bool QueryBinaryParser::parse(std::ifstream& bin, const std::set<size_t>& parse_only) {
25
bin.read(reinterpret_cast<char*>(&numq), sizeof(uint32_t));
26
std::vector<std::string> names;
28
bin.read(reinterpret_cast<char*>(&nnames), sizeof(uint32_t));
30
for(uint32_t i = 0; i < nnames; ++i)
33
bin.read(reinterpret_cast<char*>(&id), sizeof(uint32_t));
34
std::getline(bin, names[id], '\0');
37
bool parsingOK = true;
38
for(uint32_t i = 0; i < numq; ++i)
40
queries.emplace_back();
41
std::getline(bin, queries.back().id, '\0');
42
queries.back().query = parseQuery(bin, names);
43
if(queries.back().query == nullptr)
45
queries.back().parsingResult = QueryItem::UNSUPPORTED_QUERY;
49
queries.back().parsingResult = QueryItem::PARSING_OK;
55
Condition_ptr QueryBinaryParser::parseQuery(std::ifstream& binary, const std::vector<std::string>& names)
58
binary.read(reinterpret_cast<char*>(&p), sizeof(Path));
60
binary.read(reinterpret_cast<char*>(&q), sizeof(Quantifier));
63
if(q == Quantifier::NEG)
65
auto c = parseQuery(binary, names);
71
return std::make_shared<NotCondition>(c);
73
else if(q == Quantifier::DEADLOCK)
75
return DeadlockCondition::DEADLOCK;
77
else if(q == Quantifier::PN_BOOLEAN)
80
binary.read(reinterpret_cast<char*>(&val), sizeof(bool));
81
return BooleanCondition::getShared(val);
83
else if(q == Quantifier::AND || q == Quantifier::OR)
86
binary.read(reinterpret_cast<char*>(&size), sizeof(uint32_t));
87
std::vector<Condition_ptr> conds;
88
for(uint32_t i = 0; i < size; ++i)
90
conds.push_back(parseQuery(binary, names));
91
if(conds.back() == nullptr) return nullptr;
93
if(q == Quantifier::AND)
94
return std::make_shared<AndCondition>(std::move(conds));
96
return std::make_shared<OrCondition>(std::move(conds));
98
else if(q == Quantifier::COMPCONJ)
101
binary.read(reinterpret_cast<char*>(&neg), sizeof(bool));
102
std::vector<CompareConjunction::cons_t> cons;
104
binary.read(reinterpret_cast<char*>(&size), sizeof(uint32_t));
105
for(uint32_t i = 0; i < size; ++i)
108
binary.read(reinterpret_cast<char*>(&cons.back()._place), sizeof(uint32_t));
109
binary.read(reinterpret_cast<char*>(&cons.back()._lower), sizeof(uint32_t));
110
binary.read(reinterpret_cast<char*>(&cons.back()._upper), sizeof(uint32_t));
111
cons.back()._name = names[cons.back()._place];
113
return std::make_shared<CompareConjunction>(std::move(cons), neg);
115
else if(q == Quantifier::EMPTY)
118
std::getline(binary, sop, '\0');
119
auto e1 = parseExpr(binary, names);
120
auto e2 = parseExpr(binary, names);
121
if(e1 == nullptr || e2 == nullptr)
127
return std::make_shared<LessThanCondition>(e1, e2);
129
return std::make_shared<LessThanOrEqualCondition>(e1, e2);
131
return std::make_shared<GreaterThanOrEqualCondition>(e1, e2);
133
return std::make_shared<GreaterThanCondition>(e1, e2);
135
return std::make_shared<EqualCondition>(e1, e2);
137
return std::make_shared<NotEqualCondition>(e1, e2);
144
else if(q == Quantifier::UPPERBOUNDS)
148
binary.read(reinterpret_cast<char*>(&size), sizeof(uint32_t));
149
binary.read(reinterpret_cast<char*>(&max), sizeof(size_t));
150
std::vector<UnfoldedUpperBoundsCondition::place_t> places;
151
for(size_t i = 0; i < size; ++i)
154
binary.read(reinterpret_cast<char*>(&id), sizeof(uint32_t));
155
places.emplace_back(names[id]);
156
places.back()._place = id;
158
return std::make_shared<UnfoldedUpperBoundsCondition>(places, max);
168
Condition_ptr cond1 = parseQuery(binary, names);
170
if(!cond1) return nullptr;
173
if(q == Quantifier::A)
174
return std::make_shared<AXCondition>(cond1);
176
return std::make_shared<EXCondition>(cond1);
178
else if(p == Path::F)
180
if(q == Quantifier::A)
181
return std::make_shared<AFCondition>(cond1);
183
return std::make_shared<EFCondition>(cond1);
185
else if(p == Path::G)
187
if(q == Quantifier::A)
188
return std::make_shared<AGCondition>(cond1);
190
return std::make_shared<EGCondition>(cond1);
192
else if(p == Path::U)
194
auto cond2 = parseQuery(binary, names);
200
if(q == Quantifier::A)
201
return std::make_shared<AUCondition>(cond1, cond2);
203
return std::make_shared<EUCondition>(cond1, cond2);
215
Expr_ptr QueryBinaryParser::parseExpr(std::ifstream& bin, const std::vector<std::string>& names) {
217
bin.read(&t, sizeof(char));
221
bin.read(reinterpret_cast<char*>(&val), sizeof(int));
222
return std::make_shared<LiteralExpr>(val);
227
bin.read(reinterpret_cast<char*>(&offset), sizeof(int));
228
return std::make_shared<UnfoldedIdentifierExpr>(names[offset], offset);
233
bin.read(reinterpret_cast<char*>(&size), sizeof(uint32_t));
234
std::vector<Expr_ptr> exprs;
235
for(uint32_t i = 0; i < size; ++i)
237
exprs.push_back(parseExpr(bin, names));
238
if(exprs.back() == nullptr)
244
return std::make_shared<SubtractExpr>(std::move(exprs));
246
else if(t == '*' || t == '+')
251
bin.read(reinterpret_cast<char*>(&constant), sizeof(int32_t));
252
bin.read(reinterpret_cast<char*>(&idsize), sizeof(uint32_t));
253
bin.read(reinterpret_cast<char*>(&exprssize), sizeof(uint32_t));
254
std::vector<uint32_t> ids(idsize);
255
bin.read(reinterpret_cast<char*>(ids.data()), sizeof(uint32_t)*idsize);
256
std::vector<Expr_ptr> exprs;
257
exprs.push_back(std::make_shared<LiteralExpr>(constant));
260
exprs.push_back(std::make_shared<UnfoldedIdentifierExpr>(names[i], i));
262
for(uint32_t i = 0; i < exprssize; ++i)
264
exprs.push_back(parseExpr(bin, names));
265
if(exprs.back() == nullptr)
272
return std::make_shared<MultiplyExpr>(std::move(exprs));
274
return std::make_shared<PlusExpr>(std::move(exprs));
279
std::cerr << "An error occurred parsing the binary input." << std::endl;
280
std::cerr << t << std::endl;