-
Notifications
You must be signed in to change notification settings - Fork 7
/
bitblt.h
119 lines (88 loc) · 2.86 KB
/
bitblt.h
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
/*
* tumble: build a PDF file from image files
*
* bitblt routines
* Copyright 2001, 2002, 2003, 2017 Eric Smith <[email protected]>
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License version 2 as
* published by the Free Software Foundation. Note that permission is
* not granted to redistribute this program under the terms of any
* other version of the General Public License.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111 USA
*
* 2009-03-13 [JDB] pm_config.h (part of NETPBM) defines BITS_PER_WORD but
* apparently doesn't use it externally. We undefine it here
* so that our version takes precedence and warnings are not
* generated.
*/
#undef BITS_PER_WORD
typedef struct Point
{
int32_t x;
int32_t y;
} Point;
typedef struct Rect
{
Point min;
Point max;
} Rect;
static inline int32_t rect_width (Rect *r)
{
return (r->max.x - r->min.x);
}
static inline int32_t rect_height (Rect *r)
{
return (r->max.y - r->min.y);
}
/* word_t should be the largest native type that can be handled
efficiently, so it shouldn't be a 64-bit type on a processor that
doesn't have native 64-bit operations. */
typedef uint32_t word_t;
#define BITS_PER_WORD (8 * sizeof (word_t))
#define ALL_ONES (~ 0UL)
typedef struct Bitmap
{
word_t *bits;
Rect rect;
uint32_t row_words;
} Bitmap;
#define TF_SRC 0xc
#define TF_AND 0x8
#define TF_OR 0xe
#define TF_XOR 0x6
void bitblt_init (void);
Bitmap *create_bitmap (Rect *rect);
void free_bitmap (Bitmap *bitmap);
bool get_pixel (Bitmap *bitmap, Point coord);
void set_pixel (Bitmap *bitmap, Point coord, bool value);
Bitmap *bitblt (Bitmap *src_bitmap,
Rect *src_rect,
Bitmap *dest_bitmap,
Point *dest_min,
int tfn,
int background);
/* in-place transformations */
void flip_h (Bitmap *src);
void flip_v (Bitmap *src);
void rot_180 (Bitmap *src); /* combination of flip_h and flip_v */
/* "in-place" transformations - will allocate new memory and free old */
void transpose (Bitmap *src);
void rot_90 (Bitmap *src); /* transpose + flip_h */
void rot_270 (Bitmap *src); /* transpose + flip_v */
void reverse_bits (uint8_t *p, int byte_count);
void bitblt_write_g4 (Bitmap *bitmap, FILE *f);
/* frees original! */
Bitmap *resize_bitmap (Bitmap *src,
int width_pixels,
int height_pixels);
/* "in place" rotation */
void rotate_bitmap (Bitmap *src, int rotation);