1 |
< |
/* Copyright (c) 1986 Regents of the University of California */ |
1 |
> |
/* Copyright (c) 1994 Regents of the University of California */ |
2 |
|
|
3 |
|
#ifndef lint |
4 |
|
static char SCCSid[] = "$SunId$ LBL"; |
16 |
|
|
17 |
|
#include "otypes.h" |
18 |
|
|
19 |
+ |
#include "otspecial.h" |
20 |
+ |
|
21 |
+ |
#define MAXCSET ((MAXSET+1)*2-1) /* maximum check set size */ |
22 |
+ |
|
23 |
|
extern CUBE thescene; /* our scene */ |
24 |
|
extern int maxdepth; /* maximum recursion depth */ |
25 |
|
extern double minweight; /* minimum ray weight */ |
26 |
+ |
extern int do_irrad; /* compute irradiance? */ |
27 |
|
|
28 |
< |
long nrays = 0L; /* number of rays traced */ |
28 |
> |
unsigned long raynum = 0; /* next unique ray number */ |
29 |
> |
unsigned long nrays = 0; /* number of calls to localhit */ |
30 |
|
|
31 |
< |
#define MAXLOOP 1024 /* modifier loop detection */ |
31 |
> |
static FLOAT Lambfa[5] = {PI, PI, PI, 0.0, 0.0}; |
32 |
> |
OBJREC Lamb = { |
33 |
> |
OVOID, MAT_PLASTIC, "Lambertian", |
34 |
> |
{0, 5, NULL, Lambfa}, NULL, |
35 |
> |
}; /* a Lambertian surface */ |
36 |
|
|
37 |
+ |
static int raymove(), checkset(), checkhit(); |
38 |
+ |
|
39 |
+ |
#define MAXLOOP 128 /* modifier loop detection */ |
40 |
+ |
|
41 |
|
#define RAYHIT (-1) /* return value for intercepted ray */ |
42 |
|
|
43 |
|
|
52 |
|
r->crtype = r->rtype = rt; |
53 |
|
r->rsrc = -1; |
54 |
|
r->clipset = NULL; |
55 |
+ |
r->revf = raytrace; |
56 |
|
} else { /* spawned ray */ |
57 |
|
r->rlvl = ro->rlvl; |
58 |
|
if (rt & RAYREFL) { |
63 |
|
r->rsrc = ro->rsrc; |
64 |
|
r->clipset = ro->newcset; |
65 |
|
} |
66 |
+ |
r->revf = ro->revf; |
67 |
|
r->rweight = ro->rweight * rw; |
68 |
|
r->crtype = ro->crtype | (r->rtype = rt); |
69 |
|
VCOPY(r->rorg, ro->rop); |
70 |
|
} |
71 |
< |
r->rno = nrays; |
71 |
> |
rayclear(r); |
72 |
> |
return(r->rlvl <= maxdepth && r->rweight >= minweight ? 0 : -1); |
73 |
> |
} |
74 |
> |
|
75 |
> |
|
76 |
> |
rayclear(r) /* clear a ray for (re)evaluation */ |
77 |
> |
register RAY *r; |
78 |
> |
{ |
79 |
> |
r->rno = raynum++; |
80 |
|
r->newcset = r->clipset; |
81 |
|
r->ro = NULL; |
82 |
|
r->rot = FHUGE; |
83 |
|
r->pert[0] = r->pert[1] = r->pert[2] = 0.0; |
84 |
|
setcolor(r->pcol, 1.0, 1.0, 1.0); |
85 |
|
setcolor(r->rcol, 0.0, 0.0, 0.0); |
86 |
< |
return(r->rlvl <= maxdepth && r->rweight >= minweight ? 0 : -1); |
86 |
> |
r->rt = 0.0; |
87 |
|
} |
88 |
|
|
89 |
|
|
90 |
< |
rayvalue(r) /* compute a ray's value */ |
91 |
< |
register RAY *r; |
90 |
> |
raytrace(r) /* trace a ray and compute its value */ |
91 |
> |
RAY *r; |
92 |
|
{ |
93 |
|
extern int (*trace)(); |
94 |
+ |
int gotmat; |
95 |
|
|
96 |
< |
if (localhit(r, &thescene) || sourcehit(r)) |
97 |
< |
rayshade(r, r->ro->omod); |
96 |
> |
if (localhit(r, &thescene)) |
97 |
> |
gotmat = raycont(r); |
98 |
> |
else if (sourcehit(r)) |
99 |
> |
gotmat = rayshade(r, r->ro->omod); |
100 |
|
|
101 |
+ |
if (r->ro != NULL && !gotmat) |
102 |
+ |
objerror(r->ro, USER, "material not found"); |
103 |
+ |
|
104 |
|
if (trace != NULL) |
105 |
|
(*trace)(r); /* trace execution */ |
106 |
|
} |
107 |
|
|
108 |
|
|
109 |
+ |
raycont(r) /* check for clipped object and continue */ |
110 |
+ |
register RAY *r; |
111 |
+ |
{ |
112 |
+ |
if ((r->clipset != NULL && inset(r->clipset, r->ro->omod)) || |
113 |
+ |
r->ro->omod == OVOID) { |
114 |
+ |
raytrans(r); |
115 |
+ |
return(1); |
116 |
+ |
} |
117 |
+ |
return(rayshade(r, r->ro->omod)); |
118 |
+ |
} |
119 |
+ |
|
120 |
+ |
|
121 |
|
raytrans(r) /* transmit ray as is */ |
122 |
< |
RAY *r; |
122 |
> |
register RAY *r; |
123 |
|
{ |
124 |
|
RAY tr; |
125 |
|
|
127 |
|
VCOPY(tr.rdir, r->rdir); |
128 |
|
rayvalue(&tr); |
129 |
|
copycolor(r->rcol, tr.rcol); |
130 |
+ |
r->rt = r->rot + tr.rt; |
131 |
|
} |
132 |
|
} |
133 |
|
|
137 |
|
int mod; |
138 |
|
{ |
139 |
|
static int depth = 0; |
140 |
+ |
int gotmat; |
141 |
|
register OBJREC *m; |
98 |
– |
/* check for clipped surface */ |
99 |
– |
if (r->clipset != NULL && r->rot < FHUGE && |
100 |
– |
inset(r->clipset, mod)) { |
101 |
– |
raytrans(r); |
102 |
– |
return; |
103 |
– |
} |
142 |
|
/* check for infinite loop */ |
143 |
|
if (depth++ >= MAXLOOP) |
144 |
|
objerror(r->ro, USER, "possible modifier loop"); |
145 |
< |
for ( ; mod != OVOID; mod = m->omod) { |
145 |
> |
r->rt = r->rot; /* set effective ray length */ |
146 |
> |
for (gotmat = 0; !gotmat && mod != OVOID; mod = m->omod) { |
147 |
|
m = objptr(mod); |
148 |
|
/****** unnecessary test since modifier() is always called |
149 |
|
if (!ismodifier(m->otype)) { |
151 |
|
error(USER, errmsg); |
152 |
|
} |
153 |
|
******/ |
154 |
< |
(*ofun[m->otype].funp)(m, r); /* execute function */ |
155 |
< |
m->lastrno = r->rno; |
156 |
< |
if (ismaterial(m->otype)) { /* materials call raytexture */ |
157 |
< |
depth--; |
158 |
< |
return; /* we're done */ |
154 |
> |
/* hack for irradiance calculation */ |
155 |
> |
if (do_irrad && !(r->crtype & ~(PRIMARY|TRANS))) { |
156 |
> |
if (irr_ignore(m->otype)) { |
157 |
> |
depth--; |
158 |
> |
raytrans(r); |
159 |
> |
return; |
160 |
> |
} |
161 |
> |
if (!islight(m->otype)) |
162 |
> |
m = &Lamb; |
163 |
|
} |
164 |
+ |
/* materials call raytexture */ |
165 |
+ |
gotmat = (*ofun[m->otype].funp)(m, r); |
166 |
|
} |
167 |
< |
objerror(r->ro, USER, "material not found"); |
167 |
> |
depth--; |
168 |
> |
return(gotmat); |
169 |
|
} |
170 |
|
|
171 |
|
|
181 |
|
/* execute textures and patterns */ |
182 |
|
for ( ; mod != OVOID; mod = m->omod) { |
183 |
|
m = objptr(mod); |
184 |
< |
if (!istexture(m->otype)) { |
184 |
> |
/****** unnecessary test since modifier() is always called |
185 |
> |
if (!ismodifier(m->otype)) { |
186 |
|
sprintf(errmsg, "illegal modifier \"%s\"", m->oname); |
187 |
|
error(USER, errmsg); |
188 |
|
} |
189 |
< |
(*ofun[m->otype].funp)(m, r); |
190 |
< |
m->lastrno = r->rno; |
189 |
> |
******/ |
190 |
> |
if ((*ofun[m->otype].funp)(m, r)) |
191 |
> |
objerror(r->ro, USER, "conflicting materials"); |
192 |
|
} |
193 |
|
depth--; /* end here */ |
194 |
|
} |
199 |
|
OBJECT fore, back; |
200 |
|
double coef; |
201 |
|
{ |
202 |
< |
FVECT curpert, forepert, backpert; |
203 |
< |
COLOR curpcol, forepcol, backpcol; |
202 |
> |
RAY fr, br; |
203 |
> |
int foremat, backmat; |
204 |
|
register int i; |
205 |
|
/* clip coefficient */ |
206 |
|
if (coef > 1.0) |
207 |
|
coef = 1.0; |
208 |
|
else if (coef < 0.0) |
209 |
|
coef = 0.0; |
210 |
< |
/* save current mods */ |
211 |
< |
VCOPY(curpert, r->pert); |
212 |
< |
copycolor(curpcol, r->pcol); |
213 |
< |
/* compute new mods */ |
166 |
< |
/* foreground */ |
167 |
< |
r->pert[0] = r->pert[1] = r->pert[2] = 0.0; |
168 |
< |
setcolor(r->pcol, 1.0, 1.0, 1.0); |
210 |
> |
/* compute foreground and background */ |
211 |
> |
foremat = backmat = -1; |
212 |
> |
/* foreground */ |
213 |
> |
copystruct(&fr, r); |
214 |
|
if (fore != OVOID && coef > FTINY) |
215 |
< |
raytexture(r, fore); |
216 |
< |
VCOPY(forepert, r->pert); |
217 |
< |
copycolor(forepcol, r->pcol); |
173 |
< |
/* background */ |
174 |
< |
r->pert[0] = r->pert[1] = r->pert[2] = 0.0; |
175 |
< |
setcolor(r->pcol, 1.0, 1.0, 1.0); |
215 |
> |
foremat = rayshade(&fr, fore); |
216 |
> |
/* background */ |
217 |
> |
copystruct(&br, r); |
218 |
|
if (back != OVOID && coef < 1.0-FTINY) |
219 |
< |
raytexture(r, back); |
220 |
< |
VCOPY(backpert, r->pert); |
221 |
< |
copycolor(backpcol, r->pcol); |
222 |
< |
/* sum perturbations */ |
219 |
> |
backmat = rayshade(&br, back); |
220 |
> |
/* check */ |
221 |
> |
if (foremat < 0) |
222 |
> |
if (backmat < 0) |
223 |
> |
foremat = backmat = 0; |
224 |
> |
else |
225 |
> |
foremat = backmat; |
226 |
> |
else if (backmat < 0) |
227 |
> |
backmat = foremat; |
228 |
> |
if ((foremat==0) != (backmat==0)) |
229 |
> |
objerror(r->ro, USER, "mixing material with non-material"); |
230 |
> |
/* mix perturbations */ |
231 |
|
for (i = 0; i < 3; i++) |
232 |
< |
r->pert[i] = curpert[i] + coef*forepert[i] + |
233 |
< |
(1.0-coef)*backpert[i]; |
234 |
< |
/* multiply colors */ |
235 |
< |
setcolor(r->pcol, coef*colval(forepcol,RED) + |
236 |
< |
(1.0-coef)*colval(backpcol,RED), |
237 |
< |
coef*colval(forepcol,GRN) + |
238 |
< |
(1.0-coef)*colval(backpcol,GRN), |
239 |
< |
coef*colval(forepcol,BLU) + |
240 |
< |
(1.0-coef)*colval(backpcol,BLU)); |
241 |
< |
multcolor(r->pcol, curpcol); |
232 |
> |
r->pert[i] = coef*fr.pert[i] + (1.0-coef)*br.pert[i]; |
233 |
> |
/* mix pattern colors */ |
234 |
> |
scalecolor(fr.pcol, coef); |
235 |
> |
scalecolor(br.pcol, 1.0-coef); |
236 |
> |
copycolor(r->pcol, fr.pcol); |
237 |
> |
addcolor(r->pcol, br.pcol); |
238 |
> |
/* mix returned ray values */ |
239 |
> |
if (foremat) { |
240 |
> |
scalecolor(fr.rcol, coef); |
241 |
> |
scalecolor(br.rcol, 1.0-coef); |
242 |
> |
copycolor(r->rcol, fr.rcol); |
243 |
> |
addcolor(r->rcol, br.rcol); |
244 |
> |
r->rt = bright(fr.rcol) > bright(br.rcol) ? fr.rt : br.rt; |
245 |
> |
} |
246 |
> |
/* return value tells if material */ |
247 |
> |
return(foremat); |
248 |
|
} |
249 |
|
|
250 |
|
|
262 |
|
* still fraught with problems since reflected rays and similar |
263 |
|
* directions calculated from the surface normal may spawn rays behind |
264 |
|
* the surface. The only solution is to curb textures at high |
265 |
< |
* incidence (Rdot << 1). |
265 |
> |
* incidence (namely, keep DOT(rdir,pert) < Rdot). |
266 |
|
*/ |
267 |
|
|
268 |
|
for (i = 0; i < 3; i++) |
283 |
|
} |
284 |
|
|
285 |
|
|
286 |
+ |
newrayxf(r) /* get new tranformation matrix for ray */ |
287 |
+ |
RAY *r; |
288 |
+ |
{ |
289 |
+ |
static struct xfn { |
290 |
+ |
struct xfn *next; |
291 |
+ |
FULLXF xf; |
292 |
+ |
} xfseed = { &xfseed }, *xflast = &xfseed; |
293 |
+ |
register struct xfn *xp; |
294 |
+ |
register RAY *rp; |
295 |
+ |
|
296 |
+ |
/* |
297 |
+ |
* Search for transform in circular list that |
298 |
+ |
* has no associated ray in the tree. |
299 |
+ |
*/ |
300 |
+ |
xp = xflast; |
301 |
+ |
for (rp = r->parent; rp != NULL; rp = rp->parent) |
302 |
+ |
if (rp->rox == &xp->xf) { /* xp in use */ |
303 |
+ |
xp = xp->next; /* move to next */ |
304 |
+ |
if (xp == xflast) { /* need new one */ |
305 |
+ |
xp = (struct xfn *)bmalloc(sizeof(struct xfn)); |
306 |
+ |
if (xp == NULL) |
307 |
+ |
error(SYSTEM, |
308 |
+ |
"out of memory in newrayxf"); |
309 |
+ |
/* insert in list */ |
310 |
+ |
xp->next = xflast->next; |
311 |
+ |
xflast->next = xp; |
312 |
+ |
break; /* we're done */ |
313 |
+ |
} |
314 |
+ |
rp = r; /* start check over */ |
315 |
+ |
} |
316 |
+ |
/* got it */ |
317 |
+ |
r->rox = &xp->xf; |
318 |
+ |
xflast = xp; |
319 |
+ |
} |
320 |
+ |
|
321 |
+ |
|
322 |
|
flipsurface(r) /* reverse surface orientation */ |
323 |
|
register RAY *r; |
324 |
|
{ |
336 |
|
register RAY *r; |
337 |
|
register CUBE *scene; |
338 |
|
{ |
339 |
+ |
OBJECT cxset[MAXCSET+1]; /* set of checked objects */ |
340 |
|
FVECT curpos; /* current cube position */ |
341 |
< |
int mpos, mneg; /* sign flags */ |
341 |
> |
int sflags; /* sign flags */ |
342 |
|
double t, dt; |
343 |
|
register int i; |
344 |
|
|
345 |
|
nrays++; /* increment trace counter */ |
346 |
< |
|
254 |
< |
mpos = mneg = 0; |
346 |
> |
sflags = 0; |
347 |
|
for (i = 0; i < 3; i++) { |
348 |
|
curpos[i] = r->rorg[i]; |
349 |
< |
if (r->rdir[i] > FTINY) |
350 |
< |
mpos |= 1 << i; |
351 |
< |
else if (r->rdir[i] < -FTINY) |
352 |
< |
mneg |= 1 << i; |
349 |
> |
if (r->rdir[i] > 1e-7) |
350 |
> |
sflags |= 1 << i; |
351 |
> |
else if (r->rdir[i] < -1e-7) |
352 |
> |
sflags |= 0x10 << i; |
353 |
|
} |
354 |
+ |
if (sflags == 0) |
355 |
+ |
error(CONSISTENCY, "zero ray direction in localhit"); |
356 |
|
t = 0.0; |
357 |
|
if (!incube(scene, curpos)) { |
358 |
|
/* find distance to entry */ |
359 |
|
for (i = 0; i < 3; i++) { |
360 |
|
/* plane in our direction */ |
361 |
< |
if (mpos & 1<<i) |
361 |
> |
if (sflags & 1<<i) |
362 |
|
dt = scene->cuorg[i]; |
363 |
< |
else if (mneg & 1<<i) |
363 |
> |
else if (sflags & 0x10<<i) |
364 |
|
dt = scene->cuorg[i] + scene->cusize; |
365 |
|
else |
366 |
|
continue; |
377 |
|
if (!incube(scene, curpos)) /* non-intersecting ray */ |
378 |
|
return(0); |
379 |
|
} |
380 |
< |
return(raymove(curpos, mpos, mneg, r, scene) == RAYHIT); |
380 |
> |
cxset[0] = 0; |
381 |
> |
return(raymove(curpos, cxset, sflags, r, scene) == RAYHIT); |
382 |
|
} |
383 |
|
|
384 |
|
|
385 |
|
static int |
386 |
< |
raymove(pos, plus, minus, r, cu) /* check for hit as we move */ |
387 |
< |
FVECT pos; /* modified */ |
388 |
< |
int plus, minus; /* direction indicators to speed tests */ |
386 |
> |
raymove(pos, cxs, dirf, r, cu) /* check for hit as we move */ |
387 |
> |
FVECT pos; /* current position, modified herein */ |
388 |
> |
OBJECT *cxs; /* checked objects, modified by checkhit */ |
389 |
> |
int dirf; /* direction indicators to speed tests */ |
390 |
|
register RAY *r; |
391 |
|
register CUBE *cu; |
392 |
|
{ |
393 |
|
int ax; |
394 |
|
double dt, t; |
299 |
– |
register int sgn; |
395 |
|
|
396 |
|
if (istree(cu->cutree)) { /* recurse on subcubes */ |
397 |
|
CUBE cukid; |
398 |
< |
register int br; |
398 |
> |
register int br, sgn; |
399 |
|
|
400 |
|
cukid.cusize = cu->cusize * 0.5; /* find subcube */ |
401 |
|
VCOPY(cukid.cuorg, cu->cuorg); |
414 |
|
} |
415 |
|
for ( ; ; ) { |
416 |
|
cukid.cutree = octkid(cu->cutree, br); |
417 |
< |
if ((ax = raymove(pos,plus,minus,r,&cukid)) == RAYHIT) |
417 |
> |
if ((ax = raymove(pos,cxs,dirf,r,&cukid)) == RAYHIT) |
418 |
|
return(RAYHIT); |
419 |
|
sgn = 1 << ax; |
420 |
< |
if (sgn & minus) /* negative axis? */ |
326 |
< |
if (sgn & br) { |
327 |
< |
cukid.cuorg[ax] -= cukid.cusize; |
328 |
< |
br &= ~sgn; |
329 |
< |
} else |
330 |
< |
return(ax); /* underflow */ |
331 |
< |
else |
420 |
> |
if (sgn & dirf) /* positive axis? */ |
421 |
|
if (sgn & br) |
422 |
|
return(ax); /* overflow */ |
423 |
|
else { |
424 |
|
cukid.cuorg[ax] += cukid.cusize; |
425 |
|
br |= sgn; |
426 |
|
} |
427 |
+ |
else |
428 |
+ |
if (sgn & br) { |
429 |
+ |
cukid.cuorg[ax] -= cukid.cusize; |
430 |
+ |
br &= ~sgn; |
431 |
+ |
} else |
432 |
+ |
return(ax); /* underflow */ |
433 |
|
} |
434 |
|
/*NOTREACHED*/ |
435 |
|
} |
436 |
< |
if (isfull(cu->cutree) && checkhit(r, cu)) |
436 |
> |
if (isfull(cu->cutree) && checkhit(r, cu, cxs)) |
437 |
|
return(RAYHIT); |
438 |
|
/* advance to next cube */ |
439 |
< |
sgn = plus | minus; |
440 |
< |
if (sgn&1) { |
346 |
< |
dt = plus&1 ? cu->cuorg[0] + cu->cusize : cu->cuorg[0]; |
439 |
> |
if (dirf&0x11) { |
440 |
> |
dt = dirf&1 ? cu->cuorg[0] + cu->cusize : cu->cuorg[0]; |
441 |
|
t = (dt - pos[0])/r->rdir[0]; |
442 |
|
ax = 0; |
443 |
|
} else |
444 |
|
t = FHUGE; |
445 |
< |
if (sgn&2) { |
446 |
< |
dt = plus&2 ? cu->cuorg[1] + cu->cusize : cu->cuorg[1]; |
445 |
> |
if (dirf&0x22) { |
446 |
> |
dt = dirf&2 ? cu->cuorg[1] + cu->cusize : cu->cuorg[1]; |
447 |
|
dt = (dt - pos[1])/r->rdir[1]; |
448 |
|
if (dt < t) { |
449 |
|
t = dt; |
450 |
|
ax = 1; |
451 |
|
} |
452 |
|
} |
453 |
< |
if (sgn&4) { |
454 |
< |
dt = plus&4 ? cu->cuorg[2] + cu->cusize : cu->cuorg[2]; |
453 |
> |
if (dirf&0x44) { |
454 |
> |
dt = dirf&4 ? cu->cuorg[2] + cu->cusize : cu->cuorg[2]; |
455 |
|
dt = (dt - pos[2])/r->rdir[2]; |
456 |
|
if (dt < t) { |
457 |
|
t = dt; |
466 |
|
|
467 |
|
|
468 |
|
static |
469 |
< |
checkhit(r, cu) /* check for hit in full cube */ |
469 |
> |
checkhit(r, cu, cxs) /* check for hit in full cube */ |
470 |
|
register RAY *r; |
471 |
|
CUBE *cu; |
472 |
+ |
OBJECT *cxs; |
473 |
|
{ |
474 |
|
OBJECT oset[MAXSET+1]; |
475 |
|
register OBJREC *o; |
476 |
|
register int i; |
477 |
|
|
478 |
|
objset(oset, cu->cutree); |
479 |
+ |
checkset(oset, cxs); /* eliminate double-checking */ |
480 |
|
for (i = oset[0]; i > 0; i--) { |
481 |
|
o = objptr(oset[i]); |
386 |
– |
if (o->lastrno == r->rno) /* checked already? */ |
387 |
– |
continue; |
482 |
|
(*ofun[o->otype].funp)(o, r); |
389 |
– |
o->lastrno = r->rno; |
483 |
|
} |
484 |
|
if (r->ro == NULL) |
485 |
|
return(0); /* no scores yet */ |
486 |
|
|
487 |
|
return(incube(cu, r->rop)); /* hit OK if in current cube */ |
488 |
+ |
} |
489 |
+ |
|
490 |
+ |
|
491 |
+ |
static |
492 |
+ |
checkset(os, cs) /* modify checked set and set to check */ |
493 |
+ |
register OBJECT *os; /* os' = os - cs */ |
494 |
+ |
register OBJECT *cs; /* cs' = cs + os */ |
495 |
+ |
{ |
496 |
+ |
OBJECT cset[MAXCSET+MAXSET+1]; |
497 |
+ |
register int i, j; |
498 |
+ |
int k; |
499 |
+ |
/* copy os in place, cset <- cs */ |
500 |
+ |
cset[0] = 0; |
501 |
+ |
k = 0; |
502 |
+ |
for (i = j = 1; i <= os[0]; i++) { |
503 |
+ |
while (j <= cs[0] && cs[j] < os[i]) |
504 |
+ |
cset[++cset[0]] = cs[j++]; |
505 |
+ |
if (j > cs[0] || os[i] != cs[j]) { /* object to check */ |
506 |
+ |
os[++k] = os[i]; |
507 |
+ |
cset[++cset[0]] = os[i]; |
508 |
+ |
} |
509 |
+ |
} |
510 |
+ |
if (!(os[0] = k)) /* new "to check" set size */ |
511 |
+ |
return; /* special case */ |
512 |
+ |
while (j <= cs[0]) /* get the rest of cs */ |
513 |
+ |
cset[++cset[0]] = cs[j++]; |
514 |
+ |
if (cset[0] > MAXCSET) /* truncate "checked" set if nec. */ |
515 |
+ |
cset[0] = MAXCSET; |
516 |
+ |
/* setcopy(cs, cset); */ /* copy cset back to cs */ |
517 |
+ |
os = cset; |
518 |
+ |
for (i = os[0]; i-- >= 0; ) |
519 |
+ |
*cs++ = *os++; |
520 |
|
} |