1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
|
/*
* Copyright (c) 2015 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.
*/
/*
Copyright (c) 2001, 2002, 2003, 2005 Eliot Dresselhaus
Permission is hereby granted, free of charge, to any person obtaining
a copy of this software and associated documentation files (the
"Software"), to deal in the Software without restriction, including
without limitation the rights to use, copy, modify, merge, publish,
distribute, sublicense, and/or sell copies of the Software, and to
permit persons to whom the Software is furnished to do so, subject to
the following conditions:
The above copyright notice and this permission notice shall be
included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*/
#ifndef included_clib_bitmap_h
#define included_clib_bitmap_h
/** \file
Bitmaps built as vectors of machine words
*/
#include <vppinfra/vec.h>
#include <vppinfra/random.h>
#include <vppinfra/error.h>
typedef uword clib_bitmap_t;
/** predicate function; is an entire bitmap empty?
@param ai - pointer to a bitmap
@returns 1 if the entire bitmap is zero, 0 otherwise
*/
always_inline uword
clib_bitmap_is_zero (uword * ai)
{
uword i;
for (i = 0; i < vec_len (ai); i++)
if (ai[i] != 0)
return 0;
return 1;
}
/** predicate function; are two bitmaps equal?
@param a - pointer to a bitmap
@param b - pointer to a bitmap
@returns 1 if the bitmaps are equal, 0 otherwise
*/
always_inline uword
clib_bitmap_is_equal (uword * a, uword * b)
{
uword i;
if (vec_len (a) != vec_len (b))
return 0;
for (i = 0; i < vec_len (a); i++)
if (a[i] != b[i])
return 0;
return 1;
}
/** Duplicate a bitmap
@param v - pointer to a bitmap
@returns a duplicate of the bitmap
*/
#define clib_bitmap_dup(v) vec_dup(v)
/** Free a bitmap
@param v - pointer to the bitmap to free
*/
#define clib_bitmap_free(v) vec_free(v)
/** Number of bytes in a bitmap
@param v - pointer to the bitmap
*/
#define clib_bitmap_bytes(v) vec_bytes(v)
/** Clear a bitmap
@param v - pointer to the bitmap to clear
*/
#define clib_bitmap_zero(v) vec_zero(v)
/** Allocate a bitmap with the supplied number of bits
@param [out] v - the resulting bitmap
@param n_bits - the required number of bits
*/
#define clib_bitmap_alloc(v,n_bits) \
v = vec_new (uword, ((n_bits) + BITS (uword) - 1) / BITS (uword))
#define clib_bitmap_vec_validate(v,i) vec_validate_aligned((v),(i),sizeof(uword))
/* Make sure that a bitmap is at least n_bits in size */
#define clib_bitmap_validate(v,n_bits) \
clib_bitmap_vec_validate ((v), ((n_bits) - 1) / BITS (uword))
/** Copy a bitmap
@param dst - copy to
@param src - copy from
*/
static_always_inline void
clib_bitmap_copy (clib_bitmap_t **dst, const clib_bitmap_t *src)
{
if (vec_len (src))
{
clib_bitmap_vec_validate (*dst, vec_len (src) - 1);
vec_copy (*dst, src);
}
else
{
vec_reset_length (*dst);
}
}
/* low-level routine to remove trailing zeros from a bitmap */
always_inline uword *
_clib_bitmap_remove_trailing_zeros (uword * a)
{
word i;
if (a)
{
for (i = _vec_len (a) - 1; i >= 0; i--)
if (a[i] != 0)
break;
vec_set_len (a, i + 1);
}
return a;
}
/** Sets the ith bit of a bitmap to new_value.
No sanity checking. Be careful.
@param a - pointer to the bitmap
@param i - the bit position to interrogate
@param new_value - new value for the bit
@returns the old value of the bit
*/
always_inline uword
clib_bitmap_set_no_check (uword * a, uword i, uword new_value)
{
uword i0 = i / BITS (a[0]);
uword i1 = i % BITS (a[0]);
uword bit = (uword) 1 << i1;
uword ai, old_value;
/* Removed ASSERT since uword * a may not be a vector. */
/* ASSERT (i0 < vec_len (a)); */
ai = a[i0];
old_value = (ai & bit) != 0;
ai &= ~bit;
ai |= ((uword) (new_value != 0)) << i1;
a[i0] = ai;
return old_value;
}
/** Sets the ith bit of a bitmap to new_value
Removes trailing zeros from the bitmap
@param ai - pointer to the bitmap
@param i - the bit position to interrogate
@param value - new value for the bit
@returns the (possibly reallocated) bitmap object pointer
*/
always_inline uword *
clib_bitmap_set (uword * ai, uword i, uword value)
{
uword i0 = i / BITS (ai[0]);
uword i1 = i % BITS (ai[0]);
uword a;
/* Check for writing a zero to beyond end of bitmap. */
if (value == 0 && i0 >= vec_len (ai))
return ai; /* Implied trailing zeros. */
clib_bitmap_vec_validate (ai, i0);
a = ai[i0];
a &= ~((uword) 1 << i1);
a |= ((uword) (value != 0)) << i1;
ai[i0] = a;
/* If bits have been cleared, test for zero. */
if (a == 0)
ai = _clib_bitmap_remove_trailing_zeros (ai);
return ai;
}
always_inline u8
clib_bitmap_will_expand (uword *ai, uword i)
{
return (i / BITS (ai[0])) >= vec_max_len (ai);
}
/** Gets the ith bit value from a bitmap
@param ai - pointer to the bitmap
@param i - the bit position to interrogate
@returns the indicated bit value
*/
always_inline uword
clib_bitmap_get (uword * ai, uword i)
{
uword i0 = i / BITS (ai[0]);
uword i1 = i % BITS (ai[0]);
return i0 < vec_len (ai) && 0 != ((ai[i0] >> i1) & 1);
}
/** Gets the ith bit value from a bitmap
Does not sanity-check the bit position. Be careful.
@param ai - pointer to the bitmap
@param i - the bit position to interrogate
@returns the indicated bit value, or garbage if the bit position is
out of range.
*/
always_inline uword
clib_bitmap_get_no_check (uword * ai, uword i)
{
uword i0 = i / BITS (ai[0]);
uword i1 = i % BITS (ai[0]);
return 0 != ((ai[i0] >> i1) & 1);
}
always_inline uword
clib_bitmap_get_multiple_no_check (uword * ai, uword i, uword n_bits)
{
uword i0 = i / BITS (ai[0]);
uword i1 = i % BITS (ai[0]);
ASSERT (i1 + n_bits <= BITS (uword));
return ((ai[i0] >> i1) & pow2_mask (n_bits));
}
/** Gets the ith through ith + n_bits bit values from a bitmap
@param bitmap - pointer to the bitmap
@param i - the first bit position to retrieve
@param n_bits - the number of bit positions to retrieve
@returns the indicated range of bits
*/
always_inline uword
clib_bitmap_get_multiple (uword * bitmap, uword i, uword n_bits)
{
uword i0, i1, result;
uword l = vec_len (bitmap);
ASSERT (n_bits <= BITS (result));
i0 = i / BITS (bitmap[0]);
i1 = i % BITS (bitmap[0]);
/* Check first word. */
result = 0;
if (i0 < l)
{
result |= (bitmap[i0] >> i1);
if (n_bits < BITS (bitmap[0]))
result &= (((uword) 1 << n_bits) - 1);
}
/* Check for overlap into next word. */
i0++;
if (i1 + n_bits > BITS (bitmap[0]) && i0 < l)
{
n_bits -= BITS (bitmap[0]) - i1;
result |=
(bitmap[i0] & (((uword) 1 << n_bits) - 1)) << (BITS (bitmap[0]) - i1);
}
return result;
}
/** sets the ith through ith + n_bits bits in a bitmap
@param bitmap - pointer to the bitmap
@param i - the first bit position to retrieve
@param value - the values to set
@param n_bits - the number of bit positions to set
@returns a pointer to the updated bitmap, which may expand and move
*/
always_inline uword *
clib_bitmap_set_multiple (uword * bitmap, uword i, uword value, uword n_bits)
{
uword i0, i1, l, t, m;
ASSERT (n_bits <= BITS (value));
i0 = i / BITS (bitmap[0]);
i1 = i % BITS (bitmap[0]);
/* Allocate bitmap. */
clib_bitmap_vec_validate (bitmap, (i + n_bits - 1) / BITS (bitmap[0]));
l = vec_len (bitmap);
m = ~0;
if (n_bits < BITS (value))
m = (((uword) 1 << n_bits) - 1);
value &= m;
/* Insert into first word. */
t = bitmap[i0];
t &= ~(m << i1);
t |= value << i1;
bitmap[i0] = t;
/* Insert into second word. */
i0++;
if (i1 + n_bits > BITS (bitmap[0]) && i0 < l)
{
t = BITS (bitmap[0]) - i1;
value >>= t;
n_bits -= t;
t = bitmap[i0];
m = ((uword) 1 << n_bits) - 1;
t &= ~m;
t |= value;
bitmap[i0] = t;
}
return bitmap;
}
always_inline uword *
clib_bitmap_set_region (uword * bitmap, uword i, uword value, uword n_bits)
{
uword a0, a1, b0, b1;
uword i_end, mask;
a0 = i / BITS (bitmap[0]);
a1 = i % BITS (bitmap[0]);
i_end = i + n_bits - 1;
b0 = i_end / BITS (bitmap[0]);
b1 = i_end % BITS (bitmap[0]);
clib_bitmap_vec_validate (bitmap, b0);
/* First word. */
mask = n_bits < BITS (bitmap[0]) ? pow2_mask (n_bits) : ~0;
mask <<= a1;
if (value)
bitmap[a0] |= mask;
else
bitmap[a0] &= ~mask;
for (a0++; a0 < b0; a0++)
bitmap[a0] = value ? ~0 : 0;
if (a0 == b0)
{
mask = (uword) ~0 >> (BITS (bitmap[0]) - b1 - 1);
if (value)
bitmap[a0] |= mask;
else
bitmap[a0] &= ~mask;
}
return bitmap;
}
/** Macro to iterate across set bits in a bitmap
@param i - the current set bit
@param ai - the bitmap
@param body - the expression to evaluate for each set bit
*/
#define clib_bitmap_foreach(i,ai) \
if (ai) \
for (i = clib_bitmap_first_set (ai); \
i != ~0; \
i = clib_bitmap_next_set (ai, i + 1))
/** Return the lowest numbered set bit in a bitmap
@param ai - pointer to the bitmap
@returns lowest numbered set bit, or ~0 if the entire bitmap is zero
*/
always_inline uword
clib_bitmap_first_set (uword * ai)
{
uword i = 0;
#if uword_bits == 64
#if defined(CLIB_HAVE_VEC256)
while (i + 7 < vec_len (ai))
{
u64x4 v;
v = u64x4_load_unaligned (ai + i) | u64x4_load_unaligned (ai + i + 4);
if (!u64x4_is_all_zero (v))
break;
i += 8;
}
#elif defined(CLIB_HAVE_VEC128) && defined(CLIB_HAVE_VEC128_UNALIGNED_LOAD_STORE)
while (i + 3 < vec_len (ai))
{
u64x2 v;
v = u64x2_load_unaligned (ai + i) | u64x2_load_unaligned (ai + i + 2);
if (!u64x2_is_all_zero (v))
break;
i += 4;
}
#endif
#endif
for (; i < vec_len (ai); i++)
{
uword x = ai[i];
if (x != 0)
return i * BITS (ai[0]) + log2_first_set (x);
}
return ~0;
}
/** Return the higest numbered set bit in a bitmap
@param ai - pointer to the bitmap
@returns lowest numbered set bit, or ~0 if the entire bitmap is zero
*/
always_inline uword
clib_bitmap_last_set (uword * ai)
{
uword i;
for (i = vec_len (ai); i > 0; i--)
{
uword x = ai[i - 1];
if (x != 0)
{
uword first_bit;
first_bit = count_leading_zeros (x);
return (i) * BITS (ai[0]) - first_bit - 1;
}
}
return ~0;
}
/** Return the lowest numbered clear bit in a bitmap
@param ai - pointer to the bitmap
@returns lowest numbered clear bit
*/
always_inline uword
clib_bitmap_first_clear (uword * ai)
{
uword i;
for (i = 0; i < vec_len (ai); i++)
{
uword x = ~ai[i];
if (x != 0)
return i * BITS (ai[0]) + log2_first_set (x);
}
return i * BITS (ai[0]);
}
/** Return the number of set bits in a bitmap
@param ai - pointer to the bitmap
@returns the number of set bits in the bitmap
*/
always_inline uword
clib_bitmap_count_set_bits (uword * ai)
{
uword i;
uword n_set = 0;
for (i = 0; i < vec_len (ai); i++)
n_set += count_set_bits (ai[i]);
return n_set;
}
/** Logical operator across two bitmaps
@param ai - pointer to the destination bitmap
@param bi - pointer to the source bitmap
@returns ai = ai and bi. ai is modified, bi is not modified
*/
always_inline uword *clib_bitmap_and (uword * ai, uword * bi);
/** Logical operator across two bitmaps
@param ai - pointer to the destination bitmap
@param bi - pointer to the source bitmap
@returns ai = ai & ~bi. ai is modified, bi is not modified
*/
always_inline uword *clib_bitmap_andnot (uword * ai, uword * bi);
/** Logical operator across two bitmaps
@param ai - pointer to the destination bitmap
@param bi - pointer to the source bitmap
@returns ai = ai & ~bi. ai is modified, bi is not modified
*/
always_inline uword *clib_bitmap_or (uword * ai, uword * bi);
/** Logical operator across two bitmaps
@param ai - pointer to the destination bitmap
@param bi - pointer to the source bitmap
@returns ai = ai or bi. ai is modified, bi is not modified
*/
always_inline uword *clib_bitmap_or (uword * ai, uword * bi);
/** Logical operator across two bitmaps
@param ai - pointer to the destination bitmap
@param bi - pointer to the source bitmap
@returns ai = ai xor bi. ai is modified, bi is not modified
*/
always_inline uword *clib_bitmap_xor (uword * ai, uword * bi);
/* ALU function definition macro for functions taking two bitmaps. */
#define _(name, body, check_zero) \
always_inline uword *clib_bitmap_##name (uword *ai, uword *bi) \
{ \
uword i, a, b, bi_len, n_trailing_zeros; \
\
n_trailing_zeros = 0; \
bi_len = vec_len (bi); \
if (bi_len > 0) \
clib_bitmap_vec_validate (ai, bi_len - 1); \
for (i = 0; i < vec_len (ai); i++) \
{ \
a = ai[i]; \
b = i < bi_len ? bi[i] : 0; \
do \
{ \
body; \
} \
while (0); \
ai[i] = a; \
if (check_zero) \
n_trailing_zeros = a ? 0 : (n_trailing_zeros + 1); \
} \
if (check_zero) \
vec_dec_len (ai, n_trailing_zeros); \
return ai; \
}
/* ALU functions: */
/* *INDENT-OFF* */
_(and, a = a & b, 1)
_(andnot, a = a & ~b, 1)
_(or, a = a | b, 0)
_(xor, a = a ^ b, 1)
/* *INDENT-ON* */
#undef _
/** Logical operator across two bitmaps which duplicates the first bitmap
@param ai - pointer to the destination bitmap
@param bi - pointer to the source bitmap
@returns aiDup = ai and bi. Neither ai nor bi are modified
*/
always_inline uword *clib_bitmap_dup_and (uword * ai, uword * bi);
/** Logical operator across two bitmaps which duplicates the first bitmap
@param ai - pointer to the destination bitmap
@param bi - pointer to the source bitmap
@returns aiDup = ai & ~bi. Neither ai nor bi are modified
*/
always_inline uword *clib_bitmap_dup_andnot (uword * ai, uword * bi);
/** Logical operator across two bitmaps which duplicates the first bitmap
@param ai - pointer to the destination bitmap
@param bi - pointer to the source bitmap
@returns aiDup = ai or bi. Neither ai nor bi are modified
*/
always_inline uword *clib_bitmap_dup_or (uword * ai, uword * bi);
/** Logical operator across two bitmaps which duplicates the first bitmap
@param ai - pointer to the destination bitmap
@param bi - pointer to the source bitmap
@returns aiDup = ai xor bi. Neither ai nor bi are modified
*/
always_inline uword *clib_bitmap_dup_xor (uword * ai, uword * bi);
#define _(name) \
always_inline uword * \
clib_bitmap_dup_##name (uword * ai, uword * bi) \
{ return clib_bitmap_##name (clib_bitmap_dup (ai), bi); }
/* *INDENT-OFF* */
_(and);
_(andnot);
_(or);
_(xor);
/* *INDENT-ON* */
#undef _
/* ALU function definition macro for functions taking one bitmap and an
* immediate. */
#define _(name, body, check_zero) \
always_inline uword * \
clib_bitmap_##name (uword * ai, uword i) \
{ \
uword i0 = i / BITS (ai[0]); \
uword i1 = i % BITS (ai[0]); \
uword a, b; \
clib_bitmap_vec_validate (ai, i0); \
a = ai[i0]; \
b = (uword) 1 << i1; \
do { body; } while (0); \
ai[i0] = a; \
if (check_zero && a == 0) \
ai = _clib_bitmap_remove_trailing_zeros (ai); \
return ai; \
}
/* ALU functions immediate: */
/* *INDENT-OFF* */
_(andi, a = a & b, 1)
_(andnoti, a = a & ~b, 1)
_(ori, a = a | b, 0)
_(xori, a = a ^ b, 1)
/* *INDENT-ON* */
#undef _
/* ALU function definition macro for functions taking one bitmap and an
* immediate. No tail trimming */
#define _(name, body) \
always_inline uword * \
clib_bitmap_##name##_notrim (uword * ai, uword i) \
{ \
uword i0 = i / BITS (ai[0]); \
uword i1 = i % BITS (ai[0]); \
uword a, b; \
clib_bitmap_vec_validate (ai, i0); \
a = ai[i0]; \
b = (uword) 1 << i1; \
do { body; } while (0); \
ai[i0] = a; \
return ai; \
}
/* ALU functions immediate: */
/* *INDENT-OFF* */
_(andi, a = a & b)
_(andnoti, a = a & ~b)
_(ori, a = a | b)
_(xori, a = a ^ b)
#undef _
/* *INDENT-ON* */
/** Return a random bitmap of the requested length
@param ai - pointer to the destination bitmap
@param n_bits - number of bits to allocate
@param [in,out] seed - pointer to the random number seed
@returns a reasonably random bitmap based. See random.h.
*/
always_inline uword *
clib_bitmap_random (uword * ai, uword n_bits, u32 * seed)
{
vec_reset_length (ai);
if (n_bits > 0)
{
uword i = n_bits - 1;
uword i0, i1;
uword log2_rand_max;
log2_rand_max = min_log2 (random_u32_max ());
i0 = i / BITS (ai[0]);
i1 = i % BITS (ai[0]);
clib_bitmap_vec_validate (ai, i0);
for (i = 0; i <= i0; i++)
{
uword n;
for (n = 0; n < BITS (ai[i]); n += log2_rand_max)
ai[i] |= random_u32 (seed) << n;
}
if (i1 + 1 < BITS (ai[0]))
ai[i0] &= (((uword) 1 << (i1 + 1)) - 1);
}
return ai;
}
/** Return the next set bit in a bitmap starting at bit i
@param ai - pointer to the bitmap
@param i - first bit position to test
@returns first set bit position at or after i,
~0 if no further set bits are found
*/
always_inline uword
clib_bitmap_next_set (uword * ai, uword i)
{
uword i0 = i / BITS (ai[0]);
uword i1 = i % BITS (ai[0]);
uword t;
if (i0 < vec_len (ai))
{
t = (ai[i0] >> i1) << i1;
if (t)
return log2_first_set (t) + i0 * BITS (ai[0]);
for (i0++; i0 < vec_len (ai); i0++)
{
t = ai[i0];
if (t)
return log2_first_set (t) + i0 * BITS (ai[0]);
}
}
return ~0;
}
/** Return the next clear bit in a bitmap starting at bit i
@param ai - pointer to the bitmap
@param i - first bit position to test
@returns first clear bit position at or after i
*/
always_inline uword
clib_bitmap_next_clear (uword * ai, uword i)
{
uword i0 = i / BITS (ai[0]);
uword i1 = i % BITS (ai[0]);
uword t;
if (i0 < vec_len (ai))
{
t = (~ai[i0] >> i1) << i1;
if (t)
return log2_first_set (t) + i0 * BITS (ai[0]);
for (i0++; i0 < vec_len (ai); i0++)
{
t = ~ai[i0];
if (t)
return log2_first_set (t) + i0 * BITS (ai[0]);
}
return i0 * BITS (ai[0]);
}
return i;
}
uword unformat_bitmap_mask (unformat_input_t *input, va_list *va);
uword unformat_bitmap_list (unformat_input_t *input, va_list *va);
u8 *format_bitmap_hex (u8 *s, va_list *args);
u8 *format_bitmap_list (u8 *s, va_list *args);
#endif /* included_clib_bitmap_h */
/*
* fd.io coding-style-patch-verification: ON
*
* Local Variables:
* eval: (c-set-style "gnu")
* End:
*/
|