-
Notifications
You must be signed in to change notification settings - Fork 4
/
Copy pathmapping.c
807 lines (707 loc) · 24.1 KB
/
mapping.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
/*
* Copyright 2010, 2011, 2012
* IIJ Innovation Institute 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:
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * 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 IIJ INNOVATION INSTITUTE INC. ``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 IIJ INNOVATION INSTITUTE INC. 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.
*/
#include <stdlib.h>
#if !defined(__linux__)
#define _WITH_GETLINE
#else
#define _GNU_SOURCE
#endif
#include <stdio.h>
#include <string.h>
#include <assert.h>
#include <err.h>
#include <sys/queue.h>
#include <sys/socket.h>
#include <sys/stat.h>
#include <arpa/inet.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <netinet/ip.h>
#include <netinet/ip6.h>
#include <netinet/ip_icmp.h>
#include <netinet/icmp6.h>
#include "mapping.h"
#include "tunif.h"
/*
* The mapping structure between the global IPv4 address and the
* internal IPv6 address.
*/
struct mapping {
SLIST_ENTRY(mapping) entries;
struct in_addr addr4;
struct in6_addr addr6;
};
struct mapping66 {
SLIST_ENTRY(mapping66) entries;
struct in6_addr global;
struct in6_addr intra;
};
struct mapping_hash {
SLIST_ENTRY(mapping_hash) entries;
struct mapping *mappingp;
};
struct mapping66_hash {
SLIST_ENTRY(mapping66_hash) entries;
struct mapping66 *mappingp;
};
#define MAPPING_TABLE_HASH_SIZE 1009
SLIST_HEAD(mapping_listhead, mapping);
SLIST_HEAD(mapping66_listhead, mapping66);
struct mapping_listhead mapping_head;
struct mapping66_listhead mapping66_head;
SLIST_HEAD(mapping_hash_listhead, mapping_hash);
SLIST_HEAD(mapping66_hash_listhead, mapping66_hash);
struct mapping_hash_listhead mapping_hash_4to6_heads[MAPPING_TABLE_HASH_SIZE];
struct mapping_hash_listhead mapping_hash_6to4_heads[MAPPING_TABLE_HASH_SIZE];
//hashtable for a packet from Intra to Global
struct mapping66_hash_listhead mapping66_hash_ItoG_heads[MAPPING_TABLE_HASH_SIZE];
//hashtable for a packet from Global to Intra
struct mapping66_hash_listhead mapping66_hash_GtoI_heads[MAPPING_TABLE_HASH_SIZE];
static struct in6_addr mapping_prefix;
static int mapping_get_hash_index(const void *, int);
static const struct mapping *mapping_find_mapping_with_ip4_addr(const struct
in_addr *);
static const struct mapping *mapping_find_mapping_with_ip6_addr(const struct
in6_addr *);
static const struct mapping66 *mapping66_find_mapping_with_I_addr(const struct
in6_addr *);
static const struct mapping66 *mapping66_find_mapping_with_G_addr(const struct
in6_addr *);
static int mapping_insert_mapping(struct mapping *);
static int mapping66_insert_mapping(struct mapping66 *);
int
mapping_initialize(void)
{
memset(&mapping_prefix, 0, sizeof(struct in6_addr));
SLIST_INIT(&mapping_head);
SLIST_INIT(&mapping66_head);
int count = MAPPING_TABLE_HASH_SIZE;
while (count--) {
SLIST_INIT(&mapping_hash_4to6_heads[count]);
SLIST_INIT(&mapping_hash_6to4_heads[count]);
SLIST_INIT(&mapping66_hash_ItoG_heads[count]);
SLIST_INIT(&mapping66_hash_GtoI_heads[count]);
}
return (0);
}
/*
* Read the configuration file specified as the map646_conf_path
* variable. Each mapping entry is converted to the form of the
* struct mapping{} structure, and stored as SLIST entries.
*/
int
mapping_create_table(const char *map646_conf_path, int depth)
{
assert(map646_conf_path != NULL);
if (depth > 10) {
err(EXIT_FAILURE, "too many recursive include.");
}
FILE *conf_fp;
char *line;
size_t line_cap = 0;
#define TERMLEN 256
char op[TERMLEN], addr1[TERMLEN], addr2[TERMLEN];
conf_fp = fopen(map646_conf_path, "r");
if (conf_fp == NULL) {
err(EXIT_FAILURE, "opening a configuration file %s failed.",
map646_conf_path);
}
int line_count = 0;
while (getline(&line, &line_cap, conf_fp) > 0) {
line_count++;
if (sscanf(line, "%255s %255s %255s", op, addr1, addr2) == -1) {
warn("line %d: syntax error.", line_count);
}
if (strcmp(op, "map-static") == 0) {
struct mapping *mappingp;
mappingp = (struct mapping *)malloc(sizeof(struct mapping));
if (inet_pton(AF_INET, addr1, &mappingp->addr4) != 1) {
warn("line %d: invalid address %s.", line_count, addr1);
free(mappingp);
continue;
}
if (mapping_find_mapping_with_ip4_addr(&mappingp->addr4)) {
warnx("line %d: duplicate entry for addrss %s.", line_count, addr1);
free(mappingp);
continue;
}
if (inet_pton(AF_INET6, addr2, &mappingp->addr6) != 1) {
warn("line %d: invalid address %s.", line_count, addr2);
free(mappingp);
continue;
}
if (mapping_find_mapping_with_ip6_addr(&mappingp->addr6)) {
warnx("line %d: duplicate entry for addrss %s.", line_count, addr2);
free(mappingp);
continue;
}
if (mapping_insert_mapping(mappingp) == -1) {
err(EXIT_FAILURE, "inserting a mapping entry failed.");
}
} else if (strcmp(op, "map66-static") == 0) {
struct mapping66 *mappingp;
mappingp = (struct mapping66 *)malloc(sizeof(struct mapping66));
if (inet_pton(AF_INET6, addr1, &mappingp->global) != 1) {
warn("line %d: invalid address %s.", line_count, addr1);
free(mappingp);
continue;
}
if (mapping66_find_mapping_with_G_addr(&mappingp->global)) {
warnx("line %d: duplicate entry for addrss %s.", line_count, addr1);
free(mappingp);
continue;
}
if (inet_pton(AF_INET6, addr2, &mappingp->intra) != 1) {
warn("line %d: invalid address %s.", line_count, addr2);
free(mappingp);
continue;
}
if (mapping66_find_mapping_with_I_addr(&mappingp->intra)) {
warnx("line %d: duplicate entry for addrss %s.", line_count, addr2);
free(mappingp);
continue;
}
if (mapping66_insert_mapping(mappingp) == -1) {
err(EXIT_FAILURE, "inserting a mapping entry failed.");
}
} else if (strcmp(op, "mapping-prefix") == 0) {
if (inet_pton(AF_INET6, addr1, &mapping_prefix) != 1) {
warn("line %d: invalid address %s.\n", line_count, addr1);
}
} else if (strcmp(op, "include") == 0) {
struct stat sub_conf_stat;
memset(&sub_conf_stat, 0, sizeof(struct stat));
if (stat(addr1, &sub_conf_stat) == 0) {
if (mapping_create_table(addr1, depth + 1) == -1) {
errx(EXIT_FAILURE, "mapping table creation from %s failed.",
addr1);
}
}
} else {
warnx("line %d: unknown operand %s.\n", line_count, op);
}
}
return (0);
}
/* Destroy the mapping table. */
void
mapping_destroy_table(void)
{
/* Clear the IPv6 pseudo prefix information. */
memset(&mapping_prefix, 0, sizeof(struct in6_addr));
/* Clear all the hash entries for the mapping{} structure instances. */
int count = MAPPING_TABLE_HASH_SIZE;
while (count--) {
/* Clear the hash entries for searching by IPv4 address as a key. */
while (!SLIST_EMPTY(&mapping_hash_4to6_heads[count])) {
struct mapping_hash *mhp = SLIST_FIRST(&mapping_hash_4to6_heads[count]);
SLIST_REMOVE_HEAD(&mapping_hash_4to6_heads[count], entries);
free(mhp);
}
/* Clear the hash entries for searching by IPv6 address as a key. */
while (!SLIST_EMPTY(&mapping_hash_6to4_heads[count])) {
struct mapping_hash *mhp = SLIST_FIRST(&mapping_hash_6to4_heads[count]);
SLIST_REMOVE_HEAD(&mapping_hash_6to4_heads[count], entries);
free(mhp);
}
while (!SLIST_EMPTY(&mapping66_hash_ItoG_heads[count])) {
struct mapping66_hash *mhp = SLIST_FIRST(&mapping66_hash_ItoG_heads[count]);
SLIST_REMOVE_HEAD(&mapping66_hash_ItoG_heads[count], entries);
free(mhp);
}
while (!SLIST_EMPTY(&mapping66_hash_GtoI_heads[count])) {
struct mapping66_hash *mhp = SLIST_FIRST(&mapping66_hash_GtoI_heads[count]);
SLIST_REMOVE_HEAD(&mapping66_hash_GtoI_heads[count], entries);
free(mhp);
}
}
/* Clear the actual mapping data list entries. */
while (!SLIST_EMPTY(&mapping_head)) {
struct mapping *mp = SLIST_FIRST(&mapping_head);
SLIST_REMOVE_HEAD(&mapping_head, entries);
free(mp);
}
while (!SLIST_EMPTY(&mapping66_head)) {
struct mapping66 *mp = SLIST_FIRST(&mapping66_head);
SLIST_REMOVE_HEAD(&mapping66_head, entries);
free(mp);
}
}
/*
* Converts IPv4 addresses to corresponding IPv6 addresses, based on
* the IPv4 address information (specified as the first 2 arguments)
* of the incoming packet and the information of the mapping table.
*/
int
mapping_convert_addrs_4to6(const struct in_addr *ip4_src,
const struct in_addr *ip4_dst,
struct in6_addr *ip6_src,
struct in6_addr *ip6_dst)
{
assert(ip4_src != NULL);
assert(ip4_dst != NULL);
assert(ip6_src != NULL);
assert(ip6_dst != NULL);
/*
* The converted IPv6 destination address is the associated address
* of the IPv4 destination address in the mapping table.
*/
const struct mapping *mappingp
= mapping_find_mapping_with_ip4_addr(ip4_dst);
if (mappingp == NULL) {
/* not found. */
warnx("no mapping entry found for %s.", inet_ntoa(*ip4_dst));
return (-1);
}
memcpy((void *)ip6_dst, (const void *)&mappingp->addr6,
sizeof(struct in6_addr));
/*
* IPv6 pseudo source address is concatination of the mapping_prefix
* variable and the IPv4 source address.
*/
memcpy((void *)ip6_src, (const void *)&mapping_prefix,
sizeof(struct in6_addr));
uint8_t *ip4_of_ip6 = (uint8_t *)ip6_src;
ip4_of_ip6 += 12;
memcpy((void *)ip4_of_ip6, (const void *)ip4_src, sizeof(struct in_addr));
return (0);
}
/*
* Converts IPv6 addresses to corresponding IPv4 addresses, based on
* the IPv6 address information (specified as the first 2 arguments)
* of the incoming packet and the information of the mapping table.
*/
int
mapping_convert_addrs_6to4(const struct in6_addr *ip6_src,
const struct in6_addr *ip6_dst,
struct in_addr *ip4_src,
struct in_addr *ip4_dst)
{
assert(ip6_src != NULL);
assert(ip4_src != NULL);
assert((ip6_dst == NULL && ip4_dst == NULL)||(ip6_dst != NULL && ip4_dst != NULL));
/*
* IPv4 destination address comes from the lower 4 bytes of the IPv6
* pseudo destination address.
*/
if(ip4_dst != NULL){
const uint8_t *ip4_of_ip6 = (const uint8_t *)ip6_dst;
ip4_of_ip6 += 12;
memcpy((void *)ip4_dst, (const void *)ip4_of_ip6, sizeof(struct in_addr));
}
/*
* IPv4 psuedo source address is the associated address of the IPv6
* source address in the mapping table.
*/
const struct mapping *mappingp
= mapping_find_mapping_with_ip6_addr(ip6_src);
if (mappingp == NULL) {
/* not found. */
char addr_str[64];
warnx("no mapping entry found for %s.",
inet_ntop(AF_INET6, ip6_src, addr_str, 64));
return (-1);
}
memcpy((void *)ip4_src, (const void *)&mappingp->addr4,
sizeof(struct in_addr));
return (0);
}
/*
* Converts IPv6 addresses to corresponding IPv4 addresses, based on
* the IPv6 address information (specified as the first 2 arguments)
* of the incoming packet and the information of the mapping table.
*/
int
mapping66_convert_addrs_GtoI(const struct in6_addr *ip6_before_src,
const struct in6_addr *ip6_before_dst,
struct in6_addr *ip6_after_src,
struct in6_addr *ip6_after_dst)
{
assert(ip6_before_src != NULL);
assert(ip6_before_dst != NULL);
assert(ip6_after_src != NULL);
assert(ip6_after_dst != NULL);
const struct mapping66 *mappingp
= mapping66_find_mapping_with_G_addr(ip6_before_dst);
if(mappingp){
/*
* The packet is from the Internet
* change dst addr to the corresponding addr
*/
#ifdef DEBUG
warnx("from the Internet");
#endif
memcpy((void *)ip6_after_dst, (const void *)&mappingp->intra, sizeof(struct in6_addr));
memcpy((void *)ip6_after_src, (const void *)ip6_before_src, sizeof(struct in6_addr));
}else{
/*
* no mapping exists
*/
char addr_str[64];
warnx("no mapping entry found for %s.",
inet_ntop(AF_INET6, ip6_before_dst, addr_str, 64));
return (-1);
}
return (0);
}
/*
* Converts IPv6 addresses to corresponding IPv4 addresses, based on
* the IPv6 address information (specified as the first 2 arguments)
* of the incoming packet and the information of the mapping table.
*/
int
mapping66_convert_addrs_ItoG(const struct in6_addr *ip6_before_src,
const struct in6_addr *ip6_before_dst,
struct in6_addr *ip6_after_src,
struct in6_addr *ip6_after_dst)
{
assert(ip6_before_src != NULL);
assert(ip6_after_src != NULL);
assert((ip6_before_dst == NULL && ip6_after_dst == NULL)||(ip6_before_dst != NULL && ip6_after_dst != NULL));
const struct mapping66 *mappingp
= mapping66_find_mapping_with_I_addr(ip6_before_src);
if(mappingp){
/*
* The packet is from the private network
* change src addr to the corresponding addr
*/
#ifdef DEBUG
warnx("from private network");
#endif
memcpy((void *)ip6_after_src, (const void *)&mappingp->global, sizeof(struct in6_addr));
if(ip6_before_dst)
memcpy((void *)ip6_after_dst, (const void *)ip6_before_dst, sizeof(struct in6_addr));
}else{
/*
* no mapping exists
*/
char addr_str[64];
warnx("no mapping entry found for %s.",
inet_ntop(AF_INET6, ip6_before_src, addr_str, 64));
return (-1);
}
return (0);
}
/*
* Install the host route entries for each IPv4 address defined in the
* mapping table, and install the IPv6 network route entry which is
* used to map those IPv4 addresses to pseudo IPv6 addresses used as
* endpoint addresses of the communication with the IPv6 only nodes.
*/
int
mapping_install_route(void)
{
struct mapping *mappingp;
SLIST_FOREACH(mappingp, &mapping_head, entries) {
if (tun_add_route(AF_INET, &mappingp->addr4, 32) == -1) {
warnx("IPv4 host %s route entry addition failed.",
inet_ntoa(mappingp->addr4));
}
}
if (tun_add_route(AF_INET6, &mapping_prefix, 64) == -1) {
char addr_name[64];
warnx("IPv6 pseudo mapping prefix %s route entry addition failed.",
inet_ntop(AF_INET6, &mapping_prefix, addr_name, 64));
return (-1);
}
if(tun_create_policy_table() == -1){
warnx("failed to create policy table");
return(-1);
}
struct mapping66 *mapping66p;
SLIST_FOREACH(mapping66p, &mapping66_head, entries) {
if (tun_add_route(AF_INET6, &mapping66p->global, 128) == -1){
char addr_name[64];
warnx("IPv6 host %s route entry addition failed.",
inet_ntop(AF_INET6, &mapping66p->global, addr_name, 64));
}
if (tun_add_policy(AF_INET6, &mapping66p->intra, 128) == -1) {
char addr_name[64];
warnx("IPv6 host %s policy route entry addition failed.",
inet_ntop(AF_INET6, &mapping66p->intra, addr_name, 64));
}
}
return (0);
}
/*
* Delete all the route entries installed by the
* mapping_install_route() function.
*/
int
mapping_uninstall_route(void)
{
struct mapping *mappingp;
SLIST_FOREACH(mappingp, &mapping_head, entries) {
if (tun_delete_route(AF_INET, &mappingp->addr4, 32) == -1) {
warnx("IPv4 host %s route entry deletion failed.",
inet_ntoa(mappingp->addr4));
}
}
if (tun_delete_route(AF_INET6, &mapping_prefix, 64) == -1) {
char addr_str[64];
warnx("IPv6 pseudo mapping prefix %s route entry deletion failed.",
inet_ntop(AF_INET6, &mapping_prefix, addr_str, 64));
return (-1);
}
tun_delete_policy();
return (0);
}
/*
* Calculate the hash index from the data given. Currently, the data
* will be either IPv4 address or IPv6 address.
*
* The current index calculation algorithm is not very smart. It just
* sums all the data considering they are a seriese of 2 bytes of
* integers. More improvement may be necessary.
*/
static int
mapping_get_hash_index(const void *data, int data_len)
{
assert(data != NULL);
assert(data_len > 0);
uint16_t *datap = (uint16_t *)data;
data_len = data_len >> 1;
uint32_t sum = 0;
while (data_len--) {
sum += *datap++;
}
return (sum % MAPPING_TABLE_HASH_SIZE);
}
/*
* Find the instance of the mapping{} structure which has the
* specified IPv4 address in its mapping information.
*/
static const struct mapping *
mapping_find_mapping_with_ip4_addr(const struct in_addr *addrp)
{
assert(addrp != NULL);
int hash_index = mapping_get_hash_index(addrp, sizeof(struct in_addr));
struct mapping_hash *mapping_hashp = NULL;
struct mapping *mappingp = NULL;
SLIST_FOREACH(mapping_hashp, &mapping_hash_4to6_heads[hash_index], entries) {
mappingp = mapping_hashp->mappingp;
if (memcmp((const void *)addrp, (const void *)&mappingp->addr4,
sizeof(struct in_addr)) == 0)
/* Found. */
return (mappingp);
}
return (NULL);
}
/*
* Find the instance of the mapping{} structure which has the
* specified IPv6 address in its mapping information.
*/
static const struct mapping *
mapping_find_mapping_with_ip6_addr(const struct in6_addr *addrp)
{
assert(addrp != NULL);
int hash_index = mapping_get_hash_index(addrp, sizeof(struct in6_addr));
struct mapping_hash *mapping_hashp = NULL;
struct mapping *mappingp = NULL;
SLIST_FOREACH(mapping_hashp, &mapping_hash_6to4_heads[hash_index], entries) {
mappingp = mapping_hashp->mappingp;
if (memcmp((const void *)addrp, (const void *)&mappingp->addr6,
sizeof(struct in6_addr)) == 0)
/* Found. */
return (mappingp);
}
return (NULL);
}
/*
* Find the instance of the mapping{} structure which has the
* specified IPv6 address in its mapping information.
*/
static const struct mapping66 *
mapping66_find_mapping_with_G_addr(const struct in6_addr *addrp)
{
assert(addrp != NULL);
int hash_index = mapping_get_hash_index(addrp, sizeof(struct in6_addr));
struct mapping66_hash *mapping_hashp = NULL;
struct mapping66 *mappingp = NULL;
SLIST_FOREACH(mapping_hashp, &mapping66_hash_GtoI_heads[hash_index], entries) {
mappingp = mapping_hashp->mappingp;
if (memcmp((const void *)addrp, (const void *)&mappingp->global,
sizeof(struct in6_addr)) == 0)
/* Found. */
return (mappingp);
}
return (NULL);
}
/*
* Find the instance of the mapping{} structure which has the
* specified IPv6 address in its mapping information.
*/
static const struct mapping66 *
mapping66_find_mapping_with_I_addr(const struct in6_addr *addrp)
{
assert(addrp != NULL);
int hash_index = mapping_get_hash_index(addrp, sizeof(struct in6_addr));
struct mapping66_hash *mapping_hashp = NULL;
struct mapping66 *mappingp = NULL;
SLIST_FOREACH(mapping_hashp, &mapping66_hash_ItoG_heads[hash_index], entries) {
mappingp = mapping_hashp->mappingp;
if (memcmp((const void *)addrp, (const void *)&mappingp->intra,
sizeof(struct in6_addr)) == 0)
/* Found. */
return (mappingp);
}
return (NULL);
}
/*
* Insert a new instance of the mapping{} structure to the list, and
* at the same time insert the index information to the two hash
* tables, one is for searching with IPv4 address, the other is for
* searching with IPv6 address.
*/
static int
mapping_insert_mapping(struct mapping *new_mappingp)
{
assert(new_mappingp != NULL);
/*
* Insert the new hash entry to the hash table for IPv4 address
* based search.
*/
if (mapping_find_mapping_with_ip4_addr(&new_mappingp->addr4) == NULL) {
int hash_index;
hash_index = mapping_get_hash_index(&new_mappingp->addr4,
sizeof(struct in_addr));
struct mapping_hash *mapping_hashp;
mapping_hashp = malloc(sizeof(struct mapping_hash));
if (mapping_hashp == NULL) {
warnx("memory allocation failed for struct mapping_hash{}.");
return (-1);
}
memset(mapping_hashp, 0, sizeof(struct mapping_hash));
mapping_hashp->mappingp = new_mappingp;
SLIST_INSERT_HEAD(&mapping_hash_4to6_heads[hash_index], mapping_hashp,
entries);
}
/*
* Insert the new hash entry to the hash table for IPv6 address
* based search.
*/
if (mapping_find_mapping_with_ip6_addr(&new_mappingp->addr6) == NULL) {
int hash_index;
hash_index = mapping_get_hash_index(&new_mappingp->addr6,
sizeof(struct in6_addr));
struct mapping_hash *mapping_hashp;
mapping_hashp = malloc(sizeof(struct mapping_hash));
if (mapping_hashp == NULL) {
warnx("memory allocation failed for struct mapping_hash{}.");
/* XXX: we should remove the hash entry inserted in the above
block before returning from this function with an error. */
return (-1);
}
memset(mapping_hashp, 0, sizeof(struct mapping_hash));
mapping_hashp->mappingp = new_mappingp;
SLIST_INSERT_HEAD(&mapping_hash_6to4_heads[hash_index], mapping_hashp,
entries);
}
/* Insert the new mapping{} instance to the global list. */
SLIST_INSERT_HEAD(&mapping_head, new_mappingp, entries);
return (0);
}
/*
* Insert a new instance of the mapping{} structure to the list, and
* at the same time insert the index information to the 66 hash
* tables, which is for searching with IPv6 address
*/
static int
mapping66_insert_mapping(struct mapping66 *new_mappingp)
{
assert(new_mappingp != NULL);
/*
* Insert the new hash entry to the hash table for first IPv6 address
* based search.
*/
if (mapping66_find_mapping_with_G_addr(&new_mappingp->global) == NULL) {
int hash_index;
hash_index = mapping_get_hash_index(&new_mappingp->global,
sizeof(struct in6_addr));
struct mapping66_hash *mapping_hashp;
mapping_hashp = malloc(sizeof(struct mapping66_hash));
if (mapping_hashp == NULL) {
warnx("memory allocation failed for struct mapping_hash{}.");
return (-1);
}
memset(mapping_hashp, 0, sizeof(struct mapping66_hash));
mapping_hashp->mappingp = new_mappingp;
SLIST_INSERT_HEAD(&mapping66_hash_GtoI_heads[hash_index], mapping_hashp,
entries);
}
/*
* Insert the new hash entry to the hash table for IPv6 address
* based search.
*/
if (mapping66_find_mapping_with_I_addr(&new_mappingp->intra) == NULL) {
int hash_index;
hash_index = mapping_get_hash_index(&new_mappingp->intra,
sizeof(struct in6_addr));
struct mapping66_hash *mapping_hashp;
mapping_hashp = malloc(sizeof(struct mapping66_hash));
if (mapping_hashp == NULL) {
warnx("memory allocation failed for struct mapping_hash{}.");
/* XXX: we should remove the hash entry inserted in the above
block before returning from this function with an error. */
return (-1);
}
memset(mapping_hashp, 0, sizeof(struct mapping66_hash));
mapping_hashp->mappingp = new_mappingp;
SLIST_INSERT_HEAD(&mapping66_hash_ItoG_heads[hash_index], mapping_hashp,
entries);
}
/* Insert the new mapping{} instance to the global list. */
SLIST_INSERT_HEAD(&mapping66_head, new_mappingp, entries);
return (0);
}
uint8_t
dispatch(uint8_t *bufp)
{
assert(bufp != NULL);
uint32_t af = 0;
af = tun_get_af(bufp);
bufp += sizeof(uint32_t);
#ifdef DEBUG
fprintf(stderr, "af = %d\n", af);
#endif
if(af == AF_INET){
return FOURTOSIX;
}else if(af == AF_INET6){
struct ip6_hdr *ip6_hdrp = (struct ip6_hdr *)bufp;
const struct mapping66 *mapping66p
= mapping66_find_mapping_with_I_addr(&ip6_hdrp->ip6_src);
const struct mapping *mappingp
= mapping_find_mapping_with_ip6_addr(&ip6_hdrp->ip6_src);
if(!mapping66p && !mappingp){
return SIXTOSIX_GtoI;
}else{
if(memcmp(&ip6_hdrp->ip6_dst, &mapping_prefix, 8) == 0)
return SIXTOFOUR;
else
return SIXTOSIX_ItoG;
}
}
return 0;
}