1 |
– |
/* Copyright (c) 1998 Silicon Graphics, Inc. */ |
2 |
– |
|
1 |
|
#ifndef lint |
2 |
< |
static char SCCSid[] = "$SunId$ SGI"; |
2 |
> |
static const char RCSid[] = "$Id$"; |
3 |
|
#endif |
6 |
– |
|
4 |
|
/* |
5 |
|
* sm_samp.c |
6 |
|
*/ |
11 |
|
SAMP rsL; |
12 |
|
int4 *samp_flag=NULL; |
13 |
|
|
17 |
– |
|
14 |
|
/* Each sample has a world coord point, and direction, brightness,chrominance, |
15 |
|
and RGB triples |
16 |
|
*/ |
17 |
< |
#ifndef HP_VERSION |
17 |
> |
|
18 |
|
#define TMSIZE sizeof(TMbright) |
19 |
< |
#else |
24 |
< |
#define TMSIZE 0 |
25 |
< |
#endif |
26 |
< |
#define SAMPSIZ (3*sizeof(float)+sizeof(int4)+ 6*sizeof(BYTE) + TMSIZE) |
19 |
> |
#define SAMPSIZ (3*sizeof(SFLOAT)+sizeof(int4)+ 6*sizeof(BYTE) + TMSIZE + 2*sizeof(int)) |
20 |
|
|
21 |
< |
/* Extra points just need direction and world space point */ |
22 |
< |
#define POINTSIZ (3*sizeof(float)) |
21 |
> |
/* Extra points world space point, vert flag and qt flag */ |
22 |
> |
#define POINTSIZ (3*sizeof(SFLOAT) + 2*sizeof(int)) |
23 |
|
|
24 |
|
/* Clear the flags for all samples */ |
25 |
|
sClear_all_flags(s) |
72 |
|
/* get number of samples that fit in block */ |
73 |
|
n = (i - 8 - extra_points*POINTSIZ) / SAMPSIZ; |
74 |
|
|
75 |
+ |
/* Must make sure n + extra_points can fit in a S_ID identifier */ |
76 |
+ |
if ( n > (S_ID_MAX - extra_points)) |
77 |
+ |
n = (S_ID_MAX - extra_points); |
78 |
+ |
|
79 |
|
S_BASE(s) = (char *)malloc(n*SAMPSIZ + extra_points*POINTSIZ); |
80 |
|
if (!S_BASE(s)) |
81 |
|
error(SYSTEM,"sAlloc(): Unable to allocate memory"); |
82 |
|
|
83 |
|
/* assign larger alignment types earlier */ |
84 |
< |
S_W_PT(s) = (float (*)[3])S_BASE(s); |
84 |
> |
S_W_PT(s) = (SFLOAT(*)[3])S_BASE(s); |
85 |
|
S_W_DIR(s) = (int4 *)(S_W_PT(s) + n + extra_points); |
86 |
|
S_BRT(s) = (TMbright *)(S_W_DIR(s) + n); |
87 |
|
S_CHR(s) = (BYTE (*)[3])(S_BRT(s) + n); |
88 |
|
S_RGB(s) = (BYTE (*)[3])(S_CHR(s) + n); |
89 |
+ |
S_INFO(s) = (int *)(S_RGB(s)+n); |
90 |
+ |
S_INFO1(s) = (int *)(S_INFO(s)+n+extra_points); |
91 |
|
S_MAX_SAMP(s) = n; |
92 |
|
S_MAX_BASE_PT(s) = n + extra_points; |
93 |
|
|
94 |
|
/* Allocate memory for a per/sample bit flag */ |
95 |
|
if(!(samp_flag = (int4 *)malloc(FLAG_BYTES(n+extra_points)))) |
96 |
|
error(SYSTEM,"sAlloc(): Unable to allocate flag memory"); |
98 |
– |
|
97 |
|
sInit(s); |
98 |
|
sClear_all_flags(s); |
99 |
|
|
107 |
|
is added: These points are not displayed-they are used to form the |
108 |
|
initial mesh |
109 |
|
*/ |
110 |
< |
int |
110 |
> |
S_ID |
111 |
|
sAdd_base_point(s,v) |
112 |
|
SAMP *s; |
113 |
|
FVECT v; |
114 |
|
{ |
115 |
< |
int id; |
115 |
> |
S_ID id; |
116 |
|
|
117 |
|
/* Get pointer to next available point */ |
118 |
|
id = S_NEXT_BASE_PT(s); |
133 |
|
int |
134 |
|
sCopy_samp(s,n_id,id) |
135 |
|
SAMP *s; |
136 |
< |
int n_id,id; |
136 |
> |
S_ID n_id,id; |
137 |
|
{ |
138 |
|
|
139 |
|
#ifdef DEBUG |
166 |
|
void |
167 |
|
sInit_samp(s,id,c,d,p,o_id) |
168 |
|
SAMP *s; |
169 |
< |
int id; |
169 |
> |
S_ID id; |
170 |
|
COLR c; |
171 |
|
FVECT d,p; |
172 |
< |
int o_id; |
172 |
> |
S_ID o_id; |
173 |
|
{ |
174 |
|
|
175 |
|
if(o_id != INVALID) |
186 |
|
/* calculate the brightness and chrominance,RGB will be set by |
187 |
|
tonemapping |
188 |
|
*/ |
191 |
– |
#ifndef TEST_DRIVER |
189 |
|
tmCvColrs(&S_NTH_BRT(s,id),S_NTH_CHR(s,id),c,1); |
193 |
– |
#else |
194 |
– |
if(c) |
195 |
– |
{ |
196 |
– |
S_NTH_RGB(s,id)[0] = c[0]; |
197 |
– |
S_NTH_RGB(s,id)[1] = c[1]; |
198 |
– |
S_NTH_RGB(s,id)[2] = c[2]; |
199 |
– |
} |
200 |
– |
else |
201 |
– |
{ |
202 |
– |
S_NTH_RGB(s,id)[0] = 100; |
203 |
– |
S_NTH_RGB(s,id)[1] = 0; |
204 |
– |
S_NTH_RGB(s,id)[2] = 0; |
205 |
– |
} |
206 |
– |
#endif |
190 |
|
} |
191 |
|
/* Set ACTIVE bit upon creation */ |
192 |
< |
S_SET_FLAG(id); |
210 |
< |
#ifndef TEST_DRIVER |
192 |
> |
S_SET_FLAG(id); |
193 |
|
if(id < S_TONE_MAP(s)) |
194 |
|
tmMapPixels(S_NTH_RGB(s,id),&S_NTH_BRT(s,id),S_NTH_CHR(s,id),1); |
213 |
– |
#endif |
195 |
|
} |
196 |
|
|
197 |
|
|
198 |
|
/* Allocate a new sample. If an existing sample was replaced: set flag */ |
199 |
< |
int |
199 |
> |
S_ID |
200 |
|
sAlloc_samp(s,replaced) |
201 |
|
SAMP *s; |
202 |
|
int *replaced; |
203 |
|
|
204 |
|
{ |
205 |
< |
int id; |
205 |
> |
S_ID id; |
206 |
|
|
226 |
– |
if(replaced) |
227 |
– |
*replaced = 0; |
228 |
– |
|
207 |
|
/* First check if there are any freed sample available */ |
208 |
|
if((id = S_FREE_SAMP(s)) != INVALID) |
209 |
|
{ |
210 |
+ |
*replaced = 0; |
211 |
+ |
#if 0 |
212 |
+ |
fprintf(stderr,"allocating previously freed sample %d\n",id); |
213 |
+ |
#endif |
214 |
|
S_FREE_SAMP(s) = S_NTH_NEXT(s,id); |
215 |
|
return(id); |
216 |
|
} |
217 |
|
/* If havn't reached end of sample array:return next sample */ |
218 |
|
if(S_NUM_SAMP(s) < S_MAX_SAMP(s)) |
237 |
– |
id = S_NUM_SAMP(s)++; |
238 |
– |
else |
219 |
|
{ |
220 |
< |
/* CLOCKED LRU replacement policy: Search through samples starting |
221 |
< |
with S_REPLACE_SAMP for a sample that does not have its active |
222 |
< |
bit set. Clear bit along the way |
223 |
< |
*/ |
224 |
< |
id = S_REPLACE_SAMP(s); |
225 |
< |
while(S_IS_FLAG(id)) |
246 |
< |
{ |
247 |
< |
S_CLR_FLAG(id); |
248 |
< |
id = (id +1)% S_MAX_SAMP(s); |
249 |
< |
} |
250 |
< |
S_REPLACE_SAMP(s) = (id +1)% S_MAX_SAMP(s); |
251 |
< |
if(replaced) |
252 |
< |
*replaced = 1; |
220 |
> |
id = S_NUM_SAMP(s)++; |
221 |
> |
#if 0 |
222 |
> |
fprintf(stderr,"allocating sample %d\n",id); |
223 |
> |
#endif |
224 |
> |
*replaced = 0; |
225 |
> |
return(id); |
226 |
|
} |
254 |
– |
return(id); |
255 |
– |
} |
227 |
|
|
228 |
< |
/* Set the sample flag to be unused- so will get replaced on next LRU |
258 |
< |
iteration |
259 |
< |
*/ |
260 |
< |
int |
261 |
< |
sDelete_samp(s,id) |
262 |
< |
SAMP *s; |
263 |
< |
int id; |
228 |
> |
#ifdef DEBUG |
229 |
|
{ |
230 |
< |
#ifdef DEBUG |
231 |
< |
/* Fist check for a valid id */ |
232 |
< |
if(id >= S_MAX_SAMP(s) || id < 0) |
233 |
< |
return(0); |
230 |
> |
static int replace = 0; |
231 |
> |
if(replace == 0) |
232 |
> |
{ |
233 |
> |
eputs("Out of samples: using replacement strategy\n"); |
234 |
> |
replace =1 ; |
235 |
> |
} |
236 |
> |
} |
237 |
|
#endif |
238 |
< |
/* Add sample to the free list */ |
239 |
< |
sUnalloc_samp(s,id); |
240 |
< |
|
241 |
< |
S_CLR_FLAG(id); |
242 |
< |
return(1); |
238 |
> |
|
239 |
> |
/* CLOCKED LRU replacement policy: Search through samples starting |
240 |
> |
with S_REPLACE_SAMP for a sample that does not have its active |
241 |
> |
bit set. Clear bit along the way |
242 |
> |
*/ |
243 |
> |
id = S_REPLACE_SAMP(s); |
244 |
> |
while(S_IS_FLAG(id)) |
245 |
> |
{ |
246 |
> |
S_CLR_FLAG(id); |
247 |
> |
id = (id +1)% S_MAX_SAMP(s); |
248 |
> |
} |
249 |
> |
S_REPLACE_SAMP(s) = (id +1)% S_MAX_SAMP(s); |
250 |
> |
*replaced = 1; |
251 |
> |
return(id); |
252 |
|
} |
253 |
+ |
|
254 |
+ |
|
255 |
+ |
|
256 |
+ |
|
257 |
+ |
|
258 |
+ |
|
259 |
|
|
260 |
|
|
261 |
|
|