forked from iqiyi/dpvs
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathneigh.c
1191 lines (1003 loc) · 37 KB
/
neigh.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
/*
* DPVS is a software load balancer (Virtual Server) based on DPDK.
*
* Copyright (C) 2017 iQIYI (www.iqiyi.com).
* All Rights Reserved.
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
*/
#include <stdio.h>
#include <assert.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <rte_ether.h>
#include <rte_arp.h>
#include "dpdk.h"
#include "parser/parser.h"
#include "netif.h"
#include "neigh.h"
#include "conf/common.h"
#include "route.h"
#include "ctrl.h"
#include "ndisc.h"
#include "conf/neigh.h"
#include "scheduler.h"
#include "mempool.h"
#define NEIGH_ENTRY_BUFF_SIZE_DEF 128
#define NEIGH_ENTRY_BUFF_SIZE_MIN 16
#define NEIGH_ENTRY_BUFF_SIZE_MAX 8192
#define DPVS_NEIGH_TIMEOUT_DEF 60
#define DPVS_NEIGH_TIMEOUT_MIN 1
#define DPVS_NEIGH_TIMEOUT_MAX 3600
static int neigh_nums[DPVS_MAX_LCORE] = { 0 };
static struct dpvs_mempool *neigh_mempool;
struct neighbour_mbuf_entry {
struct rte_mbuf *m;
struct list_head neigh_mbuf_list;
} __rte_cache_aligned;
struct raw_neigh {
int af;
union inet_addr ip_addr;
struct ether_addr eth_addr;
struct netif_port *port;
bool add;
uint8_t flag;
} __rte_cache_aligned;
struct nud_state {
int next_state[DPVS_NUD_S_MAX];
};
static int nud_timeouts[DPVS_NUD_S_MAX] = {
[DPVS_NUD_S_NONE] = 2,
[DPVS_NUD_S_SEND] = 3,
[DPVS_NUD_S_REACHABLE] = DPVS_NEIGH_TIMEOUT_DEF,
[DPVS_NUD_S_PROBE] = 30,
[DPVS_NUD_S_DELAY] = 3,
};
static struct nud_state nud_states[] = {
/* sNNO, sNSD, sNRE, sNPR, sNDE*/
/*send arp*/ {{sNSD, sNSD, sNKP, sNDE, sNDE}},
/*recv arp*/ {{sNRE, sNRE, sNRE, sNRE, sNRE}},
/*ack confirm*/ {{sNKP, sNKP, sNRE, sNRE, sNRE}},
/*mbuf ref*/ {{sNKP, sNKP, sNKP, sNPR, sNKP}},
/*timeout*/ {{sNNO, sNNO, sNPR, sNNO, sNNO}},
};
#define NEIGH_PROCESS_MAC_RING_INTERVAL 100
/* params from config file */
static int arp_unres_qlen = NEIGH_ENTRY_BUFF_SIZE_DEF;
static struct rte_ring *neigh_ring[DPVS_MAX_LCORE];
static void unres_qlen_handler(vector_t tokens)
{
char *str = set_value(tokens);
int unres_qlen;
assert(str);
unres_qlen = atoi(str);
if (unres_qlen >= NEIGH_ENTRY_BUFF_SIZE_MIN &&
unres_qlen <= NEIGH_ENTRY_BUFF_SIZE_MAX) {
RTE_LOG(INFO, NEIGHBOUR, "arp_unres_qlen = %d\n", unres_qlen);
arp_unres_qlen = unres_qlen;
} else {
RTE_LOG(WARNING, NEIGHBOUR, "invalid arp_unres_qlen config %s, using default "
"%d\n", str, NEIGH_ENTRY_BUFF_SIZE_DEF);
arp_unres_qlen = NEIGH_ENTRY_BUFF_SIZE_DEF;
}
FREE_PTR(str);
}
static void timeout_handler(vector_t tokens)
{
char *str = set_value(tokens);
int timeout;
assert(str);
timeout = atoi(str);
if (timeout >= DPVS_NEIGH_TIMEOUT_MIN && timeout <= DPVS_NEIGH_TIMEOUT_MAX) {
RTE_LOG(INFO, NEIGHBOUR, "arp_reachable_timeout = %d\n", timeout);
nud_timeouts[DPVS_NUD_S_REACHABLE] = timeout;
} else {
RTE_LOG(INFO, NEIGHBOUR, "invalid arp_reachable_timeout config %s, \
using default %d\n", str, DPVS_NEIGH_TIMEOUT_DEF);
nud_timeouts[DPVS_NUD_S_REACHABLE] = DPVS_NEIGH_TIMEOUT_DEF;
}
FREE_PTR(str);
}
void neigh_keyword_value_init(void)
{
if (dpvs_state_get() == DPVS_STATE_INIT) {
/* KW_TYPE_INIT keyword */
arp_unres_qlen = NEIGH_ENTRY_BUFF_SIZE_DEF;
}
/* KW_TYPE_NORMAL keyword */
nud_timeouts[DPVS_NUD_S_REACHABLE] = DPVS_NEIGH_TIMEOUT_DEF;
}
void install_neighbor_keywords(void)
{
install_keyword_root("neigh_defs", NULL);
install_keyword("unres_queue_length", unres_qlen_handler, KW_TYPE_INIT);
install_keyword("timeout", timeout_handler, KW_TYPE_NORMAL);
}
static lcoreid_t master_cid = 0;
static struct list_head neigh_table[DPVS_MAX_LCORE][NEIGH_TAB_SIZE];
static struct raw_neigh* neigh_ring_clone_entry(const struct neighbour_entry* neighbour,
bool add);
static int neigh_send_arp(struct netif_port *port, uint32_t src_ip, uint32_t dst_ip);
static inline char *eth_addr_itoa(const struct ether_addr *src, char *dst, size_t size)
{
snprintf(dst, size, "%02x:%02x:%02x:%02x:%02x:%02x",
src->addr_bytes[0],
src->addr_bytes[1],
src->addr_bytes[2],
src->addr_bytes[3],
src->addr_bytes[4],
src->addr_bytes[5]);
return dst;
}
#ifdef CONFIG_DPVS_NEIGH_DEBUG
static void dump_arp_hdr(const char *msg, const struct arp_hdr *ah, portid_t port)
{
const struct arp_ipv4 *aip4;
char sha[18], tha[18];
char sip[16], tip[16];
lcoreid_t lcore;
lcore = rte_lcore_id();
fprintf(stderr, "%s lcore %d port%d arp hlen %u plen %u op %u",
msg ? msg : "", lcore, port, ah->arp_hln, ah->arp_pln, ntohs(ah->arp_op));
if (ah->arp_pro == htons(ETHER_TYPE_IPv4)) {
aip4 = &ah->arp_data;
eth_addr_itoa(&aip4->arp_sha, sha, sizeof(sha));
eth_addr_itoa(&aip4->arp_tha, tha, sizeof(tha));
inet_ntop(AF_INET, &aip4->arp_sip, sip, sizeof(sip));
inet_ntop(AF_INET, &aip4->arp_tip, tip, sizeof(tip));
fprintf(stderr, " sha %s sip %s tha %s tip %s", sha, sip, tha, tip);
}
fprintf(stderr, "\n");
}
#endif
#ifdef CONFIG_DPVS_NEIGH_DEBUG
static int dump_neigh_entry(const struct neighbour_entry *ne, char *buf, size_t buflen)
{
size_t slen = 0;
char fmtbuf[256];
if (!ne || !buf || buflen < 1)
return EDPVS_INVAL;
buf[0] = '\0';
snprintf(&buf[slen], buflen - slen, "ip=%s",
inet_ntop(ne->af, &ne->ip_addr, fmtbuf, sizeof(fmtbuf)));
if ((slen = strlen(buf)) + 1 >= buflen)
return slen;
snprintf(&buf[slen], buflen - slen, ", mac=%s",
eth_addr_itoa(&ne->eth_addr, fmtbuf, sizeof(fmtbuf)));
if ((slen = strlen(buf)) + 1 >= buflen)
return slen;
snprintf(&buf[slen], buflen - slen, ", %s", ne->port->name);
if ((slen = strlen(buf)) + 1 >= buflen)
return slen;
snprintf(&buf[slen], buflen - slen, ", que_num=%d, state=%d, ts=%d, flag=0x%x",
ne->que_num, ne->state, ne->ts, ne->flag);
return strlen(buf);
}
#endif
static inline int neigh_hash(struct neighbour_entry *neighbour, unsigned int hashkey)
{
lcoreid_t cid = rte_lcore_id();
if (!(neighbour->flag & NEIGHBOUR_HASHED)) {
list_add(&neighbour->neigh_list, &neigh_table[cid][hashkey]);
neighbour->flag |= NEIGHBOUR_HASHED;
return EDPVS_OK;
}
return EDPVS_EXIST;
}
static inline int neigh_unhash(struct neighbour_entry *neighbour)
{
if (neighbour->flag & NEIGHBOUR_HASHED) {
list_del(&neighbour->neigh_list);
neighbour->flag &= ~NEIGHBOUR_HASHED;
return EDPVS_OK;
}
RTE_LOG(DEBUG, NEIGHBOUR, "%s: neighbour entry not hashed.\n", __func__);
return EDPVS_NOTEXIST;
}
static inline bool neigh_key_cmp(int af, const struct neighbour_entry *neighbour,
const union inet_addr *key, const struct netif_port* port)
{
return (inet_addr_equal(af, key, &neighbour->ip_addr)) &&
(neighbour->port == port) &&
(neighbour->af == af);
}
static int neigh_entry_expire(struct neighbour_entry *neighbour)
{
struct neighbour_mbuf_entry *mbuf, *mbuf_next;
lcoreid_t cid = rte_lcore_id();
assert(cid != master_cid);
dpvs_timer_cancel_nolock(&neighbour->timer, false);
neigh_unhash(neighbour);
#ifdef CONFIG_DPVS_NEIGH_DEBUG
{
char buf[512];
dump_neigh_entry(neighbour, buf, sizeof(buf));
RTE_LOG(INFO, NEIGHBOUR, "%s:[%02d] del neigh entry: %s\n", __func__, cid, buf);
}
#endif
/* release pkts saved in neighbour entry */
list_for_each_entry_safe(mbuf, mbuf_next,
&neighbour->queue_list, neigh_mbuf_list) {
list_del(&mbuf->neigh_mbuf_list);
rte_pktmbuf_free(mbuf->m);
dpvs_mempool_put(neigh_mempool, mbuf);
}
dpvs_mempool_put(neigh_mempool, neighbour);
neigh_nums[cid]--;
return DTIMER_STOP;
}
void neigh_entry_state_trans(struct neighbour_entry *neighbour, int idx)
{
struct timeval timeout;
/* DPVS_NUD_S_KEEP is not a real state, just use it to keep original state */
if ((nud_states[idx].next_state[neighbour->state] != DPVS_NUD_S_KEEP)
&& !(neighbour->flag & NEIGHBOUR_STATIC)) {
int old_state = neighbour->state;
struct timespec now = { 0 };
neighbour->state = nud_states[idx].next_state[neighbour->state];
if (neighbour->state == old_state) {
if (likely(clock_gettime(CLOCK_REALTIME_COARSE, &now)) == 0)
/* frequent timer updates hurt performance,
* do not update timer unless half timeout passed */
if ((now.tv_sec - neighbour->ts) * 2 < nud_timeouts[old_state])
return;
}
timeout.tv_sec = nud_timeouts[neighbour->state];
timeout.tv_usec = 0;
dpvs_time_rand_delay(&timeout, 200000); /* delay 200ms randomly to avoid timer performance problem */
dpvs_timer_update_nolock(&neighbour->timer, &timeout, false);
neighbour->ts = now.tv_sec;
#ifdef CONFIG_DPVS_NEIGH_DEBUG
if (neighbour->state != old_state)
{
char buf[512];
dump_neigh_entry(neighbour, buf, sizeof(buf));
RTE_LOG(INFO, NEIGHBOUR, "[%02d] neighbor (%s) trans state: %s -> %s, idx:%d.\n",
rte_lcore_id(), buf, nud_state_name(old_state),
nud_state_name(neighbour->state), idx);
}
#endif
}
}
static int neighbour_timer_event(void *data)
{
struct neighbour_entry *neighbour = data;
if (neighbour->state == DPVS_NUD_S_NONE) {
return neigh_entry_expire(neighbour);
}
neigh_entry_state_trans(neighbour, 4);
return DTIMER_OK;
}
struct neighbour_entry *neigh_lookup_entry(int af, const union inet_addr *key,
const struct netif_port* port,
unsigned int hashkey)
{
struct neighbour_entry *neighbour;
lcoreid_t cid = rte_lcore_id();
list_for_each_entry(neighbour, &neigh_table[cid][hashkey], neigh_list){
if(neigh_key_cmp(af, neighbour, key, port)) {
return neighbour;
}
}
return NULL;
}
int neigh_edit(struct neighbour_entry *neighbour, struct ether_addr *eth_addr)
{
rte_memcpy(&neighbour->eth_addr, eth_addr, 6);
return EDPVS_OK;
}
struct neighbour_entry *neigh_add_table(int af, const union inet_addr *ipaddr,
const struct ether_addr *eth_addr,
struct netif_port *port,
unsigned int hashkey, int flag)
{
struct neighbour_entry *new_neighbour=NULL;
struct timeval delay;
lcoreid_t cid = rte_lcore_id();
new_neighbour = dpvs_mempool_get(neigh_mempool, sizeof(struct neighbour_entry));
if (unlikely(new_neighbour == NULL))
return NULL;
rte_memcpy(&new_neighbour->ip_addr, ipaddr,
sizeof(union inet_addr));
new_neighbour->flag = flag;
new_neighbour->af = af;
if (eth_addr) {
rte_memcpy(&new_neighbour->eth_addr, eth_addr, 6);
new_neighbour->state = DPVS_NUD_S_REACHABLE;
} else {
new_neighbour->state = DPVS_NUD_S_NONE;
}
new_neighbour->port = port;
new_neighbour->que_num = 0;
delay.tv_sec = nud_timeouts[new_neighbour->state];
delay.tv_usec = 0;
INIT_LIST_HEAD(&new_neighbour->queue_list);
if (!(new_neighbour->flag & NEIGHBOUR_STATIC)) {
dpvs_time_rand_delay(&delay, 200000); /* delay 200ms randomly to avoid timer performance problem */
dpvs_timer_sched(&new_neighbour->timer, &delay,
neighbour_timer_event, new_neighbour, false);
}
neigh_hash(new_neighbour, hashkey);
neigh_nums[cid]++;
#ifdef CONFIG_DPVS_NEIGH_DEBUG
{
char buf[512];
dump_neigh_entry(new_neighbour, buf, sizeof(buf));
RTE_LOG(INFO, NEIGHBOUR, "[%02d] add neigh entry: %s\n", cid, buf);
}
#endif
return new_neighbour;
}
/***********************fill mac hdr before send pkt************************************/
static void neigh_fill_mac(struct neighbour_entry *neighbour,
struct rte_mbuf *m,
const struct in6_addr *target,
struct netif_port *port)
{
struct ether_hdr *eth;
struct ether_addr mult_eth;
uint16_t pkt_type;
m->l2_len = sizeof(struct ether_hdr);
eth = (struct ether_hdr *)rte_pktmbuf_prepend(m, (uint16_t)sizeof(struct ether_hdr));
if (!neighbour && target) {
ipv6_mac_mult(target, &mult_eth);
ether_addr_copy(&mult_eth, ð->d_addr);
} else {
ether_addr_copy(&neighbour->eth_addr, ð->d_addr);
}
ether_addr_copy(&port->addr, ð->s_addr);
pkt_type = (uint16_t)m->packet_type;
eth->ether_type = rte_cpu_to_be_16(pkt_type);
}
void neigh_send_mbuf_cach(struct neighbour_entry *neighbour)
{
struct neighbour_mbuf_entry *mbuf, *mbuf_next;
struct rte_mbuf *m;
list_for_each_entry_safe(mbuf, mbuf_next,
&neighbour->queue_list, neigh_mbuf_list) {
list_del(&mbuf->neigh_mbuf_list);
m = mbuf->m;
neigh_fill_mac(neighbour, m, NULL, neighbour->port);
netif_xmit(m, neighbour->port);
neighbour->que_num--;
dpvs_mempool_put(neigh_mempool, mbuf);
}
}
void neigh_confirm(int af, union inet_addr *nexthop, struct netif_port *port)
{
struct neighbour_entry *neighbour;
unsigned int hashkey;
lcoreid_t cid = rte_lcore_id();
/*find nexhop/neighbour to confirm, no matter whether it is the route in*/
hashkey = neigh_hashkey(af, nexthop, port);
list_for_each_entry(neighbour, &neigh_table[cid][hashkey], neigh_list) {
if (neigh_key_cmp(af, neighbour, nexthop, port) &&
!(neighbour->flag & NEIGHBOUR_STATIC)) {
neigh_entry_state_trans(neighbour, 2);
}
}
}
static void neigh_state_confirm(struct neighbour_entry *neighbour)
{
union inet_addr saddr, daddr;
memset(&saddr, 0, sizeof(saddr));
if (neighbour->af == AF_INET) {
daddr.in.s_addr = neighbour->ip_addr.in.s_addr;
inet_addr_select(AF_INET, neighbour->port, &daddr, 0, &saddr);
if (!saddr.in.s_addr)
RTE_LOG(ERR, NEIGHBOUR, "%s: no source ip\n", __func__);
if (neigh_send_arp(neighbour->port, saddr.in.s_addr,
daddr.in.s_addr) != EDPVS_OK)
RTE_LOG(ERR, NEIGHBOUR, "%s: send arp failed\n", __func__);
} else if (neighbour->af == AF_INET6) {
ipv6_addr_copy(&daddr.in6, &neighbour->ip_addr.in6);
inet_addr_select(AF_INET6, neighbour->port, &daddr, 0, &saddr);
if (ipv6_addr_any(&saddr.in6))
RTE_LOG(ERR, NEIGHBOUR, "%s: no source ip\n", __func__);
ndisc_solicit(neighbour, &saddr.in6);
}
}
int neigh_resolve_input(struct rte_mbuf *m, struct netif_port *port)
{
struct arp_hdr *arp = rte_pktmbuf_mtod(m, struct arp_hdr *);
struct ether_hdr *eth;
uint32_t ipaddr;
struct neighbour_entry *neighbour = NULL;
unsigned int hashkey;
struct inet_ifaddr *ifa;
ifa = inet_addr_ifa_get(AF_INET, port, (union inet_addr*)&arp->arp_data.arp_tip);
if (!ifa)
return EDPVS_KNICONTINUE;
inet_addr_ifa_put(ifa);
eth = (struct ether_hdr *)rte_pktmbuf_prepend(m,
(uint16_t)sizeof(struct ether_hdr));
if (rte_be_to_cpu_16(arp->arp_op) == ARP_OP_REQUEST) {
ether_addr_copy(ð->s_addr, ð->d_addr);
rte_memcpy(ð->s_addr, &port->addr, 6);
arp->arp_op = rte_cpu_to_be_16(ARP_OP_REPLY);
ether_addr_copy(&arp->arp_data.arp_sha, &arp->arp_data.arp_tha);
ether_addr_copy(ð->s_addr, &arp->arp_data.arp_sha);
ipaddr = arp->arp_data.arp_sip;
arp->arp_data.arp_sip = arp->arp_data.arp_tip;
arp->arp_data.arp_tip = ipaddr;
m->l2_len = sizeof(struct ether_hdr);
m->l3_len = sizeof(struct arp_hdr);
netif_xmit(m, port);
return EDPVS_OK;
} else if (arp->arp_op == htons(ARP_OP_REPLY)) {
ipaddr = arp->arp_data.arp_sip;
hashkey = neigh_hashkey(AF_INET, (union inet_addr *)&ipaddr, port);
neighbour = neigh_lookup_entry(AF_INET, (union inet_addr *)&ipaddr,
port, hashkey);
if (neighbour && !(neighbour->flag & NEIGHBOUR_STATIC)) {
neigh_edit(neighbour, &arp->arp_data.arp_sha);
} else {
neighbour = neigh_add_table(AF_INET, (union inet_addr *)&ipaddr,
&arp->arp_data.arp_sha, port, hashkey, 0);
if (!neighbour) {
RTE_LOG(ERR, NEIGHBOUR, "%s: add neighbour wrong\n", __func__);
rte_pktmbuf_free(m);
return EDPVS_NOMEM;
}
}
neigh_entry_state_trans(neighbour, 1);
neigh_send_mbuf_cach(neighbour);
return EDPVS_KNICONTINUE;
} else {
rte_pktmbuf_free(m);
return EDPVS_DROP;
}
}
static int neigh_send_arp(struct netif_port *port, uint32_t src_ip, uint32_t dst_ip)
{
struct rte_mbuf *m;
struct ether_hdr *eth;
struct arp_hdr *arp;
uint32_t addr;
m = rte_pktmbuf_alloc(port->mbuf_pool);
if (unlikely(m == NULL)) {
return EDPVS_NOMEM;
}
m->userdata = NULL;
eth = rte_pktmbuf_mtod(m, struct ether_hdr *);
arp = (struct arp_hdr *)ð[1];
memset(ð->d_addr, 0xFF, 6);
ether_addr_copy(&port->addr, ð->s_addr);
eth->ether_type = htons(ETHER_TYPE_ARP);
memset(arp, 0, sizeof(struct arp_hdr));
rte_memcpy(&arp->arp_data.arp_sha, &port->addr, 6);
addr = src_ip;
inetAddrCopy(&arp->arp_data.arp_sip, &addr);
memset(&arp->arp_data.arp_tha, 0, 6);
addr = dst_ip;
inetAddrCopy(&arp->arp_data.arp_tip, &addr);
arp->arp_hrd = htons(ARP_HRD_ETHER);
arp->arp_pro = htons(ETHER_TYPE_IPv4);
arp->arp_hln = 6;
arp->arp_pln = 4;
arp->arp_op = htons(ARP_OP_REQUEST);
m->pkt_len = 60;
m->data_len = 60;
m->l2_len = sizeof(struct ether_hdr);
m->l3_len = sizeof(struct arp_hdr);
memset(&arp[1], 0, 18);
#ifdef CONFIG_DPVS_NEIGH_DEBUG
dump_arp_hdr("send", arp, port->id);
#endif
netif_xmit(m, port);
return EDPVS_OK;
}
#ifdef CONFIG_DPVS_NEIGH_DEBUG
static inline void neigh_show_nexthop(const char *func, int af,
const union inet_addr *nexhop,
const struct netif_port *port)
{
char buf[64];
RTE_LOG(DEBUG, NEIGHBOUR,
"%s: [%d] port %s, nexthop %s\n",
func, rte_lcore_id(), port->name,
nexhop ? inet_ntop(af, nexhop, buf, sizeof(buf)) : "::");
}
#endif
static inline void neigh_show_entry(const char *func,
struct neighbour_entry *neigh)
{
char ipaddr[64];
RTE_LOG(ERR, NEIGHBOUR,
"%s: [%d] ip %s, state %s, %d (> %d) packets "
"queued on %s so drop the packet",
func, rte_lcore_id(),
inet_ntop(neigh->af, &neigh->ip_addr, ipaddr, sizeof(ipaddr))
? ipaddr : "::",
nud_state_names[neigh->state],
neigh->que_num, arp_unres_qlen,
neigh->port ? neigh->port->name : "null i/f");
}
int neigh_output(int af, union inet_addr *nexhop,
struct rte_mbuf *m, struct netif_port *port)
{
struct neighbour_entry *neighbour;
struct neighbour_mbuf_entry *m_buf;
unsigned int hashkey;
if (port->flag & NETIF_PORT_FLAG_NO_ARP)
return netif_xmit(m, port);
if (af == AF_INET6 && ipv6_addr_is_multicast((struct in6_addr *)nexhop)) {
neigh_fill_mac(NULL, m, (struct in6_addr *)nexhop, port);
return netif_xmit(m, port);
}
#ifdef CONFIG_DPVS_NEIGH_DEBUG
neigh_show_nexthop(__func__, af, nexhop, port);
#endif
hashkey = neigh_hashkey(af, nexhop, port);
neighbour = neigh_lookup_entry(af, nexhop, port, hashkey);
if (neighbour) {
switch (neighbour->state) {
case DPVS_NUD_S_NONE:
case DPVS_NUD_S_SEND:
if (neighbour->que_num > arp_unres_qlen) {
neigh_show_entry(__func__, neighbour);
/*
* don't need arp request now,
* since neighbour will not be confirmed
* and it will be released late
*/
rte_pktmbuf_free(m);
return EDPVS_DROP;
}
m_buf = dpvs_mempool_get(neigh_mempool, sizeof(struct neighbour_mbuf_entry));
if (unlikely(!m_buf)) {
rte_pktmbuf_free(m);
return EDPVS_DROP;
}
m_buf->m = m;
list_add_tail(&m_buf->neigh_mbuf_list, &neighbour->queue_list);
neighbour->que_num++;
if (neighbour->state == DPVS_NUD_S_NONE) {
neigh_state_confirm(neighbour);
neigh_entry_state_trans(neighbour, 0);
}
return EDPVS_OK;
case DPVS_NUD_S_REACHABLE:
case DPVS_NUD_S_PROBE:
case DPVS_NUD_S_DELAY:
neigh_fill_mac(neighbour, m, NULL, port);
netif_xmit(m, neighbour->port);
if (neighbour->state == DPVS_NUD_S_PROBE) {
neigh_state_confirm(neighbour);
neigh_entry_state_trans(neighbour, 0);
}
return EDPVS_OK;
default:
return EDPVS_IDLE;
}
}
/* create the neighbour entry if not found */
neighbour = neigh_add_table(af, nexhop, NULL, port, hashkey, 0);
if (!neighbour) {
RTE_LOG(ERR, NEIGHBOUR, "%s: add neighbour wrong\n", __func__);
rte_pktmbuf_free(m);
return EDPVS_NOMEM;
}
m_buf = dpvs_mempool_get(neigh_mempool, sizeof(struct neighbour_mbuf_entry));
if (unlikely(!m_buf)) {
rte_pktmbuf_free(m);
return EDPVS_DROP;
}
m_buf->m = m;
list_add_tail(&m_buf->neigh_mbuf_list, &neighbour->queue_list);
neighbour->que_num++;
if (neighbour->state == DPVS_NUD_S_NONE) {
neigh_state_confirm(neighbour);
neigh_entry_state_trans(neighbour, 0);
}
return EDPVS_OK;
}
int neigh_gratuitous_arp(struct in_addr *src_ip, struct netif_port *port)
{
uint32_t sip = src_ip->s_addr;
return neigh_send_arp(port, sip, sip);
}
static struct pkt_type arp_pkt_type = {
//.type = rte_cpu_to_be_16(ETHER_TYPE_ARP),
.func = neigh_resolve_input,
.port = NULL,
};
/****************************master core sync*******************************************/
#define MAC_RING_SIZE 2048
static int neigh_ring_init(void)
{
char name_buf[RTE_RING_NAMESIZE];
int socket_id;
uint8_t cid;
socket_id = rte_socket_id();
for (cid = 0; cid < DPVS_MAX_LCORE; cid++) {
snprintf(name_buf, RTE_RING_NAMESIZE, "neigh_ring_c%d", cid);
neigh_ring[cid] = rte_ring_create(name_buf, MAC_RING_SIZE,
socket_id, RING_F_SC_DEQ);
if (neigh_ring[cid] == NULL)
rte_panic("create ring:%s failed!\n", name_buf);
}
return EDPVS_OK;
}
static struct raw_neigh* neigh_ring_clone_entry(const struct neighbour_entry* neighbour,
bool add)
{
struct raw_neigh* mac_param;
mac_param = dpvs_mempool_get(neigh_mempool, sizeof(struct raw_neigh));
if (unlikely(mac_param == NULL))
return NULL;
mac_param->af = neighbour->af;
rte_memcpy(&mac_param->ip_addr, &neighbour->ip_addr, sizeof(union inet_addr));
mac_param->flag = neighbour->flag & ~NEIGHBOUR_HASHED;
mac_param->port = neighbour->port;
mac_param->add = add;
/*just copy*/
rte_memcpy(&mac_param->eth_addr, &neighbour->eth_addr, 6);
return mac_param;
}
static struct raw_neigh* neigh_ring_clone_param(const struct dp_vs_neigh_conf *param,
bool add)
{
struct netif_port *port;
struct raw_neigh* mac_param;
mac_param = dpvs_mempool_get(neigh_mempool, sizeof(struct raw_neigh));
if (unlikely(mac_param == NULL))
return NULL;
port = netif_port_get_by_name(param->ifname);
mac_param->af = param->af;
rte_memcpy(&mac_param->ip_addr, ¶m->ip_addr, sizeof(union inet_addr));
mac_param->flag = param->flag | NEIGHBOUR_STATIC;
mac_param->port = port;
mac_param->add = add;
rte_memcpy(&mac_param->eth_addr, ¶m->eth_addr, 6);
return mac_param;
}
/*
*1, master core static neighbour sync slave core;
*2, ipv6 slave core sync slave core when recieve ns/na
*/
static void neigh_process_ring(void *arg)
{
struct raw_neigh *params[NETIF_MAX_PKT_BURST];
uint16_t nb_rb;
unsigned int hash;
struct neighbour_entry *neigh;
struct raw_neigh *param;
lcoreid_t cid = rte_lcore_id();
nb_rb = rte_ring_dequeue_burst(neigh_ring[cid], (void **)params,
NETIF_MAX_PKT_BURST, NULL);
if (nb_rb > 0) {
int i;
for (i = 0; i < nb_rb; i++) {
param = params[i];
hash = neigh_hashkey(param->af, ¶m->ip_addr, param->port);
neigh = neigh_lookup_entry(param->af, ¶m->ip_addr,
param->port, hash);
if (param->add) {
if (neigh) {
neigh_edit(neigh, ¶m->eth_addr);
} else {
neigh = neigh_add_table(param->af, ¶m->ip_addr,
¶m->eth_addr, param->port,
hash, param->flag);
if (unlikely(!neigh))
goto cont;
}
if (!(param->flag & NEIGHBOUR_STATIC))
neigh_entry_state_trans(neigh, 1);
neigh_send_mbuf_cach(neigh);
} else {
if (neigh) {
struct neighbour_mbuf_entry *mbuf, *mbuf_next;
if (!(neigh->flag & NEIGHBOUR_STATIC))
dpvs_timer_cancel(&neigh->timer, false);
neigh_unhash(neigh);
#ifdef CONFIG_DPVS_NEIGH_DEBUG
{
char buf[512];
dump_neigh_entry(neigh, buf, sizeof(buf));
RTE_LOG(INFO, NEIGHBOUR, "%s:[%02d] del neigh entry: %s\n", __func__, cid, buf);
}
#endif
list_for_each_entry_safe(mbuf, mbuf_next,
&neigh->queue_list, neigh_mbuf_list) {
list_del(&mbuf->neigh_mbuf_list);
rte_pktmbuf_free(mbuf->m);
dpvs_mempool_put(neigh_mempool, mbuf);
}
dpvs_mempool_put(neigh_mempool, neigh);
neigh_nums[cid]--;
} else {
RTE_LOG(WARNING, NEIGHBOUR, "%s: not exist\n", __func__);
}
}
cont:
dpvs_mempool_put(neigh_mempool, param);
}
}
}
/************************** used for dpip neighbour show***********************************/
static void neigh_fill_param(struct dp_vs_neigh_conf *param,
const struct neighbour_entry *entry,
lcoreid_t cid)
{
param->af = entry->af;
param->ip_addr = entry->ip_addr;
param->flag = entry->flag;
ether_addr_copy(&entry->eth_addr, ¶m->eth_addr);
param->que_num = entry->que_num;
param->state = entry->state;
param->cid = cid;
memcpy(¶m->ifname, entry->port->name, IFNAMSIZ);
}
static void neigh_fill_array(struct netif_port *dev, lcoreid_t cid,
struct dp_vs_neigh_conf_array *array,
size_t neigh_nums)
{
int hash, off;
struct neighbour_entry *entry;
off = array->neigh_nums;
if (dev) {
for (hash = 0; hash < NEIGH_TAB_SIZE; hash++) {
list_for_each_entry(entry, &neigh_table[cid][hash], neigh_list) {
if (dev == entry->port) {
if (off >= neigh_nums) {
RTE_LOG(WARNING, NEIGHBOUR, "%s: neigh num not match\n", __func__);
break;
}
neigh_fill_param(&array->addrs[off++], entry, cid);
array->neigh_nums = off;
}
}
}
} else {
for (hash = 0; hash < NEIGH_TAB_SIZE; hash++) {
list_for_each_entry(entry, &neigh_table[cid][hash], neigh_list) {
if (off >= neigh_nums) {
RTE_LOG(WARNING, NEIGHBOUR, "%s: neigh num not match\n", __func__);
break;
}
neigh_fill_param(&array->addrs[off++], entry, cid);
array->neigh_nums = off;
}
}
}
}
static int get_neigh_uc_cb(struct dpvs_msg *msg)
{
struct netif_port *dev = NULL;
struct dp_vs_neigh_conf_array *array;
int len;
lcoreid_t cid = rte_lcore_id();
if (msg->len)
dev = netif_port_get_by_name((char *)msg->data);
len = sizeof(struct dp_vs_neigh_conf_array) +
sizeof(struct dp_vs_neigh_conf) * neigh_nums[cid];
array = msg_reply_alloc(len);
if (unlikely(!array))
return EDPVS_NOMEM;
array->neigh_nums = 0;
neigh_fill_array(dev, cid, array, neigh_nums[cid]);
msg->reply.len = len;
msg->reply.data = (void *)array;
return EDPVS_OK;
}
static int neigh_sockopt_get(sockoptid_t opt, const void *conf,
size_t size, void **out, size_t *outsize)
{
const struct dp_vs_neigh_conf *cf;
struct dp_vs_neigh_conf_array *array, *array_msg;
size_t off = 0;
struct netif_port *port = NULL;
struct dpvs_msg *msg, *cur;
struct dpvs_multicast_queue *reply = NULL;
int neigh_nums_g = 0, err;
if (conf && size >= sizeof(*cf))
cf = conf;
else
cf = NULL;
if (cf && strlen(cf->ifname)) {
port = netif_port_get_by_name(cf->ifname);
if (!port) {
RTE_LOG(WARNING, NEIGHBOUR, "%s: no such device: %s\n",
__func__, cf->ifname);
return EDPVS_NOTEXIST;
}
}
msg = msg_make(MSG_TYPE_NEIGH_GET, 0 , DPVS_MSG_MULTICAST, rte_lcore_id(),
port ? sizeof(port->name) : 0, port ? (&port->name) : NULL);
if (!msg)
return EDPVS_NOMEM;
err = multicast_msg_send(msg, 0, &reply);
if (err != EDPVS_OK) {
msg_destroy(&msg);
RTE_LOG(ERR, NEIGHBOUR, "%s: send message fail.\n", __func__);
return EDPVS_DROP;
}
/* get neigh_num */
list_for_each_entry(cur, &reply->mq, mq_node) {
array_msg = (struct dp_vs_neigh_conf_array *)(cur->data);
neigh_nums_g += array_msg->neigh_nums;
}
*outsize = sizeof(struct dp_vs_neigh_conf_array) + \
neigh_nums_g * sizeof(struct dp_vs_neigh_conf);
*out = rte_calloc(NULL, 1, *outsize, RTE_CACHE_LINE_SIZE);
if (!(*out)) {
msg_destroy(&msg);
return EDPVS_NOMEM;
}
array = *out;
/* copy neigh_array*/
array->neigh_nums = neigh_nums_g;
list_for_each_entry(cur, &reply->mq, mq_node) {
array_msg = (struct dp_vs_neigh_conf_array *)(cur->data);
memcpy(&array->addrs[off], &array_msg->addrs[0],
array_msg->neigh_nums * sizeof(struct dp_vs_neigh_conf));
off += array_msg->neigh_nums;
}