blob: 95dadd9c09d68c31a5a255a8339c092e03799a63 [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
Damjan Marion5f21e1b2018-08-01 14:38:36 +020041#include <vppinfra/config.h>
42
Ed Warnickecb9cada2015-12-08 15:45:58 -070043/* Standalone means to not assume we are running on a Unix box. */
44#if ! defined (CLIB_STANDALONE) && ! defined (CLIB_LINUX_KERNEL)
45#define CLIB_UNIX
46#endif
47
48#include <vppinfra/types.h>
Sirshak Das2f6d7bb2018-10-03 22:53:51 +000049#include <vppinfra/atomics.h>
Ed Warnickecb9cada2015-12-08 15:45:58 -070050
51/* Global DEBUG flag. Setting this to 1 or 0 turns off
52 ASSERT (see vppinfra/error.h) & other debugging code. */
53#ifndef CLIB_DEBUG
54#define CLIB_DEBUG 0
55#endif
56
57#ifndef NULL
58#define NULL ((void *) 0)
59#endif
60
61#define BITS(x) (8*sizeof(x))
62#define ARRAY_LEN(x) (sizeof (x)/sizeof (x[0]))
63
64#define _STRUCT_FIELD(t,f) (((t *) 0)->f)
65#define STRUCT_OFFSET_OF(t,f) ((uword) & _STRUCT_FIELD (t, f))
66#define STRUCT_BIT_OFFSET_OF(t,f) (BITS(u8) * (uword) & _STRUCT_FIELD (t, f))
67#define STRUCT_SIZE_OF(t,f) (sizeof (_STRUCT_FIELD (t, f)))
68#define STRUCT_BITS_OF(t,f) (BITS (_STRUCT_FIELD (t, f)))
69#define STRUCT_ARRAY_LEN(t,f) ARRAY_LEN (_STRUCT_FIELD (t, f))
Dave Barachdbf19ca2016-03-15 10:21:54 +010070#define STRUCT_MARK(mark) u8 mark[0]
71#define STRUCT_MARK_PTR(v, f) &(v)->f
Ed Warnickecb9cada2015-12-08 15:45:58 -070072
73/* Stride in bytes between struct array elements. */
74#define STRUCT_STRIDE_OF(t,f) \
75 ( ((uword) & (((t *) 0)[1].f)) \
76 - ((uword) & (((t *) 0)[0].f)))
77
78#define STRUCT_OFFSET_OF_VAR(v,f) ((uword) (&(v)->f) - (uword) (v))
79
80/* Used to pack structure elements. */
81#define CLIB_PACKED(x) x __attribute__ ((packed))
Dave Barachc3799992016-08-15 11:12:27 -040082#define CLIB_UNUSED(x) x __attribute__ ((unused))
Ed Warnickecb9cada2015-12-08 15:45:58 -070083
Dave Barachcabbee72017-11-18 08:43:06 -050084/* Make a string from the macro's argument */
85#define CLIB_STRING_MACRO(x) #x
86
Damjan Marion04f3db32017-11-10 21:55:45 +010087#define __clib_unused __attribute__ ((unused))
88#define __clib_weak __attribute__ ((weak))
89#define __clib_packed __attribute__ ((packed))
90#define __clib_constructor __attribute__ ((constructor))
91
Ed Warnickecb9cada2015-12-08 15:45:58 -070092#define never_inline __attribute__ ((__noinline__))
93
94#if CLIB_DEBUG > 0
95#define always_inline static inline
96#define static_always_inline static inline
97#else
98#define always_inline static inline __attribute__ ((__always_inline__))
99#define static_always_inline static inline __attribute__ ((__always_inline__))
100#endif
101
102
103/* Reserved (unused) structure element with address offset between
104 from and to. */
105#define CLIB_PAD_FROM_TO(from,to) u8 pad_##from[(to) - (from)]
106
107/* Hints to compiler about hot/cold code. */
108#define PREDICT_FALSE(x) __builtin_expect((x),0)
109#define PREDICT_TRUE(x) __builtin_expect((x),1)
110
111/* Full memory barrier (read and write). */
112#define CLIB_MEMORY_BARRIER() __sync_synchronize ()
113
Damjan Marioneaabe072017-03-22 10:18:13 +0100114#if __x86_64__
115#define CLIB_MEMORY_STORE_BARRIER() __builtin_ia32_sfence ()
116#else
117#define CLIB_MEMORY_STORE_BARRIER() __sync_synchronize ()
118#endif
119
Ed Warnickecb9cada2015-12-08 15:45:58 -0700120/* Arranges for function to be called before main. */
121#define INIT_FUNCTION(decl) \
122 decl __attribute ((constructor)); \
123 decl
124
125/* Arranges for function to be called before exit. */
126#define EXIT_FUNCTION(decl) \
127 decl __attribute ((destructor)); \
128 decl
129
130/* Use __builtin_clz if available. */
Ed Warnickecb9cada2015-12-08 15:45:58 -0700131#if uword_bits == 64
Damjan Marion11056002018-05-10 13:40:44 +0200132#define count_leading_zeros(x) __builtin_clzll (x)
133#define count_trailing_zeros(x) __builtin_ctzll (x)
Ed Warnickecb9cada2015-12-08 15:45:58 -0700134#else
Damjan Marion11056002018-05-10 13:40:44 +0200135#define count_leading_zeros(x) __builtin_clzl (x)
136#define count_trailing_zeros(x) __builtin_ctzl (x)
Ed Warnickecb9cada2015-12-08 15:45:58 -0700137#endif
Ed Warnickecb9cada2015-12-08 15:45:58 -0700138
139#if defined (count_leading_zeros)
Dave Barachc3799992016-08-15 11:12:27 -0400140always_inline uword
141min_log2 (uword x)
Ed Warnickecb9cada2015-12-08 15:45:58 -0700142{
143 uword n;
Damjan Marion11056002018-05-10 13:40:44 +0200144 n = count_leading_zeros (x);
Ed Warnickecb9cada2015-12-08 15:45:58 -0700145 return BITS (uword) - n - 1;
146}
147#else
Dave Barachc3799992016-08-15 11:12:27 -0400148always_inline uword
149min_log2 (uword x)
Ed Warnickecb9cada2015-12-08 15:45:58 -0700150{
Dave Barachc3799992016-08-15 11:12:27 -0400151 uword a = x, b = BITS (uword) / 2, c = 0, r = 0;
Ed Warnickecb9cada2015-12-08 15:45:58 -0700152
153 /* Reduce x to 4 bit result. */
154#define _ \
155{ \
156 c = a >> b; \
157 if (c) a = c; \
158 if (c) r += b; \
159 b /= 2; \
160}
161
Dave Barachc3799992016-08-15 11:12:27 -0400162 if (BITS (uword) > 32)
163 _;
164 _;
165 _;
166 _;
Ed Warnickecb9cada2015-12-08 15:45:58 -0700167#undef _
168
169 /* Do table lookup on 4 bit partial. */
170 if (BITS (uword) > 32)
171 {
172 const u64 table = 0x3333333322221104LL;
Dave Barachc3799992016-08-15 11:12:27 -0400173 uword t = (table >> (4 * a)) & 0xf;
Ed Warnickecb9cada2015-12-08 15:45:58 -0700174 r = t < 4 ? r + t : ~0;
175 }
176 else
177 {
178 const u32 table = 0x22221104;
Dave Barachc3799992016-08-15 11:12:27 -0400179 uword t = (a & 8) ? 3 : ((table >> (4 * a)) & 0xf);
Ed Warnickecb9cada2015-12-08 15:45:58 -0700180 r = t < 4 ? r + t : ~0;
Dave Barachc3799992016-08-15 11:12:27 -0400181 }
Ed Warnickecb9cada2015-12-08 15:45:58 -0700182
183 return r;
184}
185#endif
186
Dave Barachc3799992016-08-15 11:12:27 -0400187always_inline uword
188max_log2 (uword x)
Ed Warnickecb9cada2015-12-08 15:45:58 -0700189{
190 uword l = min_log2 (x);
191 if (x > ((uword) 1 << l))
192 l++;
193 return l;
194}
195
Dave Barachc3799992016-08-15 11:12:27 -0400196always_inline u64
197min_log2_u64 (u64 x)
Ed Warnickecb9cada2015-12-08 15:45:58 -0700198{
199 if (BITS (uword) == 64)
200 return min_log2 (x);
201 else
202 {
203 uword l, y;
204 y = x;
205 l = 0;
Dave Barachc3799992016-08-15 11:12:27 -0400206 if (y == 0)
207 {
208 l += 32;
209 x >>= 32;
210 }
Ed Warnickecb9cada2015-12-08 15:45:58 -0700211 l += min_log2 (x);
212 return l;
213 }
214}
215
Dave Barachc3799992016-08-15 11:12:27 -0400216always_inline uword
217pow2_mask (uword x)
218{
219 return ((uword) 1 << x) - (uword) 1;
220}
Ed Warnickecb9cada2015-12-08 15:45:58 -0700221
Dave Barachc3799992016-08-15 11:12:27 -0400222always_inline uword
223max_pow2 (uword x)
Ed Warnickecb9cada2015-12-08 15:45:58 -0700224{
225 word y = (word) 1 << min_log2 (x);
Dave Barachc3799992016-08-15 11:12:27 -0400226 if (x > y)
227 y *= 2;
Ed Warnickecb9cada2015-12-08 15:45:58 -0700228 return y;
229}
230
Dave Barachc3799992016-08-15 11:12:27 -0400231always_inline uword
232is_pow2 (uword x)
Ed Warnickecb9cada2015-12-08 15:45:58 -0700233{
Dave Barachc3799992016-08-15 11:12:27 -0400234 return 0 == (x & (x - 1));
Ed Warnickecb9cada2015-12-08 15:45:58 -0700235}
236
Dave Barachc3799992016-08-15 11:12:27 -0400237always_inline uword
238round_pow2 (uword x, uword pow2)
Ed Warnickecb9cada2015-12-08 15:45:58 -0700239{
Dave Barachc3799992016-08-15 11:12:27 -0400240 return (x + pow2 - 1) & ~(pow2 - 1);
Ed Warnickecb9cada2015-12-08 15:45:58 -0700241}
242
Dave Barachc3799992016-08-15 11:12:27 -0400243always_inline u64
244round_pow2_u64 (u64 x, u64 pow2)
245{
246 return (x + pow2 - 1) & ~(pow2 - 1);
247}
Ed Warnickecb9cada2015-12-08 15:45:58 -0700248
Dave Barachc3799992016-08-15 11:12:27 -0400249always_inline uword
250first_set (uword x)
251{
252 return x & -x;
253}
254
255always_inline uword
256log2_first_set (uword x)
Ed Warnickecb9cada2015-12-08 15:45:58 -0700257{
258 uword result;
259#ifdef count_trailing_zeros
Damjan Marion11056002018-05-10 13:40:44 +0200260 result = count_trailing_zeros (x);
Ed Warnickecb9cada2015-12-08 15:45:58 -0700261#else
262 result = min_log2 (first_set (x));
263#endif
264 return result;
265}
266
Dave Barachc3799992016-08-15 11:12:27 -0400267always_inline f64
268flt_round_down (f64 x)
269{
270 return (int) x;
271}
Ed Warnickecb9cada2015-12-08 15:45:58 -0700272
Dave Barachc3799992016-08-15 11:12:27 -0400273always_inline word
274flt_round_nearest (f64 x)
275{
276 return (word) (x + .5);
277}
Ed Warnickecb9cada2015-12-08 15:45:58 -0700278
Dave Barachc3799992016-08-15 11:12:27 -0400279always_inline f64
280flt_round_to_multiple (f64 x, f64 f)
281{
282 return f * flt_round_nearest (x / f);
283}
Ed Warnickecb9cada2015-12-08 15:45:58 -0700284
285#define clib_max(x,y) \
286({ \
287 __typeof__ (x) _x = (x); \
288 __typeof__ (y) _y = (y); \
289 _x > _y ? _x : _y; \
290})
291
292#define clib_min(x,y) \
293({ \
294 __typeof__ (x) _x = (x); \
295 __typeof__ (y) _y = (y); \
296 _x < _y ? _x : _y; \
297})
298
299#define clib_abs(x) \
300({ \
301 __typeof__ (x) _x = (x); \
302 _x < 0 ? -_x : _x; \
303})
304
305/* Standard standalone-only function declarations. */
306#ifndef CLIB_UNIX
Dave Barachc3799992016-08-15 11:12:27 -0400307void clib_standalone_init (void *memory, uword memory_bytes);
Ed Warnickecb9cada2015-12-08 15:45:58 -0700308
Dave Barachc3799992016-08-15 11:12:27 -0400309void qsort (void *base, uword n, uword size,
310 int (*)(const void *, const void *));
Ed Warnickecb9cada2015-12-08 15:45:58 -0700311#endif
312
313/* Stack backtrace. */
314uword
Dave Barachc3799992016-08-15 11:12:27 -0400315clib_backtrace (uword * callers, uword max_callers, uword n_frames_to_skip);
Ed Warnickecb9cada2015-12-08 15:45:58 -0700316
317#endif /* included_clib_h */
Dave Barachc3799992016-08-15 11:12:27 -0400318
319/*
320 * fd.io coding-style-patch-verification: ON
321 *
322 * Local Variables:
323 * eval: (c-set-style "gnu")
324 * End:
325 */