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

Comparing cvsroot/libecb/ecb.pod (file contents):
Revision 1.17 by root, Thu May 26 23:55:58 2011 UTC vs.
Revision 1.50 by root, Thu Jun 28 20:20:27 2012 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 isn'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
		59	=head2 TYPES / TYPE SUPPORT
		60
		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>.
		72
		73	=head2 LANGUAGE/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).
		78
		79	=over 4
		80
		81	=item ECB_C
		82
		83	True if the implementation defines the C<__STDC__> macro to a true value,
		84	which is typically true for both C and C++ compilers.
		85
		86	=item ECB_C99
		87
		88	True if the implementation claims to be compliant to C99 (ISO/IEC
		89	9899:1999) or any later version.
		90
		91	Note that later versions (ECB_C11) remove core features again (for
		92	example, variable length arrays).
		93
		94	=item ECB_C11
		95
		96	True if the implementation claims to be compliant to C11 (ISO/IEC
		97	9899:2011) or any later version.
		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
		105
		106	True 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
		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	=back
		156
58	=head2 GCC ATTRIBUTES	157	=head2 GCC ATTRIBUTES
59		158
60	blabla where to put, what others	159	A major part of libecb deals with GCC attributes. These are additional
		160	attributes that you can assign to functions, variables and sometimes even
		161	types - much like C<const> or C<volatile> in C.
		162
		163	While GCC allows declarations to show up in many surprising places,
		164	but not in many expected places, the safest way is to put attribute
		165	declarations before the whole declaration:
		166
		167	ecb_const int mysqrt (int a);
		168	ecb_unused int i;
		169
		170	For variables, it is often nicer to put the attribute after the name, and
		171	avoid multiple declarations using commas:
		172
		173	int i ecb_unused;
61		174
62	=over 4	175	=over 4
63		176
64	=item ecb_attribute ((attrs...))	177	=item ecb_attribute ((attrs...))
65		178
…		…
86	#else	199	#else
87	return 0;	200	return 0;
88	#endif	201	#endif
89	}	202	}
90		203
		204	=item ecb_inline
		205
		206	This is not actually an attribute, but you use it like one. It expands
		207	either to C<static inline> or to just C<static>, if inline isn't
		208	supported. It should be used to declare functions that should be inlined,
		209	for code size or speed reasons.
		210
		211	Example: inline this function, it surely will reduce codesize.
		212
		213	ecb_inline int
		214	negmul (int a, int b)
		215	{
		216	return - (a * b);
		217	}
		218
91	=item ecb_noinline	219	=item ecb_noinline
92		220
93	Prevent a function from being inlined - it might be optimised away, but	221	Prevent 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	222	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.	223	is rarely called and large enough for inlining not to be helpful.
…		…
105	{	233	{
106	puts (errline);	234	puts (errline);
107	abort ();	235	abort ();
108	}	236	}
109		237
110	In this case, the compiler would probbaly be smart enough to decude it on	238	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.	239	its own, so this is mainly useful for declarations.
112		240
113	=item ecb_const	241	=item ecb_const
114		242
115	Declares that the function only depends on the values of it's arguments,	243	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	244	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	245	any memory any arguments might point to, global variables, or call any
118	non-const functions. It also must not have any side effects.	246	non-const functions. It also must not have any side effects.
119		247
120	Such a function can be optimised much more aggressively by the compiler -	248	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	249	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	250	a single call, which wouldn't be possible if the compiler would have to
123	expect any side effects.	251	expect any side effects.
124		252
125	It is best suited for functions in the sense of mathematical functions,	253	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.	254	such as a function returning the square root of its input argument.
127		255
128	Not suited would be a function that calculates the hash of some memory	256	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	257	area you pass in, prints some messages or looks at a global variable to
130	decide on rounding.	258	decide on rounding.
131		259
…		…
154	possible.	282	possible.
155		283
156	The compiler reacts by trying to place hot functions near to each other in	284	The compiler reacts by trying to place hot functions near to each other in
157	memory.	285	memory.
158		286
159	Whether a function is hot or not often depend son the whole program,	287	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	288	and less on the function itself. C<ecb_cold> is likely more useful in
161	practise.	289	practise.
162		290
163	=item ecb_cold	291	=item ecb_cold
164		292
…		…
169		297
170	In addition to placing cold functions together (or at least away from hot	298	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	299	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	300	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	301	leading to calls to those functions can automatically be marked as if
174	C<ecb_unlikel> had been used to reach them.	302	C<ecb_expect_false> had been used to reach them.
175		303
176	Good examples for such functions would be error reporting functions, or	304	Good examples for such functions would be error reporting functions, or
177	functions only called in exceptional or rare cases.	305	functions only called in exceptional or rare cases.
178		306
179	=item ecb_artificial	307	=item ecb_artificial
…		…
241		369
242	Evaluates C<expr> and returns it. In addition, it tells the compiler that	370	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	371	the C<expr> evaluates to C<value> a lot, which can be used for static
244	branch optimisations.	372	branch optimisations.
245		373
246	Usually, you want to use the more intuitive C<ecb_likely> and	374	Usually, you want to use the more intuitive C<ecb_expect_true> and
247	C<ecb_unlikely> functions instead.	375	C<ecb_expect_false> functions instead.
248		376
		377	=item bool ecb_expect_true (cond)
		378
249	=item bool ecb_likely (cond)	379	=item bool ecb_expect_false (cond)
250
251	=item bool ecb_unlikely (cond)
252		380
253	These two functions expect a expression that is true or false and return	381	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	382	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:	383	other conditional statement, it will not change the program:
256		384
257	/* these two do the same thing */	385	/* these two do the same thing */
258	if (some_condition) ...;	386	if (some_condition) ...;
259	if (ecb_likely (some_condition)) ...;	387	if (ecb_expect_true (some_condition)) ...;
260		388
261	However, by using C<ecb_likely>, you tell the compiler that the condition	389	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	390	condition is likely to be true (and for C<ecb_expect_false>, that it is
263	true).	391	unlikely to be true).
264		392
265	For example, when you check for a null pointer and expect this to be a	393	For example, when you check for a null pointer and expect this to be a
266	rare, exceptional, case, then use C<ecb_unlikely>:	394	rare, exceptional, case, then use C<ecb_expect_false>:
267		395
268	void my_free (void *ptr)	396	void my_free (void *ptr)
269	{	397	{
270	if (ecb_unlikely (ptr == 0))	398	if (ecb_expect_false (ptr == 0))
271	return;	399	return;
272	}	400	}
273		401
274	Consequent use of these functions to mark away exceptional cases or to	402	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	403	tell the compiler what the hot path through a function is can increase
276	performance considerably.	404	performance considerably.
		405
		406	You might know these functions under the name C<likely> and C<unlikely>
		407	- while these are common aliases, we find that the expect name is easier
		408	to understand when quickly skimming code. If you wish, you can use
		409	C<ecb_likely> instead of C<ecb_expect_true> and C<ecb_unlikely> instead of
		410	C<ecb_expect_false> - these are simply aliases.
277		411
278	A very good example is in a function that reserves more space for some	412	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) -	413	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	414	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:	415	you expect that most checks will turn out to be false:
282		416
283	/* make sure we have "size" extra room in our buffer */	417	/* make sure we have "size" extra room in our buffer */
284	ecb_inline void	418	ecb_inline void
285	reserve (int size)	419	reserve (int size)
286	{	420	{
287	if (ecb_unlikely (current + size > end))	421	if (ecb_expect_false (current + size > end))
288	real_reserve_method (size); /* presumably noinline */	422	real_reserve_method (size); /* presumably noinline */
289	}	423	}
290		424
291	=item bool ecb_assume (cond)	425	=item bool ecb_assume (cond)
292		426
…		…
295		429
296	This can be used to teach the compiler about invariants or other	430	This can be used to teach the compiler about invariants or other
297	conditions that might improve code generation, but which are impossible to	431	conditions that might improve code generation, but which are impossible to
298	deduce form the code itself.	432	deduce form the code itself.
299		433
300	For example, the example reservation function from the C<ecb_unlikely>	434	For example, the example reservation function from the C<ecb_expect_false>
301	description could be written thus (only C<ecb_assume> was added):	435	description could be written thus (only C<ecb_assume> was added):
302		436
303	ecb_inline void	437	ecb_inline void
304	reserve (int size)	438	reserve (int size)
305	{	439	{
306	if (ecb_unlikely (current + size > end))	440	if (ecb_expect_false (current + size > end))
307	real_reserve_method (size); /* presumably noinline */	441	real_reserve_method (size); /* presumably noinline */
308		442
309	ecb_assume (current + size <= end);	443	ecb_assume (current + size <= end);
310	}	444	}
311		445
…		…
360	After processing the node, (part of) the next node might already be in	494	After processing the node, (part of) the next node might already be in
361	cache.	495	cache.
362		496
363	=back	497	=back
364		498
365	=head2 BIT FIDDLING / BITSTUFFS	499	=head2 BIT FIDDLING / BIT WIZARDRY
366		500
367	=over 4	501	=over 4
368		502
369	=item bool ecb_big_endian ()	503	=item bool ecb_big_endian ()
370		504
…		…
372		506
373	These two functions return true if the byte order is big endian	507	These two functions return true if the byte order is big endian
374	(most-significant byte first) or little endian (least-significant byte	508	(most-significant byte first) or little endian (least-significant byte
375	first) respectively.	509	first) respectively.
376		510
		511	On systems that are neither, their return values are unspecified.
		512
377	=item int ecb_ctz32 (uint32_t x)	513	=item int ecb_ctz32 (uint32_t x)
378		514
		515	=item int ecb_ctz64 (uint64_t x)
		516
379	Returns the index of the least significant bit set in C<x> (or	517	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	518	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	519	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.,	520
383	floor(log2(n)). For example:	521	For smaller types than C<uint32_t> you can safely use C<ecb_ctz32>.
		522
		523	For example:
384		524
385	ecb_ctz32 (3) = 0	525	ecb_ctz32 (3) = 0
386	ecb_ctz32 (6) = 1	526	ecb_ctz32 (6) = 1
387		527
		528	=item bool ecb_is_pot32 (uint32_t x)
		529
		530	=item bool ecb_is_pot64 (uint32_t x)
		531
		532	Return true iff C<x> is a power of two or C<x == 0>.
		533
		534	For smaller types then C<uint32_t> you can safely use C<ecb_is_pot32>.
		535
		536	=item int ecb_ld32 (uint32_t x)
		537
		538	=item int ecb_ld64 (uint64_t x)
		539
		540	Returns the index of the most significant bit set in C<x>, or the number
		541	of digits the number requires in binary (so that C<< 2**ld <= x <
		542	2**(ld+1) >>). If C<x> is 0 the result is undefined. A common use case is
		543	to compute the integer binary logarithm, i.e. C<floor (log2 (n))>, for
		544	example to see how many bits a certain number requires to be encoded.
		545
		546	This function is similar to the "count leading zero bits" function, except
		547	that that one returns how many zero bits are "in front" of the number (in
		548	the given data type), while C<ecb_ld> returns how many bits the number
		549	itself requires.
		550
		551	For smaller types than C<uint32_t> you can safely use C<ecb_ld32>.
		552
388	=item int ecb_popcount32 (uint32_t x)	553	=item int ecb_popcount32 (uint32_t x)
389		554
		555	=item int ecb_popcount64 (uint64_t x)
		556
390	Returns the number of bits set to 1 in C<x>. For example:	557	Returns the number of bits set to 1 in C<x>.
		558
		559	For smaller types than C<uint32_t> you can safely use C<ecb_popcount32>.
		560
		561	For example:
391		562
392	ecb_popcount32 (7) = 3	563	ecb_popcount32 (7) = 3
393	ecb_popcount32 (255) = 8	564	ecb_popcount32 (255) = 8
394		565
		566	=item uint8_t ecb_bitrev8 (uint8_t x)
		567
		568	=item uint16_t ecb_bitrev16 (uint16_t x)
		569
		570	=item uint32_t ecb_bitrev32 (uint32_t x)
		571
		572	Reverses the bits in x, i.e. the MSB becomes the LSB, MSB-1 becomes LSB+1
		573	and so on.
		574
		575	Example:
		576
		577	ecb_bitrev8 (0xa7) = 0xea
		578	ecb_bitrev32 (0xffcc4411) = 0x882233ff
		579
395	=item uint32_t ecb_bswap16 (uint32_t x)	580	=item uint32_t ecb_bswap16 (uint32_t x)
396		581
397	=item uint32_t ecb_bswap32 (uint32_t x)	582	=item uint32_t ecb_bswap32 (uint32_t x)
398		583
		584	=item uint64_t ecb_bswap64 (uint64_t x)
		585
399	These two functions return the value of the 16-bit (32-bit) variable	586	These functions return the value of the 16-bit (32-bit, 64-bit) value
400	C<x> after reversing the order of bytes.	587	C<x> after reversing the order of bytes (0x11223344 becomes 0x44332211 in
		588	C<ecb_bswap32>).
		589
		590	=item uint8_t ecb_rotl8 (uint8_t x, unsigned int count)
		591
		592	=item uint16_t ecb_rotl16 (uint16_t x, unsigned int count)
		593
		594	=item uint32_t ecb_rotl32 (uint32_t x, unsigned int count)
		595
		596	=item uint64_t ecb_rotl64 (uint64_t x, unsigned int count)
		597
		598	=item uint8_t ecb_rotr8 (uint8_t x, unsigned int count)
		599
		600	=item uint16_t ecb_rotr16 (uint16_t x, unsigned int count)
401		601
402	=item uint32_t ecb_rotr32 (uint32_t x, unsigned int count)	602	=item uint32_t ecb_rotr32 (uint32_t x, unsigned int count)
403		603
404	=item uint32_t ecb_rotl32 (uint32_t x, unsigned int count)	604	=item uint64_t ecb_rotr64 (uint64_t x, unsigned int count)
405		605
406	These two functions return the value of C<x> after shifting all the bits	606	These two families of functions return the value of C<x> after rotating
407	by C<count> positions to the right or left respectively.	607	all the bits by C<count> positions to the right (C<ecb_rotr>) or left
		608	(C<ecb_rotl>).
		609
		610	Current GCC versions understand these functions and usually compile them
		611	to "optimal" code (e.g. a single C<rol> or a combination of C<shld> on
		612	x86).
408		613
409	=back	614	=back
410		615
		616	=head2 FLOATING POINT FIDDLING
		617
		618	=over 4
		619
		620	=item uint32_t ecb_float_to_binary32 (float x) [-UECB_NO_LIBM]
		621
		622	=item uint64_t ecb_double_to_binary64 (double x) [-UECB_NO_LIBM]
		623
		624	These functions each take an argument in the native C<float> or C<double>
		625	type and return the IEEE 754 bit representation of it.
		626
		627	The bit representation is just as IEEE 754 defines it, i.e. the sign bit
		628	will be the most significant bit, followed by exponent and mantissa.
		629
		630	This function should work even when the native floating point format isn't
		631	IEEE compliant, of course at a speed and code size penalty, and of course
		632	also within reasonable limits (it tries to convert NaNs, infinities and
		633	denormals, but will likely convert negative zero to positive zero).
		634
		635	On all modern platforms (where C<ECB_STDFP> is true), the compiler should
		636	be able to optimise away this function completely.
		637
		638	These functions can be helpful when serialising floats to the network - you
		639	can serialise the return value like a normal uint32_t/uint64_t.
		640
		641	Another use for these functions is to manipulate floating point values
		642	directly.
		643
		644	Silly example: toggle the sign bit of a float.
		645
		646	/* On gcc-4.7 on amd64, */
		647	/* this results in a single add instruction to toggle the bit, and 4 extra */
		648	/* instructions to move the float value to an integer register and back. */
		649
		650	x = ecb_binary32_to_float (ecb_float_to_binary32 (x) ^ 0x80000000U)
		651
		652	=item float ecb_binary32_to_float (uint32_t x) [-UECB_NO_LIBM]
		653
		654	=item double ecb_binary32_to_double (uint64_t x) [-UECB_NO_LIBM]
		655
		656	The reverse operation of the previos function - takes the bit representation
		657	of an IEEE binary32 or binary64 number and converts it to the native C<float>
		658	or C<double> format.
		659
		660	This function should work even when the native floating point format isn't
		661	IEEE compliant, of course at a speed and code size penalty, and of course
		662	also within reasonable limits (it tries to convert normals and denormals,
		663	and might be lucky for infinities, and with extraordinary luck, also for
		664	negative zero).
		665
		666	On all modern platforms (where C<ECB_STDFP> is true), the compiler should
		667	be able to optimise away this function completely.
		668
		669	=back
		670
411	=head2 ARITHMETIC	671	=head2 ARITHMETIC
412		672
413	=over 4	673	=over 4
414		674
415	=item x = ecb_mod (m, n)	675	=item x = ecb_mod (m, n)
416		676
417	Returns the positive remainder of the modulo operation between C<m> and	677	Returns C<m> modulo C<n>, which is the same as the positive remainder
		678	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	679	division. Unlike the C remainder operator C<%>, this function ensures that
419	return value is always positive).	680	the return value is always positive and that the two numbers I<m> and
		681	I<m' = m + i * n> result in the same value modulo I<n> - in other words,
		682	C<ecb_mod> implements the mathematical modulo operation, which is missing
		683	in the language.
420		684
421	C<n> must be strictly positive (i.e. C<< >1 >>), while C<m> must be	685	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	686	negatable, that is, both C<m> and C<-m> must be representable in its
423	type.	687	type (this typically excludes the minimum signed integer value, the same
		688	limitation as for C</> and C<%> in C).
		689
		690	Current GCC versions compile this into an efficient branchless sequence on
		691	almost all CPUs.
		692
		693	For example, when you want to rotate forward through the members of an
		694	array for increasing C<m> (which might be negative), then you should use
		695	C<ecb_mod>, as the C<%> operator might give either negative results, or
		696	change direction for negative values:
		697
		698	for (m = -100; m <= 100; ++m)
		699	int elem = myarray [ecb_mod (m, ecb_array_length (myarray))];
		700
		701	=item x = ecb_div_rd (val, div)
		702
		703	=item x = ecb_div_ru (val, div)
		704
		705	Returns C<val> divided by C<div> rounded down or up, respectively.
		706	C<val> and C<div> must have integer types and C<div> must be strictly
		707	positive. Note that these functions are implemented with macros in C
		708	and with function templates in C++.
424		709
425	=back	710	=back
426		711
427	=head2 UTILITY	712	=head2 UTILITY
428		713
429	=over 4	714	=over 4
430		715
431	=item element_count = ecb_array_length (name) [MACRO]	716	=item element_count = ecb_array_length (name)
432		717
433	Returns the number of elements in the array C<name>. For example:	718	Returns the number of elements in the array C<name>. For example:
434		719
435	int primes[] = { 2, 3, 5, 7, 11 };	720	int primes[] = { 2, 3, 5, 7, 11 };
436	int sum = 0;	721	int sum = 0;
…		…
438	for (i = 0; i < ecb_array_length (primes); i++)	723	for (i = 0; i < ecb_array_length (primes); i++)
439	sum += primes [i];	724	sum += primes [i];
440		725
441	=back	726	=back
442		727
		728	=head2 SYMBOLS GOVERNING COMPILATION OF ECB.H ITSELF
443		729
		730	These symbols need to be defined before including F<ecb.h> the first time.
		731
		732	=over 4
		733
		734	=item ECB_NO_THRADS
		735
		736	If F<ecb.h> is never used from multiple threads, then this symbol can
		737	be defined, in which case memory fences (and similar constructs) are
		738	completely removed, leading to more efficient code and fewer dependencies.
		739
		740	Setting this symbol to a true value implies C<ECB_NO_SMP>.
		741
		742	=item ECB_NO_SMP
		743
		744	The weaker version of C<ECB_NO_THREADS> - if F<ecb.h> is used from
		745	multiple threads, but never concurrently (e.g. if the system the program
		746	runs on has only a single CPU with a single core, no hyperthreading and so
		747	on), then this symbol can be defined, leading to more efficient code and
		748	fewer dependencies.
		749
		750	=item ECB_NO_LIBM
		751
		752	When defined to C<1>, do not export any functions that might introduce
		753	dependencies on the math library (usually called F<-lm>) - these are
		754	marked with [-UECB_NO_LIBM].
		755
		756	=back
		757
		758

Diff Legend

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

Comparing cvsroot/libecb/ecb.pod (file contents): Revision 1.17 by root, Thu May 26 23:55:58 2011 UTC vs. Revision 1.50 by root, Thu Jun 28 20:20:27 2012 UTC

Diff Legend

Comparing cvsroot/libecb/ecb.pod (file contents):
Revision 1.17 by root, Thu May 26 23:55:58 2011 UTC vs.
Revision 1.50 by root, Thu Jun 28 20:20:27 2012 UTC