Repository navigation
Expand file tree
/
Copy patha3test.h
More file actions
225 lines (199 loc) · 6.48 KB
/
Copy patha3test.h
File metadata and controls
225 lines (199 loc) · 6.48 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
#ifndef TEST_H
#define TEST_H
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <math.h>
#include "Function.h"
#include "Pipe.h"
#include "DBFile.h"
#include "Record.h"
using namespace std;
// test settings file should have the
// catalog_path, dbfile_dir and tpch_dir information in separate lines
const char *settings = "test.cat";
// donot change this information here
char *catalog_path, *dbfile_dir, *tpch_dir
FA56
= NULL;
extern "C" {
int yyparse(void); // defined in y.tab.c
int yyfuncparse(void); // defined in yyfunc.tab.c
void init_lexical_parser (char *); // defined in lex.yy.c (from Lexer.l)
void close_lexical_parser (); // defined in lex.yy.c
void init_lexical_parser_func (char *); // defined in lex.yyfunc.c (from Lexerfunc.l)
void close_lexical_parser_func (); // defined in lex.yyfunc.c
}
extern struct AndList *final;
extern struct FuncOperator *finalfunc;
extern FILE *yyin;
typedef struct {
Pipe *pipe;
OrderMaker *order;
bool print;
bool write;
}testutil;
class relation {
private:
char *rname;
char *prefix;
char rpath[100];
Schema *rschema;
public:
relation (char *_name, Schema *_schema, char *_prefix) :
rname (_name), rschema (_schema), prefix (_prefix) {
sprintf (rpath, "%s%s.bin", prefix, rname);
}
char* name () { return rname; }
char* path () { return rpath; }
Schema* schema () { return rschema;}
void info () {
cout << " relation info\n";
cout << "\t name: " << name () << endl;
cout << "\t path: " << path () << endl;
}
void get_cnf (char *input, CNF &cnf_pred, Record &literal) {
init_lexical_parser (input);
if (yyparse() != 0) {
cout << " Error: can't parse your CNF.\n";
exit (1);
}
cnf_pred.GrowFromParseTree (final, schema (), literal); // constructs CNF predicate
close_lexical_parser ();
}
void get_cnf (char *input, Function &fn_pred) {
init_lexical_parser_func (input);
if (yyfuncparse() != 0) {
cout << " Error: can't parse your CNF.\n";
exit (1);
}
fn_pred.GrowFromParseTree (finalfunc, *(schema ())); // constructs CNF predicate
close_lexical_parser_func ();
}
void get_cnf (CNF &cnf_pred, Record &literal) {
cout << "\n enter CNF predicate (when done press ctrl-D):\n\t";
if (yyparse() != 0) {
cout << " Error: can't parse your CNF.\n";
exit (1);
}
cnf_pred.GrowFromParseTree (final, schema (), literal); // constructs CNF predicate
}
void get_file_cnf (const char *fpath, CNF &cnf_pred, Record &literal) {
yyin = fopen (fpath, "r");
if (yyin == NULL) {
cout << " Error: can't open file " << fpath << " for parsing \n";
exit (1);
}
if (yyparse() != 0) {
cout << " Error: can't parse your CNF.\n";
exit (1);
}
cnf_pred.GrowFromParseTree (final, schema (), literal); // constructs CNF predicate
// cnf_pred.GrowFromParseTree (final, l_schema (), r_schema (), literal); // constructs CNF predicate over two relations l_schema is the left reln's schema r the right's
//cnf_pred.Print ();
}
void get_sort_order (OrderMaker &sortorder) {
cout << "\n specify sort ordering (when done press ctrl-D):\n\t ";
if (yyparse() != 0) {
cout << " Error: can't parse your CNF \n";
exit (1);
}
Record literal;
CNF sort_pred;
sort_pred.GrowFromParseTree (final, schema (), literal); // constructs CNF predicate
OrderMaker dummy;
sort_pred.GetSortOrders (sortorder, dummy);
}
};
void get_cnf (char *input, Schema *left, CNF &cnf_pred, Record &literal) {
init_lexical_parser (input);
if (yyparse() != 0) {
cout << " Error: can't parse your CNF " << input << endl;
exit (1);
}
cnf_pred.GrowFromParseTree (final, left, literal); // constructs CNF predicate
close_lexical_parser ();
}
void get_cnf (char *input, Schema *left, Schema *right, CNF &cnf_pred, Record &literal) {
init_lexical_parser (input);
if (yyparse() != 0) {
cout << " Error: can't parse your CNF " << input << endl;
exit (1);
}
cnf_pred.GrowFromParseTree (final, left, right, literal); // constructs CNF predicate
close_lexical_parser ();
}
void get_cnf (char *input, Schema *left, Function &fn_pred) {
init_lexical_parser_func (input);
if (yyfuncparse() != 0) {
cout << " Error: can't parse your arithmetic expr. " << input << endl;
exit (1);
}
fn_pred.GrowFromParseTree (finalfunc, *left); // constructs CNF predicate
close_lexical_parser_func ();
}
void get_sort_order(char *input, Schema *l, OrderMaker &sortorder)
{
init_lexical_parser(input);
if (yyparse() != 0) {
cout << " Error: can't parse your CNF \n";
exit(1);
}
Record literal;
CNF sort_pred;
sort_pred.GrowFromParseTree(final, l, literal); // constructs CNF predicate
OrderMaker dummy;
sort_pred.GetSortOrders(sortorder, dummy);
}
relation *rel;
char *supplier = "supplier";
char *partsupp = "partsupp";
char *part = "part";
char *nation = "nation";
char *customer = "customer";
char *orders = "orders";
char *region = "region";
char *lineitem = "lineitem";
relation *s, *p, *ps, *n, *li, *r, *o, *c;
void setup () {
FILE *fp = fopen (settings, "r");
if (fp) {
char *mem = (char *) malloc (80 * 3);
catalog_path = &mem[0];
dbfile_dir = &mem[80];
tpch_dir = &mem[160];
char line[80];
fgets (line, 80, fp);
sscanf (line, "%s\n", catalog_path);
fgets (line, 80, fp);
sscanf (line, "%s\n", dbfile_dir);
fgets (line, 80, fp);
sscanf (line, "%s\n", tpch_dir);
fclose (fp);
if (! (catalog_path && dbfile_dir && tpch_dir)) {
cerr << " Test settings file 'test.cat' not in correct format.\n";
free (mem);
exit (1);
}
}
else {
cerr << " Test settings files 'test.cat' missing \n";
exit (1);
}
cout << " \n** IMPORTANT: MAKE SURE THE INFORMATION BELOW IS CORRECT **\n";
cout << " catalog location: \t" << catalog_path << endl;
cout << " tpch files dir: \t" << tpch_dir << endl;
cout << " heap files dir: \t" << dbfile_dir << endl;
cout << " \n\n";
s = new relation (supplier, new Schema (catalog_path, supplier), dbfile_dir);
p = new relation (part, new Schema (catalog_path, part), dbfile_dir);
ps = new relation (partsupp, new Schema (catalog_path, partsupp), dbfile_dir);
n = new relation (nation, new Schema (catalog_path, nation), dbfile_dir);
li = new relation (lineitem, new Schema (catalog_path, lineitem), dbfile_dir);
r = new relation (region, new Schema (catalog_path, region), dbfile_dir);
o = new relation (orders, new Schema (catalog_path, orders), dbfile_dir);
c = new relation (customer, new Schema (catalog_path, customer), dbfile_dir);
}
void cleanup () {
delete s, p, ps, n, li, r, o, c;
free (catalog_path);
}
#endif