[ViewVC] Diff of: cvs/libecb/ecb.pod

Comparing libecb/ecb.pod (file contents):
Revision 1.18 by root, Fri May 27 00:01:28 2011 UTC vs.
Revision 1.75 by root, Sat Dec 28 08:01:05 2019 UTC

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

Diff Legend

-–
+Removed lines
-+
+Added lines
-<
+Changed lines
->
+Changed lines

Comparing libecb/ecb.pod (file contents): Revision 1.18 by root, Fri May 27 00:01:28 2011 UTC vs. Revision 1.75 by root, Sat Dec 28 08:01:05 2019 UTC

Diff Legend

Comparing libecb/ecb.pod (file contents):
Revision 1.18 by root, Fri May 27 00:01:28 2011 UTC vs.
Revision 1.75 by root, Sat Dec 28 08:01:05 2019 UTC