blob: 2cc64e195463f8df347a3a92684783a6e1c900f8 [file] [log] [blame]
Neale Ranns999c8ee2019-02-01 03:31:24 -08001/*
2 * Copyright (c) 2015 Cisco and/or its affiliates.
3 * Licensed under the Apache License, Version 2.0 (the "License");
4 * you may not use this file except in compliance with the License.
5 * You may obtain a copy of the License at:
6 *
7 * http://www.apache.org/licenses/LICENSE-2.0
8 *
9 * Unless required by applicable law or agreed to in writing, software
10 * distributed under the License is distributed on an "AS IS" BASIS,
11 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
12 * See the License for the specific language governing permissions and
13 * limitations under the License.
14 */
15#ifndef __IPSEC_SPD_SA_H__
16#define __IPSEC_SPD_SA_H__
17
18#include <vlib/vlib.h>
Filip Tehlare5d34912020-03-02 15:17:37 +000019#include <vnet/crypto/crypto.h>
Neale Ranns999c8ee2019-02-01 03:31:24 -080020#include <vnet/ip/ip.h>
Neale Ranns8d7c5022019-02-06 01:41:05 -080021#include <vnet/fib/fib_node.h>
Neale Ranns041add72020-01-02 04:06:10 +000022#include <vnet/tunnel/tunnel.h>
Neale Ranns999c8ee2019-02-01 03:31:24 -080023
24#define foreach_ipsec_crypto_alg \
25 _ (0, NONE, "none") \
26 _ (1, AES_CBC_128, "aes-cbc-128") \
27 _ (2, AES_CBC_192, "aes-cbc-192") \
28 _ (3, AES_CBC_256, "aes-cbc-256") \
29 _ (4, AES_CTR_128, "aes-ctr-128") \
30 _ (5, AES_CTR_192, "aes-ctr-192") \
31 _ (6, AES_CTR_256, "aes-ctr-256") \
32 _ (7, AES_GCM_128, "aes-gcm-128") \
33 _ (8, AES_GCM_192, "aes-gcm-192") \
34 _ (9, AES_GCM_256, "aes-gcm-256") \
35 _ (10, DES_CBC, "des-cbc") \
36 _ (11, 3DES_CBC, "3des-cbc")
37
38typedef enum
39{
40#define _(v, f, s) IPSEC_CRYPTO_ALG_##f = v,
41 foreach_ipsec_crypto_alg
42#undef _
43 IPSEC_CRYPTO_N_ALG,
Neale Ranns123b5eb2020-10-16 14:03:55 +000044} __clib_packed ipsec_crypto_alg_t;
Neale Ranns999c8ee2019-02-01 03:31:24 -080045
Neale Ranns47feb112019-04-11 15:14:07 +000046#define IPSEC_CRYPTO_ALG_IS_GCM(_alg) \
47 (((_alg == IPSEC_CRYPTO_ALG_AES_GCM_128) || \
48 (_alg == IPSEC_CRYPTO_ALG_AES_GCM_192) || \
49 (_alg == IPSEC_CRYPTO_ALG_AES_GCM_256)))
50
Benoît Ganne490b9272021-01-22 18:03:09 +010051#define IPSEC_CRYPTO_ALG_IS_CTR(_alg) \
52 (((_alg == IPSEC_CRYPTO_ALG_AES_CTR_128) || \
53 (_alg == IPSEC_CRYPTO_ALG_AES_CTR_192) || \
54 (_alg == IPSEC_CRYPTO_ALG_AES_CTR_256)))
55
Neale Ranns999c8ee2019-02-01 03:31:24 -080056#define foreach_ipsec_integ_alg \
57 _ (0, NONE, "none") \
58 _ (1, MD5_96, "md5-96") /* RFC2403 */ \
59 _ (2, SHA1_96, "sha1-96") /* RFC2404 */ \
60 _ (3, SHA_256_96, "sha-256-96") /* draft-ietf-ipsec-ciph-sha-256-00 */ \
61 _ (4, SHA_256_128, "sha-256-128") /* RFC4868 */ \
62 _ (5, SHA_384_192, "sha-384-192") /* RFC4868 */ \
63 _ (6, SHA_512_256, "sha-512-256") /* RFC4868 */
64
65typedef enum
66{
67#define _(v, f, s) IPSEC_INTEG_ALG_##f = v,
68 foreach_ipsec_integ_alg
69#undef _
70 IPSEC_INTEG_N_ALG,
Neale Ranns123b5eb2020-10-16 14:03:55 +000071} __clib_packed ipsec_integ_alg_t;
Neale Ranns999c8ee2019-02-01 03:31:24 -080072
73typedef enum
74{
75 IPSEC_PROTOCOL_AH = 0,
76 IPSEC_PROTOCOL_ESP = 1
Neale Ranns123b5eb2020-10-16 14:03:55 +000077} __clib_packed ipsec_protocol_t;
Neale Ranns999c8ee2019-02-01 03:31:24 -080078
Neale Ranns8d7c5022019-02-06 01:41:05 -080079#define IPSEC_KEY_MAX_LEN 128
80typedef struct ipsec_key_t_
81{
82 u8 len;
83 u8 data[IPSEC_KEY_MAX_LEN];
84} ipsec_key_t;
85
86/*
87 * Enable extended sequence numbers
88 * Enable Anti-replay
89 * IPsec tunnel mode if non-zero, else transport mode
90 * IPsec tunnel mode is IPv6 if non-zero,
91 * else IPv4 tunnel only valid if is_tunnel is non-zero
92 * enable UDP encapsulation for NAT traversal
93 */
Benoît Ganne490b9272021-01-22 18:03:09 +010094#define foreach_ipsec_sa_flags \
95 _ (0, NONE, "none") \
96 _ (1, USE_ESN, "esn") \
97 _ (2, USE_ANTI_REPLAY, "anti-replay") \
98 _ (4, IS_TUNNEL, "tunnel") \
99 _ (8, IS_TUNNEL_V6, "tunnel-v6") \
100 _ (16, UDP_ENCAP, "udp-encap") \
101 _ (32, IS_PROTECT, "Protect") \
102 _ (64, IS_INBOUND, "inbound") \
103 _ (128, IS_AEAD, "aead") \
Neale Rannsf16e9a52021-02-25 19:09:24 +0000104 _ (256, IS_CTR, "ctr") \
105 _ (512, IS_ASYNC, "async")
Neale Ranns8d7c5022019-02-06 01:41:05 -0800106
107typedef enum ipsec_sad_flags_t_
108{
109#define _(v, f, s) IPSEC_SA_FLAG_##f = v,
110 foreach_ipsec_sa_flags
111#undef _
Damjan Marion1f4e1cb2019-03-28 19:19:31 +0100112} __clib_packed ipsec_sa_flags_t;
Damjan Mariond709cbc2019-03-26 13:16:42 +0100113
Benoît Ganne490b9272021-01-22 18:03:09 +0100114STATIC_ASSERT (sizeof (ipsec_sa_flags_t) == 2, "IPSEC SA flags != 2 byte");
Neale Ranns8d7c5022019-02-06 01:41:05 -0800115
Neale Ranns999c8ee2019-02-01 03:31:24 -0800116typedef struct
117{
Damjan Mariond709cbc2019-03-26 13:16:42 +0100118 CLIB_CACHE_LINE_ALIGN_MARK (cacheline0);
Neale Ranns999c8ee2019-02-01 03:31:24 -0800119
Damjan Mariond709cbc2019-03-26 13:16:42 +0100120 /* flags */
121 ipsec_sa_flags_t flags;
122
Damjan Marionb966e8b2019-03-20 16:07:09 +0100123 u8 crypto_iv_size;
Christian Hoppsfb7e7ed2019-11-03 07:02:15 -0500124 u8 esp_block_align;
Damjan Marion7c22ff72019-04-04 12:25:44 +0200125 u8 integ_icv_size;
Benoît Ganne490b9272021-01-22 18:03:09 +0100126
127 u8 __pad1[3];
128
Neale Ranns1a52d372021-02-04 11:33:32 +0000129 u32 thread_index;
Benoît Ganne490b9272021-01-22 18:03:09 +0100130
Damjan Mariond709cbc2019-03-26 13:16:42 +0100131 u32 spi;
Neale Ranns999c8ee2019-02-01 03:31:24 -0800132 u32 seq;
133 u32 seq_hi;
Neale Ranns999c8ee2019-02-01 03:31:24 -0800134 u64 replay_window;
Neale Ranns5b891102021-06-28 13:31:28 +0000135 u64 ctr_iv_counter;
Neale Ranns72f2a3a2019-06-17 15:43:38 +0000136 dpo_id_t dpo;
Damjan Mariond709cbc2019-03-26 13:16:42 +0100137
Damjan Mariond1bed682019-04-24 15:20:35 +0200138 vnet_crypto_key_index_t crypto_key_index;
139 vnet_crypto_key_index_t integ_key_index;
Fan Zhangf5395782020-04-29 14:00:03 +0100140
141 /* Union data shared by sync and async ops, updated when mode is
142 * changed. */
143 union
144 {
145 struct
146 {
147 vnet_crypto_op_id_t crypto_enc_op_id:16;
148 vnet_crypto_op_id_t crypto_dec_op_id:16;
149 vnet_crypto_op_id_t integ_op_id:16;
150 };
151
152 struct
153 {
154 vnet_crypto_async_op_id_t crypto_async_enc_op_id:16;
155 vnet_crypto_async_op_id_t crypto_async_dec_op_id:16;
156 vnet_crypto_key_index_t linked_key_index;
157 };
158
159 u64 crypto_op_data;
160 };
Damjan Mariond709cbc2019-03-26 13:16:42 +0100161
Benoît Ganne490b9272021-01-22 18:03:09 +0100162 CLIB_CACHE_LINE_ALIGN_MARK (cacheline1);
Damjan Mariond709cbc2019-03-26 13:16:42 +0100163
164 union
165 {
166 ip4_header_t ip4_hdr;
167 ip6_header_t ip6_hdr;
168 };
169 udp_header_t udp_hdr;
170
Benoît Ganne490b9272021-01-22 18:03:09 +0100171 /* Salt used in CTR modes (incl. GCM) - stored in network byte order */
Neale Ranns80f6fd52019-04-16 02:41:34 +0000172 u32 salt;
Fan Zhangf5395782020-04-29 14:00:03 +0100173
Neale Ranns123b5eb2020-10-16 14:03:55 +0000174 ipsec_protocol_t protocol;
Neale Ranns041add72020-01-02 04:06:10 +0000175 tunnel_encap_decap_flags_t tunnel_flags;
Neale Ranns9ec846c2021-02-09 14:04:02 +0000176 u8 __pad[2];
Neale Ranns123b5eb2020-10-16 14:03:55 +0000177
178 /* data accessed by dataplane code should be above this comment */
179 CLIB_CACHE_LINE_ALIGN_MARK (cacheline2);
180
181 /* Elements with u64 size multiples */
Fan Zhangf5395782020-04-29 14:00:03 +0100182 union
183 {
184 struct
185 {
186 vnet_crypto_op_id_t crypto_enc_op_id:16;
187 vnet_crypto_op_id_t crypto_dec_op_id:16;
188 vnet_crypto_op_id_t integ_op_id:16;
189 };
190 u64 data;
191 } sync_op_data;
192
193 union
194 {
195 struct
196 {
197 vnet_crypto_async_op_id_t crypto_async_enc_op_id:16;
198 vnet_crypto_async_op_id_t crypto_async_dec_op_id:16;
199 vnet_crypto_key_index_t linked_key_index;
200 };
201 u64 data;
202 } async_op_data;
Neale Ranns123b5eb2020-10-16 14:03:55 +0000203
Neale Ranns9ec846c2021-02-09 14:04:02 +0000204 tunnel_t tunnel;
Neale Ranns123b5eb2020-10-16 14:03:55 +0000205
206 fib_node_t node;
207
208 /* elements with u32 size */
209 u32 id;
210 u32 stat_index;
211 vnet_crypto_alg_t integ_calg;
212 vnet_crypto_alg_t crypto_calg;
213
Neale Ranns123b5eb2020-10-16 14:03:55 +0000214 /* else u8 packed */
215 ipsec_crypto_alg_t crypto_alg;
216 ipsec_integ_alg_t integ_alg;
217
218 ipsec_key_t integ_key;
219 ipsec_key_t crypto_key;
Neale Ranns999c8ee2019-02-01 03:31:24 -0800220} ipsec_sa_t;
221
Damjan Mariond709cbc2019-03-26 13:16:42 +0100222STATIC_ASSERT_OFFSET_OF (ipsec_sa_t, cacheline1, CLIB_CACHE_LINE_BYTES);
Neale Ranns123b5eb2020-10-16 14:03:55 +0000223STATIC_ASSERT_OFFSET_OF (ipsec_sa_t, cacheline2, 2 * CLIB_CACHE_LINE_BYTES);
Damjan Mariond709cbc2019-03-26 13:16:42 +0100224
Neale Rannsc5fe57d2021-02-25 16:01:28 +0000225/**
226 * Pool of IPSec SAs
227 */
228extern ipsec_sa_t *ipsec_sa_pool;
229
Neale Rannsaa7d7662021-02-10 08:42:49 +0000230/*
231 * Ensure that the IPsec data does not overlap with the IP data in
232 * the buffer meta data
233 */
234STATIC_ASSERT (STRUCT_OFFSET_OF (vnet_buffer_opaque_t, ipsec.sad_index) ==
235 STRUCT_OFFSET_OF (vnet_buffer_opaque_t, ip.save_protocol),
236 "IPSec data is overlapping with IP data");
237
Damjan Mariond709cbc2019-03-26 13:16:42 +0100238#define _(a,v,s) \
239 always_inline int \
240 ipsec_sa_is_set_##v (const ipsec_sa_t *sa) { \
241 return (sa->flags & IPSEC_SA_FLAG_##v); \
242 }
243foreach_ipsec_sa_flags
244#undef _
245#define _(a,v,s) \
246 always_inline int \
247 ipsec_sa_set_##v (ipsec_sa_t *sa) { \
248 return (sa->flags |= IPSEC_SA_FLAG_##v); \
249 }
250 foreach_ipsec_sa_flags
251#undef _
Neale Rannsc87b66c2019-02-07 07:26:12 -0800252#define _(a,v,s) \
253 always_inline int \
254 ipsec_sa_unset_##v (ipsec_sa_t *sa) { \
255 return (sa->flags &= ~IPSEC_SA_FLAG_##v); \
256 }
257 foreach_ipsec_sa_flags
258#undef _
Neale Rannseba31ec2019-02-17 18:04:27 +0000259/**
260 * @brief
261 * SA packet & bytes counters
262 */
263extern vlib_combined_counter_main_t ipsec_sa_counters;
Neale Rannse11203e2021-09-21 12:34:19 +0000264extern vlib_simple_counter_main_t ipsec_sa_lost_counters;
Neale Rannseba31ec2019-02-17 18:04:27 +0000265
Neale Ranns8d7c5022019-02-06 01:41:05 -0800266extern void ipsec_mk_key (ipsec_key_t * key, const u8 * data, u8 len);
267
Neale Ranns9ec846c2021-02-09 14:04:02 +0000268extern int
269ipsec_sa_add_and_lock (u32 id, u32 spi, ipsec_protocol_t proto,
270 ipsec_crypto_alg_t crypto_alg, const ipsec_key_t *ck,
271 ipsec_integ_alg_t integ_alg, const ipsec_key_t *ik,
272 ipsec_sa_flags_t flags, u32 salt, u16 src_port,
273 u16 dst_port, const tunnel_t *tun, u32 *sa_out_index);
Neale Ranns495d7ff2019-07-12 09:15:26 +0000274extern index_t ipsec_sa_find_and_lock (u32 id);
275extern int ipsec_sa_unlock_id (u32 id);
276extern void ipsec_sa_unlock (index_t sai);
Neale Ranns12989b52019-09-26 16:20:19 +0000277extern void ipsec_sa_lock (index_t sai);
Neale Rannsc87b66c2019-02-07 07:26:12 -0800278extern void ipsec_sa_clear (index_t sai);
Damjan Marionb966e8b2019-03-20 16:07:09 +0100279extern void ipsec_sa_set_crypto_alg (ipsec_sa_t * sa,
280 ipsec_crypto_alg_t crypto_alg);
281extern void ipsec_sa_set_integ_alg (ipsec_sa_t * sa,
282 ipsec_integ_alg_t integ_alg);
Neale Ranns8d7c5022019-02-06 01:41:05 -0800283
Neale Rannsb4cfd552019-02-13 02:08:06 -0800284typedef walk_rc_t (*ipsec_sa_walk_cb_t) (ipsec_sa_t * sa, void *ctx);
285extern void ipsec_sa_walk (ipsec_sa_walk_cb_t cd, void *ctx);
286
Neale Rannsc5fe57d2021-02-25 16:01:28 +0000287extern u8 *format_ipsec_replay_window (u8 *s, va_list *args);
Neale Ranns999c8ee2019-02-01 03:31:24 -0800288extern u8 *format_ipsec_crypto_alg (u8 * s, va_list * args);
289extern u8 *format_ipsec_integ_alg (u8 * s, va_list * args);
Neale Ranns8d7c5022019-02-06 01:41:05 -0800290extern u8 *format_ipsec_sa (u8 * s, va_list * args);
291extern u8 *format_ipsec_key (u8 * s, va_list * args);
Neale Ranns999c8ee2019-02-01 03:31:24 -0800292extern uword unformat_ipsec_crypto_alg (unformat_input_t * input,
293 va_list * args);
294extern uword unformat_ipsec_integ_alg (unformat_input_t * input,
295 va_list * args);
Neale Ranns8d7c5022019-02-06 01:41:05 -0800296extern uword unformat_ipsec_key (unformat_input_t * input, va_list * args);
Neale Ranns999c8ee2019-02-01 03:31:24 -0800297
Filip Tehlare5d34912020-03-02 15:17:37 +0000298#define IPSEC_UDP_PORT_NONE ((u16)~0)
299
Neale Ranns6afaae12019-07-17 15:07:14 +0000300/*
301 * Anti Replay definitions
302 */
303
304#define IPSEC_SA_ANTI_REPLAY_WINDOW_SIZE (64)
305#define IPSEC_SA_ANTI_REPLAY_WINDOW_MAX_INDEX (IPSEC_SA_ANTI_REPLAY_WINDOW_SIZE-1)
306
307/*
308 * sequence number less than the lower bound are outside of the window
309 * From RFC4303 Appendix A:
310 * Bl = Tl - W + 1
311 */
312#define IPSEC_SA_ANTI_REPLAY_WINDOW_LOWER_BOUND(_tl) (_tl - IPSEC_SA_ANTI_REPLAY_WINDOW_SIZE + 1)
313
Neale Ranns5b891102021-06-28 13:31:28 +0000314always_inline int
315ipsec_sa_anti_replay_check (const ipsec_sa_t *sa, u32 seq)
316{
317 if (ipsec_sa_is_set_USE_ANTI_REPLAY (sa) &&
318 sa->replay_window & (1ULL << (sa->seq - seq)))
319 return 1;
320 else
321 return 0;
322}
323
Neale Ranns6afaae12019-07-17 15:07:14 +0000324/*
325 * Anti replay check.
326 * inputs need to be in host byte order.
Neale Ranns5b891102021-06-28 13:31:28 +0000327 *
328 * The function runs in two contexts. pre and post decrypt.
329 * Pre-decrypt it:
330 * 1 - determines if a packet is a replay - a simple check in the window
331 * 2 - returns the hi-seq number that should be used to decrypt.
332 * post-decrypt:
333 * Checks whether the packet is a replay or falls out of window
334 *
335 * This funcion should be called even without anti-replay enabled to ensure
336 * the high sequence number is set.
Neale Ranns6afaae12019-07-17 15:07:14 +0000337 */
Damjan Marion1f4e1cb2019-03-28 19:19:31 +0100338always_inline int
Neale Ranns5b891102021-06-28 13:31:28 +0000339ipsec_sa_anti_replay_and_sn_advance (const ipsec_sa_t *sa, u32 seq,
340 u32 hi_seq_used, bool post_decrypt,
341 u32 *hi_seq_req)
Damjan Marion1f4e1cb2019-03-28 19:19:31 +0100342{
Neale Ranns5b891102021-06-28 13:31:28 +0000343 ASSERT ((post_decrypt == false) == (hi_seq_req != 0));
Damjan Marion1f4e1cb2019-03-28 19:19:31 +0100344
Neale Ranns6afaae12019-07-17 15:07:14 +0000345 if (!ipsec_sa_is_set_USE_ESN (sa))
Damjan Marion1f4e1cb2019-03-28 19:19:31 +0100346 {
Neale Ranns5b891102021-06-28 13:31:28 +0000347 if (hi_seq_req)
348 /* no ESN, therefore the hi-seq is always 0 */
349 *hi_seq_req = 0;
350
351 if (!ipsec_sa_is_set_USE_ANTI_REPLAY (sa))
Damjan Marion1f4e1cb2019-03-28 19:19:31 +0100352 return 0;
353
Neale Ranns5b891102021-06-28 13:31:28 +0000354 if (PREDICT_TRUE (seq > sa->seq))
355 return 0;
356
357 u32 diff = sa->seq - seq;
Damjan Marion1f4e1cb2019-03-28 19:19:31 +0100358
359 if (IPSEC_SA_ANTI_REPLAY_WINDOW_SIZE > diff)
Neale Ranns5b891102021-06-28 13:31:28 +0000360 return ((sa->replay_window & (1ULL << diff)) ? 1 : 0);
Damjan Marion1f4e1cb2019-03-28 19:19:31 +0100361 else
362 return 1;
363
364 return 0;
365 }
366
Neale Ranns5b891102021-06-28 13:31:28 +0000367 if (!ipsec_sa_is_set_USE_ANTI_REPLAY (sa))
368 {
369 /* there's no AR configured for this SA, but in order
370 * to know whether a packet has wrapped the hi ESN we need
371 * to know whether it is out of window. if we use the default
372 * lower bound then we are effectively forcing AR because
373 * out of window packets will get the increased hi seq number
374 * and will thus fail to decrypt. IOW we need a window to know
375 * if the SN has wrapped, but we don't want a window to check for
376 * anti replay. to resolve the contradiction we use a huge window.
377 * if the packet is not within 2^30 of the current SN, we'll consider
378 * it a wrap.
379 */
380 if (hi_seq_req)
381 {
382 if (seq >= sa->seq)
383 /* The packet's sequence number is larger that the SA's.
384 * that can't be a warp - unless we lost more than
385 * 2^32 packets ... how could we know? */
386 *hi_seq_req = sa->seq_hi;
387 else
388 {
389 /* The packet's SN is less than the SAs, so either the SN has
390 * wrapped or the SN is just old. */
391 if (sa->seq - seq > (1 << 30))
392 /* It's really really really old => it wrapped */
393 *hi_seq_req = sa->seq_hi + 1;
394 else
395 *hi_seq_req = sa->seq_hi;
396 }
397 }
398 /*
399 * else
400 * this is post-decrpyt and since it decrypted we accept it
401 */
402 return 0;
403 }
404 if (PREDICT_TRUE (sa->seq >= (IPSEC_SA_ANTI_REPLAY_WINDOW_MAX_INDEX)))
Damjan Marion1f4e1cb2019-03-28 19:19:31 +0100405 {
Neale Ranns6afaae12019-07-17 15:07:14 +0000406 /*
407 * the last sequence number VPP recieved is more than one
408 * window size greater than zero.
409 * Case A from RFC4303 Appendix A.
410 */
Neale Ranns5b891102021-06-28 13:31:28 +0000411 if (seq < IPSEC_SA_ANTI_REPLAY_WINDOW_LOWER_BOUND (sa->seq))
Damjan Marion1f4e1cb2019-03-28 19:19:31 +0100412 {
Neale Ranns6afaae12019-07-17 15:07:14 +0000413 /*
414 * the received sequence number is lower than the lower bound
415 * of the window, this could mean either a replay packet or that
416 * the high sequence number has wrapped. if it decrypts corrently
417 * then it's the latter.
418 */
Neale Ranns5b891102021-06-28 13:31:28 +0000419 if (post_decrypt)
420 {
421 if (hi_seq_used == sa->seq_hi)
422 /* the high sequence number used to succesfully decrypt this
423 * packet is the same as the last-sequnence number of the SA.
424 * that means this packet did not cause a wrap.
425 * this packet is thus out of window and should be dropped */
426 return 1;
427 else
428 /* The packet decrypted with a different high sequence number
429 * to the SA, that means it is the wrap packet and should be
430 * accepted */
431 return 0;
432 }
433 else
434 {
435 /* pre-decrypt it might be the might that casues a wrap, we
436 * need to decrpyt to find out */
437 if (hi_seq_req)
438 *hi_seq_req = sa->seq_hi + 1;
439 return 0;
440 }
Damjan Marion1f4e1cb2019-03-28 19:19:31 +0100441 }
442 else
443 {
Neale Ranns6afaae12019-07-17 15:07:14 +0000444 /*
445 * the recieved sequence number greater than the low
446 * end of the window.
447 */
Neale Ranns5b891102021-06-28 13:31:28 +0000448 if (hi_seq_req)
449 *hi_seq_req = sa->seq_hi;
450 if (seq <= sa->seq)
Neale Ranns6afaae12019-07-17 15:07:14 +0000451 /*
452 * The recieved seq number is within bounds of the window
453 * check if it's a duplicate
454 */
Neale Ranns5b891102021-06-28 13:31:28 +0000455 return (ipsec_sa_anti_replay_check (sa, seq));
Neale Ranns6afaae12019-07-17 15:07:14 +0000456 else
457 /*
458 * The received sequence number is greater than the window
459 * upper bound. this packet will move the window along, assuming
460 * it decrypts correctly.
461 */
462 return 0;
Damjan Marion1f4e1cb2019-03-28 19:19:31 +0100463 }
464 }
465 else
466 {
Neale Ranns6afaae12019-07-17 15:07:14 +0000467 /*
468 * the last sequence number VPP recieved is within one window
469 * size of zero, i.e. 0 < TL < WINDOW_SIZE, the lower bound is thus a
470 * large sequence number.
471 * Note that the check below uses unsiged integer arthimetic, so the
472 * RHS will be a larger number.
473 * Case B from RFC4303 Appendix A.
474 */
Neale Ranns5b891102021-06-28 13:31:28 +0000475 if (seq < IPSEC_SA_ANTI_REPLAY_WINDOW_LOWER_BOUND (sa->seq))
Damjan Marion1f4e1cb2019-03-28 19:19:31 +0100476 {
Neale Ranns6afaae12019-07-17 15:07:14 +0000477 /*
478 * the sequence number is less than the lower bound.
479 */
Neale Ranns5b891102021-06-28 13:31:28 +0000480 if (seq <= sa->seq)
Neale Ranns6afaae12019-07-17 15:07:14 +0000481 {
482 /*
483 * the packet is within the window upper bound.
484 * check for duplicates.
485 */
Neale Ranns5b891102021-06-28 13:31:28 +0000486 if (hi_seq_req)
487 *hi_seq_req = sa->seq_hi;
488 return (ipsec_sa_anti_replay_check (sa, seq));
Neale Ranns6afaae12019-07-17 15:07:14 +0000489 }
490 else
491 {
492 /*
493 * the packet is less the window lower bound or greater than
494 * the higher bound, depending on how you look at it...
495 * We're assuming, given that the last sequence number received,
496 * TL < WINDOW_SIZE, that a largeer seq num is more likely to be
497 * a packet that moves the window forward, than a packet that has
498 * wrapped the high sequence again. If it were the latter then
499 * we've lost close to 2^32 packets.
500 */
Neale Ranns5b891102021-06-28 13:31:28 +0000501 if (hi_seq_req)
502 *hi_seq_req = sa->seq_hi;
Neale Ranns6afaae12019-07-17 15:07:14 +0000503 return 0;
504 }
Damjan Marion1f4e1cb2019-03-28 19:19:31 +0100505 }
506 else
507 {
Neale Ranns6afaae12019-07-17 15:07:14 +0000508 /*
509 * the packet seq number is between the lower bound (a large nubmer)
510 * and MAX_SEQ_NUM. This is in the window since the window upper bound
511 * tl > 0.
512 * However, since TL is the other side of 0 to the received
513 * packet, the SA has moved on to a higher sequence number.
514 */
Neale Ranns5b891102021-06-28 13:31:28 +0000515 if (hi_seq_req)
516 *hi_seq_req = sa->seq_hi - 1;
517 return (ipsec_sa_anti_replay_check (sa, seq));
Damjan Marion1f4e1cb2019-03-28 19:19:31 +0100518 }
519 }
520
Neale Ranns5b891102021-06-28 13:31:28 +0000521 /* unhandled case */
522 ASSERT (0);
Damjan Marion1f4e1cb2019-03-28 19:19:31 +0100523 return 0;
524}
525
Neale Rannse11203e2021-09-21 12:34:19 +0000526always_inline u32
527ipsec_sa_anti_replay_window_shift (ipsec_sa_t *sa, u32 inc)
528{
529 u32 n_lost = 0;
530
531 if (inc < IPSEC_SA_ANTI_REPLAY_WINDOW_SIZE)
532 {
533 if (sa->seq > IPSEC_SA_ANTI_REPLAY_WINDOW_SIZE)
534 {
535 /*
536 * count how many holes there are in the portion
537 * of the window that we will right shift of the end
538 * as a result of this increments
539 */
540 u64 mask = (((u64) 1 << inc) - 1) << (BITS (u64) - inc);
541 u64 old = sa->replay_window & mask;
542 /* the number of packets we saw in this section of the window */
543 u64 seen = count_set_bits (old);
544
545 /*
546 * the number we missed is the size of the window section
547 * minus the number we saw.
548 */
549 n_lost = inc - seen;
550 }
551 sa->replay_window = ((sa->replay_window) << inc) | 1;
552 }
553 else
554 {
555 /* holes in the replay window are lost packets */
556 n_lost = BITS (u64) - count_set_bits (sa->replay_window);
557
558 /* any sequence numbers that now fall outside the window
559 * are forever lost */
560 n_lost += inc - IPSEC_SA_ANTI_REPLAY_WINDOW_SIZE;
561
562 sa->replay_window = 1;
563 }
564
565 return (n_lost);
566}
567
Neale Ranns6afaae12019-07-17 15:07:14 +0000568/*
569 * Anti replay window advance
570 * inputs need to be in host byte order.
Neale Ranns5b891102021-06-28 13:31:28 +0000571 * This function both advances the anti-replay window and the sequence number
572 * We always need to move on the SN but the window updates are only needed
573 * if AR is on.
574 * However, updating the window is trivial, so we do it anyway to save
575 * the branch cost.
Neale Ranns6afaae12019-07-17 15:07:14 +0000576 */
Neale Rannse11203e2021-09-21 12:34:19 +0000577always_inline u64
578ipsec_sa_anti_replay_advance (ipsec_sa_t *sa, u32 thread_index, u32 seq,
579 u32 hi_seq)
Damjan Marion1f4e1cb2019-03-28 19:19:31 +0100580{
Neale Rannse11203e2021-09-21 12:34:19 +0000581 u64 n_lost = 0;
Neale Ranns6afaae12019-07-17 15:07:14 +0000582 u32 pos;
Damjan Marion1f4e1cb2019-03-28 19:19:31 +0100583
Neale Ranns5b891102021-06-28 13:31:28 +0000584 if (ipsec_sa_is_set_USE_ESN (sa))
Damjan Marion1f4e1cb2019-03-28 19:19:31 +0100585 {
Neale Ranns5b891102021-06-28 13:31:28 +0000586 int wrap = hi_seq - sa->seq_hi;
Damjan Marion1f4e1cb2019-03-28 19:19:31 +0100587
Neale Ranns5b891102021-06-28 13:31:28 +0000588 if (wrap == 0 && seq > sa->seq)
Damjan Marion1f4e1cb2019-03-28 19:19:31 +0100589 {
Neale Ranns5b891102021-06-28 13:31:28 +0000590 pos = seq - sa->seq;
Neale Rannse11203e2021-09-21 12:34:19 +0000591 n_lost = ipsec_sa_anti_replay_window_shift (sa, pos);
Neale Ranns5b891102021-06-28 13:31:28 +0000592 sa->seq = seq;
Damjan Marion1f4e1cb2019-03-28 19:19:31 +0100593 }
594 else if (wrap > 0)
595 {
Neale Ranns5b891102021-06-28 13:31:28 +0000596 pos = ~seq + sa->seq + 1;
Neale Rannse11203e2021-09-21 12:34:19 +0000597 n_lost = ipsec_sa_anti_replay_window_shift (sa, pos);
Neale Ranns5b891102021-06-28 13:31:28 +0000598 sa->seq = seq;
599 sa->seq_hi = hi_seq;
Damjan Marion1f4e1cb2019-03-28 19:19:31 +0100600 }
601 else if (wrap < 0)
602 {
Neale Ranns5b891102021-06-28 13:31:28 +0000603 pos = ~seq + sa->seq + 1;
Damjan Marion1f4e1cb2019-03-28 19:19:31 +0100604 sa->replay_window |= (1ULL << pos);
605 }
606 else
607 {
Neale Ranns5b891102021-06-28 13:31:28 +0000608 pos = sa->seq - seq;
Damjan Marion1f4e1cb2019-03-28 19:19:31 +0100609 sa->replay_window |= (1ULL << pos);
610 }
611 }
612 else
613 {
Neale Ranns5b891102021-06-28 13:31:28 +0000614 if (seq > sa->seq)
Damjan Marion1f4e1cb2019-03-28 19:19:31 +0100615 {
Neale Ranns5b891102021-06-28 13:31:28 +0000616 pos = seq - sa->seq;
Neale Rannse11203e2021-09-21 12:34:19 +0000617 n_lost = ipsec_sa_anti_replay_window_shift (sa, pos);
Neale Ranns5b891102021-06-28 13:31:28 +0000618 sa->seq = seq;
Damjan Marion1f4e1cb2019-03-28 19:19:31 +0100619 }
620 else
621 {
Neale Ranns5b891102021-06-28 13:31:28 +0000622 pos = sa->seq - seq;
Damjan Marion1f4e1cb2019-03-28 19:19:31 +0100623 sa->replay_window |= (1ULL << pos);
624 }
625 }
Neale Rannse11203e2021-09-21 12:34:19 +0000626
627 return n_lost;
Damjan Marion1f4e1cb2019-03-28 19:19:31 +0100628}
629
Neale Rannsf62a8c02019-04-02 08:13:33 +0000630
631/*
632 * Makes choice for thread_id should be assigned.
633 * if input ~0, gets random worker_id based on unix_time_now_nsec
634*/
635always_inline u32
636ipsec_sa_assign_thread (u32 thread_id)
637{
638 return ((thread_id) ? thread_id
639 : (unix_time_now_nsec () % vlib_num_workers ()) + 1);
640}
641
Neale Rannsc5fe57d2021-02-25 16:01:28 +0000642always_inline ipsec_sa_t *
643ipsec_sa_get (u32 sa_index)
644{
645 return (pool_elt_at_index (ipsec_sa_pool, sa_index));
646}
647
Neale Ranns999c8ee2019-02-01 03:31:24 -0800648#endif /* __IPSEC_SPD_SA_H__ */
649
650/*
651 * fd.io coding-style-patch-verification: ON
652 *
653 * Local Variables:
654 * eval: (c-set-style "gnu")
655 * End:
656 */