[ff3b3197] | 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 | #ifndef __MACROS_H__
|
---|
| 30 | #define __MACROS_H__
|
---|
| 31 |
|
---|
| 32 | #define is_digit(d) (((d) >= '0') && ((d)<='9'))
|
---|
| 33 | #define is_lower(c) (((c) >= 'a') && ((c) <= 'z'))
|
---|
| 34 | #define is_upper(c) (((c) >= 'A') && ((c) <= 'Z'))
|
---|
| 35 | #define is_alpha(c) (is_lower(c) || is_upper(c))
|
---|
| 36 | #define is_alphanum(c) (is_alpha(c) || is_digit(c))
|
---|
| 37 | #define is_white(c) (((c) == ' ') || ((c) == '\t') || ((c) == '\n') || ((c) == '\r'))
|
---|
| 38 |
|
---|
[f4338d2] | 39 | #define min(a,b) ((a)<(b)?(a):(b))
|
---|
| 40 | #define max(a,b) ((a)>(b)?(a):(b))
|
---|
| 41 |
|
---|
[5a7d9d1] | 42 | /** Return true if the interlvals overlap. */
|
---|
| 43 | static inline int overlaps(__address s1, size_t sz1, __address s2, size_t sz2)
|
---|
[93165be] | 44 | {
|
---|
| 45 | __address e1 = s1+sz1;
|
---|
| 46 | __address e2 = s2+sz2;
|
---|
| 47 |
|
---|
| 48 | return s1 < e2 && s2 < e1;
|
---|
| 49 | }
|
---|
| 50 | /* Compute overlapping of physical addresses */
|
---|
| 51 | #define PA_overlaps(x,szx,y,szy) overlaps(KA2PA(x),szx,KA2PA(y), szy)
|
---|
| 52 |
|
---|
[ff3b3197] | 53 | #endif
|
---|