forked from vishwesh96/Distributed-key-value-Store
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathclient.go
341 lines (318 loc) · 10 KB
/
client.go
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
package kvstore
import (
"errors"
"strconv"
"log"
"os"
"fmt"
)
func Client_Transaction(address string, val *string) error {
fmt.Println("Enter 1 for Write,2 for Read, 3 for Delete and 4 to exit")
var choice int
fmt.Scanln(&choice)
var t Transaction
t.init()
for choice!=4 {
switch choice {
case 1:
fmt.Println("Enter Key to be written against")
var key string
var value string
fmt.Scanln(&key)
fmt.Println("Enter value to be written")
fmt.Scanln(&value)
t.Types=append(t.Types,1)
t.Keys=append(t.Keys,key)
t.Args_vals=append(t.Args_vals,value)
t.Ret_vals=append(t.Ret_vals,"No return var")
case 2:
fmt.Println("Enter Key to be read")
var key string
fmt.Scanln(&key)
t.Types=append(t.Types,0)
t.Keys=append(t.Keys,key)
t.Args_vals=append(t.Args_vals,"No args")
t.Ret_vals=append(t.Ret_vals,"Return Var")
case 3:
fmt.Println("Enter Key to be deleted")
var key string
fmt.Scanln(&key)
t.Types=append(t.Types,2)
t.Keys=append(t.Keys,key)
t.Args_vals=append(t.Args_vals,"No args")
t.Ret_vals=append(t.Ret_vals,"No return var")
default:
fmt.Println("Enter a valid Choice")
}
fmt.Println("Enter 1 for Write,2 for Read, 3 for Delete and 4 to exit")
fmt.Scanln(&choice)
}
err :=remote_Transaction(address, t, val)
return err
}
func Client_remoteRead(address string, key string, val *string) error {
e,_ := remote_ReadKey(address,key,4,val)
return e
}
func (ln *LocalNode) TransactionLeader(t Transaction, val *string) error {
var leaders []string = make([]string,0)
var all_leaders []string =make([]string,len(t.Keys))
temp_str:=new(string)
var e error
var repeat bool
for i:=range t.Keys {
e=ln.FindSuccessor(t.Keys[i],temp_str)
if(e!=nil) {
log.Fatal("Unexepected Errors in Transaction when looking out for leaders")
}
for k:=range leaders {
if(leaders[k]==*temp_str) {
repeat=true
break
}
}
if((!repeat)&&(*temp_str!=ln.Address)&&(t.Types[i]!=0)) {
leaders=append(leaders,*temp_str)
}
all_leaders[i]=*temp_str
}
var replies [](string) = make([](string),len(leaders))
fmt.Println("Initiating Pre Commit Messages to ",len(leaders) ," leaders")
for i:=range leaders {
remote_BusyNode(leaders[i],&replies[i]) // Prepare to commit
}
//Hbeat_start := time.Now() //Start Timer
//for ((time.Since(Hbeat_start))*time.Second<100*ln.config.HeartBeatTime) {
//}
for i:=range replies {
if(replies[i]=="true") {
//If even one value is nil, refrain to make changes, and abort
fmt.Println("Initiating Freeing up replies to the ",len(leaders) ," leaders blocked by the client")
for i:=range leaders {
remote_FreeNode(leaders[i]) // Free up the resources reserved
}
return errors.New("Some Nodes Busy, Aborting...")
}
}
//Since everyone is ready go ahead with Transaction
for i:=range t.Keys {
if(t.Types[i]==0) {
err,Async_Call:=remote_ReadKey(all_leaders[i],t.Keys[i],0,&(t.Ret_vals[i]))
fmt.Println("Read Result :",t.Ret_vals[i])
if(err!=nil) {
fmt.Println("Initiating Freeing up replies to the ",len(leaders) ," leaders blocked by the client")
for i:=range leaders {
remote_FreeNode(leaders[i]) // Free up the resources reserved
}
log.Fatal("Unexepected Error in Transaction")
}
<-Async_Call.Done
} else {
if(t.Types[i]==1) {
err := remote_WriteKey(all_leaders[i],t.Keys[i],t.Args_vals[i],0)
if(err!=nil) {
fmt.Println("Initiating Freeing up replies to the ",len(leaders) ," leaders blocked by the client")
for i:=range leaders {
remote_FreeNode(leaders[i]) // Free up the resources reserved
}
log.Fatal("Unexepected Error in Transaction")
}
} else if (t.Types[i]==2) {
err:=remote_DeleteKey(all_leaders[i],t.Keys[i],0)
if(err!=nil) {
fmt.Println("Initiating Freeing up replies to the ",len(leaders) ," leaders blocked by the client")
for i:=range leaders {
remote_FreeNode(leaders[i]) // Free up the resources reserved
}
log.Fatal("Unexepected Error in Transaction")
}
}
}
}
fmt.Println("Initiating Freeing up replies to the ",len(leaders) ," leaders blocked by the client")
for i:=range leaders {
remote_FreeNode(leaders[i]) // Free up the resources reserved
}
*val=t.Ret_vals[len(t.Keys)-1]
return nil
}
func (ln * LocalNode) ReadKey(key string, val *string) error{
leader := new(string)
e := ln.FindSuccessor(key, leader)
if e!=nil {
return e
}
log.SetOutput(os.Stderr)
log.Println("Found leader for key : "+key+" - " + *leader)
log.SetOutput(ln.logfile)
log.Println("Found leader for key : "+key+" - " + *leader)
if (*leader==ln.Address) {
e := ln.ReadKeyLeader(key, val)
return e
}
err,Async_Call:=remote_ReadKey(*leader,key,0,val)
<-Async_Call.Done
return err
}
func (ln *LocalNode) ReadKeyLeader(key string,val *string) error {
//Trivial Load Balancing
var to_read int
to_read=(ln.Prev_read+1)%3
ln.Prev_read = ln.Prev_read+1
// ln.PrintAllMaps()
log.SetOutput(os.Stderr)
log.Println("Read Request for : "+ key + " at Node Address " + ln.Address)
log.SetOutput(ln.logfile)
log.Println("Read Request for : "+ key + " at Node Address " + ln.Address)
ln.Prev_read++
if to_read==0 || ln.successors[0]==nil || ln.successors[0].Address==ln.Address{
var ok bool
*val, ok = ln.data[0][key]
if ok == false{
return errors.New("Key not present in the store")
}
log.SetOutput(os.Stderr)
log.Println("Read key: "+ key + " value : " + *val +" Node Address " + ln.Address)
log.SetOutput(ln.logfile)
log.Println("Read key: "+ key + " value : " + *val +" Node Address " + ln.Address)
} else {
if to_read==1 || ln.successors[1]==nil || ln.successors[1].Address==ln.Address {
err,Async_Call:=remote_ReadKey(ln.successors[0].Address,key,1,val)
<-Async_Call.Done
return err
} else {
err,Async_Call:=remote_ReadKey(ln.successors[1].Address,key,2,val)
<-Async_Call.Done
return err
}
}
return nil
}
func (ln *LocalNode) ReadKeyReplica(key string, replica_num int, val *string) error{
var ok bool
*val, ok = ln.data[replica_num][key]
// PrintMap(ln.data[replica_num])
// ln.PrintAllMaps()
if ok == false{
return errors.New("Key not present in the store")
}
log.SetOutput(os.Stderr)
log.Println("Read key: "+ key + " value : " + *val +" Node Address " + ln.Address)
log.SetOutput(ln.logfile)
log.Println("Read key: "+ key + " value : " + *val+ " Node Address " + ln.Address)
return nil
}
func Client_remoteWrite(address string, key string, val string) error {
e := remote_WriteKey(address,key,val,4)
return e
}
func (ln *LocalNode) WriteKey(key string, val string) error{
var leader string
e := ln.FindSuccessor(key, &leader)
if e!=nil {
return e
}
log.SetOutput(os.Stderr)
log.Println("Found leader for key : "+key+" - " + leader)
log.SetOutput(ln.logfile)
log.Println("Found leader for key : "+key+" - " + leader)
if (leader==ln.Address) {
e = ln.WriteKeyLeader(key, val)
return e
}
e = remote_WriteKey(leader,key,val,0)
return e
}
func (ln * LocalNode) WriteKeyLeader(key string, val string) error{
ln.data[0][key] = val
log.SetOutput(os.Stderr)
log.Println("Write key: "+ key + " value : " + val + " On Node Address " + ln.Address)
log.SetOutput(ln.logfile)
log.Println("Write key: "+ key + " value : " + val + " On Node Address " + ln.Address)
//check successor exists
if (ln.successors[0]!=nil && ln.successors[0].Address!=ln.Address) {
e0 := remote_WriteKey(ln.successors[0].Address,key,val,1)
if e0!= nil {
return e0
}
}
if (ln.successors[1]!=nil && ln.successors[1].Address!=ln.Address) {
e1 := remote_WriteKey(ln.successors[1].Address,key,val,2)
if e1!= nil {
return e1
}
}
return nil
}
func (ln * LocalNode) WriteKeySuccessor(key string, val string, replica_number int) error{
if len(ln.data) < replica_number {
return errors.New("Not enough replicas")
}
ln.data[replica_number][key] = val
log.SetOutput(os.Stderr)
log.Println("Write key: "+ key + " value : " + val + " On Node Address " + ln.Address)
log.SetOutput(ln.logfile)
log.Println("Write key: "+ key + " value : " + val + " On Node Address " + ln.Address)
return nil
}
func Client_remoteDelete(address string, key string) error {
remote_DeleteKey(address,key,4)
return nil
}
func (ln *LocalNode) DeleteKey(key string) error{
var leader string
e := ln.FindSuccessor(key, &leader)
if e!=nil {
return e
}
log.SetOutput(os.Stderr)
log.Println("Found successor for key : "+key+" - " + leader)
log.SetOutput(ln.logfile)
log.Println("Found successor for key : "+key+" - " + leader)
if (leader==ln.Address) {
ln.DeleteKeyLeader(key)
return nil
}
e = remote_DeleteKey(leader,key,0)
return e
}
func (ln * LocalNode) DeleteKeyLeader(key string) error{
_ , ok := ln.data[0][key]
if ok == false{
return errors.New("Key not present in Leader")
}
delete(ln.data[0],key)
log.SetOutput(os.Stderr)
log.Println("Delete key: "+ key)
log.SetOutput(ln.logfile)
log.Println("Delete key: "+ key)
//check successor exists
if (ln.successors[0]!=nil && ln.successors[0].Address!=ln.Address) {
e0 := remote_DeleteKey(ln.successors[0].Address,key,1)
if e0!= nil {
return e0
}
}
if (ln.successors[1]!=nil && ln.successors[1].Address!=ln.Address) {
e1 := remote_DeleteKey(ln.successors[1].Address,key,2)
if e1!= nil {
return e1
}
}
return nil
}
func (ln * LocalNode) DeleteKeySuccessor(key string, replica_number int) error{
if len(ln.data) < replica_number {
return errors.New("Not enough replicas")
}
_ , ok := ln.data[replica_number][key]
if ok == false{
return errors.New("Key not present in replica" + strconv.Itoa(replica_number))
}
delete(ln.data[replica_number],key)
log.SetOutput(os.Stderr)
log.Println("Delete key: "+ key)
log.SetOutput(ln.logfile)
log.Println("Delete key: "+ key)
return nil
}