3 * File: deserializer.cc
6 * Created on September 7, 2017, 6:08 PM
9 #include "deserializer.h"
13 #include "predicate.h"
17 Deserializer::Deserializer(const char* file):
20 filedesc = open(file, O_RDONLY);
27 Deserializer::~Deserializer() {
31 ssize_t Deserializer::myread(void* __buf, size_t __nbytes){
32 return read (filedesc, __buf, __nbytes);
35 CSolver * Deserializer::deserialize(){
37 while(myread(&nodeType, sizeof(ASTNodeType) ) >0){
40 deserializeBooleanEdge();
43 deserializeBooleanVar();
46 deserializeBooleanOrder();
55 deserializeBooleanLogic();
58 deserializeBooleanPredicate();
61 deserializePredicateTable();
64 deserializePredicateOperator();
70 deserializeElementSet();
73 deserializeElementConst();
76 deserializeElementFunction();
79 deserializeFunctionOperator();
82 deserializeFunctionTable();
91 void Deserializer::deserializeBooleanEdge(){
93 myread(&b, sizeof(Boolean*));
95 bool isNegated = tmp.isNegated();
96 ASSERT(map.contains(tmp.getBoolean()));
97 b = (Boolean*) map.get(tmp.getBoolean());
99 solver->addConstraint(isNegated?res.negate():res);
102 void Deserializer::deserializeBooleanVar(){
104 myread(&b, sizeof(BooleanVar*));
106 myread(&vtype, sizeof(VarType));
107 map.put(b, solver->getBooleanVar(vtype).getBoolean());
110 void Deserializer::deserializeBooleanOrder(){
111 BooleanOrder* bo_ptr;
112 myread(&bo_ptr, sizeof(BooleanOrder*));
114 myread(&optr, sizeof(Order*));
116 myread(&first, sizeof(uint64_t));
118 myread(&second, sizeof(uint64_t));
119 ASSERT(map.contains(optr));
120 Order* order = (Order*) map.get(optr);
121 map.put(bo_ptr, solver->orderConstraint(order, first, second).getBoolean());
124 void Deserializer::deserializeOrder(){
126 myread(&o_ptr, sizeof(Order*));
128 myread(&type, sizeof(OrderType));
130 myread(&set_ptr, sizeof(Set *));
131 ASSERT(map.contains(set_ptr));
132 Set* set = (Set*) map.get(set_ptr);
133 map.put(o_ptr, solver->createOrder(type, set));
136 void Deserializer::deserializeSet(){
138 myread(&s_ptr, sizeof(Set*));
140 myread(&type, sizeof(VarType));
142 myread(&isRange, sizeof(bool));
144 myread(&low, sizeof(uint64_t));
146 myread(&high, sizeof(uint64_t));
148 myread(&size, sizeof(uint));
149 Vector<uint64_t> members;
150 for(uint i=0; i<size; i++){
152 myread(&mem, sizeof(uint64_t));
155 Set *set = isRange? solver->createRangeSet(type, low, high):
156 solver->createSet(type, members.expose(), size);
160 void Deserializer::deserializeBooleanLogic(){
161 BooleanLogic *bl_ptr;
162 myread(&bl_ptr, sizeof(BooleanLogic *));
164 myread(&op, sizeof(LogicOp));
166 myread(&size, sizeof(uint));
167 Vector<BooleanEdge> members;
168 for(uint i=0; i<size; i++){
171 map.put(bl_ptr, solver->applyLogicalOperation(op, members.expose(), size).getBoolean());
174 void Deserializer::deserializeBooleanPredicate(){
175 BooleanPredicate *bp_ptr;
176 myread(&bp_ptr, sizeof(BooleanPredicate *));
177 Predicate* predicate;
178 myread(&predicate, sizeof(Predicate*));
179 ASSERT(map.contains(predicate));
180 predicate = (Predicate*) map.get(predicate);
182 myread(&size, sizeof(uint));
183 Vector<Element*> members;
184 for(uint i=0; i<size; i++){
186 myread(&input, sizeof(Element *));
187 ASSERT(map.contains(input));
188 input = (Element*) map.get(input);
193 myread(&stat_ptr, sizeof(Boolean *));
194 BooleanEdge tmp(stat_ptr);
195 bool isNegated = tmp.isNegated();
196 ASSERT(map.contains(tmp.getBoolean()));
197 stat_ptr = (Boolean*) map.get(tmp.getBoolean());
198 BooleanEdge res(stat_ptr);
199 BooleanEdge undefStatus = isNegated?res.negate():res;
201 map.put(bp_ptr, solver->applyPredicateTable(predicate, members.expose(), size, undefStatus).getBoolean());
204 void Deserializer::deserializePredicateTable(){
205 PredicateTable *pt_ptr;
206 myread(&pt_ptr, sizeof(PredicateTable *));
208 myread(&table, sizeof(Table*));
209 ASSERT(map.contains(table));
210 table = (Table*) map.get(table);
211 UndefinedBehavior undefinedbehavior;
212 myread(&undefinedbehavior, sizeof(UndefinedBehavior));
214 map.put(pt_ptr, solver->createPredicateTable(table, undefinedbehavior));
217 void Deserializer::deserializePredicateOperator(){
218 PredicateOperator *po_ptr;
219 myread(&po_ptr, sizeof(PredicateOperator *));
221 myread(&op, sizeof(CompOp));
223 myread(&size, sizeof(uint));
224 Vector<Set*> domains;
225 for(uint i=0; i<size; i++){
227 myread(&domain, sizeof(Set*));
228 ASSERT(map.contains(domain));
229 domain = (Set*) map.get(domain);
230 domains.push(domain);
233 map.put(po_ptr, solver->createPredicateOperator(op, domains.expose(), size));
236 void Deserializer::deserializeTable(){
238 myread(&t_ptr, sizeof(Table *));
240 myread(&size, sizeof(uint));
241 Vector<Set*> domains;
242 for(uint i=0; i<size; i++){
244 myread(&domain, sizeof(Set*));
245 ASSERT(map.contains(domain));
246 domain = (Set*) map.get(domain);
247 domains.push(domain);
250 myread(&range, sizeof(Set*));
251 ASSERT(map.contains(range));
252 range = (Set*) map.get(range);
253 Table* table = solver->createTable(domains.expose(), size, range);
254 myread(&size, sizeof(uint));
255 for(uint i=0; i<size; i++){
257 myread(&output, sizeof(uint64_t));
259 myread(&inputSize, sizeof(uint));
260 Vector<uint64_t> inputs;
261 inputs.setSize(inputSize);
262 myread(inputs.expose(), sizeof(uint64_t)*inputSize);
264 table->addNewTableEntry(inputs.expose(), inputSize, output);
267 map.put(t_ptr, table);
271 void Deserializer::deserializeElementSet(){
273 myread(&es_ptr, sizeof(ElementSet*));
275 myread(&set, sizeof(Set *));
276 ASSERT(map.contains(set));
277 set = (Set*) map.get(set);
278 map.put(es_ptr, solver->getElementVar(set));
281 void Deserializer::deserializeElementConst(){
283 myread(&es_ptr, sizeof(ElementSet*));
285 myread(&type, sizeof(VarType));
287 myread(&value, sizeof(uint64_t));
288 map.put(es_ptr, solver->getElementConst(type, value));
291 void Deserializer::deserializeElementFunction(){
292 ElementFunction *ef_ptr;
293 myread(&ef_ptr, sizeof(ElementFunction *));
295 myread(&function, sizeof(Function*));
296 ASSERT(map.contains(function));
297 function = (Function*) map.get(function);
299 myread(&size, sizeof(uint));
300 Vector<Element*> members;
301 for(uint i=0; i<size; i++){
303 myread(&input, sizeof(Element *));
304 ASSERT(map.contains(input));
305 input = (Element*) map.get(input);
309 Boolean* overflowstatus;
310 myread(&overflowstatus, sizeof(Boolean *));
311 BooleanEdge tmp(overflowstatus);
312 bool isNegated = tmp.isNegated();
313 ASSERT(map.contains(tmp.getBoolean()));
314 overflowstatus = (Boolean*) map.get(tmp.getBoolean());
315 BooleanEdge res(overflowstatus);
316 BooleanEdge undefStatus = isNegated?res.negate():res;
318 map.put(ef_ptr, solver->applyFunction(function, members.expose(), size, undefStatus));
322 void Deserializer::deserializeFunctionOperator(){
323 FunctionOperator *fo_ptr;
324 myread(&fo_ptr, sizeof(FunctionOperator *));
326 myread(&op, sizeof(ArithOp));
328 myread(&size, sizeof(uint));
329 Vector<Set*> domains;
330 for(uint i=0; i<size; i++){
332 myread(&domain, sizeof(Set*));
333 ASSERT(map.contains(domain));
334 domain = (Set*) map.get(domain);
335 domains.push(domain);
338 myread(&range, sizeof(Set*));
339 ASSERT(map.contains(range));
340 range = (Set*) map.get(range);
341 OverFlowBehavior overflowbehavior;
342 myread(&overflowbehavior, sizeof(OverFlowBehavior));
343 map.put(fo_ptr, solver->createFunctionOperator(op, domains.expose(), size, range, overflowbehavior));
346 void Deserializer::deserializeFunctionTable(){
347 FunctionTable *ft_ptr;
348 myread(&ft_ptr, sizeof(FunctionTable *));
350 myread(&table, sizeof(Table*));
351 ASSERT(map.contains(table));
352 table = (Table*) map.get(table);
353 UndefinedBehavior undefinedbehavior;
354 myread(&undefinedbehavior, sizeof(UndefinedBehavior));
356 map.put(ft_ptr, solver->completeTable(table, undefinedbehavior));