source: mainline/kernel/generic/include/macros.h@ f1d6866

lfn serial ticket/834-toolchain-update topic/msim-upgrade topic/simplify-dev-export
Last change on this file since f1d6866 was 933cadf, checked in by Martin Decky <martin@…>, 14 years ago

use binary suffixes in printouts where appropriate

  • Property mode set to 100644
File size: 3.8 KB
RevLine 
[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]51NO_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]68NO_TRACE static inline int iswithin(uint64_t s1, uint64_t sz1, uint64_t s2,
69 uint64_t sz2)
[e2650d3]70{
[4738d84]71 uint64_t e1 = s1 + sz1;
72 uint64_t e2 = s2 + sz2;
[e2650d3]73
74 return ((s1 <= s2) && (e1 >= e2));
75}
76
[afdce6eb]77#endif /* __ASM__ */
78
79#define isdigit(d) (((d) >= '0') && ((d) <= '9'))
80#define islower(c) (((c) >= 'a') && ((c) <= 'z'))
81#define isupper(c) (((c) >= 'A') && ((c) <= 'Z'))
82#define isalpha(c) (is_lower((c)) || is_upper((c)))
83#define isalphanum(c) (is_alpha((c)) || is_digit((c)))
84#define isspace(c) \
85 (((c) == ' ') || ((c) == '\t') || ((c) == '\n') || ((c) == '\r'))
86
87#define min(a, b) ((a) < (b) ? (a) : (b))
88#define max(a, b) ((a) > (b) ? (a) : (b))
89
90#define min3(a, b, c) ((a) < (b) ? (min(a, c)) : (min(b, c)))
91#define max3(a, b, c) ((a) > (b) ? (max(a, c)) : (max(b, c)))
92
[93165be]93/* Compute overlapping of physical addresses */
[e2650d3]94#define PA_OVERLAPS(x, szx, y, szy) \
[4541ae4]95 overlaps(KA2PA((x)), (szx), KA2PA((y)), (szy))
[d227101]96
[933cadf]97#define KiB2SIZE(kb) ((kb) << 10)
98#define MiB2SIZE(mb) ((mb) << 20)
[edebc15c]99
[6bf612b]100#define STRING(arg) STRING_ARG(arg)
101#define STRING_ARG(arg) #arg
[93165be]102
[052f535]103#define LOWER32(arg) (((uint64_t) (arg)) & UINT32_C(0xffffffff))
104#define UPPER32(arg) (((((uint64_t) arg)) >> 32) & UINT32_C(0xffffffff))
[95ad426]105
[8f4bc1f]106#define MERGE_LOUP32(lo, up) \
[052f535]107 ((((uint64_t) (lo)) & UINT32_C(0xffffffff)) \
108 | ((((uint64_t) (up)) & UINT32_C(0xffffffff)) << 32))
[95ad426]109
[53634f9]110/** Pseudorandom generator
111 *
112 * A pretty standard linear congruential pseudorandom
113 * number generator (m = 2^32 or 2^64 depending on architecture).
114 *
115 */
116#define RANDI(seed) \
117 ({ \
118 (seed) = 1103515245 * (seed) + 12345; \
119 (seed); \
120 })
121
[ff3b3197]122#endif
[b45c443]123
[d227101]124/** @}
[b45c443]125 */
Note: See TracBrowser for help on using the repository browser.