ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/cvsroot/libecb/ecb.pod
(Generate patch)

Comparing cvsroot/libecb/ecb.pod (file contents):
Revision 1.15 by root, Thu May 26 23:26:29 2011 UTC vs.
Revision 1.85 by root, Mon Jan 20 21:13:38 2020 UTC

3=head2 ABOUT LIBECB 3=head2 ABOUT LIBECB
4 4
5Libecb is currently a simple header file that doesn't require any 5Libecb is currently a simple header file that doesn't require any
6configuration to use or include in your project. 6configuration to use or include in your project.
7 7
8It's part of the e-suite of libraries, other memembers of which include 8It's part of the e-suite of libraries, other members of which include
9libev and libeio. 9libev and libeio.
10 10
11Its homepage can be found here: 11Its homepage can be found here:
12 12
13 http://software.schmorp.de/pkg/libecb 13 http://software.schmorp.de/pkg/libecb
14 14
15It mainly provides a number of wrappers around GCC built-ins, together 15It mainly provides a number of wrappers around many compiler built-ins,
16with replacement functions for other compilers. In addition to this, 16together with replacement functions for other compilers. In addition
17it provides a number of other lowlevel C utilities, such endienness 17to this, it provides a number of other lowlevel C utilities, such as
18detection, byte swapping or bit rotations. 18endianness detection, byte swapping or bit rotations.
19
20Or in other words, things that should be built into any standard C
21system, but aren't, implemented as efficient as possible with GCC (clang,
22msvc...), and still correct with other compilers.
19 23
20More might come. 24More might come.
21 25
22=head2 ABOUT THE HEADER 26=head2 ABOUT THE HEADER
23 27
27 #include <ecb.h> 31 #include <ecb.h>
28 32
29The header should work fine for both C and C++ compilation, and gives you 33The header should work fine for both C and C++ compilation, and gives you
30all of F<inttypes.h> in addition to the ECB symbols. 34all of F<inttypes.h> in addition to the ECB symbols.
31 35
32There are currently no objetc files to link to - future versions might 36There are currently no object files to link to - future versions might
33come with an (optional) object code library to link against, to reduce 37come with an (optional) object code library to link against, to reduce
34code size or gain access to additional features. 38code size or gain access to additional features.
35 39
36It also currently includes everything from F<inttypes.h>. 40It also currently includes everything from F<inttypes.h>.
37 41
50only a generic name is used (C<expr>, C<cond>, C<value> and so on), then 54only a generic name is used (C<expr>, C<cond>, C<value> and so on), then
51the corresponding function relies on C to implement the correct types, and 55the corresponding function relies on C to implement the correct types, and
52is usually implemented as a macro. Specifically, a "bool" in this manual 56is usually implemented as a macro. Specifically, a "bool" in this manual
53refers to any kind of boolean value, not a specific type. 57refers to any kind of boolean value, not a specific type.
54 58
59=head2 TYPES / TYPE SUPPORT
60
61ecb.h makes sure that the following types are defined (in the expected way):
62
63 int8_t uint8_
64 int16_t uint16_t
65 int32_t uint32_
66 int64_t uint64_t
67 int_fast8_t uint_fast8_t
68 int_fast16_t uint_fast16_t
69 int_fast32_t uint_fast32_t
70 int_fast64_t uint_fast64_t
71 intptr_t uintptr_t
72
73The macro C<ECB_PTRSIZE> is defined to the size of a pointer on this
74platform (currently C<4> or C<8>) and can be used in preprocessor
75expressions.
76
77For C<ptrdiff_t> and C<size_t> use C<stddef.h>/C<cstddef>.
78
79=head2 LANGUAGE/ENVIRONMENT/COMPILER VERSIONS
80
81All the following symbols expand to an expression that can be tested in
82preprocessor instructions as well as treated as a boolean (use C<!!> to
83ensure it's either C<0> or C<1> if you need that).
84
85=over 4
86
87=item ECB_C
88
89True if the implementation defines the C<__STDC__> macro to a true value,
90while not claiming to be C++, i..e C, but not C++.
91
92=item ECB_C99
93
94True if the implementation claims to be compliant to C99 (ISO/IEC
959899:1999) or any later version, while not claiming to be C++.
96
97Note that later versions (ECB_C11) remove core features again (for
98example, variable length arrays).
99
100=item ECB_C11, ECB_C17
101
102True if the implementation claims to be compliant to C11/C17 (ISO/IEC
1039899:2011, :20187) or any later version, while not claiming to be C++.
104
105=item ECB_CPP
106
107True if the implementation defines the C<__cplusplus__> macro to a true
108value, which is typically true for C++ compilers.
109
110=item ECB_CPP11, ECB_CPP14, ECB_CPP17
111
112True if the implementation claims to be compliant to C++11/C++14/C++17
113(ISO/IEC 14882:2011, :2014, :2017) or any later version.
114
115Note that many C++20 features will likely have their own feature test
116macros (see e.g. L<http://eel.is/c++draft/cpp.predefined#1.8>).
117
118=item ECB_OPTIMIZE_SIZE
119
120Is C<1> when the compiler optimizes for size, C<0> otherwise. This symbol
121can also be defined before including F<ecb.h>, in which case it will be
122unchanged.
123
124=item ECB_GCC_VERSION (major, minor)
125
126Expands to a true value (suitable for testing by the preprocessor) if the
127compiler used is GNU C and the version is the given version, or higher.
128
129This macro tries to return false on compilers that claim to be GCC
130compatible but aren't.
131
132=item ECB_EXTERN_C
133
134Expands to C<extern "C"> in C++, and a simple C<extern> in C.
135
136This can be used to declare a single external C function:
137
138 ECB_EXTERN_C int printf (const char *format, ...);
139
140=item ECB_EXTERN_C_BEG / ECB_EXTERN_C_END
141
142These two macros can be used to wrap multiple C<extern "C"> definitions -
143they expand to nothing in C.
144
145They are most useful in header files:
146
147 ECB_EXTERN_C_BEG
148
149 int mycfun1 (int x);
150 int mycfun2 (int x);
151
152 ECB_EXTERN_C_END
153
154=item ECB_STDFP
155
156If this evaluates to a true value (suitable for testing by the
157preprocessor), then C<float> and C<double> use IEEE 754 single/binary32
158and double/binary64 representations internally I<and> the endianness of
159both types match the endianness of C<uint32_t> and C<uint64_t>.
160
161This means you can just copy the bits of a C<float> (or C<double>) to an
162C<uint32_t> (or C<uint64_t>) and get the raw IEEE 754 bit representation
163without having to think about format or endianness.
164
165This is true for basically all modern platforms, although F<ecb.h> might
166not be able to deduce this correctly everywhere and might err on the safe
167side.
168
169=item ECB_AMD64, ECB_AMD64_X32
170
171These two macros are defined to C<1> on the x86_64/amd64 ABI and the X32
172ABI, respectively, and undefined elsewhere.
173
174The designers of the new X32 ABI for some inexplicable reason decided to
175make it look exactly like amd64, even though it's completely incompatible
176to that ABI, breaking about every piece of software that assumed that
177C<__x86_64> stands for, well, the x86-64 ABI, making these macros
178necessary.
179
180=back
181
182=head2 MACRO TRICKERY
183
184=over 4
185
186=item ECB_CONCAT (a, b)
187
188Expands any macros in C<a> and C<b>, then concatenates the result to form
189a single token. This is mainly useful to form identifiers from components,
190e.g.:
191
192 #define S1 str
193 #define S2 cpy
194
195 ECB_CONCAT (S1, S2)(dst, src); // == strcpy (dst, src);
196
197=item ECB_STRINGIFY (arg)
198
199Expands any macros in C<arg> and returns the stringified version of
200it. This is mainly useful to get the contents of a macro in string form,
201e.g.:
202
203 #define SQL_LIMIT 100
204 sql_exec ("select * from table limit " ECB_STRINGIFY (SQL_LIMIT));
205
206=item ECB_STRINGIFY_EXPR (expr)
207
208Like C<ECB_STRINGIFY>, but additionally evaluates C<expr> to make sure it
209is a valid expression. This is useful to catch typos or cases where the
210macro isn't available:
211
212 #include <errno.h>
213
214 ECB_STRINGIFY (EDOM); // "33" (on my system at least)
215 ECB_STRINGIFY_EXPR (EDOM); // "33"
216
217 // now imagine we had a typo:
218
219 ECB_STRINGIFY (EDAM); // "EDAM"
220 ECB_STRINGIFY_EXPR (EDAM); // error: EDAM undefined
221
222=back
223
55=head2 GCC ATTRIBUTES 224=head2 ATTRIBUTES
56 225
57blabla where to put, what others 226A major part of libecb deals with additional attributes that can be
227assigned to functions, variables and sometimes even types - much like
228C<const> or C<volatile> in C. They are implemented using either GCC
229attributes or other compiler/language specific features. Attributes
230declarations must be put before the whole declaration:
58 231
59=over 4 232 ecb_const int mysqrt (int a);
233 ecb_unused int i;
60 234
61=item ecb_attribute ((attrs...)) 235=over 4
62
63A simple wrapper that expands to C<__attribute__((attrs))> on GCC, and to
64nothing on other compilers, so the effect is that only GCC sees these.
65
66Example: use the C<deprecated> attribute on a function.
67
68 ecb_attribute((__deprecated__)) void
69 do_not_use_me_anymore (void);
70 236
71=item ecb_unused 237=item ecb_unused
72 238
73Marks a function or a variable as "unused", which simply suppresses a 239Marks a function or a variable as "unused", which simply suppresses a
74warning by GCC when it detects it as unused. This is useful when you e.g. 240warning by the compiler when it detects it as unused. This is useful when
75declare a variable but do not always use it: 241you e.g. declare a variable but do not always use it:
76 242
77 { 243 {
78 int var ecb_unused; 244 ecb_unused int var;
79 245
80 #ifdef SOMECONDITION 246 #ifdef SOMECONDITION
81 var = ...; 247 var = ...;
82 return var; 248 return var;
83 #else 249 #else
84 return 0; 250 return 0;
85 #endif 251 #endif
86 } 252 }
87 253
254=item ecb_deprecated
255
256Similar to C<ecb_unused>, but marks a function, variable or type as
257deprecated. This makes some compilers warn when the type is used.
258
259=item ecb_deprecated_message (message)
260
261Same as C<ecb_deprecated>, but if possible, the specified diagnostic is
262used instead of a generic depreciation message when the object is being
263used.
264
265=item ecb_inline
266
267Expands either to (a compiler-specific equivalent of) C<static inline> or
268to just C<static>, if inline isn't supported. It should be used to declare
269functions that should be inlined, for code size or speed reasons.
270
271Example: inline this function, it surely will reduce codesize.
272
273 ecb_inline int
274 negmul (int a, int b)
275 {
276 return - (a * b);
277 }
278
88=item ecb_noinline 279=item ecb_noinline
89 280
90Prevent a function from being inlined - it might be optimised away, but 281Prevents a function from being inlined - it might be optimised away, but
91not inlined into other functions. This is useful if you know your function 282not inlined into other functions. This is useful if you know your function
92is rarely called and large enough for inlining not to be helpful. 283is rarely called and large enough for inlining not to be helpful.
93 284
94=item ecb_noreturn 285=item ecb_noreturn
95 286
287Marks a function as "not returning, ever". Some typical functions that
288don't return are C<exit> or C<abort> (which really works hard to not
289return), and now you can make your own:
290
291 ecb_noreturn void
292 my_abort (const char *errline)
293 {
294 puts (errline);
295 abort ();
296 }
297
298In this case, the compiler would probably be smart enough to deduce it on
299its own, so this is mainly useful for declarations.
300
301=item ecb_restrict
302
303Expands to the C<restrict> keyword or equivalent on compilers that support
304them, and to nothing on others. Must be specified on a pointer type or
305an array index to indicate that the memory doesn't alias with any other
306restricted pointer in the same scope.
307
308Example: multiply a vector, and allow the compiler to parallelise the
309loop, because it knows it doesn't overwrite input values.
310
311 void
312 multiply (ecb_restrict float *src,
313 ecb_restrict float *dst,
314 int len, float factor)
315 {
316 int i;
317
318 for (i = 0; i < len; ++i)
319 dst [i] = src [i] * factor;
320 }
321
96=item ecb_const 322=item ecb_const
97 323
324Declares that the function only depends on the values of its arguments,
325much like a mathematical function. It specifically does not read or write
326any memory any arguments might point to, global variables, or call any
327non-const functions. It also must not have any side effects.
328
329Such a function can be optimised much more aggressively by the compiler -
330for example, multiple calls with the same arguments can be optimised into
331a single call, which wouldn't be possible if the compiler would have to
332expect any side effects.
333
334It is best suited for functions in the sense of mathematical functions,
335such as a function returning the square root of its input argument.
336
337Not suited would be a function that calculates the hash of some memory
338area you pass in, prints some messages or looks at a global variable to
339decide on rounding.
340
341See C<ecb_pure> for a slightly less restrictive class of functions.
342
98=item ecb_pure 343=item ecb_pure
99 344
345Similar to C<ecb_const>, declares a function that has no side
346effects. Unlike C<ecb_const>, the function is allowed to examine global
347variables and any other memory areas (such as the ones passed to it via
348pointers).
349
350While these functions cannot be optimised as aggressively as C<ecb_const>
351functions, they can still be optimised away in many occasions, and the
352compiler has more freedom in moving calls to them around.
353
354Typical examples for such functions would be C<strlen> or C<memcmp>. A
355function that calculates the MD5 sum of some input and updates some MD5
356state passed as argument would I<NOT> be pure, however, as it would modify
357some memory area that is not the return value.
358
100=item ecb_hot 359=item ecb_hot
101 360
361This declares a function as "hot" with regards to the cache - the function
362is used so often, that it is very beneficial to keep it in the cache if
363possible.
364
365The compiler reacts by trying to place hot functions near to each other in
366memory.
367
368Whether a function is hot or not often depends on the whole program,
369and less on the function itself. C<ecb_cold> is likely more useful in
370practise.
371
102=item ecb_cold 372=item ecb_cold
103 373
374The opposite of C<ecb_hot> - declares a function as "cold" with regards to
375the cache, or in other words, this function is not called often, or not at
376speed-critical times, and keeping it in the cache might be a waste of said
377cache.
378
379In addition to placing cold functions together (or at least away from hot
380functions), this knowledge can be used in other ways, for example, the
381function will be optimised for size, as opposed to speed, and codepaths
382leading to calls to those functions can automatically be marked as if
383C<ecb_expect_false> had been used to reach them.
384
385Good examples for such functions would be error reporting functions, or
386functions only called in exceptional or rare cases.
387
104=item ecb_artificial 388=item ecb_artificial
105 389
390Declares the function as "artificial", in this case meaning that this
391function is not really meant to be a function, but more like an accessor
392- many methods in C++ classes are mere accessor functions, and having a
393crash reported in such a method, or single-stepping through them, is not
394usually so helpful, especially when it's inlined to just a few instructions.
395
396Marking them as artificial will instruct the debugger about just this,
397leading to happier debugging and thus happier lives.
398
399Example: in some kind of smart-pointer class, mark the pointer accessor as
400artificial, so that the whole class acts more like a pointer and less like
401some C++ abstraction monster.
402
403 template<typename T>
404 struct my_smart_ptr
405 {
406 T *value;
407
408 ecb_artificial
409 operator T *()
410 {
411 return value;
412 }
413 };
414
106=back 415=back
107 416
108=head2 OPTIMISATION HINTS 417=head2 OPTIMISATION HINTS
109 418
110=over 4 419=over 4
111 420
112=item bool ecb_is_constant(expr) 421=item bool ecb_is_constant (expr)
113 422
114Returns true iff the expression can be deduced to be a compile-time 423Returns true iff the expression can be deduced to be a compile-time
115constant, and false otherwise. 424constant, and false otherwise.
116 425
117For example, when you have a C<rndm16> function that returns a 16 bit 426For example, when you have a C<rndm16> function that returns a 16 bit
135 return is_constant (n) && !(n & (n - 1)) 444 return is_constant (n) && !(n & (n - 1))
136 ? rndm16 () & (num - 1) 445 ? rndm16 () & (num - 1)
137 : (n * (uint32_t)rndm16 ()) >> 16; 446 : (n * (uint32_t)rndm16 ()) >> 16;
138 } 447 }
139 448
140=item bool ecb_expect (expr, value) 449=item ecb_expect (expr, value)
141 450
142Evaluates C<expr> and returns it. In addition, it tells the compiler that 451Evaluates C<expr> and returns it. In addition, it tells the compiler that
143the C<expr> evaluates to C<value> a lot, which can be used for static 452the C<expr> evaluates to C<value> a lot, which can be used for static
144branch optimisations. 453branch optimisations.
145 454
146Usually, you want to use the more intuitive C<ecb_likely> and 455Usually, you want to use the more intuitive C<ecb_expect_true> and
147C<ecb_unlikely> functions instead. 456C<ecb_expect_false> functions instead.
148 457
458=item bool ecb_expect_true (cond)
459
149=item bool ecb_likely (cond) 460=item bool ecb_expect_false (cond)
150
151=item bool ecb_unlikely (cond)
152 461
153These two functions expect a expression that is true or false and return 462These two functions expect a expression that is true or false and return
154C<1> or C<0>, respectively, so when used in the condition of an C<if> or 463C<1> or C<0>, respectively, so when used in the condition of an C<if> or
155other conditional statement, it will not change the program: 464other conditional statement, it will not change the program:
156 465
157 /* these two do the same thing */ 466 /* these two do the same thing */
158 if (some_condition) ...; 467 if (some_condition) ...;
159 if (ecb_likely (some_condition)) ...; 468 if (ecb_expect_true (some_condition)) ...;
160 469
161However, by using C<ecb_likely>, you tell the compiler that the condition 470However, by using C<ecb_expect_true>, you tell the compiler that the
162is likely to be true (and for C<ecb_unlikely>, that it is unlikely to be 471condition is likely to be true (and for C<ecb_expect_false>, that it is
163true). 472unlikely to be true).
164 473
165For example, when you check for a null pointer and expect this to be a 474For example, when you check for a null pointer and expect this to be a
166rare, exceptional, case, then use C<ecb_unlikely>: 475rare, exceptional, case, then use C<ecb_expect_false>:
167 476
168 void my_free (void *ptr) 477 void my_free (void *ptr)
169 { 478 {
170 if (ecb_unlikely (ptr == 0)) 479 if (ecb_expect_false (ptr == 0))
171 return; 480 return;
172 } 481 }
173 482
174Consequent use of these functions to mark away exceptional cases or to 483Consequent use of these functions to mark away exceptional cases or to
175tell the compiler what the hot path through a function is can increase 484tell the compiler what the hot path through a function is can increase
176performance considerably. 485performance considerably.
486
487You might know these functions under the name C<likely> and C<unlikely>
488- while these are common aliases, we find that the expect name is easier
489to understand when quickly skimming code. If you wish, you can use
490C<ecb_likely> instead of C<ecb_expect_true> and C<ecb_unlikely> instead of
491C<ecb_expect_false> - these are simply aliases.
177 492
178A very good example is in a function that reserves more space for some 493A very good example is in a function that reserves more space for some
179memory block (for example, inside an implementation of a string stream) - 494memory block (for example, inside an implementation of a string stream) -
180each time something is added, you have to check for a buffer overrun, but 495each time something is added, you have to check for a buffer overrun, but
181you expect that most checks will turn out to be false: 496you expect that most checks will turn out to be false:
182 497
183 /* make sure we have "size" extra room in our buffer */ 498 /* make sure we have "size" extra room in our buffer */
184 ecb_inline void 499 ecb_inline void
185 reserve (int size) 500 reserve (int size)
186 { 501 {
187 if (ecb_unlikely (current + size > end)) 502 if (ecb_expect_false (current + size > end))
188 real_reserve_method (size); /* presumably noinline */ 503 real_reserve_method (size); /* presumably noinline */
189 } 504 }
190 505
191=item bool ecb_assume (cond) 506=item ecb_assume (cond)
192 507
193Try to tell the compiler that some condition is true, even if it's not 508Tries to tell the compiler that some condition is true, even if it's not
194obvious. 509obvious. This is not a function, but a statement: it cannot be used in
510another expression.
195 511
196This can be used to teach the compiler about invariants or other 512This can be used to teach the compiler about invariants or other
197conditions that might improve code generation, but which are impossible to 513conditions that might improve code generation, but which are impossible to
198deduce form the code itself. 514deduce form the code itself.
199 515
200For example, the example reservation function from the C<ecb_unlikely> 516For example, the example reservation function from the C<ecb_expect_false>
201description could be written thus (only C<ecb_assume> was added): 517description could be written thus (only C<ecb_assume> was added):
202 518
203 ecb_inline void 519 ecb_inline void
204 reserve (int size) 520 reserve (int size)
205 { 521 {
206 if (ecb_unlikely (current + size > end)) 522 if (ecb_expect_false (current + size > end))
207 real_reserve_method (size); /* presumably noinline */ 523 real_reserve_method (size); /* presumably noinline */
208 524
209 ecb_assume (current + size <= end); 525 ecb_assume (current + size <= end);
210 } 526 }
211 527
216 532
217Then the compiler I<might> be able to optimise out the second call 533Then the compiler I<might> be able to optimise out the second call
218completely, as it knows that C<< current + 1 > end >> is false and the 534completely, as it knows that C<< current + 1 > end >> is false and the
219call will never be executed. 535call will never be executed.
220 536
221=item bool ecb_unreachable () 537=item ecb_unreachable ()
222 538
223This function does nothing itself, except tell the compiler that it will 539This function does nothing itself, except tell the compiler that it will
224never be executed. Apart from suppressing a warning in some cases, this 540never be executed. Apart from suppressing a warning in some cases, this
225function can be used to implement C<ecb_assume> or similar functions. 541function can be used to implement C<ecb_assume> or similar functionality.
226 542
227=item bool ecb_prefetch (addr, rw, locality) 543=item ecb_prefetch (addr, rw, locality)
228 544
229Tells the compiler to try to prefetch memory at the given C<addr>ess 545Tells the compiler to try to prefetch memory at the given C<addr>ess
230for either reading (C<rw> = 0) or writing (C<rw> = 1). A C<locality> of 546for either reading (C<rw> = 0) or writing (C<rw> = 1). A C<locality> of
231C<0> means that there will only be one access later, C<3> means that 547C<0> means that there will only be one access later, C<3> means that
232the data will likely be accessed very often, and values in between mean 548the data will likely be accessed very often, and values in between mean
233something... in between. The memory pointed to by the address does not 549something... in between. The memory pointed to by the address does not
234need to be accessible (it could be a null pointer for example), but C<rw> 550need to be accessible (it could be a null pointer for example), but C<rw>
235and C<locality> must be compile-time constants. 551and C<locality> must be compile-time constants.
236 552
553This is a statement, not a function: you cannot use it as part of an
554expression.
555
237An obvious way to use this is to prefetch some data far away, in a big 556An obvious way to use this is to prefetch some data far away, in a big
238array you loop over. This prefetches memory some 128 array elements later, 557array you loop over. This prefetches memory some 128 array elements later,
239in the hope that it will be ready when the CPU arrives at that location. 558in the hope that it will be ready when the CPU arrives at that location.
240 559
241 int sum = 0; 560 int sum = 0;
260After processing the node, (part of) the next node might already be in 579After processing the node, (part of) the next node might already be in
261cache. 580cache.
262 581
263=back 582=back
264 583
265=head2 BIT FIDDLING / BITSTUFFS 584=head2 BIT FIDDLING / BIT WIZARDRY
266 585
267=over 4 586=over 4
268 587
269=item bool ecb_big_endian () 588=item bool ecb_big_endian ()
270 589
272 591
273These two functions return true if the byte order is big endian 592These two functions return true if the byte order is big endian
274(most-significant byte first) or little endian (least-significant byte 593(most-significant byte first) or little endian (least-significant byte
275first) respectively. 594first) respectively.
276 595
596On systems that are neither, their return values are unspecified.
597
277=item int ecb_ctz32 (uint32_t x) 598=item int ecb_ctz32 (uint32_t x)
278 599
600=item int ecb_ctz64 (uint64_t x)
601
602=item int ecb_ctz (T x) [C++]
603
279Returns the index of the least significant bit set in C<x> (or 604Returns the index of the least significant bit set in C<x> (or
280equivalently the number of bits set to 0 before the least significant 605equivalently the number of bits set to 0 before the least significant bit
281bit set), starting from 0. If C<x> is 0 the result is undefined. A 606set), starting from 0. If C<x> is 0 the result is undefined.
282common use case is to compute the integer binary logarithm, i.e., 607
283floor(log2(n)). For example: 608For smaller types than C<uint32_t> you can safely use C<ecb_ctz32>.
609
610The overloaded C++ C<ecb_ctz> function supports C<uint8_t>, C<uint16_t>,
611C<uint32_t> and C<uint64_t> types.
612
613For example:
284 614
285 ecb_ctz32 (3) = 0 615 ecb_ctz32 (3) = 0
286 ecb_ctz32 (6) = 1 616 ecb_ctz32 (6) = 1
287 617
618=item bool ecb_is_pot32 (uint32_t x)
619
620=item bool ecb_is_pot64 (uint32_t x)
621
622=item bool ecb_is_pot (T x) [C++]
623
624Returns true iff C<x> is a power of two or C<x == 0>.
625
626For smaller types than C<uint32_t> you can safely use C<ecb_is_pot32>.
627
628The overloaded C++ C<ecb_is_pot> function supports C<uint8_t>, C<uint16_t>,
629C<uint32_t> and C<uint64_t> types.
630
631=item int ecb_ld32 (uint32_t x)
632
633=item int ecb_ld64 (uint64_t x)
634
635=item int ecb_ld64 (T x) [C++]
636
637Returns the index of the most significant bit set in C<x>, or the number
638of digits the number requires in binary (so that C<< 2**ld <= x <
6392**(ld+1) >>). If C<x> is 0 the result is undefined. A common use case is
640to compute the integer binary logarithm, i.e. C<floor (log2 (n))>, for
641example to see how many bits a certain number requires to be encoded.
642
643This function is similar to the "count leading zero bits" function, except
644that that one returns how many zero bits are "in front" of the number (in
645the given data type), while C<ecb_ld> returns how many bits the number
646itself requires.
647
648For smaller types than C<uint32_t> you can safely use C<ecb_ld32>.
649
650The overloaded C++ C<ecb_ld> function supports C<uint8_t>, C<uint16_t>,
651C<uint32_t> and C<uint64_t> types.
652
288=item int ecb_popcount32 (uint32_t x) 653=item int ecb_popcount32 (uint32_t x)
289 654
655=item int ecb_popcount64 (uint64_t x)
656
657=item int ecb_popcount (T x) [C++]
658
290Returns the number of bits set to 1 in C<x>. For example: 659Returns the number of bits set to 1 in C<x>.
660
661For smaller types than C<uint32_t> you can safely use C<ecb_popcount32>.
662
663The overloaded C++ C<ecb_popcount> function supports C<uint8_t>, C<uint16_t>,
664C<uint32_t> and C<uint64_t> types.
665
666For example:
291 667
292 ecb_popcount32 (7) = 3 668 ecb_popcount32 (7) = 3
293 ecb_popcount32 (255) = 8 669 ecb_popcount32 (255) = 8
294 670
671=item uint8_t ecb_bitrev8 (uint8_t x)
672
673=item uint16_t ecb_bitrev16 (uint16_t x)
674
675=item uint32_t ecb_bitrev32 (uint32_t x)
676
677=item T ecb_bitrev (T x) [C++]
678
679Reverses the bits in x, i.e. the MSB becomes the LSB, MSB-1 becomes LSB+1
680and so on.
681
682The overloaded C++ C<ecb_bitrev> function supports C<uint8_t>, C<uint16_t> and C<uint32_t> types.
683
684Example:
685
686 ecb_bitrev8 (0xa7) = 0xea
687 ecb_bitrev32 (0xffcc4411) = 0x882233ff
688
689=item T ecb_bitrev (T x) [C++]
690
691Overloaded C++ bitrev function.
692
693C<T> must be one of C<uint8_t>, C<uint16_t> or C<uint32_t>.
694
295=item uint32_t ecb_bswap16 (uint32_t x) 695=item uint32_t ecb_bswap16 (uint32_t x)
296 696
297=item uint32_t ecb_bswap32 (uint32_t x) 697=item uint32_t ecb_bswap32 (uint32_t x)
298 698
699=item uint64_t ecb_bswap64 (uint64_t x)
700
701=item T ecb_bswap (T x)
702
299These two functions return the value of the 16-bit (32-bit) variable 703These functions return the value of the 16-bit (32-bit, 64-bit) value
300C<x> after reversing the order of bytes. 704C<x> after reversing the order of bytes (0x11223344 becomes 0x44332211 in
705C<ecb_bswap32>).
706
707The overloaded C++ C<ecb_bswap> function supports C<uint8_t>, C<uint16_t>,
708C<uint32_t> and C<uint64_t> types.
709
710=item uint8_t ecb_rotl8 (uint8_t x, unsigned int count)
711
712=item uint16_t ecb_rotl16 (uint16_t x, unsigned int count)
713
714=item uint32_t ecb_rotl32 (uint32_t x, unsigned int count)
715
716=item uint64_t ecb_rotl64 (uint64_t x, unsigned int count)
717
718=item uint8_t ecb_rotr8 (uint8_t x, unsigned int count)
719
720=item uint16_t ecb_rotr16 (uint16_t x, unsigned int count)
301 721
302=item uint32_t ecb_rotr32 (uint32_t x, unsigned int count) 722=item uint32_t ecb_rotr32 (uint32_t x, unsigned int count)
303 723
304=item uint32_t ecb_rotl32 (uint32_t x, unsigned int count) 724=item uint64_t ecb_rotr64 (uint64_t x, unsigned int count)
305 725
306These two functions return the value of C<x> after shifting all the bits 726These two families of functions return the value of C<x> after rotating
307by C<count> positions to the right or left respectively. 727all the bits by C<count> positions to the right (C<ecb_rotr>) or left
728(C<ecb_rotl>).
729
730Current GCC/clang versions understand these functions and usually compile
731them to "optimal" code (e.g. a single C<rol> or a combination of C<shld>
732on x86).
733
734=item T ecb_rotl (T x, unsigned int count) [C++]
735
736=item T ecb_rotr (T x, unsigned int count) [C++]
737
738Overloaded C++ rotl/rotr functions.
739
740C<T> must be one of C<uint8_t>, C<uint16_t>, C<uint32_t> or C<uint64_t>.
308 741
309=back 742=back
310 743
744=head2 HOST ENDIANNESS CONVERSION
745
746=over 4
747
748=item uint_fast16_t ecb_be_u16_to_host (uint_fast16_t v)
749
750=item uint_fast32_t ecb_be_u32_to_host (uint_fast32_t v)
751
752=item uint_fast64_t ecb_be_u64_to_host (uint_fast64_t v)
753
754=item uint_fast16_t ecb_le_u16_to_host (uint_fast16_t v)
755
756=item uint_fast32_t ecb_le_u32_to_host (uint_fast32_t v)
757
758=item uint_fast64_t ecb_le_u64_to_host (uint_fast64_t v)
759
760Convert an unsigned 16, 32 or 64 bit value from big or little endian to host byte order.
761
762The naming convention is C<ecb_>(C<be>|C<le>)C<_u>C<16|32|64>C<_to_host>,
763where C<be> and C<le> stand for big endian and little endian, respectively.
764
765=item uint_fast16_t ecb_host_to_be_u16 (uint_fast16_t v)
766
767=item uint_fast32_t ecb_host_to_be_u32 (uint_fast32_t v)
768
769=item uint_fast64_t ecb_host_to_be_u64 (uint_fast64_t v)
770
771=item uint_fast16_t ecb_host_to_le_u16 (uint_fast16_t v)
772
773=item uint_fast32_t ecb_host_to_le_u32 (uint_fast32_t v)
774
775=item uint_fast64_t ecb_host_to_le_u64 (uint_fast64_t v)
776
777Like above, but converts I<from> host byte order to the specified
778endianness.
779
780=back
781
782In C++ the following additional template functions are supported:
783
784=over 4
785
786=item T ecb_be_to_host (T v)
787
788=item T ecb_le_to_host (T v)
789
790=item T ecb_host_to_be (T v)
791
792=item T ecb_host_to_le (T v)
793
794These functions work like their C counterparts, above, but use templates,
795which make them useful in generic code.
796
797C<T> must be one of C<uint8_t>, C<uint16_t>, C<uint32_t> or C<uint64_t>
798(so unlike their C counterparts, there is a version for C<uint8_t>, which
799again can be useful in generic code).
800
801=head2 UNALIGNED LOAD/STORE
802
803These function load or store unaligned multi-byte values.
804
805=over 4
806
807=item uint_fast16_t ecb_peek_u16_u (const void *ptr)
808
809=item uint_fast32_t ecb_peek_u32_u (const void *ptr)
810
811=item uint_fast64_t ecb_peek_u64_u (const void *ptr)
812
813These functions load an unaligned, unsigned 16, 32 or 64 bit value from
814memory.
815
816=item uint_fast16_t ecb_peek_be_u16_u (const void *ptr)
817
818=item uint_fast32_t ecb_peek_be_u32_u (const void *ptr)
819
820=item uint_fast64_t ecb_peek_be_u64_u (const void *ptr)
821
822=item uint_fast16_t ecb_peek_le_u16_u (const void *ptr)
823
824=item uint_fast32_t ecb_peek_le_u32_u (const void *ptr)
825
826=item uint_fast64_t ecb_peek_le_u64_u (const void *ptr)
827
828Like above, but additionally convert from big endian (C<be>) or little
829endian (C<le>) byte order to host byte order while doing so.
830
831=item ecb_poke_u16_u (void *ptr, uint16_t v)
832
833=item ecb_poke_u32_u (void *ptr, uint32_t v)
834
835=item ecb_poke_u64_u (void *ptr, uint64_t v)
836
837These functions store an unaligned, unsigned 16, 32 or 64 bit value to
838memory.
839
840=item ecb_poke_be_u16_u (void *ptr, uint_fast16_t v)
841
842=item ecb_poke_be_u32_u (void *ptr, uint_fast32_t v)
843
844=item ecb_poke_be_u64_u (void *ptr, uint_fast64_t v)
845
846=item ecb_poke_le_u16_u (void *ptr, uint_fast16_t v)
847
848=item ecb_poke_le_u32_u (void *ptr, uint_fast32_t v)
849
850=item ecb_poke_le_u64_u (void *ptr, uint_fast64_t v)
851
852Like above, but additionally convert from host byte order to big endian
853(C<be>) or little endian (C<le>) byte order while doing so.
854
855=back
856
857In C++ the following additional template functions are supported:
858
859=over 4
860
861=item T ecb_peek<T> (const void *ptr)
862
863=item T ecb_peek_be<T> (const void *ptr)
864
865=item T ecb_peek_le<T> (const void *ptr)
866
867=item T ecb_peek_u<T> (const void *ptr)
868
869=item T ecb_peek_be_u<T> (const void *ptr)
870
871=item T ecb_peek_le_u<T> (const void *ptr)
872
873Similarly to their C counterparts, these functions load an unsigned 8, 16,
87432 or 64 bit value from memory, with optional conversion from big/little
875endian.
876
877Since the type cannot be deduced, it has to be specified explicitly, e.g.
878
879 uint_fast16_t v = ecb_peek<uint16_t> (ptr);
880
881C<T> must be one of C<uint8_t>, C<uint16_t>, C<uint32_t> or C<uint64_t>.
882
883Unlike their C counterparts, these functions support 8 bit quantities
884(C<uint8_t>) and also have an aligned version (without the C<_u> prefix),
885all of which hopefully makes them more useful in generic code.
886
887=item ecb_poke (void *ptr, T v)
888
889=item ecb_poke_be (void *ptr, T v)
890
891=item ecb_poke_le (void *ptr, T v)
892
893=item ecb_poke_u (void *ptr, T v)
894
895=item ecb_poke_be_u (void *ptr, T v)
896
897=item ecb_poke_le_u (void *ptr, T v)
898
899Again, similarly to their C counterparts, these functions store an
900unsigned 8, 16, 32 or z64 bit value to memory, with optional conversion to
901big/little endian.
902
903C<T> must be one of C<uint8_t>, C<uint16_t>, C<uint32_t> or C<uint64_t>.
904
905Unlike their C counterparts, these functions support 8 bit quantities
906(C<uint8_t>) and also have an aligned version (without the C<_u> prefix),
907all of which hopefully makes them more useful in generic code.
908
909=back
910
911=head2 FLOATING POINT FIDDLING
912
913=over 4
914
915=item ECB_INFINITY [-UECB_NO_LIBM]
916
917Evaluates to positive infinity if supported by the platform, otherwise to
918a truly huge number.
919
920=item ECB_NAN [-UECB_NO_LIBM]
921
922Evaluates to a quiet NAN if supported by the platform, otherwise to
923C<ECB_INFINITY>.
924
925=item float ecb_ldexpf (float x, int exp) [-UECB_NO_LIBM]
926
927Same as C<ldexpf>, but always available.
928
929=item uint32_t ecb_float_to_binary16 (float x) [-UECB_NO_LIBM]
930
931=item uint32_t ecb_float_to_binary32 (float x) [-UECB_NO_LIBM]
932
933=item uint64_t ecb_double_to_binary64 (double x) [-UECB_NO_LIBM]
934
935These functions each take an argument in the native C<float> or C<double>
936type and return the IEEE 754 bit representation of it (binary16/half,
937binary32/single or binary64/double precision).
938
939The bit representation is just as IEEE 754 defines it, i.e. the sign bit
940will be the most significant bit, followed by exponent and mantissa.
941
942This function should work even when the native floating point format isn't
943IEEE compliant, of course at a speed and code size penalty, and of course
944also within reasonable limits (it tries to convert NaNs, infinities and
945denormals, but will likely convert negative zero to positive zero).
946
947On all modern platforms (where C<ECB_STDFP> is true), the compiler should
948be able to optimise away this function completely.
949
950These functions can be helpful when serialising floats to the network - you
951can serialise the return value like a normal uint16_t/uint32_t/uint64_t.
952
953Another use for these functions is to manipulate floating point values
954directly.
955
956Silly example: toggle the sign bit of a float.
957
958 /* On gcc-4.7 on amd64, */
959 /* this results in a single add instruction to toggle the bit, and 4 extra */
960 /* instructions to move the float value to an integer register and back. */
961
962 x = ecb_binary32_to_float (ecb_float_to_binary32 (x) ^ 0x80000000U)
963
964=item float ecb_binary16_to_float (uint16_t x) [-UECB_NO_LIBM]
965
966=item float ecb_binary32_to_float (uint32_t x) [-UECB_NO_LIBM]
967
968=item double ecb_binary64_to_double (uint64_t x) [-UECB_NO_LIBM]
969
970The reverse operation of the previous function - takes the bit
971representation of an IEEE binary16, binary32 or binary64 number (half,
972single or double precision) and converts it to the native C<float> or
973C<double> format.
974
975This function should work even when the native floating point format isn't
976IEEE compliant, of course at a speed and code size penalty, and of course
977also within reasonable limits (it tries to convert normals and denormals,
978and might be lucky for infinities, and with extraordinary luck, also for
979negative zero).
980
981On all modern platforms (where C<ECB_STDFP> is true), the compiler should
982be able to optimise away this function completely.
983
984=item uint16_t ecb_binary32_to_binary16 (uint32_t x)
985
986=item uint32_t ecb_binary16_to_binary32 (uint16_t x)
987
988Convert a IEEE binary32/single precision to binary16/half format, and vice
989versa, handling all details (round-to-nearest-even, subnormals, infinity
990and NaNs) correctly.
991
992These are functions are available under C<-DECB_NO_LIBM>, since
993they do not rely on the platform floating point format. The
994C<ecb_float_to_binary16> and C<ecb_binary16_to_float> functions are
995usually what you want.
996
997=back
998
311=head2 ARITHMETIC 999=head2 ARITHMETIC
312 1000
313=over 4 1001=over 4
314 1002
315=item x = ecb_mod (m, n) 1003=item x = ecb_mod (m, n)
316 1004
317Returns the positive remainder of the modulo operation between C<m> and 1005Returns C<m> modulo C<n>, which is the same as the positive remainder
1006of the division operation between C<m> and C<n>, using floored
318C<n>. Unlike the C moduloe operator C<%>, this function ensures that the 1007division. Unlike the C remainder operator C<%>, this function ensures that
319return value is always positive). 1008the return value is always positive and that the two numbers I<m> and
1009I<m' = m + i * n> result in the same value modulo I<n> - in other words,
1010C<ecb_mod> implements the mathematical modulo operation, which is missing
1011in the language.
320 1012
321C<n> must be strictly positive (i.e. C<< >1 >>), while C<m> must be 1013C<n> must be strictly positive (i.e. C<< >= 1 >>), while C<m> must be
322negatable, that is, both C<m> and C<-m> must be representable in its 1014negatable, that is, both C<m> and C<-m> must be representable in its
323type. 1015type (this typically excludes the minimum signed integer value, the same
1016limitation as for C</> and C<%> in C).
1017
1018Current GCC/clang versions compile this into an efficient branchless
1019sequence on almost all CPUs.
1020
1021For example, when you want to rotate forward through the members of an
1022array for increasing C<m> (which might be negative), then you should use
1023C<ecb_mod>, as the C<%> operator might give either negative results, or
1024change direction for negative values:
1025
1026 for (m = -100; m <= 100; ++m)
1027 int elem = myarray [ecb_mod (m, ecb_array_length (myarray))];
1028
1029=item x = ecb_div_rd (val, div)
1030
1031=item x = ecb_div_ru (val, div)
1032
1033Returns C<val> divided by C<div> rounded down or up, respectively.
1034C<val> and C<div> must have integer types and C<div> must be strictly
1035positive. Note that these functions are implemented with macros in C
1036and with function templates in C++.
324 1037
325=back 1038=back
326 1039
327=head2 UTILITY 1040=head2 UTILITY
328 1041
329=over 4 1042=over 4
330 1043
331=item element_count = ecb_array_length (name) [MACRO] 1044=item element_count = ecb_array_length (name)
332 1045
333Returns the number of elements in the array C<name>. For example: 1046Returns the number of elements in the array C<name>. For example:
334 1047
335 int primes[] = { 2, 3, 5, 7, 11 }; 1048 int primes[] = { 2, 3, 5, 7, 11 };
336 int sum = 0; 1049 int sum = 0;
338 for (i = 0; i < ecb_array_length (primes); i++) 1051 for (i = 0; i < ecb_array_length (primes); i++)
339 sum += primes [i]; 1052 sum += primes [i];
340 1053
341=back 1054=back
342 1055
1056=head2 SYMBOLS GOVERNING COMPILATION OF ECB.H ITSELF
343 1057
1058These symbols need to be defined before including F<ecb.h> the first time.
1059
1060=over 4
1061
1062=item ECB_NO_THREADS
1063
1064If F<ecb.h> is never used from multiple threads, then this symbol can
1065be defined, in which case memory fences (and similar constructs) are
1066completely removed, leading to more efficient code and fewer dependencies.
1067
1068Setting this symbol to a true value implies C<ECB_NO_SMP>.
1069
1070=item ECB_NO_SMP
1071
1072The weaker version of C<ECB_NO_THREADS> - if F<ecb.h> is used from
1073multiple threads, but never concurrently (e.g. if the system the program
1074runs on has only a single CPU with a single core, no hyperthreading and so
1075on), then this symbol can be defined, leading to more efficient code and
1076fewer dependencies.
1077
1078=item ECB_NO_LIBM
1079
1080When defined to C<1>, do not export any functions that might introduce
1081dependencies on the math library (usually called F<-lm>) - these are
1082marked with [-UECB_NO_LIBM].
1083
1084=back
1085
1086=head1 UNDOCUMENTED FUNCTIONALITY
1087
1088F<ecb.h> is full of undocumented functionality as well, some of which is
1089intended to be internal-use only, some of which we forgot to document, and
1090some of which we hide because we are not sure we will keep the interface
1091stable.
1092
1093While you are welcome to rummage around and use whatever you find useful
1094(we can't stop you), keep in mind that we will change undocumented
1095functionality in incompatible ways without thinking twice, while we are
1096considerably more conservative with documented things.
1097
1098=head1 AUTHORS
1099
1100C<libecb> is designed and maintained by:
1101
1102 Emanuele Giaquinta <e.giaquinta@glauco.it>
1103 Marc Alexander Lehmann <schmorp@schmorp.de>
1104
1105

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines