2 *------------------------------------------------------------------
3 * Copyright (c) 2017 Cisco and/or its affiliates.
4 * Licensed under the Apache License, Version 2.0 (the "License");
5 * you may not use this file except in compliance with the License.
6 * You may obtain a copy of the License at:
8 * http://www.apache.org/licenses/LICENSE-2.0
10 * Unless required by applicable law or agreed to in writing, software
11 * distributed under the License is distributed on an "AS IS" BASIS,
12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13 * See the License for the specific language governing permissions and
14 * limitations under the License.
15 *------------------------------------------------------------------
19 #include <netinet/in.h>
21 #include <vlibapi/api.h>
22 #include <vlibmemory/api.h>
23 #include <vlibsocket/api.h>
25 #include <vlib/vlib.h>
26 #include <vnet/vnet.h>
27 #include <vnet/pg/pg.h>
28 #include <vppinfra/error.h>
29 #include <vnet/plugin/plugin.h>
31 #include <vppinfra/bihash_48_8.h>
33 #include "hash_lookup.h"
34 #include "hash_lookup_private.h"
37 static inline applied_hash_ace_entry_t **get_applied_hash_aces(acl_main_t *am, int is_input, u32 sw_if_index)
39 applied_hash_ace_entry_t **applied_hash_aces = is_input ? vec_elt_at_index(am->input_hash_entry_vec_by_sw_if_index, sw_if_index)
40 : vec_elt_at_index(am->output_hash_entry_vec_by_sw_if_index, sw_if_index);
41 return applied_hash_aces;
47 * This returns true if there is indeed a match on the portranges.
48 * With all these levels of indirections, this is not going to be very fast,
49 * so, best use the individual ports or wildcard ports for performance.
52 match_portranges(acl_main_t *am, fa_5tuple_t *match, u32 index)
55 applied_hash_ace_entry_t **applied_hash_aces = get_applied_hash_aces(am, match->pkt.is_input, match->pkt.sw_if_index);
56 applied_hash_ace_entry_t *pae = vec_elt_at_index((*applied_hash_aces), index);
58 acl_rule_t *r = &(am->acls[pae->acl_index].rules[pae->ace_index]);
59 DBG("PORTMATCH: %d <= %d <= %d && %d <= %d <= %d ?",
60 r->src_port_or_type_first, match->l4.port[0], r->src_port_or_type_last,
61 r->dst_port_or_code_first, match->l4.port[1], r->dst_port_or_code_last);
63 return ( ((r->src_port_or_type_first <= match->l4.port[0]) && r->src_port_or_type_last >= match->l4.port[0]) &&
64 ((r->dst_port_or_code_first <= match->l4.port[1]) && r->dst_port_or_code_last >= match->l4.port[1]) );
68 multi_acl_match_get_applied_ace_index(acl_main_t *am, fa_5tuple_t *match)
70 clib_bihash_kv_48_8_t kv;
71 clib_bihash_kv_48_8_t result;
72 fa_5tuple_t *kv_key = (fa_5tuple_t *)kv.key;
73 hash_acl_lookup_value_t *result_val = (hash_acl_lookup_value_t *)&result.value;
74 u64 *pmatch = (u64 *)match;
78 u32 curr_match_index = ~0;
80 u32 sw_if_index = match->pkt.sw_if_index;
81 u8 is_input = match->pkt.is_input;
82 applied_hash_ace_entry_t **applied_hash_aces = get_applied_hash_aces(am, is_input, sw_if_index);
83 applied_hash_acl_info_t **applied_hash_acls = is_input ? &am->input_applied_hash_acl_info_by_sw_if_index :
84 &am->output_applied_hash_acl_info_by_sw_if_index;
86 DBG("TRYING TO MATCH: %016llx %016llx %016llx %016llx %016llx %016llx",
87 pmatch[0], pmatch[1], pmatch[2], pmatch[3], pmatch[4], pmatch[5]);
89 for(mask_type_index=0; mask_type_index < pool_len(am->ace_mask_type_pool); mask_type_index++) {
90 if (!clib_bitmap_get(vec_elt_at_index((*applied_hash_acls), sw_if_index)->mask_type_index_bitmap, mask_type_index)) {
91 /* This bit is not set. Avoid trying to match */
94 ace_mask_type_entry_t *mte = vec_elt_at_index(am->ace_mask_type_pool, mask_type_index);
95 pmatch = (u64 *)match;
96 pmask = (u64 *)&mte->mask;
99 * unrolling the below loop results in a noticeable performance increase.
102 kv.key[i] = pmatch[i] & pmask[i];
106 *pkey++ = *pmatch++ & *pmask++;
107 *pkey++ = *pmatch++ & *pmask++;
108 *pkey++ = *pmatch++ & *pmask++;
109 *pkey++ = *pmatch++ & *pmask++;
110 *pkey++ = *pmatch++ & *pmask++;
111 *pkey++ = *pmatch++ & *pmask++;
113 kv_key->pkt.mask_type_index_lsb = mask_type_index;
114 DBG(" KEY %3d: %016llx %016llx %016llx %016llx %016llx %016llx", mask_type_index,
115 kv.key[0], kv.key[1], kv.key[2], kv.key[3], kv.key[4], kv.key[5]);
116 int res = BV (clib_bihash_search) (&am->acl_lookup_hash, &kv, &result);
118 DBG("ACL-MATCH! result_val: %016llx", result_val->as_u64);
119 if (result_val->applied_entry_index < curr_match_index) {
120 if (PREDICT_FALSE(result_val->need_portrange_check)) {
122 * This is going to be slow, since we can have multiple superset
123 * entries for narrow-ish portranges, e.g.:
124 * 0..42 100..400, 230..60000,
125 * so we need to walk linearly and check if they match.
128 u32 curr_index = result_val->applied_entry_index;
129 while ((curr_index != ~0) && !match_portranges(am, match, curr_index)) {
130 /* while no match and there are more entries, walk... */
131 applied_hash_ace_entry_t *pae = vec_elt_at_index((*applied_hash_aces),curr_index);
132 DBG("entry %d did not portmatch, advancing to %d", curr_index, pae->next_applied_entry_index);
133 curr_index = pae->next_applied_entry_index;
135 if (curr_index < curr_match_index) {
136 DBG("The index %d is the new candidate in portrange matches.", curr_index);
137 curr_match_index = result_val->applied_entry_index;
138 if (!result_val->shadowed) {
139 /* new result is known to not be shadowed, so no point to look up further */
143 DBG("Curr portmatch index %d is too big vs. current matched one %d", curr_index, curr_match_index);
146 /* The usual path is here. Found an entry in front of the current candiate - so it's a new one */
147 DBG("This match is the new candidate");
148 curr_match_index = result_val->applied_entry_index;
149 if (!result_val->shadowed) {
150 /* new result is known to not be shadowed, so no point to look up further */
157 DBG("MATCH-RESULT: %d", curr_match_index);
158 return curr_match_index;
162 hashtable_add_del(acl_main_t *am, clib_bihash_kv_48_8_t *kv, int is_add)
164 DBG("HASH ADD/DEL: %016llx %016llx %016llx %016llx %016llx %016llx %016llx add %d",
165 kv->key[0], kv->key[1], kv->key[2],
166 kv->key[3], kv->key[4], kv->key[5], kv->value, is_add);
167 BV (clib_bihash_add_del) (&am->acl_lookup_hash, kv, is_add);
171 fill_applied_hash_ace_kv(acl_main_t *am,
172 applied_hash_ace_entry_t **applied_hash_aces,
173 u32 sw_if_index, u8 is_input,
174 u32 new_index, clib_bihash_kv_48_8_t *kv)
176 fa_5tuple_t *kv_key = (fa_5tuple_t *)kv->key;
177 hash_acl_lookup_value_t *kv_val = (hash_acl_lookup_value_t *)&kv->value;
178 applied_hash_ace_entry_t *pae = vec_elt_at_index((*applied_hash_aces), new_index);
179 hash_acl_info_t *ha = vec_elt_at_index(am->hash_acl_infos, pae->acl_index);
181 memcpy(kv_key, &(vec_elt_at_index(ha->rules, pae->hash_ace_info_index)->match), sizeof(*kv_key));
182 /* initialize the sw_if_index and direction */
183 kv_key->pkt.sw_if_index = sw_if_index;
184 kv_key->pkt.is_input = is_input;
186 kv_val->applied_entry_index = new_index;
187 kv_val->need_portrange_check = vec_elt_at_index(ha->rules, pae->hash_ace_info_index)->src_portrange_not_powerof2 ||
188 vec_elt_at_index(ha->rules, pae->hash_ace_info_index)->dst_portrange_not_powerof2;
189 /* by default assume all values are shadowed -> check all mask types */
190 kv_val->shadowed = 1;
194 add_del_hashtable_entry(acl_main_t *am,
195 u32 sw_if_index, u8 is_input,
196 applied_hash_ace_entry_t **applied_hash_aces,
197 u32 index, int is_add)
199 clib_bihash_kv_48_8_t kv;
201 fill_applied_hash_ace_kv(am, applied_hash_aces, sw_if_index, is_input, index, &kv);
202 hashtable_add_del(am, &kv, is_add);
208 activate_applied_ace_hash_entry(acl_main_t *am,
209 u32 sw_if_index, u8 is_input,
210 applied_hash_ace_entry_t **applied_hash_aces,
213 clib_bihash_kv_48_8_t kv;
214 ASSERT(new_index != ~0);
215 applied_hash_ace_entry_t *pae = vec_elt_at_index((*applied_hash_aces), new_index);
216 DBG("activate_applied_ace_hash_entry sw_if_index %d is_input %d new_index %d", sw_if_index, is_input, new_index);
218 fill_applied_hash_ace_kv(am, applied_hash_aces, sw_if_index, is_input, new_index, &kv);
220 DBG("APPLY ADD KY: %016llx %016llx %016llx %016llx %016llx %016llx",
221 kv.key[0], kv.key[1], kv.key[2],
222 kv.key[3], kv.key[4], kv.key[5]);
224 clib_bihash_kv_48_8_t result;
225 hash_acl_lookup_value_t *result_val = (hash_acl_lookup_value_t *)&result.value;
226 int res = BV (clib_bihash_search) (&am->acl_lookup_hash, &kv, &result);
227 ASSERT(new_index != ~0);
228 ASSERT(new_index < vec_len((*applied_hash_aces)));
230 /* There already exists an entry or more. Append at the end. */
231 u32 first_index = result_val->applied_entry_index;
232 ASSERT(first_index != ~0);
233 DBG("A key already exists, with applied entry index: %d", first_index);
234 applied_hash_ace_entry_t *first_pae = vec_elt_at_index((*applied_hash_aces), first_index);
235 u32 last_index = first_pae->tail_applied_entry_index;
236 ASSERT(last_index != ~0);
237 applied_hash_ace_entry_t *last_pae = vec_elt_at_index((*applied_hash_aces), last_index);
238 DBG("...advance to chained entry index: %d", last_index);
239 /* link ourseves in */
240 last_pae->next_applied_entry_index = new_index;
241 pae->prev_applied_entry_index = last_index;
242 /* adjust the pointer to the new tail */
243 first_pae->tail_applied_entry_index = new_index;
245 /* It's the very first entry */
246 hashtable_add_del(am, &kv, 1);
247 ASSERT(new_index != ~0);
248 pae->tail_applied_entry_index = new_index;
253 applied_hash_entries_analyze(acl_main_t *am, applied_hash_ace_entry_t **applied_hash_aces)
256 * Go over the rules and check which ones are shadowed and which aren't.
257 * Naive approach: try to match the match value from every ACE as if it
258 * was a live packet, and see if the resulting match happens earlier in the list.
259 * if it does not match or it is later in the ACL - then the entry is not shadowed.
261 * This approach fails, an example:
262 * deny tcp 2001:db8::/32 2001:db8::/32
263 * permit ip 2001:db8::1/128 2001:db8::2/128
268 hash_acl_set_heap(acl_main_t *am)
270 if (0 == am->hash_lookup_mheap) {
271 am->hash_lookup_mheap = mheap_alloc (0 /* use VM */ , 2 << 25);
272 mheap_t *h = mheap_header (am->hash_lookup_mheap);
273 h->flags |= MHEAP_FLAG_THREAD_SAFE;
275 void *oldheap = clib_mem_set_heap(am->hash_lookup_mheap);
280 acl_plugin_hash_acl_set_validate_heap(acl_main_t *am, int on)
282 clib_mem_set_heap(hash_acl_set_heap(am));
283 mheap_t *h = mheap_header (am->hash_lookup_mheap);
285 h->flags |= MHEAP_FLAG_VALIDATE;
286 h->flags &= ~MHEAP_FLAG_SMALL_OBJECT_CACHE;
289 h->flags &= ~MHEAP_FLAG_VALIDATE;
290 h->flags |= MHEAP_FLAG_SMALL_OBJECT_CACHE;
295 acl_plugin_hash_acl_set_trace_heap(acl_main_t *am, int on)
297 clib_mem_set_heap(hash_acl_set_heap(am));
298 mheap_t *h = mheap_header (am->hash_lookup_mheap);
300 h->flags |= MHEAP_FLAG_TRACE;
302 h->flags &= ~MHEAP_FLAG_TRACE;
307 hash_acl_apply(acl_main_t *am, u32 sw_if_index, u8 is_input, int acl_index)
311 DBG("HASH ACL apply: sw_if_index %d is_input %d acl %d", sw_if_index, is_input, acl_index);
312 if (!am->acl_lookup_hash_initialized) {
313 BV (clib_bihash_init) (&am->acl_lookup_hash, "ACL plugin rule lookup bihash",
315 am->acl_lookup_hash_initialized = 1;
318 u32 *acl_vec = is_input ? *vec_elt_at_index(am->input_acl_vec_by_sw_if_index, sw_if_index)
319 : *vec_elt_at_index(am->output_acl_vec_by_sw_if_index, sw_if_index);
321 void *oldheap = hash_acl_set_heap(am);
323 vec_validate(am->input_hash_entry_vec_by_sw_if_index, sw_if_index);
325 vec_validate(am->output_hash_entry_vec_by_sw_if_index, sw_if_index);
327 vec_validate(am->hash_acl_infos, acl_index);
328 applied_hash_ace_entry_t **applied_hash_aces = get_applied_hash_aces(am, is_input, sw_if_index);
330 u32 order_index = vec_search(acl_vec, acl_index);
331 hash_acl_info_t *ha = vec_elt_at_index(am->hash_acl_infos, acl_index);
332 ASSERT(order_index != ~0);
334 int base_offset = vec_len(*applied_hash_aces);
336 /* Update the bitmap of the mask types with which the lookup
337 needs to happen for the ACLs applied to this sw_if_index */
338 applied_hash_acl_info_t **applied_hash_acls = is_input ? &am->input_applied_hash_acl_info_by_sw_if_index :
339 &am->output_applied_hash_acl_info_by_sw_if_index;
340 vec_validate((*applied_hash_acls), sw_if_index);
341 applied_hash_acl_info_t *pal = vec_elt_at_index((*applied_hash_acls), sw_if_index);
342 pal->mask_type_index_bitmap = clib_bitmap_or(pal->mask_type_index_bitmap,
343 ha->mask_type_index_bitmap);
345 * if the applied ACL is empty, the current code will cause a
346 * different behavior compared to current linear search: an empty ACL will
347 * simply fallthrough to the next ACL, or the default deny in the end.
349 * This is not a problem, because after vpp-dev discussion,
350 * the consensus was it should not be possible to apply the non-existent
351 * ACL, so the change adding this code also takes care of that.
354 /* expand the applied aces vector by the necessary amount */
355 vec_resize((*applied_hash_aces), vec_len(ha->rules));
357 /* add the rules from the ACL to the hash table for lookup and append to the vector*/
358 for(i=0; i < vec_len(ha->rules); i++) {
359 u32 new_index = base_offset + i;
360 applied_hash_ace_entry_t *pae = vec_elt_at_index((*applied_hash_aces), new_index);
361 pae->acl_index = acl_index;
362 pae->ace_index = ha->rules[i].ace_index;
363 pae->action = ha->rules[i].action;
364 pae->hash_ace_info_index = i;
365 /* we might link it in later */
366 pae->next_applied_entry_index = ~0;
367 pae->prev_applied_entry_index = ~0;
368 pae->tail_applied_entry_index = ~0;
369 activate_applied_ace_hash_entry(am, sw_if_index, is_input, applied_hash_aces, new_index);
371 applied_hash_entries_analyze(am, applied_hash_aces);
372 clib_mem_set_heap (oldheap);
376 find_head_applied_ace_index(applied_hash_ace_entry_t **applied_hash_aces, u32 curr_index)
379 * find back the first entry. Inefficient so might need to be a bit cleverer
380 * if this proves to be a problem..
382 u32 an_index = curr_index;
383 ASSERT(an_index != ~0);
384 applied_hash_ace_entry_t *head_pae = vec_elt_at_index((*applied_hash_aces), an_index);
385 while(head_pae->prev_applied_entry_index != ~0) {
386 an_index = head_pae->prev_applied_entry_index;
387 ASSERT(an_index != ~0);
388 head_pae = vec_elt_at_index((*applied_hash_aces), an_index);
394 move_applied_ace_hash_entry(acl_main_t *am,
395 u32 sw_if_index, u8 is_input,
396 applied_hash_ace_entry_t **applied_hash_aces,
397 u32 old_index, u32 new_index)
399 ASSERT(old_index != ~0);
400 ASSERT(new_index != ~0);
402 *vec_elt_at_index((*applied_hash_aces), new_index) = *vec_elt_at_index((*applied_hash_aces), old_index);
404 /* update the linkage and hash table if necessary */
405 applied_hash_ace_entry_t *pae = vec_elt_at_index((*applied_hash_aces), old_index);
407 if (pae->prev_applied_entry_index != ~0) {
408 applied_hash_ace_entry_t *prev_pae = vec_elt_at_index((*applied_hash_aces), pae->prev_applied_entry_index);
409 ASSERT(prev_pae->next_applied_entry_index == old_index);
410 prev_pae->next_applied_entry_index = new_index;
412 /* first entry - so the hash points to it, update */
413 add_del_hashtable_entry(am, sw_if_index, is_input,
414 applied_hash_aces, new_index, 1);
415 ASSERT(pae->tail_applied_entry_index != ~0);
417 if (pae->next_applied_entry_index != ~0) {
418 applied_hash_ace_entry_t *next_pae = vec_elt_at_index((*applied_hash_aces), pae->next_applied_entry_index);
419 ASSERT(next_pae->prev_applied_entry_index == old_index);
420 next_pae->prev_applied_entry_index = new_index;
423 * Moving the very last entry, so we need to update the tail pointer in the first one.
425 u32 head_index = find_head_applied_ace_index(applied_hash_aces, old_index);
426 ASSERT(head_index != ~0);
427 applied_hash_ace_entry_t *head_pae = vec_elt_at_index((*applied_hash_aces), head_index);
429 ASSERT(head_pae->tail_applied_entry_index == old_index);
430 head_pae->tail_applied_entry_index = new_index;
432 /* invalidate the old entry */
433 pae->prev_applied_entry_index = ~0;
434 pae->next_applied_entry_index = ~0;
435 pae->tail_applied_entry_index = ~0;
439 deactivate_applied_ace_hash_entry(acl_main_t *am,
440 u32 sw_if_index, u8 is_input,
441 applied_hash_ace_entry_t **applied_hash_aces,
444 applied_hash_ace_entry_t *pae = vec_elt_at_index((*applied_hash_aces), old_index);
445 DBG("UNAPPLY DEACTIVATE: sw_if_index %d is_input %d, applied index %d", sw_if_index, is_input, old_index);
447 if (pae->prev_applied_entry_index != ~0) {
448 DBG("UNAPPLY = index %d has prev_applied_entry_index %d", old_index, pae->prev_applied_entry_index);
449 applied_hash_ace_entry_t *prev_pae = vec_elt_at_index((*applied_hash_aces), pae->prev_applied_entry_index);
450 ASSERT(prev_pae->next_applied_entry_index == old_index);
451 prev_pae->next_applied_entry_index = pae->next_applied_entry_index;
452 if (pae->next_applied_entry_index == ~0) {
453 /* it was a last entry we removed, update the pointer on the first one */
454 u32 head_index = find_head_applied_ace_index(applied_hash_aces, old_index);
455 DBG("UNAPPLY = index %d head index to update %d", old_index, head_index);
456 ASSERT(head_index != ~0);
457 applied_hash_ace_entry_t *head_pae = vec_elt_at_index((*applied_hash_aces), head_index);
459 ASSERT(head_pae->tail_applied_entry_index == old_index);
460 head_pae->tail_applied_entry_index = pae->prev_applied_entry_index;
462 applied_hash_ace_entry_t *next_pae = vec_elt_at_index((*applied_hash_aces), pae->next_applied_entry_index);
463 next_pae->prev_applied_entry_index = pae->prev_applied_entry_index;
466 /* It was the first entry. We need either to reset the hash entry or delete it */
467 if (pae->next_applied_entry_index != ~0) {
468 /* the next element becomes the new first one, so needs the tail pointer to be set */
469 applied_hash_ace_entry_t *next_pae = vec_elt_at_index((*applied_hash_aces), pae->next_applied_entry_index);
470 ASSERT(pae->tail_applied_entry_index != ~0);
471 next_pae->tail_applied_entry_index = pae->tail_applied_entry_index;
472 DBG("Resetting the hash table entry from %d to %d, setting tail index to %d", old_index, pae->next_applied_entry_index, pae->tail_applied_entry_index);
473 /* unlink from the next element */
474 next_pae->prev_applied_entry_index = ~0;
475 add_del_hashtable_entry(am, sw_if_index, is_input,
476 applied_hash_aces, pae->next_applied_entry_index, 1);
478 /* no next entry, so just delete the entry in the hash table */
479 add_del_hashtable_entry(am, sw_if_index, is_input,
480 applied_hash_aces, old_index, 0);
483 /* invalidate the old entry */
484 pae->prev_applied_entry_index = ~0;
485 pae->next_applied_entry_index = ~0;
486 pae->tail_applied_entry_index = ~0;
491 hash_acl_build_applied_lookup_bitmap(acl_main_t *am, u32 sw_if_index, u8 is_input)
494 uword *new_lookup_bitmap = 0;
495 u32 **applied_acls = is_input ? vec_elt_at_index(am->input_acl_vec_by_sw_if_index, sw_if_index)
496 : vec_elt_at_index(am->output_acl_vec_by_sw_if_index, sw_if_index);
497 applied_hash_acl_info_t **applied_hash_acls = is_input ? &am->input_applied_hash_acl_info_by_sw_if_index
498 : &am->output_applied_hash_acl_info_by_sw_if_index;
499 applied_hash_acl_info_t *pal = vec_elt_at_index((*applied_hash_acls), sw_if_index);
500 for(i=0; i < vec_len(*applied_acls); i++) {
501 u32 a_acl_index = *vec_elt_at_index((*applied_acls), i);
502 hash_acl_info_t *ha = vec_elt_at_index(am->hash_acl_infos, a_acl_index);
503 new_lookup_bitmap = clib_bitmap_or(new_lookup_bitmap,
504 ha->mask_type_index_bitmap);
506 uword *old_lookup_bitmap = pal->mask_type_index_bitmap;
507 pal->mask_type_index_bitmap = new_lookup_bitmap;
508 clib_bitmap_free(old_lookup_bitmap);
512 hash_acl_unapply(acl_main_t *am, u32 sw_if_index, u8 is_input, int acl_index)
516 DBG("HASH ACL unapply: sw_if_index %d is_input %d acl %d", sw_if_index, is_input, acl_index);
518 hash_acl_info_t *ha = vec_elt_at_index(am->hash_acl_infos, acl_index);
519 applied_hash_ace_entry_t **applied_hash_aces = get_applied_hash_aces(am, is_input, sw_if_index);
521 for(i=0; i < vec_len((*applied_hash_aces)); i++) {
522 if (vec_elt_at_index(*applied_hash_aces,i)->acl_index == acl_index) {
523 DBG("Found applied ACL#%d at applied index %d", acl_index, i);
527 if (vec_len((*applied_hash_aces)) <= i) {
528 DBG("Did not find applied ACL#%d at sw_if_index %d", acl_index, sw_if_index);
529 /* we went all the way without finding any entries. Probably a list was empty. */
533 void *oldheap = hash_acl_set_heap(am);
535 int tail_offset = base_offset + vec_len(ha->rules);
536 int tail_len = vec_len((*applied_hash_aces)) - tail_offset;
537 DBG("base_offset: %d, tail_offset: %d, tail_len: %d", base_offset, tail_offset, tail_len);
539 for(i=0; i < vec_len(ha->rules); i ++) {
540 deactivate_applied_ace_hash_entry(am, sw_if_index, is_input,
541 applied_hash_aces, base_offset + i);
543 for(i=0; i < tail_len; i ++) {
544 /* move the entry at tail offset to base offset */
545 /* that is, from (tail_offset+i) -> (base_offset+i) */
546 DBG("UNAPPLY MOVE: sw_if_index %d is_input %d, applied index %d ->", sw_if_index, is_input, tail_offset+i, base_offset + i);
547 move_applied_ace_hash_entry(am, sw_if_index, is_input, applied_hash_aces, tail_offset + i, base_offset + i);
549 /* trim the end of the vector */
550 _vec_len((*applied_hash_aces)) -= vec_len(ha->rules);
552 applied_hash_entries_analyze(am, applied_hash_aces);
554 /* After deletion we might not need some of the mask-types anymore... */
555 hash_acl_build_applied_lookup_bitmap(am, sw_if_index, is_input);
556 clib_mem_set_heap (oldheap);
560 * Create the applied ACEs and update the hash table,
561 * taking into account that the ACL may not be the last
562 * in the vector of applied ACLs.
564 * For now, walk from the end of the vector and unapply the ACLs,
565 * then apply the one in question and reapply the rest.
569 hash_acl_reapply(acl_main_t *am, u32 sw_if_index, u8 is_input, int acl_index)
571 u32 **applied_acls = is_input ? vec_elt_at_index(am->input_acl_vec_by_sw_if_index, sw_if_index)
572 : vec_elt_at_index(am->output_acl_vec_by_sw_if_index, sw_if_index);
574 int start_index = vec_search((*applied_acls), acl_index);
576 * This function is called after we find out the sw_if_index where ACL is applied.
577 * If the by-sw_if_index vector does not have the ACL#, then it's a bug.
579 ASSERT(start_index < vec_len(*applied_acls));
581 /* unapply all the ACLs till the current one */
582 for(i = vec_len(*applied_acls) - 1; i >= start_index; i--) {
583 hash_acl_unapply(am, sw_if_index, is_input, *vec_elt_at_index(*applied_acls, i));
585 for(i = start_index; i < vec_len(*applied_acls); i++) {
586 hash_acl_apply(am, sw_if_index, is_input, *vec_elt_at_index(*applied_acls, i));
591 make_address_mask(ip46_address_t *addr, u8 is_ipv6, u8 prefix_len)
594 ip6_address_mask_from_width(&addr->ip6, prefix_len);
596 /* FIXME: this may not be correct way */
597 ip6_address_mask_from_width(&addr->ip6, prefix_len + 3*32);
598 ip46_address_mask_ip4(addr);
603 make_port_mask(u16 *portmask, u16 port_first, u16 port_last)
605 if (port_first == port_last) {
607 /* single port is representable by masked value */
610 if ((port_first == 0) && (port_last == 65535)) {
612 /* wildcard port is representable by a masked value */
617 * For now match all the ports, later
618 * here might be a better optimization which would
619 * pick out bitmaskable portranges.
621 * However, adding a new mask type potentially
622 * adds a per-packet extra lookup, so the benefit is not clear.
625 /* This port range can't be represented via bitmask exactly. */
630 make_mask_and_match_from_rule(fa_5tuple_t *mask, acl_rule_t *r, hash_ace_info_t *hi, int match_nonfirst_fragment)
632 memset(mask, 0, sizeof(*mask));
633 memset(&hi->match, 0, sizeof(hi->match));
634 hi->action = r->is_permit;
636 /* we will need to be matching based on sw_if_index, direction, and mask_type_index when applied */
637 mask->pkt.sw_if_index = ~0;
638 mask->pkt.is_input = 1;
639 /* we will assign the match of mask_type_index later when we find it*/
640 mask->pkt.mask_type_index_lsb = ~0;
642 mask->pkt.is_ip6 = 1;
643 hi->match.pkt.is_ip6 = r->is_ipv6;
645 make_address_mask(&mask->addr[0], r->is_ipv6, r->src_prefixlen);
646 hi->match.addr[0] = r->src;
647 make_address_mask(&mask->addr[1], r->is_ipv6, r->dst_prefixlen);
648 hi->match.addr[1] = r->dst;
651 mask->l4.proto = ~0; /* L4 proto needs to be matched */
652 hi->match.l4.proto = r->proto;
653 if (match_nonfirst_fragment) {
654 /* match the non-first fragments only */
655 mask->pkt.is_nonfirst_fragment = 1;
656 hi->match.pkt.is_nonfirst_fragment = 1;
658 /* Calculate the src/dst port masks and make the src/dst port matches accordingly */
659 hi->src_portrange_not_powerof2 = make_port_mask(&mask->l4.port[0], r->src_port_or_type_first, r->src_port_or_type_last);
660 hi->match.l4.port[0] = r->src_port_or_type_first & mask->l4.port[0];
661 hi->dst_portrange_not_powerof2 = make_port_mask(&mask->l4.port[1], r->dst_port_or_code_first, r->dst_port_or_code_last);
662 hi->match.l4.port[1] = r->dst_port_or_code_first & mask->l4.port[1];
663 /* L4 info must be valid in order to match */
664 mask->pkt.l4_valid = 1;
665 hi->match.pkt.l4_valid = 1;
666 /* And we must set the mask to check that it is an initial fragment */
667 mask->pkt.is_nonfirst_fragment = 1;
668 hi->match.pkt.is_nonfirst_fragment = 0;
669 if ((r->proto == IPPROTO_TCP) && (r->tcp_flags_mask != 0)) {
670 /* if we want to match on TCP flags, they must be masked off as well */
671 mask->pkt.tcp_flags = r->tcp_flags_mask;
672 hi->match.pkt.tcp_flags = r->tcp_flags_value;
673 /* and the flags need to be present within the packet being matched */
674 mask->pkt.tcp_flags_valid = 1;
675 hi->match.pkt.tcp_flags_valid = 1;
679 /* Sanitize the mask and the match */
680 u64 *pmask = (u64 *)mask;
681 u64 *pmatch = (u64 *)&hi->match;
684 pmatch[j] = pmatch[j] & pmask[j];
689 find_mask_type_index(acl_main_t *am, fa_5tuple_t *mask)
691 ace_mask_type_entry_t *mte;
693 pool_foreach(mte, am->ace_mask_type_pool,
695 if(memcmp(&mte->mask, mask, sizeof(*mask)) == 0)
696 return (mte - am->ace_mask_type_pool);
703 assign_mask_type_index(acl_main_t *am, fa_5tuple_t *mask)
705 u32 mask_type_index = find_mask_type_index(am, mask);
706 ace_mask_type_entry_t *mte;
707 if(~0 == mask_type_index) {
708 pool_get_aligned (am->ace_mask_type_pool, mte, CLIB_CACHE_LINE_BYTES);
709 mask_type_index = mte - am->ace_mask_type_pool;
710 clib_memcpy(&mte->mask, mask, sizeof(mte->mask));
713 * We can use only 16 bits, since in the match there is only u16 field.
714 * Realistically, once you go to 64K of mask types, it is a huge
715 * problem anyway, so we might as well stop half way.
717 ASSERT(mask_type_index < 32768);
719 mte = am->ace_mask_type_pool + mask_type_index;
721 return mask_type_index;
725 release_mask_type_index(acl_main_t *am, u32 mask_type_index)
727 ace_mask_type_entry_t *mte = pool_elt_at_index(am->ace_mask_type_pool, mask_type_index);
729 if (mte->refcount == 0) {
730 /* we are not using this entry anymore */
731 pool_put(am->ace_mask_type_pool, mte);
735 void hash_acl_add(acl_main_t *am, int acl_index)
737 void *oldheap = hash_acl_set_heap(am);
738 DBG("HASH ACL add : %d", acl_index);
740 acl_list_t *a = &am->acls[acl_index];
741 vec_validate(am->hash_acl_infos, acl_index);
742 hash_acl_info_t *ha = vec_elt_at_index(am->hash_acl_infos, acl_index);
743 memset(ha, 0, sizeof(*ha));
745 /* walk the newly added ACL entries and ensure that for each of them there
746 is a mask type, increment a reference count for that mask type */
747 for(i=0; i < a->count; i++) {
748 hash_ace_info_t ace_info;
750 memset(&ace_info, 0, sizeof(ace_info));
751 ace_info.acl_index = acl_index;
752 ace_info.ace_index = i;
754 make_mask_and_match_from_rule(&mask, &a->rules[i], &ace_info, 0);
755 ace_info.mask_type_index = assign_mask_type_index(am, &mask);
756 /* assign the mask type index for matching itself */
757 ace_info.match.pkt.mask_type_index_lsb = ace_info.mask_type_index;
758 DBG("ACE: %d mask_type_index: %d", i, ace_info.mask_type_index);
759 /* Ensure a given index is set in the mask type index bitmap for this ACL */
760 ha->mask_type_index_bitmap = clib_bitmap_set(ha->mask_type_index_bitmap, ace_info.mask_type_index, 1);
761 vec_add1(ha->rules, ace_info);
762 if (am->l4_match_nonfirst_fragment) {
763 /* add the second rule which matches the noninitial fragments with the respective mask */
764 make_mask_and_match_from_rule(&mask, &a->rules[i], &ace_info, 1);
765 ace_info.mask_type_index = assign_mask_type_index(am, &mask);
766 ace_info.match.pkt.mask_type_index_lsb = ace_info.mask_type_index;
767 DBG("ACE: %d (non-initial frags) mask_type_index: %d", i, ace_info.mask_type_index);
768 /* Ensure a given index is set in the mask type index bitmap for this ACL */
769 ha->mask_type_index_bitmap = clib_bitmap_set(ha->mask_type_index_bitmap, ace_info.mask_type_index, 1);
770 vec_add1(ha->rules, ace_info);
774 * if an ACL is applied somewhere, fill the corresponding lookup data structures.
775 * We need to take care if the ACL is not the last one in the vector of ACLs applied to the interface.
777 if (acl_index < vec_len(am->input_sw_if_index_vec_by_acl)) {
779 vec_foreach(sw_if_index, am->input_sw_if_index_vec_by_acl[acl_index]) {
780 hash_acl_reapply(am, *sw_if_index, 1, acl_index);
783 if (acl_index < vec_len(am->output_sw_if_index_vec_by_acl)) {
785 vec_foreach(sw_if_index, am->output_sw_if_index_vec_by_acl[acl_index]) {
786 hash_acl_reapply(am, *sw_if_index, 0, acl_index);
789 clib_mem_set_heap (oldheap);
792 void hash_acl_delete(acl_main_t *am, int acl_index)
794 void *oldheap = hash_acl_set_heap(am);
795 DBG("HASH ACL delete : %d", acl_index);
797 * If the ACL is applied somewhere, remove the references of it (call hash_acl_unapply)
798 * this is a different behavior from the linear lookup where an empty ACL is "deny all",
800 * However, following vpp-dev discussion the ACL that is referenced elsewhere
801 * should not be possible to delete, and the change adding this also adds
802 * the safeguards to that respect, so this is not a problem.
804 if (acl_index < vec_len(am->input_sw_if_index_vec_by_acl)) {
806 vec_foreach(sw_if_index, am->input_sw_if_index_vec_by_acl[acl_index]) {
807 hash_acl_unapply(am, *sw_if_index, 1, acl_index);
810 if (acl_index < vec_len(am->output_sw_if_index_vec_by_acl)) {
812 vec_foreach(sw_if_index, am->output_sw_if_index_vec_by_acl[acl_index]) {
813 hash_acl_unapply(am, *sw_if_index, 0, acl_index);
817 /* walk the mask types for the ACL about-to-be-deleted, and decrease
818 * the reference count, possibly freeing up some of them */
820 hash_acl_info_t *ha = vec_elt_at_index(am->hash_acl_infos, acl_index);
821 for(i=0; i < vec_len(ha->rules); i++) {
822 release_mask_type_index(am, ha->rules[i].mask_type_index);
824 clib_bitmap_free(ha->mask_type_index_bitmap);
826 clib_mem_set_heap (oldheap);
830 hash_multi_acl_match_5tuple (u32 sw_if_index, fa_5tuple_t * pkt_5tuple, int is_l2,
831 int is_ip6, int is_input, u32 * acl_match_p,
832 u32 * rule_match_p, u32 * trace_bitmap)
834 acl_main_t *am = &acl_main;
835 applied_hash_ace_entry_t **applied_hash_aces = get_applied_hash_aces(am, is_input, sw_if_index);
836 u32 match_index = multi_acl_match_get_applied_ace_index(am, pkt_5tuple);
837 if (match_index < vec_len((*applied_hash_aces))) {
838 applied_hash_ace_entry_t *pae = vec_elt_at_index((*applied_hash_aces), match_index);
839 *acl_match_p = pae->acl_index;
840 *rule_match_p = pae->ace_index;
848 show_hash_acl_hash (vlib_main_t * vm, acl_main_t *am, u32 verbose)
850 vlib_cli_output(vm, "\nACL lookup hash table:\n%U\n",
851 BV (format_bihash), &am->acl_lookup_hash, verbose);