#include <stdio.h>
#include <stdlib.h>
#include <string.h>
-#include <math.h>
-#include "glext.h"
-#include "vec3.h"
-#include "geom.h" /* Only for height constants! */
-#include "base_image.h"
#include "solid.h"
#include "base_config.h"
#include "binary.h"
+#include "fs.h"
#define MAGIC 0x4c4f53af
#define SOL_VERSION 6
-#define LARGE 1.0e+5f
-
/*---------------------------------------------------------------------------*/
-static float erp(float t)
-{
- return 3.0f * t * t - 2.0f * t * t * t;
-}
-
-static float derp(float t)
+static void sol_load_mtrl(fs_file fin, struct s_mtrl *mp)
{
- return 6.0f * t - 6.0f * t * t;
-}
-
-static void sol_body_v(float v[3],
- const struct s_file *fp,
- const struct s_body *bp)
-{
- if (bp->pi >= 0 && fp->pv[bp->pi].f)
- {
- const struct s_path *pp = fp->pv + bp->pi;
- const struct s_path *pq = fp->pv + pp->pi;
-
- v_sub(v, pq->p, pp->p);
- v_scl(v, v, 1.0f / pp->t);
-
- v_scl(v, v, derp(bp->t / pp->t));
- }
- else
- {
- v[0] = 0.0f;
- v[1] = 0.0f;
- v[2] = 0.0f;
- }
-}
-
-void sol_body_p(float p[3],
- const struct s_file *fp,
- const struct s_body *bp)
-{
- float v[3];
-
- if (bp->pi >= 0)
- {
- const struct s_path *pp = fp->pv + bp->pi;
- const struct s_path *pq = fp->pv + pp->pi;
-
- if (pp->s)
- {
- v_sub(v, pq->p, pp->p);
- v_mad(p, pp->p, v, erp(bp->t / pp->t));
- }
- else
- {
- v_sub(v, pq->p, pp->p);
- v_mad(p, pp->p, v, bp->t / pp->t);
- }
- }
- else
- {
- p[0] = 0.0f;
- p[1] = 0.0f;
- p[2] = 0.0f;
- }
-}
-
-/*---------------------------------------------------------------------------*/
-
-static void sol_load_mtrl(FILE *fin, struct s_mtrl *mp)
-{
- get_array(fin, mp->a, 4);
get_array(fin, mp->d, 4);
+ get_array(fin, mp->a, 4);
get_array(fin, mp->s, 4);
get_array(fin, mp->e, 4);
get_array(fin, mp->h, 1);
get_index(fin, &mp->fl);
- fread(mp->f, 1, PATHMAX, fin);
+ fs_read(mp->f, 1, PATHMAX, fin);
}
-static void sol_load_vert(FILE *fin, struct s_vert *vp)
+static void sol_load_vert(fs_file fin, struct s_vert *vp)
{
get_array(fin, vp->p, 3);
}
-static void sol_load_edge(FILE *fin, struct s_edge *ep)
+static void sol_load_edge(fs_file fin, struct s_edge *ep)
{
get_index(fin, &ep->vi);
get_index(fin, &ep->vj);
}
-static void sol_load_side(FILE *fin, struct s_side *sp)
+static void sol_load_side(fs_file fin, struct s_side *sp)
{
get_array(fin, sp->n, 3);
get_float(fin, &sp->d);
}
-static void sol_load_texc(FILE *fin, struct s_texc *tp)
+static void sol_load_texc(fs_file fin, struct s_texc *tp)
{
get_array(fin, tp->u, 2);
}
-static void sol_load_geom(FILE *fin, struct s_geom *gp)
+static void sol_load_geom(fs_file fin, struct s_geom *gp)
{
get_index(fin, &gp->mi);
get_index(fin, &gp->ti);
get_index(fin, &gp->vk);
}
-static void sol_load_lump(FILE *fin, struct s_lump *lp)
+static void sol_load_lump(fs_file fin, struct s_lump *lp)
{
get_index(fin, &lp->fl);
get_index(fin, &lp->v0);
get_index(fin, &lp->sc);
}
-static void sol_load_node(FILE *fin, struct s_node *np)
+static void sol_load_node(fs_file fin, struct s_node *np)
{
get_index(fin, &np->si);
get_index(fin, &np->ni);
get_index(fin, &np->lc);
}
-static void sol_load_path(FILE *fin, struct s_path *pp)
+static void sol_load_path(fs_file fin, struct s_path *pp)
{
get_array(fin, pp->p, 3);
get_float(fin, &pp->t);
get_index(fin, &pp->s);
}
-static void sol_load_body(FILE *fin, struct s_body *bp)
+static void sol_load_body(fs_file fin, struct s_body *bp)
{
get_index(fin, &bp->pi);
get_index(fin, &bp->ni);
get_index(fin, &bp->gc);
}
-static void sol_load_item(FILE *fin, struct s_item *hp)
+static void sol_load_item(fs_file fin, struct s_item *hp)
{
get_array(fin, hp->p, 3);
get_index(fin, &hp->t);
get_index(fin, &hp->n);
}
-static void sol_load_goal(FILE *fin, struct s_goal *zp)
+static void sol_load_goal(fs_file fin, struct s_goal *zp)
{
get_array(fin, zp->p, 3);
get_float(fin, &zp->r);
}
-static void sol_load_swch(FILE *fin, struct s_swch *xp)
+static void sol_load_swch(fs_file fin, struct s_swch *xp)
{
get_array(fin, xp->p, 3);
get_float(fin, &xp->r);
get_index(fin, &xp->i);
}
-static void sol_load_bill(FILE *fin, struct s_bill *rp)
+static void sol_load_bill(fs_file fin, struct s_bill *rp)
{
get_index(fin, &rp->fl);
get_index(fin, &rp->mi);
get_array(fin, rp->rx, 3);
get_array(fin, rp->ry, 3);
get_array(fin, rp->rz, 3);
+ get_array(fin, rp->p, 3);
}
-static void sol_load_jump(FILE *fin, struct s_jump *jp)
+static void sol_load_jump(fs_file fin, struct s_jump *jp)
{
get_array(fin, jp->p, 3);
get_array(fin, jp->q, 3);
get_float(fin, &jp->r);
}
-static void sol_load_ball(FILE *fin, struct s_ball *bp)
+static void sol_load_ball(fs_file fin, struct s_ball *bp)
{
- get_array(fin, bp->e[0], 3);
- get_array(fin, bp->e[1], 3);
- get_array(fin, bp->e[2], 3);
- get_array(fin, bp->p, 3);
+ get_array(fin, bp->p, 3);
get_float(fin, &bp->r);
+
+ bp->e[0][0] = bp->E[0][0] = 1.0f;
+ bp->e[0][1] = bp->E[0][1] = 0.0f;
+ bp->e[0][2] = bp->E[0][2] = 0.0f;
+
+ bp->e[1][0] = bp->E[1][0] = 0.0f;
+ bp->e[1][1] = bp->E[1][1] = 1.0f;
+ bp->e[1][2] = bp->E[1][2] = 0.0f;
+
+ bp->e[2][0] = bp->E[2][0] = 0.0f;
+ bp->e[2][1] = bp->E[2][1] = 0.0f;
+ bp->e[2][2] = bp->E[2][2] = 1.0f;
}
-static void sol_load_view(FILE *fin, struct s_view *wp)
+static void sol_load_view(fs_file fin, struct s_view *wp)
{
get_array(fin, wp->p, 3);
get_array(fin, wp->q, 3);
}
-static void sol_load_dict(FILE *fin, struct s_dict *dp)
+static void sol_load_dict(fs_file fin, struct s_dict *dp)
{
get_index(fin, &dp->ai);
get_index(fin, &dp->aj);
}
-static int sol_load_file(FILE *fin, struct s_file *fp)
+static int sol_load_file(fs_file fin, struct s_file *fp)
{
int i;
int magic;
fp->iv = (int *) calloc(fp->ic, sizeof (int));
if (fp->ac)
- fread(fp->av, 1, fp->ac, fin);
+ fs_read(fp->av, 1, fp->ac, fin);
for (i = 0; i < fp->dc; i++) sol_load_dict(fin, fp->dv + i);
for (i = 0; i < fp->mc; i++) sol_load_mtrl(fin, fp->mv + i);
return 1;
}
-static int sol_load_head(FILE *fin, struct s_file *fp)
+static int sol_load_head(fs_file fin, struct s_file *fp)
{
int magic;
int version;
get_index(fin, &fp->wc);
get_index(fin, &fp->ic);
#endif
- fseek(fin, 18 * 4, SEEK_CUR);
+ fs_seek(fin, 18 * 4, SEEK_CUR);
if (fp->ac)
{
fp->av = (char *) calloc(fp->ac, sizeof (char));
- fread(fp->av, 1, fp->ac, fin);
+ fs_read(fp->av, 1, fp->ac, fin);
}
if (fp->dc)
int sol_load_only_file(struct s_file *fp, const char *filename)
{
- FILE *fin;
+ fs_file fin;
int res = 0;
- if ((fin = fopen(filename, FMODE_RB)))
+ if ((fin = fs_open(filename, "r")))
{
res = sol_load_file(fin, fp);
- fclose(fin);
+ fs_close(fin);
}
return res;
}
int sol_load_only_head(struct s_file *fp, const char *filename)
{
- FILE *fin;
+ fs_file fin;
int res = 0;
- if ((fin = fopen(filename, FMODE_RB)))
+ if ((fin = fs_open(filename, "r")))
{
res = sol_load_head(fin, fp);
- fclose(fin);
+ fs_close(fin);
}
return res;
}
/*---------------------------------------------------------------------------*/
-static void sol_stor_mtrl(FILE *fout, struct s_mtrl *mp)
+static void sol_stor_mtrl(fs_file fout, struct s_mtrl *mp)
{
- put_array(fout, mp->a, 4);
put_array(fout, mp->d, 4);
+ put_array(fout, mp->a, 4);
put_array(fout, mp->s, 4);
put_array(fout, mp->e, 4);
put_array(fout, mp->h, 1);
put_index(fout, &mp->fl);
- fwrite(mp->f, 1, PATHMAX, fout);
+ fs_write(mp->f, 1, PATHMAX, fout);
}
-static void sol_stor_vert(FILE *fout, struct s_vert *vp)
+static void sol_stor_vert(fs_file fout, struct s_vert *vp)
{
put_array(fout, vp->p, 3);
}
-static void sol_stor_edge(FILE *fout, struct s_edge *ep)
+static void sol_stor_edge(fs_file fout, struct s_edge *ep)
{
put_index(fout, &ep->vi);
put_index(fout, &ep->vj);
}
-static void sol_stor_side(FILE *fout, struct s_side *sp)
+static void sol_stor_side(fs_file fout, struct s_side *sp)
{
put_array(fout, sp->n, 3);
put_float(fout, &sp->d);
}
-static void sol_stor_texc(FILE *fout, struct s_texc *tp)
+static void sol_stor_texc(fs_file fout, struct s_texc *tp)
{
put_array(fout, tp->u, 2);
}
-static void sol_stor_geom(FILE *fout, struct s_geom *gp)
+static void sol_stor_geom(fs_file fout, struct s_geom *gp)
{
put_index(fout, &gp->mi);
put_index(fout, &gp->ti);
put_index(fout, &gp->vk);
}
-static void sol_stor_lump(FILE *fout, struct s_lump *lp)
+static void sol_stor_lump(fs_file fout, struct s_lump *lp)
{
put_index(fout, &lp->fl);
put_index(fout, &lp->v0);
put_index(fout, &lp->sc);
}
-static void sol_stor_node(FILE *fout, struct s_node *np)
+static void sol_stor_node(fs_file fout, struct s_node *np)
{
put_index(fout, &np->si);
put_index(fout, &np->ni);
put_index(fout, &np->lc);
}
-static void sol_stor_path(FILE *fout, struct s_path *pp)
+static void sol_stor_path(fs_file fout, struct s_path *pp)
{
put_array(fout, pp->p, 3);
put_float(fout, &pp->t);
put_index(fout, &pp->s);
}
-static void sol_stor_body(FILE *fout, struct s_body *bp)
+static void sol_stor_body(fs_file fout, struct s_body *bp)
{
put_index(fout, &bp->pi);
put_index(fout, &bp->ni);
put_index(fout, &bp->gc);
}
-static void sol_stor_item(FILE *fout, struct s_item *hp)
+static void sol_stor_item(fs_file fout, struct s_item *hp)
{
put_array(fout, hp->p, 3);
put_index(fout, &hp->t);
put_index(fout, &hp->n);
}
-static void sol_stor_goal(FILE *fout, struct s_goal *zp)
+static void sol_stor_goal(fs_file fout, struct s_goal *zp)
{
put_array(fout, zp->p, 3);
put_float(fout, &zp->r);
}
-static void sol_stor_swch(FILE *fout, struct s_swch *xp)
+static void sol_stor_swch(fs_file fout, struct s_swch *xp)
{
put_array(fout, xp->p, 3);
put_float(fout, &xp->r);
put_index(fout, &xp->i);
}
-static void sol_stor_bill(FILE *fout, struct s_bill *rp)
+static void sol_stor_bill(fs_file fout, struct s_bill *rp)
{
put_index(fout, &rp->fl);
put_index(fout, &rp->mi);
put_array(fout, rp->rx, 3);
put_array(fout, rp->ry, 3);
put_array(fout, rp->rz, 3);
+ put_array(fout, rp->p, 3);
}
-static void sol_stor_jump(FILE *fout, struct s_jump *jp)
+static void sol_stor_jump(fs_file fout, struct s_jump *jp)
{
put_array(fout, jp->p, 3);
put_array(fout, jp->q, 3);
put_float(fout, &jp->r);
}
-static void sol_stor_ball(FILE *fout, struct s_ball *bp)
+static void sol_stor_ball(fs_file fout, struct s_ball *bp)
{
- put_array(fout, bp->e[0], 3);
- put_array(fout, bp->e[1], 3);
- put_array(fout, bp->e[2], 3);
- put_array(fout, bp->p, 3);
+ put_array(fout, bp->p, 3);
put_float(fout, &bp->r);
}
-static void sol_stor_view(FILE *fout, struct s_view *wp)
+static void sol_stor_view(fs_file fout, struct s_view *wp)
{
put_array(fout, wp->p, 3);
put_array(fout, wp->q, 3);
}
-static void sol_stor_dict(FILE *fout, struct s_dict *dp)
+static void sol_stor_dict(fs_file fout, struct s_dict *dp)
{
put_index(fout, &dp->ai);
put_index(fout, &dp->aj);
}
-static void sol_stor_file(FILE *fin, struct s_file *fp)
+static void sol_stor_file(fs_file fout, struct s_file *fp)
{
int i;
int magic = MAGIC;
int version = SOL_VERSION;
- put_index(fin, &magic);
- put_index(fin, &version);
-
- put_index(fin, &fp->ac);
- put_index(fin, &fp->dc);
- put_index(fin, &fp->mc);
- put_index(fin, &fp->vc);
- put_index(fin, &fp->ec);
- put_index(fin, &fp->sc);
- put_index(fin, &fp->tc);
- put_index(fin, &fp->gc);
- put_index(fin, &fp->lc);
- put_index(fin, &fp->nc);
- put_index(fin, &fp->pc);
- put_index(fin, &fp->bc);
- put_index(fin, &fp->hc);
- put_index(fin, &fp->zc);
- put_index(fin, &fp->jc);
- put_index(fin, &fp->xc);
- put_index(fin, &fp->rc);
- put_index(fin, &fp->uc);
- put_index(fin, &fp->wc);
- put_index(fin, &fp->ic);
-
- fwrite(fp->av, 1, fp->ac, fin);
-
- for (i = 0; i < fp->dc; i++) sol_stor_dict(fin, fp->dv + i);
- for (i = 0; i < fp->mc; i++) sol_stor_mtrl(fin, fp->mv + i);
- for (i = 0; i < fp->vc; i++) sol_stor_vert(fin, fp->vv + i);
- for (i = 0; i < fp->ec; i++) sol_stor_edge(fin, fp->ev + i);
- for (i = 0; i < fp->sc; i++) sol_stor_side(fin, fp->sv + i);
- for (i = 0; i < fp->tc; i++) sol_stor_texc(fin, fp->tv + i);
- for (i = 0; i < fp->gc; i++) sol_stor_geom(fin, fp->gv + i);
- for (i = 0; i < fp->lc; i++) sol_stor_lump(fin, fp->lv + i);
- for (i = 0; i < fp->nc; i++) sol_stor_node(fin, fp->nv + i);
- for (i = 0; i < fp->pc; i++) sol_stor_path(fin, fp->pv + i);
- for (i = 0; i < fp->bc; i++) sol_stor_body(fin, fp->bv + i);
- for (i = 0; i < fp->hc; i++) sol_stor_item(fin, fp->hv + i);
- for (i = 0; i < fp->zc; i++) sol_stor_goal(fin, fp->zv + i);
- for (i = 0; i < fp->jc; i++) sol_stor_jump(fin, fp->jv + i);
- for (i = 0; i < fp->xc; i++) sol_stor_swch(fin, fp->xv + i);
- for (i = 0; i < fp->rc; i++) sol_stor_bill(fin, fp->rv + i);
- for (i = 0; i < fp->uc; i++) sol_stor_ball(fin, fp->uv + i);
- for (i = 0; i < fp->wc; i++) sol_stor_view(fin, fp->wv + i);
- for (i = 0; i < fp->ic; i++) put_index(fin, fp->iv + i);
+ put_index(fout, &magic);
+ put_index(fout, &version);
+
+ put_index(fout, &fp->ac);
+ put_index(fout, &fp->dc);
+ put_index(fout, &fp->mc);
+ put_index(fout, &fp->vc);
+ put_index(fout, &fp->ec);
+ put_index(fout, &fp->sc);
+ put_index(fout, &fp->tc);
+ put_index(fout, &fp->gc);
+ put_index(fout, &fp->lc);
+ put_index(fout, &fp->nc);
+ put_index(fout, &fp->pc);
+ put_index(fout, &fp->bc);
+ put_index(fout, &fp->hc);
+ put_index(fout, &fp->zc);
+ put_index(fout, &fp->jc);
+ put_index(fout, &fp->xc);
+ put_index(fout, &fp->rc);
+ put_index(fout, &fp->uc);
+ put_index(fout, &fp->wc);
+ put_index(fout, &fp->ic);
+
+ fs_write(fp->av, 1, fp->ac, fout);
+
+ for (i = 0; i < fp->dc; i++) sol_stor_dict(fout, fp->dv + i);
+ for (i = 0; i < fp->mc; i++) sol_stor_mtrl(fout, fp->mv + i);
+ for (i = 0; i < fp->vc; i++) sol_stor_vert(fout, fp->vv + i);
+ for (i = 0; i < fp->ec; i++) sol_stor_edge(fout, fp->ev + i);
+ for (i = 0; i < fp->sc; i++) sol_stor_side(fout, fp->sv + i);
+ for (i = 0; i < fp->tc; i++) sol_stor_texc(fout, fp->tv + i);
+ for (i = 0; i < fp->gc; i++) sol_stor_geom(fout, fp->gv + i);
+ for (i = 0; i < fp->lc; i++) sol_stor_lump(fout, fp->lv + i);
+ for (i = 0; i < fp->nc; i++) sol_stor_node(fout, fp->nv + i);
+ for (i = 0; i < fp->pc; i++) sol_stor_path(fout, fp->pv + i);
+ for (i = 0; i < fp->bc; i++) sol_stor_body(fout, fp->bv + i);
+ for (i = 0; i < fp->hc; i++) sol_stor_item(fout, fp->hv + i);
+ for (i = 0; i < fp->zc; i++) sol_stor_goal(fout, fp->zv + i);
+ for (i = 0; i < fp->jc; i++) sol_stor_jump(fout, fp->jv + i);
+ for (i = 0; i < fp->xc; i++) sol_stor_swch(fout, fp->xv + i);
+ for (i = 0; i < fp->rc; i++) sol_stor_bill(fout, fp->rv + i);
+ for (i = 0; i < fp->uc; i++) sol_stor_ball(fout, fp->uv + i);
+ for (i = 0; i < fp->wc; i++) sol_stor_view(fout, fp->wv + i);
+ for (i = 0; i < fp->ic; i++) put_index(fout, fp->iv + i);
}
/*---------------------------------------------------------------------------*/
int sol_stor(struct s_file *fp, const char *filename)
{
- FILE *fout;
+ fs_file fout;
- if ((fout = fopen(filename, FMODE_WB)))
+ if ((fout = fs_open(filename, "w")))
{
sol_stor_file(fout, fp);
- fclose(fout);
+ fs_close(fout);
return 1;
}
if (fp->nv) free(fp->nv);
if (fp->pv) free(fp->pv);
if (fp->bv) free(fp->bv);
- if (fp->hc) free(fp->hv);
+ if (fp->hv) free(fp->hv);
if (fp->zv) free(fp->zv);
if (fp->jv) free(fp->jv);
if (fp->xv) free(fp->xv);
}
/*---------------------------------------------------------------------------*/
-/* Solves (p + v * t) . (p + v * t) == r * r for smallest t. */
-
-static float v_sol(const float p[3], const float v[3], float r)
-{
- float a = v_dot(v, v);
- float b = v_dot(v, p) * 2.0f;
- float c = v_dot(p, p) - r * r;
- float d = b * b - 4.0f * a * c;
-
- if (a == 0.0f) return LARGE;
- if (d < 0.0f) return LARGE;
-
- if (d == 0.0f)
- return -b * 0.5f / a;
- else
- {
- float t0 = 0.5f * (-b - fsqrtf(d)) / a;
- float t1 = 0.5f * (-b + fsqrtf(d)) / a;
- float t = (t0 < t1) ? t0 : t1;
-
- return (t < 0.0f) ? LARGE : t;
- }
-}
-
-/*---------------------------------------------------------------------------*/
-
-/*
- * Compute the earliest time and position of the intersection of a
- * sphere and a vertex.
- *
- * The sphere has radius R and moves along vector V from point P. The
- * vertex moves along vector W from point Q in a coordinate system
- * based at O.
- */
-static float v_vert(float Q[3],
- const float o[3],
- const float q[3],
- const float w[3],
- const float p[3],
- const float v[3], float r)
-{
- float O[3], P[3], V[3];
- float t = LARGE;
-
- v_add(O, o, q);
- v_sub(P, p, O);
- v_sub(V, v, w);
-
- if (v_dot(P, V) < 0.0f)
- {
- t = v_sol(P, V, r);
-
- if (t < LARGE)
- v_mad(Q, O, w, t);
- }
- return t;
-}
-
-/*
- * Compute the earliest time and position of the intersection of a
- * sphere and an edge.
- *
- * The sphere has radius R and moves along vector V from point P. The
- * edge moves along vector W from point Q in a coordinate system based
- * at O. The edge extends along the length of vector U.
- */
-static float v_edge(float Q[3],
- const float o[3],
- const float q[3],
- const float u[3],
- const float w[3],
- const float p[3],
- const float v[3], float r)
-{
- float d[3], e[3];
- float P[3], V[3];
- float du, eu, uu, s, t;
-
- v_sub(d, p, o);
- v_sub(d, d, q);
- v_sub(e, v, w);
-
- du = v_dot(d, u);
- eu = v_dot(e, u);
- uu = v_dot(u, u);
-
- v_mad(P, d, u, -du / uu);
- v_mad(V, e, u, -eu / uu);
-
- t = v_sol(P, V, r);
- s = (du + eu * t) / uu;
-
- if (0.0f < t && t < LARGE && 0.0f < s && s < 1.0f)
- {
- v_mad(d, o, w, t);
- v_mad(e, q, u, s);
- v_add(Q, e, d);
- }
- else
- t = LARGE;
-
- return t;
-}
-
-/*
- * Compute the earliest time and position of the intersection of a
- * sphere and a plane.
- *
- * The sphere has radius R and moves along vector V from point P. The
- * plane moves along vector W. The plane has normal N and is
- * positioned at distance D from the origin O along that normal.
- */
-static float v_side(float Q[3],
- const float o[3],
- const float w[3],
- const float n[3], float d,
- const float p[3],
- const float v[3], float r)
-{
- float vn = v_dot(v, n);
- float wn = v_dot(w, n);
- float t = LARGE;
-
- if (vn - wn <= 0.0f)
- {
- float on = v_dot(o, n);
- float pn = v_dot(p, n);
-
- float u = (r + d + on - pn) / (vn - wn);
- float a = ( d + on - pn) / (vn - wn);
-
- if (0.0f <= u)
- {
- t = u;
-
- v_mad(Q, p, v, +t);
- v_mad(Q, Q, n, -r);
- }
- else if (0.0f <= a)
- {
- t = 0;
-
- v_mad(Q, p, v, +t);
- v_mad(Q, Q, n, -r);
- }
- }
- return t;
-}
-
-/*---------------------------------------------------------------------------*/
-
-/*
- * Compute the new linear and angular velocities of a bouncing ball.
- * Q gives the position of the point of impact and W gives the
- * velocity of the object being impacted.
- */
-static float sol_bounce(struct s_ball *up,
- const float q[3],
- const float w[3], float dt)
-{
- float n[3], r[3], d[3], vn, wn;
- float *p = up->p;
- float *v = up->v;
-
- /* Find the normal of the impact. */
-
- v_sub(r, p, q);
- v_sub(d, v, w);
- v_nrm(n, r);
-
- /* Find the new angular velocity. */
-
- v_crs(up->w, d, r);
- v_scl(up->w, up->w, -1.0f / (up->r * up->r));
-
- /* Find the new linear velocity. */
-
- vn = v_dot(v, n);
- wn = v_dot(w, n);
-
- v_mad(v, v, n, 1.7 * (wn - vn));
-
- v_mad(p, q, n, up->r);
-
- /* Return the "energy" of the impact, to determine the sound amplitude. */
-
- return fabsf(v_dot(n, d));
-}
-
-/*---------------------------------------------------------------------------*/
-
-/*
- * Compute the states of all switches after DT seconds have passed.
- */
-static void sol_swch_step(struct s_file *fp, float dt)
-{
- int xi;
-
- for (xi = 0; xi < fp->xc; xi++)
- {
- struct s_swch *xp = fp->xv + xi;
-
- if (xp->t > 0)
- {
- xp->t -= dt;
-
- if (xp->t <= 0)
- {
- int pi = xp->pi;
- int pj = xp->pi;
-
- do /* Tortoise and hare cycle traverser. */
- {
- fp->pv[pi].f = xp->f0;
- fp->pv[pj].f = xp->f0;
-
- pi = fp->pv[pi].pi;
- pj = fp->pv[pj].pi;
- pj = fp->pv[pj].pi;
- }
- while (pi != pj);
-
- xp->f = xp->f0;
- }
- }
- }
-}
-
-/*
- * Compute the positions of all bodies after DT seconds have passed.
- */
-static void sol_body_step(struct s_file *fp, float dt)
-{
- int i;
-
- for (i = 0; i < fp->bc; i++)
- {
- struct s_body *bp = fp->bv + i;
- struct s_path *pp = fp->pv + bp->pi;
-
- if (bp->pi >= 0 && pp->f)
- {
- bp->t += dt;
-
- if (bp->t >= pp->t)
- {
-/* TODO: Confirm that this fixes the repeated path inaccuracy. */
-/* bp->t -= pp->t; */
- bp->t = 0;
- bp->pi = pp->pi;
- }
- }
- }
-}
-
-/*
- * Compute the positions of all balls after DT seconds have passed.
- */
-static void sol_ball_step(struct s_file *fp, float dt)
-{
- int i;
-
- for (i = 0; i < fp->uc; i++)
- {
- struct s_ball *up = fp->uv + i;
-
- v_mad(up->p, up->p, up->v, dt);
-
- if (v_len(up->w) > 0.0f)
- {
- float M[16];
- float w[3];
- float e[3][3];
-
- v_nrm(w, up->w);
- m_rot(M, w, v_len(up->w) * dt);
-
- m_vxfm(e[0], M, up->e[0]);
- m_vxfm(e[1], M, up->e[1]);
- m_vxfm(e[2], M, up->e[2]);
-
- v_crs(up->e[2], e[0], e[1]);
- v_crs(up->e[1], e[2], e[0]);
- v_crs(up->e[0], e[1], e[2]);
-
- v_nrm(up->e[0], up->e[0]);
- v_nrm(up->e[1], up->e[1]);
- v_nrm(up->e[2], up->e[2]);
- }
- }
-}
-
-/*---------------------------------------------------------------------------*/
-
-static float sol_test_vert(float dt,
- float T[3],
- const struct s_ball *up,
- const struct s_vert *vp,
- const float o[3],
- const float w[3])
-{
- return v_vert(T, o, vp->p, w, up->p, up->v, up->r);
-}
-
-static float sol_test_edge(float dt,
- float T[3],
- const struct s_ball *up,
- const struct s_file *fp,
- const struct s_edge *ep,
- const float o[3],
- const float w[3])
-{
- float q[3];
- float u[3];
-
- v_cpy(q, fp->vv[ep->vi].p);
- v_sub(u, fp->vv[ep->vj].p,
- fp->vv[ep->vi].p);
-
- return v_edge(T, o, q, u, w, up->p, up->v, up->r);
-}
-
-static float sol_test_side(float dt,
- float T[3],
- const struct s_ball *up,
- const struct s_file *fp,
- const struct s_lump *lp,
- const struct s_side *sp,
- const float o[3],
- const float w[3])
-{
- float t = v_side(T, o, w, sp->n, sp->d, up->p, up->v, up->r);
- int i;
-
- if (t < dt)
- for (i = 0; i < lp->sc; i++)
- {
- const struct s_side *sq = fp->sv + fp->iv[lp->s0 + i];
-
- if (sp != sq &&
- v_dot(T, sq->n) -
- v_dot(o, sq->n) -
- v_dot(w, sq->n) * t > sq->d)
- return LARGE;
- }
- return t;
-}
-
-/*---------------------------------------------------------------------------*/
-
-static float sol_test_fore(float dt,
- const struct s_ball *up,
- const struct s_side *sp,
- const float o[3],
- const float w[3])
-{
- float q[3];
-
- /* If the ball is not behind the plane, the test passes. */
-
- v_sub(q, up->p, o);
-
- if (v_dot(q, sp->n) - sp->d + up->r >= 0)
- return 1;
-
- /* if the ball is behind the plane but will hit before dt, test passes. */
- /*
- if (v_side(q, o, w, sp->n, sp->d, up->p, up->v, up->r) < dt)
- return 1;
- */
- /* If the ball is behind but moving toward the plane, test passes. */
-
- if (v_dot(up->v, sp->n) > 0)
- return 1;
-
-
- /* Else, test fails. */
-
- return 0;
-}
-
-static float sol_test_back(float dt,
- const struct s_ball *up,
- const struct s_side *sp,
- const float o[3],
- const float w[3])
-{
- float q[3];
-
- /* If the ball is not in front of the plane, the test passes. */
-
- v_sub(q, up->p, o);
-
- if (v_dot(q, sp->n) - sp->d - up->r <= 0)
- return 1;
-
- /* if the ball is behind the plane but will hit before dt, test passes. */
- /*
- if (v_side(q, o, w, sp->n, sp->d, up->p, up->v, up->r) < dt)
- return 1;
- */
- /* If the ball is in front but moving toward the plane, test passes. */
-
- if (v_dot(up->v, sp->n) < 0)
- return 1;
-
-
- /* Else, test fails. */
-
- return 0;
-}
-
-/*---------------------------------------------------------------------------*/
-
-static float sol_test_lump(float dt,
- float T[3],
- const struct s_ball *up,
- const struct s_file *fp,
- const struct s_lump *lp,
- const float o[3],
- const float w[3])
-{
- float U[3] = {0.0f, 0.0f, 0.0f}; /* init value only to avoid gcc warnings */
- float u, t = dt;
- int i;
-
- /* Short circuit a non-solid lump. */
-
- if (lp->fl & L_DETAIL) return t;
-
- /* Test all verts */
-
- if (up->r > 0.0f)
- for (i = 0; i < lp->vc; i++)
- {
- const struct s_vert *vp = fp->vv + fp->iv[lp->v0 + i];
-
- if ((u = sol_test_vert(t, U, up, vp, o, w)) < t)
- {
- v_cpy(T, U);
- t = u;
- }
- }
-
- /* Test all edges */
-
- if (up->r > 0.0f)
- for (i = 0; i < lp->ec; i++)
- {
- const struct s_edge *ep = fp->ev + fp->iv[lp->e0 + i];
-
- if ((u = sol_test_edge(t, U, up, fp, ep, o, w)) < t)
- {
- v_cpy(T, U);
- t = u;
- }
- }
-
- /* Test all sides */
-
- for (i = 0; i < lp->sc; i++)
- {
- const struct s_side *sp = fp->sv + fp->iv[lp->s0 + i];
-
- if ((u = sol_test_side(t, U, up, fp, lp, sp, o, w)) < t)
- {
- v_cpy(T, U);
- t = u;
- }
- }
- return t;
-}
-
-static float sol_test_node(float dt,
- float T[3],
- const struct s_ball *up,
- const struct s_file *fp,
- const struct s_node *np,
- const float o[3],
- const float w[3])
-{
- float U[3], u, t = dt;
- int i;
-
- /* Test all lumps */
-
- for (i = 0; i < np->lc; i++)
- {
- const struct s_lump *lp = fp->lv + np->l0 + i;
-
- if ((u = sol_test_lump(t, U, up, fp, lp, o, w)) < t)
- {
- v_cpy(T, U);
- t = u;
- }
- }
-
- /* Test in front of this node */
-
- if (np->ni >= 0 && sol_test_fore(t, up, fp->sv + np->si, o, w))
- {
- const struct s_node *nq = fp->nv + np->ni;
-
- if ((u = sol_test_node(t, U, up, fp, nq, o, w)) < t)
- {
- v_cpy(T, U);
- t = u;
- }
- }
-
- /* Test behind this node */
-
- if (np->nj >= 0 && sol_test_back(t, up, fp->sv + np->si, o, w))
- {
- const struct s_node *nq = fp->nv + np->nj;
-
- if ((u = sol_test_node(t, U, up, fp, nq, o, w)) < t)
- {
- v_cpy(T, U);
- t = u;
- }
- }
-
- return t;
-}
-
-static float sol_test_body(float dt,
- float T[3], float V[3],
- const struct s_ball *up,
- const struct s_file *fp,
- const struct s_body *bp)
-{
- float U[3], O[3], W[3], u, t = dt;
-
- const struct s_node *np = fp->nv + bp->ni;
-
- sol_body_p(O, fp, bp);
- sol_body_v(W, fp, bp);
-
- if ((u = sol_test_node(t, U, up, fp, np, O, W)) < t)
- {
- v_cpy(T, U);
- v_cpy(V, W);
- t = u;
- }
- return t;
-}
-
-static float sol_test_file(float dt,
- float T[3], float V[3],
- const struct s_ball *up,
- const struct s_file *fp)
-{
- float U[3], W[3], u, t = dt;
- int i;
-
- for (i = 0; i < fp->bc; i++)
- {
- const struct s_body *bp = fp->bv + i;
-
- if ((u = sol_test_body(t, U, W, up, fp, bp)) < t)
- {
- v_cpy(T, U);
- v_cpy(V, W);
- t = u;
- }
- }
- return t;
-}
-
-/*---------------------------------------------------------------------------*/
-
-/*
- * Step the physics forward DT seconds under the influence of gravity
- * vector G. If the ball gets pinched between two moving solids, this
- * loop might not terminate. It is better to do something physically
- * impossible than to lock up the game. So, if we make more than C
- * iterations, punt it.
- */
-
-float sol_step(struct s_file *fp, const float *g, float dt, int ui, int *m)
-{
- float P[3], V[3], v[3], r[3], d, e, nt, b = 0.0f, tt = dt;
- int c = 16;
-
- if (ui < fp->uc)
- {
- struct s_ball *up = fp->uv + ui;
-
- /* If the ball is in contact with a surface, apply friction. */
-
- v_cpy(v, up->v);
- v_cpy(up->v, g);
-
- if (m && sol_test_file(tt, P, V, up, fp) < 0.0005f)
- {
- v_cpy(up->v, v);
- v_sub(r, P, up->p);
-
- if ((d = v_dot(r, g) / (v_len(r) * v_len(g))) > 0.999f)
- {
- if ((e = (v_len(up->v) - dt)) > 0.0f)
- {
- /* Scale the linear velocity. */
-
- v_nrm(up->v, up->v);
- v_scl(up->v, up->v, e);
-
- /* Scale the angular velocity. */
-
- v_sub(v, V, up->v);
- v_crs(up->w, v, r);
- v_scl(up->w, up->w, -1.0f / (up->r * up->r));
- }
- else
- {
- /* Friction has brought the ball to a stop. */
-
- up->v[0] = 0.0f;
- up->v[1] = 0.0f;
- up->v[2] = 0.0f;
-
- (*m)++;
- }
- }
- else v_mad(up->v, v, g, tt);
- }
- else v_mad(up->v, v, g, tt);
-
- /* Test for collision. */
-
- while (c > 0 && tt > 0 && tt > (nt = sol_test_file(tt, P, V, up, fp)))
- {
- sol_body_step(fp, nt);
- sol_swch_step(fp, nt);
- sol_ball_step(fp, nt);
-
- tt -= nt;
-
- if (b < (d = sol_bounce(up, P, V, nt)))
- b = d;
-
- c--;
- }
-
- sol_body_step(fp, tt);
- sol_swch_step(fp, tt);
- sol_ball_step(fp, tt);
- }
- return b;
-}
-
-/*---------------------------------------------------------------------------*/
-
-struct s_item *sol_item_test(struct s_file *fp, float *p, float item_r)
-{
- const float *ball_p = fp->uv->p;
- const float ball_r = fp->uv->r;
-
- int hi;
-
- for (hi = 0; hi < fp->hc; hi++)
- {
- float r[3];
-
- r[0] = ball_p[0] - fp->hv[hi].p[0];
- r[1] = ball_p[1] - fp->hv[hi].p[1];
- r[2] = ball_p[2] - fp->hv[hi].p[2];
-
- if (fp->hv[hi].t != ITEM_NONE && v_len(r) < ball_r + item_r)
- {
- p[0] = fp->hv[hi].p[0];
- p[1] = fp->hv[hi].p[1];
- p[2] = fp->hv[hi].p[2];
-
- return &fp->hv[hi];
- }
- }
- return NULL;
-}
-
-struct s_goal *sol_goal_test(struct s_file *fp, float *p, int ui)
-{
- const float *ball_p = fp->uv[ui].p;
- const float ball_r = fp->uv[ui].r;
- int zi;
-
- for (zi = 0; zi < fp->zc; zi++)
- {
- float r[3];
-
- r[0] = ball_p[0] - fp->zv[zi].p[0];
- r[1] = ball_p[2] - fp->zv[zi].p[2];
- r[2] = 0;
-
- if (v_len(r) < fp->zv[zi].r * 1.1 - ball_r &&
- ball_p[1] > fp->zv[zi].p[1] &&
- ball_p[1] < fp->zv[zi].p[1] + GOAL_HEIGHT / 2)
- {
- p[0] = fp->zv[zi].p[0];
- p[1] = fp->zv[zi].p[1];
- p[2] = fp->zv[zi].p[2];
-
- return &fp->zv[zi];
- }
- }
- return NULL;
-}
-
-/*
- * Test if the ball UI is inside a jump. Return 1 if yes and fill P
- * with the destination position, return 0 if not, and return 2 if the
- * ball is on the border of a jump.
- */
-int sol_jump_test(struct s_file *fp, float *p, int ui)
-{
- const float *ball_p = fp->uv[ui].p;
- const float ball_r = fp->uv[ui].r;
- int ji;
- float l;
- int res = 0;
-
- for (ji = 0; ji < fp->jc; ji++)
- {
- float r[3];
-
- r[0] = ball_p[0] - fp->jv[ji].p[0];
- r[1] = ball_p[2] - fp->jv[ji].p[2];
- r[2] = 0;
-
- l = v_len(r) - fp->jv[ji].r;
- if (l < 0 &&
- ball_p[1] > fp->jv[ji].p[1] &&
- ball_p[1] < fp->jv[ji].p[1] + JUMP_HEIGHT / 2)
- {
- if (l < - ball_r )
- {
- p[0] = fp->jv[ji].q[0] + (ball_p[0] - fp->jv[ji].p[0]);
- p[1] = fp->jv[ji].q[1] + (ball_p[1] - fp->jv[ji].p[1]);
- p[2] = fp->jv[ji].q[2] + (ball_p[2] - fp->jv[ji].p[2]);
-
- return 1;
- }
- else
- res = 2;
- }
- }
- return res;
-}
-
-/*
- * Test and process the event the ball UI enters a switch. Return 1 if
- * a visible switch is activated, return 0 otherwise (no switch is
- * activated or only invisible switches).
- */
-int sol_swch_test(struct s_file *fp, int ui)
-{
- const float *ball_p = fp->uv[ui].p;
- const float ball_r = fp->uv[ui].r;
- int xi;
- int res = 0;
-
- for (xi = 0; xi < fp->xc; xi++)
- {
- struct s_swch *xp = fp->xv + xi;
-
- if (xp->t0 == 0 || xp->f == xp->f0)
- {
- float l;
- float r[3];
-
- r[0] = ball_p[0] - xp->p[0];
- r[1] = ball_p[2] - xp->p[2];
- r[2] = 0;
-
- l = v_len(r) - xp->r;
-
- if (l < ball_r &&
- ball_p[1] > xp->p[1] &&
- ball_p[1] < xp->p[1] + SWCH_HEIGHT / 2)
- {
- if (!xp->e && l < - ball_r)
- {
- int pi = xp->pi;
- int pj = xp->pi;
-
- /* The ball enters. */
-
- if (xp->t0 == 0)
- xp->e = 1;
-
- /* Toggle the state, update the path. */
-
- xp->f = xp->f ? 0 : 1;
-
- do /* Tortoise and hare cycle traverser. */
- {
- fp->pv[pi].f = xp->f;
- fp->pv[pj].f = xp->f;
-
- pi = fp->pv[pi].pi;
- pj = fp->pv[pj].pi;
- pj = fp->pv[pj].pi;
- }
- while (pi != pj);
-
- /* It toggled to non-default state, start the timer. */
-
- if (xp->f != xp->f0)
- xp->t = xp->t0;
-
- /* If visible, set the result. */
-
- if (!xp->i)
- res = 1;
- }
- }
-
- /* The ball exits. */
-
- else if (xp->e)
- xp->e = 0;
- }
- }
- return res;
-}
-
-/*---------------------------------------------------------------------------*/
-
-void put_file_state(FILE *fout, struct s_file *fp)
-{
- /* Write the position and orientation of the ball. */
-
- put_array(fout, fp->uv[0].p, 3);
- put_array(fout, fp->uv[0].e[0], 3);
- put_array(fout, fp->uv[0].e[1], 3);
-}
-
-void get_file_state(FILE *fin, struct s_file *fp)
-{
- /* Read the position and orientation of the ball. */
-
- get_array(fin, fp->uv[0].p, 3);
- get_array(fin, fp->uv[0].e[0], 3);
- get_array(fin, fp->uv[0].e[1], 3);
-
- /* Compute the 3rd vector of the ball orientation basis. */
-
- v_crs(fp->uv[0].e[2], fp->uv[0].e[0], fp->uv[0].e[1]);
-}
-
-/*---------------------------------------------------------------------------*/
-