blob: 05af8fe71687292b5a653d7981da1110d7cfff11 [file] [log] [blame]
Ed Warnickecb9cada2015-12-08 15:45:58 -07001/*
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/*
16 Copyright (c) 2001, 2002, 2003 Eliot Dresselhaus
17
18 Permission is hereby granted, free of charge, to any person obtaining
19 a copy of this software and associated documentation files (the
20 "Software"), to deal in the Software without restriction, including
21 without limitation the rights to use, copy, modify, merge, publish,
22 distribute, sublicense, and/or sell copies of the Software, and to
23 permit persons to whom the Software is furnished to do so, subject to
24 the following conditions:
25
26 The above copyright notice and this permission notice shall be
27 included in all copies or substantial portions of the Software.
28
29 THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
30 EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
31 MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
32 NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
33 LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
34 OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
35 WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
36*/
37
38#ifndef included_clib_h
39#define included_clib_h
40
Benoît Ganne5e60c172020-07-07 16:32:22 +020041#include <stddef.h>
Damjan Marion5f21e1b2018-08-01 14:38:36 +020042#include <vppinfra/config.h>
43
Damjan Marion68e5fd52020-04-23 13:41:47 +020044#ifdef __x86_64__
45#include <x86intrin.h>
46#endif
47
Ed Warnickecb9cada2015-12-08 15:45:58 -070048/* Standalone means to not assume we are running on a Unix box. */
49#if ! defined (CLIB_STANDALONE) && ! defined (CLIB_LINUX_KERNEL)
50#define CLIB_UNIX
51#endif
52
53#include <vppinfra/types.h>
Sirshak Das2f6d7bb2018-10-03 22:53:51 +000054#include <vppinfra/atomics.h>
Ed Warnickecb9cada2015-12-08 15:45:58 -070055
56/* Global DEBUG flag. Setting this to 1 or 0 turns off
57 ASSERT (see vppinfra/error.h) & other debugging code. */
58#ifndef CLIB_DEBUG
59#define CLIB_DEBUG 0
60#endif
61
62#ifndef NULL
63#define NULL ((void *) 0)
64#endif
65
66#define BITS(x) (8*sizeof(x))
67#define ARRAY_LEN(x) (sizeof (x)/sizeof (x[0]))
68
69#define _STRUCT_FIELD(t,f) (((t *) 0)->f)
Benoît Ganne5e60c172020-07-07 16:32:22 +020070#define STRUCT_OFFSET_OF(t,f) offsetof(t, f)
71#define STRUCT_BIT_OFFSET_OF(t,f) (BITS(u8) * STRUCT_OFFSET_OF (t, f))
Ed Warnickecb9cada2015-12-08 15:45:58 -070072#define STRUCT_SIZE_OF(t,f) (sizeof (_STRUCT_FIELD (t, f)))
73#define STRUCT_BITS_OF(t,f) (BITS (_STRUCT_FIELD (t, f)))
74#define STRUCT_ARRAY_LEN(t,f) ARRAY_LEN (_STRUCT_FIELD (t, f))
Dave Barachdbf19ca2016-03-15 10:21:54 +010075#define STRUCT_MARK(mark) u8 mark[0]
76#define STRUCT_MARK_PTR(v, f) &(v)->f
Ed Warnickecb9cada2015-12-08 15:45:58 -070077
78/* Stride in bytes between struct array elements. */
79#define STRUCT_STRIDE_OF(t,f) \
80 ( ((uword) & (((t *) 0)[1].f)) \
81 - ((uword) & (((t *) 0)[0].f)))
82
83#define STRUCT_OFFSET_OF_VAR(v,f) ((uword) (&(v)->f) - (uword) (v))
84
85/* Used to pack structure elements. */
86#define CLIB_PACKED(x) x __attribute__ ((packed))
Dave Barachc3799992016-08-15 11:12:27 -040087#define CLIB_UNUSED(x) x __attribute__ ((unused))
Ed Warnickecb9cada2015-12-08 15:45:58 -070088
David Johnsond9818dd2018-12-14 14:53:41 -050089/* similar to CLIB_CACHE_LINE_ALIGN_MARK() but with arbitrary alignment */
90#define CLIB_ALIGN_MARK(name, alignment) u8 name[0] __attribute__((aligned(alignment)))
91
Dave Barachcabbee72017-11-18 08:43:06 -050092/* Make a string from the macro's argument */
93#define CLIB_STRING_MACRO(x) #x
94
Damjan Marion04f3db32017-11-10 21:55:45 +010095#define __clib_unused __attribute__ ((unused))
96#define __clib_weak __attribute__ ((weak))
97#define __clib_packed __attribute__ ((packed))
98#define __clib_constructor __attribute__ ((constructor))
Damjan Mariona1e03d42020-05-06 23:38:58 +020099#define __clib_noinline __attribute__ ((noinline))
100#define __clib_aligned(x) __attribute__ ((aligned(x)))
101#define __clib_section(s) __attribute__ ((section(s)))
Damjan Mariona2185122020-04-08 00:52:53 +0200102#define __clib_warn_unused_result __attribute__ ((warn_unused_result))
Damjan Mariondae1c7e2020-10-17 13:32:25 +0200103#define __clib_export __attribute__ ((visibility("default")))
Damjan Marion04f3db32017-11-10 21:55:45 +0100104
Ed Warnickecb9cada2015-12-08 15:45:58 -0700105#define never_inline __attribute__ ((__noinline__))
106
107#if CLIB_DEBUG > 0
108#define always_inline static inline
109#define static_always_inline static inline
110#else
111#define always_inline static inline __attribute__ ((__always_inline__))
112#define static_always_inline static inline __attribute__ ((__always_inline__))
113#endif
114
115
116/* Reserved (unused) structure element with address offset between
117 from and to. */
118#define CLIB_PAD_FROM_TO(from,to) u8 pad_##from[(to) - (from)]
119
120/* Hints to compiler about hot/cold code. */
121#define PREDICT_FALSE(x) __builtin_expect((x),0)
122#define PREDICT_TRUE(x) __builtin_expect((x),1)
123
Benoît Gannedc812d92019-12-16 10:42:25 +0100124/*
125 * Compiler barrier
126 * prevent compiler to reorder memory access accross this boundary
127 * prevent compiler to cache values in register (force reload)
128 * Not to be confused with CPU memory barrier below
129 */
130#define CLIB_COMPILER_BARRIER() asm volatile ("":::"memory")
131
Ed Warnickecb9cada2015-12-08 15:45:58 -0700132/* Full memory barrier (read and write). */
133#define CLIB_MEMORY_BARRIER() __sync_synchronize ()
134
Damjan Marioneaabe072017-03-22 10:18:13 +0100135#if __x86_64__
136#define CLIB_MEMORY_STORE_BARRIER() __builtin_ia32_sfence ()
137#else
138#define CLIB_MEMORY_STORE_BARRIER() __sync_synchronize ()
139#endif
140
Ed Warnickecb9cada2015-12-08 15:45:58 -0700141/* Arranges for function to be called before main. */
142#define INIT_FUNCTION(decl) \
143 decl __attribute ((constructor)); \
144 decl
145
146/* Arranges for function to be called before exit. */
147#define EXIT_FUNCTION(decl) \
148 decl __attribute ((destructor)); \
149 decl
150
151/* Use __builtin_clz if available. */
Ed Warnickecb9cada2015-12-08 15:45:58 -0700152#if uword_bits == 64
Damjan Marion11056002018-05-10 13:40:44 +0200153#define count_leading_zeros(x) __builtin_clzll (x)
154#define count_trailing_zeros(x) __builtin_ctzll (x)
Ed Warnickecb9cada2015-12-08 15:45:58 -0700155#else
Damjan Marion11056002018-05-10 13:40:44 +0200156#define count_leading_zeros(x) __builtin_clzl (x)
157#define count_trailing_zeros(x) __builtin_ctzl (x)
Ed Warnickecb9cada2015-12-08 15:45:58 -0700158#endif
Ed Warnickecb9cada2015-12-08 15:45:58 -0700159
160#if defined (count_leading_zeros)
Dave Barachc3799992016-08-15 11:12:27 -0400161always_inline uword
Damjan Marione21a0b22021-04-25 10:58:07 +0200162clear_lowest_set_bit (uword x)
163{
164#ifdef __BMI2__
165 return _blsr_u64 (x);
166#else
167 return x ^ (1ULL << count_trailing_zeros (x));
168#endif
169}
170
171always_inline uword
Dave Barachc3799992016-08-15 11:12:27 -0400172min_log2 (uword x)
Ed Warnickecb9cada2015-12-08 15:45:58 -0700173{
174 uword n;
Damjan Marion11056002018-05-10 13:40:44 +0200175 n = count_leading_zeros (x);
Ed Warnickecb9cada2015-12-08 15:45:58 -0700176 return BITS (uword) - n - 1;
177}
178#else
Dave Barachc3799992016-08-15 11:12:27 -0400179always_inline uword
180min_log2 (uword x)
Ed Warnickecb9cada2015-12-08 15:45:58 -0700181{
Dave Barachc3799992016-08-15 11:12:27 -0400182 uword a = x, b = BITS (uword) / 2, c = 0, r = 0;
Ed Warnickecb9cada2015-12-08 15:45:58 -0700183
184 /* Reduce x to 4 bit result. */
185#define _ \
186{ \
187 c = a >> b; \
188 if (c) a = c; \
189 if (c) r += b; \
190 b /= 2; \
191}
192
Dave Barachc3799992016-08-15 11:12:27 -0400193 if (BITS (uword) > 32)
194 _;
195 _;
196 _;
197 _;
Ed Warnickecb9cada2015-12-08 15:45:58 -0700198#undef _
199
200 /* Do table lookup on 4 bit partial. */
201 if (BITS (uword) > 32)
202 {
203 const u64 table = 0x3333333322221104LL;
Dave Barachc3799992016-08-15 11:12:27 -0400204 uword t = (table >> (4 * a)) & 0xf;
Ed Warnickecb9cada2015-12-08 15:45:58 -0700205 r = t < 4 ? r + t : ~0;
206 }
207 else
208 {
209 const u32 table = 0x22221104;
Dave Barachc3799992016-08-15 11:12:27 -0400210 uword t = (a & 8) ? 3 : ((table >> (4 * a)) & 0xf);
Ed Warnickecb9cada2015-12-08 15:45:58 -0700211 r = t < 4 ? r + t : ~0;
Dave Barachc3799992016-08-15 11:12:27 -0400212 }
Ed Warnickecb9cada2015-12-08 15:45:58 -0700213
214 return r;
215}
216#endif
217
Dave Barachc3799992016-08-15 11:12:27 -0400218always_inline uword
219max_log2 (uword x)
Ed Warnickecb9cada2015-12-08 15:45:58 -0700220{
221 uword l = min_log2 (x);
222 if (x > ((uword) 1 << l))
223 l++;
224 return l;
225}
226
Dave Barachc3799992016-08-15 11:12:27 -0400227always_inline u64
228min_log2_u64 (u64 x)
Ed Warnickecb9cada2015-12-08 15:45:58 -0700229{
230 if (BITS (uword) == 64)
231 return min_log2 (x);
232 else
233 {
234 uword l, y;
235 y = x;
236 l = 0;
Dave Barachc3799992016-08-15 11:12:27 -0400237 if (y == 0)
238 {
239 l += 32;
240 x >>= 32;
241 }
Ed Warnickecb9cada2015-12-08 15:45:58 -0700242 l += min_log2 (x);
243 return l;
244 }
245}
246
Dave Barachc3799992016-08-15 11:12:27 -0400247always_inline uword
248pow2_mask (uword x)
249{
250 return ((uword) 1 << x) - (uword) 1;
251}
Ed Warnickecb9cada2015-12-08 15:45:58 -0700252
Dave Barachc3799992016-08-15 11:12:27 -0400253always_inline uword
254max_pow2 (uword x)
Ed Warnickecb9cada2015-12-08 15:45:58 -0700255{
256 word y = (word) 1 << min_log2 (x);
Dave Barachc3799992016-08-15 11:12:27 -0400257 if (x > y)
258 y *= 2;
Ed Warnickecb9cada2015-12-08 15:45:58 -0700259 return y;
260}
261
Dave Barachc3799992016-08-15 11:12:27 -0400262always_inline uword
263is_pow2 (uword x)
Ed Warnickecb9cada2015-12-08 15:45:58 -0700264{
Dave Barachc3799992016-08-15 11:12:27 -0400265 return 0 == (x & (x - 1));
Ed Warnickecb9cada2015-12-08 15:45:58 -0700266}
267
Dave Barachc3799992016-08-15 11:12:27 -0400268always_inline uword
Ryujiro Shibuyacc108562020-06-24 08:36:14 +0100269round_down_pow2 (uword x, uword pow2)
270{
271 return (x) & ~(pow2 - 1);
272}
273
274always_inline uword
Dave Barachc3799992016-08-15 11:12:27 -0400275round_pow2 (uword x, uword pow2)
Ed Warnickecb9cada2015-12-08 15:45:58 -0700276{
Dave Barachc3799992016-08-15 11:12:27 -0400277 return (x + pow2 - 1) & ~(pow2 - 1);
Ed Warnickecb9cada2015-12-08 15:45:58 -0700278}
279
Dave Barachc3799992016-08-15 11:12:27 -0400280always_inline u64
281round_pow2_u64 (u64 x, u64 pow2)
282{
283 return (x + pow2 - 1) & ~(pow2 - 1);
284}
Ed Warnickecb9cada2015-12-08 15:45:58 -0700285
Dave Barachc3799992016-08-15 11:12:27 -0400286always_inline uword
287first_set (uword x)
288{
289 return x & -x;
290}
291
292always_inline uword
293log2_first_set (uword x)
Ed Warnickecb9cada2015-12-08 15:45:58 -0700294{
295 uword result;
296#ifdef count_trailing_zeros
Damjan Marion11056002018-05-10 13:40:44 +0200297 result = count_trailing_zeros (x);
Ed Warnickecb9cada2015-12-08 15:45:58 -0700298#else
299 result = min_log2 (first_set (x));
300#endif
301 return result;
302}
303
Dave Barachc3799992016-08-15 11:12:27 -0400304always_inline f64
305flt_round_down (f64 x)
306{
307 return (int) x;
308}
Ed Warnickecb9cada2015-12-08 15:45:58 -0700309
Dave Barachc3799992016-08-15 11:12:27 -0400310always_inline word
311flt_round_nearest (f64 x)
312{
313 return (word) (x + .5);
314}
Ed Warnickecb9cada2015-12-08 15:45:58 -0700315
Dave Barachc3799992016-08-15 11:12:27 -0400316always_inline f64
317flt_round_to_multiple (f64 x, f64 f)
318{
319 return f * flt_round_nearest (x / f);
320}
Ed Warnickecb9cada2015-12-08 15:45:58 -0700321
Damjan Marion68e5fd52020-04-23 13:41:47 +0200322always_inline uword
323extract_bits (uword x, int start, int count)
324{
325#ifdef __BMI__
326 return _bextr_u64 (x, start, count);
327#endif
328 return (x >> start) & pow2_mask (count);
329}
330
Ed Warnickecb9cada2015-12-08 15:45:58 -0700331#define clib_max(x,y) \
332({ \
333 __typeof__ (x) _x = (x); \
334 __typeof__ (y) _y = (y); \
335 _x > _y ? _x : _y; \
336})
337
338#define clib_min(x,y) \
339({ \
340 __typeof__ (x) _x = (x); \
341 __typeof__ (y) _y = (y); \
342 _x < _y ? _x : _y; \
343})
344
Florin Coras7808df22020-11-02 18:00:32 -0800345#define clib_clamp(x,lo,hi) \
346({ \
347 __typeof__ (x) _x = (x); \
348 __typeof__ (lo) _lo = (lo); \
349 __typeof__ (hi) _hi = (hi); \
350 _x < _lo ? _lo : (_x > _hi ? _hi : _x); \
351})
352
Ed Warnickecb9cada2015-12-08 15:45:58 -0700353#define clib_abs(x) \
354({ \
355 __typeof__ (x) _x = (x); \
356 _x < 0 ? -_x : _x; \
357})
358
359/* Standard standalone-only function declarations. */
360#ifndef CLIB_UNIX
Dave Barachc3799992016-08-15 11:12:27 -0400361void clib_standalone_init (void *memory, uword memory_bytes);
Ed Warnickecb9cada2015-12-08 15:45:58 -0700362
Dave Barachc3799992016-08-15 11:12:27 -0400363void qsort (void *base, uword n, uword size,
364 int (*)(const void *, const void *));
Ed Warnickecb9cada2015-12-08 15:45:58 -0700365#endif
366
367/* Stack backtrace. */
368uword
Dave Barachc3799992016-08-15 11:12:27 -0400369clib_backtrace (uword * callers, uword max_callers, uword n_frames_to_skip);
Ed Warnickecb9cada2015-12-08 15:45:58 -0700370
371#endif /* included_clib_h */
Dave Barachc3799992016-08-15 11:12:27 -0400372
373/*
374 * fd.io coding-style-patch-verification: ON
375 *
376 * Local Variables:
377 * eval: (c-set-style "gnu")
378 * End:
379 */