e6eefb6e3c
Change-Id: I3b3e868277d5caf6b1341814003a3bc5726c2df9 Signed-off-by: Paul Vinciguerra <pvinci@vinciconsulting.com>
108 lines
2.8 KiB
C
108 lines
2.8 KiB
C
/*
|
|
* Copyright (c) 2016 Cisco and/or its affiliates.
|
|
* Licensed under the Apache License, Version 2.0 (the "License");
|
|
* you may not use this file except in compliance with the License.
|
|
* You may obtain a copy of the License at:
|
|
*
|
|
* http://www.apache.org/licenses/LICENSE-2.0
|
|
*
|
|
* Unless required by applicable law or agreed to in writing, software
|
|
* distributed under the License is distributed on an "AS IS" BASIS,
|
|
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
* See the License for the specific language governing permissions and
|
|
* limitations under the License.
|
|
*/
|
|
|
|
#ifndef __BIER_BIT_STRING_H__
|
|
#define __BIER_BIT_STRING_H__
|
|
|
|
#include <vppinfra/byte_order.h>
|
|
#include <vppinfra/format.h>
|
|
|
|
#include <vnet/bier/bier_types.h>
|
|
|
|
#define BIER_BBS_LEN_TO_BUCKETS(_len) (_len)
|
|
#define BIER_BBS_LEN_TO_BITS(_len) (_len * 8)
|
|
#define BIER_BBS_LEN_TO_INTS(_len) ((_len) / sizeof(int))
|
|
#define BIER_BIT_MASK_BITS_PER_INT (sizeof(int) * 8)
|
|
|
|
/*
|
|
* bier_find_first_bit_set
|
|
*
|
|
* find the position of the first bit set in a long
|
|
*/
|
|
static inline int
|
|
bier_find_first_bit_string_set (int mask)
|
|
{
|
|
return (__builtin_ffs(clib_net_to_host_u32(mask)));
|
|
}
|
|
|
|
extern void bier_bit_string_set_bit(bier_bit_string_t *mask,
|
|
bier_bp_t bp);
|
|
|
|
|
|
extern void bier_bit_string_clear_bit(bier_bit_string_t *mask,
|
|
bier_bp_t bp);
|
|
|
|
|
|
extern u8 *format_bier_bit_string(u8 * s, va_list * args);
|
|
|
|
#define BIER_BBS_NUM_INT_BUCKETS(_bbs) \
|
|
(BIER_BBS_LEN_TO_BUCKETS(_bbs->bbs_len) / sizeof(int))
|
|
|
|
always_inline int
|
|
bier_bit_string_is_zero (const bier_bit_string_t *src)
|
|
{
|
|
u16 index;
|
|
|
|
for (index = 0;
|
|
index < BIER_BBS_NUM_INT_BUCKETS(src);
|
|
index++) {
|
|
if (((int*)src->bbs_buckets)[index] != 0) {
|
|
return (0);
|
|
}
|
|
}
|
|
return (1);
|
|
}
|
|
|
|
always_inline void
|
|
bier_bit_string_clear_string (const bier_bit_string_t *src,
|
|
bier_bit_string_t *dest)
|
|
{
|
|
u16 index;
|
|
|
|
ASSERT(src->bbs_len == dest->bbs_len);
|
|
|
|
for (index = 0;
|
|
index < BIER_BBS_NUM_INT_BUCKETS(src);
|
|
index++) {
|
|
((int*)dest->bbs_buckets)[index] &= ~(((int*)src->bbs_buckets)[index]);
|
|
}
|
|
}
|
|
|
|
always_inline void
|
|
bier_bit_string_logical_and_string (const bier_bit_string_t *src,
|
|
bier_bit_string_t *dest)
|
|
{
|
|
u16 index;
|
|
|
|
ASSERT(src->bbs_len == dest->bbs_len);
|
|
|
|
for (index = 0;
|
|
index < BIER_BBS_NUM_INT_BUCKETS(src);
|
|
index++) {
|
|
((int*)dest->bbs_buckets)[index] &= ((int*)src->bbs_buckets)[index];
|
|
}
|
|
}
|
|
|
|
always_inline void
|
|
bier_bit_string_init (bier_bit_string_t *bbs,
|
|
bier_hdr_len_id_t len,
|
|
bier_bit_mask_bucket_t *buckets)
|
|
{
|
|
bbs->bbs_len = bier_hdr_len_id_to_num_bytes(len);
|
|
bbs->bbs_buckets = buckets;
|
|
}
|
|
|
|
#endif
|