12 struct vertex_pos_color {
21 static char *clean_line(char *s);
22 static char *parse_face_vert(char *ptr, struct facevertex *fv, int numv, int numt, int numn);
23 static int cmp_facevert(const void *ap, const void *bp);
24 static void free_rbnode_key(struct rbnode *n, void *cls);
26 /* merge of different indices per attribute happens during face processing.
28 * A triplet of (vertex index/texcoord index/normal index) is used as the key
29 * to search in a balanced binary search tree for vertex buffer index assigned
30 * to the same triplet if it has been encountered before. That index is
31 * appended to the index buffer.
33 * If a particular triplet has not been encountered before, a new g3d_vertex is
34 * appended to the vertex buffer. The index of this new vertex is appended to
35 * the index buffer, and also inserted into the tree for future searches.
37 int load_mesh(struct g3d_mesh *mesh, const char *fname)
39 int i, line_num = 0, result = -1;
43 struct vertex_pos_color *varr = 0;
46 struct rbtree *rbtree = 0;
48 if(!(fp = fopen(fname, "rb"))) {
49 fprintf(stderr, "load_mesh: failed to open file: %s\n", fname);
53 if(!(rbtree = rb_create(cmp_facevert))) {
54 fprintf(stderr, "load_mesh: failed to create facevertex binary search tree\n");
57 rb_set_delete_func(rbtree, free_rbnode_key, 0);
59 if(!(mesh->varr = dynarr_alloc(0, sizeof *mesh->varr)) ||
60 !(mesh->iarr = dynarr_alloc(0, sizeof *mesh->iarr))) {
61 fprintf(stderr, "load_mesh: failed to allocate resizable mesh arrays\n");
64 if(!(varr = dynarr_alloc(0, sizeof *varr)) ||
65 !(narr = dynarr_alloc(0, sizeof *narr)) ||
66 !(tarr = dynarr_alloc(0, sizeof *tarr))) {
67 fprintf(stderr, "load_mesh: failed to allocate resizable vertex array\n");
71 while(fgets(buf, sizeof buf, fp)) {
72 char *line = clean_line(buf);
79 if(isspace(line[1])) {
81 struct vertex_pos_color v;
84 num = sscanf(line + 2, "%f %f %f %f %f %f %f", &v.x, &v.y, &v.z, &v.x, &v.y, &v.z, &v.a);
86 fprintf(stderr, "%s:%d: invalid vertex definition: \"%s\"\n", fname, line_num, line);
99 if(!(varr = dynarr_push(varr, &v))) {
100 fprintf(stderr, "load_mesh: failed to resize vertex buffer\n");
104 } else if(line[1] == 't' && isspace(line[2])) {
107 if(sscanf(line + 3, "%f %f", &tc.x, &tc.y) != 2) {
108 fprintf(stderr, "%s:%d: invalid texcoord definition: \"%s\"\n", fname, line_num, line);
111 if(!(tarr = dynarr_push(tarr, &tc))) {
112 fprintf(stderr, "load_mesh: failed to resize texcoord buffer\n");
116 } else if(line[1] == 'n' && isspace(line[2])) {
119 if(sscanf(line + 3, "%f %f %f", &norm.x, &norm.y, &norm.z) != 3) {
120 fprintf(stderr, "%s:%d: invalid normal definition: \"%s\"\n", fname, line_num, line);
123 if(!(narr = dynarr_push(narr, &norm))) {
124 fprintf(stderr, "load_mesh: failed to resize normal buffer\n");
131 if(isspace(line[1])) {
133 char *ptr = line + 2;
134 struct facevertex fv;
136 int vsz = dynarr_size(varr);
137 int tsz = dynarr_size(tarr);
138 int nsz = dynarr_size(narr);
141 if(!(ptr = parse_face_vert(ptr, &fv, vsz, tsz, nsz))) {
142 if(i < 3 || found_quad) {
143 fprintf(stderr, "%s:%d: invalid face definition: \"%s\"\n", fname, line_num, line);
150 if((node = rb_find(rbtree, &fv))) {
151 uint16_t idx = (int)(intptr_t)node->data;
152 if(!(mesh->iarr = dynarr_push(mesh->iarr, &idx))) {
153 fprintf(stderr, "load_mesh: failed to resize index array\n");
157 uint16_t newidx = dynarr_size(mesh->varr);
159 struct facevertex *newfv;
161 v.x = varr[fv.vidx].x;
162 v.y = varr[fv.vidx].y;
163 v.z = varr[fv.vidx].z;
165 v.r = cround64(varr[fv.vidx].r * 255.0);
166 v.g = cround64(varr[fv.vidx].g * 255.0);
167 v.b = cround64(varr[fv.vidx].b * 255.0);
168 v.a = cround64(varr[fv.vidx].a * 255.0);
170 v.u = tarr[fv.tidx].x;
171 v.v = tarr[fv.tidx].y;
177 v.nx = narr[fv.nidx].x;
178 v.ny = narr[fv.nidx].y;
179 v.nz = narr[fv.nidx].z;
185 if(!(mesh->varr = dynarr_push(mesh->varr, &v))) {
186 fprintf(stderr, "load_mesh: failed to resize combined vertex array\n");
189 if(!(mesh->iarr = dynarr_push(mesh->iarr, &newidx))) {
190 fprintf(stderr, "load_mesh: failed to resize index array\n");
194 if((newfv = malloc(sizeof *newfv))) {
197 if(!newfv || rb_insert(rbtree, newfv, (void*)(intptr_t)newidx) == -1) {
198 fprintf(stderr, "load_mesh: failed to insert facevertex to the binary search tree\n");
203 if(i > 3) found_quad = 1;
212 mesh->prim = found_quad ? G3D_QUADS : G3D_TRIANGLES;
213 mesh->vcount = dynarr_size(mesh->varr);
214 mesh->icount = dynarr_size(mesh->iarr);
215 mesh->varr = dynarr_finalize(mesh->varr);
216 mesh->iarr = dynarr_finalize(mesh->iarr);
217 result = 0; /* success */
219 printf("loaded %s mesh: %s: %d vertices, %d faces\n", found_quad ? "quad" : "triangle",
220 fname, mesh->vcount, mesh->icount / mesh->prim);
228 dynarr_free(mesh->varr);
229 dynarr_free(mesh->iarr);
235 int save_mesh(struct g3d_mesh *mesh, const char *fname)
240 if(!(fp = fopen(fname, "wb"))) {
241 fprintf(stderr, "save_mesh: failed to open %s for writing\n", fname);
244 fprintf(fp, "# Wavefront OBJ file shoved in your FACE by Mindlapse. Deal with it\n");
246 for(i=0; i<mesh->vcount; i++) {
247 struct g3d_vertex *v = mesh->varr + i;
248 fprintf(fp, "v %f %f %f %f %f %f %f\n", v->x, v->y, v->z, v->r / 255.0f, v->g / 255.0f,
249 v->b / 255.0f, v->a / 255.0f);
251 for(i=0; i<mesh->vcount; i++) {
252 fprintf(fp, "vn %f %f %f\n", mesh->varr[i].nx, mesh->varr[i].ny, mesh->varr[i].nz);
254 for(i=0; i<mesh->vcount; i++) {
255 fprintf(fp, "vt %f %f\n", mesh->varr[i].u, mesh->varr[i].v);
258 fvcount = mesh->prim;
259 for(i=0; i<mesh->icount; i++) {
260 int idx = mesh->iarr[i] + 1;
262 if(fvcount == mesh->prim) {
266 fprintf(fp, " %d/%d/%d", idx, idx, idx);
275 static char *clean_line(char *s)
279 while(*s && isspace(*s)) ++s;
283 while(*end && *end != '#') ++end;
286 while(end > s && isspace(*end)) --end;
292 static char *parse_idx(char *ptr, int *idx, int arrsz)
295 int val = strtol(ptr, &endp, 10);
296 if(endp == ptr) return 0;
298 if(val < 0) { /* convert negative indices */
301 *idx = val - 1; /* indices in obj are 1-based */
306 /* possible face-vertex definitions:
310 * 4. vertex/texcoord/normal
312 static char *parse_face_vert(char *ptr, struct facevertex *fv, int numv, int numt, int numn)
314 if(!(ptr = parse_idx(ptr, &fv->vidx, numv)))
316 if(*ptr != '/') return (!*ptr || isspace(*ptr)) ? ptr : 0;
318 if(*++ptr == '/') { /* no texcoord */
322 if(!(ptr = parse_idx(ptr, &fv->tidx, numt)))
324 if(*ptr != '/') return (!*ptr || isspace(*ptr)) ? ptr : 0;
328 if(!(ptr = parse_idx(ptr, &fv->nidx, numn)))
330 return (!*ptr || isspace(*ptr)) ? ptr : 0;
333 static int cmp_facevert(const void *ap, const void *bp)
335 const struct facevertex *a = ap;
336 const struct facevertex *b = bp;
338 if(a->vidx == b->vidx) {
339 if(a->tidx == b->tidx) {
340 return a->nidx - b->nidx;
342 return a->tidx - b->tidx;
344 return a->vidx - b->vidx;
347 static void free_rbnode_key(struct rbnode *n, void *cls)