Rev 3022 | Go to most recent revision | Details | Compare with Previous | Last modification | View Log | RSS feed
Rev | Author | Line No. | Line |
---|---|---|---|
1125 | jermar | 1 | /* |
2071 | jermar | 2 | * Copyright (c) 2005 Jakub Jermar |
1125 | jermar | 3 | * All rights reserved. |
4 | * |
||
5 | * Redistribution and use in source and binary forms, with or without |
||
6 | * modification, are permitted provided that the following conditions |
||
7 | * are met: |
||
8 | * |
||
9 | * - Redistributions of source code must retain the above copyright |
||
10 | * notice, this list of conditions and the following disclaimer. |
||
11 | * - Redistributions in binary form must reproduce the above copyright |
||
12 | * notice, this list of conditions and the following disclaimer in the |
||
13 | * documentation and/or other materials provided with the distribution. |
||
14 | * - The name of the author may not be used to endorse or promote products |
||
15 | * derived from this software without specific prior written permission. |
||
16 | * |
||
17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
||
18 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
||
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
||
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
||
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
||
22 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
||
23 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
||
24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
||
25 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF |
||
26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
||
27 | */ |
||
28 | |||
1866 | jermar | 29 | /** @addtogroup libc |
1653 | cejka | 30 | * @{ |
31 | */ |
||
32 | /** @file |
||
33 | */ |
||
34 | |||
1866 | jermar | 35 | #ifndef LIBC_ALIGN_H_ |
36 | #define LIBC_ALIGN_H_ |
||
1125 | jermar | 37 | |
4055 | trochtova | 38 | /** Align to the nearest lower address which is a power of two. |
1125 | jermar | 39 | * |
4055 | trochtova | 40 | * @param s Address or size to be aligned. |
41 | * @param a Size of alignment, must be power of 2. |
||
1125 | jermar | 42 | */ |
43 | #define ALIGN_DOWN(s, a) ((s) & ~((a) - 1)) |
||
44 | |||
45 | |||
4055 | trochtova | 46 | /** Align to the nearest higher address which is a power of two. |
1125 | jermar | 47 | * |
4055 | trochtova | 48 | * @param s Address or size to be aligned. |
49 | * @param a Size of alignment, must be power of 2. |
||
1125 | jermar | 50 | */ |
1501 | palkovsky | 51 | #define ALIGN_UP(s, a) ((long)((s) + ((a) - 1)) & ~((long) (a) - 1)) |
1125 | jermar | 52 | |
4055 | trochtova | 53 | /** Round up to the nearest higher boundary. |
54 | * |
||
55 | * @param n Number to be aligned. |
||
56 | * @param b Boundary, arbitrary unsigned number. |
||
57 | */ |
||
58 | #define ROUND_UP(n, b) (((n) / (b) + ((n) % (b) != 0)) * (b)) |
||
59 | |||
1125 | jermar | 60 | #endif |
1653 | cejka | 61 | |
1866 | jermar | 62 | /** @} |
1653 | cejka | 63 | */ |