Rev 3425 | Go to most recent revision | Show entire file | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
| Rev 3425 | Rev 4377 | ||
|---|---|---|---|
| Line 24... | Line 24... | ||
| 24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
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 |
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. |
26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 27 | */ |
27 | */ |
| 28 | 28 | ||
| 29 | /** @addtogroup generic |
29 | /** @addtogroup generic |
| 30 | * @{ |
30 | * @{ |
| 31 | */ |
31 | */ |
| 32 | /** @file |
32 | /** @file |
| 33 | */ |
33 | */ |
| 34 | 34 | ||
| 35 | #ifndef KERN_MACROS_H_ |
35 | #ifndef KERN_MACROS_H_ |
| 36 | #define KERN_MACROS_H_ |
36 | #define KERN_MACROS_H_ |
| 37 | 37 | ||
| 38 | #include <arch/types.h> |
38 | #ifndef __ASM__ |
| 39 | - | ||
| 40 | #define isdigit(d) (((d) >= '0') && ((d) <= '9')) |
- | |
| 41 | #define islower(c) (((c) >= 'a') && ((c) <= 'z')) |
- | |
| 42 | #define isupper(c) (((c) >= 'A') && ((c) <= 'Z')) |
- | |
| 43 | #define isalpha(c) (is_lower((c)) || is_upper((c))) |
- | |
| 44 | #define isalphanum(c) (is_alpha((c)) || is_digit((c))) |
- | |
| 45 | #define isspace(c) (((c) == ' ') || ((c) == '\t') || ((c) == '\n') || \ |
- | |
| 46 | ((c) == '\r')) |
- | |
| 47 | 39 | ||
| 48 | #define min(a,b) ((a) < (b) ? (a) : (b)) |
40 | #include <arch/types.h> |
| 49 | #define max(a,b) ((a) > (b) ? (a) : (b)) |
- | |
| 50 | 41 | ||
| 51 | /** Return true if the intervals overlap. |
42 | /** Return true if the intervals overlap. |
| 52 | * |
43 | * |
| 53 | * @param s1 Start address of the first interval. |
44 | * @param s1 Start address of the first interval. |
| 54 | * @param sz1 Size of the first interval. |
45 | * @param sz1 Size of the first interval. |
| 55 | * @param s2 Start address of the second interval. |
46 | * @param s2 Start address of the second interval. |
| 56 | * @param sz2 Size of the second interval. |
47 | * @param sz2 Size of the second interval. |
| 57 | */ |
48 | */ |
| 58 | static inline int overlaps(uintptr_t s1, size_t sz1, uintptr_t s2, size_t sz2) |
49 | static inline int overlaps(uintptr_t s1, size_t sz1, uintptr_t s2, size_t sz2) |
| 59 | { |
50 | { |
| 60 | uintptr_t e1 = s1 + sz1; |
51 | uintptr_t e1 = s1 + sz1; |
| 61 | uintptr_t e2 = s2 + sz2; |
52 | uintptr_t e2 = s2 + sz2; |
| 62 | 53 | ||
| 63 | return (s1 < e2) && (s2 < e1); |
54 | return ((s1 < e2) && (s2 < e1)); |
| 64 | } |
55 | } |
| 65 | 56 | ||
| - | 57 | #endif /* __ASM__ */ |
|
| - | 58 | ||
| - | 59 | #define isdigit(d) (((d) >= '0') && ((d) <= '9')) |
|
| - | 60 | #define islower(c) (((c) >= 'a') && ((c) <= 'z')) |
|
| - | 61 | #define isupper(c) (((c) >= 'A') && ((c) <= 'Z')) |
|
| - | 62 | #define isalpha(c) (is_lower((c)) || is_upper((c))) |
|
| - | 63 | #define isalphanum(c) (is_alpha((c)) || is_digit((c))) |
|
| - | 64 | #define isspace(c) \ |
|
| - | 65 | (((c) == ' ') || ((c) == '\t') || ((c) == '\n') || ((c) == '\r')) |
|
| - | 66 | ||
| - | 67 | #define min(a, b) ((a) < (b) ? (a) : (b)) |
|
| - | 68 | #define max(a, b) ((a) > (b) ? (a) : (b)) |
|
| - | 69 | ||
| - | 70 | #define min3(a, b, c) ((a) < (b) ? (min(a, c)) : (min(b, c))) |
|
| - | 71 | #define max3(a, b, c) ((a) > (b) ? (max(a, c)) : (max(b, c))) |
|
| - | 72 | ||
| 66 | /* Compute overlapping of physical addresses */ |
73 | /* Compute overlapping of physical addresses */ |
| 67 | #define PA_overlaps(x, szx, y, szy) \ |
74 | #define PA_overlaps(x, szx, y, szy) \ |
| 68 | overlaps(KA2PA((x)), (szx), KA2PA((y)), (szy)) |
75 | overlaps(KA2PA((x)), (szx), KA2PA((y)), (szy)) |
| 69 | 76 | ||
| 70 | #define SIZE2KB(size) ((size) >> 10) |
77 | #define SIZE2KB(size) ((size) >> 10) |
| 71 | #define SIZE2MB(size) ((size) >> 20) |
78 | #define SIZE2MB(size) ((size) >> 20) |
| - | 79 | ||
| - | 80 | #define KB2SIZE(kb) ((kb) << 10) |
|
| - | 81 | #define MB2SIZE(mb) ((mb) << 20) |
|
| 72 | 82 | ||
| 73 | #define KB2SIZE(kb) ((kb) << 10) |
83 | #define STRING(arg) STRING_ARG(arg) |
| 74 | #define MB2SIZE(mb) ((mb) << 20) |
84 | #define STRING_ARG(arg) #arg |
| 75 | 85 | ||
| 76 | #define STRING(arg) STRING_ARG(arg) |
86 | /** Pseudorandom generator |
| - | 87 | * |
|
| - | 88 | * A pretty standard linear congruential pseudorandom |
|
| - | 89 | * number generator (m = 2^32 or 2^64 depending on architecture). |
|
| - | 90 | * |
|
| - | 91 | */ |
|
| 77 | #define STRING_ARG(arg) #arg |
92 | #define RANDI(seed) \ |
| - | 93 | ({ \ |
|
| - | 94 | (seed) = 1103515245 * (seed) + 12345; \ |
|
| - | 95 | (seed); \ |
|
| - | 96 | }) |
|
| 78 | 97 | ||
| 79 | #endif |
98 | #endif |
| 80 | 99 | ||
| 81 | /** @} |
100 | /** @} |
| 82 | */ |
101 | */ |