[ff3b3197] | 1 | /*
|
---|
[df4ed85] | 2 | * Copyright (c) 2005 Jakub Jermar
|
---|
[ff3b3197] | 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 |
|
---|
[6bf612b] | 29 | /** @addtogroup generic
|
---|
[b45c443] | 30 | * @{
|
---|
| 31 | */
|
---|
| 32 | /** @file
|
---|
| 33 | */
|
---|
| 34 |
|
---|
[0fa6044] | 35 | #ifndef KERN_MACROS_H_
|
---|
| 36 | #define KERN_MACROS_H_
|
---|
[ff3b3197] | 37 |
|
---|
[afdce6eb] | 38 | #ifndef __ASM__
|
---|
[d227101] | 39 |
|
---|
[d99c1d2] | 40 | #include <typedefs.h>
|
---|
[7a0359b] | 41 | #include <trace.h>
|
---|
[f4338d2] | 42 |
|
---|
[edebc15c] | 43 | /** Return true if the intervals overlap.
|
---|
[0fa6044] | 44 | *
|
---|
[6bf612b] | 45 | * @param s1 Start address of the first interval.
|
---|
| 46 | * @param sz1 Size of the first interval.
|
---|
| 47 | * @param s2 Start address of the second interval.
|
---|
| 48 | * @param sz2 Size of the second interval.
|
---|
[e2650d3] | 49 | *
|
---|
[0fa6044] | 50 | */
|
---|
[4738d84] | 51 | NO_TRACE static inline int overlaps(uint64_t s1, uint64_t sz1, uint64_t s2,
|
---|
| 52 | uint64_t sz2)
|
---|
[93165be] | 53 | {
|
---|
[4738d84] | 54 | uint64_t e1 = s1 + sz1;
|
---|
| 55 | uint64_t e2 = s2 + sz2;
|
---|
[6bf612b] | 56 |
|
---|
| 57 | return ((s1 < e2) && (s2 < e1));
|
---|
[93165be] | 58 | }
|
---|
[43b1e86] | 59 |
|
---|
[e2650d3] | 60 | /** Return true if the second interval is within the first interval.
|
---|
| 61 | *
|
---|
| 62 | * @param s1 Start address of the first interval.
|
---|
| 63 | * @param sz1 Size of the first interval.
|
---|
| 64 | * @param s2 Start address of the second interval.
|
---|
| 65 | * @param sz2 Size of the second interval.
|
---|
| 66 | *
|
---|
| 67 | */
|
---|
[4738d84] | 68 | NO_TRACE static inline int iswithin(uint64_t s1, uint64_t sz1, uint64_t s2,
|
---|
| 69 | uint64_t sz2)
|
---|
[e2650d3] | 70 | {
|
---|
[33ca0f5] | 71 | uint64_t e1;
|
---|
| 72 | uint64_t e2;
|
---|
| 73 |
|
---|
| 74 | /* Handle the two corner cases when either sz1 or sz2 are zero. */
|
---|
| 75 | if (sz1 == 0)
|
---|
| 76 | return (s1 == s2) && (sz2 == 0);
|
---|
| 77 | e1 = s1 + sz1 - 1;
|
---|
| 78 | if (sz2 == 0)
|
---|
| 79 | return (s1 <= s2) && (s2 <= e1);
|
---|
| 80 | e2 = s2 + sz2 - 1;
|
---|
| 81 |
|
---|
| 82 | /* e1 and e2 are end addresses, the sum is imune to overflow */
|
---|
[e2650d3] | 83 | return ((s1 <= s2) && (e1 >= e2));
|
---|
| 84 | }
|
---|
| 85 |
|
---|
[afdce6eb] | 86 | #endif /* __ASM__ */
|
---|
| 87 |
|
---|
[e6a6c02] | 88 | #define ispwr2(x) (((x) & ((x) - 1)) == 0)
|
---|
| 89 |
|
---|
[afdce6eb] | 90 | #define isdigit(d) (((d) >= '0') && ((d) <= '9'))
|
---|
| 91 | #define islower(c) (((c) >= 'a') && ((c) <= 'z'))
|
---|
| 92 | #define isupper(c) (((c) >= 'A') && ((c) <= 'Z'))
|
---|
| 93 | #define isalpha(c) (is_lower((c)) || is_upper((c)))
|
---|
| 94 | #define isalphanum(c) (is_alpha((c)) || is_digit((c)))
|
---|
| 95 | #define isspace(c) \
|
---|
| 96 | (((c) == ' ') || ((c) == '\t') || ((c) == '\n') || ((c) == '\r'))
|
---|
| 97 |
|
---|
| 98 | #define min(a, b) ((a) < (b) ? (a) : (b))
|
---|
| 99 | #define max(a, b) ((a) > (b) ? (a) : (b))
|
---|
| 100 |
|
---|
| 101 | #define min3(a, b, c) ((a) < (b) ? (min(a, c)) : (min(b, c)))
|
---|
| 102 | #define max3(a, b, c) ((a) > (b) ? (max(a, c)) : (max(b, c)))
|
---|
| 103 |
|
---|
[93165be] | 104 | /* Compute overlapping of physical addresses */
|
---|
[e2650d3] | 105 | #define PA_OVERLAPS(x, szx, y, szy) \
|
---|
[4541ae4] | 106 | overlaps(KA2PA((x)), (szx), KA2PA((y)), (szy))
|
---|
[d227101] | 107 |
|
---|
[933cadf] | 108 | #define KiB2SIZE(kb) ((kb) << 10)
|
---|
| 109 | #define MiB2SIZE(mb) ((mb) << 20)
|
---|
[edebc15c] | 110 |
|
---|
[6bf612b] | 111 | #define STRING(arg) STRING_ARG(arg)
|
---|
| 112 | #define STRING_ARG(arg) #arg
|
---|
[93165be] | 113 |
|
---|
[052f535] | 114 | #define LOWER32(arg) (((uint64_t) (arg)) & UINT32_C(0xffffffff))
|
---|
| 115 | #define UPPER32(arg) (((((uint64_t) arg)) >> 32) & UINT32_C(0xffffffff))
|
---|
[95ad426] | 116 |
|
---|
[8f4bc1f] | 117 | #define MERGE_LOUP32(lo, up) \
|
---|
[052f535] | 118 | ((((uint64_t) (lo)) & UINT32_C(0xffffffff)) \
|
---|
| 119 | | ((((uint64_t) (up)) & UINT32_C(0xffffffff)) << 32))
|
---|
[95ad426] | 120 |
|
---|
[53634f9] | 121 | /** Pseudorandom generator
|
---|
| 122 | *
|
---|
| 123 | * A pretty standard linear congruential pseudorandom
|
---|
| 124 | * number generator (m = 2^32 or 2^64 depending on architecture).
|
---|
| 125 | *
|
---|
| 126 | */
|
---|
| 127 | #define RANDI(seed) \
|
---|
| 128 | ({ \
|
---|
| 129 | (seed) = 1103515245 * (seed) + 12345; \
|
---|
| 130 | (seed); \
|
---|
| 131 | })
|
---|
| 132 |
|
---|
[ff3b3197] | 133 | #endif
|
---|
[b45c443] | 134 |
|
---|
[d227101] | 135 | /** @}
|
---|
[b45c443] | 136 | */
|
---|