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