-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathanalysis.c
319 lines (268 loc) · 6.46 KB
/
analysis.c
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
#include "analysis.h"
static __thread analysis a;
//将数据流打包成package,并压入队列,返回压入队列的package数量,支持并发
//不确定传输结构体时,不同平台下的结构体数据格式是否相同
int _analysis_pack(queue *q, void *data, __int64 len, int sign)
{
static int id = 0;
if(sign & ANALYSIS_INIT)
{
__sync_fetch_and_add(&id, 1);
a.attr = *(analysis_attr *)data;
a.p = NULL;
a.id = 0;
a.offset_len = 0;
a.remain_len = PACKAGE_SIZE;
memset(a.prefix, 0, PACKAGE_SIZE);
a.prefix_len = 0;
return TRUE;
}
if(sign & ANALYSIS_NEW)
{
//如果是开头的话则不做处理
if(a.offset_len != a.prefix_len)
{
queue_put(q, a.p, -1);
a.p = NULL;
}
}
if(!a.p)
{
//创建一个新的包,如果有前缀,则加上前缀
a.p = package_malloc();
a.p->task.id = id;
a.p->task.empty = FALSE;
a.p->task.cache = a.attr.task.cache;
a.p->task.retrans = a.attr.task.retrans;
a.p->task.type = a.attr.task.type;
a.p->task.compress = a.attr.task.compress;
a.p->task.encrypt = a.attr.task.encrypt;
a.p->task.state = PACKAGE_TASK_STATE_NORMAL;
a.p->info.id = a.id++;
a.p->info.num = a.attr.info.num;
package_set_info(a.p);
package_set_task(a.p);
if(a.prefix_len > 0)
memcpy(a.p->data, a.prefix, a.prefix_len);
a.offset_len = a.prefix_len;
a.remain_len = PACKAGE_SIZE - a.prefix_len;
}
if(len > 0)
{
memcpy((void *)a.p->data + a.offset_len, data, len);
a.offset_len += len;
a.remain_len -= len;
}
if(!a.prefix_len && sign & ANALYSIS_PREFIX)
{
//前缀只在第一次设置有效
a.prefix_len = PACKAGE_SIZE - a.remain_len;
memcpy(a.prefix, a.p->data, a.prefix_len);
}
if(sign & ANALYSIS_END | sign & ANALYSIS_CANCEL | sign & ANALYSIS_ERROR)
{
//结束时将包压入传输队列
if(sign & ANALYSIS_END)
a.p->task.state = PACKAGE_TASK_STATE_FINISH;
else if(sign & ANALYSIS_CANCEL)
a.p->task.state = PACKAGE_TASK_STATE_CANCEL;
else if(sign & ANALYSIS_ERROR)
a.p->task.state = PACKAGE_TASK_STATE_ERROR;
package_set_task(a.p);
queue_put(q, a.p, -1);
a.p = NULL;
memset(a.prefix, 0, PACKAGE_SIZE);
a.prefix_len = 0;
}
return TRUE;
}
//需要保证不能超过package长度
int analysis_pack(queue *q, void *data, __int64 len, int sign)
{
__int64 d;
if(sign & ANALYSIS_INIT)
_analysis_pack(q, data, len, sign);
else if(sign & ANALYSIS_FINISH)
_analysis_pack(q, NULL, 0, ANALYSIS_END);
else if(sign & ANALYSIS_CANCEL)
_analysis_pack(q, NULL, 0, ANALYSIS_CANCEL);
else if(sign & ANALYSIS_ERROR)
_analysis_pack(q, NULL, 0, ANALYSIS_ERROR);
else
{
if(data)
{
//大于整个package的大小
if(sizeof(d) + len > PACKAGE_SIZE - a.prefix_len)
return FALSE;
//大于package剩余大小
if(!(sign & ANALYSIS_NEW))
if(sizeof(d) + len > a.remain_len)
sign |= ANALYSIS_NEW;
d = len + ((__int64)ANALYSIS_STR << ANALYSIS_MAX);
_analysis_pack(q, &d, sizeof(d), sign & ANALYSIS_NEW);
_analysis_pack(q, data, len, sign & (ANALYSIS_END | ANALYSIS_PREFIX));
}
else
{
//大于package剩余大小
if(!(sign & ANALYSIS_NEW))
if(sizeof(d) > a.remain_len)
sign |= ANALYSIS_NEW;
d = len + ((__int64)ANALYSIS_INT << ANALYSIS_MAX);
_analysis_pack(q, &d, sizeof(d), sign);
}
}
return TRUE;
}
/*
出现数据异常时跳过该package
返回FALSE时说明该package结束
出错后等读取下一个package时释放
*/
int analysis_unpack(queue *q, void **data, __int64 *len, int sign)
{
__int64 d;
int type;
if(sign & ANALYSIS_FREE)
{
if(a.p)
{
package_free(a.p);
a.p = NULL;
}
return TRUE;
}
if(sign & ANALYSIS_RESET)
{
queue_put(q, a.p, -1);
a.p = NULL;
return TRUE;
}
if(!a.p)
{
queue_get(q, a.p, -1);
a.offset_len = 0;
a.remain_len = PACKAGE_SIZE;
}
if(a.remain_len < sizeof(d)) //保证d的完整
return FALSE;
d = *(__int64 *)((void *)a.p->data + a.offset_len);
a.offset_len += sizeof(d);
a.remain_len -= sizeof(d);
if(!d)
return FALSE;
type = d >> ANALYSIS_MAX;
d &= PACKAGE_MASK(ANALYSIS_MAX);
if(type != sign & (ANALYSIS_INT | ANALYSIS_STR))
return FALSE;
switch(type)
{
case ANALYSIS_INT:
*data = NULL;
*len = d;
break;
case ANALYSIS_STR:
*data = (void *)a.p->data + a.offset_len;
*len = d;
a.offset_len += d;
a.remain_len -= d;
if(a.remain_len < 0)
return FALSE;
break;
}
return TRUE;
}
inline package *analysis_package()
{
return a.p;
}
//获取能填入的最大数据长度,必须保证填入该长度的数据后,package刚好填满
//主要用于读取文件时获取文件块的长度
inline int analysis_remain()
{
return a.remain_len;
}
//根据type将包压入对应的队列,队列储存在hash中,key为type值对应的字符串,不存在则创建
//后台运行
static dict *d = NULL;
int analysis_allocate(queue *q)
{
queue *tq;
package *p;
char key[16];
if(d == NULL)
d = dict_new();
while(1)
{
queue_get(q, p, -1);
sprintf(key, "%d", p->task.type);
tq = dict_get(d, key);
if(!tq)
{
tq = queue_init(0);
dict_set(d, key, tq);
}
queue_put(tq, p, -1);
}
}
queue *analysis_queue(int type)
{
char key[16];
if(d == NULL)
return NULL;
sprintf(key, "%d", type);
return dict_get(d, key);
}
#ifdef TEST
#include "test.h"
void analysis_test_1(queue *q)
{
analysis_attr attr =
{
.task =
{
.cache = FALSE,
.retrans = FALSE,
.type = 0, //任务类型
.compress = 0, //压缩算法,没有时置空
.encrypt = 0 //加密方式,没有时置空
},
.info =
{
.num = 0 //包的总数量,不能获得时置空
}
};
analysis_pack(q, &attr, 0, ANALYSIS_INIT);
analysis_pack(q, "abc", 3, ANALYSIS_PREFIX);
analysis_pack(q, "def", 3, 0);
analysis_pack(q, NULL, 123, ANALYSIS_NEW);
analysis_pack(q, NULL, 0, ANALYSIS_FINISH);
}
void analysis_test_2(queue *q)
{
char s[16];
void *data;
__int64 len;
analysis_unpack(q, &data, &len, ANALYSIS_STR);
sprintf(s, "%.*s", len, data);
test_assert(s, "abc", 's', TEST_EQUAL);
analysis_unpack(q, &data, &len, ANALYSIS_STR);
sprintf(s, "%.*s", len, data);
test_assert(s, "def", 's', TEST_EQUAL);
analysis_unpack(q, NULL, NULL, ANALYSIS_FREE);
analysis_unpack(q, &data, &len, ANALYSIS_STR);
sprintf(s, "%.*s", len, data);
test_assert(s, "abc", 's', TEST_EQUAL);
analysis_unpack(q, &data, &len, ANALYSIS_INT);
test_assert(len, 123, 'd', TEST_EQUAL);
analysis_unpack(q, NULL, NULL, ANALYSIS_FREE);
}
void analysis_test()
{
queue *q = queue_init(0);
analysis_test_1(q);
analysis_test_2(q);
queue_destroy(q);
}
#endif