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.21 by root, Fri May 27 00:14:10 2011 UTC vs.
Revision 1.62 by root, Wed Feb 18 20:29:27 2015 UTC

15It mainly provides a number of wrappers around GCC built-ins, together 15It mainly provides a number of wrappers around GCC built-ins, together
16with replacement functions for other compilers. In addition to this, 16with replacement functions for other compilers. In addition to this,
17it provides a number of other lowlevel C utilities, such as endianness 17it provides a number of other lowlevel C utilities, such as endianness
18detection, byte swapping or bit rotations. 18detection, byte swapping or bit rotations.
19 19
20Or in other words, things that should be built-in into any standard C 20Or in other words, things that should be built into any standard C system,
21system, but aren't. 21but aren't, implemented as efficient as possible with GCC, and still
22correct with other compilers.
22 23
23More might come. 24More might come.
24 25
25=head2 ABOUT THE HEADER 26=head2 ABOUT THE HEADER
26 27
53only 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
54the corresponding function relies on C to implement the correct types, and 55the corresponding function relies on C to implement the correct types, and
55is usually implemented as a macro. Specifically, a "bool" in this manual 56is usually implemented as a macro. Specifically, a "bool" in this manual
56refers to any kind of boolean value, not a specific type. 57refers to any kind of boolean value, not a specific type.
57 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=back
193
58=head2 GCC ATTRIBUTES 194=head2 ATTRIBUTES
59 195
60A major part of libecb deals with GCC attributes. These are additional 196A major part of libecb deals with additional attributes that can be
61attributes that you cna assign to functions, variables and sometimes even 197assigned to functions, variables and sometimes even types - much like
62types - much like C<const> or C<volatile> in C. 198C<const> or C<volatile> in C. They are implemented using either GCC
63 199attributes or other compiler/language specific features. Attributes
64While GCC allows declarations to show up in many surprising places,
65but not in many expeted places, the safest way is to put attribute
66declarations before the whole declaration: 200declarations must be put before the whole declaration:
67 201
68 ecb_const int mysqrt (int a); 202 ecb_const int mysqrt (int a);
69 ecb_unused int i; 203 ecb_unused int i;
70 204
71For variables, it is often nicer to put the attribute after the name, and
72avoid multiple declarations using commas:
73
74 int i ecb_unused;
75
76=over 4 205=over 4
77
78=item ecb_attribute ((attrs...))
79
80A simple wrapper that expands to C<__attribute__((attrs))> on GCC, and to
81nothing on other compilers, so the effect is that only GCC sees these.
82
83Example: use the C<deprecated> attribute on a function.
84
85 ecb_attribute((__deprecated__)) void
86 do_not_use_me_anymore (void);
87 206
88=item ecb_unused 207=item ecb_unused
89 208
90Marks a function or a variable as "unused", which simply suppresses a 209Marks a function or a variable as "unused", which simply suppresses a
91warning by GCC when it detects it as unused. This is useful when you e.g. 210warning by GCC when it detects it as unused. This is useful when you e.g.
92declare a variable but do not always use it: 211declare a variable but do not always use it:
93 212
94 { 213 {
95 int var ecb_unused; 214 ecb_unused int var;
96 215
97 #ifdef SOMECONDITION 216 #ifdef SOMECONDITION
98 var = ...; 217 var = ...;
99 return var; 218 return var;
100 #else 219 #else
101 return 0; 220 return 0;
102 #endif 221 #endif
103 } 222 }
104 223
224=item ecb_deprecated
225
226Similar to C<ecb_unused>, but marks a function, variable or type as
227deprecated. This makes some compilers warn when the type is used.
228
229=item ecb_deprecated_message (message)
230
231Same as C<ecb_deprecated>, but if possible, supply a diagnostic that is
232used instead of a generic depreciation message when the object is being
233used.
234
235=item ecb_inline
236
237Expands either to C<static inline> or to just C<static>, if inline
238isn't supported. It should be used to declare functions that should be
239inlined, for code size or speed reasons.
240
241Example: inline this function, it surely will reduce codesize.
242
243 ecb_inline int
244 negmul (int a, int b)
245 {
246 return - (a * b);
247 }
248
105=item ecb_noinline 249=item ecb_noinline
106 250
107Prevent a function from being inlined - it might be optimised away, but 251Prevent a function from being inlined - it might be optimised away, but
108not inlined into other functions. This is useful if you know your function 252not inlined into other functions. This is useful if you know your function
109is rarely called and large enough for inlining not to be helpful. 253is rarely called and large enough for inlining not to be helpful.
122 } 266 }
123 267
124In this case, the compiler would probably be smart enough to deduce it on 268In this case, the compiler would probably be smart enough to deduce it on
125its own, so this is mainly useful for declarations. 269its own, so this is mainly useful for declarations.
126 270
271=item ecb_restrict
272
273Expands to the C<restrict> keyword or equivalent on compilers that support
274them, and to nothing on others. Must be specified on a pointer type or
275an array index to indicate that the memory doesn't alias with any other
276restricted pointer in the same scope.
277
278Example: multiply a vector, and allow the compiler to parallelise the
279loop, because it knows it doesn't overwrite input values.
280
281 void
282 multiply (ecb_restrict float *src,
283 ecb_restrict float *dst,
284 int len, float factor)
285 {
286 int i;
287
288 for (i = 0; i < len; ++i)
289 dst [i] = src [i] * factor;
290 }
291
127=item ecb_const 292=item ecb_const
128 293
129Declares that the function only depends on the values of its arguments, 294Declares that the function only depends on the values of its arguments,
130much like a mathematical function. It specifically does not read or write 295much like a mathematical function. It specifically does not read or write
131any memory any arguments might point to, global variables, or call any 296any memory any arguments might point to, global variables, or call any
183 348
184In addition to placing cold functions together (or at least away from hot 349In addition to placing cold functions together (or at least away from hot
185functions), this knowledge can be used in other ways, for example, the 350functions), this knowledge can be used in other ways, for example, the
186function will be optimised for size, as opposed to speed, and codepaths 351function will be optimised for size, as opposed to speed, and codepaths
187leading to calls to those functions can automatically be marked as if 352leading to calls to those functions can automatically be marked as if
188C<ecb_unlikely> had been used to reach them. 353C<ecb_expect_false> had been used to reach them.
189 354
190Good examples for such functions would be error reporting functions, or 355Good examples for such functions would be error reporting functions, or
191functions only called in exceptional or rare cases. 356functions only called in exceptional or rare cases.
192 357
193=item ecb_artificial 358=item ecb_artificial
194 359
195Declares the function as "artificial", in this case meaning that this 360Declares the function as "artificial", in this case meaning that this
196function is not really mean to be a function, but more like an accessor 361function is not really meant to be a function, but more like an accessor
197- many methods in C++ classes are mere accessor functions, and having a 362- many methods in C++ classes are mere accessor functions, and having a
198crash reported in such a method, or single-stepping through them, is not 363crash reported in such a method, or single-stepping through them, is not
199usually so helpful, especially when it's inlined to just a few instructions. 364usually so helpful, especially when it's inlined to just a few instructions.
200 365
201Marking them as artificial will instruct the debugger about just this, 366Marking them as artificial will instruct the debugger about just this,
221 386
222=head2 OPTIMISATION HINTS 387=head2 OPTIMISATION HINTS
223 388
224=over 4 389=over 4
225 390
226=item bool ecb_is_constant(expr) 391=item bool ecb_is_constant (expr)
227 392
228Returns true iff the expression can be deduced to be a compile-time 393Returns true iff the expression can be deduced to be a compile-time
229constant, and false otherwise. 394constant, and false otherwise.
230 395
231For example, when you have a C<rndm16> function that returns a 16 bit 396For example, when you have a C<rndm16> function that returns a 16 bit
249 return is_constant (n) && !(n & (n - 1)) 414 return is_constant (n) && !(n & (n - 1))
250 ? rndm16 () & (num - 1) 415 ? rndm16 () & (num - 1)
251 : (n * (uint32_t)rndm16 ()) >> 16; 416 : (n * (uint32_t)rndm16 ()) >> 16;
252 } 417 }
253 418
254=item bool ecb_expect (expr, value) 419=item ecb_expect (expr, value)
255 420
256Evaluates C<expr> and returns it. In addition, it tells the compiler that 421Evaluates C<expr> and returns it. In addition, it tells the compiler that
257the C<expr> evaluates to C<value> a lot, which can be used for static 422the C<expr> evaluates to C<value> a lot, which can be used for static
258branch optimisations. 423branch optimisations.
259 424
260Usually, you want to use the more intuitive C<ecb_likely> and 425Usually, you want to use the more intuitive C<ecb_expect_true> and
261C<ecb_unlikely> functions instead. 426C<ecb_expect_false> functions instead.
262 427
428=item bool ecb_expect_true (cond)
429
263=item bool ecb_likely (cond) 430=item bool ecb_expect_false (cond)
264
265=item bool ecb_unlikely (cond)
266 431
267These two functions expect a expression that is true or false and return 432These two functions expect a expression that is true or false and return
268C<1> or C<0>, respectively, so when used in the condition of an C<if> or 433C<1> or C<0>, respectively, so when used in the condition of an C<if> or
269other conditional statement, it will not change the program: 434other conditional statement, it will not change the program:
270 435
271 /* these two do the same thing */ 436 /* these two do the same thing */
272 if (some_condition) ...; 437 if (some_condition) ...;
273 if (ecb_likely (some_condition)) ...; 438 if (ecb_expect_true (some_condition)) ...;
274 439
275However, by using C<ecb_likely>, you tell the compiler that the condition 440However, by using C<ecb_expect_true>, you tell the compiler that the
276is likely to be true (and for C<ecb_unlikely>, that it is unlikely to be 441condition is likely to be true (and for C<ecb_expect_false>, that it is
277true). 442unlikely to be true).
278 443
279For example, when you check for a null pointer and expect this to be a 444For example, when you check for a null pointer and expect this to be a
280rare, exceptional, case, then use C<ecb_unlikely>: 445rare, exceptional, case, then use C<ecb_expect_false>:
281 446
282 void my_free (void *ptr) 447 void my_free (void *ptr)
283 { 448 {
284 if (ecb_unlikely (ptr == 0)) 449 if (ecb_expect_false (ptr == 0))
285 return; 450 return;
286 } 451 }
287 452
288Consequent use of these functions to mark away exceptional cases or to 453Consequent use of these functions to mark away exceptional cases or to
289tell the compiler what the hot path through a function is can increase 454tell the compiler what the hot path through a function is can increase
290performance considerably. 455performance considerably.
456
457You might know these functions under the name C<likely> and C<unlikely>
458- while these are common aliases, we find that the expect name is easier
459to understand when quickly skimming code. If you wish, you can use
460C<ecb_likely> instead of C<ecb_expect_true> and C<ecb_unlikely> instead of
461C<ecb_expect_false> - these are simply aliases.
291 462
292A very good example is in a function that reserves more space for some 463A very good example is in a function that reserves more space for some
293memory block (for example, inside an implementation of a string stream) - 464memory block (for example, inside an implementation of a string stream) -
294each time something is added, you have to check for a buffer overrun, but 465each time something is added, you have to check for a buffer overrun, but
295you expect that most checks will turn out to be false: 466you expect that most checks will turn out to be false:
296 467
297 /* make sure we have "size" extra room in our buffer */ 468 /* make sure we have "size" extra room in our buffer */
298 ecb_inline void 469 ecb_inline void
299 reserve (int size) 470 reserve (int size)
300 { 471 {
301 if (ecb_unlikely (current + size > end)) 472 if (ecb_expect_false (current + size > end))
302 real_reserve_method (size); /* presumably noinline */ 473 real_reserve_method (size); /* presumably noinline */
303 } 474 }
304 475
305=item bool ecb_assume (cond) 476=item ecb_assume (cond)
306 477
307Try to tell the compiler that some condition is true, even if it's not 478Try to tell the compiler that some condition is true, even if it's not
308obvious. 479obvious.
309 480
310This can be used to teach the compiler about invariants or other 481This can be used to teach the compiler about invariants or other
311conditions that might improve code generation, but which are impossible to 482conditions that might improve code generation, but which are impossible to
312deduce form the code itself. 483deduce form the code itself.
313 484
314For example, the example reservation function from the C<ecb_unlikely> 485For example, the example reservation function from the C<ecb_expect_false>
315description could be written thus (only C<ecb_assume> was added): 486description could be written thus (only C<ecb_assume> was added):
316 487
317 ecb_inline void 488 ecb_inline void
318 reserve (int size) 489 reserve (int size)
319 { 490 {
320 if (ecb_unlikely (current + size > end)) 491 if (ecb_expect_false (current + size > end))
321 real_reserve_method (size); /* presumably noinline */ 492 real_reserve_method (size); /* presumably noinline */
322 493
323 ecb_assume (current + size <= end); 494 ecb_assume (current + size <= end);
324 } 495 }
325 496
330 501
331Then the compiler I<might> be able to optimise out the second call 502Then the compiler I<might> be able to optimise out the second call
332completely, as it knows that C<< current + 1 > end >> is false and the 503completely, as it knows that C<< current + 1 > end >> is false and the
333call will never be executed. 504call will never be executed.
334 505
335=item bool ecb_unreachable () 506=item ecb_unreachable ()
336 507
337This function does nothing itself, except tell the compiler that it will 508This function does nothing itself, except tell the compiler that it will
338never be executed. Apart from suppressing a warning in some cases, this 509never be executed. Apart from suppressing a warning in some cases, this
339function can be used to implement C<ecb_assume> or similar functions. 510function can be used to implement C<ecb_assume> or similar functions.
340 511
341=item bool ecb_prefetch (addr, rw, locality) 512=item ecb_prefetch (addr, rw, locality)
342 513
343Tells the compiler to try to prefetch memory at the given C<addr>ess 514Tells the compiler to try to prefetch memory at the given C<addr>ess
344for either reading (C<rw> = 0) or writing (C<rw> = 1). A C<locality> of 515for either reading (C<rw> = 0) or writing (C<rw> = 1). A C<locality> of
345C<0> means that there will only be one access later, C<3> means that 516C<0> means that there will only be one access later, C<3> means that
346the data will likely be accessed very often, and values in between mean 517the data will likely be accessed very often, and values in between mean
374After processing the node, (part of) the next node might already be in 545After processing the node, (part of) the next node might already be in
375cache. 546cache.
376 547
377=back 548=back
378 549
379=head2 BIT FIDDLING / BITSTUFFS 550=head2 BIT FIDDLING / BIT WIZARDRY
380 551
381=over 4 552=over 4
382 553
383=item bool ecb_big_endian () 554=item bool ecb_big_endian ()
384 555
386 557
387These two functions return true if the byte order is big endian 558These two functions return true if the byte order is big endian
388(most-significant byte first) or little endian (least-significant byte 559(most-significant byte first) or little endian (least-significant byte
389first) respectively. 560first) respectively.
390 561
562On systems that are neither, their return values are unspecified.
563
391=item int ecb_ctz32 (uint32_t x) 564=item int ecb_ctz32 (uint32_t x)
392 565
566=item int ecb_ctz64 (uint64_t x)
567
393Returns the index of the least significant bit set in C<x> (or 568Returns the index of the least significant bit set in C<x> (or
394equivalently the number of bits set to 0 before the least significant 569equivalently the number of bits set to 0 before the least significant bit
395bit set), starting from 0. If C<x> is 0 the result is undefined. A 570set), starting from 0. If C<x> is 0 the result is undefined.
396common use case is to compute the integer binary logarithm, i.e., 571
397floor(log2(n)). For example: 572For smaller types than C<uint32_t> you can safely use C<ecb_ctz32>.
573
574For example:
398 575
399 ecb_ctz32 (3) = 0 576 ecb_ctz32 (3) = 0
400 ecb_ctz32 (6) = 1 577 ecb_ctz32 (6) = 1
401 578
579=item bool ecb_is_pot32 (uint32_t x)
580
581=item bool ecb_is_pot64 (uint32_t x)
582
583Return true iff C<x> is a power of two or C<x == 0>.
584
585For smaller types then C<uint32_t> you can safely use C<ecb_is_pot32>.
586
587=item int ecb_ld32 (uint32_t x)
588
589=item int ecb_ld64 (uint64_t x)
590
591Returns the index of the most significant bit set in C<x>, or the number
592of digits the number requires in binary (so that C<< 2**ld <= x <
5932**(ld+1) >>). If C<x> is 0 the result is undefined. A common use case is
594to compute the integer binary logarithm, i.e. C<floor (log2 (n))>, for
595example to see how many bits a certain number requires to be encoded.
596
597This function is similar to the "count leading zero bits" function, except
598that that one returns how many zero bits are "in front" of the number (in
599the given data type), while C<ecb_ld> returns how many bits the number
600itself requires.
601
602For smaller types than C<uint32_t> you can safely use C<ecb_ld32>.
603
402=item int ecb_popcount32 (uint32_t x) 604=item int ecb_popcount32 (uint32_t x)
403 605
606=item int ecb_popcount64 (uint64_t x)
607
404Returns the number of bits set to 1 in C<x>. For example: 608Returns the number of bits set to 1 in C<x>.
609
610For smaller types than C<uint32_t> you can safely use C<ecb_popcount32>.
611
612For example:
405 613
406 ecb_popcount32 (7) = 3 614 ecb_popcount32 (7) = 3
407 ecb_popcount32 (255) = 8 615 ecb_popcount32 (255) = 8
408 616
617=item uint8_t ecb_bitrev8 (uint8_t x)
618
619=item uint16_t ecb_bitrev16 (uint16_t x)
620
621=item uint32_t ecb_bitrev32 (uint32_t x)
622
623Reverses the bits in x, i.e. the MSB becomes the LSB, MSB-1 becomes LSB+1
624and so on.
625
626Example:
627
628 ecb_bitrev8 (0xa7) = 0xea
629 ecb_bitrev32 (0xffcc4411) = 0x882233ff
630
409=item uint32_t ecb_bswap16 (uint32_t x) 631=item uint32_t ecb_bswap16 (uint32_t x)
410 632
411=item uint32_t ecb_bswap32 (uint32_t x) 633=item uint32_t ecb_bswap32 (uint32_t x)
412 634
635=item uint64_t ecb_bswap64 (uint64_t x)
636
413These two functions return the value of the 16-bit (32-bit) value C<x> 637These functions return the value of the 16-bit (32-bit, 64-bit) value
414after reversing the order of bytes (0x11223344 becomes 0x44332211). 638C<x> after reversing the order of bytes (0x11223344 becomes 0x44332211 in
639C<ecb_bswap32>).
640
641=item uint8_t ecb_rotl8 (uint8_t x, unsigned int count)
642
643=item uint16_t ecb_rotl16 (uint16_t x, unsigned int count)
644
645=item uint32_t ecb_rotl32 (uint32_t x, unsigned int count)
646
647=item uint64_t ecb_rotl64 (uint64_t x, unsigned int count)
648
649=item uint8_t ecb_rotr8 (uint8_t x, unsigned int count)
650
651=item uint16_t ecb_rotr16 (uint16_t x, unsigned int count)
415 652
416=item uint32_t ecb_rotr32 (uint32_t x, unsigned int count) 653=item uint32_t ecb_rotr32 (uint32_t x, unsigned int count)
417 654
418=item uint32_t ecb_rotl32 (uint32_t x, unsigned int count) 655=item uint64_t ecb_rotr64 (uint64_t x, unsigned int count)
419 656
420These two functions return the value of C<x> after shifting all the bits 657These two families of functions return the value of C<x> after rotating
421by C<count> positions to the right or left respectively. 658all the bits by C<count> positions to the right (C<ecb_rotr>) or left
659(C<ecb_rotl>).
422 660
423Current GCC versions understand these functions and usually compile them 661Current GCC versions understand these functions and usually compile them
424to "optimal" code (e.g. a single C<roll> on x86). 662to "optimal" code (e.g. a single C<rol> or a combination of C<shld> on
663x86).
425 664
426=back 665=back
427 666
667=head2 FLOATING POINT FIDDLING
668
669=over 4
670
671=item ECB_INFINITY
672
673Evaluates to positive infinity if supported by the platform, otherwise to
674a truly huge number.
675
676=item ECB_NON
677
678Evaluates to a quiet NAN if supported by the platform, otherwise to
679C<ECB_INFINITY>.
680
681=item float ecb_ldexpf (float x, int exp)
682
683Same as C<ldexpf>, but always available.
684
685=item uint32_t ecb_float_to_binary32 (float x) [-UECB_NO_LIBM]
686
687=item uint64_t ecb_double_to_binary64 (double x) [-UECB_NO_LIBM]
688
689These functions each take an argument in the native C<float> or C<double>
690type and return the IEEE 754 bit representation of it.
691
692The bit representation is just as IEEE 754 defines it, i.e. the sign bit
693will be the most significant bit, followed by exponent and mantissa.
694
695This function should work even when the native floating point format isn't
696IEEE compliant, of course at a speed and code size penalty, and of course
697also within reasonable limits (it tries to convert NaNs, infinities and
698denormals, but will likely convert negative zero to positive zero).
699
700On all modern platforms (where C<ECB_STDFP> is true), the compiler should
701be able to optimise away this function completely.
702
703These functions can be helpful when serialising floats to the network - you
704can serialise the return value like a normal uint32_t/uint64_t.
705
706Another use for these functions is to manipulate floating point values
707directly.
708
709Silly example: toggle the sign bit of a float.
710
711 /* On gcc-4.7 on amd64, */
712 /* this results in a single add instruction to toggle the bit, and 4 extra */
713 /* instructions to move the float value to an integer register and back. */
714
715 x = ecb_binary32_to_float (ecb_float_to_binary32 (x) ^ 0x80000000U)
716
717=item float ecb_binary16_to_float (uint16_t x) [-UECB_NO_LIBM]
718
719=item float ecb_binary32_to_float (uint32_t x) [-UECB_NO_LIBM]
720
721=item double ecb_binary32_to_double (uint64_t x) [-UECB_NO_LIBM]
722
723The reverse operation of the previous function - takes the bit
724representation of an IEEE binary16, binary32 or binary64 number and
725converts it to the native C<float> or C<double> format.
726
727This function should work even when the native floating point format isn't
728IEEE compliant, of course at a speed and code size penalty, and of course
729also within reasonable limits (it tries to convert normals and denormals,
730and might be lucky for infinities, and with extraordinary luck, also for
731negative zero).
732
733On all modern platforms (where C<ECB_STDFP> is true), the compiler should
734be able to optimise away this function completely.
735
736=back
737
428=head2 ARITHMETIC 738=head2 ARITHMETIC
429 739
430=over 4 740=over 4
431 741
432=item x = ecb_mod (m, n) 742=item x = ecb_mod (m, n)
433 743
434Returns the positive remainder of the modulo operation between C<m> and 744Returns C<m> modulo C<n>, which is the same as the positive remainder
745of the division operation between C<m> and C<n>, using floored
435C<n>. Unlike the C modulo operator C<%>, this function ensures that the 746division. Unlike the C remainder operator C<%>, this function ensures that
436return value is always positive - ISO C guarantees very little when 747the return value is always positive and that the two numbers I<m> and
437negative numbers are used with C<%>. 748I<m' = m + i * n> result in the same value modulo I<n> - in other words,
749C<ecb_mod> implements the mathematical modulo operation, which is missing
750in the language.
438 751
439C<n> must be strictly positive (i.e. C<< >1 >>), while C<m> must be 752C<n> must be strictly positive (i.e. C<< >= 1 >>), while C<m> must be
440negatable, that is, both C<m> and C<-m> must be representable in its 753negatable, that is, both C<m> and C<-m> must be representable in its
441type. 754type (this typically excludes the minimum signed integer value, the same
755limitation as for C</> and C<%> in C).
756
757Current GCC versions compile this into an efficient branchless sequence on
758almost all CPUs.
759
760For example, when you want to rotate forward through the members of an
761array for increasing C<m> (which might be negative), then you should use
762C<ecb_mod>, as the C<%> operator might give either negative results, or
763change direction for negative values:
764
765 for (m = -100; m <= 100; ++m)
766 int elem = myarray [ecb_mod (m, ecb_array_length (myarray))];
767
768=item x = ecb_div_rd (val, div)
769
770=item x = ecb_div_ru (val, div)
771
772Returns C<val> divided by C<div> rounded down or up, respectively.
773C<val> and C<div> must have integer types and C<div> must be strictly
774positive. Note that these functions are implemented with macros in C
775and with function templates in C++.
442 776
443=back 777=back
444 778
445=head2 UTILITY 779=head2 UTILITY
446 780
447=over 4 781=over 4
448 782
449=item element_count = ecb_array_length (name) [MACRO] 783=item element_count = ecb_array_length (name)
450 784
451Returns the number of elements in the array C<name>. For example: 785Returns the number of elements in the array C<name>. For example:
452 786
453 int primes[] = { 2, 3, 5, 7, 11 }; 787 int primes[] = { 2, 3, 5, 7, 11 };
454 int sum = 0; 788 int sum = 0;
456 for (i = 0; i < ecb_array_length (primes); i++) 790 for (i = 0; i < ecb_array_length (primes); i++)
457 sum += primes [i]; 791 sum += primes [i];
458 792
459=back 793=back
460 794
795=head2 SYMBOLS GOVERNING COMPILATION OF ECB.H ITSELF
461 796
797These symbols need to be defined before including F<ecb.h> the first time.
798
799=over 4
800
801=item ECB_NO_THREADS
802
803If F<ecb.h> is never used from multiple threads, then this symbol can
804be defined, in which case memory fences (and similar constructs) are
805completely removed, leading to more efficient code and fewer dependencies.
806
807Setting this symbol to a true value implies C<ECB_NO_SMP>.
808
809=item ECB_NO_SMP
810
811The weaker version of C<ECB_NO_THREADS> - if F<ecb.h> is used from
812multiple threads, but never concurrently (e.g. if the system the program
813runs on has only a single CPU with a single core, no hyperthreading and so
814on), then this symbol can be defined, leading to more efficient code and
815fewer dependencies.
816
817=item ECB_NO_LIBM
818
819When defined to C<1>, do not export any functions that might introduce
820dependencies on the math library (usually called F<-lm>) - these are
821marked with [-UECB_NO_LIBM].
822
823=back
824
825

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines