blob: 9474350c6da198b6c20265958d8483e857ec7507 [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
162min_log2 (uword x)
Ed Warnickecb9cada2015-12-08 15:45:58 -0700163{
164 uword n;
Damjan Marion11056002018-05-10 13:40:44 +0200165 n = count_leading_zeros (x);
Ed Warnickecb9cada2015-12-08 15:45:58 -0700166 return BITS (uword) - n - 1;
167}
168#else
Dave Barachc3799992016-08-15 11:12:27 -0400169always_inline uword
170min_log2 (uword x)
Ed Warnickecb9cada2015-12-08 15:45:58 -0700171{
Dave Barachc3799992016-08-15 11:12:27 -0400172 uword a = x, b = BITS (uword) / 2, c = 0, r = 0;
Ed Warnickecb9cada2015-12-08 15:45:58 -0700173
174 /* Reduce x to 4 bit result. */
175#define _ \
176{ \
177 c = a >> b; \
178 if (c) a = c; \
179 if (c) r += b; \
180 b /= 2; \
181}
182
Dave Barachc3799992016-08-15 11:12:27 -0400183 if (BITS (uword) > 32)
184 _;
185 _;
186 _;
187 _;
Ed Warnickecb9cada2015-12-08 15:45:58 -0700188#undef _
189
190 /* Do table lookup on 4 bit partial. */
191 if (BITS (uword) > 32)
192 {
193 const u64 table = 0x3333333322221104LL;
Dave Barachc3799992016-08-15 11:12:27 -0400194 uword t = (table >> (4 * a)) & 0xf;
Ed Warnickecb9cada2015-12-08 15:45:58 -0700195 r = t < 4 ? r + t : ~0;
196 }
197 else
198 {
199 const u32 table = 0x22221104;
Dave Barachc3799992016-08-15 11:12:27 -0400200 uword t = (a & 8) ? 3 : ((table >> (4 * a)) & 0xf);
Ed Warnickecb9cada2015-12-08 15:45:58 -0700201 r = t < 4 ? r + t : ~0;
Dave Barachc3799992016-08-15 11:12:27 -0400202 }
Ed Warnickecb9cada2015-12-08 15:45:58 -0700203
204 return r;
205}
206#endif
207
Dave Barachc3799992016-08-15 11:12:27 -0400208always_inline uword
209max_log2 (uword x)
Ed Warnickecb9cada2015-12-08 15:45:58 -0700210{
211 uword l = min_log2 (x);
212 if (x > ((uword) 1 << l))
213 l++;
214 return l;
215}
216
Dave Barachc3799992016-08-15 11:12:27 -0400217always_inline u64
218min_log2_u64 (u64 x)
Ed Warnickecb9cada2015-12-08 15:45:58 -0700219{
220 if (BITS (uword) == 64)
221 return min_log2 (x);
222 else
223 {
224 uword l, y;
225 y = x;
226 l = 0;
Dave Barachc3799992016-08-15 11:12:27 -0400227 if (y == 0)
228 {
229 l += 32;
230 x >>= 32;
231 }
Ed Warnickecb9cada2015-12-08 15:45:58 -0700232 l += min_log2 (x);
233 return l;
234 }
235}
236
Dave Barachc3799992016-08-15 11:12:27 -0400237always_inline uword
238pow2_mask (uword x)
239{
240 return ((uword) 1 << x) - (uword) 1;
241}
Ed Warnickecb9cada2015-12-08 15:45:58 -0700242
Dave Barachc3799992016-08-15 11:12:27 -0400243always_inline uword
244max_pow2 (uword x)
Ed Warnickecb9cada2015-12-08 15:45:58 -0700245{
246 word y = (word) 1 << min_log2 (x);
Dave Barachc3799992016-08-15 11:12:27 -0400247 if (x > y)
248 y *= 2;
Ed Warnickecb9cada2015-12-08 15:45:58 -0700249 return y;
250}
251
Dave Barachc3799992016-08-15 11:12:27 -0400252always_inline uword
253is_pow2 (uword x)
Ed Warnickecb9cada2015-12-08 15:45:58 -0700254{
Dave Barachc3799992016-08-15 11:12:27 -0400255 return 0 == (x & (x - 1));
Ed Warnickecb9cada2015-12-08 15:45:58 -0700256}
257
Dave Barachc3799992016-08-15 11:12:27 -0400258always_inline uword
Ryujiro Shibuyacc108562020-06-24 08:36:14 +0100259round_down_pow2 (uword x, uword pow2)
260{
261 return (x) & ~(pow2 - 1);
262}
263
264always_inline uword
Dave Barachc3799992016-08-15 11:12:27 -0400265round_pow2 (uword x, uword pow2)
Ed Warnickecb9cada2015-12-08 15:45:58 -0700266{
Dave Barachc3799992016-08-15 11:12:27 -0400267 return (x + pow2 - 1) & ~(pow2 - 1);
Ed Warnickecb9cada2015-12-08 15:45:58 -0700268}
269
Dave Barachc3799992016-08-15 11:12:27 -0400270always_inline u64
271round_pow2_u64 (u64 x, u64 pow2)
272{
273 return (x + pow2 - 1) & ~(pow2 - 1);
274}
Ed Warnickecb9cada2015-12-08 15:45:58 -0700275
Dave Barachc3799992016-08-15 11:12:27 -0400276always_inline uword
277first_set (uword x)
278{
279 return x & -x;
280}
281
282always_inline uword
283log2_first_set (uword x)
Ed Warnickecb9cada2015-12-08 15:45:58 -0700284{
285 uword result;
286#ifdef count_trailing_zeros
Damjan Marion11056002018-05-10 13:40:44 +0200287 result = count_trailing_zeros (x);
Ed Warnickecb9cada2015-12-08 15:45:58 -0700288#else
289 result = min_log2 (first_set (x));
290#endif
291 return result;
292}
293
Dave Barachc3799992016-08-15 11:12:27 -0400294always_inline f64
295flt_round_down (f64 x)
296{
297 return (int) x;
298}
Ed Warnickecb9cada2015-12-08 15:45:58 -0700299
Dave Barachc3799992016-08-15 11:12:27 -0400300always_inline word
301flt_round_nearest (f64 x)
302{
303 return (word) (x + .5);
304}
Ed Warnickecb9cada2015-12-08 15:45:58 -0700305
Dave Barachc3799992016-08-15 11:12:27 -0400306always_inline f64
307flt_round_to_multiple (f64 x, f64 f)
308{
309 return f * flt_round_nearest (x / f);
310}
Ed Warnickecb9cada2015-12-08 15:45:58 -0700311
Damjan Marion68e5fd52020-04-23 13:41:47 +0200312always_inline uword
313extract_bits (uword x, int start, int count)
314{
315#ifdef __BMI__
316 return _bextr_u64 (x, start, count);
317#endif
318 return (x >> start) & pow2_mask (count);
319}
320
Ed Warnickecb9cada2015-12-08 15:45:58 -0700321#define clib_max(x,y) \
322({ \
323 __typeof__ (x) _x = (x); \
324 __typeof__ (y) _y = (y); \
325 _x > _y ? _x : _y; \
326})
327
328#define clib_min(x,y) \
329({ \
330 __typeof__ (x) _x = (x); \
331 __typeof__ (y) _y = (y); \
332 _x < _y ? _x : _y; \
333})
334
335#define clib_abs(x) \
336({ \
337 __typeof__ (x) _x = (x); \
338 _x < 0 ? -_x : _x; \
339})
340
341/* Standard standalone-only function declarations. */
342#ifndef CLIB_UNIX
Dave Barachc3799992016-08-15 11:12:27 -0400343void clib_standalone_init (void *memory, uword memory_bytes);
Ed Warnickecb9cada2015-12-08 15:45:58 -0700344
Dave Barachc3799992016-08-15 11:12:27 -0400345void qsort (void *base, uword n, uword size,
346 int (*)(const void *, const void *));
Ed Warnickecb9cada2015-12-08 15:45:58 -0700347#endif
348
349/* Stack backtrace. */
350uword
Dave Barachc3799992016-08-15 11:12:27 -0400351clib_backtrace (uword * callers, uword max_callers, uword n_frames_to_skip);
Ed Warnickecb9cada2015-12-08 15:45:58 -0700352
353#endif /* included_clib_h */
Dave Barachc3799992016-08-15 11:12:27 -0400354
355/*
356 * fd.io coding-style-patch-verification: ON
357 *
358 * Local Variables:
359 * eval: (c-set-style "gnu")
360 * End:
361 */