Wed, 02 Jan 2002 16:39:39 +0000
started work on bitblt optimization - split rotate functions from bitblt.
eric@42 | 1 | #include <stdio.h> |
eric@2 | 2 | #include <stdlib.h> |
eric@42 | 3 | #include <string.h> |
eric@2 | 4 | |
eric@11 | 5 | #include "type.h" |
eric@2 | 6 | #include "bitblt.h" |
eric@2 | 7 | |
eric@42 | 8 | |
eric@42 | 9 | #define CALC_ROWBYTES(width) (((width) - 1) / 8 + 1) |
eric@42 | 10 | |
eric@42 | 11 | |
eric@42 | 12 | static const u8 bit_reverse_byte [0x100] = |
eric@42 | 13 | { |
eric@42 | 14 | 0x00, 0x80, 0x40, 0xc0, 0x20, 0xa0, 0x60, 0xe0, |
eric@42 | 15 | 0x10, 0x90, 0x50, 0xd0, 0x30, 0xb0, 0x70, 0xf0, |
eric@42 | 16 | 0x08, 0x88, 0x48, 0xc8, 0x28, 0xa8, 0x68, 0xe8, |
eric@42 | 17 | 0x18, 0x98, 0x58, 0xd8, 0x38, 0xb8, 0x78, 0xf8, |
eric@42 | 18 | 0x04, 0x84, 0x44, 0xc4, 0x24, 0xa4, 0x64, 0xe4, |
eric@42 | 19 | 0x14, 0x94, 0x54, 0xd4, 0x34, 0xb4, 0x74, 0xf4, |
eric@42 | 20 | 0x0c, 0x8c, 0x4c, 0xcc, 0x2c, 0xac, 0x6c, 0xec, |
eric@42 | 21 | 0x1c, 0x9c, 0x5c, 0xdc, 0x3c, 0xbc, 0x7c, 0xfc, |
eric@42 | 22 | 0x02, 0x82, 0x42, 0xc2, 0x22, 0xa2, 0x62, 0xe2, |
eric@42 | 23 | 0x12, 0x92, 0x52, 0xd2, 0x32, 0xb2, 0x72, 0xf2, |
eric@42 | 24 | 0x0a, 0x8a, 0x4a, 0xca, 0x2a, 0xaa, 0x6a, 0xea, |
eric@42 | 25 | 0x1a, 0x9a, 0x5a, 0xda, 0x3a, 0xba, 0x7a, 0xfa, |
eric@42 | 26 | 0x06, 0x86, 0x46, 0xc6, 0x26, 0xa6, 0x66, 0xe6, |
eric@42 | 27 | 0x16, 0x96, 0x56, 0xd6, 0x36, 0xb6, 0x76, 0xf6, |
eric@42 | 28 | 0x0e, 0x8e, 0x4e, 0xce, 0x2e, 0xae, 0x6e, 0xee, |
eric@42 | 29 | 0x1e, 0x9e, 0x5e, 0xde, 0x3e, 0xbe, 0x7e, 0xfe, |
eric@42 | 30 | 0x01, 0x81, 0x41, 0xc1, 0x21, 0xa1, 0x61, 0xe1, |
eric@42 | 31 | 0x11, 0x91, 0x51, 0xd1, 0x31, 0xb1, 0x71, 0xf1, |
eric@42 | 32 | 0x09, 0x89, 0x49, 0xc9, 0x29, 0xa9, 0x69, 0xe9, |
eric@42 | 33 | 0x19, 0x99, 0x59, 0xd9, 0x39, 0xb9, 0x79, 0xf9, |
eric@42 | 34 | 0x05, 0x85, 0x45, 0xc5, 0x25, 0xa5, 0x65, 0xe5, |
eric@42 | 35 | 0x15, 0x95, 0x55, 0xd5, 0x35, 0xb5, 0x75, 0xf5, |
eric@42 | 36 | 0x0d, 0x8d, 0x4d, 0xcd, 0x2d, 0xad, 0x6d, 0xed, |
eric@42 | 37 | 0x1d, 0x9d, 0x5d, 0xdd, 0x3d, 0xbd, 0x7d, 0xfd, |
eric@42 | 38 | 0x03, 0x83, 0x43, 0xc3, 0x23, 0xa3, 0x63, 0xe3, |
eric@42 | 39 | 0x13, 0x93, 0x53, 0xd3, 0x33, 0xb3, 0x73, 0xf3, |
eric@42 | 40 | 0x0b, 0x8b, 0x4b, 0xcb, 0x2b, 0xab, 0x6b, 0xeb, |
eric@42 | 41 | 0x1b, 0x9b, 0x5b, 0xdb, 0x3b, 0xbb, 0x7b, 0xfb, |
eric@42 | 42 | 0x07, 0x87, 0x47, 0xc7, 0x27, 0xa7, 0x67, 0xe7, |
eric@42 | 43 | 0x17, 0x97, 0x57, 0xd7, 0x37, 0xb7, 0x77, 0xf7, |
eric@42 | 44 | 0x0f, 0x8f, 0x4f, 0xcf, 0x2f, 0xaf, 0x6f, 0xef, |
eric@42 | 45 | 0x1f, 0x9f, 0x5f, 0xdf, 0x3f, 0xbf, 0x7f, 0xff |
eric@42 | 46 | }; |
eric@42 | 47 | |
eric@42 | 48 | |
eric@42 | 49 | static u8 *temp_buffer; |
eric@42 | 50 | static u32 temp_buffer_size; |
eric@42 | 51 | |
eric@42 | 52 | static void realloc_temp_buffer (u32 size) |
eric@42 | 53 | { |
eric@42 | 54 | if (size <= temp_buffer_size) |
eric@42 | 55 | return; |
eric@42 | 56 | temp_buffer = realloc (temp_buffer, size); |
eric@42 | 57 | if (! temp_buffer) |
eric@42 | 58 | { |
eric@42 | 59 | fprintf (stderr, "realloc failed in bitblt library\n"); |
eric@42 | 60 | exit (2); |
eric@42 | 61 | } |
eric@42 | 62 | temp_buffer_size = size; |
eric@42 | 63 | } |
eric@42 | 64 | |
eric@42 | 65 | |
eric@2 | 66 | static inline u8 pixel_mask (x) |
eric@2 | 67 | { |
eric@2 | 68 | #ifdef LSB_LEFT |
eric@2 | 69 | return (1 << x); |
eric@2 | 70 | #else |
eric@2 | 71 | return (1 << (7 - x)); |
eric@2 | 72 | #endif |
eric@42 | 73 | }; |
eric@2 | 74 | |
eric@42 | 75 | Bitmap *create_bitmap (Rect *rect) |
eric@2 | 76 | { |
eric@2 | 77 | Bitmap *bitmap; |
eric@42 | 78 | u32 width = rect_width (rect); |
eric@42 | 79 | u32 height = rect_height (rect); |
eric@2 | 80 | |
eric@35 | 81 | if ((width <= 0) || (height <= 0)) |
eric@35 | 82 | return (NULL); |
eric@35 | 83 | |
eric@2 | 84 | bitmap = calloc (1, sizeof (Bitmap)); |
eric@2 | 85 | if (! bitmap) |
eric@2 | 86 | return (NULL); |
eric@42 | 87 | bitmap->rect = * rect; |
eric@42 | 88 | bitmap->rowbytes = CALC_ROWBYTES (width); |
eric@2 | 89 | bitmap->bits = calloc (height * bitmap->rowbytes, 1); |
eric@2 | 90 | if (! bitmap->bits) |
eric@2 | 91 | { |
eric@2 | 92 | free (bitmap); |
eric@2 | 93 | return (NULL); |
eric@2 | 94 | } |
eric@2 | 95 | return (bitmap); |
eric@2 | 96 | } |
eric@2 | 97 | |
eric@2 | 98 | void free_bitmap (Bitmap *bitmap) |
eric@2 | 99 | { |
eric@2 | 100 | free (bitmap->bits); |
eric@2 | 101 | free (bitmap); |
eric@2 | 102 | } |
eric@2 | 103 | |
eric@2 | 104 | boolean get_pixel (Bitmap *bitmap, Point coord) |
eric@2 | 105 | { |
eric@2 | 106 | u8 *p; |
eric@42 | 107 | if ((coord.x < bitmap->rect.min.x) || |
eric@42 | 108 | (coord.x >= bitmap->rect.max.x) || |
eric@42 | 109 | (coord.y < bitmap->rect.min.y) || |
eric@42 | 110 | (coord.y >= bitmap->rect.max.y)) |
eric@2 | 111 | return (0); |
eric@42 | 112 | p = bitmap->bits + |
eric@42 | 113 | (coord.y - bitmap->rect.min.y) * bitmap->rowbytes + |
eric@42 | 114 | (coord.x - bitmap->rect.min.x) / 8; |
eric@2 | 115 | return ((*p & pixel_mask (coord.x & 7)) != 0); |
eric@2 | 116 | } |
eric@2 | 117 | |
eric@2 | 118 | void set_pixel (Bitmap *bitmap, Point coord, boolean value) |
eric@2 | 119 | { |
eric@2 | 120 | u8 *p; |
eric@42 | 121 | if ((coord.x < bitmap->rect.min.x) || |
eric@42 | 122 | (coord.x >= bitmap->rect.max.x) || |
eric@42 | 123 | (coord.y < bitmap->rect.min.y) || |
eric@42 | 124 | (coord.y >= bitmap->rect.max.y)) |
eric@2 | 125 | return; |
eric@42 | 126 | p = bitmap->bits + |
eric@42 | 127 | (coord.y - bitmap->rect.min.y) * bitmap->rowbytes + |
eric@42 | 128 | (coord.x - bitmap->rect.min.x) / 8; |
eric@2 | 129 | if (value) |
eric@2 | 130 | *p |= pixel_mask (coord.x & 7); |
eric@2 | 131 | else |
eric@2 | 132 | *p &= (0xff ^ pixel_mask (coord.x & 7)); |
eric@2 | 133 | } |
eric@2 | 134 | |
eric@2 | 135 | |
eric@42 | 136 | /* modifies rect1 to be the intersection of rect1 and rect2; |
eric@42 | 137 | returns true if intersection is non-null */ |
eric@42 | 138 | static boolean clip_rect (Rect *rect1, Rect *rect2) |
eric@42 | 139 | { |
eric@42 | 140 | if (rect1->min.y > rect2->max.y) |
eric@42 | 141 | goto empty; |
eric@42 | 142 | if (rect1->min.y < rect2->min.y) |
eric@42 | 143 | { |
eric@42 | 144 | if (rect1->max.y < rect2->max.y) |
eric@42 | 145 | goto empty; |
eric@42 | 146 | rect1->min.y = rect2->min.y; |
eric@42 | 147 | } |
eric@42 | 148 | if (rect1->max.y > rect2->max.y) |
eric@42 | 149 | rect1->max.y = rect2->max.y; |
eric@42 | 150 | |
eric@42 | 151 | if (rect1->min.x > rect2->max.x) |
eric@42 | 152 | goto empty; |
eric@42 | 153 | if (rect1->min.x < rect2->min.x) |
eric@42 | 154 | { |
eric@42 | 155 | if (rect1->max.x < rect2->max.x) |
eric@42 | 156 | goto empty; |
eric@42 | 157 | rect1->min.x = rect2->min.x; |
eric@42 | 158 | } |
eric@42 | 159 | if (rect1->max.x > rect2->max.x) |
eric@42 | 160 | rect1->max.x = rect2->max.x; |
eric@42 | 161 | |
eric@42 | 162 | empty: |
eric@42 | 163 | rect1->min.x = rect1->min.y = |
eric@42 | 164 | rect1->max.x = rect1->max.y = 0; |
eric@42 | 165 | return (0); |
eric@42 | 166 | } |
eric@42 | 167 | |
eric@42 | 168 | |
eric@2 | 169 | Bitmap *bitblt (Bitmap *src_bitmap, |
eric@42 | 170 | Rect *src_rect, |
eric@2 | 171 | Bitmap *dest_bitmap, |
eric@42 | 172 | Point *dest_min, |
eric@2 | 173 | int tfn) |
eric@2 | 174 | { |
eric@2 | 175 | Point src_point, dest_point; |
eric@2 | 176 | |
eric@2 | 177 | if (! dest_bitmap) |
eric@2 | 178 | { |
eric@42 | 179 | Rect dest_rect = {{ 0, 0 }, { dest_min->x + rect_width (src_rect), |
eric@42 | 180 | dest_min->y + rect_height (src_rect) }}; |
eric@42 | 181 | dest_bitmap = create_bitmap (& dest_rect); |
eric@2 | 182 | if (! dest_bitmap) |
eric@2 | 183 | return (NULL); |
eric@2 | 184 | } |
eric@2 | 185 | |
eric@42 | 186 | for (src_point.y = src_rect->min.y; |
eric@42 | 187 | src_point.y < src_rect->max.y; |
eric@2 | 188 | src_point.y++) |
eric@2 | 189 | { |
eric@42 | 190 | dest_point.y = dest_min->y + src_point.y - src_rect->min.y; |
eric@42 | 191 | |
eric@42 | 192 | for (src_point.x = src_rect->min.x; |
eric@42 | 193 | src_point.x < src_rect->max.x; |
eric@2 | 194 | src_point.x++) |
eric@2 | 195 | { |
eric@2 | 196 | boolean a, b, c; |
eric@2 | 197 | |
eric@42 | 198 | dest_point.x = dest_min->x + src_point.x - src_rect->min.x; |
eric@3 | 199 | |
eric@2 | 200 | a = get_pixel (src_bitmap, src_point); |
eric@2 | 201 | b = get_pixel (dest_bitmap, dest_point); |
eric@2 | 202 | c = (tfn & (1 << (a * 2 + b))) != 0; |
eric@2 | 203 | |
eric@2 | 204 | set_pixel (dest_bitmap, dest_point, c); |
eric@2 | 205 | } |
eric@2 | 206 | } |
eric@2 | 207 | return (dest_bitmap); |
eric@2 | 208 | } |
eric@42 | 209 | |
eric@42 | 210 | |
eric@42 | 211 | /* in-place transformations */ |
eric@42 | 212 | void flip_h (Bitmap *src) |
eric@42 | 213 | { |
eric@42 | 214 | u8 *rp; /* row pointer */ |
eric@42 | 215 | u8 *p1; /* work src ptr */ |
eric@42 | 216 | u8 *p2; /* work dest ptr */ |
eric@42 | 217 | u16 d; |
eric@42 | 218 | s32 y; |
eric@42 | 219 | int shift; |
eric@42 | 220 | |
eric@42 | 221 | realloc_temp_buffer (src->rowbytes + 1); |
eric@42 | 222 | |
eric@42 | 223 | rp = src->bits; |
eric@42 | 224 | if ((rect_width (& src->rect) & 7) == 0) |
eric@42 | 225 | { |
eric@42 | 226 | for (y = src->rect.min.y; y < src->rect.max.y; y++) |
eric@42 | 227 | { |
eric@42 | 228 | memcpy (temp_buffer, rp, src->rowbytes); |
eric@42 | 229 | p1 = temp_buffer + src->rowbytes - 1; |
eric@42 | 230 | p2 = rp; |
eric@42 | 231 | |
eric@42 | 232 | while (p1 >= temp_buffer) |
eric@42 | 233 | *(p2++) = bit_reverse_byte [*(p1--)]; |
eric@42 | 234 | |
eric@42 | 235 | rp += src->rowbytes; |
eric@42 | 236 | } |
eric@42 | 237 | return; |
eric@42 | 238 | } |
eric@42 | 239 | |
eric@42 | 240 | temp_buffer [0] = 0; |
eric@42 | 241 | shift = 8 - (rect_width (& src->rect) & 7); |
eric@42 | 242 | |
eric@42 | 243 | for (y = src->rect.min.y; y < src->rect.max.y; y++) |
eric@42 | 244 | { |
eric@42 | 245 | memcpy (temp_buffer + 1, rp, src->rowbytes); |
eric@42 | 246 | p1 = temp_buffer + src->rowbytes; |
eric@42 | 247 | p2 = rp; |
eric@42 | 248 | |
eric@42 | 249 | d = *(p1--); |
eric@42 | 250 | |
eric@42 | 251 | while (p1 >= temp_buffer) |
eric@42 | 252 | { |
eric@42 | 253 | d = (d >> 8) | ((*(p1--)) << 8); |
eric@42 | 254 | *(p2++) = bit_reverse_byte [(d >> shift) & 0xff]; |
eric@42 | 255 | } |
eric@42 | 256 | |
eric@42 | 257 | rp += src->rowbytes; |
eric@42 | 258 | } |
eric@42 | 259 | } |
eric@42 | 260 | |
eric@42 | 261 | void flip_v (Bitmap *src) |
eric@42 | 262 | { |
eric@42 | 263 | u8 *p1, *p2; |
eric@42 | 264 | |
eric@42 | 265 | realloc_temp_buffer (src->rowbytes); |
eric@42 | 266 | |
eric@42 | 267 | p1 = src->bits; |
eric@42 | 268 | p2 = src->bits + src->rowbytes * (rect_height (& src->rect) - 1); |
eric@42 | 269 | while (p1 < p2) |
eric@42 | 270 | { |
eric@42 | 271 | memcpy (temp_buffer, p1, src->rowbytes); |
eric@42 | 272 | memcpy (p1, p2, src->rowbytes); |
eric@42 | 273 | memcpy (p2, temp_buffer, src->rowbytes); |
eric@42 | 274 | p1 += src->rowbytes; |
eric@42 | 275 | p2 -= src->rowbytes; |
eric@42 | 276 | } |
eric@42 | 277 | } |
eric@42 | 278 | |
eric@42 | 279 | void rot_180 (Bitmap *src) /* combination of flip_h and flip_v */ |
eric@42 | 280 | { |
eric@42 | 281 | flip_h (src); |
eric@42 | 282 | flip_v (src); |
eric@42 | 283 | } |
eric@42 | 284 | |
eric@42 | 285 | /* "in-place" transformations - will allocate new memory and free old */ |
eric@42 | 286 | void transpose (Bitmap *src) |
eric@42 | 287 | { |
eric@42 | 288 | u32 new_rowbytes = CALC_ROWBYTES (rect_height (& src->rect)); |
eric@42 | 289 | u8 *new_bits; |
eric@42 | 290 | |
eric@42 | 291 | new_bits = calloc (1, new_rowbytes * rect_width (& src->rect)); |
eric@42 | 292 | |
eric@42 | 293 | /* $$$ more code needed here */ |
eric@42 | 294 | } |
eric@42 | 295 | |
eric@42 | 296 | void rot_90 (Bitmap *src) /* transpose + flip_h */ |
eric@42 | 297 | { |
eric@42 | 298 | transpose (src); |
eric@42 | 299 | flip_h (src); |
eric@42 | 300 | } |
eric@42 | 301 | |
eric@42 | 302 | void rot_270 (Bitmap *src) /* transpose + flip_v */ |
eric@42 | 303 | { |
eric@42 | 304 | transpose (src); |
eric@42 | 305 | flip_v (src); |
eric@42 | 306 | } |