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
|
#include "swarmkv_common.h"
#include "swarmkv_utils.h"
#include "sds.h"
#include "uthash.h"
#include "utarray.h"
struct sync_data
{
int ref_cnt;
sds key;
char *blob;
size_t blob_sz;
};
struct sync_data *sync_data_new(const sds key, char *blob, size_t blob_sz)
{
struct sync_data *data = ALLOC(struct sync_data, 1);
data->key = sdsdup(key);
data->blob = blob;
data->blob_sz = blob_sz;
data->ref_cnt = 1;
return data;
}
void sync_data_ref_inc(struct sync_data *data)
{
data->ref_cnt++;
return;
}
void sync_data_free(struct sync_data *data)
{
data->ref_cnt--;
if (data->ref_cnt == 0)
{
sdsfree(data->key);
free(data->blob);
data->blob_sz = 0;
free(data);
}
return;
}
UT_icd ut_sync_data_pointer_icd = {sizeof(struct sync_data **), NULL, NULL, NULL};
struct sync_task
{
node_t peer;
UT_array *sync_data_list;
UT_hash_handle hh;
};
struct sync_master
{
struct sync_task *task_table;
long long to_sync;
long long synced;
};
struct sync_master *sync_master_new(void)
{
struct sync_master *master = ALLOC(struct sync_master, 1);
return master;
}
// add_obj take the ownership of the blob
void sync_master_add_obj(struct sync_master *master, const sds key, char *blob, size_t blob_sz, const node_t *peers, size_t n_peer)
{
struct sync_task *task = NULL;
struct sync_data *data = NULL;
data = sync_data_new(key, blob, blob_sz);
for (size_t i = 0; i < n_peer; i++)
{
HASH_FIND(hh, master->task_table, peers + i, sizeof(node_t), task);
if (!task)
{
task = ALLOC(struct sync_task, 1);
node_copy(&task->peer, peers + i);
utarray_new(task->sync_data_list, &ut_sync_data_pointer_icd);
HASH_ADD_KEYPTR(hh, master->task_table, &task->peer, sizeof(node_t), task);
}
sync_data_ref_inc(data);
utarray_push_back(task->sync_data_list, &data);
}
// dereference data
sync_data_free(data);
master->to_sync += n_peer;
return;
}
struct sync_task *sync_master_get_task(struct sync_master *master)
{
struct sync_task *task = NULL, *tmp = NULL;
// We are not iterating the whole table, just get the first one
HASH_ITER(hh, master->task_table, task, tmp)
{
HASH_DEL(master->task_table, task);
master->synced += utarray_len(task->sync_data_list);
break;
}
return task;
}
void sync_task_free(struct sync_task *task)
{
struct sync_data **p = NULL, *data = NULL;
size_t n_data = utarray_len(task->sync_data_list);
for (size_t i = 0; i < n_data; i++)
{
p = utarray_eltptr(task->sync_data_list, i);
data = *p;
sync_data_free(data);
}
utarray_free(task->sync_data_list);
free(task);
return;
}
const node_t *sync_task_peer(struct sync_task *task)
{
return &task->peer;
}
size_t sync_task_key_count(struct sync_task *task)
{
return utarray_len(task->sync_data_list);
}
void sync_task_read_key_blob(struct sync_task *task, const char *argv[], size_t *argv_len, int argc)
{
struct sync_data **p = NULL, *data = NULL;
int n_data = utarray_len(task->sync_data_list);
assert(argc == 2 * n_data);
for (int i = 0, j = 0; i < n_data && j < argc; i++, j += 2)
{
p = utarray_eltptr(task->sync_data_list, i);
data = *p;
assert(data->key);
assert(data->blob);
argv[j] = data->key;
argv_len[j] = sdslen(data->key);
argv[j + 1] = data->blob;
argv_len[j + 1] = data->blob_sz;
}
return;
}
void sync_master_free(struct sync_master *master)
{
size_t __attribute__((__unused__)) task_cnt = HASH_COUNT(master->task_table);
assert(task_cnt == 0);
assert(master->to_sync == master->synced);
free(master);
return;
}
|
