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
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
|
/*
* LivarotDefs.h
* nlivarot
*
* Created by fred on Tue Jun 17 2003.
*
*/
#ifndef my_defs
#define my_defs
#if defined(WIN32) || defined(__WIN32__)
# include <inttypes.h>
#endif
#ifdef HAVE_CONFIG_H
# include "config.h"
#endif
#ifdef HAVE_INTTYPES_H
# include <inttypes.h>
#else
# ifdef HAVE_STDINT_H
# include <stdint.h>
# endif
#endif
// error codes (mostly obsolete)
enum
{
avl_no_err = 0, // 0 is the error code for "everything OK"
avl_bal_err = 1,
avl_rm_err = 2,
avl_ins_err = 3,
shape_euler_err = 4, // computations result in a non-eulerian graph, thus the function cannot do a proper polygon
// despite the rounding sheme, this still happen with uber-complex graphs
// note that coordinates are stored in double => double precision for the computation is not even
// enough to get exact results (need quadruple precision, i think).
shape_input_err = 5, // the function was given an incorrect input (not a polygon, or not eulerian)
shape_nothing_to_do = 6 // the function had nothing to do (zero offset, etc)
};
// return codes for the find function in the AVL tree (private)
enum
{
not_found = 0,
found_exact = 1,
found_on_left = 2,
found_on_right = 3,
found_between = 4
};
// boolean operation
enum bool_op
{
bool_op_union, // A OR B
bool_op_inters, // A AND B
bool_op_diff, // A \ B
bool_op_symdiff, // A XOR B
bool_op_cut, // coupure (pleines)
bool_op_slice // coupure (contour)
};
typedef enum bool_op BooleanOp;
// types of cap for stroking polylines
enum butt_typ
{
butt_straight, // straight line
butt_square, // half square
butt_round, // half circle
butt_pointy // a little pointy hat
};
// types of joins for stroking paths
enum join_typ
{
join_straight, // a straight line
join_round, // arc of circle (in fact, one or two quadratic bezier curve chunks)
join_pointy // a miter join (uses the miter parameter)
};
typedef enum butt_typ ButtType;
typedef enum join_typ JoinType;
enum fill_typ
{
fill_oddEven = 0,
fill_nonZero = 1,
fill_positive = 2,
fill_justDont = 3
};
typedef enum fill_typ FillRule;
// stupid version of dashes: in dash x is plain, dash x+1 must be empty, so the gap field is extremely redundant
typedef struct one_dash
{
bool gap;
double length;
}
one_dash;
// color definition structures for the rasterizations primitives (not present here)
typedef struct std_color
{
uint32_t uCol;
uint16_t iColA, iColR, iColG, iColB;
double fColA, fColR, fColG, fColB;
uint32_t iColATab[256];
}
std_color;
typedef struct grad_stop
{
double at;
double ca, cr, cg, cb;
double iSize;
}
grad_stop;
// linear gradient for filling polygons
typedef struct lin_grad
{
int type; // 0= gradient appears once
// 1= repeats itself start-end/start-end/start-end...
// 2= repeats itself start-end/end-start/start-end...
double u, v, w; // u*x+v*y+w = position in the gradient (clipped to [0;1])
// double caa,car,cag,cab; // color at gradient position 0
// double cba,cbr,cbg,cbb; // color at gradient position 1
int nbStop;
grad_stop stops[2];
}
lin_grad;
// radial gradient (color is funciton of r^2, need to be corrected with a sqrt() to be r)
typedef struct rad_grad
{
int type; // 0= gradient appears once
// 1= repeats itself start-end/start-end/start-end...
// 2= repeats itself start-end/end-start/start-end...
double mh, mv; // center
double rxx, rxy, ryx, ryy; // 1/radius
int nbStop;
grad_stop stops[2];
}
rad_grad;
// functions types for an arbitrary filling shader
typedef void (*InitColorFunc) (int ph, int pv, void *); // init for position ph,pv; the last parameter is a pointer
// on the gen_color structure
typedef void (*NextPixelColorFunc) (void *); // go to next pixel and update the color
typedef void (*NextLigneColorFunc) (void *); // go to next line (the h-coordinate must be the ph passed in
// the InitColorFunc)
typedef void (*GotoPixelColorFunc) (int ph, void *); // move to h-coordinate ph
typedef void (*GotoLigneColorFunc) (int pv, void *); // move to v-coordinate pv (the h-coordinate must be the ph passed
// in the InitColorFunc)
// an arbitrary shader
typedef struct gen_color
{
double colA, colR, colG, colB;
InitColorFunc iFunc;
NextPixelColorFunc npFunc;
NextLigneColorFunc nlFunc;
GotoPixelColorFunc gpFunc;
GotoLigneColorFunc glFunc;
}
gen_color;
// info for a run of pixel to fill
typedef struct raster_info {
int startPix,endPix; // start and end pixel from the polygon POV
int sth,stv; // coordinates for the first pixel in the run, in (possibly another) POV
uint32_t* buffer; // pointer to the first pixel in the run
} raster_info;
typedef void (*RasterInRunFunc) (raster_info &dest,void *data,int nst,float vst,int nen,float ven); // init for position ph,pv; the last parameter is a pointer
enum Side {
LEFT = 0,
RIGHT = 1
};
enum FirstOrLast {
FIRST = 0,
LAST = 1
};
#endif
|