[Brlcad-commits] CVS: brlcad/src/conv g-adrt.c,NONE,14.1 Makefile.am,14.3,14.4
Open Source Solid Modeling CAD
Brought to you by:
brlcad
Menu
▾
▴
[Brlcad-commits] CVS: brlcad/src/conv g-adrt.c,NONE,14.1 Makefile.am,14.3,14.4
|
From: Justin S. <tw...@us...> - 2005-07-01 21:09:09
|
Update of /cvsroot/brlcad/brlcad/src/conv In directory sc8-pr-cvs1.sourceforge.net:/tmp/cvs-serv24980 Modified Files: Makefile.am Added Files: g-adrt.c Log Message: The g-adrt converter, only does BOTS. --- NEW FILE: g-adrt.c --- /* G - A D R T . C * * @file g-adrt.c * * BRL-CAD * * Copyright (C) 2002-2005 United States Government as represented by * the U.S. Army Research Laboratory. * * This library is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 2 of * the License, or (at your option) any later version. * * This library is distributed in the hope that it will be useful, but * WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * Library General Public License for more details. * * You should have received a copy of the GNU Lesser General Public * License along with this file; see the file named COPYING for more * information. * * BRLCAD -> ADRT converter * * Author - * Justin L. Shumaker * * Source - * The U. S. Army Research Laboratory * Aberdeen Proving Ground, Maryland 21005-5068 USA * * $Id: g-adrt.c,v 14.1 2005/07/01 21:09:00 twingy Exp $ */ #include <math.h> #include <stdio.h> #include <string.h> #include "brlcad_config.h" /* machine specific definitions */ #include "machine.h" /* machine specific definitions */ #include "vmath.h" /* vector math macros */ #include "raytrace.h" /* librt interface definitions */ #include "rtgeom.h" #ifndef HUGE #define HUGE 3.40282347e+38F #endif #define ADRT_GEOMETRY_REVISION 0 typedef struct property_s { char name[256]; float color[3]; } property_t; static struct rt_i *rtip; /* rt_dirbuild returns this */ FILE *adrt_fh; int region_count = 0; int prop_num; property_t *prop_list; struct bu_vls* region_name_from_path(struct db_full_path *pathp); /* * r e g i o n _ n a m e _ f r o m _ p a t h * * Walk backwards up the tree to the first region, then * make a vls string of everything at or above that level. * Basically, it produces the name of the region to which * the leaf of the path contributes. */ struct bu_vls* region_name_from_path(struct db_full_path *pathp) { int i, j; struct bu_vls *vls; /* walk up the path from the bottom looking for the region */ for (i=pathp->fp_len-1 ; i >= 0 ; i--) { if (pathp->fp_names[i]->d_flags & DIR_REGION) { goto found_region; } } #if DEBUG bu_log("didn't find region on path %s\n", db_path_to_string( pathp )); #endif /* abort(); */ found_region: vls = bu_malloc(sizeof(struct bu_vls), "region name"); bu_vls_init( vls ); for(j = 0; j <= i; j++) { bu_vls_strcat(vls, "/"); bu_vls_strcat(vls, pathp->fp_names[j]->d_namep); } return vls; } /* * r e g _ s t a r t _ f u n c * Called by the tree walker when it first encounters a region */ static int reg_start_func(struct db_tree_state *tsp, struct db_full_path *pathp, const struct rt_comb_internal *combp, genptr_t client_data) { char found; int i; /* color is here * combp->rgb[3]; * * phong properties are probably here: * bu_vls_addr(combp->shader) */ if(combp->rgb[0] || combp->rgb[1] || combp->rgb[2]) { found = 0; for(i = 0; i < prop_num; i++) { if(!strcmp(prop_list[i].name, pathp->fp_names[pathp->fp_len-1]->d_namep)) { found = 1; continue; } } if(!found) { prop_list = (property_t *)realloc(prop_list, sizeof(property_t) * (prop_num + 1)); strcpy(prop_list[prop_num].name, pathp->fp_names[pathp->fp_len-1]->d_namep); prop_list[prop_num].color[0] = combp->rgb[0] / 255.0; prop_list[prop_num].color[1] = combp->rgb[1] / 255.0; prop_list[prop_num].color[2] = combp->rgb[2] / 255.0; prop_num++; } /* printf("reg_start: -%s- [%d,%d,%d]\n", pathp->fp_names[pathp->fp_len-1]->d_namep, combp->rgb[0], combp->rgb[1], combp->rgb[2]); */ } /* to find the name of the region... it is probably * pathp->fp_names[pathp->fp_len-1] */ return(0); } /* * r e g _ e n d _ f u n c * * Called by the tree walker when it has finished walking the tree for the region * ie. all primitives have been processed */ static union tree* reg_end_func(struct db_tree_state *tsp, struct db_full_path *pathp, union tree *curtree, genptr_t client_data) { return(NULL); } /* * l e a f _ f u n c * * process a leaf of the region tree. called by db_walk_tree() * * Makes sure that this is a BoT primitive, creates the ADRT triangles * and some wrapper data structures so that we can ray-trace the BoT in * ADRT */ static union tree *leaf_func(struct db_tree_state *tsp, struct db_full_path *pathp, struct rt_db_internal *ip, genptr_t client_data) { register struct soltab *stp; union tree *curtree; struct directory *dp; register matp_t mat; int hash, i, n, size; struct rt_i *rtip; struct rt_bot_internal *bot; vectp_t vp; vect_t vv, v0, v1, v2; struct region_pointer *td = (struct region_pointer *)client_data; struct bu_vls *vlsp; char c, prop_name[256], reg_name[256]; RT_CK_DBTS(tsp); RT_CK_DBI(tsp->ts_dbip); RT_CK_FULL_PATH(pathp); RT_CK_DB_INTERNAL(ip); rtip = tsp->ts_rtip; RT_CK_RTI(rtip); RT_CK_RESOURCE(tsp->ts_resp); dp = DB_FULL_PATH_CUR_DIR(pathp); if (ip->idb_minor_type != ID_BOT) { #if DEBUG fprintf(stderr, "\"%s\" should be a BOT ", pathp->fp_names[pathp->fp_len-1]->d_namep); #endif for (i=pathp->fp_len-1; i >= 0 ; i--) { if (pathp->fp_names[i]->d_flags & DIR_REGION) { #if DEBUG fprintf(stderr, "fix region %s\n", pathp->fp_names[i]->d_namep); #endif goto found; } else if (pathp->fp_names[i]->d_flags & DIR_COMB) { #if DEBUG fprintf(stderr, "not a combination\n"); #endif } else if (pathp->fp_names[i]->d_flags & DIR_SOLID) { #if DEBUG fprintf(stderr, "not a primitive\n"); #endif } } #if DEBUG fprintf(stderr, "didn't find region?\n"); #endif found: return( TREE_NULL ); /* BAD */ } bot = (struct rt_bot_internal *)ip->idb_ptr; RT_BOT_CK_MAGIC(bot); rtip->nsolids++; /* Find the Properties Name */ prop_name[0] = 0; vlsp = region_name_from_path(pathp); strcpy(reg_name, bu_vls_strgrab(vlsp)); printf("regions processed: %d\r", region_count++); fflush(stdout); /* Grab the chars from the end till the '/' */ i = strlen(reg_name)-1; while(reg_name[i] != '/' && i > 0) i--; if(i != strlen(reg_name)) strcpy(prop_name, ®_name[i+1]); /* printf("prop name: -%s-\n", prop_name); */ bu_free(vlsp, "vls"); /* this is for librt's benefit */ BU_GETSTRUCT(stp, soltab); VSETALL(stp->st_min, HUGE); VSETALL(stp->st_max, -HUGE); for(vp = &bot->vertices[bot->num_vertices-1]; vp >= bot->vertices; vp -= 3) { VMINMAX(stp->st_min, stp->st_max, vp); } VMINMAX(rtip->mdl_min, rtip->mdl_max, stp->st_min); VMINMAX(rtip->mdl_min, rtip->mdl_max, stp->st_max); /* Pack bot/mesh name */ #if 0 c = strlen(pathp->fp_names[pathp->fp_len-1]->d_namep) + 1; common_pack_write(common_g_app_data, common_g_app_ind, &c, sizeof(char)); common_pack_write(common_g_app_data, common_g_app_ind, pathp->fp_names[pathp->fp_len-1]->d_namep, c); #else c = strlen(reg_name) + 1; fwrite(&c, 1, 1, adrt_fh); fwrite(reg_name, 1, c, adrt_fh); #endif /* Set the properties name */ c = strlen(prop_name) + 1; fwrite(&c, 1, 1, adrt_fh); fwrite(prop_name, 1, c, adrt_fh); /* Pack number of vertices */ fwrite(&bot->num_vertices, sizeof(int), 1, adrt_fh); for(i = 0; i < bot->num_vertices; i++) { /* Change scale from mm to meters */ bot->vertices[3*i+0] *= 0.001; bot->vertices[3*i+1] *= 0.001; bot->vertices[3*i+2] *= 0.001; fwrite(&bot->vertices[3*i], sizeof(float), 3, adrt_fh); } /* Pack number of faces */ fwrite(&bot->num_faces, sizeof(int), 1, adrt_fh); fwrite(bot->faces, sizeof(int)*3, bot->num_faces, adrt_fh); hash = db_dirhash( dp->d_namep ); /* this piece is for db_walk_tree's benefit */ RT_GET_TREE( curtree, tsp->ts_resp ); curtree->magic = RT_TREE_MAGIC; curtree->tr_op = OP_SOLID; /* regionp will be filled in later by rt_tree_region_assign() */ curtree->tr_a.tu_regionp = (struct region *)0; BU_GETSTRUCT( stp, soltab); stp->l.magic = RT_SOLTAB_MAGIC; stp->l2.magic = RT_SOLTAB2_MAGIC; stp->st_rtip = rtip; stp->st_dp = dp; dp->d_uses++; /* XXX gratuitous junk */ stp->st_uses = 1; stp->st_matp = (matp_t)0; bu_ptbl_init( &stp->st_regions, 0, "regions using solid" ); /* XXX gratuitous junk */ VSUB2(vv, stp->st_max, stp->st_min); /* bounding box of bot span being computed */ stp->st_aradius = MAGNITUDE(vv) * 0.5125; if (stp->st_aradius <= 0) stp->st_aradius = 1.0; /* fake out, */ /* stp->st_meth = &adrt_functab; */ curtree->tr_a.tu_stp = stp; /* ACQUIRE_SEMAPHORE_TREE(hash); */ #if 0 BU_LIST_INSERT( &(rtip->rti_solidheads[hash]), &(stp->l) ); BU_LIST_INSERT( &dp->d_use_hd, &(stp->l2) ); #endif /* RELEASE_SEMAPHORE_TREE(hash); */ /* bu_log("tree:0x%08x stp:0x%08x\n", curtree, stp); */ return( curtree ); } int main(int argc, char *argv[]) { int i; char idbuf[132], filename[256]; struct db_tree_state ts; struct directory *dp; short s; if(argc <= 3) { printf("usage: g-adrt file.g adrt_proj_name [region list]\n"); exit(1); } /* Open the adrt file */ strcpy(filename, argv[2]); strcat(filename, ".adrt"); adrt_fh = fopen(filename, "w"); printf("Converting...\n", argv[1], filename); /* write 2-byte endian */ s = 1; fwrite(&s, sizeof(short), 1, adrt_fh); /* write geometry revision number */ s = ADRT_GEOMETRY_REVISION; fwrite(&s, sizeof(short), 1, adrt_fh); region_count = 0; prop_num = 0; prop_list = NULL; /* * Load database. * rt_dirbuild() returns an "instance" pointer which describes * the database to be ray traced. It also gives you back the * title string in the header (ID) record. */ if((rtip = rt_dirbuild(argv[1], idbuf, sizeof(idbuf))) == RTI_NULL) { fprintf(stderr,"rtexample: rt_dirbuild failure\n"); exit(2); } ts = rt_initial_tree_state; ts.ts_dbip = rtip->rti_dbip; ts.ts_rtip = rtip; ts.ts_resp = NULL; bu_avs_init(&ts.ts_attrs, 1, "avs in tree_state"); db_walk_tree(rtip->rti_dbip, argc - 3, &argv[3], 1, &ts, ®_start_func, ®_end_func, &leaf_func, (void *)0); fclose(adrt_fh); /* * Generate an environment file */ strcpy(filename, argv[2]); strcat(filename, ".env"); adrt_fh = fopen(filename, "w"); strcpy(filename, argv[2]); strcat(filename, ".adrt"); fprintf(adrt_fh, "geometry_file,%s\n", filename); fprintf(adrt_fh, "properties_file,properties.db\n"); fprintf(adrt_fh, "textures_file,textures.db\n"); fprintf(adrt_fh, "frames_file,frames.db\n"); fprintf(adrt_fh, "image_size,640,480,80,80\n"); fprintf(adrt_fh, "rendering_method,phong\n"); fclose(adrt_fh); /* * Generate a properties file */ adrt_fh = fopen("properties.db", "w"); for(i = 0; i < prop_num; i++) { fprintf(adrt_fh, "properties,%s\n", prop_list[i].name); fprintf(adrt_fh, "color,%f,%f,%.f\n", prop_list[i].color[0], prop_list[i].color[1], prop_list[i].color[2]); } fclose(adrt_fh); /* * Generate a textures file */ adrt_fh = fopen("textures.db", "w"); fclose(adrt_fh); /* * Generate a frames file */ adrt_fh = fopen("frames.db", "w"); fprintf(adrt_fh, "frame,1\n"); fprintf(adrt_fh, "camera,10.0,10.0,10.0,0.0,0.0,0.0,0.0,20.0,0.0\n"); fclose(adrt_fh); printf("\ncomplete.\n"); } Index: Makefile.am =================================================================== RCS file: /cvsroot/brlcad/brlcad/src/conv/Makefile.am,v retrieving revision 14.3 retrieving revision 14.4 diff -w -u -r14.3 -r14.4 --- Makefile.am 29 Jun 2005 21:54:38 -0000 14.3 +++ Makefile.am 1 Jul 2005 21:08:59 -0000 14.4 @@ -34,6 +34,7 @@ euclid_unformat \ fast4-g \ g-acad \ + g-adrt \ g-dxf \ g-euclid \ g-euclid1 \ @@ -85,6 +86,7 @@ g4_g5_LDADD = ${WDB} ${LIBRT} ${BN} ${BU} g5_g4_LDADD = ${WDB} ${LIBRT} ${BN} ${BU} g_acad_LDADD = ${WDB} ${LIBRT} ${BN} ${BU} +g_adrt_LDADD = ${WDB} ${LIBRT} ${BN} ${BU} g_dxf_LDADD = ${WDB} ${LIBRT} ${BN} ${BU} g_euclid1_LDADD = ${LIBRT} ${BN} ${BU} g_euclid_LDADD = ${LIBRT} ${BN} ${BU} @@ -128,6 +130,7 @@ g4_g5_SOURCES = g4-g5.c g5_g4_SOURCES = g5-g4.c g_acad_SOURCES = g-acad.c +g_adrt_SOURCES = g-adrt.c g_dxf_SOURCES = g-dxf.c g_euclid1_SOURCES = g-euclid1.c g_euclid_SOURCES = g-euclid.c @@ -223,6 +226,7 @@ $(euclid_unformat_OBJECTS) \ $(fast4_g_OBJECTS) \ $(g_acad_OBJECTS) \ + $(g_adrt_OBJECTS) \ $(g_dxf_OBJECTS) \ $(g_euclid_OBJECTS) \ $(g_euclid1_OBJECTS) \ |