- Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathtest.cpp
More file actions
Latest commit
474 lines (463 loc) · 17.4 KB
/
Copy pathtest.cpp
File metadata and controls
474 lines (463 loc) · 17.4 KB
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
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
#include"souffle/CompiledSouffle.h"
extern"C" {
}
namespacesouffle {
staticconst RamDomain RAM_BIT_SHIFT_MASK = RAM_DOMAIN_SIZE - 1;
structt_btree_ii__0_1__11 {
using t_tuple = Tuple<RamDomain, 2>;
structt_comparator_0{
intoperator()(const t_tuple& a, const t_tuple& b) const {
return (ramBitCast<RamSigned>(a[0]) < ramBitCast<RamSigned>(b[0])) ? -1 : (ramBitCast<RamSigned>(a[0]) > ramBitCast<RamSigned>(b[0])) ? 1 :((ramBitCast<RamSigned>(a[1]) < ramBitCast<RamSigned>(b[1])) ? -1 : (ramBitCast<RamSigned>(a[1]) > ramBitCast<RamSigned>(b[1])) ? 1 :(0));
}
boolless(const t_tuple& a, const t_tuple& b) const {
return (ramBitCast<RamSigned>(a[0]) < ramBitCast<RamSigned>(b[0]))|| (ramBitCast<RamSigned>(a[0]) == ramBitCast<RamSigned>(b[0])) && ((ramBitCast<RamSigned>(a[1]) < ramBitCast<RamSigned>(b[1])));
}
boolequal(const t_tuple& a, const t_tuple& b) const {
return (ramBitCast<RamSigned>(a[0]) == ramBitCast<RamSigned>(b[0]))&&(ramBitCast<RamSigned>(a[1]) == ramBitCast<RamSigned>(b[1]));
}
};
using t_ind_0 = btree_set<t_tuple,t_comparator_0>;
t_ind_0 ind_0;
using iterator = t_ind_0::iterator;
structcontext {
t_ind_0::operation_hints hints_0_lower;
t_ind_0::operation_hints hints_0_upper;
};
context createContext() { returncontext(); }
boolinsert(const t_tuple& t) {
context h;
returninsert(t, h);
}
boolinsert(const t_tuple& t, context& h) {
if (ind_0.insert(t, h.hints_0_lower)) {
returntrue;
} elsereturnfalse;
}
boolinsert(const RamDomain* ramDomain) {
RamDomain data[2];
std::copy(ramDomain, ramDomain + 2, data);
const t_tuple& tuple = reinterpret_cast<const t_tuple&>(data);
context h;
returninsert(tuple, h);
}
boolinsert(RamDomain a0,RamDomain a1) {
RamDomain data[2] = {a0,a1};
returninsert(data);
}
boolcontains(const t_tuple& t, context& h) const {
return ind_0.contains(t, h.hints_0_lower);
}
boolcontains(const t_tuple& t) const {
context h;
returncontains(t, h);
}
std::size_tsize() const {
return ind_0.size();
}
iterator find(const t_tuple& t, context& h) const {
return ind_0.find(t, h.hints_0_lower);
}
iterator find(const t_tuple& t) const {
context h;
returnfind(t, h);
}
range<iterator> lowerUpperRange_00(const t_tuple& /* lower */, const t_tuple& /* upper */, context& /* h */) const {
return range<iterator>(ind_0.begin(),ind_0.end());
}
range<iterator> lowerUpperRange_00(const t_tuple& /* lower */, const t_tuple& /* upper */) const {
return range<iterator>(ind_0.begin(),ind_0.end());
}
range<t_ind_0::iterator> lowerUpperRange_11(const t_tuple& lower, const t_tuple& upper, context& h) const {
t_comparator_0 comparator;
int cmp = comparator(lower, upper);
if (cmp == 0) {
auto pos = ind_0.find(lower, h.hints_0_lower);
auto fin = ind_0.end();
if (pos != fin) {fin = pos; ++fin;}
returnmake_range(pos, fin);
}
if (cmp > 0) {
returnmake_range(ind_0.end(), ind_0.end());
}
returnmake_range(ind_0.lower_bound(lower, h.hints_0_lower), ind_0.upper_bound(upper, h.hints_0_upper));
}
range<t_ind_0::iterator> lowerUpperRange_11(const t_tuple& lower, const t_tuple& upper) const {
context h;
returnlowerUpperRange_11(lower,upper,h);
}
boolempty() const {
return ind_0.empty();
}
std::vector<range<iterator>> partition() const {
return ind_0.getChunks(400);
}
voidpurge() {
ind_0.clear();
}
iterator begin() const {
return ind_0.begin();
}
iterator end() const {
return ind_0.end();
}
voidprintStatistics(std::ostream& o) const {
o << " arity 2 direct b-tree index 0 lex-order [0,1]\n";
ind_0.printStats(o);
}
};
structt_btree_ii__0_1__11__10 {
using t_tuple = Tuple<RamDomain, 2>;
structt_comparator_0{
intoperator()(const t_tuple& a, const t_tuple& b) const {
return (ramBitCast<RamSigned>(a[0]) < ramBitCast<RamSigned>(b[0])) ? -1 : (ramBitCast<RamSigned>(a[0]) > ramBitCast<RamSigned>(b[0])) ? 1 :((ramBitCast<RamSigned>(a[1]) < ramBitCast<RamSigned>(b[1])) ? -1 : (ramBitCast<RamSigned>(a[1]) > ramBitCast<RamSigned>(b[1])) ? 1 :(0));
}
boolless(const t_tuple& a, const t_tuple& b) const {
return (ramBitCast<RamSigned>(a[0]) < ramBitCast<RamSigned>(b[0]))|| (ramBitCast<RamSigned>(a[0]) == ramBitCast<RamSigned>(b[0])) && ((ramBitCast<RamSigned>(a[1]) < ramBitCast<RamSigned>(b[1])));
}
boolequal(const t_tuple& a, const t_tuple& b) const {
return (ramBitCast<RamSigned>(a[0]) == ramBitCast<RamSigned>(b[0]))&&(ramBitCast<RamSigned>(a[1]) == ramBitCast<RamSigned>(b[1]));
}
};
using t_ind_0 = btree_set<t_tuple,t_comparator_0>;
t_ind_0 ind_0;
using iterator = t_ind_0::iterator;
structcontext {
t_ind_0::operation_hints hints_0_lower;
t_ind_0::operation_hints hints_0_upper;
};
context createContext() { returncontext(); }
boolinsert(const t_tuple& t) {
context h;
returninsert(t, h);
}
boolinsert(const t_tuple& t, context& h) {
if (ind_0.insert(t, h.hints_0_lower)) {
returntrue;
} elsereturnfalse;
}
boolinsert(const RamDomain* ramDomain) {
RamDomain data[2];
std::copy(ramDomain, ramDomain + 2, data);
const t_tuple& tuple = reinterpret_cast<const t_tuple&>(data);
context h;
returninsert(tuple, h);
}
boolinsert(RamDomain a0,RamDomain a1) {
RamDomain data[2] = {a0,a1};
returninsert(data);
}
boolcontains(const t_tuple& t, context& h) const {
return ind_0.contains(t, h.hints_0_lower);
}
boolcontains(const t_tuple& t) const {
context h;
returncontains(t, h);
}
std::size_tsize() const {
return ind_0.size();
}
iterator find(const t_tuple& t, context& h) const {
return ind_0.find(t, h.hints_0_lower);
}
iterator find(const t_tuple& t) const {
context h;
returnfind(t, h);
}
range<iterator> lowerUpperRange_00(const t_tuple& /* lower */, const t_tuple& /* upper */, context& /* h */) const {
return range<iterator>(ind_0.begin(),ind_0.end());
}
range<iterator> lowerUpperRange_00(const t_tuple& /* lower */, const t_tuple& /* upper */) const {
return range<iterator>(ind_0.begin(),ind_0.end());
}
range<t_ind_0::iterator> lowerUpperRange_11(const t_tuple& lower, const t_tuple& upper, context& h) const {
t_comparator_0 comparator;
int cmp = comparator(lower, upper);
if (cmp == 0) {
auto pos = ind_0.find(lower, h.hints_0_lower);
auto fin = ind_0.end();
if (pos != fin) {fin = pos; ++fin;}
returnmake_range(pos, fin);
}
if (cmp > 0) {
returnmake_range(ind_0.end(), ind_0.end());
}
returnmake_range(ind_0.lower_bound(lower, h.hints_0_lower), ind_0.upper_bound(upper, h.hints_0_upper));
}
range<t_ind_0::iterator> lowerUpperRange_11(const t_tuple& lower, const t_tuple& upper) const {
context h;
returnlowerUpperRange_11(lower,upper,h);
}
range<t_ind_0::iterator> lowerUpperRange_10(const t_tuple& lower, const t_tuple& upper, context& h) const {
t_comparator_0 comparator;
int cmp = comparator(lower, upper);
if (cmp > 0) {
returnmake_range(ind_0.end(), ind_0.end());
}
returnmake_range(ind_0.lower_bound(lower, h.hints_0_lower), ind_0.upper_bound(upper, h.hints_0_upper));
}
range<t_ind_0::iterator> lowerUpperRange_10(const t_tuple& lower, const t_tuple& upper) const {
context h;
returnlowerUpperRange_10(lower,upper,h);
}
boolempty() const {
return ind_0.empty();
}
std::vector<range<iterator>> partition() const {
return ind_0.getChunks(400);
}
voidpurge() {
ind_0.clear();
}
iterator begin() const {
return ind_0.begin();
}
iterator end() const {
return ind_0.end();
}
voidprintStatistics(std::ostream& o) const {
o << " arity 2 direct b-tree index 0 lex-order [0,1]\n";
ind_0.printStats(o);
}
};
classSf_test : publicSouffleProgram {
private:
staticinlineboolregex_wrapper(const std::string& pattern, const std::string& text) {
bool result = false;
try { result = std::regex_match(text, std::regex(pattern)); } catch(...) {
std::cerr << "warning: wrong pattern provided for match(\"" << pattern << "\",\"" << text << "\").\n";
}
return result;
}
private:
staticinline std::string substr_wrapper(const std::string& str, size_t idx, size_t len) {
std::string result;
try { result = str.substr(idx,len); } catch(...) {
std::cerr << "warning: wrong index position provided by substr(\"";
std::cerr << str << "\"," << (int32_t)idx << "," << (int32_t)len << ") functor.\n";
} return result;
}
public:
// -- initialize symbol table --
SymbolTable symTable;// -- initialize record table --
RecordTable recordTable;
// -- Table: @delta_path
Own<t_btree_ii__0_1__11> rel_1_delta_path = mk<t_btree_ii__0_1__11>();
// -- Table: @new_path
Own<t_btree_ii__0_1__11> rel_2_new_path = mk<t_btree_ii__0_1__11>();
// -- Table: edge
Own<t_btree_ii__0_1__11__10> rel_3_edge = mk<t_btree_ii__0_1__11__10>();
souffle::RelationWrapper<0,t_btree_ii__0_1__11__10,Tuple<RamDomain,2>,2,0> wrapper_rel_3_edge;
// -- Table: path
Own<t_btree_ii__0_1__11> rel_4_path = mk<t_btree_ii__0_1__11>();
souffle::RelationWrapper<1,t_btree_ii__0_1__11,Tuple<RamDomain,2>,2,0> wrapper_rel_4_path;
public:
Sf_test() :
wrapper_rel_3_edge(*rel_3_edge,symTable,"edge",std::array<constchar *,2>{{"i:number","i:number"}},std::array<constchar *,2>{{"x","y"}}),
wrapper_rel_4_path(*rel_4_path,symTable,"path",std::array<constchar *,2>{{"i:number","i:number"}},std::array<constchar *,2>{{"x","y"}}){
addRelation("edge",&wrapper_rel_3_edge,true,false);
addRelation("path",&wrapper_rel_4_path,false,true);
}
~Sf_test() {
}
private:
std::string inputDirectory;
std::string outputDirectory;
bool performIO;
std::atomic<RamDomain> ctr{};
std::atomic<size_t> iter{};
voidrunFunction(std::string inputDirectoryArg = "", std::string outputDirectoryArg = "", bool performIOArg = false) {
this->inputDirectory = inputDirectoryArg;
this->outputDirectory = outputDirectoryArg;
this->performIO = performIOArg;
SignalHandler::instance()->set();
#if defined(_OPENMP)
if (getNumThreads() > 0) {omp_set_num_threads(getNumThreads());}
#endif
// -- query evaluation --
{
std::vector<RamDomain> args, ret;
subroutine_0(args, ret);
}
{
std::vector<RamDomain> args, ret;
subroutine_1(args, ret);
}
// -- relation hint statistics --
SignalHandler::instance()->reset();
}
public:
voidrun() override { runFunction("", "", false); }
public:
voidrunAll(std::string inputDirectoryArg = "", std::string outputDirectoryArg = "") override { runFunction(inputDirectoryArg, outputDirectoryArg, true);
}
public:
voidprintAll(std::string outputDirectoryArg = "") override {
try {std::map<std::string, std::string> directiveMap({{"IO","file"},{"attributeNames","x\ty"},{"name","path"},{"operation","output"},{"output-dir","src"},{"params","{\"records\": {}, \"relation\": {\"arity\": 2, \"auxArity\": 0, \"params\": [\"x\", \"y\"]}}"},{"types","{\"ADTs\": {}, \"records\": {}, \"relation\": {\"arity\": 2, \"auxArity\": 0, \"types\": [\"i:number\", \"i:number\"]}}"}});
if (!outputDirectoryArg.empty()) {directiveMap["output-dir"] = outputDirectoryArg;}
IOSystem::getInstance().getWriter(directiveMap, symTable, recordTable)->writeAll(*rel_4_path);
} catch (std::exception& e) {std::cerr << e.what();exit(1);}
}
public:
voidloadAll(std::string inputDirectoryArg = "") override {
try {std::map<std::string, std::string> directiveMap({{"IO","file"},{"attributeNames","x\ty"},{"fact-dir","gen"},{"name","edge"},{"operation","input"},{"params","{\"records\": {}, \"relation\": {\"arity\": 2, \"auxArity\": 0, \"params\": [\"x\", \"y\"]}}"},{"types","{\"ADTs\": {}, \"records\": {}, \"relation\": {\"arity\": 2, \"auxArity\": 0, \"types\": [\"i:number\", \"i:number\"]}}"}});
if (!inputDirectoryArg.empty()) {directiveMap["fact-dir"] = inputDirectoryArg;}
IOSystem::getInstance().getReader(directiveMap, symTable, recordTable)->readAll(*rel_3_edge);
} catch (std::exception& e) {std::cerr << "Error loading data: " << e.what() << '\n';}
}
public:
voiddumpInputs() override {
try {std::map<std::string, std::string> rwOperation;
rwOperation["IO"] = "stdout";
rwOperation["name"] = "edge";
rwOperation["types"] = "{\"relation\": {\"arity\": 2, \"auxArity\": 0, \"types\": [\"i:number\", \"i:number\"]}}";
IOSystem::getInstance().getWriter(rwOperation, symTable, recordTable)->writeAll(*rel_3_edge);
} catch (std::exception& e) {std::cerr << e.what();exit(1);}
}
public:
voiddumpOutputs() override {
try {std::map<std::string, std::string> rwOperation;
rwOperation["IO"] = "stdout";
rwOperation["name"] = "path";
rwOperation["types"] = "{\"relation\": {\"arity\": 2, \"auxArity\": 0, \"types\": [\"i:number\", \"i:number\"]}}";
IOSystem::getInstance().getWriter(rwOperation, symTable, recordTable)->writeAll(*rel_4_path);
} catch (std::exception& e) {std::cerr << e.what();exit(1);}
}
public:
SymbolTable& getSymbolTable() override {
return symTable;
}
voidexecuteSubroutine(std::string name, const std::vector<RamDomain>& args, std::vector<RamDomain>& ret) override {
if (name == "stratum_0") {
subroutine_0(args, ret);
return;}
if (name == "stratum_1") {
subroutine_1(args, ret);
return;}
fatal("unknown subroutine");
}
#ifdef _MSC_VER
#pragma warning(disable: 4100)
#endif// _MSC_VER
voidsubroutine_0(const std::vector<RamDomain>& args, std::vector<RamDomain>& ret) {
if (performIO) {
try {std::map<std::string, std::string> directiveMap({{"IO","file"},{"attributeNames","x\ty"},{"fact-dir","gen"},{"name","edge"},{"operation","input"},{"params","{\"records\": {}, \"relation\": {\"arity\": 2, \"auxArity\": 0, \"params\": [\"x\", \"y\"]}}"},{"types","{\"ADTs\": {}, \"records\": {}, \"relation\": {\"arity\": 2, \"auxArity\": 0, \"types\": [\"i:number\", \"i:number\"]}}"}});
if (!inputDirectory.empty()) {directiveMap["fact-dir"] = inputDirectory;}
IOSystem::getInstance().getReader(directiveMap, symTable, recordTable)->readAll(*rel_3_edge);
} catch (std::exception& e) {std::cerr << "Error loading data: " << e.what() << '\n';}
}
}
#ifdef _MSC_VER
#pragma warning(default: 4100)
#endif// _MSC_VER
#ifdef _MSC_VER
#pragma warning(disable: 4100)
#endif// _MSC_VER
voidsubroutine_1(const std::vector<RamDomain>& args, std::vector<RamDomain>& ret) {
SignalHandler::instance()->setMsg(R"_(path(x,y) :-
edge(x,y).
in file /home/pree/Code/Haskell/pltest/src/sema.dl [7:1-7:26])_");
if(!(rel_3_edge->empty())) {
[&](){
CREATE_OP_CONTEXT(rel_4_path_op_ctxt,rel_4_path->createContext());
CREATE_OP_CONTEXT(rel_3_edge_op_ctxt,rel_3_edge->createContext());
for(constauto& env0 : *rel_3_edge) {
Tuple<RamDomain,2> tuple{{ramBitCast(env0[0]),ramBitCast(env0[1])}};
rel_4_path->insert(tuple,READ_OP_CONTEXT(rel_4_path_op_ctxt));
}
}
();}
[&](){
CREATE_OP_CONTEXT(rel_4_path_op_ctxt,rel_4_path->createContext());
CREATE_OP_CONTEXT(rel_1_delta_path_op_ctxt,rel_1_delta_path->createContext());
for(constauto& env0 : *rel_4_path) {
Tuple<RamDomain,2> tuple{{ramBitCast(env0[0]),ramBitCast(env0[1])}};
rel_1_delta_path->insert(tuple,READ_OP_CONTEXT(rel_1_delta_path_op_ctxt));
}
}
();iter = 0;
for(;;) {
SignalHandler::instance()->setMsg(R"_(path(x,y) :-
path(x,z),
edge(z,y).
in file /home/pree/Code/Haskell/pltest/src/sema.dl [8:1-8:38])_");
if(!(rel_1_delta_path->empty()) && !(rel_3_edge->empty())) {
[&](){
CREATE_OP_CONTEXT(rel_4_path_op_ctxt,rel_4_path->createContext());
CREATE_OP_CONTEXT(rel_2_new_path_op_ctxt,rel_2_new_path->createContext());
CREATE_OP_CONTEXT(rel_3_edge_op_ctxt,rel_3_edge->createContext());
CREATE_OP_CONTEXT(rel_1_delta_path_op_ctxt,rel_1_delta_path->createContext());
for(constauto& env0 : *rel_1_delta_path) {
auto range = rel_3_edge->lowerUpperRange_10(Tuple<RamDomain,2>{{ramBitCast(env0[1]), ramBitCast<RamDomain>(MIN_RAM_SIGNED)}},Tuple<RamDomain,2>{{ramBitCast(env0[1]), ramBitCast<RamDomain>(MAX_RAM_SIGNED)}},READ_OP_CONTEXT(rel_3_edge_op_ctxt));
for(constauto& env1 : range) {
if( !(rel_4_path->contains(Tuple<RamDomain,2>{{ramBitCast(env0[0]),ramBitCast(env1[1])}},READ_OP_CONTEXT(rel_4_path_op_ctxt)))) {
Tuple<RamDomain,2> tuple{{ramBitCast(env0[0]),ramBitCast(env1[1])}};
rel_2_new_path->insert(tuple,READ_OP_CONTEXT(rel_2_new_path_op_ctxt));
}
}
}
}
();}
if(rel_2_new_path->empty()) break;
[&](){
CREATE_OP_CONTEXT(rel_4_path_op_ctxt,rel_4_path->createContext());
CREATE_OP_CONTEXT(rel_2_new_path_op_ctxt,rel_2_new_path->createContext());
for(constauto& env0 : *rel_2_new_path) {
Tuple<RamDomain,2> tuple{{ramBitCast(env0[0]),ramBitCast(env0[1])}};
rel_4_path->insert(tuple,READ_OP_CONTEXT(rel_4_path_op_ctxt));
}
}
();std::swap(rel_1_delta_path, rel_2_new_path);
rel_2_new_path->purge();
iter++;
}
iter = 0;
rel_1_delta_path->purge();
rel_2_new_path->purge();
if (performIO) {
try {std::map<std::string, std::string> directiveMap({{"IO","file"},{"attributeNames","x\ty"},{"name","path"},{"operation","output"},{"output-dir","src"},{"params","{\"records\": {}, \"relation\": {\"arity\": 2, \"auxArity\": 0, \"params\": [\"x\", \"y\"]}}"},{"types","{\"ADTs\": {}, \"records\": {}, \"relation\": {\"arity\": 2, \"auxArity\": 0, \"types\": [\"i:number\", \"i:number\"]}}"}});
if (!outputDirectory.empty()) {directiveMap["output-dir"] = outputDirectory;}
IOSystem::getInstance().getWriter(directiveMap, symTable, recordTable)->writeAll(*rel_4_path);
} catch (std::exception& e) {std::cerr << e.what();exit(1);}
}
if (performIO) rel_3_edge->purge();
if (performIO) rel_4_path->purge();
}
#ifdef _MSC_VER
#pragma warning(default: 4100)
#endif// _MSC_VER
};
SouffleProgram *newInstance_test(){returnnew Sf_test;}
SymbolTable *getST_test(SouffleProgram *p){return &reinterpret_cast<Sf_test*>(p)->symTable;}
#ifdef __EMBEDDED_SOUFFLE__
classfactory_Sf_test: publicsouffle::ProgramFactory {
SouffleProgram *newInstance() {
returnnewSf_test();
};
public:
factory_Sf_test() : ProgramFactory("test"){}
};
extern"C" {
factory_Sf_test __factory_Sf_test_instance;
}
}
#else
}
intmain(int argc, char** argv)
{
try{
souffle::CmdOptions opt(R"(src/sema.dl)",
R"()",
R"()",
false,
R"()",
1);
if (!opt.parse(argc,argv)) return1;
souffle::Sf_test obj;
#if defined(_OPENMP)
obj.setNumThreads(opt.getNumJobs());
#endif
obj.runAll(opt.getInputFileDir(), opt.getOutputFileDir());
return0;
} catch(std::exception &e) { souffle::SignalHandler::instance()->error(e.what());}
}
#endif