-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsimulator.cc
More file actions
162 lines (139 loc) · 4.4 KB
/
simulator.cc
File metadata and controls
162 lines (139 loc) · 4.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
#include <iostream>
#include <unistd.h>
#include <cstdlib>
#include <string.h>
#include <vector>
#include <algorithm>
#include <fstream>
#include <sstream>
#include "list.h"
#include "compaction.h"
using namespace std;
int read_cnt = 0;
int write_cnt = 0;
void usage(char *program)
{
cout << "====================" << endl;
cout << "usage : " << program << " [-l level_num] [-s level_sst_size] [-k input_key] [-n sst_size]" << endl;
cout << "-l level_num : # of Level Ex) 3" << endl;
cout << "-s level_sst_size : Size of SSTable Ex) 2,4,8 (%)" << endl;
cout << "-k input_key : input keys Ex) 1~32" << endl;
cout << "-n sst_size : # of keys in SSTable Ex) 4" << endl;
cout << "====================" << endl;
}
void level_print(list memtable, list *level, int level_num)
{
cout << "----------" << endl;
cout << "memtable" << endl;
memtable.print();
cout << "----------" << endl;
for(int i=0;i<level_num;i++) {
cout << "level " << i << endl;
level[i].print();
}
cout << "----------" << endl;
}
int* tok(int num, char *str)
{
int *arr = new int[num];
char *tok = strtok(str,",");
for(int i=0; i<num; i++) {
arr[i] = atoi(tok);
tok = strtok(NULL,",");
}
return arr;
}
void input_tok(vector<int> &arr, char *input_str)
{
// file input
string line;
ifstream ifs(input_str);
getline(ifs, line);
stringstream tokline(line);
while(tokline >> line)
arr.push_back(atoi(line.c_str()));
}
int main(int argc, char **argv)
{
int c = 1;
int level_num = 0; // # of Level ex) 3 / l
int *level_sst_size; // Size of SSTable ex) 2,4,8 / s
char *lss_str;
vector<int> input_key;
char *input_str; // input keys ex) 1~32 / k
int sst_size = 0; // # of keys in SSTable ex) 4 / n
char *type; // type ex) r / t
while((c = getopt(argc, argv, "l:s:k:n:h")) != -1) {
switch(c) {
case 'l':
level_num = atoi(optarg);
break;
case 's':
lss_str = optarg;
break;
case 'k':
input_str = optarg;
break;
case 'n':
sst_size = atoi(optarg);
break;
case 'h':
usage(argv[0]);
exit(0);
break;
default:
usage(argv[0]);
exit(0);
break;
}
}
input_tok(input_key, input_str);
input_key.push_back(0);
// level_sst_size tok
level_sst_size = tok(level_num, lss_str);
// level create
list memtable;
list level[level_num];
list cpt;
// input key range
for(int i=0; i<input_key.size(); i++) {
if(memtable.head == NULL || memtable.get_keycnt(memtable.tail) == sst_size) {
// flush, key data sort
if(memtable.get_size() == 1)
level[0].push(memtable.flush());
// compaction
for(int j=0; j<level_num-1; j++) {
while(level[j].get_size() > level_sst_size[j]) {
if(j == 0 || level[j+1].head != NULL) {
vector<int> vec;
bool cpt_check;
// compaction check
cpt_check = compaction_check(level, cpt, j, vec, sst_size);
// compaction check true / merge sort compaction
if(cpt_check) {
// compaction execution
compaction_exec(level, cpt, j, vec, sst_size);
// list init
cpt.init();
level[j+1].cpt_init();
}
} else {
level[j+1].push(level[j].pop());
read_cnt++;
write_cnt++;
}
}
}
// memtable input
memtable.create(sst_size);
}
// key insert
memtable.key_push(memtable.head, input_key[i]);
level_print(memtable, level, level_num);
}
level_print(memtable, level, level_num);
cout << "I/O Count - Read : " << read_cnt << endl;
cout << "I/O Count - Write : " << write_cnt << endl;
delete level_sst_size;
return 0;
}