File: datastores_changes.go

package info (click to toggle)
golang-github-stacktic-dropbox 0.0~git20160424.0.58f839b-3
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 192 kB
  • sloc: makefile: 2
file content (516 lines) | stat: -rw-r--r-- 10,899 bytes parent folder | download | duplicates (3)
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
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
/*
** Copyright (c) 2014 Arnaud Ysmal.  All Rights Reserved.
**
** Redistribution and use in source and binary forms, with or without
** modification, are permitted provided that the following conditions
** are met:
** 1. Redistributions of source code must retain the above copyright
**    notice, this list of conditions and the following disclaimer.
** 2. Redistributions in binary form must reproduce the above copyright
**    notice, this list of conditions and the following disclaimer in the
**    documentation and/or other materials provided with the distribution.
**
** THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS
** OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
** WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
** DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
** FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
** DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
** SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
** HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
** LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
** OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
** SUCH DAMAGE.
 */

package dropbox

import (
	"fmt"
	"reflect"
)

type value struct {
	values []interface{}
	isList bool
}

type fieldOp struct {
	Op     string
	Index  int
	Index2 int
	Data   value
}

type opDict map[string]fieldOp

type change struct {
	Op       string
	TID      string
	RecordID string
	Ops      opDict
	Data     Fields
	Revert   *change
}
type listOfChanges []*change

type changeWork struct {
	c   *change
	out chan error
}

const (
	recordDelete = "D"
	recordInsert = "I"
	recordUpdate = "U"
	fieldDelete  = "D"
	fieldPut     = "P"
	listCreate   = "LC"
	listDelete   = "LD"
	listInsert   = "LI"
	listMove     = "LM"
	listPut      = "LP"
)

func newValueFromInterface(i interface{}) *value {
	if a, ok := i.([]byte); ok {
		return &value{
			values: []interface{}{a},
			isList: false,
		}
	}
	if reflect.TypeOf(i).Kind() == reflect.Slice || reflect.TypeOf(i).Kind() == reflect.Array {
		val := reflect.ValueOf(i)
		v := &value{
			values: make([]interface{}, val.Len()),
			isList: true,
		}
		for i := range v.values {
			v.values[i] = val.Index(i).Interface()
		}
		return v
	}
	return &value{
		values: []interface{}{i},
		isList: false,
	}
}

func newValue(v *value) *value {
	var nv *value

	nv = &value{
		values: make([]interface{}, len(v.values)),
		isList: v.isList,
	}
	copy(nv.values, v.values)
	return nv
}

func newFields(f Fields) Fields {
	var n Fields

	n = make(Fields)
	for k, v := range f {
		n[k] = *newValue(&v)
	}
	return n
}

func (ds *Datastore) deleteRecord(table, record string) error {
	return ds.handleChange(&change{
		Op:       recordDelete,
		TID:      table,
		RecordID: record,
	})
}

func (ds *Datastore) insertRecord(table, record string, values Fields) error {
	return ds.handleChange(&change{
		Op:       recordInsert,
		TID:      table,
		RecordID: record,
		Data:     newFields(values),
	})
}

func (ds *Datastore) updateFields(table, record string, values map[string]interface{}) error {
	var dsval opDict

	dsval = make(opDict)
	for k, v := range values {
		dsval[k] = fieldOp{
			Op:   fieldPut,
			Data: *newValueFromInterface(v),
		}
	}
	return ds.handleChange(&change{
		Op:       recordUpdate,
		TID:      table,
		RecordID: record,
		Ops:      dsval,
	})
}

func (ds *Datastore) updateField(table, record, field string, i interface{}) error {
	return ds.updateFields(table, record, map[string]interface{}{field: i})
}

func (ds *Datastore) deleteField(table, record, field string) error {
	return ds.handleChange(&change{
		Op:       recordUpdate,
		TID:      table,
		RecordID: record,
		Ops: opDict{
			field: fieldOp{
				Op: fieldDelete,
			},
		},
	})
}

func (ds *Datastore) listCreate(table, record, field string) error {
	return ds.handleChange(&change{
		Op:       recordUpdate,
		TID:      table,
		RecordID: record,
		Ops: opDict{
			field: fieldOp{
				Op: listCreate,
			},
		},
	})
}

func (ds *Datastore) listDelete(table, record, field string, pos int) error {
	return ds.handleChange(&change{
		Op:       recordUpdate,
		TID:      table,
		RecordID: record,
		Ops: opDict{
			field: fieldOp{
				Op:    listDelete,
				Index: pos,
			},
		},
	})
}

func (ds *Datastore) listInsert(table, record, field string, pos int, i interface{}) error {
	return ds.handleChange(&change{
		Op:       recordUpdate,
		TID:      table,
		RecordID: record,
		Ops: opDict{
			field: fieldOp{
				Op:    listInsert,
				Index: pos,
				Data:  *newValueFromInterface(i),
			},
		},
	})
}

func (ds *Datastore) listMove(table, record, field string, from, to int) error {
	return ds.handleChange(&change{
		Op:       recordUpdate,
		TID:      table,
		RecordID: record,
		Ops: opDict{
			field: fieldOp{
				Op:     listMove,
				Index:  from,
				Index2: to,
			},
		},
	})
}

func (ds *Datastore) listPut(table, record, field string, pos int, i interface{}) error {
	return ds.handleChange(&change{
		Op:       recordUpdate,
		TID:      table,
		RecordID: record,
		Ops: opDict{
			field: fieldOp{
				Op:    listPut,
				Index: pos,
				Data:  *newValueFromInterface(i),
			},
		},
	})
}

func (ds *Datastore) handleChange(c *change) error {
	var out chan error

	if ds.changesQueue == nil {
		return fmt.Errorf("datastore is closed")
	}
	out = make(chan error)
	ds.changesQueue <- changeWork{
		c:   c,
		out: out,
	}
	return <-out
}

func (ds *Datastore) doHandleChange() {
	var err error
	var c *change

	q := ds.changesQueue
	for cw := range q {
		c = cw.c

		if err = ds.validateChange(c); err != nil {
			cw.out <- err
			continue
		}
		if c.Revert, err = ds.inverseChange(c); err != nil {
			cw.out <- err
			continue
		}

		if err = ds.applyChange(c); err != nil {
			cw.out <- err
			continue
		}

		ds.changes = append(ds.changes, c)

		if ds.autoCommit {
			if err = ds.Commit(); err != nil {
				cw.out <- err
			}
		}
		close(cw.out)
	}
}

func (ds *Datastore) validateChange(c *change) error {
	var t *Table
	var r *Record
	var ok bool

	if t, ok = ds.tables[c.TID]; !ok {
		t = &Table{
			datastore: ds,
			tableID:   c.TID,
			records:   make(map[string]*Record),
		}
	}

	r = t.records[c.RecordID]

	switch c.Op {
	case recordInsert, recordDelete:
		return nil
	case recordUpdate:
		if r == nil {
			return fmt.Errorf("no such record: %s", c.RecordID)
		}
		for field, op := range c.Ops {
			if op.Op == fieldPut || op.Op == fieldDelete {
				continue
			}
			v, ok := r.fields[field]
			if op.Op == listCreate {
				if ok {
					return fmt.Errorf("field %s already exists", field)
				}
				continue
			}
			if !ok {
				return fmt.Errorf("no such field: %s", field)
			}
			if !v.isList {
				return fmt.Errorf("field %s is not a list", field)
			}
			maxIndex := len(v.values) - 1
			if op.Op == listInsert {
				maxIndex++
			}
			if op.Index > maxIndex {
				return fmt.Errorf("out of bound access index %d on [0:%d]", op.Index, maxIndex)
			}
			if op.Index2 > maxIndex {
				return fmt.Errorf("out of bound access index %d on [0:%d]", op.Index, maxIndex)
			}
		}
	}
	return nil
}

func (ds *Datastore) applyChange(c *change) error {
	var t *Table
	var r *Record
	var ok bool

	if t, ok = ds.tables[c.TID]; !ok {
		t = &Table{
			datastore: ds,
			tableID:   c.TID,
			records:   make(map[string]*Record),
		}
		ds.tables[c.TID] = t
	}

	r = t.records[c.RecordID]

	switch c.Op {
	case recordInsert:
		t.records[c.RecordID] = &Record{
			table:    t,
			recordID: c.RecordID,
			fields:   newFields(c.Data),
		}
	case recordDelete:
		if r == nil {
			return nil
		}
		r.isDeleted = true
		delete(t.records, c.RecordID)
	case recordUpdate:
		for field, op := range c.Ops {
			v, ok := r.fields[field]
			switch op.Op {
			case fieldPut:
				r.fields[field] = *newValue(&op.Data)
			case fieldDelete:
				if ok {
					delete(r.fields, field)
				}
			case listCreate:
				if !ok {
					r.fields[field] = value{isList: true}
				}
			case listDelete:
				copy(v.values[op.Index:], v.values[op.Index+1:])
				v.values = v.values[:len(v.values)-1]
				r.fields[field] = v
			case listInsert:
				v.values = append(v.values, op.Data)
				copy(v.values[op.Index+1:], v.values[op.Index:len(v.values)-1])
				v.values[op.Index] = op.Data.values[0]
				r.fields[field] = v
			case listMove:
				val := v.values[op.Index]
				if op.Index < op.Index2 {
					copy(v.values[op.Index:op.Index2], v.values[op.Index+1:op.Index2+1])
				} else {
					copy(v.values[op.Index2+1:op.Index+1], v.values[op.Index2:op.Index])
				}
				v.values[op.Index2] = val
				r.fields[field] = v
			case listPut:
				r.fields[field].values[op.Index] = op.Data.values[0]
			}
		}
	}
	return nil
}

func (ds *Datastore) inverseChange(c *change) (*change, error) {
	var t *Table
	var r *Record
	var ok bool
	var rev *change

	if t, ok = ds.tables[c.TID]; !ok {
		t = &Table{
			datastore: ds,
			tableID:   c.TID,
			records:   make(map[string]*Record),
		}
		ds.tables[c.TID] = t
	}

	r = t.records[c.RecordID]

	switch c.Op {
	case recordInsert:
		return &change{
			Op:       recordDelete,
			TID:      c.TID,
			RecordID: c.RecordID,
		}, nil
	case recordDelete:
		if r == nil {
			return nil, nil
		}
		return &change{
			Op:       recordInsert,
			TID:      c.TID,
			RecordID: c.RecordID,
			Data:     newFields(r.fields),
		}, nil
	case recordUpdate:
		rev = &change{
			Op:       recordUpdate,
			TID:      c.TID,
			RecordID: c.RecordID,
			Ops:      make(opDict),
		}
		for field, op := range c.Ops {
			switch op.Op {
			case fieldPut:
				if v, ok := r.fields[field]; ok {
					rev.Ops[field] = fieldOp{
						Op:   fieldPut,
						Data: *newValue(&v),
					}
				} else {
					rev.Ops[field] = fieldOp{
						Op: fieldDelete,
					}
				}
			case fieldDelete:
				if v, ok := r.fields[field]; ok {
					rev.Ops[field] = fieldOp{
						Op:   fieldPut,
						Data: *newValue(&v),
					}
				}
			case listCreate:
				if _, ok := r.fields[field]; !ok {
					rev.Ops[field] = fieldOp{
						Op: fieldDelete,
					}
				}
			case listDelete:
				v := r.fields[field]
				rev.Ops[field] = fieldOp{
					Op:    listInsert,
					Index: op.Index,
					Data: value{
						values: []interface{}{v.values[op.Index]},
						isList: false,
					},
				}
			case listInsert:
				rev.Ops[field] = fieldOp{
					Op:    listDelete,
					Index: op.Index,
				}
			case listMove:
				rev.Ops[field] = fieldOp{
					Op:     listMove,
					Index:  op.Index2,
					Index2: op.Index,
				}
			case listPut:
				v := r.fields[field]
				rev.Ops[field] = fieldOp{
					Op:    listPut,
					Index: op.Index,
					Data: value{
						values: []interface{}{v.values[op.Index]},
						isList: false,
					},
				}
			}
		}
	}
	return rev, nil
}