forked from DNSPod/dnspod-sr
/
author.c
1255 lines (1195 loc) · 39.1 KB
/
author.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
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
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/* Copyright (c) 2006-2012, DNSPod Inc.
* 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 COPYRIGHT HOLDERS AND CONTRIBUTORS "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 COPYRIGHT OWNER 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.
* The views and conclusions contained in the software and documentation are those
* of the authors and should not be interpreted as representing official policies,
* either expressed or implied, of the FreeBSD Project.
*/
#include "author.h"
//get random number from a buffer
//it's faster than invoke function random every time
//no lock, author use it's own data
int
get_random_int_from_author(struct author *author)
{
int val = 0;
char *ret = NULL;
if (author->rndidx + sizeof(int) >= RANDOM_SIZE) {
//read from /dev/urandom
get_random_data(author->randombuffer, RANDOM_SIZE);
author->rndidx = 0;
}
val = *(int *) (author->randombuffer + author->rndidx);
author->rndidx += sizeof(int);
return val;
}
//for tcp
//add to list, sentinel will delete this in the main event loop
int
delete_close_event(int fd, struct fetcher *f)
{
struct list *el = NULL;
struct list_node *nd = NULL;
el = f->el;
if (el == NULL)
return -1;
if ((nd = malloc(sizeof(struct list_node))) == NULL)
return -1;
nd->data = malloc(sizeof(int));
if (nd->data == NULL) {
free(nd);
return -1;
}
memcpy(nd->data, &fd, sizeof(int));
pthread_mutex_lock(&el->lock);
nd->next = el->head;
el->head = nd;
pthread_mutex_unlock(&el->lock);
return 0;
}
int
send_msg_to_client(struct sockinfo *cli, uchar * td, ushort id,
uchar * msg)
{
struct mvalue *mv = NULL;
uchar *itor = NULL;
dnsheader *hdr = NULL;
uint32_t *pttl = NULL, ttl = 0;
uint16_t *pttloff = NULL;
int i;
uchar msgbuf[65536] = { 0 };
itor = msg + 1; //databuffer format
//type.mvalue.msg
mv = (struct mvalue *) itor;
itor += sizeof(struct mvalue); //jump mvalue
pttloff = (uint16_t *) itor;
itor += mv->seg * sizeof(uint16_t); //jump ttloff
cli->buf = itor;
cli->buflen = mv->len;
hdr = (dnsheader *) itor;
hdr->id = id;
ttl = mv->ttl - global_now;
ttl = htonl(ttl);
for (i = 0; i < mv->seg; i++) {
pttl = (uint32_t *) (itor + pttloff[i]);
*pttl = ttl;
}
//printf("msg:%u\n",mv->len);
//for(i = 0;i < mv->len;i ++)
//printf("%x,",itor[i]);
//printf("\n");
//////////////////////////////////////////////////////
if (cli->socktype == UDP) {
if (mv->len > MAX_UDP_SIZE)
send_tc_to_client(td, cli, id);
else
udp_write_info(cli, 0); //ignore send error
} else {
//first two bytes are length of msg
memcpy(msgbuf + 2, itor, mv->len);
*(ushort *) msgbuf = htons(mv->len);
cli->buflen = mv->len + 2;
cli->buf = msgbuf;
tcp_write_info(cli, 0);
}
return 0;
}
//databuffer format
//type.mvalue.data.type.mvalue.data...
int
write_back_to_client(uchar * msgto, uchar * td, ushort id, int dlen,
struct sockinfo *cli, uchar * fr, int vlen)
{
struct setheader sh = { 0 }; //data in dns header
int i, num = 0, main = 0, dnslen = 0;
uchar msg[1000] = { 0 }, type; //if bigger, use TCP
uchar *from = fr, *to = msg + 2, *tag;
struct mvalue *mv = NULL;
int jump = 0, msglen = 512, ret;
uint16_t ttloff[MAX_MSG_SEG + 1] = { 0 }; //zero ele is idx
struct hlpc hlp[200] = { 0 }; //p domians to compression
hlp[0].name = td + 1;
hlp[0].off = sizeof(dnsheader);
hlp[0].level = get_level(hlp[0].name);
hlp[0].ref = -1;
hlp[0].mt = 0;
jump = sizeof(dnsheader) + dlen + sizeof(qdns);
to = to + jump;
while (vlen > 1) //vlen include type.mvalue.data.
{
type = from[0];
mv = (struct mvalue *) (from + 1);
to = fill_rrset_in_msg(hlp, from, to, main, msg + 2, ttloff);
if (to == NULL)
return -1;
vlen = vlen - 1 - mv->len - sizeof(struct mvalue);
sh.an += mv->num;
if (type == CNAME) //cname must be 1
main++; //no all rdata is the cname's
from = from + mv->len + 1 + sizeof(struct mvalue); // type.mv.len.
}
sh.itor = msg + 2;
sh.od = td + 1;
sh.id = id;
sh.type = td[0];
fill_header_in_msg(&sh);
dnslen = to - (msg + 2);
cli->buf = msg + 2;
cli->buflen = dnslen;
if (cli->socktype == UDP) {
if (dnslen > MAX_UDP_SIZE)
send_tc_to_client(td, cli, id);
else
udp_write_info(cli, 0); //ignore send error
} else {
*(ushort *) msg = htons(dnslen);
cli->buflen = dnslen + 2;
cli->buf = msg;
tcp_write_info(cli, 0);
}
////////////////////////////////////////////////////////////
//key, val, vallen, ttl offset
//if now + TTL_UPDATE > ttl
//return
ret = transfer_record_to_msg(msgto, td, msg + 2, dnslen, ttloff);
if (ret < 0)
return -1;
return 0;
}
//process a segment of data
int
passer_related_data(struct sockinfo *si, struct qoutinfo *qo,
struct author *author)
{
uchar *buf = si->buf, *tail = NULL;
int len = sizeof(struct sockaddr_in), stype = 0, ret, seg;
uint idx = 0;
uchar dms[50 * DMS_SIZE] = { 0 };
struct rbtree *rbt;
int datalen = 0, debugu = 0, i, tag;
uchar *tmptail, xtag;
ushort n, type, class;
struct hlpp hlp;
dnsheader *hdr = (dnsheader *) buf;
ret = check_dns_name(buf + sizeof(dnsheader), &seg);
if (ret < 0)
return -1;
if (check_domain_mask(buf + sizeof(dnsheader), qo->qing) < 0)
return -1;
hlp.dmsidx = 1;
memcpy(dms, qo->qing, strlen(qo->qing) + 1);
tail = buf + sizeof(dnsheader) + ret; //domain len
type = ntohs(*(ushort *) tail);
class = ntohs(*(ushort *) (tail + 2));
tail = tail + 4;
datalen = si->buflen;
rbt = author->s->ttlexp;
n = ntohs(hdr->ancount);
hlp.stype = &stype;
hlp.ds = author->s->datasets;
hlp.rbt = rbt;
hlp.buf = buf;
hlp.datalen = datalen;
hlp.dms = dms;
if (n > 0) {
hlp.section = AN_SECTION;
tail = process_rdata(&hlp, tail, n);
if (tail == NULL)
return -1;
}
n = ntohs(hdr->nscount);
if (n > 0) {
hlp.section = NS_SECTION;
tail = process_rdata(&hlp, tail, n);
if (tail == NULL)
return -1;
}
n = ntohs(hdr->arcount);
if (n > 0) {
hlp.section = AR_SECTION;
tail = process_rdata(&hlp, tail, n);
if (tail == NULL)
return -1;
}
return stype;
}
int
send_msg_tcp(struct author *author, int fd)
{
struct qoutinfo *qo = NULL;
ushort id, type;
uchar buffer[512] = { 0 };
int len, i, st = 0, ret;
struct sockinfo si;
ret = author->eptcpfds[fd];
if (ret <= 0)
return -1;
qo = author->list[ret];
if (qo == NULL)
return -1;
id = qo->aid;
type = qo->td[0];
if (qo->qname == Q_NS)
type = A;
len = make_dns_msg_for_new(buffer + 2, id, qo->qing, type);
*(ushort *) buffer = htons(len);
si.fd = fd;
si.buf = buffer;
si.buflen = len + 2;
tcp_write_info(&si, 0);
return 0;
}
//connect to server, tcp is expensive, we use 1 addr once
//do connect thing
//send thing will be done in cb_read_callback xxxx
int
query_from_auth_tcp(struct author *author, struct qoutinfo *qo)
{
struct sockinfo si;
int addridx = 0, i, st = 0;
uchar *ip = author->ip;
struct mvalue *mv = NULL;
mv = (struct mvalue *) ip;
while (mv->num > 0) {
ip += sizeof(struct mvalue);
for (i = 0; i < mv->num; i++) {
if (st == (qo->tcpnums - 1)) {
si.fd = qo->tcpfd;
make_addr_from_bin(&(si.addr), ip);
si.addr.sin_port = htons(53);
si.addr.sin_family = AF_INET;
connect_to(&si);
st = MOST_TRY_PER_QUERY + 1; //break while
}
st++;
}
ip += mv->len;
mv = (struct mvalue *) ip;
if (st > MOST_TRY_PER_QUERY)
break;
}
return 0;
}
int
query_from_auth_server(struct qoutinfo *qo, struct author *author)
{
ushort id = qo->aid, type;
uchar buffer[512] = { 0 };
uchar *ip = author->ip;
int len, i, st = 1, ret;
int maxtry = 0;
struct mvalue *mv = NULL;
struct sockinfo si;
struct sockaddr_in addr;
type = qo->td[0];
if (qo->qname == Q_NS)
type = A;
qo->mxtry++;
if (qo->socktype == UDP) {
len = make_dns_msg_for_new(buffer, id, qo->qing, type);
si.buf = buffer;
si.buflen = len;
si.fd = author->audp;
mv = (struct mvalue *) ip;
while (mv->num > 0) {
ip += sizeof(struct mvalue);
for (i = 0; i < mv->num; i++) {
make_addr_from_bin(&(si.addr), ip + i * 4); //ipv4 only
si.addr.sin_port = htons(53);
ret = udp_write_info(&si, 0);
if (ret > 0) //success
st++;
if (st > qo->mxtry)
return 0;
}
ip += mv->len;
mv = (struct mvalue *) ip;
if (st > MOST_TRY_PER_QUERY)
break;
}
}
return 0;
}
//udpate id, later msg will be droped
static int
update_id(struct qoutinfo *qo)
{
if (qo->aid + LIST_SPACE > ID_SPACE)
qo->aid = qo->aid % LIST_SPACE;
else
qo->aid = qo->aid + LIST_SPACE;
qo->backid = qo->aid;
qo->sq = 1;
return 0;
}
//clear the querying bit, free struct
int
release_qoutinfo(struct author *author, int idx)
{
int fd = -1, epfd, ret;
struct qoutinfo *qo = NULL;
struct epoll_event ev;
struct htable *qlist = NULL;
qo = author->list[idx];
epfd = author->bdepfd;
qlist = author->s->qlist;
if (qo == NULL)
return -1;
fd = qo->tcpfd;
ev.data.fd = fd;
if (fd > 0) {
author->tcpinuse--;
ret = epoll_ctl(epfd, EPOLL_CTL_DEL, fd, &ev);
author->eptcpfds[fd] = 0;
close(fd);
}
if (qo->cli)
free(qo->cli);
htable_delete(qlist, qo->td);
free(qo->td); //malloced by lock_ad_ad_t_qzer.
free(qo);
return 0;
}
int
init_qoutinfo(struct qoutinfo *qo)
{
qo->socktype = UDP;
qo->mxtry = 0;
qo->qns = 1; //default query ns.
qo->sq = 1; //default send query
return 0;
}
//-1 error
//-2 tc
//0 continue
//1 normal
int
check_enter(struct author *author, uchar * buf, int *idx, int len)
{
ushort id;
int off, ret;
int tx = 0;
struct qoutinfo *qo = NULL;
dnsheader *hdr = (dnsheader *) buf;
id = hdr->id;
off = id % LIST_SPACE;
qo = author->list[off];
if (qo == NULL || (qo->aid != id))
return 0; //late
*idx = off;
//-1 error
//1 tc
//0 normal
//2 retry
ret = check_an_msg(hdr->flags, NULL, &tx);
if (ret < 0)
return -1; //error
if (ret == 1) //tc
return -2;
if ((ret == 2) && (tx == 1)) //server error ,continue
return -3;
qo->socktype = UDP; //default
return 1;
}
//return 0,continue
//return idx > 0,delete and release qoutinfo
//return < 0,error,nothing
//0 is a valid idx,but it has a special meaning.
//so we return idx + 1. and use it minus 1
int
passer_auth_data(struct author *author, uchar * buf, struct sockinfo *si)
{
int idx, ret, pret, xret;
uchar td[256] = { 0 }, *val = NULL, *itor = NULL;
uint16_t mblen = 0, hash;
struct qoutinfo *qo = NULL;
ushort xtype = 0;
dnsheader *hdr = (dnsheader *) buf;
struct mvalue *mvp = NULL, *mv = NULL, mx;
struct sockaddr_in *addr = NULL;
//msg buffer
uchar mb[MAX_MSG_SIZE + sizeof(uint16_t)] = { 0 };
ret = check_enter(author, buf, &idx, si->buflen);
//we get tc and do NOT update id
//because some bad servers always return tc
//thus we has chance to get another answers
//then close tcp immediately, and send nothing
if (ret == -2) //tc,use tcp.
return -idx - 1;
if (ret == 0) //late msg,server refused,continue
return 0;
if (ret == -1) //error msg, delete qoutinfo
return idx + 1;
qo = author->list[idx];
qo->mxtry--;
if (ret == -3) //format error, server refused, error...
{
qo->qtimes++;
return 0;
}
pret = passer_related_data(si, qo, author);
if (pret < 0)
return 0; //error msg,continue
update_id(qo);
if (pret == CNAME && qo->td[0] == CNAME) {
if (qo->cli != NULL) {
*(ushort *) buf = qo->cid;
qo->cli->buf = buf;
qo->cli->buflen = si->buflen;
if (si->buflen > MAX_UDP_SIZE)
send_tc_to_client(qo->td, qo->cli, qo->cid);
else {
udp_write_info(qo->cli, 0); //cname..
write_log(&author->logfd, &author->lastlog, author->idx,
qo->td + 1, qo->td[0], &qo->cli->addr);
}
}
return idx + 1;
}
if (pret == CNAME || qo->qname != Q_DOMAIN) {
qo->stat = PROCESS_QUERY;
qo->socktype = UDP; //if prev we use tcp, use udp again
return 0;
}
if ((pret == SOA) || (ntohs(hdr->ancount) > 0)) {
if (qo->cli != NULL) {
if (qo->hascname == 0) {
*(ushort *) buf = qo->cid; //no need to htons
qo->cli->buf = buf;
qo->cli->buflen = si->buflen;
if (si->buflen > MAX_UDP_SIZE)
send_tc_to_client(qo->td, qo->cli, qo->cid);
else {
udp_write_info(qo->cli, 0);
write_log(&author->logfd, &author->lastlog,
author->idx, qo->td + 1, qo->td[0],
&qo->cli->addr);
}
} else //has a cname,put the origin domain first
{
if (pret == SOA) {
xtype = qo->td[0];
qo->td[0] = CNAME;
}
ret =
find_record_from_mem(qo->td, qo->dlen,
author->s->datasets,
author->databuffer);
if (pret == SOA)
qo->td[0] = xtype;
if (ret > 0) {
mv = (struct mvalue *) (author->databuffer + 1);
author->response++;
if (qo->cli) {
xret =
write_back_to_client(mb, qo->td, qo->cid,
qo->dlen, qo->cli,
author->databuffer, ret);
if (xret == 0) {
mvp = (struct mvalue *) mb;
val =
malloc(mvp->len + sizeof(struct mvalue) +
mvp->seg * sizeof(uint16_t));
if (val != NULL) {
memcpy(val, mb, sizeof(struct mvalue));
mvp = (struct mvalue *) val;
mvp->ttl = mv->ttl;
mvp->hits = mv->hits;
mvp->num = 0; //not used
itor = val + sizeof(struct mvalue);
//copy ttloff and msg
memcpy(itor, mb + sizeof(struct mvalue),
sizeof(uint16_t) * mvp->seg +
mvp->len);
hash = get_pre_mem_hash(qo->td);
htable_insert(author->s->datasets + hash, qo->td, val, 1, &mx); //replace
}
addr = &(qo->cli->addr);
}
}
write_log(&author->logfd, &author->lastlog,
author->idx, qo->td + 1, qo->td[0], addr);
}
}
}
//else printf("update record\n");
return idx + 1;
}
qo->stat = PROCESS_QUERY; //no need to find_addr in launch_new_qu
qo->socktype = UDP;
return 0;
}
//read from auth server
int
cb_read_auth(struct epoll_event *ev, struct sockinfo *si)
{
int ret, tag = 1, szhdr = sizeof(dnsheader);
si->fd = ev->data.fd;
si->buflen = BIG_MEM_STEP - 2;
if (si->socktype == TCP)
ret = tcp_read_dns_msg(si, BIG_MEM_STEP - 2, 0);
else
ret = udp_read_msg(si, 0); //epoll return and no blocked here
if (ret < szhdr)
return -1;
si->buflen = ret;
return ret;
}
int
launch_new_query(struct author *author, int idrowback)
{
const int querystep = 200;
int new_query = 0, i, start, end, ret;
struct qoutinfo *qo = NULL;
uchar *itor = NULL;
struct timeval tv;
uint msnow = 0;
struct mvalue *mv = NULL;
start = 0;
end = LIST_SPACE;
gettimeofday(&tv, NULL);
for (i = start; i < end; i++) {
pthread_mutex_lock(&author->lock);
if (author->list[i] != NULL
&& author->list[i]->qtimes > MAX_TRY_TIMES) {
release_qoutinfo(author, i);
author->list[i] = NULL;
}
if (author->list[i] != NULL) {
pthread_mutex_unlock(&author->lock);
qo = author->list[i];
if (author->list[i]->stat == NEW_QUERY) //new
{
qo->aid = idrowback * LIST_SPACE + i; //start id
qo->backid = qo->aid;
qo->mxtry = 0;
if (qo->cli)
qo->cli->fd = author->cudp;
new_query++;
qo->stat = PROCESS_QUERY;
}
if ((msnow - qo->stime) > 1000 && (qo->sq == 0))
qo->sq = 1;
if ((qo->socktype == UDP) && (qo->sq == 1)) {
ret =
find_addr(author->s->forward, author->s->datasets, qo,
author->ip);
if (qo->stat == PROCESS_QUERY && ret == 0)
query_from_auth_server(qo, author);
qo->qtimes++;
qo->stime = msnow;
}
} else
pthread_mutex_unlock(&author->lock);
}
return new_query;
}
int
after_pass_data(int ret, struct author *author)
{
struct rbnode *pn;
struct epoll_event ev;
struct qoutinfo *qo = NULL;
int i, idx, fd;
if (ret == 0)
return 0;
if (ret < 0) //tcp needed.
{
//printf("tcp needed\n");
ret = ret + 1;
ret = -ret;
qo = author->list[ret];
if (qo == NULL)
return -1;
if ((qo->tcpfd > 0) && ((qo->qtimes % (MAX_TRY_TIMES / 3)) == 0)) //retry tcp
{
ev.data.fd = qo->tcpfd;
qo->tcpfd = 0;
author->tcpinuse--;
epoll_ctl(author->bdepfd, EPOLL_CTL_DEL, ev.data.fd, &ev);
close(ev.data.fd);
}
if (qo->tcpfd > 0) //processing...
return 0;
//restart..
if (author->tcpinuse > (LIST_SPACE / 10))
fd = -1; //too many tcps
else {
qo->tcpnums++;
fd = socket(AF_INET, SOCK_STREAM, 0);
}
if (fd > 0) {
author->tcpinuse++;
qo->tcpfd = fd;
qo->socktype = TCP;
ev.data.fd = fd;
ev.events = EPOLLOUT; //wait for ready to write
author->eptcpfds[fd] = ret;
set_non_block(fd);
set_recv_timeout(fd, 0, 500); //half second
epoll_ctl(author->bdepfd, EPOLL_CTL_ADD, fd, &ev);
query_from_auth_tcp(author, qo);
return 0;
} else
ret++; //fix ret value, for deleting afterword
}
if (ret > 0) //delete qoutinfo
{
ret = ret - 1; //minus the 1 p_a_d added
pthread_mutex_lock(&author->lock);
release_qoutinfo(author, ret);
if (author->list[ret] != NULL) {
author->list[ret] = NULL;
author->qnum--;
}
pthread_mutex_unlock(&author->lock);
}
return 0;
}
int
handle_back_event(struct author *author)
{
int infinite = 1, ret, i, epfd = author->bdepfd;
struct sockinfo si = { 0 };
int bf = 0, record = 0, rx;
struct epoll_event ev, e[BACK_EVENT] = { 0 };
uchar buf[BIG_MEM_STEP] = { 0 };
while (1 && infinite) {
bf = author->audp;
ret = epoll_wait(epfd, e, BACK_EVENT, 500); // 1000 is 1s
if (ret <= 0)
break;
for (i = 0; i < ret; i++) {
si.buf = buf;
if (e[i].data.fd == bf) {
si.socktype = UDP;
while (cb_read_auth(e + i, &si) > 0) {
rx = passer_auth_data(author, buf, &si);
after_pass_data(rx, author);
}
} else if (e[i].data.fd > 0) // fd 0 will be ignored
{
if (e[i].events == EPOLLOUT) //ready to write
{
rx = send_msg_tcp(author, e[i].data.fd);
if (rx < 0)
printf("send msg tcp error\n");
ev.data.fd = e[i].data.fd;
ev.events = EPOLLIN;
epoll_ctl(epfd, EPOLL_CTL_MOD, e[i].data.fd, &ev);
} else if (e[i].events == EPOLLIN) {
si.socktype = TCP;
rx = cb_read_auth(e + i, &si);
if (rx < 0) {
author->eptcpfds[e[i].data.fd] = 0;
close(e[i].data.fd);
ev.data.fd = e[i].data.fd;
epoll_ctl(epfd, EPOLL_CTL_DEL, ev.data.fd, &ev);
} else {
rx = passer_auth_data(author, buf, &si);
after_pass_data(rx, author);
}
} else //error
{
//we do not handle the fail condition
//just delete it from epoll and close it
//EPOLLIN = 0x001,
//EPOLLPRI = 0x002,
//EPOLLOUT = 0x004,
//EPOLLERR = 0x008,
//EPOLLHUP = 0x010,
ev.data.fd = e[i].data.fd;
rx = epoll_ctl(epfd, EPOLL_CTL_DEL, e[i].data.fd, &ev);
author->eptcpfds[e[i].data.fd] = 0;
close(e[i].data.fd);
//printf("epoll fd=%d,events=0x%x,rx=%d\n",e[i].data.fd,e[i].events,rx);
}
}
}
}
return 0;
}
//when a record is queried and its not in memory
//we load it from disk, and not add it to memory
//when it's ttl is expired, it will be deleted in disk
//and when it not hited in disk, we query data from
//auth server, then store record in memory
int
dup_data_into_db(struct author *a)
{
uint i, hits = 10, hs, limit;
//static uint dbidx = 0,dboff = 0;
uchar buffer[2000] = { 0 };
uchar key[514] = { 0 };
int ret, dupx = 0;
time_t now;
struct rbnode *pn = NULL;
struct rbtree *rbt = a->s->ttlexp;
uint num, dboff, dbidx, slotoff, imgidx = 0;
struct hentry *he;
uchar *val = NULL;
struct mvalue *mv = NULL, tmp;
struct ttlnode tn, *ptn;
now = global_now;
if (a->dupbefore == 1) {
a->limits += 5;
if (a->limits > 1000)
a->limits = 1000;
}
limit = a->limits;
//printf("dup start %d\n",a->limits);
a->hsidx++;
if (a->hsidx == MULTI_HASH)
a->hsidx = 0;
for (i = 0; i < HASH_TABLE_SIZE; i++) {
dbidx = i;
dboff = a->hsidx;
slotoff = 0;
ret =
htable_find_io(a->s->datasets + dboff, dbidx, slotoff, buffer,
key);
while (ret > 0) {
slotoff++;
mv = (struct mvalue *) buffer;
//if mv ttl near "now", it may has started "ttl update"
//mv->ttl means ttl expired time
//TTL_UPDATE is 3
//if ttl was 12, now was 11, don't delete
//if ttl was 12, now was 7, delete it
if ((mv->ttl > (now + TTL_UPDATE + 1)) && (mv->hits < limit)) {
he = htable_delete(a->s->datasets + dboff, key);
if (he != NULL) {
tn.data = key;
tn.exp = mv->ttl;
tn.dlen = strlen(key) + 1;
pthread_mutex_lock(&rbt->lock);
pn = find_node(rbt, &tn);
if (pn != NULL) {
ptn = delete_node(rbt, pn);
if (ptn != NULL) {
//printf("delete true\n");
free(ptn->data);
free(ptn);
} else
printf("delete error\n");
} else {
printf("find error\n");
dbg_print_td(key);
}
pthread_mutex_unlock(&rbt->lock);
free(he->val); //dup to disk do not need memory
free(he);
}
dupx++;
}
//else
//printf("ttl %u,now %lu,hits %u\n",mv->ttl,now,mv->hits);
ret =
htable_find_io(a->s->datasets + dboff, dbidx, slotoff,
buffer, key);
}
}
a->dupbefore = 1;
return 0;
}
int
check_mm_cache(struct author *author)
{
uint total = 0;
int i;
static int tmx = 0;
for (i = 0; i < MULTI_HASH; i++) {
pthread_mutex_lock(&author->s->datasets[i].lock);
total += author->s->datasets[i].now;
pthread_mutex_unlock(&author->s->datasets[i].lock);
}
tmx++;
if (total > MAX_ELE_NUM)
return 1;
return 0;
}
int
check_ttl_expire(struct author *author)
{
struct mvalue *mv = NULL, mx;
time_t now;
struct ttlnode *tn = NULL;
struct rbnode *pn = NULL;
struct qoutinfo qo = { 0 };
struct htable *ds = NULL;
int rnd = 0, ret = -1;
struct rbtree *rbt = NULL;
uint idx = 0;
now = global_now;
ds = author->s->datasets;
rbt = author->s->ttlexp;
pthread_mutex_lock(&rbt->lock);
pn = min_node(rbt);
while (pn != NULL) {
tn = pn->key;
//if exp was 12, now was 11, start
//if exp was 12, now was 5, break
if (tn->exp > (now + TTL_UPDATE)) //3 secs after it will not expire
break;
//dbg_print_td(tn->data);
tn = delete_node(rbt, pn);
pthread_mutex_unlock(&rbt->lock);
if (tn != NULL) {
//ret = find_record_with_ttl(ds,tn->data,NULL,0,&mx);
//no buffer, if successed, ret would be 1
//if(ret > 0)
{
ret = htable_insert(author->s->qlist, tn->data, NULL, 0, NULL); //not replace
if (ret == 0) //we could insert more ttls of one same record
{
qo.qname = tn->data[0]; //type
qo.td = tn->data;
qo.dlen = strlen(tn->data) + 1;
qo.qing = qo.td + 1;
qo.cid = 0;
qo.cli = NULL;
rnd = random() % QUIZZER_NUM;
init_qoutinfo(&qo);
if (add_to_quizzer(&qo, author->s, rnd) < 0) //fail
{
//printf("add to quizzer error\n");
htable_delete(author->s->qlist, tn->data);
}
} else
htable_insert(author->s->qlist, tn->data, NULL, 0,
NULL);
}
//else querying lost
free(tn);
}
pthread_mutex_lock(&rbt->lock);
pn = min_node(rbt);
}
pthread_mutex_unlock(&rbt->lock);
return 0;
}
int
check_refresh_flag(struct author *author)
{
struct server *s = author->s;
if ((s->lastrefresh + REFRESH_INTERVAL) > global_now)
return 0;
if (s->refreshflag == 1) {
s->refreshflag = 0;
s->lastrefresh = global_now;
refresh_records(s->datasets, s->ttlexp);
}
return 0;
}
//main thread of query
//send query
//delete time outed
//recv package
void *
run_quizzer(void *arg)
{
struct author *author = (struct author *) arg;
struct qoutinfo *qo = NULL;
struct sockinfo si;
struct epoll_event ev, e[BACK_EVENT] = { 0 };
int range = 0, i, j, idrowback = 0, ret, torec, epfd;
uint nowtime, keyval, intime, delid;
ushort id;
pthread_detach(pthread_self());
epfd = add_backdoor(author->audp);
author->bdepfd = epfd;
while (1) {
idrowback = random() % (ID_SPACE / LIST_SPACE);
launch_new_query(author, idrowback);
handle_back_event(author);
if (author->idx == 0) //main author
{
check_ttl_expire(author);
if (check_mm_cache(author) == 1)
dup_data_into_db(author);
else
author->dupbefore = 0;
check_refresh_flag(author);
}
}
}
//add to quizzer
int
add_to_quizzer(struct qoutinfo *qo, struct server *s, int qidx)
{
int i, j, randomoff = 0;
struct qoutinfo *qi = NULL;
qi = malloc(sizeof(struct qoutinfo));
if (qi == NULL)
return -1;
memset(qi, 0, sizeof(struct qoutinfo));
*qi = *qo;
qi->cli = NULL;
if (qo->cli != NULL) {
qi->cli = malloc(sizeof(struct sockinfo));
if (qi->cli == NULL) {