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

Comparing libecb/ecb.pod (file contents):
Revision 1.25 by root, Tue May 31 21:52:31 2011 UTC vs.
Revision 1.66 by sf-exg, Fri Feb 20 11:28:08 2015 UTC

54only 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
55the corresponding function relies on C to implement the correct types, and 55the corresponding function relies on C to implement the correct types, and
56is usually implemented as a macro. Specifically, a "bool" in this manual 56is usually implemented as a macro. Specifically, a "bool" in this manual
57refers to any kind of boolean value, not a specific type. 57refers to any kind of boolean value, not a specific type.
58 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_t int16_t uint16_t
64 int32_t uint32_t int64_t uint64_t
65 intptr_t uintptr_t
66
67The macro C<ECB_PTRSIZE> is defined to the size of a pointer on this
68platform (currently C<4> or C<8>) and can be used in preprocessor
69expressions.
70
71For C<ptrdiff_t> and C<size_t> use C<stddef.h>.
72
73=head2 LANGUAGE/ENVIRONMENT/COMPILER VERSIONS
74
75All the following symbols expand to an expression that can be tested in
76preprocessor instructions as well as treated as a boolean (use C<!!> to
77ensure it's either C<0> or C<1> if you need that).
78
79=over 4
80
81=item ECB_C
82
83True if the implementation defines the C<__STDC__> macro to a true value,
84while not claiming to be C++.
85
86=item ECB_C99
87
88True if the implementation claims to be compliant to C99 (ISO/IEC
899899:1999) or any later version, while not claiming to be C++.
90
91Note that later versions (ECB_C11) remove core features again (for
92example, variable length arrays).
93
94=item ECB_C11
95
96True if the implementation claims to be compliant to C11 (ISO/IEC
979899:2011) or any later version, while not claiming to be C++.
98
99=item ECB_CPP
100
101True if the implementation defines the C<__cplusplus__> macro to a true
102value, which is typically true for C++ compilers.
103
104=item ECB_CPP11
105
106True if the implementation claims to be compliant to ISO/IEC 14882:2011
107(C++11) or any later version.
108
109=item ECB_GCC_VERSION (major, minor)
110
111Expands to a true value (suitable for testing in by the preprocessor)
112if the compiler used is GNU C and the version is the given version, or
113higher.
114
115This macro tries to return false on compilers that claim to be GCC
116compatible but aren't.
117
118=item ECB_EXTERN_C
119
120Expands to C<extern "C"> in C++, and a simple C<extern> in C.
121
122This can be used to declare a single external C function:
123
124 ECB_EXTERN_C int printf (const char *format, ...);
125
126=item ECB_EXTERN_C_BEG / ECB_EXTERN_C_END
127
128These two macros can be used to wrap multiple C<extern "C"> definitions -
129they expand to nothing in C.
130
131They are most useful in header files:
132
133 ECB_EXTERN_C_BEG
134
135 int mycfun1 (int x);
136 int mycfun2 (int x);
137
138 ECB_EXTERN_C_END
139
140=item ECB_STDFP
141
142If this evaluates to a true value (suitable for testing in by the
143preprocessor), then C<float> and C<double> use IEEE 754 single/binary32
144and double/binary64 representations internally I<and> the endianness of
145both types match the endianness of C<uint32_t> and C<uint64_t>.
146
147This means you can just copy the bits of a C<float> (or C<double>) to an
148C<uint32_t> (or C<uint64_t>) and get the raw IEEE 754 bit representation
149without having to think about format or endianness.
150
151This is true for basically all modern platforms, although F<ecb.h> might
152not be able to deduce this correctly everywhere and might err on the safe
153side.
154
155=item ECB_AMD64, ECB_AMD64_X32
156
157These two macros are defined to C<1> on the x86_64/amd64 ABI and the X32
158ABI, respectively, and undefined elsewhere.
159
160The designers of the new X32 ABI for some inexplicable reason decided to
161make it look exactly like amd64, even though it's completely incompatible
162to that ABI, breaking about every piece of software that assumed that
163C<__x86_64> stands for, well, the x86-64 ABI, making these macros
164necessary.
165
166=back
167
168=head2 MACRO TRICKERY
169
170=over 4
171
172=item ECB_CONCAT (a, b)
173
174Expands any macros in C<a> and C<b>, then concatenates the result to form
175a single token. This is mainly useful to form identifiers from components,
176e.g.:
177
178 #define S1 str
179 #define S2 cpy
180
181 ECB_CONCAT (S1, S2)(dst, src); // == strcpy (dst, src);
182
183=item ECB_STRINGIFY (arg)
184
185Expands any macros in C<arg> and returns the stringified version of
186it. This is mainly useful to get the contents of a macro in string form,
187e.g.:
188
189 #define SQL_LIMIT 100
190 sql_exec ("select * from table limit " ECB_STRINGIFY (SQL_LIMIT));
191
192=item ECB_STRINGIFY_EXPR (expr)
193
194Like C<ECB_STRINGIFY>, but additionally evaluates C<expr> to make sure it
195is a valid expression. This is useful to catch typos or cases where the
196macro isn't available:
197
198 #include <errno.h>
199
200 ECB_STRINGIFY (EDOM); // "33" (on my system at least)
201 ECB_STRINGIFY_EXPR (EDOM); // "33"
202
203 // now imagine we had a typo:
204
205 ECB_STRINGIFY (EDAM); // "EDAM"
206 ECB_STRINGIFY_EXPR (EDAM); // error: EDAM undefined
207
208=back
209
59=head2 GCC ATTRIBUTES 210=head2 ATTRIBUTES
60 211
61A major part of libecb deals with GCC attributes. These are additional 212A major part of libecb deals with additional attributes that can be
62attributes that you cna assign to functions, variables and sometimes even 213assigned to functions, variables and sometimes even types - much like
63types - much like C<const> or C<volatile> in C. 214C<const> or C<volatile> in C. They are implemented using either GCC
64 215attributes or other compiler/language specific features. Attributes
65While GCC allows declarations to show up in many surprising places,
66but not in many expeted places, the safest way is to put attribute
67declarations before the whole declaration: 216declarations must be put before the whole declaration:
68 217
69 ecb_const int mysqrt (int a); 218 ecb_const int mysqrt (int a);
70 ecb_unused int i; 219 ecb_unused int i;
71 220
72For variables, it is often nicer to put the attribute after the name, and
73avoid multiple declarations using commas:
74
75 int i ecb_unused;
76
77=over 4 221=over 4
78
79=item ecb_attribute ((attrs...))
80
81A simple wrapper that expands to C<__attribute__((attrs))> on GCC, and to
82nothing on other compilers, so the effect is that only GCC sees these.
83
84Example: use the C<deprecated> attribute on a function.
85
86 ecb_attribute((__deprecated__)) void
87 do_not_use_me_anymore (void);
88 222
89=item ecb_unused 223=item ecb_unused
90 224
91Marks a function or a variable as "unused", which simply suppresses a 225Marks a function or a variable as "unused", which simply suppresses a
92warning by GCC when it detects it as unused. This is useful when you e.g. 226warning by GCC when it detects it as unused. This is useful when you e.g.
93declare a variable but do not always use it: 227declare a variable but do not always use it:
94 228
95 { 229 {
96 int var ecb_unused; 230 ecb_unused int var;
97 231
98 #ifdef SOMECONDITION 232 #ifdef SOMECONDITION
99 var = ...; 233 var = ...;
100 return var; 234 return var;
101 #else 235 #else
102 return 0; 236 return 0;
103 #endif 237 #endif
104 } 238 }
105 239
240=item ecb_deprecated
241
242Similar to C<ecb_unused>, but marks a function, variable or type as
243deprecated. This makes some compilers warn when the type is used.
244
245=item ecb_deprecated_message (message)
246
247Same as C<ecb_deprecated>, but if possible, supplies a diagnostic that is
248used instead of a generic depreciation message when the object is being
249used.
250
251=item ecb_inline
252
253Expands either to C<static inline> or to just C<static>, if inline
254isn't supported. It should be used to declare functions that should be
255inlined, for code size or speed reasons.
256
257Example: inline this function, it surely will reduce codesize.
258
259 ecb_inline int
260 negmul (int a, int b)
261 {
262 return - (a * b);
263 }
264
106=item ecb_noinline 265=item ecb_noinline
107 266
108Prevent a function from being inlined - it might be optimised away, but 267Prevents a function from being inlined - it might be optimised away, but
109not inlined into other functions. This is useful if you know your function 268not inlined into other functions. This is useful if you know your function
110is rarely called and large enough for inlining not to be helpful. 269is rarely called and large enough for inlining not to be helpful.
111 270
112=item ecb_noreturn 271=item ecb_noreturn
113 272
123 } 282 }
124 283
125In this case, the compiler would probably be smart enough to deduce it on 284In this case, the compiler would probably be smart enough to deduce it on
126its own, so this is mainly useful for declarations. 285its own, so this is mainly useful for declarations.
127 286
287=item ecb_restrict
288
289Expands to the C<restrict> keyword or equivalent on compilers that support
290them, and to nothing on others. Must be specified on a pointer type or
291an array index to indicate that the memory doesn't alias with any other
292restricted pointer in the same scope.
293
294Example: multiply a vector, and allow the compiler to parallelise the
295loop, because it knows it doesn't overwrite input values.
296
297 void
298 multiply (ecb_restrict float *src,
299 ecb_restrict float *dst,
300 int len, float factor)
301 {
302 int i;
303
304 for (i = 0; i < len; ++i)
305 dst [i] = src [i] * factor;
306 }
307
128=item ecb_const 308=item ecb_const
129 309
130Declares that the function only depends on the values of its arguments, 310Declares that the function only depends on the values of its arguments,
131much like a mathematical function. It specifically does not read or write 311much like a mathematical function. It specifically does not read or write
132any memory any arguments might point to, global variables, or call any 312any memory any arguments might point to, global variables, or call any
184 364
185In addition to placing cold functions together (or at least away from hot 365In addition to placing cold functions together (or at least away from hot
186functions), this knowledge can be used in other ways, for example, the 366functions), this knowledge can be used in other ways, for example, the
187function will be optimised for size, as opposed to speed, and codepaths 367function will be optimised for size, as opposed to speed, and codepaths
188leading to calls to those functions can automatically be marked as if 368leading to calls to those functions can automatically be marked as if
189C<ecb_unlikely> had been used to reach them. 369C<ecb_expect_false> had been used to reach them.
190 370
191Good examples for such functions would be error reporting functions, or 371Good examples for such functions would be error reporting functions, or
192functions only called in exceptional or rare cases. 372functions only called in exceptional or rare cases.
193 373
194=item ecb_artificial 374=item ecb_artificial
195 375
196Declares the function as "artificial", in this case meaning that this 376Declares the function as "artificial", in this case meaning that this
197function is not really mean to be a function, but more like an accessor 377function is not really meant to be a function, but more like an accessor
198- many methods in C++ classes are mere accessor functions, and having a 378- many methods in C++ classes are mere accessor functions, and having a
199crash reported in such a method, or single-stepping through them, is not 379crash reported in such a method, or single-stepping through them, is not
200usually so helpful, especially when it's inlined to just a few instructions. 380usually so helpful, especially when it's inlined to just a few instructions.
201 381
202Marking them as artificial will instruct the debugger about just this, 382Marking them as artificial will instruct the debugger about just this,
222 402
223=head2 OPTIMISATION HINTS 403=head2 OPTIMISATION HINTS
224 404
225=over 4 405=over 4
226 406
227=item bool ecb_is_constant(expr) 407=item bool ecb_is_constant (expr)
228 408
229Returns true iff the expression can be deduced to be a compile-time 409Returns true iff the expression can be deduced to be a compile-time
230constant, and false otherwise. 410constant, and false otherwise.
231 411
232For example, when you have a C<rndm16> function that returns a 16 bit 412For example, when you have a C<rndm16> function that returns a 16 bit
250 return is_constant (n) && !(n & (n - 1)) 430 return is_constant (n) && !(n & (n - 1))
251 ? rndm16 () & (num - 1) 431 ? rndm16 () & (num - 1)
252 : (n * (uint32_t)rndm16 ()) >> 16; 432 : (n * (uint32_t)rndm16 ()) >> 16;
253 } 433 }
254 434
255=item bool ecb_expect (expr, value) 435=item ecb_expect (expr, value)
256 436
257Evaluates C<expr> and returns it. In addition, it tells the compiler that 437Evaluates C<expr> and returns it. In addition, it tells the compiler that
258the C<expr> evaluates to C<value> a lot, which can be used for static 438the C<expr> evaluates to C<value> a lot, which can be used for static
259branch optimisations. 439branch optimisations.
260 440
261Usually, you want to use the more intuitive C<ecb_likely> and 441Usually, you want to use the more intuitive C<ecb_expect_true> and
262C<ecb_unlikely> functions instead. 442C<ecb_expect_false> functions instead.
263 443
444=item bool ecb_expect_true (cond)
445
264=item bool ecb_likely (cond) 446=item bool ecb_expect_false (cond)
265
266=item bool ecb_unlikely (cond)
267 447
268These two functions expect a expression that is true or false and return 448These two functions expect a expression that is true or false and return
269C<1> or C<0>, respectively, so when used in the condition of an C<if> or 449C<1> or C<0>, respectively, so when used in the condition of an C<if> or
270other conditional statement, it will not change the program: 450other conditional statement, it will not change the program:
271 451
272 /* these two do the same thing */ 452 /* these two do the same thing */
273 if (some_condition) ...; 453 if (some_condition) ...;
274 if (ecb_likely (some_condition)) ...; 454 if (ecb_expect_true (some_condition)) ...;
275 455
276However, by using C<ecb_likely>, you tell the compiler that the condition 456However, by using C<ecb_expect_true>, you tell the compiler that the
277is likely to be true (and for C<ecb_unlikely>, that it is unlikely to be 457condition is likely to be true (and for C<ecb_expect_false>, that it is
278true). 458unlikely to be true).
279 459
280For example, when you check for a null pointer and expect this to be a 460For example, when you check for a null pointer and expect this to be a
281rare, exceptional, case, then use C<ecb_unlikely>: 461rare, exceptional, case, then use C<ecb_expect_false>:
282 462
283 void my_free (void *ptr) 463 void my_free (void *ptr)
284 { 464 {
285 if (ecb_unlikely (ptr == 0)) 465 if (ecb_expect_false (ptr == 0))
286 return; 466 return;
287 } 467 }
288 468
289Consequent use of these functions to mark away exceptional cases or to 469Consequent use of these functions to mark away exceptional cases or to
290tell the compiler what the hot path through a function is can increase 470tell the compiler what the hot path through a function is can increase
291performance considerably. 471performance considerably.
472
473You might know these functions under the name C<likely> and C<unlikely>
474- while these are common aliases, we find that the expect name is easier
475to understand when quickly skimming code. If you wish, you can use
476C<ecb_likely> instead of C<ecb_expect_true> and C<ecb_unlikely> instead of
477C<ecb_expect_false> - these are simply aliases.
292 478
293A very good example is in a function that reserves more space for some 479A very good example is in a function that reserves more space for some
294memory block (for example, inside an implementation of a string stream) - 480memory block (for example, inside an implementation of a string stream) -
295each time something is added, you have to check for a buffer overrun, but 481each time something is added, you have to check for a buffer overrun, but
296you expect that most checks will turn out to be false: 482you expect that most checks will turn out to be false:
297 483
298 /* make sure we have "size" extra room in our buffer */ 484 /* make sure we have "size" extra room in our buffer */
299 ecb_inline void 485 ecb_inline void
300 reserve (int size) 486 reserve (int size)
301 { 487 {
302 if (ecb_unlikely (current + size > end)) 488 if (ecb_expect_false (current + size > end))
303 real_reserve_method (size); /* presumably noinline */ 489 real_reserve_method (size); /* presumably noinline */
304 } 490 }
305 491
306=item bool ecb_assume (cond) 492=item ecb_assume (cond)
307 493
308Try to tell the compiler that some condition is true, even if it's not 494Tries to tell the compiler that some condition is true, even if it's not
309obvious. 495obvious. This is not a function, but a statement: it cannot be used in
496another expression.
310 497
311This can be used to teach the compiler about invariants or other 498This can be used to teach the compiler about invariants or other
312conditions that might improve code generation, but which are impossible to 499conditions that might improve code generation, but which are impossible to
313deduce form the code itself. 500deduce form the code itself.
314 501
315For example, the example reservation function from the C<ecb_unlikely> 502For example, the example reservation function from the C<ecb_expect_false>
316description could be written thus (only C<ecb_assume> was added): 503description could be written thus (only C<ecb_assume> was added):
317 504
318 ecb_inline void 505 ecb_inline void
319 reserve (int size) 506 reserve (int size)
320 { 507 {
321 if (ecb_unlikely (current + size > end)) 508 if (ecb_expect_false (current + size > end))
322 real_reserve_method (size); /* presumably noinline */ 509 real_reserve_method (size); /* presumably noinline */
323 510
324 ecb_assume (current + size <= end); 511 ecb_assume (current + size <= end);
325 } 512 }
326 513
331 518
332Then the compiler I<might> be able to optimise out the second call 519Then the compiler I<might> be able to optimise out the second call
333completely, as it knows that C<< current + 1 > end >> is false and the 520completely, as it knows that C<< current + 1 > end >> is false and the
334call will never be executed. 521call will never be executed.
335 522
336=item bool ecb_unreachable () 523=item ecb_unreachable ()
337 524
338This function does nothing itself, except tell the compiler that it will 525This function does nothing itself, except tell the compiler that it will
339never be executed. Apart from suppressing a warning in some cases, this 526never be executed. Apart from suppressing a warning in some cases, this
340function can be used to implement C<ecb_assume> or similar functions. 527function can be used to implement C<ecb_assume> or similar functionality.
341 528
342=item bool ecb_prefetch (addr, rw, locality) 529=item ecb_prefetch (addr, rw, locality)
343 530
344Tells the compiler to try to prefetch memory at the given C<addr>ess 531Tells the compiler to try to prefetch memory at the given C<addr>ess
345for either reading (C<rw> = 0) or writing (C<rw> = 1). A C<locality> of 532for either reading (C<rw> = 0) or writing (C<rw> = 1). A C<locality> of
346C<0> means that there will only be one access later, C<3> means that 533C<0> means that there will only be one access later, C<3> means that
347the data will likely be accessed very often, and values in between mean 534the data will likely be accessed very often, and values in between mean
348something... in between. The memory pointed to by the address does not 535something... in between. The memory pointed to by the address does not
349need to be accessible (it could be a null pointer for example), but C<rw> 536need to be accessible (it could be a null pointer for example), but C<rw>
350and C<locality> must be compile-time constants. 537and C<locality> must be compile-time constants.
351 538
539This is a statement, not a function: you cannot use it as part of an
540expression.
541
352An obvious way to use this is to prefetch some data far away, in a big 542An obvious way to use this is to prefetch some data far away, in a big
353array you loop over. This prefetches memory some 128 array elements later, 543array you loop over. This prefetches memory some 128 array elements later,
354in the hope that it will be ready when the CPU arrives at that location. 544in the hope that it will be ready when the CPU arrives at that location.
355 545
356 int sum = 0; 546 int sum = 0;
375After processing the node, (part of) the next node might already be in 565After processing the node, (part of) the next node might already be in
376cache. 566cache.
377 567
378=back 568=back
379 569
380=head2 BIT FIDDLING / BITSTUFFS 570=head2 BIT FIDDLING / BIT WIZARDRY
381 571
382=over 4 572=over 4
383 573
384=item bool ecb_big_endian () 574=item bool ecb_big_endian ()
385 575
391 581
392On systems that are neither, their return values are unspecified. 582On systems that are neither, their return values are unspecified.
393 583
394=item int ecb_ctz32 (uint32_t x) 584=item int ecb_ctz32 (uint32_t x)
395 585
586=item int ecb_ctz64 (uint64_t x)
587
396Returns the index of the least significant bit set in C<x> (or 588Returns the index of the least significant bit set in C<x> (or
397equivalently the number of bits set to 0 before the least significant bit 589equivalently the number of bits set to 0 before the least significant bit
398set), starting from 0. If C<x> is 0 the result is undefined. A common use 590set), starting from 0. If C<x> is 0 the result is undefined.
399case is to compute the integer binary logarithm, i.e., C<floor (log2 591
592For smaller types than C<uint32_t> you can safely use C<ecb_ctz32>.
593
400(n))>. For example: 594For example:
401 595
402 ecb_ctz32 (3) = 0 596 ecb_ctz32 (3) = 0
403 ecb_ctz32 (6) = 1 597 ecb_ctz32 (6) = 1
404 598
599=item bool ecb_is_pot32 (uint32_t x)
600
601=item bool ecb_is_pot64 (uint32_t x)
602
603Returns true iff C<x> is a power of two or C<x == 0>.
604
605For smaller types than C<uint32_t> you can safely use C<ecb_is_pot32>.
606
607=item int ecb_ld32 (uint32_t x)
608
609=item int ecb_ld64 (uint64_t x)
610
611Returns the index of the most significant bit set in C<x>, or the number
612of digits the number requires in binary (so that C<< 2**ld <= x <
6132**(ld+1) >>). If C<x> is 0 the result is undefined. A common use case is
614to compute the integer binary logarithm, i.e. C<floor (log2 (n))>, for
615example to see how many bits a certain number requires to be encoded.
616
617This function is similar to the "count leading zero bits" function, except
618that that one returns how many zero bits are "in front" of the number (in
619the given data type), while C<ecb_ld> returns how many bits the number
620itself requires.
621
622For smaller types than C<uint32_t> you can safely use C<ecb_ld32>.
623
405=item int ecb_popcount32 (uint32_t x) 624=item int ecb_popcount32 (uint32_t x)
406 625
626=item int ecb_popcount64 (uint64_t x)
627
407Returns the number of bits set to 1 in C<x>. For example: 628Returns the number of bits set to 1 in C<x>.
629
630For smaller types than C<uint32_t> you can safely use C<ecb_popcount32>.
631
632For example:
408 633
409 ecb_popcount32 (7) = 3 634 ecb_popcount32 (7) = 3
410 ecb_popcount32 (255) = 8 635 ecb_popcount32 (255) = 8
411 636
637=item uint8_t ecb_bitrev8 (uint8_t x)
638
639=item uint16_t ecb_bitrev16 (uint16_t x)
640
641=item uint32_t ecb_bitrev32 (uint32_t x)
642
643Reverses the bits in x, i.e. the MSB becomes the LSB, MSB-1 becomes LSB+1
644and so on.
645
646Example:
647
648 ecb_bitrev8 (0xa7) = 0xea
649 ecb_bitrev32 (0xffcc4411) = 0x882233ff
650
412=item uint32_t ecb_bswap16 (uint32_t x) 651=item uint32_t ecb_bswap16 (uint32_t x)
413 652
414=item uint32_t ecb_bswap32 (uint32_t x) 653=item uint32_t ecb_bswap32 (uint32_t x)
415 654
655=item uint64_t ecb_bswap64 (uint64_t x)
656
416These two functions return the value of the 16-bit (32-bit) value C<x> 657These functions return the value of the 16-bit (32-bit, 64-bit) value
417after reversing the order of bytes (0x11223344 becomes 0x44332211). 658C<x> after reversing the order of bytes (0x11223344 becomes 0x44332211 in
659C<ecb_bswap32>).
660
661=item uint8_t ecb_rotl8 (uint8_t x, unsigned int count)
662
663=item uint16_t ecb_rotl16 (uint16_t x, unsigned int count)
664
665=item uint32_t ecb_rotl32 (uint32_t x, unsigned int count)
666
667=item uint64_t ecb_rotl64 (uint64_t x, unsigned int count)
668
669=item uint8_t ecb_rotr8 (uint8_t x, unsigned int count)
670
671=item uint16_t ecb_rotr16 (uint16_t x, unsigned int count)
418 672
419=item uint32_t ecb_rotr32 (uint32_t x, unsigned int count) 673=item uint32_t ecb_rotr32 (uint32_t x, unsigned int count)
420 674
421=item uint32_t ecb_rotl32 (uint32_t x, unsigned int count) 675=item uint64_t ecb_rotr64 (uint64_t x, unsigned int count)
422 676
423These two functions return the value of C<x> after rotating all the bits 677These two families of functions return the value of C<x> after rotating
424by C<count> positions to the right or left respectively. 678all the bits by C<count> positions to the right (C<ecb_rotr>) or left
679(C<ecb_rotl>).
425 680
426Current GCC versions understand these functions and usually compile them 681Current GCC versions understand these functions and usually compile them
427to "optimal" code (e.g. a single C<roll> on x86). 682to "optimal" code (e.g. a single C<rol> or a combination of C<shld> on
683x86).
684
685=back
686
687=head2 FLOATING POINT FIDDLING
688
689=over 4
690
691=item ECB_INFINITY
692
693Evaluates to positive infinity if supported by the platform, otherwise to
694a truly huge number.
695
696=item ECB_NAN
697
698Evaluates to a quiet NAN if supported by the platform, otherwise to
699C<ECB_INFINITY>.
700
701=item float ecb_ldexpf (float x, int exp)
702
703Same as C<ldexpf>, but always available.
704
705=item uint32_t ecb_float_to_binary32 (float x) [-UECB_NO_LIBM]
706
707=item uint64_t ecb_double_to_binary64 (double x) [-UECB_NO_LIBM]
708
709These functions each take an argument in the native C<float> or C<double>
710type and return the IEEE 754 bit representation of it.
711
712The bit representation is just as IEEE 754 defines it, i.e. the sign bit
713will be the most significant bit, followed by exponent and mantissa.
714
715This function should work even when the native floating point format isn't
716IEEE compliant, of course at a speed and code size penalty, and of course
717also within reasonable limits (it tries to convert NaNs, infinities and
718denormals, but will likely convert negative zero to positive zero).
719
720On all modern platforms (where C<ECB_STDFP> is true), the compiler should
721be able to optimise away this function completely.
722
723These functions can be helpful when serialising floats to the network - you
724can serialise the return value like a normal uint32_t/uint64_t.
725
726Another use for these functions is to manipulate floating point values
727directly.
728
729Silly example: toggle the sign bit of a float.
730
731 /* On gcc-4.7 on amd64, */
732 /* this results in a single add instruction to toggle the bit, and 4 extra */
733 /* instructions to move the float value to an integer register and back. */
734
735 x = ecb_binary32_to_float (ecb_float_to_binary32 (x) ^ 0x80000000U)
736
737=item float ecb_binary16_to_float (uint16_t x) [-UECB_NO_LIBM]
738
739=item float ecb_binary32_to_float (uint32_t x) [-UECB_NO_LIBM]
740
741=item double ecb_binary32_to_double (uint64_t x) [-UECB_NO_LIBM]
742
743The reverse operation of the previous function - takes the bit
744representation of an IEEE binary16, binary32 or binary64 number and
745converts it to the native C<float> or C<double> format.
746
747This function should work even when the native floating point format isn't
748IEEE compliant, of course at a speed and code size penalty, and of course
749also within reasonable limits (it tries to convert normals and denormals,
750and might be lucky for infinities, and with extraordinary luck, also for
751negative zero).
752
753On all modern platforms (where C<ECB_STDFP> is true), the compiler should
754be able to optimise away this function completely.
428 755
429=back 756=back
430 757
431=head2 ARITHMETIC 758=head2 ARITHMETIC
432 759
442C<ecb_mod> implements the mathematical modulo operation, which is missing 769C<ecb_mod> implements the mathematical modulo operation, which is missing
443in the language. 770in the language.
444 771
445C<n> must be strictly positive (i.e. C<< >= 1 >>), while C<m> must be 772C<n> must be strictly positive (i.e. C<< >= 1 >>), while C<m> must be
446negatable, that is, both C<m> and C<-m> must be representable in its 773negatable, that is, both C<m> and C<-m> must be representable in its
447type (this typically includes the minimum signed integer value, the same 774type (this typically excludes the minimum signed integer value, the same
448limitation as for C</> and C<%> in C). 775limitation as for C</> and C<%> in C).
449 776
450Current GCC versions compile this into an efficient branchless sequence on 777Current GCC versions compile this into an efficient branchless sequence on
451many systems. 778almost all CPUs.
452 779
453For example, when you want to rotate forward through the members of an 780For example, when you want to rotate forward through the members of an
454array for increasing C<m> (which might be negative), then you should use 781array for increasing C<m> (which might be negative), then you should use
455C<ecb_mod>, as the C<%> operator might give either negative results, or 782C<ecb_mod>, as the C<%> operator might give either negative results, or
456change direction for negative values: 783change direction for negative values:
457 784
458 for (m = -100; m <= 100; ++m) 785 for (m = -100; m <= 100; ++m)
459 int elem = myarray [ecb_mod (m, ecb_array_length (myarray))]; 786 int elem = myarray [ecb_mod (m, ecb_array_length (myarray))];
460 787
788=item x = ecb_div_rd (val, div)
789
790=item x = ecb_div_ru (val, div)
791
792Returns C<val> divided by C<div> rounded down or up, respectively.
793C<val> and C<div> must have integer types and C<div> must be strictly
794positive. Note that these functions are implemented with macros in C
795and with function templates in C++.
796
461=back 797=back
462 798
463=head2 UTILITY 799=head2 UTILITY
464 800
465=over 4 801=over 4
474 for (i = 0; i < ecb_array_length (primes); i++) 810 for (i = 0; i < ecb_array_length (primes); i++)
475 sum += primes [i]; 811 sum += primes [i];
476 812
477=back 813=back
478 814
815=head2 SYMBOLS GOVERNING COMPILATION OF ECB.H ITSELF
479 816
817These symbols need to be defined before including F<ecb.h> the first time.
818
819=over 4
820
821=item ECB_NO_THREADS
822
823If F<ecb.h> is never used from multiple threads, then this symbol can
824be defined, in which case memory fences (and similar constructs) are
825completely removed, leading to more efficient code and fewer dependencies.
826
827Setting this symbol to a true value implies C<ECB_NO_SMP>.
828
829=item ECB_NO_SMP
830
831The weaker version of C<ECB_NO_THREADS> - if F<ecb.h> is used from
832multiple threads, but never concurrently (e.g. if the system the program
833runs on has only a single CPU with a single core, no hyperthreading and so
834on), then this symbol can be defined, leading to more efficient code and
835fewer dependencies.
836
837=item ECB_NO_LIBM
838
839When defined to C<1>, do not export any functions that might introduce
840dependencies on the math library (usually called F<-lm>) - these are
841marked with [-UECB_NO_LIBM].
842
843=back
844
845

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines