summaryrefslogtreecommitdiff
path: root/lib/ipv6.h
blob: 35d8e29d5922dd089d3e89644445e64cb498d905 (plain)
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
/*
 *	BIRD -- IP Addresses et Cetera for IPv6
 *
 *	(c) 1998 Martin Mares <mj@ucw.cz>
 *
 *	Can be freely distributed and used under the terms of the GNU GPL.
 */

#ifndef _BIRD_IPV6_H_
#define _BIRD_IPV6_H_

#include <netinet/in.h>
#include <string.h>

typedef struct ipv4_addr {
  u32 addr[4];
} ip_addr;

#define _MI(a,b,c,d) ((struct ip_addr) { a, b, c, d })
#define _I0(a) ((a).addr[0])
#define _I1(a) ((a).addr[1])
#define _I2(a) ((a).addr[2])
#define _I3(a) ((a).addr[3])

#define BITS_PER_IP_ADDRESS 128
#define STD_ADDRESS_P_LENGTH 39

#define IPA_NONE _MI(0,0,0,0)

#define ipa_equal(x,y) (!memcmp(&(x),&(y),sizeof(ip_addr)))
#define ipa_nonzero(x) (_I0(a) || _I1(a) || _I2(a) || _I3(a))
#define ipa_and(a,b) _MI(_I0(a) & _I0(b), \
			 _I1(a) & _I1(b), \
			 _I2(a) & _I2(b), \
			 _I3(a) & _I3(b))
#define ipa_or(a,b) _MI(_I0(a) | _I0(b), \
			_I1(a) | _I1(b), \
			_I2(a) | _I2(b), \
			_I3(a) | _I3(b))
#define ipa_xor(a,b) _MI(_I0(a) ^ _I0(b), \
			 _I1(a) ^ _I1(b), \
			 _I2(a) ^ _I2(b), \
			 _I3(a) ^ _I3(b))
#define ipa_not(a) _MI(~_I0(a),~_I1(a),~_I2(a),~_I3(a))
#define ipa_mkmask(x) ipv6_mkmask(x)
#define ipa_mklen(x) ipv6_mklen(&(x))
#define ipa_hash(x) ipv6_hash(&(x))
#define ipa_hton(x) ipv6_hton(&(x))
#define ipa_ntoh(x) ipv6_ntoh(&(x))
#define ipa_classify(x) ipv6_classify(&(x))

ip_addr ipv6_mkmask(unsigned);
unsigned ipv6_mklen(ip_addr *);
int ipv6_classify(ip_addr *);
void ipv6_hton(ip_addr *);
void ipv6_ntoh(ip_addr *);

/* FIXME: Is this hash function uniformly distributed over standard routing tables? */
static inline unsigned ipv6_hash(ip_addr *a)
{
  u32 x = _I0(*a) ^ _I1(*a) ^ _I2(*a) ^ _I3(*a);
  return (x ^ (x >> 16) ^ (x >> 8)) & 0xffff;
}

#endif