/*                         V D E C K . C
 * BRL-CAD
 *
 * Copyright (c) 1990-2024 United States Government as represented by
 * the U.S. Army Research Laboratory.
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Lesser General Public License
 * version 2.1 as published by the Free Software Foundation.
 *
 * This program 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
 * Lesser 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.
 */
/** @file vdeck/vdeck.c
 *
 * Derived from KARDS, written by Keith Applin.
 *
 * Generate a COM-GEOM card images suitable for input to gift5 (also
 * gift(1V)) from an mged(1V) target description.
 *
 * There are 3 files generated at a time, the Solid table, Region
 * table, and Ident table, which when concatenated in that order, make
 * a COM-GEOM deck.  The record formats in the order that they appear,
 * are described below, and are strictly column oriented.
 *
 * Note that the Solid table begins with a Title and a Control card,
 * the rest of the record types appear once for each object, that is,
 * one Solid record for each Solid, one Region and one Ident record
 * for each Region as totaled on the Control card, however, the Solid
 * and Region records may span more than 1 card.
 *
 @code
 --------------------------------------------------------------------------------
 |File|Record  :             Contents              :       Format               |
 |----|-------------------------------------------------------------------------|
 | 1  |Title   : target_units, title               : a2, 3x, a60                |
 |    |Control : #_of_solids, #_of_regions         : i5, i5                     |
 |    |Solid   : sol_#, sol_type, params., comment : i5, a5, 6f10.0, a10        |
 |    | cont'  : sol_#, parameters, comment        : i5, 5x, 6f10.0, a10        |
 |----|-------------------------------------------------------------------------|
 | 2  |Region  : reg_#,(op,[sol/reg]_#)*, comment  : i5, 1x, 9(a2, i5), 1x, a10 |
 |    | cont'  : reg_#,(op,[sol/reg]_#)*, comment  : i5, 1x, 9(a2, i5), 1x, a10 |
 |----|-------------------------------------------------------------------------|
 | 3  |Flag    : a -1 marks end of region table    : i5                         |
 |    |Idents  : reg_#, ident, space, mat,%, desc  : 5i5, 5x, a50               |
 --------------------------------------------------------------------------------
 @endcode
 *
 */

#include "common.h"

#include <stdlib.h>
#include <signal.h>
#include <math.h>
#include <string.h>
#ifdef HAVE_SYS_TYPES_H
#  include <sys/types.h>
#endif
#include "bio.h"

#include "bu/app.h"
#include "bu/parallel.h"
#include "bu/sort.h"
#include "bu/units.h"
#include "vmath.h"
#include "raytrace.h"
#include "rt/geom.h"

#include "./vextern.h"


int	debug = 0;

char	*cmd[] = {
    "",
    "C O M M A N D                  D E S C R I P T I O N",
    "",
    "deck [output file prefix]      Produce COM GEOM card deck.",
    "erase                          Erase current list of objects.",
    "insert [object[s]]             Add an object to current list.",
    "list [object[s]]               Display current list of selected objects.",
    "number [solid] [region]        Specify starting numbers for objects.",
    "quit                           Terminate run.",
    "remove [object[s]]             Remove an object from current list.",
    "sort                           Sort table of contents alphabetically.",
    "toc [object[s]]                Table of contents of solids database.",
    "",
    "NOTE:",
    "First letter of command is sufficient, and all arguments are optional.",
    "Objects may be specified with string matching operators (*, [], -, ? or \\)",
    "as in the UNIX shell.",
    0
};

char	*usage[] = {
    "",
    "v d e c k",
    "Make COMGEOM decks of objects from a \"mged\" file suitable as",
    "input to GIFT5 or gift(1V).",
    "",
    "Usage: vdeck file.g",
    "",
    0
};

/*  These arrays are now dynamically allocated by toc() */

char	**toc_list;		/* Sorted table of contents. */
char	**curr_list;		/* regions and solids to be processed. */
int	curr_ct = 0;
char	**tmp_list;		/* Temporary list of names */
int	tmp_ct = 0;

/* List of arguments from command line parser.				*/
char	*arg_list[MAXARG];
int	arg_ct = 0;

/* Structure used by setjmp() and longjmp() to save environment.	*/
jmp_buf	env;

/* File names and descriptors.						*/
char	*objfile;
FILE	*regfp;
struct bu_vls	bu_vls = BU_VLS_INIT_ZERO;
struct bu_vls	st_vls = BU_VLS_INIT_ZERO;
struct bu_vls	id_vls = BU_VLS_INIT_ZERO;
char	*rt_file;
FILE	*solfp;
char	*st_file;
FILE	*ridfp;
char	*id_file;

/* Counters.								*/
int	nns;		/* Solids.					*/
int	nnr;		/* Regions not members of other regions.	*/
int	ndir;		/* Entries in directory.			*/

/* Miscellaneous globals leftover from Keith's KARDS code.		*/
int		delsol = 0, delreg = 0;
char		buff[30];
b_off_t		savsol;		/* File position of # of solids & regions	*/

/* Structures.								*/
mat_t		identity;

/* Head of linked list of solids */
struct soltab	sol_hd;

struct db_i	*dbip;		/* Database instance ptr */

extern int parsArg(int, char **);
extern int insert(char **, int);
extern int col_prt(char **, size_t);
extern int match(char *, char *);
extern int delete_obj(char **);
extern int
cgarbs(int *cgtype,
	const struct rt_arb_internal *gp,
	int uniq[8],           /* array of unique pt subscripts */
	int svec[11],          /* array of like pt subscripts */
	const double dist_tol
      );
extern int
redoarb(
	point_t pts[8],
	const struct rt_arb_internal *gp,
	int uniq[8],
	int svec[11],
	const int numvec,
	const int cgtype
       );

/**
 * Convert integer to ascii  wd format.
 */
void
vls_itoa(struct bu_vls *v, int n, int w)
{
    int	 c, i, j, sign;
    char *s;

    BU_CK_VLS(v);
    bu_vls_strncat(v, "xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx", w);
    s = bu_vls_addr(v)+bu_vls_strlen(v)-w;

    if ((sign = n) < 0)	n = -n;
    i = 0;
    do
	s[i++] = n % 10 + '0';
    while ((n /= 10) > 0);
    if (sign < 0) s[i++] = '-';

    /* Blank fill array. */
    for (j = i; j < w; j++) s[j] = ' ';
    if (i > w) {
	s[w-1] = (s[w]-1-'0')*10 + (s[w-1]-'0')  + 'A';
    }
    s[w] = '\0';

    /* Reverse the array. */
    for (i = 0, j = w - 1; i < j; i++, j--) {
	c    = s[i];
	s[i] = s[j];
	s[j] =    c;
    }
}


/**
 * Convert integer to ascii  wd format.
 */
static void
vdeck_itoa(int n, char *s, int w)
{
    int	 c, i, j, sign;

    if ((sign = n) < 0)	n = -n;
    i = 0;
    do
	s[i++] = n % 10 + '0';
    while ((n /= 10) > 0);
    if (sign < 0)	s[i++] = '-';

    /* Blank fill array.					*/
    for (j = i; j < w; j++)	s[j] = ' ';
    if (i > w) {
	s[w-1] = (s[w]-1-'0')*10 + (s[w-1]-'0')  + 'A';
    }
    s[w] = '\0';

    /* Reverse the array.					*/
    for (i = 0, j = w - 1; i < j; i++, j--) {
	c    = s[i];
	s[i] = s[j];
	s[j] =    c;
    }
}


void
vls_blanks(struct bu_vls *v, int n)
{
    BU_CK_VLS(v);
    /* 128 spaces */
    bu_vls_strncat(v, "                                                                                                                                ",
		   n);
}


/**
 * Convert float to ascii  w.df format.
 */
void
vls_ftoa(struct bu_vls *v, double f, int w, int d)
{
    char	*s;
    int	c, i, j;
    long	n, sign;

    BU_CK_VLS(v);
    bu_vls_strncat(v, "xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx", w);
    s = bu_vls_addr(v)+bu_vls_strlen(v)-w;

    if (w <= d + 2) {
	(void) fprintf(stderr,
		       "ftoascii: incorrect format  need w.df  stop"
	   );
	bu_exit(10, NULL);
    }
    for (i = 1; i <= d; i++)
	f = f * 10.0;

    /* round up */
    if (f < 0.0)
	f -= 0.5;
    else
	f += 0.5;
    n = f;
    if ((sign = n) < 0)
	n = -n;
    i = 0;
    do	{
	s[i++] = n % 10 + '0';
	if (i == d)
	    s[i++] = '.';
    }	while ((n /= 10) > 0);

    /* Zero fill the d field if necessary.				*/
    if (i < d) {
	for (j = i; j < d; j++)
	    s[j] = '0';
	s[j++] = '.';
	i = j;
    }
    if (sign < 0)
	s[i++] = '-';

    /* Blank fill rest of field.					*/
    for (j = i; j < w; j++)
	s[j] = ' ';
    if (i > w)
	(void) fprintf(stderr, "Ftoascii: field length too small\n");
    s[w] = '\0';

    /* Reverse the array.						*/
    for (i = 0, j = w - 1; i < j; i++, j--) {
	c    = s[i];
	s[i] = s[j];
	s[j] =    c;
    }
}

void
vls_ftoa_vec_cvt(struct bu_vls *v, const vect_t vec, int w, int d)
{
    vls_ftoa(v, vec[X]*dbip->dbi_base2local, w, d);
    vls_ftoa(v, vec[Y]*dbip->dbi_base2local, w, d);
    vls_ftoa(v, vec[Z]*dbip->dbi_base2local, w, d);
}


void
vls_ftoa_vec(struct bu_vls *v, const vect_t vec, int w, int d)
{
    vls_ftoa(v, vec[X], w, d);
    vls_ftoa(v, vec[Y], w, d);
    vls_ftoa(v, vec[Z], w, d);
}


void
vls_ftoa_cvt(struct bu_vls *v, double f, int w, int d)
{
    vls_ftoa(v, f*dbip->dbi_base2local, w, d);
}



/**
 * Write with error checking.
 */
void
ewrite(FILE *fp, const char *buf, size_t bytes)
{
    if (bytes == 0)  return;

    if (fwrite(buf, bytes, 1, fp) != 1) {
	perror("write");
	fprintf(stderr, "vdeck: write error\n");
	bu_exit(2, NULL);
    }
}


/**
 * Write count blanks to fildes.
 */
void
blank_fill(FILE *fp, size_t count)
{
    ewrite(fp, BLANKS, count);
}


/*
 *  Print a non-newline-terminate string, and flush stdout
 */
void
prompt(char *fmt)
{
    fputs(fmt, stdout);
    fflush(stdout);
}


/**
 * Comparison function for bu_sort().
 *
 * 'a' is the exact template expected by bu_sort.
 */
static int
sortFunc(const void *a, const void *b, void *UNUSED(arg))
{
    const char **lhs = (const char **)a;
    const char **rhs = (const char **)b;

    return bu_strcmp(*lhs, *rhs);
}


/**
 * This routine turns a union tree into a flat string.
 */
void
flatten_tree(struct bu_vls *vls, union tree *tp, char *op, int neg)
{
    int	bit;

    BU_CK_VLS(vls);

    switch (tp->tr_op) {

	case OP_NOP:
	    bu_log("NOP\n");
	    return;

	case OP_SOLID:
	    bit = tp->tr_a.tu_stp->st_bit;
	    if (bit < 10000) {
		/* Old way, just use negative number in I5 field */
		bu_vls_strncat(vls, op, 2);
		if (neg) bit = -bit;
	    } else {
		/* New way, due to Tom Sullivan of Sandia. */
		/* "or" becomes "nr", "  " becomes "nn" */
		if (neg) {
		    if (*op == ' ')
			bu_vls_strncat(vls, "nn", 2);
		    else if (*op == 'o' && op[1] == 'r')
			bu_vls_strncat(vls, "nr", 2);
		    else
			bu_vls_strncat(vls, "??", 2);
		} else {
		    bu_vls_strncat(vls, op, 2);
		}
	    }
	    vls_itoa(vls, bit, 5);
	    /* tp->tr_a.tu_stp->st_name */
	    return;

	case OP_REGION:
	    bu_log("REGION 'stp'=%zx\n", (size_t)tp->tr_a.tu_stp);
	    return;

	default:
	    bu_log("Unknown op=x%x\n", tp->tr_op);
	    return;

	case OP_UNION:
	    flatten_tree(vls, tp->tr_b.tb_left, "or", neg);
	    flatten_tree(vls, tp->tr_b.tb_right, "or", 0);
	    break;
	case OP_INTERSECT:
	    flatten_tree(vls, tp->tr_b.tb_left, op, neg);
	    flatten_tree(vls, tp->tr_b.tb_right, "  ", 0);
	    break;
	case OP_SUBTRACT:
	    flatten_tree(vls, tp->tr_b.tb_left, op, neg);
	    flatten_tree(vls, tp->tr_b.tb_right, "  ", 1);
	    break;
    }
}


/**
 * This routine will be called by db_walk_tree() once all the solids
 * in this region have been visited.
 */
union tree *
region_end(struct db_tree_state *tsp, const struct db_full_path *pathp, union tree *curtree, void *UNUSED(client_data))
{
    struct directory	*dp;
    char			*fullname;
    struct bu_vls		ident = BU_VLS_INIT_ZERO;
    struct bu_vls		reg = BU_VLS_INIT_ZERO;
    struct bu_vls		flat = BU_VLS_INIT_ZERO;
#define OBUF_SIZE 128
    char			obuf[OBUF_SIZE];
    char			*cp;
    size_t			left;
    int			length;
    struct directory	*regdp = RT_DIR_NULL;
    size_t i;
    int first;

    fullname = db_path_to_string(pathp);

    dp = DB_FULL_PATH_CUR_DIR(pathp);
    dp->d_uses++;		/* instance number */

    /* For name, find pointer to region combination */
    for (i = 0; i < pathp->fp_len; i++) {
	regdp = pathp->fp_names[i];
	if (regdp->d_flags & RT_DIR_REGION)  break;
    }

    nnr++;			/* Start new region */

    /* Print an indicator of our progress */
    if (debug)
	(void) printf("%4d:%s\n", nnr+delreg, fullname);

    /*
     *  Write the boolean formula into the region table.
     */

    /* Convert boolean tree into string of 7-char chunks */
    if (curtree->tr_op == OP_NOP) {
	bu_vls_strcat(&flat, "");
    } else {
	/* Rewrite tree so that all unions are at tree top */
	db_non_union_push(curtree, &rt_uniresource);
	flatten_tree(&flat, curtree, "  ", 0);
    }

    /* Output 9 of the 7-char chunks per region "card" */
    cp = bu_vls_addr(&flat);
    left = bu_vls_strlen(&flat);
    first = 1;

    do {
	char *op = obuf;
	int  op_left = OBUF_SIZE;

	if (first) {
	    (void) snprintf(obuf, OBUF_SIZE-1, "%5d ", nnr+delreg);
	    /* sanity */
	    obuf[OBUF_SIZE-1]='\0';
	    first = 0;
	} else {
	    bu_strlcpy(op, "      \0", 7);
	}
	op = obuf + 6;
	op_left -= 6;

	if (left > 9*7) {
	    bu_strlcpy(op, cp, 9*7+1);
	    cp += 9*7;
	    op += 9*7;
	    op_left -= 9*7;
	    left -= 9*7;
	} else {
	    bu_strlcpy(op, cp, left+1);
	    op += left;
	    op_left -= left;
	    while (left < 9*7) {
		*op++ = ' ';
		op_left--;
		left++;
	    }
	    left = 0;
	}
	/* copy directory name into op */
	if (op_left <= 0) {
	    bu_log("Ran out of buffer space\n");
	    return NULL;
	}
	bu_strlcpy(op, regdp->d_namep, op_left);
	/* and advance op to after the directory name */
	op += strlen(op);
	*op++ = '\n';
	*op = '\0';
	ewrite(regfp, obuf, strlen(obuf));
    } while (left > 0);

    /*
     *  Write a record into the region ident table.
     */
    vls_itoa(&ident, nnr+delreg, 5);
    vls_itoa(&ident, tsp->ts_regionid, 5);
    vls_itoa(&ident, tsp->ts_aircode, 5);
    vls_itoa(&ident, tsp->ts_gmater, 5);
    vls_itoa(&ident, tsp->ts_los, 5);
    bu_vls_strcat(&ident, "     ");		/* 5 spaces */

    length = strlen(fullname);
    if (length > 50) {
	char	*bp;

	bp = fullname + (length - 50);
	*bp = '*';
	bu_vls_strcat(&ident, bp);
    } else {
	/* Omit leading slash, for compat with old version */
	bu_vls_strcat(&ident, fullname+1);
    }
    bu_vls_strcat(&ident, "\n");
    bu_vls_fwrite(ridfp, &ident);

    bu_vls_free(&ident);
    bu_vls_free(&reg);
    bu_vls_free(&flat);
    bu_free(fullname, "fullname");

    /*
     *  Returned tree will be freed by caller.
     *  To keep solid table available for searching,
     *  add this tree to a list of trees to be released once
     *  everything is finished.
     */
    /* XXX Should make list of "regions" (trees) here */
    return  (union tree *)0;
}


void
swap_vec(vect_t v1, vect_t v2)
{
    vect_t	work;

    VMOVE(work, v1);
    VMOVE(v1, v2);
    VMOVE(v2, work);
}


void
swap_dbl(double *d1, double *d2)
{
    double	t;
    t = *d1;
    *d1 = *d2;
    *d2 = t;
    return;
}


/**
 * Process torus.
 */
void
addtor(struct bu_vls *v, struct rt_tor_internal *gp, char *name, int num)
{
    BU_CK_VLS(v);
    RT_TOR_CK_MAGIC(gp);

    /* V, N, r1, r2 */
    vls_itoa(v, num, 5);
    bu_vls_strcat(v, "tor  ");		/* 5 */
    vls_ftoa_vec_cvt(v, gp->v, 10, 4);
    vls_ftoa_vec(v, gp->h, 10, 4);
    bu_vls_strcat(v, name);
    bu_vls_strcat(v, "\n");

    vls_itoa(v, num, 5);
    vls_blanks(v, 5);
    vls_ftoa_cvt(v, gp->r_a, 10, 4);
    vls_ftoa_cvt(v, gp->r_h, 10, 4);
    vls_blanks(v, 4*10);
    bu_vls_strcat(v, name);
    bu_vls_strcat(v, "\n");
}


void
addhalf(struct bu_vls *v, struct rt_half_internal *gp, char *name, int num)
{
    BU_CK_VLS(v);
    RT_HALF_CK_MAGIC(gp);

    /* N, d */
    vls_itoa(v, num, 5);
    bu_vls_strcat(v, "haf  ");		/* 5 */
    vls_ftoa_vec(v, gp->eqn, 10, 4);
    vls_ftoa_cvt(v, -(gp->eqn[3]), 10, 4);
    vls_blanks(v, 2*10);
    bu_vls_strcat(v, name);
    bu_vls_strcat(v, "\n");
}


void
addarbn(struct bu_vls *v, struct rt_arbn_internal *gp, char *name, int num)
{
    size_t i;

    BU_CK_VLS(v);
    RT_ARBN_CK_MAGIC(gp);

    /* nverts, nverts_index_nums, nplane_eqns, naz_el */
    vls_itoa(v, num, 5);
    bu_vls_strcat(v, "arbn ");		/* 5 */
    vls_itoa(v, 0, 10);			/* vertex points, 2/card */
    vls_itoa(v, 0, 10);			/* vertex index #, 6/card */
    vls_itoa(v, gp->neqn, 10);		/* plane eqn, 1/card */
    vls_itoa(v, 0, 10);			/* az/el & index #, 2/card */
    vls_blanks(v, 20);
    bu_vls_strcat(v, name);
    bu_vls_strcat(v, "\n");

    for (i = 0; i < gp->neqn; i++) {
	vls_itoa(v, num, 5);
	vls_blanks(v, 5);
	vls_ftoa_vec(v, gp->eqn[i], 10, 4);
	vls_ftoa_cvt(v, gp->eqn[i][3], 10, 4);
	vls_blanks(v, 2*10);
	bu_vls_strcat(v, name);
	bu_vls_strcat(v, "\n");
    }
}


static void
vls_solid_pts(struct bu_vls *v, const point_t *pts, int npts, const char *name, int num, const char *kind)
{
    int	i;

    for (i = 0; i < npts;) {
	vls_itoa(v, num, 5);
	if (i == 0)
	    bu_vls_strncat(v, kind, 5);
	else
	    bu_vls_strcat(v, "     ");
	vls_ftoa_vec_cvt(v, pts[i], 10, 4);
	if (++i < npts) {
	    vls_ftoa_vec_cvt(v, pts[i], 10, 4);
	} else {
	    vls_blanks(v, 3*10);
	}
	i++;
	bu_vls_strcat(v, name);
	bu_vls_strcat(v, "\n");
    }
}


/**
 *  Process generalized arb.
 */
void
addarb(struct bu_vls *v, struct rt_arb_internal *gp, char *name, int num)
{
    int	i;
    int	uniq_pts[8];
    int	samevecs[11];
    int	cgtype;
    point_t	pts[8];		/* GIFT-order points */

    /* Enter new arb code.						*/
    if ((i = cgarbs(&cgtype, gp, uniq_pts, samevecs, CONV_EPSILON)) == 0 ||
	 redoarb(pts, gp, uniq_pts, samevecs, i, cgtype) == 0) {
	fprintf(stderr, "vdeck: addarb(%s): failure\n", name);
	vls_itoa(v, num, 5);
	bu_vls_strncat(v, "arb??", 5);
	vls_blanks(v, 6*10);
	bu_vls_strcat(v, name);
	bu_vls_strcat(v, "\n");
	return;
    }

    /* Print the solid parameters.					*/
    switch (cgtype) {
	case 8:
	    vls_solid_pts(v, (const point_t *)&pts, 8, name, num, "arb8 ");
	    break;
	case 7:
	    vls_solid_pts(v, (const point_t *)&pts, 7, name, num, "arb7 ");
	    break;
	case 6:
	    VMOVE(pts[5], pts[6]);
	    vls_solid_pts(v, (const point_t *)&pts, 6, name, num, "arb6 ");
	    break;
	case 5:
	    vls_solid_pts(v, (const point_t *)&pts, 5, name, num, "arb5 ");
	    break;
	case 4:
	    VMOVE(pts[3], pts[4]);
	    vls_solid_pts(v, (const point_t *)&pts, 4, name, num, "arb4 ");
	    break;

	    /* Currently, cgarbs() will not return RAW, BOX, or RPP */
	default:
	    (void) fprintf(stderr, "addarb: Unknown arb cgtype=%d.\n",
			    cgtype);
	    bu_exit(10, NULL);
    }
}

#define GENELL	1
#define	ELL1	2
#define SPH	3

/**
 * Process the general ellipsoid.
 */
void
addell(struct bu_vls *v, struct rt_ell_internal *gp, char *name, int num)
{
    double	ma, mb, mc;
    int	cgtype = GENELL;

    /* Check for ell1 or sph.					*/
    ma = MAGNITUDE(gp->a);
    mb = MAGNITUDE(gp->b);
    mc = MAGNITUDE(gp->c);
    if (fabs(ma-mb) < CONV_EPSILON) {
	/* vector A == vector B */
	cgtype = ELL1;
	/* SPH if vector B == vector C also */
	if (fabs(mb-mc) < CONV_EPSILON)
	    cgtype = SPH;
	else {	/* switch A and C */
	    swap_vec(gp->a, gp->c);
	    swap_dbl(&ma, &mc);
	}
    } else if (fabs(ma-mc) < CONV_EPSILON) {
	/* vector A == vector C */
	cgtype = ELL1;
	/* switch vector A and vector B */
	swap_vec(gp->a, gp->b);
	swap_dbl(&ma, &mb);
    } else if (fabs(mb-mc) < CONV_EPSILON) {
	cgtype = ELL1;
    }

    /* Print the solid parameters.					*/
    vls_itoa(v, num, 5);
    switch (cgtype) {
	case ELL1:
	    bu_vls_strcat(v, "ell1 ");		/* 5 */
	    vls_ftoa_vec_cvt(v, gp->v, 10, 4);
	    vls_ftoa_vec_cvt(v, gp->a, 10, 4);
	    bu_vls_strcat(v, name);
	    bu_vls_strcat(v, "\n");

	    vls_itoa(v, num, 5);
	    vls_blanks(v, 5);
	    vls_ftoa_cvt(v, mb, 10, 4);
	    vls_blanks(v, 5*10);
	    bu_vls_strcat(v, name);
	    bu_vls_strcat(v, "\n");
	    break;
	case SPH:
	    bu_vls_strcat(v, "sph  ");		/* 5 */
	    vls_ftoa_vec_cvt(v, gp->v, 10, 4);
	    vls_ftoa_cvt(v, ma, 10, 4);
	    vls_blanks(v, 2*10);
	    bu_vls_strcat(v, name);
	    bu_vls_strcat(v, "\n");
	    break;
	case GENELL:
	default:
	    bu_vls_strcat(v, "ellg ");		/* 5 */
	    vls_ftoa_vec_cvt(v, gp->v, 10, 4);
	    vls_ftoa_vec_cvt(v, gp->a, 10, 4);
	    bu_vls_strcat(v, name);
	    bu_vls_strcat(v, "\n");

	    vls_itoa(v, num, 5);
	    vls_blanks(v, 5);
	    vls_ftoa_vec_cvt(v, gp->b, 10, 4);
	    vls_ftoa_vec_cvt(v, gp->c, 10, 4);
	    bu_vls_strcat(v, name);
	    bu_vls_strcat(v, "\n");
	    break;
    }
}


#define TGC	1
#define TEC	2
#define TRC	3
#define REC	4
#define RCC	5


/**
 * Process generalized truncated cone.
 */
void
addtgc(struct bu_vls *v, struct rt_tgc_internal *gp, char *name, int num)
{
    vect_t	axb, cxd;
    double	ma, mb, mc, md, maxb, mcxd, mh;
    int	cgtype;

    /* Check for tec rec trc rcc.					*/
    cgtype = TGC;
    VCROSS(axb, gp->a, gp->b);
    VCROSS(cxd, gp->c, gp->d);

    ma = MAGNITUDE(gp->a);
    mb = MAGNITUDE(gp->b);
    mc = MAGNITUDE(gp->c);
    md = MAGNITUDE(gp->d);
    maxb = MAGNITUDE(axb);
    mcxd = MAGNITUDE(cxd);
    mh = MAGNITUDE(gp->h);

    if (ma <= 0.0 || mb <= 0.0) {
	fprintf(stderr, "addtgc(%s): ma=%e, mb=%e, skipping\n", name, ma, mb);
	return;
    }

    /* TEC if ratio top and bot vectors equal and base parallel to top.
     */
    if (!ZERO(mc) && !ZERO(md) &&
	 fabs((mb/md)-(ma/mc)) < CONV_EPSILON &&
	 fabs(fabs(VDOT(axb, cxd)) - (maxb*mcxd)) < CONV_EPSILON) {
	cgtype = TEC;
    }

    /* Check for right cylinder.					*/
    if (fabs(fabs(VDOT(gp->h, axb)) - (mh*maxb)) < CONV_EPSILON) {
	if (fabs(ma-mb) < CONV_EPSILON) {
	    if (fabs(ma-mc) < CONV_EPSILON)
		cgtype = RCC;
	    else
		cgtype = TRC;
	} else {
	    /* elliptical */
	    if (fabs(ma-mc) < CONV_EPSILON)
		cgtype = REC;
	}
    }

    /* Insure that magnitude of A is greater than B, and magnitude of
       C is greater than D for the GIFT code (boy, is THIS a shame).
       This need only be done for the elliptical REC and TEC types.
    */
    if ((cgtype == REC || cgtype == TEC) && ma < mb) {
	swap_vec(gp->a, gp->b);
	swap_dbl(&ma, &mb);
	swap_vec(gp->c, gp->d);
	swap_dbl(&mc, &md);
    }

    /* Print the solid parameters. */
    vls_itoa(v, num, 5);
    switch (cgtype) {
	case RCC:
	    bu_vls_strcat(v, "rcc  ");		/* 5 */
	    vls_ftoa_vec_cvt(v, gp->v, 10, 4);
	    vls_ftoa_vec_cvt(v, gp->h, 10, 4);
	    bu_vls_strcat(v, name);
	    bu_vls_strcat(v, "\n");

	    vls_itoa(v, num, 5);
	    vls_blanks(v, 5);
	    vls_ftoa_cvt(v, ma, 10, 4);
	    vls_blanks(v, 5*10);
	    bu_vls_strcat(v, name);
	    bu_vls_strcat(v, "\n");
	    break;
	case TRC:
	    bu_vls_strcat(v, "trc  ");		/* 5 */
	    vls_ftoa_vec_cvt(v, gp->v, 10, 4);
	    vls_ftoa_vec_cvt(v, gp->h, 10, 4);
	    bu_vls_strcat(v, name);
	    bu_vls_strcat(v, "\n");

	    vls_itoa(v, num, 5);
	    vls_blanks(v, 5);
	    vls_ftoa_cvt(v, ma, 10, 4);
	    vls_ftoa_cvt(v, mc, 10, 4);
	    vls_blanks(v, 4*10);
	    bu_vls_strcat(v, name);
	    bu_vls_strcat(v, "\n");
	    break;
	case TEC:
	    bu_vls_strcat(v, "tec  ");		/* 5 */
	    vls_ftoa_vec_cvt(v, gp->v, 10, 4);
	    vls_ftoa_vec_cvt(v, gp->h, 10, 4);
	    bu_vls_strcat(v, name);
	    bu_vls_strcat(v, "\n");

	    vls_itoa(v, num, 5);
	    vls_blanks(v, 5);
	    vls_ftoa_vec_cvt(v, gp->a, 10, 4);
	    vls_ftoa_vec_cvt(v, gp->b, 10, 4);
	    bu_vls_strcat(v, name);
	    bu_vls_strcat(v, "\n");

	    vls_itoa(v, num, 5);
	    vls_blanks(v, 5);
	    vls_ftoa(v, ma/mc, 10, 4);	/* dimensionless ratio */
	    vls_blanks(v, 5*10);
	    bu_vls_strcat(v, name);
	    bu_vls_strcat(v, "\n");
	    break;
	case REC:
	    bu_vls_strcat(v, "rec  ");		/* 5 */
	    vls_ftoa_vec_cvt(v, gp->v, 10, 4);
	    vls_ftoa_vec_cvt(v, gp->h, 10, 4);
	    bu_vls_strcat(v, name);
	    bu_vls_strcat(v, "\n");

	    vls_itoa(v, num, 5);
	    vls_blanks(v, 5);
	    vls_ftoa_vec_cvt(v, gp->a, 10, 4);
	    vls_ftoa_vec_cvt(v, gp->b, 10, 4);
	    bu_vls_strcat(v, name);
	    bu_vls_strcat(v, "\n");
	    break;
	case TGC:
	default:
	    bu_vls_strcat(v, "tgc  ");		/* 5 */
	    vls_ftoa_vec_cvt(v, gp->v, 10, 4);
	    vls_ftoa_vec_cvt(v, gp->h, 10, 4);
	    bu_vls_strcat(v, name);
	    bu_vls_strcat(v, "\n");

	    vls_itoa(v, num, 5);
	    vls_blanks(v, 5);
	    vls_ftoa_vec_cvt(v, gp->a, 10, 4);
	    vls_ftoa_vec_cvt(v, gp->b, 10, 4);
	    bu_vls_strcat(v, name);
	    bu_vls_strcat(v, "\n");

	    vls_itoa(v, num, 5);
	    vls_blanks(v, 5);
	    vls_ftoa_cvt(v, mc, 10, 4);
	    vls_ftoa_cvt(v, md, 10, 4);
	    vls_blanks(v, 4*10);
	    bu_vls_strcat(v, name);
	    bu_vls_strcat(v, "\n");
	    break;
    }
}


void
ars_curve_out(struct bu_vls *v, fastf_t *fp, int todo, size_t curveno, int num)
{
    while (todo > 0) {
	vls_itoa(v, num, 5);
	vls_blanks(v, 5);

	/* First point */
	vls_ftoa_vec_cvt(v, fp, 10, 4);
	fp += 3;
	todo--;

	/* Second point */
	if (todo >= 1) {
	    vls_ftoa_vec_cvt(v, fp, 10, 4);
	    fp += 3;
	    todo--;
	} else {
	    vls_blanks(v, 3*10);
	}

	bu_vls_strcat(v, "curve ");
	vls_itoa(v, (int)curveno, 3);
	bu_vls_strcat(v, "\n");
    }
}


/**
 * Process triangular surfaced polyhedron - ars.
 */
void
addars(struct bu_vls *v, struct rt_ars_internal *gp, char *name, int num)
{
    size_t i;

    RT_ARS_CK_MAGIC(gp);

    vls_itoa(v, num, 5);
    bu_vls_strcat(v, "ars  ");		/* 5 */
    vls_itoa(v, gp->ncurves, 10);
    vls_itoa(v, gp->pts_per_curve, 10);
    vls_blanks(v, 4*10);
    bu_vls_strcat(v, name);
    bu_vls_strcat(v, "\n");

    for (i = 0; i < gp->ncurves; i++) {
	/* Output the points on this curve */
	ars_curve_out(v, gp->curves[i], gp->pts_per_curve, i, num);
    }
}


/**
 * Build a sorted list of names of all the objects accessible in the
 * object file.
 */
void
toc(void)
{
    struct directory *dp;
    int		count;

    /* Determine necessary table size */
    count = 0;
    FOR_ALL_DIRECTORY_START(dp, dbip) {
	count++;
    } FOR_ALL_DIRECTORY_END;
    count += 1;		/* Safety */

    /* Allocate tables */
    toc_list = (char **)bu_malloc(count * sizeof(char *), "toc_list[]");
    tmp_list = (char **)bu_malloc(count * sizeof(char *), "tmp_list[]");
    curr_list = (char **)bu_malloc(count * sizeof(char *), "curr_list[]");
    ndir = 0;

    /* Fill in toc_list[] */
    FOR_ALL_DIRECTORY_START(dp, dbip) {
	toc_list[ndir++] = dp->d_namep;
    } FOR_ALL_DIRECTORY_END;
}


/**
 * List the table of contents.
 */
void
list_toc(char *args[])
{
    int	i, j;
    (void) fflush(stdout);
    for (tmp_ct = 0, i = 1; args[i] != NULL; i++) {
	for (j = 0; j < ndir; j++) {
	    if (match(args[i], toc_list[j]))
		tmp_list[tmp_ct++] = toc_list[j];
	}
    }
    if (i > 1)
	(void) col_prt(tmp_list, tmp_ct);
    else
	(void) col_prt(toc_list, ndir);
    return;
}


#define NAMESIZE	16
#define MAX_COL	(NAMESIZE*5)
#define SEND_LN()	{\
	buf[column++] = '\n';\
	ewrite(stdout, buf, column);\
	column = 0;\
    }


/**
 * Print list of names in tabular columns.
 */
int
col_prt(char *list[], size_t ct)
{
    char		buf[MAX_COL+2];
    size_t i, column, spaces;

    for (i = 0, column = 0; i < ct; i++) {
	if (column + (int)strlen(list[i]) > MAX_COL) {
	    SEND_LN();
	    i--;
	}
	else {
	    bu_strlcpy(&buf[column], list[i], MAX_COL+2-column);
	    column += strlen(list[i]);
	    spaces = NAMESIZE - (column % NAMESIZE);
	    if (column + spaces < MAX_COL)
		for (; spaces > 0; spaces--)
		    buf[column++] = ' ';
	    else
		SEND_LN();
	}
    }
    SEND_LN();
    return	ct;
}


/**
 * Insert each member of the table of contents 'toc_list' which
 * matches one of the arguments into the current list 'curr_list'.
 */
int
insert(char *args[], int ct)
{
    int	i, j, nomatch;

    /* For each argument (does not include args[0]).			*/
    for (i = 1; i < ct; i++) {
	/* If object is in table of contents, insert in current list.	*/
	nomatch = YES;
	for (j = 0; j < ndir; j++) {
	    if (match(args[i], toc_list[j])) {
		nomatch = NO;
		/* Allocate storage for string.			*/
		curr_list[curr_ct++] = bu_strdup(toc_list[j]);
	    }
	}
	if (nomatch)
	    (void) fprintf(stderr,
			   "Object \"%s\" not found.\n", args[i]);
    }
    return	curr_ct;
}

/**
 * delete all members of current list 'curr_list' which match one of
 * the arguments.
 */
int
delete_obj(char *args[])
{
    int	i;
    int	nomatch;

    /* for each object in arg list
     */
    for (i = 1; i < arg_ct; i++) {
	int	j;
	nomatch = YES;

	/* traverse list to find string
	 */
	for (j = 0; j < curr_ct;)
	    if (match(args[i], curr_list[j])) {
		int	k;

		nomatch = NO;
		bu_free(curr_list[j], "curr_list");
		--curr_ct;
		/* starting from bottom of list,
		 * pull all entries up to fill up space
		 made by deletion
		*/
		for (k = j; k < curr_ct; k++)
		    curr_list[k] = curr_list[k+1];
	    }
	    else	++j;
	if (nomatch)
	    (void) fprintf(stderr,
			   "Object \"%s\" not found.\n",
			   args[i]
		);
    }
    return curr_ct;
}

/**
 * Re-use the librt "soltab" structures here, for our own purposes.
 */
union tree *
gettree_leaf(struct db_tree_state *tsp, const struct db_full_path *pathp, struct rt_db_internal *ip, void *UNUSED(client_data))
{
    fastf_t	f;
    struct soltab	*stp;
    union tree		*curtree;
    struct directory	*dp;
    struct bu_vls sol = BU_VLS_INIT_ZERO;
    int		i;
    matp_t		mat;

    RT_CK_DB_INTERNAL(ip);
    dp = DB_FULL_PATH_CUR_DIR(pathp);

    /* Determine if this matrix is an identity matrix */
    for (i = 0; i < 16; i++) {
	f = tsp->ts_mat[i] - bn_mat_identity[i];
	if (!NEAR_ZERO(f, 0.0001))
	    break;
    }
    if (i < 16) {
	/* Not identity matrix */
	mat = tsp->ts_mat;
    } else {
	/* Identity matrix */
	mat = (matp_t)0;
    }

    /*
     *  Check to see if this exact solid has already been processed.
     *  Match on leaf name and matrix.
     */
    for (BU_LIST_FOR(stp, soltab, &(sol_hd.l))) {
	RT_CHECK_SOLTAB(stp);				/* debug */

	/* Leaf solids must be the same */
	if (dp != stp->st_dp)  continue;

	if (mat == (matp_t)0) {
	    if (stp->st_matp == (matp_t)0) {
		if (debug)
		    bu_log("rt_gettree_leaf:  %s re-referenced (ident)\n",
			   dp->d_namep);
		goto found_it;
	    }
	    goto next_one;
	}
	if (stp->st_matp == (matp_t)0)  goto next_one;

	for (i = 0; i < 16; i++) {
	    f = mat[i] - stp->st_matp[i];
	    if (!NEAR_ZERO(f, 0.0001))
		goto next_one;
	}
	/* Success, we have a match! */
	if (debug) {
	    bu_log("rt_gettree_leaf:  %s re-referenced\n",
		   dp->d_namep);
	}
	goto found_it;
    next_one:
	;
    }

    BU_ALLOC(stp, struct soltab);
    stp->l.magic = RT_SOLTAB_MAGIC;
    stp->st_id = ip->idb_type;
    stp->st_dp = dp;
    if (mat) {
	/* stupid matp_t */
	stp->st_matp = (matp_t)bu_malloc(sizeof(mat_t), "st_matp");
	MAT_COPY(stp->st_matp, mat);
    } else {
	stp->st_matp = mat;
    }
    stp->st_specific = (void *)0;

    /* init solid's maxima and minima */
    VSETALL(stp->st_max, -INFINITY);
    VSETALL(stp->st_min,  INFINITY);

    RT_CK_DB_INTERNAL(ip);

    if (debug) {
	struct bu_vls str = BU_VLS_INIT_ZERO;
	/* verbose = 1, mm2local = 1.0 */
	if (ip->idb_meth->ft_describe(&str, ip, 1, 1.0) < 0) {
	    bu_log("rt_gettree_leaf(%s):  solid describe failure\n",
		   dp->d_namep);
	}
	bu_log("%s:  %s", dp->d_namep, bu_vls_addr(&str));
	bu_vls_free(&str);
    }

    /* For now, just link them all onto the same list */
    BU_LIST_INSERT(&(sol_hd.l), &(stp->l));

    stp->st_bit = ++nns;

    /* Solid number is stp->st_bit + delsol */

    /* Process appropriate solid type.				*/
    switch (ip->idb_type) {
	case ID_TOR:
	    addtor(&sol, (struct rt_tor_internal *)ip->idb_ptr,
		    dp->d_namep, stp->st_bit+delsol);
	    break;
	case ID_ARB8:
	    addarb(&sol, (struct rt_arb_internal *)ip->idb_ptr,
		    dp->d_namep, stp->st_bit+delsol);
	    break;
	case ID_ELL:
	    addell(&sol, (struct rt_ell_internal *)ip->idb_ptr,
		    dp->d_namep, stp->st_bit+delsol);
	    break;
	case ID_TGC:
	    addtgc(&sol, (struct rt_tgc_internal *)ip->idb_ptr,
		    dp->d_namep, stp->st_bit+delsol);
	    break;
	case ID_ARS:
	    addars(&sol, (struct rt_ars_internal *)ip->idb_ptr,
		    dp->d_namep, stp->st_bit+delsol);
	    break;
	case ID_HALF:
	    addhalf(&sol, (struct rt_half_internal *)ip->idb_ptr,
		     dp->d_namep, stp->st_bit+delsol);
	    break;
	case ID_ARBN:
	    addarbn(&sol, (struct rt_arbn_internal *)ip->idb_ptr,
		     dp->d_namep, stp->st_bit+delsol);
	    break;
	case ID_PIPE:
	    /* XXX */
	default:
	    (void) fprintf(stderr,
			   "vdeck: '%s' Primitive type %s has no corresponding COMGEOM primitive, skipping\n",
			   dp->d_namep, ip->idb_meth->ft_name);
	    vls_itoa(&sol, stp->st_bit+delsol, 5);
	    bu_vls_strcat(&sol, ip->idb_meth->ft_name);
	    vls_blanks(&sol, 5*10);
	    bu_vls_strcat(&sol, dp->d_namep);
	    bu_vls_strcat(&sol, "\n");
	    break;
    }

    bu_vls_fwrite(solfp, &sol);
    bu_vls_free(&sol);

found_it:
    BU_ALLOC(curtree, union tree);
    RT_TREE_INIT(curtree);
    curtree->tr_op = OP_SOLID;
    curtree->tr_a.tu_stp = stp;
    curtree->tr_a.tu_regionp = (struct region *)0;

    return curtree;
}


/**
 * make a COMGEOM deck for current list of objects
 */
void
deck(char *prefix)
{
    nns = nnr = 0;

    /* Create file for solid table.					*/
    if (prefix != 0) {
	(void) bu_vls_strcpy(&st_vls, prefix);
	(void) bu_vls_strcat(&st_vls, ".st");
    }
    else
	(void) bu_vls_strcpy(&st_vls, "solids");
    st_file = bu_vls_addr(&st_vls);
    if ((solfp = fopen(st_file, "w")) == NULL) {
	perror(st_file);
	bu_exit(10, NULL);
    }


    /* Target units (a2, 3x)						*/
    ewrite(solfp, bu_units_string(dbip->dbi_local2base), 2);
    blank_fill(solfp, 3);

    /* Title							*/
    if (dbip->dbi_title == NULL)
	ewrite(solfp, objfile, (unsigned) strlen(objfile));
    else
	ewrite(solfp, dbip->dbi_title, (unsigned) strlen(dbip->dbi_title));
    ewrite(solfp, LF, 1);

    /* Save space for number of solids and regions.			*/
    savsol = bu_ftell(solfp);
    if (savsol < 0) {
	perror("ftell");
    }

    blank_fill(solfp, 10);
    ewrite(solfp, LF, 1);

    /* Create file for region table.				*/
    if (prefix != 0) {
	(void) bu_vls_strcpy(&bu_vls, prefix);
	(void) bu_vls_strcat(&bu_vls, ".rt");
    }
    else
	(void) bu_vls_strcpy(&bu_vls, "regions");
    rt_file = bu_vls_addr(&bu_vls);
    if ((regfp = fopen(rt_file, "w")) == NULL) {
	perror(rt_file);
	bu_exit(10, NULL);
    }

    /* create file for region ident table
     */
    if (prefix != 0) {
	(void) bu_vls_strcpy(&id_vls, prefix);
	(void) bu_vls_strcat(&id_vls, ".id");
    }
    else
	(void) bu_vls_strcpy(&id_vls, "region_ids");
    id_file = bu_vls_addr(&id_vls);
    if ((ridfp = fopen(id_file, "w")) == NULL) {
	perror(id_file);
	bu_exit(10, NULL);
    }
    vdeck_itoa(-1, buff, 5);
    ewrite(ridfp, buff, 5);
    ewrite(ridfp, LF, 1);

    /* Initialize matrices.						*/
    MAT_IDN(identity);

    if (!sol_hd.l.magic)  BU_LIST_INIT(&sol_hd.l);

    /*  Build the whole card deck.	*/
    /*  '1' indicates one CPU.  This code isn't ready for parallelism */
    if (db_walk_tree(dbip, curr_ct, (const char **)curr_list,
		     1, &rt_initial_tree_state,
		     0, region_end, gettree_leaf, (void *)NULL) < 0) {
	fprintf(stderr, "Unable to treewalk any trees!\n");
	bu_exit(11, NULL);
    }

    /* Go back, and add number of solids and regions on second card. */
    if (savsol >= 0)
	bu_fseek(solfp, savsol, 0);

    vdeck_itoa(nns, buff, 5);
    ewrite(solfp, buff, 5);
    vdeck_itoa(nnr, buff, 5);
    ewrite(solfp, buff, 5);

    /* Finish region id table.					*/
    ewrite(ridfp, LF, 1);

    (void) printf("====================================================\n");
    (void) printf("O U T P U T    F I L E S :\n\n");
    (void) printf("solid table = \"%s\"\n", st_file);
    (void) printf("region table = \"%s\"\n", rt_file);
    (void) printf("region identification table = \"%s\"\n", id_file);
    (void) fclose(solfp);
    (void) fclose(regfp);
    (void) fclose(ridfp);

    /* reset starting numbers for solids and regions
     */
    delsol = delreg = 0;
    /* XXX should free soltab list */
}





/**
 * Get a word of input into 'str'. Copies no more than maxchars characters
 * into str and ensures str is null-terminated if possible.
 *
 * Return 0 if end of input encountered, or if str is filled (word is truncated).
 * Return 1 otherwise.
 */
char
getarg(char *str, size_t maxchars)
{
    int c;
    size_t i;

    if (str == NULL || maxchars == 0) {
	return 0;
    }

    for (i = 0; i < maxchars; ++i) {
	c = getchar();
	switch (c) {
	case '\r':
	case '\n':
	case EOF:
	    /* end of input */
	    str[i] = '\0';
	    return 0;
	case ' ':
	    /* end of word/argument */
	    str[i] = '\0';
	    return 1;
	default:
	    str[i] = (char)c;
	}
    }

    /* ran out of space in dest string before reaching end of word
     * or end of input
     */
    str[i - 1] = '\0';

    return 0;
}


/**
 * Return first character read from keyboard, copy command into
 * args[0] and arguments into args[1]...args[n].
 */
int
getcmd(char *args[], int ct)
{
    /* Get arguments.						 */
    if (ct == 0)
	while (--arg_ct >= 0)
	    bu_free(args[arg_ct], "args[arg_ct]");
    for (arg_ct = ct; arg_ct < MAXARG - 1; ++arg_ct) {
	args[arg_ct] = (char *)bu_malloc(MAXLN, "getcmd buffer");
	if (! getarg(args[arg_ct], MAXLN))
	    break;
    }
    ++arg_ct;
    args[arg_ct] = 0;

    /* Before returning to command interpreter,
     * set up interrupt handler for commands...
     * trap interrupts such that command is aborted cleanly and
     * command line is restored rather than terminating program
     */
    (void) signal(SIGINT, abort_sig);
    return	(args[0])[0];
}



/**
 * Display menu stored at address 'addr'.
 */
void
menu(char **addr)
{
    char	**sbuf = addr;
    while (*sbuf)
	(void) printf("%s\n", *sbuf++);
    (void) fflush(stdout);
    return;
}


/**
 * Abort command without terminating run (restore command prompt) and
 * cleanup temporary files.
 */
void
abort_sig(int sig)
{
    (void) signal(SIGINT, quit);	/* reset trap */

    /* goto command interpreter with environment restored. */
    longjmp(env, sig);
}


/**
 * Terminate run.
 */
void
quit(int UNUSED(sig))
{
    (void) fprintf(stdout, "quitting...\n");
    bu_exit(0, NULL);
}

int
main(int argc, char *argv[])
{
    bu_setprogname(argv[0]);

    setbuf(stdout, (char *)bu_malloc(BUFSIZ, "stdout buffer"));
    BU_LIST_INIT(&(sol_hd.l));

    if (! parsArg(argc, argv)) {
	menu(usage);
	return 1;
    }

    /* Build directory from object file.	 	*/
    if (db_dirbuild(dbip) < 0) {
	fprintf(stderr, "db_dirbuild() failure\n");
	return 1;
    }

    toc();		/* Build table of contents from directory.	*/

    /***********************
     * Command Interpreter *
     ***********************/
    (void) setjmp(env);/* Point of re-entry from aborted command.	*/
    prompt(CMD_PROMPT);
    while (1) {
	/* Return to default interrupt handler after every command,
	   allows exit from program only while command interpreter
	   is waiting for input from keyboard.
	*/
	(void) signal(SIGINT, quit);

	switch (getcmd(arg_list, 0)) {
	    case DECK :
		deck(arg_list[1]);
		break;
	    case ERASE :
		while (curr_ct > 0)
		    bu_free(curr_list[--curr_ct], "curr_list[ct]");
		break;
	    case INSERT :
		if (arg_list[1] == 0) {
		    prompt("enter object[s] to insert: ");
		    (void) getcmd(arg_list, arg_ct);
		}
		(void) insert(arg_list, arg_ct);
		break;
	    case LIST :
		{
		    int	i;
		    if (arg_list[1] == 0) {
			(void) col_prt(curr_list, (size_t)curr_ct);
			break;
		    }
		    for (tmp_ct = 0, i = 0; i < curr_ct; i++)
			if (match(arg_list[1], curr_list[i]))
			    tmp_list[tmp_ct++] = curr_list[i];
		    (void) col_prt(tmp_list, tmp_ct);
		    break;
		}
	    case MENU :
		menu(cmd);
		prompt(PROMPT);
		continue;
	    case NUMBER :
		if (arg_list[1] == 0) {
		    prompt("enter number of 1st solid: ");
		    (void) getcmd(arg_list, arg_ct);
		    prompt("enter number of 1st region: ");
		    (void) getcmd(arg_list, arg_ct);
		}
		if (arg_list[1])
		    delsol = atoi(arg_list[1]) - 1;
		if (arg_list[2])
		    delreg = atoi(arg_list[2]) - 1;
		break;
	    case REMOVE :
		if (arg_list[1] == 0) {
		    prompt("enter object[s] to remove: ");
		    (void) getcmd(arg_list, arg_ct);
		}
		(void) delete_obj(arg_list);
		break;
	    case RETURN :
		prompt(PROMPT);
		continue;
	    case SORT_TOC :
		bu_sort((void *)toc_list, (unsigned)ndir,
			sizeof(char *), sortFunc, NULL);
		break;
	    case TOC :
		list_toc(arg_list);
		break;
	    case EOF :
	    case QUIT :
		(void) printf("quitting...\n");
		goto out;
	    default :
		(void) printf("Invalid command\n");
		prompt(PROMPT);
		continue;
	}
	prompt(CMD_PROMPT);
    }
out:
    return 0;
}



/*
 * Local Variables:
 * mode: C
 * tab-width: 8
 * indent-tabs-mode: t
 * c-file-style: "stroustrup"
 * End:
 * ex: shiftwidth=4 tabstop=8
 */
