blob: 4f73f1eab0f64152b6de588d8d1c087e54c82f39 [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>
Benoît Ganne5527a782022-01-18 15:56:41 +010019#include <vppinfra/pcg.h>
Filip Tehlare5d34912020-03-02 15:17:37 +000020#include <vnet/crypto/crypto.h>
Neale Ranns999c8ee2019-02-01 03:31:24 -080021#include <vnet/ip/ip.h>
Neale Ranns8d7c5022019-02-06 01:41:05 -080022#include <vnet/fib/fib_node.h>
Neale Ranns041add72020-01-02 04:06:10 +000023#include <vnet/tunnel/tunnel.h>
Neale Ranns999c8ee2019-02-01 03:31:24 -080024
Benoît Ganne5527a782022-01-18 15:56:41 +010025#define ESP_MAX_ICV_SIZE (32)
26#define ESP_MAX_IV_SIZE (16)
27#define ESP_MAX_BLOCK_SIZE (16)
28
Vladimir Ratnikovd7c030d2022-09-13 13:09:53 +000029#define foreach_ipsec_crypto_alg \
30 _ (0, NONE, "none") \
31 _ (1, AES_CBC_128, "aes-cbc-128") \
32 _ (2, AES_CBC_192, "aes-cbc-192") \
33 _ (3, AES_CBC_256, "aes-cbc-256") \
34 _ (4, AES_CTR_128, "aes-ctr-128") \
35 _ (5, AES_CTR_192, "aes-ctr-192") \
36 _ (6, AES_CTR_256, "aes-ctr-256") \
37 _ (7, AES_GCM_128, "aes-gcm-128") \
38 _ (8, AES_GCM_192, "aes-gcm-192") \
39 _ (9, AES_GCM_256, "aes-gcm-256") \
40 _ (10, DES_CBC, "des-cbc") \
41 _ (11, 3DES_CBC, "3des-cbc") \
Benoît Ganne84e66582023-03-10 17:33:03 +010042 _ (12, CHACHA20_POLY1305, "chacha20-poly1305") \
43 _ (13, AES_NULL_GMAC_128, "aes-null-gmac-128") \
44 _ (14, AES_NULL_GMAC_192, "aes-null-gmac-192") \
45 _ (15, AES_NULL_GMAC_256, "aes-null-gmac-256")
Neale Ranns999c8ee2019-02-01 03:31:24 -080046
47typedef enum
48{
49#define _(v, f, s) IPSEC_CRYPTO_ALG_##f = v,
50 foreach_ipsec_crypto_alg
51#undef _
52 IPSEC_CRYPTO_N_ALG,
Neale Ranns123b5eb2020-10-16 14:03:55 +000053} __clib_packed ipsec_crypto_alg_t;
Neale Ranns999c8ee2019-02-01 03:31:24 -080054
Benoît Ganne84e66582023-03-10 17:33:03 +010055#define IPSEC_CRYPTO_ALG_IS_NULL_GMAC(_alg) \
56 ((_alg == IPSEC_CRYPTO_ALG_AES_NULL_GMAC_128) || \
57 (_alg == IPSEC_CRYPTO_ALG_AES_NULL_GMAC_192) || \
58 (_alg == IPSEC_CRYPTO_ALG_AES_NULL_GMAC_256))
59
Neale Ranns47feb112019-04-11 15:14:07 +000060#define IPSEC_CRYPTO_ALG_IS_GCM(_alg) \
61 (((_alg == IPSEC_CRYPTO_ALG_AES_GCM_128) || \
62 (_alg == IPSEC_CRYPTO_ALG_AES_GCM_192) || \
63 (_alg == IPSEC_CRYPTO_ALG_AES_GCM_256)))
64
Benoît Ganne490b9272021-01-22 18:03:09 +010065#define IPSEC_CRYPTO_ALG_IS_CTR(_alg) \
66 (((_alg == IPSEC_CRYPTO_ALG_AES_CTR_128) || \
67 (_alg == IPSEC_CRYPTO_ALG_AES_CTR_192) || \
68 (_alg == IPSEC_CRYPTO_ALG_AES_CTR_256)))
69
Vladimir Ratnikovd7c030d2022-09-13 13:09:53 +000070#define IPSEC_CRYPTO_ALG_CTR_AEAD_OTHERS(_alg) \
71 (_alg == IPSEC_CRYPTO_ALG_CHACHA20_POLY1305)
72
Neale Ranns999c8ee2019-02-01 03:31:24 -080073#define foreach_ipsec_integ_alg \
74 _ (0, NONE, "none") \
75 _ (1, MD5_96, "md5-96") /* RFC2403 */ \
76 _ (2, SHA1_96, "sha1-96") /* RFC2404 */ \
77 _ (3, SHA_256_96, "sha-256-96") /* draft-ietf-ipsec-ciph-sha-256-00 */ \
78 _ (4, SHA_256_128, "sha-256-128") /* RFC4868 */ \
79 _ (5, SHA_384_192, "sha-384-192") /* RFC4868 */ \
80 _ (6, SHA_512_256, "sha-512-256") /* RFC4868 */
81
82typedef enum
83{
84#define _(v, f, s) IPSEC_INTEG_ALG_##f = v,
85 foreach_ipsec_integ_alg
86#undef _
87 IPSEC_INTEG_N_ALG,
Neale Ranns123b5eb2020-10-16 14:03:55 +000088} __clib_packed ipsec_integ_alg_t;
Neale Ranns999c8ee2019-02-01 03:31:24 -080089
90typedef enum
91{
92 IPSEC_PROTOCOL_AH = 0,
93 IPSEC_PROTOCOL_ESP = 1
Neale Ranns123b5eb2020-10-16 14:03:55 +000094} __clib_packed ipsec_protocol_t;
Neale Ranns999c8ee2019-02-01 03:31:24 -080095
Neale Ranns8d7c5022019-02-06 01:41:05 -080096#define IPSEC_KEY_MAX_LEN 128
97typedef struct ipsec_key_t_
98{
99 u8 len;
100 u8 data[IPSEC_KEY_MAX_LEN];
101} ipsec_key_t;
102
103/*
104 * Enable extended sequence numbers
105 * Enable Anti-replay
106 * IPsec tunnel mode if non-zero, else transport mode
107 * IPsec tunnel mode is IPv6 if non-zero,
108 * else IPv4 tunnel only valid if is_tunnel is non-zero
109 * enable UDP encapsulation for NAT traversal
110 */
Benoît Ganne490b9272021-01-22 18:03:09 +0100111#define foreach_ipsec_sa_flags \
112 _ (0, NONE, "none") \
113 _ (1, USE_ESN, "esn") \
114 _ (2, USE_ANTI_REPLAY, "anti-replay") \
115 _ (4, IS_TUNNEL, "tunnel") \
116 _ (8, IS_TUNNEL_V6, "tunnel-v6") \
117 _ (16, UDP_ENCAP, "udp-encap") \
118 _ (32, IS_PROTECT, "Protect") \
119 _ (64, IS_INBOUND, "inbound") \
120 _ (128, IS_AEAD, "aead") \
Neale Rannsf16e9a52021-02-25 19:09:24 +0000121 _ (256, IS_CTR, "ctr") \
Neale Ranns6fdcc3d2021-10-08 07:30:47 +0000122 _ (512, IS_ASYNC, "async") \
Benoît Ganne84e66582023-03-10 17:33:03 +0100123 _ (1024, NO_ALGO_NO_DROP, "no-algo-no-drop") \
Maxime Peim0e2f1882022-12-22 11:26:57 +0000124 _ (2048, IS_NULL_GMAC, "null-gmac") \
125 _ (4096, ANTI_REPLAY_HUGE, "anti-replay-huge")
Neale Ranns8d7c5022019-02-06 01:41:05 -0800126
127typedef enum ipsec_sad_flags_t_
128{
129#define _(v, f, s) IPSEC_SA_FLAG_##f = v,
130 foreach_ipsec_sa_flags
131#undef _
Damjan Marion1f4e1cb2019-03-28 19:19:31 +0100132} __clib_packed ipsec_sa_flags_t;
Damjan Mariond709cbc2019-03-26 13:16:42 +0100133
Benoît Ganne490b9272021-01-22 18:03:09 +0100134STATIC_ASSERT (sizeof (ipsec_sa_flags_t) == 2, "IPSEC SA flags != 2 byte");
Neale Ranns8d7c5022019-02-06 01:41:05 -0800135
Arthur de Kerhorad95b062022-11-16 19:12:05 +0100136#define foreach_ipsec_sa_err \
137 _ (0, LOST, lost, "packets lost") \
138 _ (1, HANDOFF, handoff, "hand-off") \
139 _ (2, INTEG_ERROR, integ_error, "Integrity check failed") \
140 _ (3, DECRYPTION_FAILED, decryption_failed, "Decryption failed") \
141 _ (4, CRYPTO_ENGINE_ERROR, crypto_engine_error, \
142 "crypto engine error (dropped)") \
143 _ (5, REPLAY, replay, "SA replayed packet") \
144 _ (6, RUNT, runt, "undersized packet") \
145 _ (7, NO_BUFFERS, no_buffers, "no buffers (dropped)") \
146 _ (8, OVERSIZED_HEADER, oversized_header, \
147 "buffer with oversized header (dropped)") \
148 _ (9, NO_TAIL_SPACE, no_tail_space, \
149 "no enough buffer tail space (dropped)") \
150 _ (10, TUN_NO_PROTO, tun_no_proto, "no tunnel protocol") \
151 _ (11, UNSUP_PAYLOAD, unsup_payload, "unsupported payload") \
152 _ (12, SEQ_CYCLED, seq_cycled, "sequence number cycled (dropped)") \
153 _ (13, CRYPTO_QUEUE_FULL, crypto_queue_full, "crypto queue full (dropped)") \
154 _ (14, NO_ENCRYPTION, no_encryption, "no Encrypting SA (dropped)") \
155 _ (15, DROP_FRAGMENTS, drop_fragments, "IP fragments drop")
156
157typedef enum
158{
159#define _(v, f, s, d) IPSEC_SA_ERROR_##f = v,
160 foreach_ipsec_sa_err
161#undef _
162 IPSEC_SA_N_ERRORS,
163} __clib_packed ipsec_sa_err_t;
164
Neale Ranns999c8ee2019-02-01 03:31:24 -0800165typedef struct
166{
Damjan Mariond709cbc2019-03-26 13:16:42 +0100167 CLIB_CACHE_LINE_ALIGN_MARK (cacheline0);
Neale Ranns999c8ee2019-02-01 03:31:24 -0800168
Benoît Ganne5527a782022-01-18 15:56:41 +0100169 clib_pcg64i_random_t iv_prng;
Damjan Mariond709cbc2019-03-26 13:16:42 +0100170
Maxime Peim0e2f1882022-12-22 11:26:57 +0000171 union
172 {
173 u64 replay_window;
174 clib_bitmap_t *replay_window_huge;
175 };
Neale Ranns72f2a3a2019-06-17 15:43:38 +0000176 dpo_id_t dpo;
Damjan Mariond709cbc2019-03-26 13:16:42 +0100177
Damjan Mariond1bed682019-04-24 15:20:35 +0200178 vnet_crypto_key_index_t crypto_key_index;
179 vnet_crypto_key_index_t integ_key_index;
Fan Zhangf5395782020-04-29 14:00:03 +0100180
Benoît Ganne5527a782022-01-18 15:56:41 +0100181 u32 spi;
182 u32 seq;
183 u32 seq_hi;
Fan Zhangf5395782020-04-29 14:00:03 +0100184
Benoît Ganne5527a782022-01-18 15:56:41 +0100185 u16 crypto_enc_op_id;
186 u16 crypto_dec_op_id;
187 u16 integ_op_id;
188 ipsec_sa_flags_t flags;
189 u16 thread_index;
Fan Zhangf5395782020-04-29 14:00:03 +0100190
Benoît Ganne5527a782022-01-18 15:56:41 +0100191 u16 integ_icv_size : 6;
192 u16 crypto_iv_size : 5;
193 u16 esp_block_align : 5;
Damjan Mariond709cbc2019-03-26 13:16:42 +0100194
Benoît Ganne490b9272021-01-22 18:03:09 +0100195 CLIB_CACHE_LINE_ALIGN_MARK (cacheline1);
Damjan Mariond709cbc2019-03-26 13:16:42 +0100196
197 union
198 {
199 ip4_header_t ip4_hdr;
200 ip6_header_t ip6_hdr;
201 };
202 udp_header_t udp_hdr;
203
Benoît Ganne490b9272021-01-22 18:03:09 +0100204 /* Salt used in CTR modes (incl. GCM) - stored in network byte order */
Neale Ranns80f6fd52019-04-16 02:41:34 +0000205 u32 salt;
Fan Zhangf5395782020-04-29 14:00:03 +0100206
Neale Ranns123b5eb2020-10-16 14:03:55 +0000207 ipsec_protocol_t protocol;
Neale Ranns041add72020-01-02 04:06:10 +0000208 tunnel_encap_decap_flags_t tunnel_flags;
Neale Ranns9ec846c2021-02-09 14:04:02 +0000209 u8 __pad[2];
Neale Ranns123b5eb2020-10-16 14:03:55 +0000210
211 /* data accessed by dataplane code should be above this comment */
212 CLIB_CACHE_LINE_ALIGN_MARK (cacheline2);
213
214 /* Elements with u64 size multiples */
Neale Ranns9ec846c2021-02-09 14:04:02 +0000215 tunnel_t tunnel;
Neale Ranns123b5eb2020-10-16 14:03:55 +0000216 fib_node_t node;
217
218 /* elements with u32 size */
219 u32 id;
220 u32 stat_index;
221 vnet_crypto_alg_t integ_calg;
222 vnet_crypto_alg_t crypto_calg;
Benoît Ganne5527a782022-01-18 15:56:41 +0100223 u32 crypto_sync_key_index;
224 u32 integ_sync_key_index;
225 u32 crypto_async_key_index;
226
227 /* elements with u16 size */
228 u16 crypto_sync_enc_op_id;
229 u16 crypto_sync_dec_op_id;
230 u16 integ_sync_op_id;
231 u16 crypto_async_enc_op_id;
232 u16 crypto_async_dec_op_id;
Neale Ranns123b5eb2020-10-16 14:03:55 +0000233
Neale Ranns123b5eb2020-10-16 14:03:55 +0000234 /* else u8 packed */
235 ipsec_crypto_alg_t crypto_alg;
236 ipsec_integ_alg_t integ_alg;
237
238 ipsec_key_t integ_key;
239 ipsec_key_t crypto_key;
Neale Ranns999c8ee2019-02-01 03:31:24 -0800240} ipsec_sa_t;
241
Benoît Ganne5527a782022-01-18 15:56:41 +0100242STATIC_ASSERT (VNET_CRYPTO_N_OP_IDS < (1 << 16), "crypto ops overflow");
243STATIC_ASSERT (ESP_MAX_ICV_SIZE < (1 << 6), "integer icv overflow");
244STATIC_ASSERT (ESP_MAX_IV_SIZE < (1 << 5), "esp iv overflow");
245STATIC_ASSERT (ESP_MAX_BLOCK_SIZE < (1 << 5), "esp alignment overflow");
Damjan Mariond709cbc2019-03-26 13:16:42 +0100246STATIC_ASSERT_OFFSET_OF (ipsec_sa_t, cacheline1, CLIB_CACHE_LINE_BYTES);
Neale Ranns123b5eb2020-10-16 14:03:55 +0000247STATIC_ASSERT_OFFSET_OF (ipsec_sa_t, cacheline2, 2 * CLIB_CACHE_LINE_BYTES);
Damjan Mariond709cbc2019-03-26 13:16:42 +0100248
Neale Rannsc5fe57d2021-02-25 16:01:28 +0000249/**
250 * Pool of IPSec SAs
251 */
252extern ipsec_sa_t *ipsec_sa_pool;
253
Neale Rannsaa7d7662021-02-10 08:42:49 +0000254/*
255 * Ensure that the IPsec data does not overlap with the IP data in
256 * the buffer meta data
257 */
258STATIC_ASSERT (STRUCT_OFFSET_OF (vnet_buffer_opaque_t, ipsec.sad_index) ==
259 STRUCT_OFFSET_OF (vnet_buffer_opaque_t, ip.save_protocol),
260 "IPSec data is overlapping with IP data");
261
Maxime Peim0e2f1882022-12-22 11:26:57 +0000262#define _(a, v, s) \
263 always_inline bool ipsec_sa_is_set_##v (const ipsec_sa_t *sa) \
264 { \
265 return (sa->flags & IPSEC_SA_FLAG_##v); \
Damjan Mariond709cbc2019-03-26 13:16:42 +0100266 }
267foreach_ipsec_sa_flags
268#undef _
Maxime Peim0e2f1882022-12-22 11:26:57 +0000269#define _(a, v, s) \
270 always_inline void ipsec_sa_set_##v (ipsec_sa_t *sa) \
271 { \
272 sa->flags |= IPSEC_SA_FLAG_##v; \
Damjan Mariond709cbc2019-03-26 13:16:42 +0100273 }
274 foreach_ipsec_sa_flags
275#undef _
Maxime Peim0e2f1882022-12-22 11:26:57 +0000276#define _(a, v, s) \
277 always_inline int ipsec_sa_unset_##v (ipsec_sa_t *sa) \
278 { \
279 return (sa->flags &= ~IPSEC_SA_FLAG_##v); \
Neale Rannsc87b66c2019-02-07 07:26:12 -0800280 }
Maxime Peim0e2f1882022-12-22 11:26:57 +0000281 foreach_ipsec_sa_flags
Neale Rannsc87b66c2019-02-07 07:26:12 -0800282#undef _
Maxime Peim0e2f1882022-12-22 11:26:57 +0000283 /**
284 * @brief
285 * SA packet & bytes counters
286 */
287 extern vlib_combined_counter_main_t ipsec_sa_counters;
Arthur de Kerhorad95b062022-11-16 19:12:05 +0100288extern vlib_simple_counter_main_t ipsec_sa_err_counters[IPSEC_SA_N_ERRORS];
Neale Rannseba31ec2019-02-17 18:04:27 +0000289
Maxime Peim0e2f1882022-12-22 11:26:57 +0000290extern void ipsec_mk_key (ipsec_key_t *key, const u8 *data, u8 len);
Neale Ranns8d7c5022019-02-06 01:41:05 -0800291
Arthur de Kerhor4117b242022-08-31 19:13:03 +0200292extern int ipsec_sa_update (u32 id, u16 src_port, u16 dst_port,
293 const tunnel_t *tun, bool is_tun);
Maxime Peim0e2f1882022-12-22 11:26:57 +0000294extern int ipsec_sa_add_and_lock (
295 u32 id, u32 spi, ipsec_protocol_t proto, ipsec_crypto_alg_t crypto_alg,
296 const ipsec_key_t *ck, ipsec_integ_alg_t integ_alg, const ipsec_key_t *ik,
297 ipsec_sa_flags_t flags, u32 salt, u16 src_port, u16 dst_port,
298 u32 anti_replay_window_size, const tunnel_t *tun, u32 *sa_out_index);
Maxime Peim1271e3a2023-03-20 14:13:56 +0000299extern int ipsec_sa_bind (u32 id, u32 worker, bool bind);
Neale Ranns495d7ff2019-07-12 09:15:26 +0000300extern index_t ipsec_sa_find_and_lock (u32 id);
301extern int ipsec_sa_unlock_id (u32 id);
302extern void ipsec_sa_unlock (index_t sai);
Neale Ranns12989b52019-09-26 16:20:19 +0000303extern void ipsec_sa_lock (index_t sai);
Neale Rannsc87b66c2019-02-07 07:26:12 -0800304extern void ipsec_sa_clear (index_t sai);
Maxime Peim0e2f1882022-12-22 11:26:57 +0000305extern void ipsec_sa_set_crypto_alg (ipsec_sa_t *sa,
Damjan Marionb966e8b2019-03-20 16:07:09 +0100306 ipsec_crypto_alg_t crypto_alg);
Maxime Peim0e2f1882022-12-22 11:26:57 +0000307extern void ipsec_sa_set_integ_alg (ipsec_sa_t *sa,
Damjan Marionb966e8b2019-03-20 16:07:09 +0100308 ipsec_integ_alg_t integ_alg);
Benoît Ganne5527a782022-01-18 15:56:41 +0100309extern void ipsec_sa_set_async_mode (ipsec_sa_t *sa, int is_enabled);
Neale Ranns8d7c5022019-02-06 01:41:05 -0800310
Maxime Peim0e2f1882022-12-22 11:26:57 +0000311typedef walk_rc_t (*ipsec_sa_walk_cb_t) (ipsec_sa_t *sa, void *ctx);
Neale Rannsb4cfd552019-02-13 02:08:06 -0800312extern void ipsec_sa_walk (ipsec_sa_walk_cb_t cd, void *ctx);
313
Neale Rannsc5fe57d2021-02-25 16:01:28 +0000314extern u8 *format_ipsec_replay_window (u8 *s, va_list *args);
Maxime Peim0e2f1882022-12-22 11:26:57 +0000315extern u8 *format_ipsec_crypto_alg (u8 *s, va_list *args);
316extern u8 *format_ipsec_integ_alg (u8 *s, va_list *args);
317extern u8 *format_ipsec_sa (u8 *s, va_list *args);
318extern u8 *format_ipsec_key (u8 *s, va_list *args);
319extern uword unformat_ipsec_crypto_alg (unformat_input_t *input,
320 va_list *args);
321extern uword unformat_ipsec_integ_alg (unformat_input_t *input, va_list *args);
322extern uword unformat_ipsec_key (unformat_input_t *input, va_list *args);
Neale Ranns999c8ee2019-02-01 03:31:24 -0800323
Maxime Peim0e2f1882022-12-22 11:26:57 +0000324#define IPSEC_UDP_PORT_NONE ((u16) ~0)
Filip Tehlare5d34912020-03-02 15:17:37 +0000325
Neale Ranns6afaae12019-07-17 15:07:14 +0000326/*
327 * Anti Replay definitions
328 */
329
Maxime Peim0e2f1882022-12-22 11:26:57 +0000330#define IPSEC_SA_ANTI_REPLAY_WINDOW_SIZE(_sa) \
331 (u32) (PREDICT_FALSE (ipsec_sa_is_set_ANTI_REPLAY_HUGE (_sa)) ? \
332 clib_bitmap_bytes (_sa->replay_window_huge) * 8 : \
333 BITS (_sa->replay_window))
334
335#define IPSEC_SA_ANTI_REPLAY_WINDOW_SIZE_KNOWN_WIN(_sa, _is_huge) \
336 (u32) (_is_huge ? clib_bitmap_bytes (_sa->replay_window_huge) * 8 : \
337 BITS (_sa->replay_window))
338
339#define IPSEC_SA_ANTI_REPLAY_WINDOW_N_SEEN(_sa) \
340 (u64) (PREDICT_FALSE (ipsec_sa_is_set_ANTI_REPLAY_HUGE (_sa)) ? \
341 clib_bitmap_count_set_bits (_sa->replay_window_huge) : \
342 count_set_bits (_sa->replay_window))
343
344#define IPSEC_SA_ANTI_REPLAY_WINDOW_N_SEEN_KNOWN_WIN(_sa, _is_huge) \
345 (u64) (_is_huge ? clib_bitmap_count_set_bits (_sa->replay_window_huge) : \
346 count_set_bits (_sa->replay_window))
347
348#define IPSEC_SA_ANTI_REPLAY_WINDOW_MAX_INDEX(_sa) \
349 (u32) (IPSEC_SA_ANTI_REPLAY_WINDOW_SIZE (_sa) - 1)
350
351#define IPSEC_SA_ANTI_REPLAY_WINDOW_MAX_INDEX_KNOWN_WIN(_sa, _is_huge) \
352 (u32) (IPSEC_SA_ANTI_REPLAY_WINDOW_SIZE (_sa, _is_huge) - 1)
Neale Ranns6afaae12019-07-17 15:07:14 +0000353
354/*
355 * sequence number less than the lower bound are outside of the window
356 * From RFC4303 Appendix A:
357 * Bl = Tl - W + 1
358 */
Maxime Peim0e2f1882022-12-22 11:26:57 +0000359#define IPSEC_SA_ANTI_REPLAY_WINDOW_LOWER_BOUND(_sa) \
360 (u32) (_sa->seq - IPSEC_SA_ANTI_REPLAY_WINDOW_SIZE (_sa) + 1)
361
362#define IPSEC_SA_ANTI_REPLAY_WINDOW_LOWER_BOUND_KNOWN_WIN(_sa, _is_huge) \
363 (u32) (_sa->seq - \
364 IPSEC_SA_ANTI_REPLAY_WINDOW_SIZE_KNOWN_WIN (_sa, _is_huge) + 1)
365
366always_inline u64
367ipsec_sa_anti_replay_get_64b_window (const ipsec_sa_t *sa)
368{
369 if (!ipsec_sa_is_set_ANTI_REPLAY_HUGE (sa))
370 return sa->replay_window;
371
372 u64 w;
373 u32 window_size = IPSEC_SA_ANTI_REPLAY_WINDOW_SIZE (sa);
374 u32 tl_win_index = sa->seq & (window_size - 1);
375
376 if (PREDICT_TRUE (tl_win_index >= 63))
377 return clib_bitmap_get_multiple (sa->replay_window_huge, tl_win_index - 63,
378 64);
379
380 w = clib_bitmap_get_multiple_no_check (sa->replay_window_huge, 0,
381 tl_win_index + 1)
382 << (63 - tl_win_index);
383 w |= clib_bitmap_get_multiple_no_check (sa->replay_window_huge,
384 window_size - 63 + tl_win_index,
385 63 - tl_win_index);
386
387 return w;
388}
Neale Ranns6afaae12019-07-17 15:07:14 +0000389
Neale Ranns5b891102021-06-28 13:31:28 +0000390always_inline int
Maxime Peim0e2f1882022-12-22 11:26:57 +0000391ipsec_sa_anti_replay_check (const ipsec_sa_t *sa, u32 seq, bool ar_huge)
Neale Ranns5b891102021-06-28 13:31:28 +0000392{
Maxime Peim0e2f1882022-12-22 11:26:57 +0000393 u32 window_size = IPSEC_SA_ANTI_REPLAY_WINDOW_SIZE_KNOWN_WIN (sa, ar_huge);
394
395 /* we assume that the packet is in the window.
396 * if the packet falls left (sa->seq - seq >= window size),
397 * the result is wrong */
398
399 if (ar_huge)
400 return clib_bitmap_get (sa->replay_window_huge, seq & (window_size - 1));
Neale Ranns5b891102021-06-28 13:31:28 +0000401 else
Maxime Peim0e2f1882022-12-22 11:26:57 +0000402 return (sa->replay_window >> (window_size + seq - sa->seq - 1)) & 1;
403
404 return 0;
Neale Ranns5b891102021-06-28 13:31:28 +0000405}
406
Neale Ranns6afaae12019-07-17 15:07:14 +0000407/*
408 * Anti replay check.
409 * inputs need to be in host byte order.
Neale Ranns5b891102021-06-28 13:31:28 +0000410 *
411 * The function runs in two contexts. pre and post decrypt.
412 * Pre-decrypt it:
413 * 1 - determines if a packet is a replay - a simple check in the window
414 * 2 - returns the hi-seq number that should be used to decrypt.
415 * post-decrypt:
416 * Checks whether the packet is a replay or falls out of window
417 *
418 * This funcion should be called even without anti-replay enabled to ensure
419 * the high sequence number is set.
Neale Ranns6afaae12019-07-17 15:07:14 +0000420 */
Damjan Marion1f4e1cb2019-03-28 19:19:31 +0100421always_inline int
Neale Ranns5b891102021-06-28 13:31:28 +0000422ipsec_sa_anti_replay_and_sn_advance (const ipsec_sa_t *sa, u32 seq,
423 u32 hi_seq_used, bool post_decrypt,
Maxime Peim0e2f1882022-12-22 11:26:57 +0000424 u32 *hi_seq_req, bool ar_huge)
Damjan Marion1f4e1cb2019-03-28 19:19:31 +0100425{
Neale Ranns5b891102021-06-28 13:31:28 +0000426 ASSERT ((post_decrypt == false) == (hi_seq_req != 0));
Damjan Marion1f4e1cb2019-03-28 19:19:31 +0100427
Maxime Peim0e2f1882022-12-22 11:26:57 +0000428 u32 window_size = IPSEC_SA_ANTI_REPLAY_WINDOW_SIZE_KNOWN_WIN (sa, ar_huge);
429 u32 window_lower_bound =
430 IPSEC_SA_ANTI_REPLAY_WINDOW_LOWER_BOUND_KNOWN_WIN (sa, ar_huge);
431
Neale Ranns6afaae12019-07-17 15:07:14 +0000432 if (!ipsec_sa_is_set_USE_ESN (sa))
Damjan Marion1f4e1cb2019-03-28 19:19:31 +0100433 {
Neale Ranns5b891102021-06-28 13:31:28 +0000434 if (hi_seq_req)
435 /* no ESN, therefore the hi-seq is always 0 */
436 *hi_seq_req = 0;
437
438 if (!ipsec_sa_is_set_USE_ANTI_REPLAY (sa))
Damjan Marion1f4e1cb2019-03-28 19:19:31 +0100439 return 0;
440
Neale Ranns5b891102021-06-28 13:31:28 +0000441 if (PREDICT_TRUE (seq > sa->seq))
442 return 0;
443
Maxime Peim0e2f1882022-12-22 11:26:57 +0000444 /* does the packet fall out on the left of the window */
445 if (sa->seq >= seq + window_size)
Damjan Marion1f4e1cb2019-03-28 19:19:31 +0100446 return 1;
447
Maxime Peim0e2f1882022-12-22 11:26:57 +0000448 return ipsec_sa_anti_replay_check (sa, seq, ar_huge);
Damjan Marion1f4e1cb2019-03-28 19:19:31 +0100449 }
450
Neale Ranns5b891102021-06-28 13:31:28 +0000451 if (!ipsec_sa_is_set_USE_ANTI_REPLAY (sa))
452 {
453 /* there's no AR configured for this SA, but in order
454 * to know whether a packet has wrapped the hi ESN we need
455 * to know whether it is out of window. if we use the default
456 * lower bound then we are effectively forcing AR because
457 * out of window packets will get the increased hi seq number
458 * and will thus fail to decrypt. IOW we need a window to know
459 * if the SN has wrapped, but we don't want a window to check for
460 * anti replay. to resolve the contradiction we use a huge window.
461 * if the packet is not within 2^30 of the current SN, we'll consider
462 * it a wrap.
463 */
464 if (hi_seq_req)
465 {
466 if (seq >= sa->seq)
467 /* The packet's sequence number is larger that the SA's.
468 * that can't be a warp - unless we lost more than
469 * 2^32 packets ... how could we know? */
470 *hi_seq_req = sa->seq_hi;
471 else
472 {
473 /* The packet's SN is less than the SAs, so either the SN has
474 * wrapped or the SN is just old. */
475 if (sa->seq - seq > (1 << 30))
476 /* It's really really really old => it wrapped */
477 *hi_seq_req = sa->seq_hi + 1;
478 else
479 *hi_seq_req = sa->seq_hi;
480 }
481 }
482 /*
483 * else
484 * this is post-decrpyt and since it decrypted we accept it
485 */
486 return 0;
487 }
Maxime Peim0e2f1882022-12-22 11:26:57 +0000488
489 if (PREDICT_TRUE (sa->seq >= window_size - 1))
Damjan Marion1f4e1cb2019-03-28 19:19:31 +0100490 {
Neale Ranns6afaae12019-07-17 15:07:14 +0000491 /*
Maxime Peim0e2f1882022-12-22 11:26:57 +0000492 * the last sequence number VPP received is more than one
Neale Ranns6afaae12019-07-17 15:07:14 +0000493 * window size greater than zero.
494 * Case A from RFC4303 Appendix A.
495 */
Maxime Peim0e2f1882022-12-22 11:26:57 +0000496 if (seq < window_lower_bound)
Damjan Marion1f4e1cb2019-03-28 19:19:31 +0100497 {
Neale Ranns6afaae12019-07-17 15:07:14 +0000498 /*
499 * the received sequence number is lower than the lower bound
500 * of the window, this could mean either a replay packet or that
501 * the high sequence number has wrapped. if it decrypts corrently
502 * then it's the latter.
503 */
Neale Ranns5b891102021-06-28 13:31:28 +0000504 if (post_decrypt)
505 {
506 if (hi_seq_used == sa->seq_hi)
507 /* the high sequence number used to succesfully decrypt this
Maxime Peim0e2f1882022-12-22 11:26:57 +0000508 * packet is the same as the last-sequence number of the SA.
Neale Ranns5b891102021-06-28 13:31:28 +0000509 * that means this packet did not cause a wrap.
510 * this packet is thus out of window and should be dropped */
511 return 1;
512 else
513 /* The packet decrypted with a different high sequence number
514 * to the SA, that means it is the wrap packet and should be
515 * accepted */
516 return 0;
517 }
518 else
519 {
Maxime Peim0e2f1882022-12-22 11:26:57 +0000520 /* pre-decrypt it might be the packet that causes a wrap, we
521 * need to decrypt it to find out */
Neale Ranns5b891102021-06-28 13:31:28 +0000522 if (hi_seq_req)
523 *hi_seq_req = sa->seq_hi + 1;
524 return 0;
525 }
Damjan Marion1f4e1cb2019-03-28 19:19:31 +0100526 }
527 else
528 {
Neale Ranns6afaae12019-07-17 15:07:14 +0000529 /*
Maxime Peim0e2f1882022-12-22 11:26:57 +0000530 * the received sequence number greater than the low
Neale Ranns6afaae12019-07-17 15:07:14 +0000531 * end of the window.
532 */
Neale Ranns5b891102021-06-28 13:31:28 +0000533 if (hi_seq_req)
534 *hi_seq_req = sa->seq_hi;
535 if (seq <= sa->seq)
Neale Ranns6afaae12019-07-17 15:07:14 +0000536 /*
Maxime Peim0e2f1882022-12-22 11:26:57 +0000537 * The received seq number is within bounds of the window
Neale Ranns6afaae12019-07-17 15:07:14 +0000538 * check if it's a duplicate
539 */
Maxime Peim0e2f1882022-12-22 11:26:57 +0000540 return ipsec_sa_anti_replay_check (sa, seq, ar_huge);
Neale Ranns6afaae12019-07-17 15:07:14 +0000541 else
542 /*
543 * The received sequence number is greater than the window
544 * upper bound. this packet will move the window along, assuming
545 * it decrypts correctly.
546 */
547 return 0;
Damjan Marion1f4e1cb2019-03-28 19:19:31 +0100548 }
549 }
550 else
551 {
Neale Ranns6afaae12019-07-17 15:07:14 +0000552 /*
Maxime Peim0e2f1882022-12-22 11:26:57 +0000553 * the last sequence number VPP received is within one window
Neale Ranns6afaae12019-07-17 15:07:14 +0000554 * size of zero, i.e. 0 < TL < WINDOW_SIZE, the lower bound is thus a
555 * large sequence number.
Maxime Peim0e2f1882022-12-22 11:26:57 +0000556 * Note that the check below uses unsigned integer arithmetic, so the
Neale Ranns6afaae12019-07-17 15:07:14 +0000557 * RHS will be a larger number.
558 * Case B from RFC4303 Appendix A.
559 */
Maxime Peim0e2f1882022-12-22 11:26:57 +0000560 if (seq < window_lower_bound)
Damjan Marion1f4e1cb2019-03-28 19:19:31 +0100561 {
Neale Ranns6afaae12019-07-17 15:07:14 +0000562 /*
563 * the sequence number is less than the lower bound.
564 */
Neale Ranns5b891102021-06-28 13:31:28 +0000565 if (seq <= sa->seq)
Neale Ranns6afaae12019-07-17 15:07:14 +0000566 {
567 /*
568 * the packet is within the window upper bound.
569 * check for duplicates.
570 */
Neale Ranns5b891102021-06-28 13:31:28 +0000571 if (hi_seq_req)
572 *hi_seq_req = sa->seq_hi;
Maxime Peim0e2f1882022-12-22 11:26:57 +0000573 return ipsec_sa_anti_replay_check (sa, seq, ar_huge);
Neale Ranns6afaae12019-07-17 15:07:14 +0000574 }
575 else
576 {
577 /*
578 * the packet is less the window lower bound or greater than
579 * the higher bound, depending on how you look at it...
580 * We're assuming, given that the last sequence number received,
Maxime Peim0e2f1882022-12-22 11:26:57 +0000581 * TL < WINDOW_SIZE, that a larger seq num is more likely to be
Neale Ranns6afaae12019-07-17 15:07:14 +0000582 * a packet that moves the window forward, than a packet that has
583 * wrapped the high sequence again. If it were the latter then
584 * we've lost close to 2^32 packets.
585 */
Neale Ranns5b891102021-06-28 13:31:28 +0000586 if (hi_seq_req)
587 *hi_seq_req = sa->seq_hi;
Neale Ranns6afaae12019-07-17 15:07:14 +0000588 return 0;
589 }
Damjan Marion1f4e1cb2019-03-28 19:19:31 +0100590 }
591 else
592 {
Neale Ranns6afaae12019-07-17 15:07:14 +0000593 /*
Maxime Peim0e2f1882022-12-22 11:26:57 +0000594 * the packet seq number is between the lower bound (a large number)
595 * and MAX_SEQ_NUM. This is in the window since the window upper
596 * bound tl > 0. However, since TL is the other side of 0 to the
597 * received packet, the SA has moved on to a higher sequence number.
Neale Ranns6afaae12019-07-17 15:07:14 +0000598 */
Neale Ranns5b891102021-06-28 13:31:28 +0000599 if (hi_seq_req)
600 *hi_seq_req = sa->seq_hi - 1;
Maxime Peim0e2f1882022-12-22 11:26:57 +0000601 return ipsec_sa_anti_replay_check (sa, seq, ar_huge);
Damjan Marion1f4e1cb2019-03-28 19:19:31 +0100602 }
603 }
604
Neale Ranns5b891102021-06-28 13:31:28 +0000605 /* unhandled case */
606 ASSERT (0);
Damjan Marion1f4e1cb2019-03-28 19:19:31 +0100607 return 0;
608}
609
Neale Rannse11203e2021-09-21 12:34:19 +0000610always_inline u32
Maxime Peim0e2f1882022-12-22 11:26:57 +0000611ipsec_sa_anti_replay_window_shift (ipsec_sa_t *sa, u32 inc, bool ar_huge)
Neale Rannse11203e2021-09-21 12:34:19 +0000612{
613 u32 n_lost = 0;
Maxime Peim0e2f1882022-12-22 11:26:57 +0000614 u32 seen = 0;
615 u32 window_size = IPSEC_SA_ANTI_REPLAY_WINDOW_SIZE_KNOWN_WIN (sa, ar_huge);
Neale Rannse11203e2021-09-21 12:34:19 +0000616
Maxime Peim0e2f1882022-12-22 11:26:57 +0000617 if (inc < window_size)
Neale Rannse11203e2021-09-21 12:34:19 +0000618 {
Maxime Peim0e2f1882022-12-22 11:26:57 +0000619 if (ar_huge)
620 {
621 /* the number of packets we saw in this section of the window */
622 clib_bitmap_t *window = sa->replay_window_huge;
623 u32 window_lower_bound = (sa->seq + 1) & (window_size - 1);
624 u32 window_next_lower_bound =
625 (window_lower_bound + inc) & (window_size - 1);
626
627 uword i_block, i_word_start, i_word_end, full_words;
628 uword n_blocks = window_size >> log2_uword_bits;
629 uword mask;
630
631 i_block = window_lower_bound >> log2_uword_bits;
632
633 i_word_start = window_lower_bound & (uword_bits - 1);
634 i_word_end = window_next_lower_bound & (uword_bits - 1);
635
636 /* We stay in the same word */
637 if (i_word_start + inc <= uword_bits)
638 {
639 mask = pow2_mask (inc) << i_word_start;
640 seen += count_set_bits (window[i_block] & mask);
641 window[i_block] &= ~mask;
642 }
643 else
644 {
645 full_words = (inc + i_word_start - uword_bits - i_word_end) >>
646 log2_uword_bits;
647
648 /* count set bits in the first word */
649 mask = (uword) ~0 << i_word_start;
650 seen += count_set_bits (window[i_block] & mask);
651 window[i_block] &= ~mask;
652 i_block = (i_block + 1) & (n_blocks - 1);
653
654 /* count set bits in the next full words */
655 /* even if the last word need to be fully counted, we treat it
656 * apart */
657 while (full_words >= 8)
658 {
659 if (full_words >= 16)
660 {
661 /* prefect the next 8 blocks (64 bytes) */
662 clib_prefetch_store (
663 &window[(i_block + 8) & (n_blocks - 1)]);
664 }
665
666 seen += count_set_bits (window[i_block]);
667 seen +=
668 count_set_bits (window[(i_block + 1) & (n_blocks - 1)]);
669 seen +=
670 count_set_bits (window[(i_block + 2) & (n_blocks - 1)]);
671 seen +=
672 count_set_bits (window[(i_block + 3) & (n_blocks - 1)]);
673 seen +=
674 count_set_bits (window[(i_block + 4) & (n_blocks - 1)]);
675 seen +=
676 count_set_bits (window[(i_block + 5) & (n_blocks - 1)]);
677 seen +=
678 count_set_bits (window[(i_block + 6) & (n_blocks - 1)]);
679 seen +=
680 count_set_bits (window[(i_block + 7) & (n_blocks - 1)]);
681 window[i_block] = 0;
682 window[(i_block + 1) & (n_blocks - 1)] = 0;
683 window[(i_block + 2) & (n_blocks - 1)] = 0;
684 window[(i_block + 3) & (n_blocks - 1)] = 0;
685 window[(i_block + 4) & (n_blocks - 1)] = 0;
686 window[(i_block + 5) & (n_blocks - 1)] = 0;
687 window[(i_block + 6) & (n_blocks - 1)] = 0;
688 window[(i_block + 7) & (n_blocks - 1)] = 0;
689
690 i_block = (i_block + 8) & (n_blocks - 1);
691 full_words -= 8;
692 }
693 while (full_words > 0)
694 {
695 // last word is treated after the loop
696 seen += count_set_bits (window[i_block]);
697 window[i_block] = 0;
698 i_block = (i_block + 1) & (n_blocks - 1);
699 full_words--;
700 }
701
702 /* the last word */
703 mask = pow2_mask (i_word_end);
704 seen += count_set_bits (window[i_block] & mask);
705 window[i_block] &= ~mask;
706 }
707
708 clib_bitmap_set_no_check (window,
709 (sa->seq + inc) & (window_size - 1), 1);
710 }
711 else
Neale Rannse11203e2021-09-21 12:34:19 +0000712 {
713 /*
714 * count how many holes there are in the portion
715 * of the window that we will right shift of the end
716 * as a result of this increments
717 */
Maxime Peim0e2f1882022-12-22 11:26:57 +0000718 u64 old = sa->replay_window & pow2_mask (inc);
Neale Rannse11203e2021-09-21 12:34:19 +0000719 /* the number of packets we saw in this section of the window */
Maxime Peim0e2f1882022-12-22 11:26:57 +0000720 seen = count_set_bits (old);
721 sa->replay_window =
722 ((sa->replay_window) >> inc) | (1ULL << (window_size - 1));
Neale Rannse11203e2021-09-21 12:34:19 +0000723 }
Maxime Peim0e2f1882022-12-22 11:26:57 +0000724
725 /*
726 * the number we missed is the size of the window section
727 * minus the number we saw.
728 */
729 n_lost = inc - seen;
Neale Rannse11203e2021-09-21 12:34:19 +0000730 }
731 else
732 {
733 /* holes in the replay window are lost packets */
Maxime Peim115e31b2023-10-31 16:29:59 +0100734 n_lost = window_size -
735 IPSEC_SA_ANTI_REPLAY_WINDOW_N_SEEN_KNOWN_WIN (sa, ar_huge);
Neale Rannse11203e2021-09-21 12:34:19 +0000736
737 /* any sequence numbers that now fall outside the window
738 * are forever lost */
Maxime Peim0e2f1882022-12-22 11:26:57 +0000739 n_lost += inc - window_size;
Neale Rannse11203e2021-09-21 12:34:19 +0000740
Maxime Peim115e31b2023-10-31 16:29:59 +0100741 if (PREDICT_FALSE (ar_huge))
Maxime Peim0e2f1882022-12-22 11:26:57 +0000742 {
743 clib_bitmap_zero (sa->replay_window_huge);
744 clib_bitmap_set_no_check (sa->replay_window_huge,
745 (sa->seq + inc) & (window_size - 1), 1);
746 }
747 else
748 {
749 sa->replay_window = 1ULL << (window_size - 1);
750 }
Neale Rannse11203e2021-09-21 12:34:19 +0000751 }
752
Maxime Peim0e2f1882022-12-22 11:26:57 +0000753 return n_lost;
Neale Rannse11203e2021-09-21 12:34:19 +0000754}
755
Neale Ranns6afaae12019-07-17 15:07:14 +0000756/*
757 * Anti replay window advance
758 * inputs need to be in host byte order.
Neale Ranns5b891102021-06-28 13:31:28 +0000759 * This function both advances the anti-replay window and the sequence number
760 * We always need to move on the SN but the window updates are only needed
761 * if AR is on.
762 * However, updating the window is trivial, so we do it anyway to save
763 * the branch cost.
Neale Ranns6afaae12019-07-17 15:07:14 +0000764 */
Neale Rannse11203e2021-09-21 12:34:19 +0000765always_inline u64
766ipsec_sa_anti_replay_advance (ipsec_sa_t *sa, u32 thread_index, u32 seq,
Maxime Peim0e2f1882022-12-22 11:26:57 +0000767 u32 hi_seq, bool ar_huge)
Damjan Marion1f4e1cb2019-03-28 19:19:31 +0100768{
Neale Rannse11203e2021-09-21 12:34:19 +0000769 u64 n_lost = 0;
Maxime Peim0e2f1882022-12-22 11:26:57 +0000770 u32 window_size = IPSEC_SA_ANTI_REPLAY_WINDOW_SIZE_KNOWN_WIN (sa, ar_huge);
Neale Ranns6afaae12019-07-17 15:07:14 +0000771 u32 pos;
Damjan Marion1f4e1cb2019-03-28 19:19:31 +0100772
Neale Ranns5b891102021-06-28 13:31:28 +0000773 if (ipsec_sa_is_set_USE_ESN (sa))
Damjan Marion1f4e1cb2019-03-28 19:19:31 +0100774 {
Neale Ranns5b891102021-06-28 13:31:28 +0000775 int wrap = hi_seq - sa->seq_hi;
Damjan Marion1f4e1cb2019-03-28 19:19:31 +0100776
Neale Ranns5b891102021-06-28 13:31:28 +0000777 if (wrap == 0 && seq > sa->seq)
Damjan Marion1f4e1cb2019-03-28 19:19:31 +0100778 {
Neale Ranns5b891102021-06-28 13:31:28 +0000779 pos = seq - sa->seq;
Maxime Peim0e2f1882022-12-22 11:26:57 +0000780 n_lost = ipsec_sa_anti_replay_window_shift (sa, pos, ar_huge);
Neale Ranns5b891102021-06-28 13:31:28 +0000781 sa->seq = seq;
Damjan Marion1f4e1cb2019-03-28 19:19:31 +0100782 }
783 else if (wrap > 0)
784 {
Maxime Peim0e2f1882022-12-22 11:26:57 +0000785 pos = seq + ~sa->seq + 1;
786 n_lost = ipsec_sa_anti_replay_window_shift (sa, pos, ar_huge);
Neale Ranns5b891102021-06-28 13:31:28 +0000787 sa->seq = seq;
788 sa->seq_hi = hi_seq;
Damjan Marion1f4e1cb2019-03-28 19:19:31 +0100789 }
790 else if (wrap < 0)
791 {
Neale Ranns5b891102021-06-28 13:31:28 +0000792 pos = ~seq + sa->seq + 1;
Maxime Peim0e2f1882022-12-22 11:26:57 +0000793 if (ar_huge)
794 clib_bitmap_set_no_check (sa->replay_window_huge,
795 seq & (window_size - 1), 1);
796 else
797 sa->replay_window |= (1ULL << (window_size - 1 - pos));
Damjan Marion1f4e1cb2019-03-28 19:19:31 +0100798 }
799 else
800 {
Neale Ranns5b891102021-06-28 13:31:28 +0000801 pos = sa->seq - seq;
Maxime Peim0e2f1882022-12-22 11:26:57 +0000802 if (ar_huge)
803 clib_bitmap_set_no_check (sa->replay_window_huge,
804 seq & (window_size - 1), 1);
805 else
806 sa->replay_window |= (1ULL << (window_size - 1 - pos));
Damjan Marion1f4e1cb2019-03-28 19:19:31 +0100807 }
808 }
809 else
810 {
Neale Ranns5b891102021-06-28 13:31:28 +0000811 if (seq > sa->seq)
Damjan Marion1f4e1cb2019-03-28 19:19:31 +0100812 {
Neale Ranns5b891102021-06-28 13:31:28 +0000813 pos = seq - sa->seq;
Maxime Peim0e2f1882022-12-22 11:26:57 +0000814 n_lost = ipsec_sa_anti_replay_window_shift (sa, pos, ar_huge);
Neale Ranns5b891102021-06-28 13:31:28 +0000815 sa->seq = seq;
Damjan Marion1f4e1cb2019-03-28 19:19:31 +0100816 }
817 else
818 {
Neale Ranns5b891102021-06-28 13:31:28 +0000819 pos = sa->seq - seq;
Maxime Peim0e2f1882022-12-22 11:26:57 +0000820 if (ar_huge)
821 clib_bitmap_set_no_check (sa->replay_window_huge,
822 seq & (window_size - 1), 1);
823 else
824 sa->replay_window |= (1ULL << (window_size - 1 - pos));
Damjan Marion1f4e1cb2019-03-28 19:19:31 +0100825 }
826 }
Neale Rannse11203e2021-09-21 12:34:19 +0000827
828 return n_lost;
Damjan Marion1f4e1cb2019-03-28 19:19:31 +0100829}
830
Neale Rannsf62a8c02019-04-02 08:13:33 +0000831
832/*
833 * Makes choice for thread_id should be assigned.
834 * if input ~0, gets random worker_id based on unix_time_now_nsec
835*/
Benoît Ganne5527a782022-01-18 15:56:41 +0100836always_inline u16
837ipsec_sa_assign_thread (u16 thread_id)
Neale Rannsf62a8c02019-04-02 08:13:33 +0000838{
839 return ((thread_id) ? thread_id
840 : (unix_time_now_nsec () % vlib_num_workers ()) + 1);
841}
842
Neale Rannsc5fe57d2021-02-25 16:01:28 +0000843always_inline ipsec_sa_t *
844ipsec_sa_get (u32 sa_index)
845{
846 return (pool_elt_at_index (ipsec_sa_pool, sa_index));
847}
848
Neale Ranns999c8ee2019-02-01 03:31:24 -0800849#endif /* __IPSEC_SPD_SA_H__ */
850
851/*
852 * fd.io coding-style-patch-verification: ON
853 *
854 * Local Variables:
855 * eval: (c-set-style "gnu")
856 * End:
857 */