1 |
– |
/* Copyright (c) 1989 Regents of the University of California */ |
2 |
– |
|
1 |
|
#ifndef lint |
2 |
< |
static char SCCSid[] = "$SunId$ LBL"; |
2 |
> |
static const char RCSid[] = "$Id$"; |
3 |
|
#endif |
6 |
– |
|
4 |
|
/* |
5 |
|
* colortab.c - allocate and control dynamic color table. |
6 |
|
* |
11 |
|
* histogram is cleared. This algorithm |
12 |
|
* performs only as well as the next drawing's color |
13 |
|
* distribution is correlated to the last. |
14 |
+ |
* |
15 |
+ |
* External symbols declared in drvier.h |
16 |
|
*/ |
17 |
|
|
18 |
< |
#include "color.h" |
18 |
> |
#include "copyright.h" |
19 |
|
|
20 |
< |
#define NULL 0 |
20 |
> |
#include "standard.h" |
21 |
> |
|
22 |
> |
#include "color.h" |
23 |
|
/* histogram resolution */ |
24 |
|
#define NRED 24 |
25 |
|
#define NGRN 32 |
34 |
|
(int)(colval(c,p)*256.) : 255 ] |
35 |
|
/* color partition tree */ |
36 |
|
#define CNODE short |
37 |
< |
#define set_branch(p,c) ((c)<<2|(p)) |
37 |
> |
#define set_branch(p,c) ((c)<<2|(p)) |
38 |
|
#define set_pval(pv) ((pv)<<2|3) |
39 |
|
#define is_branch(cn) (((cn)&3)!=3) |
40 |
|
#define is_pval(cn) (((cn)&3)==3) |
44 |
|
/* our color table */ |
45 |
|
static struct tabent { |
46 |
|
long sum[3]; /* sum of colors using this entry */ |
47 |
< |
long n; /* number of colors */ |
48 |
< |
short ent[3]; /* current table value */ |
47 |
> |
int n; /* number of colors */ |
48 |
> |
BYTE ent[3]; /* current table value */ |
49 |
|
} *clrtab = NULL; |
50 |
|
/* color cube partition */ |
51 |
|
static CNODE *ctree = NULL; |
52 |
|
/* our color correction map */ |
53 |
|
static BYTE clrmap[3][256]; |
54 |
|
/* histogram of colors used */ |
55 |
< |
static unsigned histo[NRED][NGRN][NBLU]; |
55 |
> |
static unsigned short histo[NRED][NGRN][NBLU]; |
56 |
|
/* initial color cube boundary */ |
57 |
< |
static int CLRCUBE[3][2] = {0,NRED,0,NGRN,0,NBLU}; |
57 |
> |
static int CLRCUBE[3][2] = {{0,NRED},{0,NGRN},{0,NBLU}}; |
58 |
|
|
59 |
+ |
static int split(); |
60 |
+ |
static void cut(); |
61 |
|
|
62 |
+ |
|
63 |
|
int |
64 |
|
new_ctab(ncolors) /* start new color table with max ncolors */ |
65 |
|
int ncolors; |
70 |
|
return(0); |
71 |
|
/* free old tables */ |
72 |
|
if (clrtab != NULL) |
73 |
< |
free((char *)clrtab); |
73 |
> |
free((void *)clrtab); |
74 |
|
if (ctree != NULL) |
75 |
< |
free((char *)ctree); |
75 |
> |
free((void *)ctree); |
76 |
|
/* get new tables */ |
77 |
|
for (treesize = 1; treesize < ncolors; treesize <<= 1) |
78 |
|
; |
84 |
|
/* partition color space */ |
85 |
|
cut(ctree, 0, CLRCUBE, 0, ncolors); |
86 |
|
/* clear histogram */ |
87 |
< |
bzero(histo, sizeof(histo)); |
87 |
> |
bzero((char *)histo, sizeof(histo)); |
88 |
|
/* return number of colors used */ |
89 |
|
return(ncolors); |
90 |
|
} |
93 |
|
int |
94 |
|
get_pixel(col, set_pixel) /* get pixel for color */ |
95 |
|
COLOR col; |
96 |
< |
int (*set_pixel)(); |
96 |
> |
void (*set_pixel)(); |
97 |
|
{ |
98 |
|
int r, g, b; |
99 |
|
int cv[3]; |
100 |
< |
register union { CNODE *t; struct tabent *e; } p; |
100 |
> |
register CNODE *tp; |
101 |
|
register int h; |
102 |
|
/* map color */ |
103 |
|
r = map_col(col,RED); |
110 |
|
/* add to histogram */ |
111 |
|
histo[cv[RED]][cv[GRN]][cv[BLU]]++; |
112 |
|
/* find pixel in tree */ |
113 |
< |
for (p.t = ctree, h = 0; is_branch(*p.t); h++) |
114 |
< |
if (cv[prim(*p.t)] < part(*p.t)) |
115 |
< |
p.t += 1<<h; /* left branch */ |
113 |
> |
for (tp = ctree, h = 0; is_branch(*tp); h++) |
114 |
> |
if (cv[prim(*tp)] < part(*tp)) |
115 |
> |
tp += 1<<h; /* left branch */ |
116 |
|
else |
117 |
< |
p.t += 1<<(h+1); /* right branch */ |
118 |
< |
h = pval(*p.t); |
117 |
> |
tp += 1<<(h+1); /* right branch */ |
118 |
> |
h = pval(*tp); |
119 |
|
/* add to color table */ |
120 |
< |
p.e = clrtab + h; |
121 |
< |
/* add to sum */ |
122 |
< |
p.e->sum[RED] += r; |
123 |
< |
p.e->sum[GRN] += g; |
120 |
< |
p.e->sum[BLU] += b; |
121 |
< |
p.e->n++; |
120 |
> |
clrtab[h].sum[RED] += r; |
121 |
> |
clrtab[h].sum[GRN] += g; |
122 |
> |
clrtab[h].sum[BLU] += b; |
123 |
> |
clrtab[h].n++; |
124 |
|
/* recompute average */ |
125 |
< |
r = p.e->sum[RED] / p.e->n; |
126 |
< |
g = p.e->sum[GRN] / p.e->n; |
127 |
< |
b = p.e->sum[BLU] / p.e->n; |
125 |
> |
r = clrtab[h].sum[RED] / clrtab[h].n; |
126 |
> |
g = clrtab[h].sum[GRN] / clrtab[h].n; |
127 |
> |
b = clrtab[h].sum[BLU] / clrtab[h].n; |
128 |
|
/* check for movement */ |
129 |
< |
if (p.e->n == 1 || |
130 |
< |
(r-p.e->ent[RED])*(r-p.e->ent[RED]) + |
131 |
< |
(g-p.e->ent[GRN])*(g-p.e->ent[GRN]) + |
132 |
< |
(b-p.e->ent[BLU])*(b-p.e->ent[BLU]) > MAXDST2) { |
133 |
< |
p.e->ent[RED] = r; |
134 |
< |
p.e->ent[GRN] = g; /* reassign pixel */ |
135 |
< |
p.e->ent[BLU] = b; |
136 |
< |
#ifdef notdef |
137 |
< |
printf("pixel %d = (%d,%d,%d) (%d refs)\n", |
138 |
< |
h, r, g, b, p.e->n); |
129 |
> |
if (clrtab[h].n == 1 || |
130 |
> |
(r-clrtab[h].ent[RED])*(r-clrtab[h].ent[RED]) + |
131 |
> |
(g-clrtab[h].ent[GRN])*(g-clrtab[h].ent[GRN]) + |
132 |
> |
(b-clrtab[h].ent[BLU])*(b-clrtab[h].ent[BLU]) > MAXDST2) { |
133 |
> |
clrtab[h].ent[RED] = r; |
134 |
> |
clrtab[h].ent[GRN] = g; /* reassign pixel */ |
135 |
> |
clrtab[h].ent[BLU] = b; |
136 |
> |
#ifdef DEBUG |
137 |
> |
sprintf(errmsg, "pixel %d = (%d,%d,%d) (%d refs)\n", |
138 |
> |
h, r, g, b, clrtab[h].n); |
139 |
> |
eputs(errmsg); |
140 |
|
#endif |
141 |
|
(*set_pixel)(h, r, g, b); |
142 |
|
} |
144 |
|
} |
145 |
|
|
146 |
|
|
147 |
+ |
void |
148 |
|
make_gmap(gam) /* make gamma correction map */ |
149 |
< |
double gam; |
149 |
> |
double gam; |
150 |
|
{ |
147 |
– |
extern double pow(); |
151 |
|
register int i; |
152 |
|
|
153 |
|
for (i = 0; i < 256; i++) |
154 |
|
clrmap[RED][i] = |
155 |
|
clrmap[GRN][i] = |
156 |
< |
clrmap[BLU][i] = 256.0 * pow(i/256.0, 1.0/gam); |
156 |
> |
clrmap[BLU][i] = 256.0 * pow((i+0.5)/256.0, 1.0/gam); |
157 |
|
} |
158 |
|
|
159 |
|
|
160 |
+ |
void |
161 |
|
set_cmap(rmap, gmap, bmap) /* set custom color correction map */ |
162 |
|
BYTE *rmap, *gmap, *bmap; |
163 |
|
{ |
164 |
< |
bcopy(rmap, clrmap[RED], 256); |
165 |
< |
bcopy(gmap, clrmap[GRN], 256); |
166 |
< |
bcopy(bmap, clrmap[BLU], 256); |
164 |
> |
bcopy((char *)rmap, (char *)clrmap[RED], 256); |
165 |
> |
bcopy((char *)gmap, (char *)clrmap[GRN], 256); |
166 |
> |
bcopy((char *)bmap, (char *)clrmap[BLU], 256); |
167 |
|
} |
168 |
|
|
169 |
|
|
170 |
< |
static |
170 |
> |
void |
171 |
> |
map_color(rgb, col) /* map a color to a byte triplet */ |
172 |
> |
BYTE rgb[3]; |
173 |
> |
COLOR col; |
174 |
> |
{ |
175 |
> |
rgb[RED] = map_col(col,RED); |
176 |
> |
rgb[GRN] = map_col(col,GRN); |
177 |
> |
rgb[BLU] = map_col(col,BLU); |
178 |
> |
} |
179 |
> |
|
180 |
> |
|
181 |
> |
static void |
182 |
|
cut(tree, level, box, c0, c1) /* partition color space */ |
183 |
|
register CNODE *tree; |
184 |
|
int level; |
193 |
|
} |
194 |
|
/* split box */ |
195 |
|
*tree = split(box); |
196 |
< |
bcopy(box, kb, sizeof(kb)); |
196 |
> |
bcopy((char *)box, (char *)kb, sizeof(kb)); |
197 |
|
/* do left (lesser) branch */ |
198 |
|
kb[prim(*tree)][1] = part(*tree); |
199 |
|
cut(tree+(1<<level), level+1, kb, c0, (c0+c1)>>1); |
211 |
|
#define c0 r |
212 |
|
register int r, g, b; |
213 |
|
int pri; |
214 |
< |
int t[HMAX], med; |
214 |
> |
long t[HMAX], med; |
215 |
|
/* find dominant axis */ |
216 |
|
pri = RED; |
217 |
|
if (box[GRN][1]-box[GRN][0] > box[pri][1]-box[pri][0]) |