-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathbenchmark (1).cpp
More file actions
275 lines (252 loc) · 5.58 KB
/
Copy pathbenchmark (1).cpp
File metadata and controls
275 lines (252 loc) · 5.58 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
#include<bits/stdc++.h>
#include <unistd.h>
#include <pthread.h>
#include <time.h>
#include "kvStore.cpp"
using namespace std;
string sliceToStr(Slice& a) {
string ret = "";
for (int i = 0; i < a.size; i++)
ret += a.data[i];
return ret;
}
void strToSlice(string l, Slice& a) {
a.size = l.length();
a.data = (char*)malloc(a.size);
strncpy(a.data, l.c_str(), a.size);
}
string random_key(int stringLength){
string k = "";
string letters = "";
for(char i = 'a';i<='z';i++)letters+=i;
for(char i = 'A';i<='Z';i++)letters+=i;
for(int i=0;i<stringLength-1;i++)
k = k + letters[(rand()%52+rand()%10)%52];
k = k + '\n';
return k;
}
string random_value(int stringLength){
string v = "";
string letters = "";
for(int i = 32;i<127;i++)letters+=char(i);
for(int i=0;i<stringLength-1;i++)
v = v + letters[rand()%95];
v = v + '\n';
return v;
}
kvStore kv(10000000);
map<string,string> db;
long long db_size = 0;
void *myThreadFun(void *vargp)
{
long long int transactions=0;
time_t start,end;
int limit = 10;
time(&start);
time(&end);
while((end-start) < limit)
{
transactions+=1000;
for(int i=0;i<10000;i++)
{
int x = rand()%5;
if(x==0)
{
string key = random_key(rand()%64 + 1);
Slice s_key,s_value;
strToSlice(key,s_key);
bool ans = kv.get(s_key,s_value);
}
else if(x==1)
{
string key = random_key(rand()%64 + 1);
string value = random_value(rand()%255 + 1);
Slice s_key,s_value,temp;
strToSlice(key,s_key);
strToSlice(value,s_value);
bool check = kv.get(s_key,temp);
bool ans = kv.put(s_key,s_value);
if(check == false)
db_size++;
}
else if(x==2)
{
int temp=db_size;
if (temp == 0)
continue;
int rem = rand()%temp;
Slice s_key,s_value;
bool check = kv.get(rem,s_key,s_value);
check = kv.del(s_key);
db_size--;
}
else if(x==3)
{
int temp=db_size;
if (temp == 0)
continue;
int rem = rand()%temp;
Slice s_key,s_value;
bool check = kv.get(rem,s_key,s_value);
}
else if(x==4)
{
int temp=db_size;
if (temp == 0)
continue;
int rem = rand()%temp;
bool check = kv.del(rem);
db_size--;
}
}
time(&end);
}
cout<<"TRANSACTIONS PER SEC = "<<transactions/limit<<endl;
return NULL;
}
int main()
{
int put_enteries = 100000;
time_t start_p,end_p;
float put_time = 0;
vector<Slice> keys;
vector<Slice> values;
for(int i=0;i<put_enteries;i++)
{
string key = random_key(rand()%63 + 1);
string value = random_value(rand()%254 + 1);
// printf("key is *%S*\n",key);
cout<<"Key is *"<<key<<"*"<<endl;
db[key] = value;
Slice k,v;
strToSlice(key,k);
strToSlice(value,v);
keys.push_back(k);
values.push_back(v);
db_size = db.size();
}
time(&start_p);
for(int i=0;i<put_enteries;i++)
kv.put(keys[i],values[i]);
time(&end_p);
cout<<"TIME FOR PUTTING "<<put_enteries<<" ENTERIES = "<<setprecision(9)<<(end_p-start_p)<<" SEC "<<endl;
bool incorrect = false;
for(int i=0;i<10000;i++)
{
int x = rand()%5;
if(x==0)
{
string key = random_key(rand()%64 + 1);
Slice s_key,s_value;
strToSlice(key,s_key);
bool ans = kv.get(s_key,s_value);
map<string,string>:: iterator itr = db.find(key);
if((ans==false && itr != db.end()) || (ans==true && itr->second != sliceToStr(s_value) ))
incorrect = true;
if(incorrect == true)
{
printf("wrong %d\n",x);
sleep(1000);
break;
}
}
else if(x==1)
{
int k = rand()%64 + 1;
int v = rand()%255 + 1;
string key = random_key(k);
string value = random_value(v);
db[key] = value;
Slice s_key,s_value;
strToSlice(key,s_key);
strToSlice(value,s_value);
bool ans = kv.put(s_key,s_value);
Slice check;
bool check2 = kv.get(s_key,check);
db_size = db.size();
if(check2 == false || value != sliceToStr(check))
incorrect = true;
if(incorrect == true)
{
printf("wrong %d\n",x);
sleep(1000);
break;
}
}
else if(x==2)
{
int rem = rand()%db_size;
map<string,string>:: iterator itr = db.begin();
advance(itr,rem);
string key = itr->first;
Slice s_key,s_value;
strToSlice(key,s_key);
bool check = kv.del(s_key);
db.erase(itr);
db_size--;
bool check2 = kv.get(s_key,s_value);
if(check2 == true)
incorrect = true;
if(incorrect == true)
{
printf("wrong %d\n",x);
sleep(1000);
break;
}
}
else if(x==3)
{
int rem = rand()%db_size;
Slice s_key,s_value;
bool check = kv.get(rem,s_key,s_value);
map<string,string>:: iterator itr = db.begin();
for(int i=0;i<rem;i++)itr++;
if( itr->first != sliceToStr(s_key) || itr->second != sliceToStr(s_value))
incorrect = true;
if(incorrect == true)
{
printf("wrong %d\n",x);
sleep(1000);
break;
}
}
else if(x==4)
{
int rem = rand()%db_size;
map<string,string>:: iterator itr = db.begin();
for(int i=0;i<rem;i++)itr++;
string key = itr->first;
bool check = kv.del(rem);
db.erase(itr);
db_size--;
Slice s_key,s_value;
strToSlice(key,s_key);
bool check2 = kv.get(s_key,s_value);
if(check2 == true)
incorrect = true;
if(incorrect == true)
{
printf("wrong %d\n",x);
sleep(1000);
break;
}
}
}
if(incorrect == true)
{
cout<<"INCORRECT OUTPUT"<<endl;
return 0;
}
else
cout<<"CORRECT OUTPUT"<<endl;
int threads = 4;
pthread_t tid[threads];
for (int i = 0; i < threads; i++)
{
tid[i] = i;
pthread_create(&tid[i], NULL, myThreadFun, (void *)&tid[i]);
}
for(int i=0;i<threads;i++)
pthread_join(tid[i],NULL);
return 0;
}