Subversion Repositories HelenOS

Rev

Rev 2071 | Rev 2572 | Go to most recent revision | Blame | Compare with Previous | Last modification | View Log | Download | RSS feed

  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. #include <arch/types.h>
  39.  
  40. #define is_digit(d) (((d) >= '0') && ((d) <= '9'))
  41. #define is_lower(c) (((c) >= 'a') && ((c) <= 'z'))
  42. #define is_upper(c) (((c) >= 'A') && ((c) <= 'Z'))
  43. #define is_alpha(c) (is_lower(c) || is_upper(c))
  44. #define is_alphanum(c)  (is_alpha(c) || is_digit(c))
  45. #define is_white(c) (((c) == ' ') || ((c) == '\t') || ((c) == '\n') || \
  46.                 ((c) == '\r'))
  47.  
  48. #define min(a,b)    ((a) < (b) ? (a) : (b))
  49. #define max(a,b)    ((a) > (b) ? (a) : (b))
  50.  
  51. /** Return true if the interlvals overlap.
  52.  *
  53.  * @param s1 Start address of the first interval.
  54.  * @param sz1 Size of the first interval.
  55.  * @param s2 Start address of the second interval.
  56.  * @param sz2 Size of the second interval.
  57.  */
  58. static inline int overlaps(uintptr_t s1, size_t sz1, uintptr_t s2, size_t sz2)
  59. {
  60.     uintptr_t e1 = s1 + sz1;
  61.     uintptr_t e2 = s2 + sz2;
  62.  
  63.     return (s1 < e2) && (s2 < e1);
  64. }
  65. /* Compute overlapping of physical addresses */
  66. #define PA_overlaps(x, szx, y, szy) overlaps(KA2PA(x), szx, KA2PA(y), szy)
  67.  
  68. #define STRING(arg) STRING_ARG(arg)
  69. #define STRING_ARG(arg) #arg
  70.  
  71. #endif
  72.  
  73. /** @}
  74.  */
  75.