blob: 6c82f8696531a4b87ef7f5135c89b90dfefa882f [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 Marion04f3db32017-11-10 21:55:45 +0100103
Ed Warnickecb9cada2015-12-08 15:45:58 -0700104#define never_inline __attribute__ ((__noinline__))
105
106#if CLIB_DEBUG > 0
107#define always_inline static inline
108#define static_always_inline static inline
109#else
110#define always_inline static inline __attribute__ ((__always_inline__))
111#define static_always_inline static inline __attribute__ ((__always_inline__))
112#endif
113
114
115/* Reserved (unused) structure element with address offset between
116 from and to. */
117#define CLIB_PAD_FROM_TO(from,to) u8 pad_##from[(to) - (from)]
118
119/* Hints to compiler about hot/cold code. */
120#define PREDICT_FALSE(x) __builtin_expect((x),0)
121#define PREDICT_TRUE(x) __builtin_expect((x),1)
122
Benoît Gannedc812d92019-12-16 10:42:25 +0100123/*
124 * Compiler barrier
125 * prevent compiler to reorder memory access accross this boundary
126 * prevent compiler to cache values in register (force reload)
127 * Not to be confused with CPU memory barrier below
128 */
129#define CLIB_COMPILER_BARRIER() asm volatile ("":::"memory")
130
Ed Warnickecb9cada2015-12-08 15:45:58 -0700131/* Full memory barrier (read and write). */
132#define CLIB_MEMORY_BARRIER() __sync_synchronize ()
133
Damjan Marioneaabe072017-03-22 10:18:13 +0100134#if __x86_64__
135#define CLIB_MEMORY_STORE_BARRIER() __builtin_ia32_sfence ()
136#else
137#define CLIB_MEMORY_STORE_BARRIER() __sync_synchronize ()
138#endif
139
Ed Warnickecb9cada2015-12-08 15:45:58 -0700140/* Arranges for function to be called before main. */
141#define INIT_FUNCTION(decl) \
142 decl __attribute ((constructor)); \
143 decl
144
145/* Arranges for function to be called before exit. */
146#define EXIT_FUNCTION(decl) \
147 decl __attribute ((destructor)); \
148 decl
149
150/* Use __builtin_clz if available. */
Ed Warnickecb9cada2015-12-08 15:45:58 -0700151#if uword_bits == 64
Damjan Marion11056002018-05-10 13:40:44 +0200152#define count_leading_zeros(x) __builtin_clzll (x)
153#define count_trailing_zeros(x) __builtin_ctzll (x)
Ed Warnickecb9cada2015-12-08 15:45:58 -0700154#else
Damjan Marion11056002018-05-10 13:40:44 +0200155#define count_leading_zeros(x) __builtin_clzl (x)
156#define count_trailing_zeros(x) __builtin_ctzl (x)
Ed Warnickecb9cada2015-12-08 15:45:58 -0700157#endif
Ed Warnickecb9cada2015-12-08 15:45:58 -0700158
159#if defined (count_leading_zeros)
Dave Barachc3799992016-08-15 11:12:27 -0400160always_inline uword
161min_log2 (uword x)
Ed Warnickecb9cada2015-12-08 15:45:58 -0700162{
163 uword n;
Damjan Marion11056002018-05-10 13:40:44 +0200164 n = count_leading_zeros (x);
Ed Warnickecb9cada2015-12-08 15:45:58 -0700165 return BITS (uword) - n - 1;
166}
167#else
Dave Barachc3799992016-08-15 11:12:27 -0400168always_inline uword
169min_log2 (uword x)
Ed Warnickecb9cada2015-12-08 15:45:58 -0700170{
Dave Barachc3799992016-08-15 11:12:27 -0400171 uword a = x, b = BITS (uword) / 2, c = 0, r = 0;
Ed Warnickecb9cada2015-12-08 15:45:58 -0700172
173 /* Reduce x to 4 bit result. */
174#define _ \
175{ \
176 c = a >> b; \
177 if (c) a = c; \
178 if (c) r += b; \
179 b /= 2; \
180}
181
Dave Barachc3799992016-08-15 11:12:27 -0400182 if (BITS (uword) > 32)
183 _;
184 _;
185 _;
186 _;
Ed Warnickecb9cada2015-12-08 15:45:58 -0700187#undef _
188
189 /* Do table lookup on 4 bit partial. */
190 if (BITS (uword) > 32)
191 {
192 const u64 table = 0x3333333322221104LL;
Dave Barachc3799992016-08-15 11:12:27 -0400193 uword t = (table >> (4 * a)) & 0xf;
Ed Warnickecb9cada2015-12-08 15:45:58 -0700194 r = t < 4 ? r + t : ~0;
195 }
196 else
197 {
198 const u32 table = 0x22221104;
Dave Barachc3799992016-08-15 11:12:27 -0400199 uword t = (a & 8) ? 3 : ((table >> (4 * a)) & 0xf);
Ed Warnickecb9cada2015-12-08 15:45:58 -0700200 r = t < 4 ? r + t : ~0;
Dave Barachc3799992016-08-15 11:12:27 -0400201 }
Ed Warnickecb9cada2015-12-08 15:45:58 -0700202
203 return r;
204}
205#endif
206
Dave Barachc3799992016-08-15 11:12:27 -0400207always_inline uword
208max_log2 (uword x)
Ed Warnickecb9cada2015-12-08 15:45:58 -0700209{
210 uword l = min_log2 (x);
211 if (x > ((uword) 1 << l))
212 l++;
213 return l;
214}
215
Dave Barachc3799992016-08-15 11:12:27 -0400216always_inline u64
217min_log2_u64 (u64 x)
Ed Warnickecb9cada2015-12-08 15:45:58 -0700218{
219 if (BITS (uword) == 64)
220 return min_log2 (x);
221 else
222 {
223 uword l, y;
224 y = x;
225 l = 0;
Dave Barachc3799992016-08-15 11:12:27 -0400226 if (y == 0)
227 {
228 l += 32;
229 x >>= 32;
230 }
Ed Warnickecb9cada2015-12-08 15:45:58 -0700231 l += min_log2 (x);
232 return l;
233 }
234}
235
Dave Barachc3799992016-08-15 11:12:27 -0400236always_inline uword
237pow2_mask (uword x)
238{
239 return ((uword) 1 << x) - (uword) 1;
240}
Ed Warnickecb9cada2015-12-08 15:45:58 -0700241
Dave Barachc3799992016-08-15 11:12:27 -0400242always_inline uword
243max_pow2 (uword x)
Ed Warnickecb9cada2015-12-08 15:45:58 -0700244{
245 word y = (word) 1 << min_log2 (x);
Dave Barachc3799992016-08-15 11:12:27 -0400246 if (x > y)
247 y *= 2;
Ed Warnickecb9cada2015-12-08 15:45:58 -0700248 return y;
249}
250
Dave Barachc3799992016-08-15 11:12:27 -0400251always_inline uword
252is_pow2 (uword x)
Ed Warnickecb9cada2015-12-08 15:45:58 -0700253{
Dave Barachc3799992016-08-15 11:12:27 -0400254 return 0 == (x & (x - 1));
Ed Warnickecb9cada2015-12-08 15:45:58 -0700255}
256
Dave Barachc3799992016-08-15 11:12:27 -0400257always_inline uword
Ryujiro Shibuyacc108562020-06-24 08:36:14 +0100258round_down_pow2 (uword x, uword pow2)
259{
260 return (x) & ~(pow2 - 1);
261}
262
263always_inline uword
Dave Barachc3799992016-08-15 11:12:27 -0400264round_pow2 (uword x, uword pow2)
Ed Warnickecb9cada2015-12-08 15:45:58 -0700265{
Dave Barachc3799992016-08-15 11:12:27 -0400266 return (x + pow2 - 1) & ~(pow2 - 1);
Ed Warnickecb9cada2015-12-08 15:45:58 -0700267}
268
Dave Barachc3799992016-08-15 11:12:27 -0400269always_inline u64
270round_pow2_u64 (u64 x, u64 pow2)
271{
272 return (x + pow2 - 1) & ~(pow2 - 1);
273}
Ed Warnickecb9cada2015-12-08 15:45:58 -0700274
Dave Barachc3799992016-08-15 11:12:27 -0400275always_inline uword
276first_set (uword x)
277{
278 return x & -x;
279}
280
281always_inline uword
282log2_first_set (uword x)
Ed Warnickecb9cada2015-12-08 15:45:58 -0700283{
284 uword result;
285#ifdef count_trailing_zeros
Damjan Marion11056002018-05-10 13:40:44 +0200286 result = count_trailing_zeros (x);
Ed Warnickecb9cada2015-12-08 15:45:58 -0700287#else
288 result = min_log2 (first_set (x));
289#endif
290 return result;
291}
292
Dave Barachc3799992016-08-15 11:12:27 -0400293always_inline f64
294flt_round_down (f64 x)
295{
296 return (int) x;
297}
Ed Warnickecb9cada2015-12-08 15:45:58 -0700298
Dave Barachc3799992016-08-15 11:12:27 -0400299always_inline word
300flt_round_nearest (f64 x)
301{
302 return (word) (x + .5);
303}
Ed Warnickecb9cada2015-12-08 15:45:58 -0700304
Dave Barachc3799992016-08-15 11:12:27 -0400305always_inline f64
306flt_round_to_multiple (f64 x, f64 f)
307{
308 return f * flt_round_nearest (x / f);
309}
Ed Warnickecb9cada2015-12-08 15:45:58 -0700310
Damjan Marion68e5fd52020-04-23 13:41:47 +0200311always_inline uword
312extract_bits (uword x, int start, int count)
313{
314#ifdef __BMI__
315 return _bextr_u64 (x, start, count);
316#endif
317 return (x >> start) & pow2_mask (count);
318}
319
Ed Warnickecb9cada2015-12-08 15:45:58 -0700320#define clib_max(x,y) \
321({ \
322 __typeof__ (x) _x = (x); \
323 __typeof__ (y) _y = (y); \
324 _x > _y ? _x : _y; \
325})
326
327#define clib_min(x,y) \
328({ \
329 __typeof__ (x) _x = (x); \
330 __typeof__ (y) _y = (y); \
331 _x < _y ? _x : _y; \
332})
333
334#define clib_abs(x) \
335({ \
336 __typeof__ (x) _x = (x); \
337 _x < 0 ? -_x : _x; \
338})
339
340/* Standard standalone-only function declarations. */
341#ifndef CLIB_UNIX
Dave Barachc3799992016-08-15 11:12:27 -0400342void clib_standalone_init (void *memory, uword memory_bytes);
Ed Warnickecb9cada2015-12-08 15:45:58 -0700343
Dave Barachc3799992016-08-15 11:12:27 -0400344void qsort (void *base, uword n, uword size,
345 int (*)(const void *, const void *));
Ed Warnickecb9cada2015-12-08 15:45:58 -0700346#endif
347
348/* Stack backtrace. */
349uword
Dave Barachc3799992016-08-15 11:12:27 -0400350clib_backtrace (uword * callers, uword max_callers, uword n_frames_to_skip);
Ed Warnickecb9cada2015-12-08 15:45:58 -0700351
352#endif /* included_clib_h */
Dave Barachc3799992016-08-15 11:12:27 -0400353
354/*
355 * fd.io coding-style-patch-verification: ON
356 *
357 * Local Variables:
358 * eval: (c-set-style "gnu")
359 * End:
360 */