libecb/ecb.pod

=head1 LIBECB

You suck, we don't(tm)

=head2 ABOUT THE HEADER

- how to include it
- it includes inttypes.h
- no .a
- whats a bool
- function mean macro or function
- macro means untyped

=head2 GCC ATTRIBUTES

blabla where to put, what others

=over 4

=item ecb_attribute ((attrs...))

A simple wrapper that expands to C<__attribute__((attrs))> on GCC, and
to nothing on other compilers, so the effect is that only GCC sees these.

=item ecb_unused

Marks a function or a variable as "unused", which simply suppresses a
warning by GCC when it detects it as unused. This is useful when you e.g.
declare a variable but do not always use it:

   {
     int var ecb_unused;

     #ifdef SOMECONDITION
        var = ...;
        return var;
     #else
        return 0;
     #endif
   }

=item ecb_noinline

Prevent a function from being inlined - it might be optimised away, but
not inlined into other functions. This is useful if you know your function
is rarely called and large enough for inlining not to be helpful.

=item ecb_noreturn

=item ecb_const

=item ecb_pure

=item ecb_hot

=item ecb_cold

=item ecb_artificial

=back

=head2 OPTIMISATION HINTS

=over 4

=item bool ecb_is_constant(expr) [MACRO]

Returns true iff the expression can be deduced to be a compile-time
constant, and false otherwise.

For example, when you have a C<rndm16> function that returns a 16 bit
random number, and you have a function that maps this to a range from
0..n-1, then you could use this inline function in a header file:

  ecb_inline uint32_t
  rndm (uint32_t n)
  {
    return (n * (uint32_t)rndm16 ()) >> 16;
  }

However, for powers of two, you could use a normal mask, but that is only
worth it if, at compile time, you can detect this case. This is the case
when the passed number is a constant and also a power of two (C<n & (n -
1) == 0>):

  ecb_inline uint32_t
  rndm (uint32_t n)
  {
    return is_constant (n) && !(n & (n - 1))
      ? rndm16 () & (num - 1)
      : (n * (uint32_t)rndm16 ()) >> 16;
  }

=item bool ecb_expect (expr, value) [MACRO]

Evaluates C<expr> and returns it. In addition, it tells the compiler that
the C<expr> evaluates to C<value> a lot, which can be used for static
branch optimisations.

Usually, you want to use the more intuitive C<ecb_likely> and
C<ecb_unlikely> functions instead.

=item bool ecb_likely (bool) [MACRO]

=item bool ecb_unlikely (bool) [MACRO]

These two functions expect a expression that is true or false and return
C<1> or C<0>, respectively, so when used in the condition of an C<if> or
other conditional statement, it will not change the program:

  /* these two do the same thing */
  if (some_condition) ...;
  if (ecb_likely (some_condition)) ...;

However, by using C<ecb_likely>, you tell the compiler that the condition
is likely to be true (and for C<ecb_unlikely>, that it is unlikely to be
true).

For example, when you check for a null pointer and expect this to be a
rare, exceptional, case, then use C<ecb_unlikely>:

  void my_free (void *ptr)
  {
    if (ecb_unlikely (ptr == 0))
      return;
  }

Consequent use of these functions to mark away exceptional cases or to
tell the compiler what the hot path through a function is can increase
performance considerably.

A very good example is in a function that reserves more space for some
memory block (for example, inside an implementation of a string stream) -
each time something is added, you have to check for a buffer overrun, but
you expect that most checks will turn out to be false:

  /* make sure we have "size" extra room in our buffer */
  ecb_inline void
  reserve (int size)
  {
    if (ecb_unlikely (current + size > end))
      real_reserve_method (size); /* presumably noinline */
  }

=item bool ecb_assume (cond) [MACRO]

Try to tell the compiler that some condition is true, even if it's not
obvious.

This can be used to teach the compiler about invariants or other
conditions that might improve code generation, but which are impossible to
deduce form the code itself.

For example, the example reservation function from the C<ecb_unlikely>
description could be written thus (only C<ecb_assume> was added):

  ecb_inline void
  reserve (int size)
  {
    if (ecb_unlikely (current + size > end))
      real_reserve_method (size); /* presumably noinline */

    ecb_assume (current + size <= end);
  }

If you then call this function twice, like this:

  reserve (10);
  reserve (1);

Then the compiler I<might> be able to optimise out the second call
completely, as it knows that C<< current + 1 > end >> is false and the
call will never be executed.

=item bool ecb_unreachable ()

This function does nothing itself, except tell the compiler that it will
never be executed. Apart from suppressing a warning in some cases, this
function can be used to implement C<ecb_assume> or similar functions.

=item bool ecb_prefetch (addr, rw, locality) [MACRO]

Tells the compiler to try to prefetch memory at the given C<addr>ess
for either reading (C<rw> = 0) or writing (C<rw> = 1). A C<locality> of
C<0> means that there will only be one access later, C<3> means that
the data will likely be accessed very often, and values in between mean
something... in between. The memory pointed to by the address does not
need to be accessible (it could be a null pointer for example), but C<rw>
and C<locality> must be compile-time constants.

An obvious way to use this is to prefetch some data far away, in a big
array you loop over. This prefetches memory some 128 array elements later,
in the hope that it will be ready when the CPU arrives at that location.

  int sum = 0;

  for (i = 0; i < N; ++i)
    {
      sum += arr [i]
      ecb_prefetch (arr + i + 128, 0, 0);
    }

It's hard to predict how far to prefetch, and most CPUs that can prefetch
are often good enough to predict this kind of behaviour themselves. It
gets more interesting with linked lists, especially when you do some fair
processing on each list element:

  for (node *n = start; n; n = n->next)
    {
      ecb_prefetch (n->next, 0, 0);
      ... do medium amount of work with *n
    }

After processing the node, (part of) the next node might already be in
cache.

=back

=head2 BIT FIDDLING / BITSTUFFS

=over 4

=item bool ecb_big_endian ()

=item bool ecb_little_endian ()

These two functions return true if the byte order is big endian
(most-significant byte first) or little endian (least-significant byte
first) respectively.

=item int ecb_ctz32 (uint32_t x)

Returns the index of the least significant bit set in C<x> (or
equivalently the number of bits set to 0 before the least significant
bit set), starting from 0. If C<x> is 0 the result is undefined. A
common use case is to compute the integer binary logarithm, i.e.,
floor(log2(n)). For example:

  ecb_ctz32(3) = 0
  ecb_ctz32(6) = 1

=item int ecb_popcount32 (uint32_t x)

Returns the number of bits set to 1 in C<x>. For example:

  ecb_popcount32(7) = 3
  ecb_popcount32(255) = 8

=item uint32_t ecb_bswap16 (uint32_t x)

=item uint32_t ecb_bswap32 (uint32_t x)

=item uint32_t ecb_rotr32 (uint32_t x, unsigned int count)

=item uint32_t ecb_rotl32 (uint32_t x, unsigned int count)

These two functions return the value of C<x> after shifting all the bits
by C<count> positions to the right or left respectively.

=back

=head2 ARITHMETIC

=over 4

=item x = ecb_mod (m, n) [MACRO]

Returns the positive remainder of the modulo operation between C<m>
and C<n>.

=back

=head2 UTILITY

=over 4

=item element_count = ecb_array_length (name) [MACRO]

=back


Revision:	1.12
Committed:	Thu May 26 21:34:16 2011 UTC (13 years ago) by sf-exg
Branch:	MAIN
Changes since 1.11:	+2 -2 lines
Log Message:	Fix off-by-one.
#	User	Rev	Content
1	root	1.3	=head1 LIBECB
2
3			You suck, we don't(tm)
4
5			=head2 ABOUT THE HEADER
6
7			- how to include it
8			- it includes inttypes.h
9			- no .a
10			- whats a bool
11	root	1.7	- function mean macro or function
12			- macro means untyped
13	root	1.1
14			=head2 GCC ATTRIBUTES
15
16	root	1.3	blabla where to put, what others
17
18	root	1.1	=over 4
19
20	root	1.2	=item ecb_attribute ((attrs...))
21	root	1.1
22	root	1.2	A simple wrapper that expands to C<__attribute__((attrs))> on GCC, and
23			to nothing on other compilers, so the effect is that only GCC sees these.
24
25	root	1.3	=item ecb_unused
26
27			Marks a function or a variable as "unused", which simply suppresses a
28			warning by GCC when it detects it as unused. This is useful when you e.g.
29			declare a variable but do not always use it:
30
31			{
32			int var ecb_unused;
33
34			#ifdef SOMECONDITION
35			var = ...;
36			return var;
37			#else
38			return 0;
39			#endif
40			}
41
42	root	1.2	=item ecb_noinline
43
44	root	1.9	Prevent a function from being inlined - it might be optimised away, but
45	root	1.3	not inlined into other functions. This is useful if you know your function
46			is rarely called and large enough for inlining not to be helpful.
47
48	root	1.2	=item ecb_noreturn
49
50			=item ecb_const
51
52			=item ecb_pure
53
54			=item ecb_hot
55
56			=item ecb_cold
57
58			=item ecb_artificial
59
60			=back
61	root	1.1
62			=head2 OPTIMISATION HINTS
63
64			=over 4
65
66	root	1.8	=item bool ecb_is_constant(expr) [MACRO]
67	root	1.1
68	root	1.3	Returns true iff the expression can be deduced to be a compile-time
69			constant, and false otherwise.
70
71			For example, when you have a C<rndm16> function that returns a 16 bit
72			random number, and you have a function that maps this to a range from
73	root	1.5	0..n-1, then you could use this inline function in a header file:
74	root	1.3
75			ecb_inline uint32_t
76			rndm (uint32_t n)
77			{
78	root	1.6	return (n * (uint32_t)rndm16 ()) >> 16;
79	root	1.3	}
80
81			However, for powers of two, you could use a normal mask, but that is only
82			worth it if, at compile time, you can detect this case. This is the case
83			when the passed number is a constant and also a power of two (C<n & (n -
84			1) == 0>):
85
86			ecb_inline uint32_t
87			rndm (uint32_t n)
88			{
89			return is_constant (n) && !(n & (n - 1))
90			? rndm16 () & (num - 1)
91	root	1.6	: (n * (uint32_t)rndm16 ()) >> 16;
92	root	1.3	}
93
94	root	1.8	=item bool ecb_expect (expr, value) [MACRO]
95	root	1.1
96	root	1.7	Evaluates C<expr> and returns it. In addition, it tells the compiler that
97			the C<expr> evaluates to C<value> a lot, which can be used for static
98			branch optimisations.
99	root	1.1
100	root	1.7	Usually, you want to use the more intuitive C<ecb_likely> and
101			C<ecb_unlikely> functions instead.
102	root	1.1
103	root	1.8	=item bool ecb_likely (bool) [MACRO]
104	root	1.1
105	root	1.8	=item bool ecb_unlikely (bool) [MACRO]
106	root	1.1
107	root	1.7	These two functions expect a expression that is true or false and return
108			C<1> or C<0>, respectively, so when used in the condition of an C<if> or
109			other conditional statement, it will not change the program:
110
111			/* these two do the same thing */
112			if (some_condition) ...;
113			if (ecb_likely (some_condition)) ...;
114
115			However, by using C<ecb_likely>, you tell the compiler that the condition
116	sf-exg	1.11	is likely to be true (and for C<ecb_unlikely>, that it is unlikely to be
117	root	1.7	true).
118
119	root	1.9	For example, when you check for a null pointer and expect this to be a
120			rare, exceptional, case, then use C<ecb_unlikely>:
121	root	1.7
122			void my_free (void *ptr)
123			{
124			if (ecb_unlikely (ptr == 0))
125			return;
126			}
127
128			Consequent use of these functions to mark away exceptional cases or to
129			tell the compiler what the hot path through a function is can increase
130			performance considerably.
131
132			A very good example is in a function that reserves more space for some
133			memory block (for example, inside an implementation of a string stream) -
134	root	1.9	each time something is added, you have to check for a buffer overrun, but
135	root	1.7	you expect that most checks will turn out to be false:
136
137			/* make sure we have "size" extra room in our buffer */
138			ecb_inline void
139			reserve (int size)
140			{
141			if (ecb_unlikely (current + size > end))
142			real_reserve_method (size); /* presumably noinline */
143			}
144
145	root	1.8	=item bool ecb_assume (cond) [MACRO]
146	root	1.7
147			Try to tell the compiler that some condition is true, even if it's not
148			obvious.
149
150			This can be used to teach the compiler about invariants or other
151			conditions that might improve code generation, but which are impossible to
152			deduce form the code itself.
153
154			For example, the example reservation function from the C<ecb_unlikely>
155			description could be written thus (only C<ecb_assume> was added):
156
157			ecb_inline void
158			reserve (int size)
159			{
160			if (ecb_unlikely (current + size > end))
161			real_reserve_method (size); /* presumably noinline */
162
163			ecb_assume (current + size <= end);
164			}
165
166			If you then call this function twice, like this:
167
168			reserve (10);
169			reserve (1);
170
171			Then the compiler I<might> be able to optimise out the second call
172			completely, as it knows that C<< current + 1 > end >> is false and the
173			call will never be executed.
174
175			=item bool ecb_unreachable ()
176
177			This function does nothing itself, except tell the compiler that it will
178	root	1.9	never be executed. Apart from suppressing a warning in some cases, this
179	root	1.7	function can be used to implement C<ecb_assume> or similar functions.
180
181	root	1.8	=item bool ecb_prefetch (addr, rw, locality) [MACRO]
182	root	1.7
183			Tells the compiler to try to prefetch memory at the given C<addr>ess
184	root	1.10	for either reading (C<rw> = 0) or writing (C<rw> = 1). A C<locality> of
185	root	1.7	C<0> means that there will only be one access later, C<3> means that
186			the data will likely be accessed very often, and values in between mean
187			something... in between. The memory pointed to by the address does not
188			need to be accessible (it could be a null pointer for example), but C<rw>
189			and C<locality> must be compile-time constants.
190
191			An obvious way to use this is to prefetch some data far away, in a big
192	root	1.9	array you loop over. This prefetches memory some 128 array elements later,
193	root	1.7	in the hope that it will be ready when the CPU arrives at that location.
194
195			int sum = 0;
196
197			for (i = 0; i < N; ++i)
198			{
199			sum += arr [i]
200			ecb_prefetch (arr + i + 128, 0, 0);
201			}
202
203			It's hard to predict how far to prefetch, and most CPUs that can prefetch
204			are often good enough to predict this kind of behaviour themselves. It
205			gets more interesting with linked lists, especially when you do some fair
206			processing on each list element:
207
208			for (node *n = start; n; n = n->next)
209			{
210			ecb_prefetch (n->next, 0, 0);
211			... do medium amount of work with *n
212			}
213
214			After processing the node, (part of) the next node might already be in
215			cache.
216	root	1.1
217	root	1.2	=back
218	root	1.1
219			=head2 BIT FIDDLING / BITSTUFFS
220
221	root	1.4	=over 4
222
223	root	1.3	=item bool ecb_big_endian ()
224
225			=item bool ecb_little_endian ()
226
227	sf-exg	1.11	These two functions return true if the byte order is big endian
228			(most-significant byte first) or little endian (least-significant byte
229			first) respectively.
230
231	root	1.3	=item int ecb_ctz32 (uint32_t x)
232
233	sf-exg	1.11	Returns the index of the least significant bit set in C<x> (or
234			equivalently the number of bits set to 0 before the least significant
235			bit set), starting from 0. If C<x> is 0 the result is undefined. A
236			common use case is to compute the integer binary logarithm, i.e.,
237			floor(log2(n)). For example:
238
239	sf-exg	1.12	ecb_ctz32(3) = 0
240			ecb_ctz32(6) = 1
241	sf-exg	1.11
242	root	1.3	=item int ecb_popcount32 (uint32_t x)
243
244	sf-exg	1.11	Returns the number of bits set to 1 in C<x>. For example:
245
246			ecb_popcount32(7) = 3
247			ecb_popcount32(255) = 8
248
249	root	1.8	=item uint32_t ecb_bswap16 (uint32_t x)
250
251	root	1.3	=item uint32_t ecb_bswap32 (uint32_t x)
252
253			=item uint32_t ecb_rotr32 (uint32_t x, unsigned int count)
254
255			=item uint32_t ecb_rotl32 (uint32_t x, unsigned int count)
256
257	sf-exg	1.11	These two functions return the value of C<x> after shifting all the bits
258			by C<count> positions to the right or left respectively.
259
260	root	1.3	=back
261	root	1.1
262			=head2 ARITHMETIC
263
264	root	1.3	=over 4
265
266			=item x = ecb_mod (m, n) [MACRO]
267
268	sf-exg	1.11	Returns the positive remainder of the modulo operation between C<m>
269			and C<n>.
270
271	root	1.3	=back
272	root	1.1
273			=head2 UTILITY
274
275	root	1.3	=over 4
276
277	root	1.8	=item element_count = ecb_array_length (name) [MACRO]
278	root	1.3
279			=back
280	root	1.1
281