Newer
Older
3001
3002
3003
3004
3005
3006
3007
3008
3009
3010
3011
3012
3013
3014
3015
3016
3017
3018
3019
3020
3021
3022
glVertex3fv( pts[ fvs0[3] ].x );
} else if(fvn < 0) {
if(was) {
glEnd();
was = 0;
}
glBegin( GL_TRIANGLE_STRIP );
glNormal3fv( m->fnorms[f].x );
do {
glVertex3fv( pts[ *fvs0++ ].x );
} while(++fvn < 0);
glEnd();
} else {
if(was) {
glEnd();
was = 0;
}
glBegin( GL_POLYGON );
glNormal3fv( m->fnorms[f].x );
do {
glVertex3fv( pts[ *fvs0++ ].x );
} while(--fvn > 0);
glEnd();
}
}
if(was) glEnd();
break;
}
if(m->fnorms != NULL) {
glDisable( GL_LIGHTING );
glDisable( GL_COLOR_MATERIAL );
3035
3036
3037
3038
3039
3040
3041
3042
3043
3044
3045
3046
3047
3048
3049
3050
3051
3052
3053
3054
3055
3056
3057
3058
3059
3060
3061
3062
3063
3064
3065
3066
3067
void specks_draw_boxes( struct stuff *st, struct AMRbox *boxes, int boxlevelmask, Matrix Ttext, int oriented )
{
static short arcs[] = {
5, 4, 6, 2, 3, 1, 5, 7, 6,
-1,
7, 3,
0, 1,
0, 2,
0, 4
};
struct AMRbox *box;
int i;
float boxscale, s0, s1;
int isscaled;
glBlendFunc( GL_SRC_ALPHA, GL_ONE_MINUS_SRC_ALPHA );
glLineWidth( st->boxlinewidth );
glEnable( GL_BLEND );
glDisable( GL_LINE_SMOOTH );
/* Scan through the array, whose end is marked with a box at level -1. */
for(box = boxes; box->level >= 0; box++) {
boxscale = (box->level < 0) ? 1.0
: st->boxscale[ box->level>=MAXBOXLEV ? MAXBOXLEV-1 : box->level ];
isscaled = (boxscale != 0 && boxscale != 1);
if(isscaled) {
s0 = .5*(1 + boxscale);
s1 = .5*(1 - boxscale);
}
if((1 << box->level) & boxlevelmask) {
int cval = RGBALPHA(st->boxcmap[
box->level<0 ? 0
: box->level>=st->boxncmap ?
st->boxncmap-1 : box->level ].cooked,
3069
3070
3071
3072
3073
3074
3075
3076
3077
3078
3079
3080
3081
3082
3083
3084
3085
3086
3087
3088
3089
3090
3091
3092
3093
3094
3095
3096
3097
3098
3099
3100
3101
3102
3103
3104
3105
3106
3107
3108
3109
3110
3111
0xFF);
int colorme = 0;
if(oriented)
cval = orientboxcolor;
glColor4ubv( (GLubyte *)&cval );
glBegin( GL_LINE_STRIP );
for(i = 0; i < COUNT(arcs); i++) {
int vert = arcs[i];
if(vert < 0) {
glEnd();
glBegin( GL_LINES );
} else {
if(oriented) {
if(vert == 0) {
glColor4ubv( (GLubyte *)&cval );
colorme = 1;
} else if(colorme) {
glColor3f( vert&1?1:0, vert&2?1:0, vert&4?1:0 );
}
}
if(isscaled && !oriented && box->level >= 0) {
glVertex3f(
vert&1 ? s0*box->p0.x[0] + s1*box->p1.x[0]
: s1*box->p0.x[0] + s0*box->p1.x[0],
vert&2 ? s0*box->p0.x[1] + s1*box->p1.x[1]
: s1*box->p0.x[1] + s0*box->p1.x[1],
vert&4 ? s0*box->p0.x[2] + s1*box->p1.x[2]
: s1*box->p0.x[2] + s0*box->p1.x[2] );
} else {
glVertex3f(
(vert&1 ? box->p1.x : box->p0.x)[0],
(vert&2 ? box->p1.x : box->p0.x)[1],
(vert&4 ? box->p1.x : box->p0.x)[2]
);
}
}
}
glEnd();
if(st->boxlabels && st->boxlabelscale != 0) {
float sz = .16 * vdist( &box->p0, &box->p1 ) / st->textsize;
vlerp( &mid, .5, &box->p0, &box->p1 );
sfStrDrawTJ( lbl, sz, &mid, &Ttext, "c" );
}
}
}
glLineWidth( 1 );
}
int specks_partial_pick_decode( struct stuff *st, int id,
int nhits, int nents, GLuint *hitbuf,
unsigned int *bestzp, struct specklist **slp,
int *specknop, Point *pos )
{
int i, hi, ns, slno;
GLuint z0, bestz = *bestzp;
int bestslno = 0, bestspeck = -1;
struct specklist *sl, *slhead;
if(st == NULL)
return 0;
if(st->picked != NULL)
(*st->picked)(st, NULL, NULL, nhits); /* "prepare for up to nhits calls" */
slhead = st->frame_sl; /* st->sl as snapped by specks_ffn() */
if(slhead == NULL) slhead = st->sl; /* maybe there is no specks_ffn() */
if(slhead == NULL) return 0;
for(hi = 0, i = 0; hi < nhits && i < nents; hi++, i += ns + 3) {
ns = hitbuf[i];
if(ns < 1 || ns > 16)
break; /* trouble */
z0 = hitbuf[i+1];
if(id != hitbuf[i+3] || ns <= 1) continue;
if(st->usepoly>1) /* debug */
printf(ns>1?"[%x %d/%d]":"[%x %d]", z0, hitbuf[i+3],hitbuf[i+4]);
if(bestz > z0 && ns > 1 && (slno = hitbuf[i+4]) > 0) {
bestz = z0;
bestslno = slno;
bestspeck = (ns>2) ? hitbuf[i+5] : 0;
}
if(st->picked != NULL && ns > 2) {
for(sl = slhead, slno = 1; sl != NULL && slno < hitbuf[i+4]; sl = sl->next, slno++)
;
if(sl && hitbuf[i+5] < sl->nspecks)
if((*st->picked)(st, &hitbuf[i], sl, hitbuf[i+5]))
return 0;
}
}
if(st->picked != NULL) {
if((*st->picked)(st, NULL, NULL, 0))
return 0;
3171
3172
3173
3174
3175
3176
3177
3178
3179
3180
3181
3182
3183
3184
3185
3186
3187
3188
3189
3190
3191
3192
3193
3194
3195
}
if(bestslno <= 0)
return 0;
for(sl = slhead, slno = 1; sl != NULL; sl = sl->next, slno++) {
if(slno == bestslno) {
if(bestspeck < 0 || bestspeck >= sl->nspecks) {
msg("Bogus pick result: sl %x bestspeck %d of 0..%d!\n",
sl, bestspeck, sl->nspecks-1);
return 0;
}
if(slp) *slp = sl;
if(specknop) *specknop = bestspeck;
if(pos) {
if(bestspeck < 0 || bestspeck >= sl->nspecks)
bestspeck = 0;
*pos = NextSpeck( sl->specks, sl, bestspeck )->p;
}
*bestzp = bestz;
return 1;
}
}
return 0;
}
int selname( struct stuff *st, char *name, int create ) {
int i, avail;
if(name == NULL) return 0;
if(!strcmp(name, "all") || !strcmp(name, "on")) return SEL_ALL;
if(!strcmp(name, "none") || !strcmp(name, "off")) return SEL_OFF;
if(!strcmp(name, "thresh")) return SEL_THRESH;
if(!strcmp(name, "pick")) return SEL_PICK;
for(i = COUNT(st->selitems); --i >= 0; ) {
if(!strcmp(name, st->selitems[i].name))
return i+1;
if(st->selitems[i].name[0] == '\0') avail = i;
}
if(create) {
sprintf(st->selitems[avail].name, "%.15s", name);
return avail+1;
}
return 0;
}
void selinit( SelOp *sp ) {
sp->wanton = 0;
sp->use = SEL_NONE;
}
static char *selcat( struct stuff *st, char *from, int selno, int preop ) {
char *what = "";
static char s[8];
switch(selno) {
case SEL_ALL: what = "all"; break;
case SEL_THRESH: what = "thresh"; break;
case SEL_PICK: what = "pick"; break;
default:
if(selno > 0 && selno <= MAXSEL && st->selitems[selno-1].name[0] != '\0')
what = &st->selitems[selno-1].name[0];
else {
sprintf(s, "%d", selno<0||selno>MAXSEL?0:selno);
what = s;
}
}
if(preop)
*from++ = preop;
return from + sprintf(from, "%.15s ", what);
}
char *show_selexpr( struct stuff *st, SelOp *destp, SelOp *srcp )
{
char str[(MAXSELNAME + 2)*33];
char *tail = str;
static char *sstr;
static int sroom = -1;
int i;
if(destp) {
if(destp->wanted == 0) {
tail = selcat(st, tail, SEL_ALL, 0 );
} else {
for(i = SEL_THRESH; i > 0; i--) {
tail = selcat( st, tail, i,
destp->wanton & SELMASK(i) ? 0 : '-' );
} else if(destp->wanton & SELMASK(i)) {
tail = selcat( st, tail, i, '^' );
}
}
}
if(srcp)
tail += sprintf(tail, "= ");
tail = selcat( st, tail, srcp->use, 0 );
} else if(srcp->use == SEL_USE && srcp->wanted == 0) {
tail = selcat( st, tail, SEL_ALL, 0 );
3272
3273
3274
3275
3276
3277
3278
3279
3280
3281
3282
3283
3284
3285
3286
3287
3288
3289
3290
3291
3292
3293
3294
3295
3296
3297
3298
3299
3300
3301
3302
3303
3304
3305
3306
3307
3308
3309
3310
3311
3312
3313
3314
3315
3316
3317
3318
3319
3320
3321
3322
3323
3324
3325
} else {
for(i = SEL_THRESH; i > 0; i--) {
if(srcp->wanted & SELMASK(i)) {
tail = selcat( st, tail, i,
srcp->wanton & SELMASK(i) ? 0 : '-' );
} else if(srcp->wanton & SELMASK(i)) {
tail = selcat( st, tail, i, '^' );
}
}
}
}
if(tail - str > sroom) {
if(sstr) Free(sstr);
sroom = tail - str + 60;
sstr = NewN( char, sroom );
}
if(tail == str) strcpy(sstr, "null");
else {
tail[-1] = '\0';
strcpy(sstr, str);
}
return sstr;
}
enum SelToken {
SEL_ERR, /* unknown */
SEL_EOF,
SEL_WORD, /* bare word or +word */
SEL_EQUALS /* = */
};
static enum SelToken seltoken( char **sp, int *leadcp, char word[MAXSELNAME] ) {
char *p = *sp;
int k;
*leadcp = '\0';
word[0] = '\0';
while(isspace(*p)) p++;
if(*p == '\0')
return SEL_EOF;
if(*p == '-' || *p == '^' || *p == '+')
*leadcp = *p++;
if(*p == '=') {
*sp = p+1;
return SEL_EQUALS;
}
if(!(isalnum(*p) || *p == '_'))
return SEL_ERR;
word[0] = *p++;
for(k = 1; isalnum(*p) || *p == '_'; p++) {
if(k < MAXSELNAME-1) word[k++] = *p;
}
word[k] = '\0';
*sp = p;
return SEL_WORD;
void seldest2src( struct stuff *st, CONST SelOp *dest, SelOp *src ) {
selinit( src );
if(dest->use == SEL_USE) {
*src = *dest;
} else if(dest->use == SEL_DEST) {
src->wanted = ~dest->wanted | dest->wanton;
src->wanton = dest->wanton;
void selsrc2dest( struct stuff *st, CONST SelOp *src, SelOp *dest ) {
*dest = *src;
if(src->use == SEL_USE) {
dest->wanted = ~src->wanted;
dest->wanton = src->wanton & src->wanted;
dest->use = SEL_DEST;
}
}
void seldestinvert( struct stuff *st, SelOp *dest ) {
dest->wanton ^= ~dest->wanted;
}
int seldest( struct stuff *st, SelOp *dest, int selno, int selch ) {
3353
3354
3355
3356
3357
3358
3359
3360
3361
3362
3363
3364
3365
3366
3367
3368
3369
3370
3371
3372
3373
3374
3375
3376
3377
3378
3379
3380
3381
3382
SelMask mask;
if(dest == NULL)
return 0;
if(selno == SEL_ALL) {
mask = ~0;
} else if(selno <= 0 || selno > 32) {
return 0;
} else {
mask = SELMASK(selno);
}
if(dest->use != SEL_DEST) {
dest->use = SEL_DEST;
dest->wanted = ~0;
dest->wanton = 0;
}
switch(selch) {
case '^':
dest->wanted |= mask;
dest->wanton |= mask;
break;
case '-':
dest->wanted &= ~mask;
dest->wanton &= ~mask;
break;
case '+':
case '\0':
dest->wanted &= ~mask;
dest->wanton |= mask;
break;
default:
int selsrc( struct stuff *st, SelOp *src, int selno, int selch ) {
SelMask mask;
if(src == NULL)
return 0;
if(src->use == SEL_DEST) {
src->wanted = 0;
src->wanton = 0;
src->use = SEL_USE;
}
if(selno == SEL_OFF) {
src->wanted = src->wanton = mask = ~0;
src->use = SEL_NONE;
} else if(selno == SEL_ALL) {
src->wanted = src->wanton = mask = 0;
src->use = SEL_USE;
} else if(selno > 0 && selno <= 32) {
mask = SELMASK(selno);
} else {
return 0;
}
switch(selch) {
case '-':
src->wanted |= mask;
src->wanton &= ~mask;
break;
case '+':
case '\0':
src->wanted |= mask;
src->wanton |= mask;
break;
default:
return 0;
}
return 1;
}
/*
* [word [op]=] { [op]word }*
*/
int parse_selexpr( struct stuff *st, char *str, SelOp *destp, SelOp *srcp, char *plaint )
{
SelOp dest, src;
char wd[MAXSELNAME], w[MAXSELNAME];
char *p = str;
int leadc, leadc2;
enum SelToken tok, tok2;
int ok = 1;
int anysrc = 0, anydest = 0;
selinit(&dest); selinit(&src);
tok = seltoken( &p, &leadc, wd );
if(tok == SEL_EOF)
return 0;
/* Had better begin with a word, and with no prefix */
int destno;
if(tok != SEL_WORD) goto fail;
destno = selname( st, wd, 1 );
tok2 = seltoken( &p, &leadc2, w );
if(tok2 == SEL_ERR) goto fail;
ok = seldest( st, &dest, destno, leadc ? leadc : leadc2 );
anydest = 1;
if(!ok) goto fail;
if(tok2 == SEL_WORD) {
tok = SEL_WORD;
leadc = leadc2;
strcpy(wd, w);
} else {
tok = seltoken( &p, &leadc, wd );
}
}
while(srcp && tok == SEL_WORD) {
ok = selsrc( st, &src, selname( st, wd, 0 ), leadc );
if(!ok) goto fail;
if(src.use == SEL_NONE && src.wanted != 0 && destp) {
seldestinvert( st, &dest );
selsrc( st, &src, SEL_ALL, 0 ); /* X = off <=> -X = on */
}
anysrc = 1;
tok = seltoken( &p, &leadc, wd );
if(tok != SEL_EOF)
goto fail;
if(destp && anydest) *destp = dest;
if(srcp && anysrc) *srcp = src;
return (anydest?1:0) + (anysrc?2:0);
if(plaint)
msg("%s: um, %s", plaint, str);
return 0; /*XXX*/
}
3482
3483
3484
3485
3486
3487
3488
3489
3490
3491
3492
3493
3494
3495
3496
3497
3498
3499
3500
3501
3502
3503
3504
3505
3506
CONST char *selcounts( struct stuff *st, struct specklist *sl, SelOp *selp ) {
int i;
static char counts[24];
int yes, total;
SelOp selop;
if(selp == NULL) return "";
if(selp->use == SEL_DEST)
seldest2src( st, selp, &selop );
else
selop = *selp;
for(yes = total = 0; sl != NULL; sl = sl->next) {
SelMask *sel = sl->sel;
if(sl->text != NULL || sl->nsel < sl->nspecks || sl->special != SPECKS)
continue;
total += sl->nspecks;
for(i = 0; i < sl->nspecks; i++)
if(SELECTED(sel[i], &selop))
yes++;
}
if(selop.use == SEL_NONE) yes = 0;
sprintf(counts, "%d of %d", yes, total);
return counts;
}
SpecksPickFunc specks_all_picks( struct stuff *st, SpecksPickFunc func, void *arg ) {
SpecksPickFunc was = st->picked;
st->picked = func;
st->pickinfo = arg;
return was;
}
#if CAVE
void parti_seto2w( struct stuff *st, int objno, CONST Matrix *newTo2w ) {
st->objTo2w = *newTo2w; /* ignores objno -- there's only one right now! */
}
void parti_geto2w( struct stuff *st, int objno, Matrix *curTo2w ) {
*curTo2w = st->objTo2w; /* ignores objno -- there's only one right now! */
}
void specks_display( struct stuff *st )
{
int showmenus;
int menuhit = 0;
static int hidescene;
if( CAT_dsp_mode == APP_DSP_NORMAL ) {
#if !(MENU_IN_PPR)
if( CAVEEye == CAVE_LEFT_EYE ) {
menu_check( pmenu, pmenu->cavewall );
menu_check( stubmenu, stubmenu->cavewall );
menu_sethidden( pmenu, st->hidemenu || empty );
menu_sethidden( stubmenu, st->hidemenu<=0 || empty );
3540
3541
3542
3543
3544
3545
3546
3547
3548
3549
3550
3551
3552
3553
3554
3555
3556
3557
3558
3559
3560
3561
3562
3563
3564
3565
3566
3567
3568
3569
3570
3571
3572
3573
3574
3575
3576
3577
3578
3579
3580
3581
3582
3583
}
#endif
glPushMatrix();
/* The following only works if our transformation is exactly the
* Cave nav transform, i.e. if the CAT system hasn't
* translated us further; but that's true for this app.
*/
CAVENavInverseTransform();
menu_draw( pmenu );
if(!pmenu->hidden) {
menuhit = (pmenu->wallhit > 0);
menu_setpos( stubmenu, ment.menu->x0, ment.menu->y0 );
}
menu_draw( stubmenu );
glPopMatrix();
}
if(hidescene && !menuhit)
hidescene = 0;
if(menuhit && *CAVEFramesPerSecond < st->menudemandfps)
hidescene = 1; /* Don't draw scene if too slow to operate menu easily */
if(hidescene)
return;
glPushMatrix();
glTranslatef( st->gtrans.x[0], st->gtrans.x[1], st->gtrans.x[2] );
glScalef( st->gscale, st->gscale, st->gscale );
glMultMatrixf( st->objTo2w.m );
drawspecks( st );
glPopMatrix();
}
#endif /*NOCAVE*/
static void addchunk( struct stuff *st, int nsp, int bytesperspeck,
float scaledby, struct speck *sp, char *text,
int outbytesperspeck )
{
struct specklist **slp, *sl = NewN( struct specklist, 1 );
memset( sl, 0, sizeof(*sl) );
sl->speckseq = ++st->speckseq;
3585
3586
3587
3588
3589
3590
3591
3592
3593
3594
3595
3596
3597
3598
3599
3600
3601
3602
3603
3604
3605
sl->bytesperspeck = outbytesperspeck;
sl->specks = NewNSpeck( sl, nsp );
sl->nspecks = nsp;
sl->scaledby = scaledby;
if(text) {
sl->text = NewN( char, strlen(text)+1 );
strcpy(sl->text, text);
} else {
sl->text = NULL;
}
if(bytesperspeck == outbytesperspeck) {
memcpy( sl->specks, sp, nsp*sl->bytesperspeck );
} else {
int i;
for(i = 0; i < nsp; i++)
memcpy(((char *)sl->specks) + i*outbytesperspeck,
((char *)sp) + i*bytesperspeck,
outbytesperspeck);
}
sl->sel = NewN( SelMask, nsp );
sl->nsel = nsp;
memset(sl->sel, 0, nsp*sizeof(SelMask));
slp = specks_timespecksptr(st, st->curdata, st->datatime);
sl->next = *slp;
*slp = sl;
st->sl = specks_timespecks(st, st->curdata, st->curtime); /* in case it changed */
sl->colorseq = -1; /* Force recomputing colors */
sl->sizeseq = -1; /* Force recomputing sizes */
}
int specks_count( struct specklist *sl ) {
int n;
for(n = 0; sl != NULL; sl = sl->next)
if(sl->text == NULL)
n += sl->nspecks * (sl->subsampled>0 ? sl->subsampled : 1);
return n;
}
#define LINEBUFSIZE 2048
static char *getline(FILE *f, char *buf) {
buf[0] = '\0';
while(fgets(buf, LINEBUFSIZE, f) != NULL) {
char *cp = buf;
while(isspace(*cp)) cp++;
if(*cp != '#' && *cp != '\0')
return cp;
}
return NULL;
}
int tokenize(char *str, char *tbuf, int maxargs, char **argv, char **commentp)
{
register char *ip = str;
register char *op = tbuf;
int argc = 0;
if(commentp) *commentp = NULL;
while(argc < maxargs-1) {
while(isspace(*ip)) ip++;
if(*ip == '\0') goto eol;
argv[argc++] = op;
switch(*ip) {
case '#':
if(commentp != NULL) {
*commentp = op;
while(*ip && *ip != '\n' && *ip != '\r')
*op++ = *ip++;
*op = '\0';
}
goto eol;
case '"':
while(*ip != '"') {
if(*ip == '\\') ip++;
if(*ip == '\0') goto eol;
*op++ = *ip++;
}
break;
case '\'':
while(*ip != '\'') {
if(*ip == '\\') ip++;
if(*ip == '\0') goto eol;
*op++ = *ip++;
}
3683
3684
3685
3686
3687
3688
3689
3690
3691
3692
3693
3694
3695
3696
3697
3698
3699
3700
3701
3702
3703
3704
3705
3706
3707
3708
break;
default:
while(!isspace(*ip)) {
if(*ip == '\\') ip++;
if(*ip == '\0') goto eol;
*op++ = *ip++;
}
break;
}
*op++ = '\0';
}
/* oh no, too many entries for argv[] array --
* leave all remaining chars in last argument.
*/
strcpy(op, ip);
argv[argc++] = op;
eol:
*op = '\0';
argv[argc] = NULL;
return argc;
}
char *rejoinargs( int arg0, int argc, char **argv )
{
int k;
int room = 2;
char *ep;
static char *space = NULL;
static int sroom = 0;
for(k = arg0; k < argc; k++)
room += strlen(argv[k]) + 1;
if(room > sroom) {
if(space) free(space);
sroom = room + 50;
space = malloc(sroom);
}
for(k = arg0, ep = space; k < argc; k++) {
ep += sprintf(ep, "%s ", argv[k]);
}
if(ep > space) ep--;
*ep = '\0';
return space;
}
static enum SurfStyle getstyle( char *str )
{
if(str == NULL || !strcmp(str, "solid") || !strncmp(str, "fill", 4)
|| !strncmp(str, "poly", 4))
return S_SOLID;
if(!strncmp(str, "wire", 4) || !strncmp(str, "line", 4))
return S_LINE;
if(!strncmp(str, "plane", 5) || !strncmp(str, "ax", 2))
return S_PLANE;
if(!strncmp(str, "point", 5))
return S_POINT;
return S_OFF;
msg("Unknown surface style \"%s\": want solid|line|plane|point|off", str);
return S_SOLID;
}
/*
* Xcen Ycen Zcen ellipsoid [-t txno] [-c cindex] [-s surfstyle] [-n nu[,nv]] [-r sizex[,y,z]] [0-or-9-or-16-numbers-tfm]
*/
void specks_read_ellipsoid( struct stuff *st, Point *pos, int argc, char **argv, char *comment ) {
int i;
struct ellipsoid e, *ep;
float m3[3*3];
memset(&e, 0, sizeof(e));
e.cindex = -1;
e.pos = *pos;
e.size.x[0] = e.size.x[1] = e.size.x[2] = 1;
if(comment) {
e.title = (comment[1] == ' ') ? comment+2 : comment+1;
3762
3763
3764
3765
3766
3767
3768
3769
3770
3771
3772
3773
3774
3775
3776
3777
3778
3779
3780
3781
3782
}
for(i = 1; i+1 < argc; i += 2) {
if(!strncmp(argv[i], "-c", 2)) {
sscanf(argv[i+1], "%d", &e.cindex);
} else if(!strncmp(argv[i], "-s", 2)) {
e.style = getstyle(argv[i+1]);
} else if(!strcmp(argv[i], "-r")) {
int k = sscanf(argv[i+1], "%f%*c%f%*c%f", &e.size.x[0],&e.size.x[1],&e.size.x[2]);
switch(k) {
case 1: e.size.x[2] = e.size.x[1] = e.size.x[0]; break;
case 3: break;
default: msg("ellipsoid -r: expected 1 or 3 comma-separated semimajor axes not %s", argv[i+1]);
}
} else if(!strcmp(argv[i], "-n")) {
int k = sscanf(argv[i+1], "%d%*c%d", &e.nu, &e.nv);
switch(k) {
case 1: e.nv = e.nu/2 + 1; break;
case 2: break;
default: msg("ellipsoid -n: expected nu or nu,nv but not %s", argv[i+1]);
}
} else if(!strcmp(argv[i], "-l")) {
sscanf(argv[i+1], "%d", &e.level);
} else {
break;
}
}
if(i == argc) {
/* OK */
} else if(i+9 == argc && 9==getfloats(m3, 9, i, argc, argv)) {
memcpy(&e.ori.m[0*4+0], &m3[0], 3*sizeof(float));
memcpy(&e.ori.m[1*4+0], &m3[3], 3*sizeof(float));
memcpy(&e.ori.m[2*4+0], &m3[6], 3*sizeof(float));
e.ori.m[3*4+3] = 1;
e.hasori = 1;
} else if(i+16 == argc && 16==getfloats(&e.ori.m[0], 16, i, argc, argv)) {
e.hasori = 1;
} else if(i+3 == argc && 3==getfloats(rxyz, 3, i, argc, argv)) {
float aer[3];
aer[0] = rxyz[1];
aer[1] = rxyz[0];
aer[2] = rxyz[2];
xyzaer2tfm( &e.ori, NULL, aer );
e.hasori = 1;
msg("ellipsoid: expected 0 or 3 (RxRyRz) or 9 or 16 numbers after options, not %s",
rejoinargs(i, argc, argv));
return;
}
/* OK, take it */
ep = NewN( struct ellipsoid, 1 );
*ep = e;
if(e.title) ep->title = shmstrdup(e.title);
ep->next = st->staticellipsoids;
st->staticellipsoids = ep;
}
void specks_read_mesh( struct stuff *st, FILE *f, int argc, char **argv, char *buf )
int i, count, alloced, err = 0;
int havetx = 0;
Point pts[300], txs[300];
struct mesh *m = NewN( struct mesh, 1 );
int timestep = st->datatime;
m->txno = -1;
m->pts = pts; m->tx = txs;
alloced = COUNT(pts);
if(!strcmp(argv[0], "quadmesh") || !strcmp(argv[0], "mesh")) {
for(i = 1; i+1 < argc; i += 2) {
if(!strncmp(argv[i], "-time", 3)) {
timestep = atoi(argv[i+1]);
} else if(!strncmp(argv[i], "-t", 2)) {
havetx = sscanf(argv[i+1], "%d", &m->txno);
} else if(!strcmp(argv[i], "-static")) {
timestep = -1;
i--;
} else if(!strncmp(argv[i], "-c", 2)) {
sscanf(argv[i+1], "%d", &m->cindex);
} else if(!strncmp(argv[i], "-s", 2)) {
m->style = getstyle(argv[i+1]);
} else {
break;
}
3856
3857
3858
3859
3860
3861
3862
3863
3864
3865
3866
3867
3868
3869
3870
3871
3872
3873
3874
3875
3876
3877
3878
3879
3880
3881
3882
3883
3884
3885
3886
3887
3888
3889
3890
3891
3892
3893
3894
3895
3896
3897
3898
3899
3900
3901
3902
3903
3904
3905
3906
3907
3908
3909
3910
3911
3912
3913
3914
3915
3916
3917
3918
3919
3920
3921
3922
3923
3924
}
if(m->type == QUADMESH) {
getline(f, buf);
if(sscanf(buf, "%d%d", &m->nu, &m->nv) != 2
|| m->nu <= 0 || m->nv <= 0) {
msg("quadmesh: expected nu nv, got %s", buf);
Free(m);
return;
}
alloced = m->nverts = m->nu * m->nv;
m->pts = NewN( Point, m->nverts );
m->tx = havetx ? NewN( Point, m->nverts ) : NULL;
}
count = 0;
while((cp = getline(f, buf)) != NULL) {
int ngot;
Point *tp;
#define BRA '{'
#define CKET '}'
if(*cp == BRA) continue;
if(*cp == CKET) break;
if(count >= alloced) {
if(m->type == QUADMESH) {
err = 1;
msg("Only expected %d*%d=%d vertices; what's %s",
m->nu,m->nv, alloced, cp);
break;
}
/* otherwise, ask for more */
/* XXX maybe later */
break;
}
tp = &m->pts[count];
for(ngot = 0; ngot < 3; ngot++, cp = ep) {
tp->x[ngot] = strtod(cp, &ep);
if(cp == ep) break;
}
if(havetx && ngot == 3) {
tp = &m->tx[count];
for(ngot = 0; ngot < 2; ngot++, cp = ep) {
tp->x[ngot] = strtod(cp, &ep);
if(cp == ep) break;
}
ngot++;
}
if(ngot != 3) {
msg("Expected %d numbers per line; what's %s",
havetx?5:3, buf);
err = 1;
break;
}
count++;
}
if(m->type == QUADMESH && count < alloced) {
err = 1;
msg("Expected %d*%d = %d vertices, only got %d", m->nu,m->nv, alloced, count);
}
if(err) {
if(m->pts != pts) Free(m->pts);
if(m->tx != txs && m->tx != NULL) Free(m->tx);
Free(m);
return;
}
3925
3926
3927
3928
3929
3930
3931
3932
3933
3934
3935
3936
3937
3938
3939
3940
3941
3942
3943
3944
3945
3946
3947
3948
3949
3950
3951
3952
3953
3954
3955
3956
3957
3958
3959
3960
3961
3962
3963
3964
3965
3966
if(timestep >= 0) {
if(timestep >= st->ntimes)
specks_timespecksptr( st, st->curdata, timestep );
m->next = st->meshes[st->curdata][timestep];
st->meshes[st->curdata][timestep] = m;
} else {
m->next = st->staticmeshes;
st->staticmeshes = m;
}
}
void specks_read_waveobj( struct stuff *st, int argc, char **argv, char *line, char *infname )
{
struct mesh *m = NewN( struct mesh, 1 );
int lno;
int i, f;
int timestep = st->datatime;
FILE *inf;
char *fname, *fullname;
#define CHUNK 500
int kpts, kfvs, kfv0, kfvn;
int npts, nfvs, nfv0, nfvn;
struct chain {
void *data;
int pos;
struct chain *next;
} *cpts, *cfvs, *cfv0, *cfvn;
Point vpts[CHUNK];
int vfvs[CHUNK], vfv0[CHUNK], vfvn[CHUNK];
memset(m, 0, sizeof(*m));
m->type = POLYMESH;
m->cindex = -1;
m->txno = -1;
for(i = 1; i+1 < argc; i += 2) {
if(!strncmp(argv[i], "-time", 2)) {
timestep = atoi(argv[i+1]);
} else if(!strncmp(argv[i], "-texture", 3) || !strncmp(argv[i], "-tx", 3)) {
sscanf(argv[i+1], "%d", &m->txno);
3968
3969
3970
3971
3972
3973
3974
3975
3976
3977
3978
3979
3980
3981
3982
3983
3984
3985
3986
3987
3988
3989
3990
3991
3992
3993
3994
3995
3996
3997
3998
3999
4000
} else if(!strcmp(argv[i], "-static")) {
timestep = -1;
i--;
} else if(!strncmp(argv[i], "-c", 2)) {
sscanf(argv[i+1], "%d", &m->cindex);
} else if(!strncmp(argv[i], "-s", 2)) {
m->style = getstyle(argv[i+1]);
} else {
break;
}
}
fname = argv[i];
fullname = findfile( infname, fname );
if(fullname == NULL || (inf = fopen(fullname, "r")) == NULL) {
msg("waveobj: can't find .obj file %s", fname);
return;
}
#define VINIT(what) c##what = NULL, k##what = n##what = 0
#define VTOTAL(what) (k##what + n##what)
#define VNEXT(what) \
if(++k##what >= CHUNK) { \
struct chain *ct = (struct chain *)malloc(sizeof(*ct)); \
ct->data = malloc(sizeof(v##what)); \
memcpy(ct->data, v##what, sizeof(v##what)); \
ct->pos = n##what; \
ct->next = c##what; \
c##what = ct; \
k##what = 0; \
n##what += CHUNK; \
}
#define VSTUFF(dest, what) { \