Line data Source code
1 : #ifndef HEADER_fd_src_util_fd_util_base_h
2 : #define HEADER_fd_src_util_fd_util_base_h
3 :
4 : /* Base development environment */
5 :
6 : /* Compiler checks ****************************************************/
7 :
8 : #ifdef __cplusplus
9 :
10 : #if __cplusplus<201703L
11 : #error "Firedancer requires C++17 or later"
12 : #endif
13 :
14 : #else
15 :
16 : #if __STDC_VERSION__<201710L
17 : #error "Firedancer requires C Standard version C17 or later"
18 : #endif
19 :
20 : #endif //__cplusplus
21 :
22 : /* Versioning macros **************************************************/
23 :
24 : /* FD_VERSION_{MAJOR,MINOR,PATCH} programmatically specify the
25 : firedancer version. */
26 :
27 0 : #define FD_VERSION_MAJOR (0)
28 0 : #define FD_VERSION_MINOR (0)
29 0 : #define FD_VERSION_PATCH (0)
30 :
31 : /* Build target capabilities ******************************************/
32 :
33 : /* Different build targets often have different levels of support for
34 : various language and hardware features. The presence of various
35 : features can be tested at preprocessor, compile, or run time via the
36 : below capability macros.
37 :
38 : Code that does not exploit any of these capabilities written within
39 : the base development environment should be broadly portable across a
40 : range of build targets ranging from on-chain virtual machines to
41 : commodity hosts to custom hardware.
42 :
43 : As such, highly portable yet high performance code is possible by
44 : writing generic implementations that do not exploit any of the below
45 : capabilities as a portable fallback along with build target specific
46 : optimized implementations that are invoked when the build target
47 : supports the appropriate capabilities.
48 :
49 : The base development itself provide lots of functionality to help
50 : with implementing portable fallbacks while making very minimal
51 : assumptions about the build targets and zero use of 3rd party
52 : libraries (these might make unknown additional assumptions about the
53 : build target, including availability of a quality implementation of
54 : the library on the build target). */
55 :
56 : /* FD_HAS_HOSTED: If the build target is hosted (e.g. resides on a host
57 : with a POSIX-ish environment ... practically speaking, stdio.h,
58 : stdlib.h, unistd.h, et al more or less behave normally ...
59 : pedantically XOPEN_SOURCE=700), FD_HAS_HOSTED will be 1. It will be
60 : zero otherwise. */
61 :
62 : #ifndef FD_HAS_HOSTED
63 : #define FD_HAS_HOSTED 0
64 : #endif
65 :
66 : /* FD_HAS_ATOMIC: If the build target supports atomic operations
67 : between threads accessing a common memory region (include threads
68 : that reside in different processes on a host communicating via a
69 : shared memory region with potentially different local virtual
70 : mappings). Practically speaking, does atomic compare-and-swap et al
71 : work? */
72 :
73 : #ifndef FD_HAS_ATOMIC
74 : #define FD_HAS_ATOMIC 0
75 : #endif
76 :
77 : /* FD_HAS_THREADS: If the build target supports a POSIX-ish notion of
78 : threads (e.g. practically speaking, global variables declared within
79 : a compile unit are visible to more than one thread of execution,
80 : pthreads.h / threading parts of C standard, the atomics parts of the
81 : C standard, ... more or less work normally), FD_HAS_THREADS will be
82 : 1. It will be zero otherwise. FD_HAS_THREADS implies FD_HAS_HOSTED
83 : and FD_HAS_ATOMIC. */
84 :
85 : #ifndef FD_HAS_THREADS
86 : #define FD_HAS_THREADS 0
87 : #endif
88 :
89 : /* FD_HAS_INT128: If the build target supports reasonably efficient
90 : 128-bit wide integer operations, define FD_HAS_INT128 to 1 to enable
91 : use of them in implementations. */
92 :
93 : #ifndef FD_HAS_INT128
94 : #define FD_HAS_INT128 0
95 : #endif
96 :
97 : /* FD_HAS_DOUBLE: If the build target supports reasonably efficient
98 : IEEE 754 64-bit wide double precision floating point options, define
99 : FD_HAS_DOUBLE to 1 to enable use of them in implementations. Note
100 : that even if the build target does not, va_args handling in the C /
101 : C++ language requires promotion of a float in an va_arg list to a
102 : double. Thus, C / C++ language that support IEEE 754 float also
103 : implies a minimum level of support for double (though not necessarily
104 : efficient or IEEE 754). That is, even if a target does not have
105 : FD_HAS_DOUBLE, there might still be limited use of double in va_arg
106 : list handling. */
107 :
108 : #ifndef FD_HAS_DOUBLE
109 : #define FD_HAS_DOUBLE 0
110 : #endif
111 :
112 : /* FD_HAS_ALLOCA: If the build target supports fast alloca-style
113 : dynamic stack memory allocation (e.g. alloca.h / __builtin_alloca
114 : more or less work normally), define FD_HAS_ALLOCA to 1 to enable use
115 : of it in implementations. */
116 :
117 : #ifndef FD_HAS_ALLOCA
118 : #define FD_HAS_ALLOCA 0
119 : #endif
120 :
121 : /* FD_HAS_X86: If the build target supports x86 specific features and
122 : can benefit from x86 specific optimizations, define FD_HAS_X86. Code
123 : needing more specific target features (Intel / AMD / SSE / AVX2 /
124 : AVX512 / etc) can specialize further as necessary with even more
125 : precise capabilities (that in turn imply FD_HAS_X86). */
126 :
127 : #ifndef FD_HAS_X86
128 : #define FD_HAS_X86 0
129 : #endif
130 :
131 : /* These allow even more precise targeting for X86. */
132 :
133 : /* FD_HAS_SSE indicates the target supports Intel SSE4 style SIMD
134 : (basically do the 128-bit wide parts of "x86intrin.h" work).
135 : Recommend using the simd/fd_sse.h APIs instead of raw Intel
136 : intrinsics for readability and to facilitate portability to non-x86
137 : platforms. Implies FD_HAS_X86. */
138 :
139 : #ifndef FD_HAS_SSE
140 : #define FD_HAS_SSE 0
141 : #endif
142 :
143 : /* FD_HAS_AVX indicates the target supports Intel AVX2 style SIMD
144 : (basically do the 256-bit wide parts of "x86intrin.h" work).
145 : Recommend using the simd/fd_avx.h APIs instead of raw Intel
146 : intrinsics for readability and to facilitate portability to non-x86
147 : platforms. Implies FD_HAS_SSE. */
148 :
149 : #ifndef FD_HAS_AVX
150 : #define FD_HAS_AVX 0
151 : #endif
152 :
153 : /* FD_HAS_AVX512 indicates the target supports Intel AVX-512 style SIMD
154 : (basically do the 512-bit wide parts of "x86intrin.h" work).
155 : Recommend using the simd/fd_avx512.h APIs instead of raw Intel
156 : intrinsics for readability and to facilitate portability to non-x86
157 : platforms. Implies FD_HAS_AVX. */
158 :
159 : #ifndef FD_HAS_AVX512
160 : #define FD_HAS_AVX512 0
161 : #endif
162 :
163 : /* FD_HAS_SHANI indicates that the target supports Intel SHA extensions
164 : which accelerate SHA-1 and SHA-256 computation. This extension is
165 : also called SHA-NI or SHA_NI (Secure Hash Algorithm New
166 : Instructions). Although proposed in 2013, they're only supported on
167 : Intel Ice Lake and AMD Zen CPUs and newer. Implies FD_HAS_AVX. */
168 :
169 : #ifndef FD_HAS_SHANI
170 : #define FD_HAS_SHANI 0
171 : #endif
172 :
173 : /* FD_HAS_GFNI indicates that the target supports Intel Galois Field
174 : extensions, which accelerate operations over binary extension fields,
175 : especially GF(2^8). These instructions are supported on Intel Ice
176 : Lake and newer and AMD Zen4 and newer CPUs. Implies FD_HAS_AVX. */
177 :
178 : #ifndef FD_HAS_GFNI
179 : #define FD_HAS_GFNI 0
180 : #endif
181 :
182 : /* FD_HAS_AESNI indicates that the target supports AES-NI extensions,
183 : which accelerate AES encryption and decryption. While AVX predates
184 : the original AES-NI extension, the combination of AES-NI+AVX adds
185 : additional opcodes (such as vaesenc, a more flexible variant of
186 : aesenc). Thus, implies FD_HAS_AVX. A conservative estimate for
187 : minimum platform support is Intel Haswell or AMD Zen. */
188 :
189 : #ifndef FD_HAS_AESNI
190 : #define FD_HAS_AESNI 0
191 : #endif
192 :
193 : /* FD_HAS_LZ4 indicates that the target supports LZ4 compression.
194 : Roughly, does "#include <lz4.h>" and the APIs therein work? */
195 :
196 : #ifndef FD_HAS_LZ4
197 : #define FD_HAS_LZ4 0
198 : #endif
199 :
200 : /* FD_HAS_ZSTD indicates that the target supports ZSTD compression.
201 : Roughly, does "#include <zstd.h>" and the APIs therein work? */
202 :
203 : #ifndef FD_HAS_ZSTD
204 : #define FD_HAS_ZSTD 0
205 : #endif
206 :
207 : /* FD_HAS_COVERAGE indicates that the build target is built with coverage instrumentation. */
208 :
209 : #ifndef FD_HAS_COVERAGE
210 : #define FD_HAS_COVERAGE 0
211 : #endif
212 :
213 : /* FD_HAS_ASAN indicates that the build target is using ASAN. */
214 :
215 : #ifndef FD_HAS_ASAN
216 : #define FD_HAS_ASAN 0
217 : #endif
218 :
219 : /* FD_HAS_UBSAN indicates that the build target is using UBSAN. */
220 :
221 : #ifndef FD_HAS_UBSAN
222 : #define FD_HAS_UBSAN 0
223 : #endif
224 :
225 : /* FD_HAS_DEEPASAN indicates that the build target is using ASAN with manual
226 : memory poisoning for fd_alloc, fd_wksp, and fd_scratch. */
227 :
228 : #ifndef FD_HAS_DEEPASAN
229 : #define FD_HAS_DEEPASAN 0
230 : #endif
231 :
232 : /* Base development environment ***************************************/
233 :
234 : /* The functionality provided by these vanilla headers are always
235 : available within the base development environment. Notably, stdio.h
236 : / stdlib.h / et al at are not included here as these make lots of
237 : assumptions about the build target that may not be true (especially
238 : for on-chain and custom hardware use). Code should prefer the fd
239 : util equivalents for such functionality when possible. */
240 :
241 : #include <stdalign.h>
242 : #include <string.h>
243 : #include <limits.h>
244 : #include <float.h>
245 :
246 : /* Work around some library naming irregularities */
247 : /* FIXME: Consider this for FLOAT/FLT, DOUBLE/DBL too? */
248 :
249 3 : #define SHORT_MIN SHRT_MIN
250 3 : #define SHORT_MAX SHRT_MAX
251 777916290 : #define USHORT_MAX USHRT_MAX
252 :
253 : /* Primitive types ****************************************************/
254 :
255 : /* These typedefs provide single token regularized names for all the
256 : primitive types in the base development environment:
257 :
258 : char !
259 : schar ! short int long int128 !!
260 : uchar ushort uint ulong uint128 !!
261 : float
262 : double !!!
263 :
264 : ! Does not assume the sign of char. A naked char should be treated
265 : as cstr character and mathematical operations should be avoided on
266 : them. This is less than ideal as the patterns for integer types in
267 : the C/C++ language spec itself are far more consistent with a naked
268 : char naturally being treated as signed (see above). But there are
269 : lots of conflicts between architectures, languages and standard
270 : libraries about this so any use of a naked char shouldn't assume
271 : the sign ... sigh.
272 :
273 : !! Only available if FD_HAS_INT128 is defined
274 :
275 : !!! Should only used if FD_HAS_DOUBLE is defined but see note in
276 : FD_HAS_DOUBLE about C/C++ silent promotions of float to double in
277 : va_arg lists.
278 :
279 : Note also that these token names more naturally interoperate with
280 : integer constant declarations, type generic code generation
281 : techniques, with printf-style format strings than the stdint.h /
282 : inttypes.h handling.
283 :
284 : To minimize portability issues, unexpected silent type conversion
285 : issues, align with typical developer implicit usage, align with
286 : typical build target usage, ..., assumes char / short / int / long
287 : are 8 / 16 / 32 / 64 twos complement integers and float is IEEE-754
288 : single precision. Further assumes little endian, truncating signed
289 : integer division, sign extending (arithmetic) signed right shift and
290 : signed left shift behaves the same as an unsigned left shift from bit
291 : operations point of view (technically the standard says signed left
292 : shift is undefined if the result would overflow). Also, except for
293 : int128/uint128, assumes that aligned access to these will be
294 : naturally atomic. Lastly assumes that unaligned access to these is
295 : functionally valid but does not assume that unaligned access to these
296 : is efficient or atomic.
297 :
298 : For values meant to be held in registers, code should prefer long /
299 : ulong types (improves asm generation given the prevalence of 64-bit
300 : targets and also to avoid lots of tricky bugs with silent promotions
301 : in the language ... e.g. ushort should ideally only be used for
302 : in-memory representations).
303 :
304 : These are currently not prefixed given how often they are used. If
305 : this becomes problematic prefixes can be added as necessary.
306 : Specifically, C++ allows typedefs to be defined multiple times so
307 : long as they are equivalent. Inequivalent collisions are not
308 : supported but should be rare (e.g. if a 3rd party header thinks
309 : "ulong" should be something other an "unsigned long", the 3rd party
310 : header probably should be nuked from orbit). C11 and forward also
311 : allow multiple equivalent typedefs. C99 and earlier don't but this
312 : is typically only a warning and then only if pedantic warnings are
313 : enabled. Thus, if we want to support users using C99 and earlier who
314 : want to do a strict compile and have a superfluous collision with
315 : these types in other libraries, uncomment the below (or do something
316 : equivalent for the compiler). */
317 :
318 : //#pragma GCC diagnostic push
319 : //#pragma GCC diagnostic ignored "-Wpedantic"
320 :
321 : typedef signed char schar; /* See above note of sadness */
322 :
323 : typedef unsigned char uchar;
324 : typedef unsigned short ushort;
325 : typedef unsigned int uint;
326 : typedef unsigned long ulong;
327 :
328 : #if FD_HAS_INT128
329 :
330 : __extension__ typedef __int128 int128;
331 : __extension__ typedef unsigned __int128 uint128;
332 :
333 1200000045 : #define UINT128_MAX (~(uint128)0)
334 6 : #define INT128_MAX ((int128)(UINT128_MAX>>1))
335 3 : #define INT128_MIN (-INT128_MAX-(int128)1)
336 :
337 : #endif
338 :
339 : //#pragma GCC diagnostic pop
340 :
341 : /* Compiler tricks ****************************************************/
342 :
343 : /* FD_STRINGIFY,FD_CONCAT{2,3,4}: Various macros for token
344 : stringification and pasting. FD_STRINGIFY returns the argument as a
345 : cstr (e.g. FD_STRINGIFY(foo) -> "foo"). FD_CONCAT* pastes the tokens
346 : together into a single token (e.g. FD_CONCAT3(a,b,c) -> abc). The
347 : EXPAND variants first expand their arguments and then do the token
348 : operation (e.g. FD_EXPAND_THEN_STRINGIFY(__LINE__) -> "104" if done
349 : on line 104 of the source code file). */
350 :
351 : #define FD_STRINGIFY(x)#x
352 4505100 : #define FD_CONCAT2(a,b)a##b
353 17118 : #define FD_CONCAT3(a,b,c)a##b##c
354 4662432 : #define FD_CONCAT4(a,b,c,d)a##b##c##d
355 :
356 : #define FD_EXPAND_THEN_STRINGIFY(x)FD_STRINGIFY(x)
357 4505100 : #define FD_EXPAND_THEN_CONCAT2(a,b)FD_CONCAT2(a,b)
358 >25980*10^7 : #define FD_EXPAND_THEN_CONCAT3(a,b,c)FD_CONCAT3(a,b,c)
359 4662432 : #define FD_EXPAND_THEN_CONCAT4(a,b,c,d)FD_CONCAT4(a,b,c,d)
360 :
361 : /* FD_VA_ARGS_SELECT(__VA_ARGS__,e32,e31,...e1): Macro that expands to
362 : en at compile time where n is number of items in the __VA_ARGS__
363 : list. If __VA_ARGS__ is empty, returns e1. Assumes __VA_ARGS__ has
364 : at most 32 arguments. Useful for making a variadic macro whose
365 : behavior depends on the number of arguments in __VA_ARGS__. */
366 :
367 : #define FD_VA_ARGS_SELECT(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,a,b,c,d,e,f,_,...)_
368 :
369 : /* FD_SRC_LOCATION returns a const cstr holding the line of code where
370 : FD_SRC_LOCATION was used. */
371 :
372 : #define FD_SRC_LOCATION __FILE__ "(" FD_EXPAND_THEN_STRINGIFY(__LINE__) ")"
373 :
374 : /* FD_STATIC_ASSERT tests at compile time if c is non-zero. If not,
375 : it aborts the compile with an error. err itself should be a token
376 : (e.g. not a string, no whitespace, etc). */
377 :
378 : #ifdef __cplusplus
379 : #define FD_STATIC_ASSERT(c,err) static_assert(c, #err)
380 : #else
381 17668 : #define FD_STATIC_ASSERT(c,err) _Static_assert(c, #err)
382 : #endif
383 :
384 : /* FD_ADDRESS_OF_PACKED_MEMBER(x): Linguistically does &(x) but without
385 : recent compiler complaints that &x might be unaligned if x is a
386 : member of a packed datastructure. (Often needed for interfacing with
387 : hardware / packets / etc.) */
388 :
389 3 : #define FD_ADDRESS_OF_PACKED_MEMBER( x ) (__extension__({ \
390 3 : char * _fd_aopm = (char *)&(x); \
391 3 : __asm__( "# FD_ADDRESS_OF_PACKED_MEMBER(" #x ") @" FD_SRC_LOCATION : "+r" (_fd_aopm) :: ); \
392 3 : (__typeof__(&(x)))_fd_aopm; \
393 3 : }))
394 :
395 : /* FD_PROTOTYPES_{BEGIN,END}: Headers that might be included in C++
396 : source should encapsulate the prototypes of code and globals
397 : contained in compilation units compiled as C with a
398 : FD_PROTOTYPE_{BEGIN,END} pair. */
399 :
400 : #ifdef __cplusplus
401 : #define FD_PROTOTYPES_BEGIN extern "C" {
402 : #else
403 : #define FD_PROTOTYPES_BEGIN
404 : #endif
405 :
406 : #ifdef __cplusplus
407 : #define FD_PROTOTYPES_END }
408 : #else
409 : #define FD_PROTOTYPES_END
410 : #endif
411 :
412 : /* FD_ASM_LG_ALIGN(lg_n) expands to an alignment assembler directive
413 : appropriate for the current architecture/ABI. The resulting align
414 : is 2^(lg_n) bytes, i.e. FD_ASM_LG_ALIGN(3) aligns by 8 bytes. */
415 :
416 : #if defined(__aarch64__)
417 : #define FD_ASM_LG_ALIGN(lg_n) ".align " #lg_n "\n"
418 : #elif defined(__x86_64__) || defined(__powerpc64__)
419 : #define FD_ASM_LG_ALIGN(lg_n) ".p2align " #lg_n "\n"
420 : #endif
421 :
422 : /* FD_IMPORT declares a variable name and initializes with the contents
423 : of the file at path (with potentially some assembly directives for
424 : additional footer info). It is equivalent to:
425 :
426 : type const name[] __attribute__((aligned(align))) = {
427 :
428 : ... code that would initialize the contents of name to the
429 : ... raw binary data found in the file at path at compile time
430 : ... (with any appended information as specified by footer)
431 :
432 : };
433 :
434 : ulong const name_sz = ... number of bytes pointed to by name;
435 :
436 : More precisely, this creates a symbol "name" in the object file that
437 : points to a read-only copy of the raw data in the file at "path" as
438 : it was at compile time. 2^lg_align specifies the minimum alignment
439 : required for the copy's first byte as an unsuffixed decimal integer.
440 : footer are assembly commands to permit additional data to be appended
441 : to the copy (use "" for footer if no footer is necessary).
442 :
443 : Then it exposes a pointer to this copy in the current compilation
444 : unit as name and the byte size as name_sz. name_sz covers the first
445 : byte of the included data to the last byte of the footer inclusive.
446 :
447 : The dummy linker symbol _fd_import_name_sz will also be created in
448 : the object file as some under the hood magic to make this work. This
449 : should not be used in any compile unit as some compilers (I'm looking
450 : at you clang-15, but apparently not clang-10) will sometimes mangle
451 : its value from what it was set to in the object file even marked as
452 : absolute in the object file.
453 :
454 : This should only be used at global scope and should be done at most
455 : once over all object files / libraries used to make a program. If
456 : other compilation units want to make use of an import in a different
457 : compilation unit, they should declare:
458 :
459 : extern type const name[] __attribute__((aligned(align)));
460 :
461 : and/or:
462 :
463 : extern ulong const name_sz;
464 :
465 : as necessary (that is, do the usual to use name and name_sz as shown
466 : for the pseudo code above).
467 :
468 : Important safety tip! gcc -M will generally not detect the
469 : dependency this creates between the importing file and the imported
470 : file. This can cause incremental builds to miss changes to the
471 : imported file. Ideally, we would have FD_IMPORT automatically do
472 : something like:
473 :
474 : _Pragma( "GCC dependency \"" path "\" )
475 :
476 : This doesn't work as is because _Pragma needs some macro expansion
477 : hacks to accept this (this is doable). After that workaround, this
478 : still doesn't work because, due to tooling limitations, the pragma
479 : path is relative to the source file directory and the FD_IMPORT path
480 : is relative to the the make directory (working around this would
481 : require a __FILE__-like directive for the source code directory base
482 : path). Even if that did exist, it might still not work because
483 : out-of-tree builds often require some substitutions to the gcc -M
484 : generated dependencies that this might not pick up (at least not
485 : without some build system surgery). And then it still wouldn't work
486 : because gcc -M seems to ignore all of this anyways (which is the
487 : actual show stopper as this pragma does something subtly different
488 : than what the name suggests and there isn't any obvious support for a
489 : "pseudo-include".) Another reminder that make clean and fast builds
490 : are our friend. */
491 :
492 : #if defined(__ELF__)
493 :
494 : #define FD_IMPORT( name, path, type, lg_align, footer ) \
495 : __asm__( ".section .rodata,\"a\",@progbits\n" \
496 : ".type " #name ",@object\n" \
497 : ".globl " #name "\n" \
498 : FD_ASM_LG_ALIGN(lg_align) \
499 : #name ":\n" \
500 : ".incbin \"" path "\"\n" \
501 : footer "\n" \
502 : ".size " #name ",. - " #name "\n" \
503 : "_fd_import_" #name "_sz = . - " #name "\n" \
504 : ".type " #name "_sz,@object\n" \
505 : ".globl " #name "_sz\n" \
506 : FD_ASM_LG_ALIGN(3) \
507 : #name "_sz:\n" \
508 : ".quad _fd_import_" #name "_sz\n" \
509 : ".size " #name "_sz,8\n" \
510 : ".previous\n" ); \
511 : extern type const name[] __attribute__((aligned(1<<(lg_align)))); \
512 : extern ulong const name##_sz
513 :
514 : #elif defined(__MACH__)
515 :
516 : #define FD_IMPORT( name, path, type, lg_align, footer ) \
517 : __asm__( ".section __DATA,__const\n" \
518 : ".globl _" #name "\n" \
519 : FD_ASM_LG_ALIGN(lg_align) \
520 : "_" #name ":\n" \
521 : ".incbin \"" path "\"\n" \
522 : footer "\n" \
523 : "_fd_import_" #name "_sz = . - _" #name "\n" \
524 : ".globl _" #name "_sz\n" \
525 : FD_ASM_LG_ALIGN(3) \
526 : "_" #name "_sz:\n" \
527 : ".quad _fd_import_" #name "_sz\n" \
528 : ".previous\n" ); \
529 : extern type const name[] __attribute__((aligned(1<<(lg_align)))); \
530 : extern ulong const name##_sz
531 :
532 : #endif
533 :
534 : /* FD_IMPORT_{BINARY,CSTR} are common cases for FD_IMPORT.
535 :
536 : In BINARY, the file is imported into the object file and exposed to
537 : the caller as a uchar binary data. name_sz will be the number of
538 : bytes in the file at time of import. name will have 128 byte
539 : alignment.
540 :
541 : In CSTR, the file is imported into the object caller with a '\0'
542 : termination appended and exposed to the caller as a cstr. Assuming
543 : the file is text (i.e. has no internal '\0's), strlen(name) will the
544 : number of bytes in the file and name_sz will be strlen(name)+1. name
545 : can have arbitrary alignment. */
546 :
547 : #ifdef FD_IMPORT
548 : #define FD_IMPORT_BINARY(name, path) FD_IMPORT( name, path, uchar, 7, "" )
549 : #define FD_IMPORT_CSTR( name, path) FD_IMPORT( name, path, char, 1, ".byte 0" )
550 : #endif
551 :
552 : /* Optimizer tricks ***************************************************/
553 :
554 : /* FD_RESTRICT is a pointer modifier for to designate a pointer as
555 : restricted. Hoops jumped because C++-17 still doesn't understand
556 : restrict ... sigh */
557 :
558 : #ifndef FD_RESTRICT
559 : #ifdef __cplusplus
560 : #define FD_RESTRICT __restrict
561 : #else
562 : #define FD_RESTRICT restrict
563 : #endif
564 : #endif
565 :
566 : /* fd_type_pun(p), fd_type_pun_const(p): These allow use of type
567 : punning while keeping strict aliasing optimizations enabled (e.g.
568 : some UNIX APIs, like sockaddr related APIs are dependent on type
569 : punning). These allow these API's to be used cleanly while keeping
570 : strict aliasing optimizations enabled and strict alias checking done. */
571 :
572 : static inline void *
573 65043434 : fd_type_pun( void * p ) {
574 65043434 : __asm__( "# fd_type_pun @" FD_SRC_LOCATION : "+r" (p) :: "memory" );
575 65043434 : return p;
576 65043434 : }
577 :
578 : static inline void const *
579 242689581 : fd_type_pun_const( void const * p ) {
580 242689581 : __asm__( "# fd_type_pun_const @" FD_SRC_LOCATION : "+r" (p) :: "memory" );
581 242689581 : return p;
582 242689581 : }
583 :
584 : /* FD_{LIKELY,UNLIKELY}(c): Evaluates c and returns whether it is
585 : logical true/false as long (1L/0L). It also hints to the optimizer
586 : whether it should optimize for the case of c evaluating as
587 : true/false. */
588 :
589 >11283*10^7 : #define FD_LIKELY(c) __builtin_expect( !!(c), 1L )
590 >47776*10^7 : #define FD_UNLIKELY(c) __builtin_expect( !!(c), 0L )
591 :
592 : /* FD_FN_PURE hints to the optimizer that the function, roughly
593 : speaking, does not have side effects. As such, the compiler can
594 : replace a call to the function with the result of an earlier call to
595 : that function provide the inputs and memory used hasn't changed.
596 :
597 : IMPORTANT SAFETY TIP! Recent compilers seem to take an undocumented
598 : and debatable stance that pure functions do no writes to memory.
599 : This is a sufficient condition for the above but not a necessary one.
600 :
601 : Consider, for example, the real world case of an otherwise pure
602 : function that uses pass-by-reference to return more than one value
603 : (an unpleasant practice that is sadly often necessary because C/C++,
604 : compilers and underlying platform ABIs are very bad at helping
605 : developers simply and clearly express their intent to return multiple
606 : values and then generate good assembly for such).
607 :
608 : If called multiple times sequentially, all but the first call to such
609 : a "pure" function could be optimized away because the non-volatile
610 : memory writes done in the all but the 1st call for the
611 : pass-by-reference-returns write the same value to normal memory that
612 : was written on the 1st call. That is, these calls return the same
613 : value for their direct return and do writes that do not have any
614 : visible effect.
615 :
616 : Thus, while it is safe for the compiler to eliminate all but the
617 : first call via techniques like common subexpression elimination, it
618 : is not safe for the compiler to infer that the first call did no
619 : writes.
620 :
621 : But recent compilers seem to do exactly that.
622 :
623 : Sigh ... we can't use FD_FN_PURE on such functions because of all the
624 : above linguistic, compiler, documentation and ABI infinite sadness.
625 :
626 : TL;DR To be safe against the above vagaries, recommend using
627 : FD_FN_PURE to annotate functions that do no memory writes (including
628 : trivial memory writes) and try to design HPC APIs to avoid returning
629 : multiple values as much as possible. */
630 :
631 : #define FD_FN_PURE __attribute__((pure))
632 :
633 : /* FD_FN_CONST is like pure but also, even stronger, indicates that the
634 : function does not depend on the state of memory. */
635 :
636 : #define FD_FN_CONST __attribute__((const))
637 :
638 : /* FD_FN_UNUSED indicates that it is okay if the function with static
639 : linkage is not used. Allows working around -Winline in header only
640 : APIs where the compiler decides not to actually inline the function.
641 : (This belief, frequently promulgated by anti-macro cults, that "An
642 : Inline Function is As Fast As a Macro" ... an entire section in gcc's
643 : documentation devoted to it in fact ... remains among the biggest
644 : lies in computer science. Yes, an inline function is as fast as a
645 : macro ... when the compiler actually decides to treat the inline
646 : keyword more than just for entertainment purposes only. Which, as
647 : -Winline proves, it frequently doesn't. Sigh ... force_inline like
648 : compiler extensions might be an alternative here but they have their
649 : own portability issues.) */
650 :
651 42 : #define FD_FN_UNUSED __attribute__((unused))
652 :
653 : /* FD_FN_UNSANITIZED tells the compiler to disable AddressSanitizer and
654 : UndefinedBehaviorSanitizer instrumentation. For some functions, this
655 : can improve instrumented compile time by ~30x. */
656 :
657 : #define FD_FN_UNSANITIZED __attribute__((no_sanitize("address", "undefined")))
658 :
659 : /* FD_FN_SENSITIVE instruments the compiler to sanitize sensitive functions.
660 : https://eprint.iacr.org/2023/1713 (Sec 3.2)
661 : - Clear all registers with __attribute__((zero_call_used_regs("all")))
662 : - Clear stack with __attribute__((strub)), available in gcc 14+ */
663 :
664 : #if __has_attribute(strub)
665 : #define FD_FN_SENSITIVE __attribute__((strub)) __attribute__((zero_call_used_regs("all")))
666 : #elif __has_attribute(zero_call_used_regs)
667 : #define FD_FN_SENSITIVE __attribute__((zero_call_used_regs("all")))
668 : #else
669 : #define FD_FN_SENSITIVE
670 : #endif
671 :
672 : /* FD_PARAM_UNUSED indicates that it is okay if the function parameter is not
673 : used. */
674 :
675 0 : #define FD_PARAM_UNUSED __attribute__((unused))
676 :
677 : /* FD_TYPE_PACKED indicates that a type is to be packed, reseting its alignment
678 : to 1. */
679 :
680 : #define FD_TYPE_PACKED __attribute__((packed))
681 :
682 : /* FD_WARN_UNUSED tells the compiler the result (from a function) should
683 : be checked. This is useful to force callers to either check the result
684 : or deliberately and explicitly ignore it. Good for result codes and
685 : errors */
686 :
687 : #define FD_WARN_UNUSED __attribute__ ((warn_unused_result))
688 :
689 : /* FD_FALLTHRU tells the compiler that a case in a switch falls through
690 : to the next case. This avoids the compiler complaining, in cases where
691 : it is an intentional fall through.
692 : The "while(0)" avoids a compiler complaint in the event the case
693 : has no statement, example:
694 : switch( return_code ) {
695 : case RETURN_CASE_1: FD_FALLTHRU;
696 : case RETURN_CASE_2: FD_FALLTHRU;
697 : case RETURN_CASE_3:
698 : case_123();
699 : default:
700 : case_other();
701 : }
702 :
703 : See C++17 [[fallthrough]] and gcc __attribute__((fallthrough)) */
704 :
705 : #define FD_FALLTHRU while(0) __attribute__((fallthrough))
706 :
707 : /* FD_COMPILER_FORGET(var): Tells the compiler that it shouldn't use
708 : any knowledge it has about the provided register-compatible variable
709 : var for optimizations going forward (i.e. the variable has changed in
710 : a deterministic but unknown-to-the-compiler way where the actual
711 : change is the identity operation). Useful for inhibiting various
712 : branch nest misoptimizations (compilers unfortunately tend to
713 : radically underestimate the impact in raw average performance and
714 : jitter and the probability of branch mispredicts or the cost to the
715 : CPU of having lots of branches). This is not asm volatile (use
716 : UNPREDICTABLE below for that) and has no clobbers. So if var is not
717 : used after the forget, the compiler can optimize the FORGET away
718 : (along with operations preceding it used to produce var). */
719 :
720 18304370342 : #define FD_COMPILER_FORGET(var) __asm__( "# FD_COMPILER_FORGET(" #var ")@" FD_SRC_LOCATION : "+r" (var) )
721 :
722 : /* FD_COMPILER_UNPREDICTABLE(var): Same as FD_COMPILER_FORGET(var) but
723 : the provided variable has changed in a non-deterministic way from the
724 : compiler's POV (e.g. the value in the variable on output should not
725 : be treated as a compile time constant even if it is one
726 : linguistically). Useful for suppressing unwanted
727 : compile-time-const-based optimizations like hoisting operations with
728 : useful CPU side effects out of a critical loop. */
729 :
730 23058455 : #define FD_COMPILER_UNPREDICTABLE(var) __asm__ __volatile__( "# FD_COMPILER_UNPREDICTABLE(" #var ")@" FD_SRC_LOCATION : "+r" (var) )
731 :
732 : /* Atomic tricks ******************************************************/
733 :
734 : /* FD_COMPILER_MFENCE(): Tells the compiler that that it can't move any
735 : memory operations (load or store) from before the MFENCE to after the
736 : MFENCE (and vice versa). The processor itself might still reorder
737 : around the fence though (that requires platform specific fences). */
738 :
739 20169086088 : #define FD_COMPILER_MFENCE() __asm__ __volatile__( "# FD_COMPILER_MFENCE()@" FD_SRC_LOCATION ::: "memory" )
740 :
741 : /* FD_SPIN_PAUSE(): Yields the logical core of the calling thread to
742 : the other logical cores sharing the same underlying physical core for
743 : a few clocks without yielding it to the operating system scheduler.
744 : Typically useful for shared memory spin polling loops, especially if
745 : hyperthreading is in use. */
746 :
747 : #if FD_HAS_X86
748 6176683856 : #define FD_SPIN_PAUSE() __builtin_ia32_pause()
749 : #else
750 : #define FD_SPIN_PAUSE() ((void)0)
751 : #endif
752 :
753 : /* FD_YIELD(): Yields the logical core of the calling thread to the
754 : operating system scheduler if a hosted target and does a spin pause
755 : otherwise. */
756 :
757 : #if FD_HAS_HOSTED
758 22083617 : #define FD_YIELD() fd_yield()
759 : #else
760 : #define FD_YIELD() FD_SPIN_PAUSE()
761 : #endif
762 :
763 : /* FD_VOLATILE_CONST(x): Tells the compiler is not able to predict the
764 : value obtained by dereferencing x and that dereferencing x might have
765 : other side effects (e.g. maybe another thread could change the value
766 : and the compiler has no way of knowing this). Generally speaking,
767 : the volatile keyword is broken linguistically. Volatility is not a
768 : property of the variable but of the dereferencing of a variable (e.g.
769 : what is volatile from the POV of a reader of a shared variable is not
770 : necessarily volatile from the POV a writer of that shared variable in
771 : a different thread). */
772 :
773 2081536625 : #define FD_VOLATILE_CONST(x) (*((volatile const __typeof__((x)) *)&(x)))
774 :
775 : /* FD_VOLATILE(x): tells the compiler is not able to predict the effect
776 : of modifying x and that dereferencing x might have other side effects
777 : (e.g. maybe another thread is spinning on x waiting for its value to
778 : change and the compiler has no way of knowing this). */
779 :
780 3534779074 : #define FD_VOLATILE(x) (*((volatile __typeof__((x)) *)&(x)))
781 :
782 : #if FD_HAS_ATOMIC
783 :
784 : /* FD_ATOMIC_FETCH_AND_{ADD,SUB,OR,AND,XOR}(p,v):
785 :
786 : FD_ATOMIC_FETCH_AND_ADD(p,v) does
787 : f = *p;
788 : *p = f + v
789 : return f;
790 : as a single atomic operation. Similarly for the other variants. */
791 :
792 170815650 : #define FD_ATOMIC_FETCH_AND_ADD(p,v) __sync_fetch_and_add( (p), (v) )
793 170946714 : #define FD_ATOMIC_FETCH_AND_SUB(p,v) __sync_fetch_and_sub( (p), (v) )
794 : #define FD_ATOMIC_FETCH_AND_OR( p,v) __sync_fetch_and_or( (p), (v) )
795 : #define FD_ATOMIC_FETCH_AND_AND(p,v) __sync_fetch_and_and( (p), (v) )
796 : #define FD_ATOMIC_FETCH_AND_XOR(p,v) __sync_fetch_and_xor( (p), (v) )
797 :
798 : /* FD_ATOMIC_{ADD,SUB,OR,AND,XOR}_AND_FETCH(p,v):
799 :
800 : FD_ATOMIC_{ADD,SUB,OR,AND,XOR}_AND_FETCH(p,v) does
801 : r = *p + v;
802 : *p = r;
803 : return r;
804 : as a single atomic operation. Similarly for the other variants. */
805 :
806 : #define FD_ATOMIC_ADD_AND_FETCH(p,v) __sync_add_and_fetch( (p), (v) )
807 : #define FD_ATOMIC_SUB_AND_FETCH(p,v) __sync_sub_and_fetch( (p), (v) )
808 : #define FD_ATOMIC_OR_AND_FETCH( p,v) __sync_or_and_fetch( (p), (v) )
809 : #define FD_ATOMIC_AND_AND_FETCH(p,v) __sync_and_and_fetch( (p), (v) )
810 : #define FD_ATOMIC_XOR_AND_FETCH(p,v) __sync_xor_and_fetch( (p), (v) )
811 :
812 : /* FD_ATOMIC_CAS(p,c,s):
813 :
814 : o = FD_ATOMIC_CAS(p,c,s) conceptually does:
815 : o = *p;
816 : if( o==c ) *p = s;
817 : return o
818 : as a single atomic operation. */
819 :
820 564333297 : #define FD_ATOMIC_CAS(p,c,s) __sync_val_compare_and_swap( (p), (c), (s) )
821 :
822 : /* FD_ATOMIC_XCHG(p,v):
823 :
824 : o = FD_ATOMIC_XCHG( p, v ) conceptually does:
825 : o = *p
826 : *p = v
827 : return o
828 : as a single atomic operation.
829 :
830 : Intel's __sync compiler extensions from the days of yore mysteriously
831 : implemented atomic exchange via the very misleadingly named
832 : __sync_lock_test_and_set. And some implementations (and C++)
833 : debatably then implemented this API according to what the misleading
834 : name implied as opposed to what it actually did. But those
835 : implementations didn't bother to provide an replacement for atomic
836 : exchange functionality (forcing us to emulate atomic exchange more
837 : slowly via CAS there). Sigh ... we do what we can to fix this up. */
838 :
839 : #ifndef FD_ATOMIC_XCHG_STYLE
840 : #if FD_HAS_X86 && !__cplusplus
841 : #define FD_ATOMIC_XCHG_STYLE 1
842 : #else
843 : #define FD_ATOMIC_XCHG_STYLE 0
844 : #endif
845 : #endif
846 :
847 : #if FD_ATOMIC_XCHG_STYLE==0
848 : #define FD_ATOMIC_XCHG(p,v) (__extension__({ \
849 : __typeof__(*(p)) * _fd_atomic_xchg_p = (p); \
850 : __typeof__(*(p)) _fd_atomic_xchg_v = (v); \
851 : __typeof__(*(p)) _fd_atomic_xchg_t; \
852 : for(;;) { \
853 : _fd_atomic_xchg_t = FD_VOLATILE_CONST( *_fd_atomic_xchg_p ); \
854 : if( FD_LIKELY( __sync_bool_compare_and_swap( _fd_atomic_xchg_p, _fd_atomic_xchg_t, _fd_atomic_xchg_v ) ) ) break; \
855 : FD_SPIN_PAUSE(); \
856 : } \
857 : _fd_atomic_xchg_t; \
858 : }))
859 : #elif FD_ATOMIC_XCHG_STYLE==1
860 784324590 : #define FD_ATOMIC_XCHG(p,v) __sync_lock_test_and_set( (p), (v) )
861 : #else
862 : #error "Unknown FD_ATOMIC_XCHG_STYLE"
863 : #endif
864 :
865 : #endif /* FD_HAS_ATOMIC */
866 :
867 : /* FD_TL: This indicates that the variable should be thread local.
868 :
869 : FD_ONCE_{BEGIN,END}: The block:
870 :
871 : FD_ONCE_BEGIN {
872 : ... code ...
873 : } FD_ONCE_END
874 :
875 : linguistically behaves like:
876 :
877 : do {
878 : ... code ...
879 : } while(0)
880 :
881 : But provides a low overhead guarantee that:
882 : - The block will be executed by at most once over all threads
883 : in a process (i.e. the set of threads which share global
884 : variables).
885 : - No thread in a process that encounters the block will continue
886 : past it until it has executed once.
887 :
888 : This implies that caller promises a ONCE block will execute in a
889 : finite time. (Meant for doing simple lightweight initializations.)
890 :
891 : It is okay to nest ONCE blocks. The thread that executes the
892 : outermost will execute all the nested once as part of executing the
893 : outermost.
894 :
895 : A ONCE implicitly provides a compiler memory fence to reduce the risk
896 : that the compiler will assume that operations done in the once block
897 : on another thread have not been done (e.g. propagating pre-once block
898 : variable values into post-once block code). It is up to the user to
899 : provide any necessary hardware fencing (usually not necessary).
900 :
901 : FD_THREAD_ONCE_{BEGIN,END}: The block:
902 :
903 : FD_THREAD_ONCE_BEGIN {
904 : ... code ...
905 : } FD_THREAD_ONCE_END;
906 :
907 : is similar except the guarantee is that the block only covers the
908 : invoking thread and it does not provide any fencing. If a thread
909 : once begin is nested inside a once begin, that thread once begin will
910 : only be executed on the thread that executes the thread once begin.
911 : It is similarly okay to nest ONCE block inside a THREAD_ONCE block. */
912 :
913 : #if FD_HAS_THREADS /* Potentially more than one thread in the process */
914 :
915 : #ifndef FD_TL
916 : #define FD_TL __thread
917 : #endif
918 :
919 1368 : #define FD_ONCE_BEGIN do { \
920 1368 : FD_COMPILER_MFENCE(); \
921 1368 : static volatile int _fd_once_block_state = 0; \
922 1368 : for(;;) { \
923 1368 : int _fd_once_block_tmp = _fd_once_block_state; \
924 1368 : if( FD_LIKELY( _fd_once_block_tmp>0 ) ) break; \
925 1368 : if( FD_LIKELY( !_fd_once_block_tmp ) && \
926 1170 : FD_LIKELY( !FD_ATOMIC_CAS( &_fd_once_block_state, 0, -1 ) ) ) { \
927 1170 : do
928 :
929 : #define FD_ONCE_END \
930 1170 : while(0); \
931 1170 : FD_COMPILER_MFENCE(); \
932 1170 : _fd_once_block_state = 1; \
933 1170 : break; \
934 1170 : } \
935 1170 : FD_YIELD(); \
936 0 : } \
937 1368 : } while(0)
938 :
939 36 : #define FD_THREAD_ONCE_BEGIN do { \
940 36 : static FD_TL int _fd_thread_once_block_state = 0; \
941 36 : if( FD_UNLIKELY( !_fd_thread_once_block_state ) ) { \
942 9 : do
943 :
944 : #define FD_THREAD_ONCE_END \
945 9 : while(0); \
946 9 : _fd_thread_once_block_state = 1; \
947 9 : } \
948 36 : } while(0)
949 :
950 : #else /* Only one thread in the process */
951 :
952 : #ifndef FD_TL
953 : #define FD_TL /**/
954 : #endif
955 :
956 : #define FD_ONCE_BEGIN do { \
957 : static int _fd_once_block_state = 0; \
958 : if( FD_UNLIKELY( !_fd_once_block_state ) ) { \
959 : do
960 :
961 : #define FD_ONCE_END \
962 : while(0); \
963 : _fd_once_block_state = 1; \
964 : } \
965 : } while(0)
966 :
967 : #define FD_THREAD_ONCE_BEGIN FD_ONCE_BEGIN
968 : #define FD_THREAD_ONCE_END FD_ONCE_END
969 :
970 : #endif
971 :
972 : FD_PROTOTYPES_BEGIN
973 :
974 : /* fd_memcpy(d,s,sz): On modern x86 in some circumstances, rep mov will
975 : be faster than memcpy under the hood (basically due to RFO /
976 : read-for-ownership optimizations in the cache protocol under the hood
977 : that aren't easily done from the ISA ... see Intel docs on enhanced
978 : rep mov). Compile time configurable though as this is not always
979 : true. So application can tune to taste. Hard to beat rep mov for
980 : code density though (2 bytes) and pretty hard to beat in situations
981 : needing a completely generic memcpy. But it can be beaten in
982 : specialized situations for the usual reasons. */
983 :
984 : /* FIXME: CONSIDER MEMCMP TOO! */
985 : /* FIXME: CONSIDER MEMCPY RELATED FUNC ATTRS */
986 :
987 : #ifndef FD_USE_ARCH_MEMCPY
988 : #define FD_USE_ARCH_MEMCPY 0
989 : #endif
990 :
991 : #if FD_HAS_X86 && FD_USE_ARCH_MEMCPY && !defined(CBMC) && !FD_HAS_DEEPASAN && !FD_HAS_MSAN
992 :
993 : static inline void *
994 : fd_memcpy( void * FD_RESTRICT d,
995 : void const * FD_RESTRICT s,
996 577480572 : ulong sz ) {
997 577480572 : void * p = d;
998 577480572 : __asm__ __volatile__( "rep movsb" : "+D" (p), "+S" (s), "+c" (sz) :: "memory" );
999 577480572 : return d;
1000 577480572 : }
1001 :
1002 : #elif FD_HAS_MSAN
1003 :
1004 : void * __msan_memcpy( void * dest, void const * src, ulong n );
1005 :
1006 : static inline void *
1007 : fd_memcpy( void * FD_RESTRICT d,
1008 : void const * FD_RESTRICT s,
1009 : ulong sz ) {
1010 : return __msan_memcpy( d, s, sz );
1011 : }
1012 :
1013 : #else
1014 :
1015 : static inline void *
1016 : fd_memcpy( void * FD_RESTRICT d,
1017 : void const * FD_RESTRICT s,
1018 1092999120 : ulong sz ) {
1019 : #if defined(CBMC) || FD_HAS_ASAN
1020 : if( FD_UNLIKELY( !sz ) ) return d; /* Standard says sz 0 is UB, uncomment if target is insane and doesn't treat sz 0 as a nop */
1021 : #endif
1022 1092999120 : return memcpy( d, s, sz );
1023 1092999120 : }
1024 :
1025 : #endif
1026 :
1027 : /* fd_memset(d,c,sz): architecturally optimized memset. See fd_memcpy
1028 : for considerations. */
1029 :
1030 : /* FIXME: CONSIDER MEMSET RELATED FUNC ATTRS */
1031 :
1032 : #ifndef FD_USE_ARCH_MEMSET
1033 : #define FD_USE_ARCH_MEMSET 0
1034 : #endif
1035 :
1036 : #if FD_HAS_X86 && FD_USE_ARCH_MEMSET && !defined(CBMC) && !FD_HAS_DEEPASAN && !FD_HAS_MSAN
1037 :
1038 : static inline void *
1039 : fd_memset( void * d,
1040 : int c,
1041 173915410 : ulong sz ) {
1042 173915410 : void * p = d;
1043 173915410 : __asm__ __volatile__( "rep stosb" : "+D" (p), "+c" (sz) : "a" (c) : "memory" );
1044 173915410 : return d;
1045 173915410 : }
1046 :
1047 : #else
1048 :
1049 : static inline void *
1050 : fd_memset( void * d,
1051 : int c,
1052 336208243 : ulong sz ) {
1053 : # ifdef CBMC
1054 : if( FD_UNLIKELY( !sz ) ) return d; /* See fd_memcpy note */
1055 : # endif
1056 336208243 : return memset( d, c, sz );
1057 336208243 : }
1058 :
1059 : #endif
1060 :
1061 : /* C23 has memset_explicit, i.e. a memset that can't be removed by the
1062 : optimizer. This is our own equivalent. */
1063 :
1064 : static void * (* volatile fd_memset_explicit)(void *, int, size_t) = memset;
1065 :
1066 : /* fd_memeq(s0,s1,sz): Compares two blocks of memory. Returns 1 if
1067 : equal or sz is zero and 0 otherwise. No memory accesses made if sz
1068 : is zero (pointers may be invalid). On x86, uses repe cmpsb which is
1069 : preferable to __builtin_memcmp in some cases. */
1070 :
1071 : #ifndef FD_USE_ARCH_MEMEQ
1072 : #define FD_USE_ARCH_MEMEQ 0
1073 : #endif
1074 :
1075 : #if FD_HAS_X86 && FD_USE_ARCH_MEMEQ && defined(__GCC_ASM_FLAG_OUTPUTS__) && __STDC_VERSION__>=199901L
1076 :
1077 : FD_FN_PURE static inline int
1078 : fd_memeq( void const * s0,
1079 : void const * s1,
1080 : ulong sz ) {
1081 : /* ZF flag is set and exported in two cases:
1082 : a) size is zero (via test)
1083 : b) buffer is equal (via repe cmpsb) */
1084 : int r;
1085 : __asm__( "test %3, %3;"
1086 : "repe cmpsb"
1087 : : "=@cce" (r), "+S" (s0), "+D" (s1), "+c" (sz)
1088 : : "m" (*(char const (*)[sz]) s0), "m" (*(char const (*)[sz]) s1)
1089 : : "cc" );
1090 : return r;
1091 : }
1092 :
1093 : #else
1094 :
1095 : FD_FN_PURE static inline int
1096 : fd_memeq( void const * s1,
1097 : void const * s2,
1098 14690808 : ulong sz ) {
1099 14690808 : return 0==memcmp( s1, s2, sz );
1100 14690808 : }
1101 :
1102 : #endif
1103 :
1104 : /* fd_hash(seed,buf,sz), fd_hash_memcpy(seed,d,s,sz): High quality
1105 : (full avalanche) high speed variable length buffer -> 64-bit hash
1106 : function (memcpy_hash is often as fast as plain memcpy). Based on
1107 : the xxhash-r39 (open source BSD licensed) implementation. In-place
1108 : and out-of-place variants provided (out-of-place variant assumes dst
1109 : and src do not overlap). Caller promises valid input arguments,
1110 : cannot fail given valid inputs arguments. sz==0 is fine. */
1111 :
1112 : FD_FN_PURE ulong
1113 : fd_hash( ulong seed,
1114 : void const * buf,
1115 : ulong sz );
1116 :
1117 : ulong
1118 : fd_hash_memcpy( ulong seed,
1119 : void * FD_RESTRICT d,
1120 : void const * FD_RESTRICT s,
1121 : ulong sz );
1122 :
1123 : #ifndef FD_TICKCOUNT_STYLE
1124 : #if FD_HAS_X86 /* Use RDTSC */
1125 : #define FD_TICKCOUNT_STYLE 1
1126 : #else /* Use portable fallback */
1127 : #define FD_TICKCOUNT_STYLE 0
1128 : #endif
1129 : #endif
1130 :
1131 : #if FD_TICKCOUNT_STYLE==0 /* Portable fallback (slow). Ticks at 1 ns / tick */
1132 :
1133 : #define fd_tickcount() fd_log_wallclock() /* TODO: fix ugly pre-log usage */
1134 :
1135 : #elif FD_TICKCOUNT_STYLE==1 /* RTDSC (fast) */
1136 :
1137 : /* fd_tickcount: Reads the hardware invariant tickcounter ("RDTSC").
1138 : This monotonically increases at an approximately constant rate
1139 : relative to the system wallclock and is synchronous across all CPUs
1140 : on a host.
1141 :
1142 : The rate this ticks at is not precisely defined (see Intel docs for
1143 : more details) but it is typically in the ballpark of the CPU base
1144 : clock frequency. The relationship to the wallclock is very well
1145 : approximated as linear over short periods of time (i.e. less than a
1146 : fraction of a second) and this should not exhibit any sudden changes
1147 : in its rate relative to the wallclock. Notably, its rate is not
1148 : directly impacted by CPU clock frequency adaptation / Turbo mode (see
1149 : other Intel performance monitoring counters for various CPU cycle
1150 : counters). It can drift over longer period time for the usual clock
1151 : synchronization reasons.
1152 :
1153 : This is a reasonably fast O(1) cost (~6-8 ns on recent Intel).
1154 : Because of all compiler options and parallel execution going on in
1155 : modern CPUs cores, other instructions might be reordered around this
1156 : by the compiler and/or CPU. It is up to the user to do lower level
1157 : tricks as necessary when the precise location of this in the
1158 : execution stream and/or when executed by the CPU is needed. (This is
1159 : often unnecessary as such levels of precision are not frequently
1160 : required and often have self-defeating overheads.)
1161 :
1162 : It is worth noting that RDTSC and/or (even more frequently) lower
1163 : level performance counters are often restricted from use in user
1164 : space applications. It is recommended that applications use this
1165 : primarily for debugging / performance tuning on unrestricted hosts
1166 : and/or when the developer is confident that applications using this
1167 : will have appropriate permissions when deployed. */
1168 :
1169 157292291 : #define fd_tickcount() ((long)__builtin_ia32_rdtsc())
1170 :
1171 : #else
1172 : #error "Unknown FD_TICKCOUNT_STYLE"
1173 : #endif
1174 :
1175 : #if FD_HAS_HOSTED
1176 :
1177 : /* fd_yield yields the calling thread to the operating system scheduler. */
1178 :
1179 : void
1180 : fd_yield( void );
1181 :
1182 : #endif
1183 :
1184 : FD_PROTOTYPES_END
1185 :
1186 : #endif /* HEADER_fd_src_util_fd_util_base_h */
|
