1 /************************************************************************** 2 * 3 * Copyright 2008 Tungsten Graphics, Inc., Cedar Park, Texas. 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 TUNGSTEN GRAPHICS 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 34 struct u_rect { 35 int x0, x1; 36 int y0, y1; 37 }; 38 39 /* Do two rectangles intersect? 40 */ 41 static INLINE boolean 42 u_rect_test_intersection(const struct u_rect *a, 43 const struct u_rect *b) 44 { 45 return (!(a->x1 < b->x0 || 46 b->x1 < a->x0 || 47 a->y1 < b->y0 || 48 b->y1 < a->y0)); 49 } 50 51 /* Find the intersection of two rectangles known to intersect. 52 */ 53 static INLINE void 54 u_rect_find_intersection(const struct u_rect *a, 55 struct u_rect *b) 56 { 57 /* Caller should verify intersection exists before calling. 58 */ 59 if (b->x0 < a->x0) b->x0 = a->x0; 60 if (b->x1 > a->x1) b->x1 = a->x1; 61 if (b->y0 < a->y0) b->y0 = a->y0; 62 if (b->y1 > a->y1) b->y1 = a->y1; 63 } 64 65 66 static INLINE void 67 u_rect_possible_intersection(const struct u_rect *a, 68 struct u_rect *b) 69 { 70 if (u_rect_test_intersection(a,b)) { 71 u_rect_find_intersection(a,b); 72 } 73 else { 74 b->x0 = b->x1 = b->y0 = b->y1 = 0; 75 } 76 } 77 78 #include "pipe/p_format.h" 79 #include "util/u_pack_color.h" 80 81 82 83 /********************************************************************** 84 * Pipe copy/fill rect helpers. 85 */ 86 87 /* These really should move to a different file: 88 */ 89 #include "pipe/p_format.h" 90 91 extern void 92 util_copy_rect(ubyte * dst, enum pipe_format format, 93 unsigned dst_stride, unsigned dst_x, unsigned dst_y, 94 unsigned width, unsigned height, const ubyte * src, 95 int src_stride, unsigned src_x, unsigned src_y); 96 97 extern void 98 util_fill_rect(ubyte * dst, enum pipe_format format, 99 unsigned dst_stride, unsigned dst_x, unsigned dst_y, 100 unsigned width, unsigned height, union util_color *uc); 101 102 103 #endif /* U_RECT_H */ 104