Subversion Repositories Kolibri OS

Rev

Blame | Last modification | View Log | RSS feed

  1. /**************************************************************************
  2.  *
  3.  * Copyright 2008 VMware, Inc.
  4.  * All Rights Reserved.
  5.  *
  6.  * Permission is hereby granted, free of charge, to any person obtaining a
  7.  * copy of this software and associated documentation files (the
  8.  * "Software"), to deal in the Software without restriction, including
  9.  * without limitation the rights to use, copy, modify, merge, publish,
  10.  * distribute, sub license, and/or sell copies of the Software, and to
  11.  * permit persons to whom the Software is furnished to do so, subject to
  12.  * the following conditions:
  13.  *
  14.  * The above copyright notice and this permission notice (including the
  15.  * next paragraph) shall be included in all copies or substantial portions
  16.  * of the Software.
  17.  *
  18.  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
  19.  * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  20.  * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT.
  21.  * IN NO EVENT SHALL VMWARE AND/OR ITS SUPPLIERS BE LIABLE FOR
  22.  * ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
  23.  * TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
  24.  * SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
  25.  *
  26.  **************************************************************************/
  27.  
  28.  
  29. #ifndef U_RECT_H
  30. #define U_RECT_H
  31.  
  32. #include "pipe/p_compiler.h"
  33. #include "util/u_math.h"
  34.  
  35. #ifdef __cplusplus
  36. extern "C" {
  37. #endif
  38.  
  39. struct u_rect {
  40.    int x0, x1;
  41.    int y0, y1;
  42. };
  43.  
  44. /* Do two rectangles intersect?
  45.  */
  46. static INLINE boolean
  47. u_rect_test_intersection(const struct u_rect *a,
  48.                          const struct u_rect *b)
  49. {
  50.    return (!(a->x1 < b->x0 ||
  51.              b->x1 < a->x0 ||
  52.              a->y1 < b->y0 ||
  53.              b->y1 < a->y0));
  54. }
  55.  
  56. /* Find the intersection of two rectangles known to intersect.
  57.  */
  58. static INLINE void
  59. u_rect_find_intersection(const struct u_rect *a,
  60.                          struct u_rect *b)
  61. {
  62.    /* Caller should verify intersection exists before calling.
  63.     */
  64.    if (b->x0 < a->x0) b->x0 = a->x0;
  65.    if (b->x1 > a->x1) b->x1 = a->x1;
  66.    if (b->y0 < a->y0) b->y0 = a->y0;
  67.    if (b->y1 > a->y1) b->y1 = a->y1;
  68. }
  69.  
  70.  
  71. static INLINE int
  72. u_rect_area(const struct u_rect *r)
  73. {
  74.    return (r->x1 - r->x0) * (r->y1 - r->y0);
  75. }
  76.  
  77. static INLINE void
  78. u_rect_possible_intersection(const struct u_rect *a,
  79.                              struct u_rect *b)
  80. {
  81.    if (u_rect_test_intersection(a,b)) {
  82.       u_rect_find_intersection(a,b);
  83.    }
  84.    else {
  85.       b->x0 = b->x1 = b->y0 = b->y1 = 0;
  86.    }
  87. }
  88.  
  89. /* Set @d to a rectangle that covers both @a and @b.
  90.  */
  91. static INLINE void
  92. u_rect_union(struct u_rect *d, const struct u_rect *a, const struct u_rect *b)
  93. {
  94.    d->x0 = MIN2(a->x0, b->x0);
  95.    d->y0 = MIN2(a->y0, b->y0);
  96.    d->x1 = MAX2(a->x1, b->x1);
  97.    d->y1 = MAX2(a->y1, b->y1);
  98. }
  99.  
  100. #ifdef __cplusplus
  101. }
  102. #endif
  103.  
  104. #endif /* U_RECT_H */
  105.