1 | /*
|
---|
2 | * Copyright (c) 2005 Jakub 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 |
|
---|
29 | /** @addtogroup generic
|
---|
30 | * @{
|
---|
31 | */
|
---|
32 | /** @file
|
---|
33 | */
|
---|
34 |
|
---|
35 | #ifndef KERN_MACROS_H_
|
---|
36 | #define KERN_MACROS_H_
|
---|
37 |
|
---|
38 | #ifndef __ASM__
|
---|
39 |
|
---|
40 | #include <typedefs.h>
|
---|
41 |
|
---|
42 | /** Return true if the intervals overlap.
|
---|
43 | *
|
---|
44 | * @param s1 Start address of the first interval.
|
---|
45 | * @param sz1 Size of the first interval.
|
---|
46 | * @param s2 Start address of the second interval.
|
---|
47 | * @param sz2 Size of the second interval.
|
---|
48 | */
|
---|
49 | static inline int __attribute__((no_instrument_function))
|
---|
50 | overlaps(uintptr_t s1, size_t sz1, uintptr_t s2, size_t sz2)
|
---|
51 | {
|
---|
52 | uintptr_t e1 = s1 + sz1;
|
---|
53 | uintptr_t e2 = s2 + sz2;
|
---|
54 |
|
---|
55 | return ((s1 < e2) && (s2 < e1));
|
---|
56 | }
|
---|
57 |
|
---|
58 | #endif /* __ASM__ */
|
---|
59 |
|
---|
60 | #define isdigit(d) (((d) >= '0') && ((d) <= '9'))
|
---|
61 | #define islower(c) (((c) >= 'a') && ((c) <= 'z'))
|
---|
62 | #define isupper(c) (((c) >= 'A') && ((c) <= 'Z'))
|
---|
63 | #define isalpha(c) (is_lower((c)) || is_upper((c)))
|
---|
64 | #define isalphanum(c) (is_alpha((c)) || is_digit((c)))
|
---|
65 | #define isspace(c) \
|
---|
66 | (((c) == ' ') || ((c) == '\t') || ((c) == '\n') || ((c) == '\r'))
|
---|
67 |
|
---|
68 | #define min(a, b) ((a) < (b) ? (a) : (b))
|
---|
69 | #define max(a, b) ((a) > (b) ? (a) : (b))
|
---|
70 |
|
---|
71 | #define min3(a, b, c) ((a) < (b) ? (min(a, c)) : (min(b, c)))
|
---|
72 | #define max3(a, b, c) ((a) > (b) ? (max(a, c)) : (max(b, c)))
|
---|
73 |
|
---|
74 | /* Compute overlapping of physical addresses */
|
---|
75 | #define PA_overlaps(x, szx, y, szy) \
|
---|
76 | overlaps(KA2PA((x)), (szx), KA2PA((y)), (szy))
|
---|
77 |
|
---|
78 | #define SIZE2KB(size) ((size) >> 10)
|
---|
79 | #define SIZE2MB(size) ((size) >> 20)
|
---|
80 |
|
---|
81 | #define KB2SIZE(kb) ((kb) << 10)
|
---|
82 | #define MB2SIZE(mb) ((mb) << 20)
|
---|
83 |
|
---|
84 | #define STRING(arg) STRING_ARG(arg)
|
---|
85 | #define STRING_ARG(arg) #arg
|
---|
86 |
|
---|
87 | #define LOWER32(arg) (((uint64_t) (arg)) & 0xffffffff)
|
---|
88 | #define UPPER32(arg) (((((uint64_t) arg)) >> 32) & 0xffffffff)
|
---|
89 |
|
---|
90 | #define MERGE_LOUP32(lo, up) \
|
---|
91 | ((((uint64_t) (lo)) & 0xffffffff) \
|
---|
92 | | ((((uint64_t) (up)) & 0xffffffff) << 32))
|
---|
93 |
|
---|
94 | /** Pseudorandom generator
|
---|
95 | *
|
---|
96 | * A pretty standard linear congruential pseudorandom
|
---|
97 | * number generator (m = 2^32 or 2^64 depending on architecture).
|
---|
98 | *
|
---|
99 | */
|
---|
100 | #define RANDI(seed) \
|
---|
101 | ({ \
|
---|
102 | (seed) = 1103515245 * (seed) + 12345; \
|
---|
103 | (seed); \
|
---|
104 | })
|
---|
105 |
|
---|
106 | #endif
|
---|
107 |
|
---|
108 | /** @}
|
---|
109 | */
|
---|