1 /*
2 * Definitions and Declarations for tuple.
3 *
4 * 16 Dec 2003: Yasuyuki Kozakai @USAGI <yasuyuki.kozakai@toshiba.co.jp>
5 * - generalize L3 protocol dependent part.
6 *
7 * Derived from include/linux/netfiter_ipv4/ip_conntrack_tuple.h
8 */
9
10 #ifndef _NF_CONNTRACK_TUPLE_H
11 #define _NF_CONNTRACK_TUPLE_H
12
13 #include <linux/netfilter/x_tables.h>
14 #include <linux/netfilter/nf_conntrack_tuple_common.h>
15
16 /* A `tuple' is a structure containing the information to uniquely
17 identify a connection. ie. if two packets have the same tuple, they
18 are in the same connection; if not, they are not.
19
20 We divide the structure along "manipulatable" and
21 "non-manipulatable" lines, for the benefit of the NAT code.
22 */
23
24 #define NF_CT_TUPLE_L3SIZE ARRAY_SIZE(((union nf_inet_addr *)NULL)->all)
25
26 /* The protocol-specific manipulable parts of the tuple: always in
27 network order! */
28 union nf_conntrack_man_proto
29 {
30 /* Add other protocols here. */
31 __be16 all;
32
33 struct {
34 __be16 port;
35 } tcp;
36 struct {
37 __be16 port;
38 } udp;
39 struct {
40 __be16 id;
41 } icmp;
42 struct {
43 __be16 port;
44 } sctp;
45 struct {
46 __be16 key; /* GRE key is 32bit, PPtP only uses 16bit */
47 } gre;
48 };
49
50 /* The manipulable part of the tuple. */
51 struct nf_conntrack_man
52 {
53 union nf_inet_addr u3;
54 union nf_conntrack_man_proto u;
55 /* Layer 3 protocol */
56 u_int16_t l3num;
57 };
58
59 /* This contains the information to distinguish a connection. */
60 struct nf_conntrack_tuple
61 {
62 struct nf_conntrack_man src;
63
64 /* These are the parts of the tuple which are fixed. */
65 struct {
66 union nf_inet_addr u3;
67 union {
68 /* Add other protocols here. */
69 __be16 all;
70
71 struct {
72 __be16 port;
73 } tcp;
74 struct {
75 __be16 port;
76 } udp;
77 struct {
78 u_int8_t type, code;
79 } icmp;
80 struct {
81 __be16 port;
82 } sctp;
83 struct {
84 __be16 key;
85 } gre;
86 } u;
87
88 /* The protocol. */
89 u_int8_t protonum;
90
91 /* The direction (for tuplehash) */
92 u_int8_t dir;
93 } dst;
94 };
95
96 struct nf_conntrack_tuple_mask
97 {
98 struct {
99 union nf_inet_addr u3;
100 union nf_conntrack_man_proto u;
101 } src;
102 };
103
104 /* This is optimized opposed to a memset of the whole structure. Everything we
105 * really care about is the source/destination unions */
106 #define NF_CT_TUPLE_U_BLANK(tuple) \
107 do { \
108 (tuple)->src.u.all = 0; \
109 (tuple)->dst.u.all = 0; \
110 memset(&(tuple)->src.u3, 0, sizeof((tuple)->src.u3)); \
111 memset(&(tuple)->dst.u3, 0, sizeof((tuple)->dst.u3)); \
112 } while (0)
113
114 #ifdef __KERNEL__
115
116 #define NF_CT_DUMP_TUPLE(tp) \
117 pr_debug("tuple %p: %u %u " NIP6_FMT " %hu -> " NIP6_FMT " %hu\n", \
118 (tp), (tp)->src.l3num, (tp)->dst.protonum, \
119 NIP6(*(struct in6_addr *)(tp)->src.u3.all), ntohs((tp)->src.u.all), \
120 NIP6(*(struct in6_addr *)(tp)->dst.u3.all), ntohs((tp)->dst.u.all))
121
122 /* If we're the first tuple, it's the original dir. */
123 #define NF_CT_DIRECTION(h) \
124 ((enum ip_conntrack_dir)(h)->tuple.dst.dir)
125
126 /* Connections have two entries in the hash table: one for each way */
127 struct nf_conntrack_tuple_hash
128 {
129 struct hlist_node hnode;
130 struct nf_conntrack_tuple tuple;
131 };
132
133 #endif /* __KERNEL__ */
134
135 static inline int __nf_ct_tuple_src_equal(const struct nf_conntrack_tuple *t1,
136 const struct nf_conntrack_tuple *t2)
137 {
138 return (t1->src.u3.all[0] == t2->src.u3.all[0] &&
139 t1->src.u3.all[1] == t2->src.u3.all[1] &&
140 t1->src.u3.all[2] == t2->src.u3.all[2] &&
141 t1->src.u3.all[3] == t2->src.u3.all[3] &&
142 t1->src.u.all == t2->src.u.all &&
143 t1->src.l3num == t2->src.l3num);
144 }
145
146 static inline int __nf_ct_tuple_dst_equal(const struct nf_conntrack_tuple *t1,
147 const struct nf_conntrack_tuple *t2)
148 {
149 return (t1->dst.u3.all[0] == t2->dst.u3.all[0] &&
150 t1->dst.u3.all[1] == t2->dst.u3.all[1] &&
151 t1->dst.u3.all[2] == t2->dst.u3.all[2] &&
152 t1->dst.u3.all[3] == t2->dst.u3.all[3] &&
153 t1->dst.u.all == t2->dst.u.all &&
154 t1->dst.protonum == t2->dst.protonum);
155 }
156
157 static inline int nf_ct_tuple_equal(const struct nf_conntrack_tuple *t1,
158 const struct nf_conntrack_tuple *t2)
159 {
160 return __nf_ct_tuple_src_equal(t1, t2) &&
161 __nf_ct_tuple_dst_equal(t1, t2);
162 }
163
164 static inline int nf_ct_tuple_mask_equal(const struct nf_conntrack_tuple_mask *m1,
165 const struct nf_conntrack_tuple_mask *m2)
166 {
167 return (m1->src.u3.all[0] == m2->src.u3.all[0] &&
168 m1->src.u3.all[1] == m2->src.u3.all[1] &&
169 m1->src.u3.all[2] == m2->src.u3.all[2] &&
170 m1->src.u3.all[3] == m2->src.u3.all[3] &&
171 m1->src.u.all == m2->src.u.all);
172 }
173
174 static inline int nf_ct_tuple_src_mask_cmp(const struct nf_conntrack_tuple *t1,
175 const struct nf_conntrack_tuple *t2,
176 const struct nf_conntrack_tuple_mask *mask)
177 {
178 int count;
179
180 for (count = 0; count < NF_CT_TUPLE_L3SIZE; count++) {
181 if ((t1->src.u3.all[count] ^ t2->src.u3.all[count]) &
182 mask->src.u3.all[count])
183 return 0;
184 }
185
186 if ((t1->src.u.all ^ t2->src.u.all) & mask->src.u.all)
187 return 0;
188
189 if (t1->src.l3num != t2->src.l3num ||
190 t1->dst.protonum != t2->dst.protonum)
191 return 0;
192
193 return 1;
194 }
195
196 static inline int nf_ct_tuple_mask_cmp(const struct nf_conntrack_tuple *t,
197 const struct nf_conntrack_tuple *tuple,
198 const struct nf_conntrack_tuple_mask *mask)
199 {
200 return nf_ct_tuple_src_mask_cmp(t, tuple, mask) &&
201 __nf_ct_tuple_dst_equal(t, tuple);
202 }
203
204 #endif /* _NF_CONNTRACK_TUPLE_H */
205
|
This page was automatically generated by the
LXR engine.
|