1999-03-19 18:44:47 +01:00
|
|
|
|
/*
|
|
|
|
|
* File: boxes.c
|
|
|
|
|
* Date created: March 18, 1999 (Thursday, 15:09h)
|
|
|
|
|
* Author: Thomas Jensen
|
|
|
|
|
* tsjensen@stud.informatik.uni-erlangen.de
|
1999-04-01 19:26:18 +02:00
|
|
|
|
* Version: $Id: boxes.c,v 1.5 1999/03/31 17:34:21 tsjensen Exp tsjensen $
|
1999-03-19 18:44:47 +01:00
|
|
|
|
* Language: ANSI C
|
|
|
|
|
* Platforms: sunos5/sparc, for now
|
|
|
|
|
* World Wide Web: http://home.pages.de/~jensen/boxes/
|
|
|
|
|
* Purpose: Filter to draw boxes around input text.
|
|
|
|
|
* Intended for use with vim(1).
|
|
|
|
|
* Remarks: This is not a release.
|
|
|
|
|
*
|
|
|
|
|
* Revision History:
|
|
|
|
|
*
|
1999-03-30 11:36:23 +02:00
|
|
|
|
* $Log: boxes.c,v $
|
1999-04-01 19:26:18 +02:00
|
|
|
|
* Revision 1.5 1999/03/31 17:34:21 tsjensen
|
|
|
|
|
* ... still programming ...
|
|
|
|
|
* (some bug fixes and restructuring)
|
|
|
|
|
*
|
1999-03-31 19:34:21 +02:00
|
|
|
|
* Revision 1.4 1999/03/30 13:30:19 tsjensen
|
|
|
|
|
* Added minimum width/height for a design. Fixed screwed tiny boxes.
|
|
|
|
|
* Did not handle zero input.
|
|
|
|
|
*
|
1999-03-30 15:30:19 +02:00
|
|
|
|
* Revision 1.3 1999/03/30 09:36:23 tsjensen
|
|
|
|
|
* ... still programming ...
|
|
|
|
|
* (removed setlocale() call and locale.h include)
|
|
|
|
|
*
|
1999-03-30 11:36:23 +02:00
|
|
|
|
* Revision 1.2 1999/03/19 17:44:47 tsjensen
|
|
|
|
|
* ... still programming ...
|
|
|
|
|
*
|
|
|
|
|
* Revision 1.1 1999/03/18 15:09:17 tsjensen
|
1999-03-19 18:44:47 +01:00
|
|
|
|
* Initial revision
|
|
|
|
|
*
|
|
|
|
|
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
|
|
|
|
|
*/
|
|
|
|
|
|
1999-03-30 11:36:23 +02:00
|
|
|
|
/* #define DEBUG */
|
1999-03-19 18:44:47 +01:00
|
|
|
|
|
1999-04-01 19:26:18 +02:00
|
|
|
|
#include <errno.h>
|
1999-03-19 18:44:47 +01:00
|
|
|
|
#include <limits.h>
|
1999-03-18 16:08:57 +01:00
|
|
|
|
#include <stdarg.h>
|
|
|
|
|
#include <stdlib.h>
|
|
|
|
|
#include <stdio.h>
|
1999-03-30 11:36:23 +02:00
|
|
|
|
#include <string.h>
|
1999-03-18 16:08:57 +01:00
|
|
|
|
#include "boxes.h"
|
|
|
|
|
|
1999-03-30 11:36:23 +02:00
|
|
|
|
extern int snprintf (char *, size_t, const char *, ...); /* stdio.h */
|
|
|
|
|
extern int vsnprintf (char *, size_t, const char *, __va_list); /* stdio.h */
|
1999-03-18 16:08:57 +01:00
|
|
|
|
extern char *optarg; /* for getopt() */
|
1999-03-30 11:36:23 +02:00
|
|
|
|
extern int optind, opterr, optopt; /* for getopt() */
|
|
|
|
|
|
|
|
|
|
|
1999-04-01 19:26:18 +02:00
|
|
|
|
#ident "$Id: boxes.c,v 1.5 1999/03/31 17:34:21 tsjensen Exp tsjensen $"
|
1999-03-18 16:08:57 +01:00
|
|
|
|
|
|
|
|
|
extern FILE *yyin; /* lex input file */
|
|
|
|
|
|
1999-03-30 11:36:23 +02:00
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* default settings for command line options (MAY BE EDITED)
|
|
|
|
|
*/
|
|
|
|
|
#define DEF_TABSTOP 8 /* default tab stop distance (-t) */
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* max. allowed tab stop distance
|
|
|
|
|
*/
|
|
|
|
|
#define MAX_TABSTOP 16
|
|
|
|
|
|
|
|
|
|
/* max. supported line length
|
|
|
|
|
* This is how many characters of a line will be read. Anything beyond
|
|
|
|
|
* will be discarded. Output may be longer though. The line feed character
|
|
|
|
|
* at the end does not count.
|
|
|
|
|
* (This should have been done via sysconf(), but I didn't do it in order
|
|
|
|
|
* to ease porting to non-unix platforms.)
|
|
|
|
|
*/
|
|
|
|
|
#if defined(LINE_MAX) && (LINE_MAX < 1024)
|
|
|
|
|
#undef LINE_MAX
|
|
|
|
|
#endif
|
|
|
|
|
#ifndef LINE_MAX
|
|
|
|
|
#define LINE_MAX 2048
|
|
|
|
|
#endif
|
|
|
|
|
|
1999-03-19 18:44:47 +01:00
|
|
|
|
|
1999-03-18 16:08:57 +01:00
|
|
|
|
char *yyfilename = NULL; /* file name of config file used */
|
|
|
|
|
|
|
|
|
|
design_t *designs = NULL; /* available box designs */
|
|
|
|
|
|
|
|
|
|
int design_idx = 0; /* anz_designs-1 */
|
|
|
|
|
int anz_designs = 0; /* no of designs after parsing */
|
|
|
|
|
|
|
|
|
|
|
1999-03-19 18:44:47 +01:00
|
|
|
|
char *shape_name[] = {
|
|
|
|
|
"NW", "NNW", "N", "NNE", "NE", "ENE", "E", "ESE",
|
|
|
|
|
"SE", "SSE", "S", "SSW", "SW", "WSW", "W", "WNW"
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
char *ofs_name[] = {
|
|
|
|
|
"NW_NNW", "NNW_N", "N_NNE", "NNE_NE", "NE_ENE", "ENE_E", "E_ESE", "ESE_SE",
|
|
|
|
|
"SE_SSE", "SSE_S", "S_SSW", "SSW_SW", "SW_WSW", "WSW_W", "W_WNW", "WNW_NW"
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
shape_t north_side[SHAPES_PER_SIDE] = { NW, NNW, N, NNE, NE }; /* clockwise */
|
|
|
|
|
shape_t east_side[SHAPES_PER_SIDE] = { NE, ENE, E, ESE, SE };
|
|
|
|
|
shape_t south_side[SHAPES_PER_SIDE] = { SE, SSE, S, SSW, SW };
|
|
|
|
|
shape_t west_side[SHAPES_PER_SIDE] = { SW, WSW, W, WNW, NW };
|
|
|
|
|
shape_t corners[ANZ_CORNERS] = { NW, NE, SE, SW };
|
|
|
|
|
shape_t *sides[] = { north_side, east_side, south_side, west_side };
|
|
|
|
|
|
|
|
|
|
|
1999-04-01 19:26:18 +02:00
|
|
|
|
struct { /* Command line options: */
|
1999-03-30 11:36:23 +02:00
|
|
|
|
int l; /* list available designs */
|
|
|
|
|
int tabstop; /* tab stop distance */
|
|
|
|
|
design_t *design; /* currently used box design */
|
1999-04-01 19:26:18 +02:00
|
|
|
|
long reqwidth; /* requested box width (-s) */
|
|
|
|
|
long reqheight; /* requested box height (-s) */
|
|
|
|
|
char valign; /* text position inside box */
|
|
|
|
|
char halign; /* ('c', 'l', or 'r') */
|
1999-03-18 16:08:57 +01:00
|
|
|
|
} opt;
|
|
|
|
|
|
|
|
|
|
|
1999-03-30 11:36:23 +02:00
|
|
|
|
typedef struct {
|
|
|
|
|
size_t len;
|
|
|
|
|
char *text;
|
|
|
|
|
} line_t;
|
|
|
|
|
|
|
|
|
|
struct {
|
|
|
|
|
line_t *lines;
|
|
|
|
|
size_t anz_lines; /* number of entries in input */
|
|
|
|
|
size_t maxline; /* length of longest input line */
|
|
|
|
|
size_t indent; /* number of leading spaces found */
|
|
|
|
|
} input = {NULL, 0, 0, LINE_MAX};
|
|
|
|
|
|
|
|
|
|
|
1999-03-18 16:08:57 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
int yyerror (const char *fmt, ...)
|
1999-03-30 11:36:23 +02:00
|
|
|
|
/*
|
|
|
|
|
* Print configuration file parser errors.
|
|
|
|
|
*
|
|
|
|
|
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
|
|
|
|
|
*/
|
1999-03-18 16:08:57 +01:00
|
|
|
|
{
|
|
|
|
|
va_list ap;
|
|
|
|
|
char buf[1024];
|
|
|
|
|
|
|
|
|
|
va_start (ap, fmt);
|
|
|
|
|
snprintf (buf, 1024-1, "%s: %s: line %d: ", PROJECT,
|
|
|
|
|
yyfilename? yyfilename: "(null)", yylineno);
|
|
|
|
|
vsnprintf (buf+strlen(buf), 1024-strlen(buf)-1, fmt, ap);
|
|
|
|
|
strcat (buf, "\n");
|
|
|
|
|
(void) fprintf (stderr, buf);
|
|
|
|
|
va_end (ap);
|
|
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1999-03-30 11:36:23 +02:00
|
|
|
|
int iscorner (const shape_t s)
|
|
|
|
|
/*
|
|
|
|
|
* Return true if shape s is a corner.
|
|
|
|
|
*
|
|
|
|
|
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
|
|
|
|
|
*/
|
|
|
|
|
{
|
|
|
|
|
int i;
|
|
|
|
|
shape_t *p;
|
|
|
|
|
|
|
|
|
|
for (i=0, p=corners; i<ANZ_CORNERS; ++i, ++p) {
|
|
|
|
|
if (*p == s)
|
|
|
|
|
return 1;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
shape_t *on_side (const shape_t s, const int idx)
|
|
|
|
|
/*
|
|
|
|
|
* Compute the side that shape s is on.
|
|
|
|
|
*
|
|
|
|
|
* s shape to look for
|
|
|
|
|
* idx which occurence to return (0 == first, 1 == second (for corners)
|
|
|
|
|
*
|
|
|
|
|
* RETURNS: pointer to a side list on success
|
|
|
|
|
* NULL on error (e.g. idx==1 && s no corner)
|
|
|
|
|
*
|
|
|
|
|
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
|
|
|
|
|
*/
|
|
|
|
|
{
|
|
|
|
|
int side;
|
|
|
|
|
int i;
|
|
|
|
|
shape_t **sp;
|
|
|
|
|
shape_t *p;
|
|
|
|
|
int found = 0;
|
|
|
|
|
|
|
|
|
|
for (side=0,sp=sides; side<ANZ_SIDES; ++side,++sp) {
|
|
|
|
|
for (i=0,p=*sp; i<SHAPES_PER_SIDE; ++i,++p) {
|
|
|
|
|
if (*p == s) {
|
|
|
|
|
if (found == idx)
|
|
|
|
|
return *sp;
|
|
|
|
|
else
|
|
|
|
|
++found;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
int isempty (const sentry_t *shape)
|
|
|
|
|
/*
|
|
|
|
|
* Return true if shape is empty.
|
|
|
|
|
*
|
|
|
|
|
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
|
|
|
|
|
*/
|
|
|
|
|
{
|
|
|
|
|
if (shape == NULL)
|
|
|
|
|
return 1;
|
|
|
|
|
else if (shape->chars == NULL)
|
|
|
|
|
return 1;
|
|
|
|
|
else if (shape->width == 0 || shape->height == 0)
|
|
|
|
|
return 1;
|
|
|
|
|
else
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
int shapecmp (const sentry_t *shape1, const sentry_t *shape2)
|
|
|
|
|
/*
|
|
|
|
|
* Compare two shapes.
|
|
|
|
|
*
|
|
|
|
|
* RETURNS: == 0 if shapes are equal
|
|
|
|
|
* != 0 if shapes differ
|
|
|
|
|
*
|
|
|
|
|
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
|
|
|
|
|
*/
|
|
|
|
|
{
|
|
|
|
|
int e1 = isempty (shape1);
|
|
|
|
|
int e2 = isempty (shape2);
|
|
|
|
|
size_t i;
|
|
|
|
|
|
|
|
|
|
if ( e1 && e2) return 0;
|
|
|
|
|
if (!e1 && e2) return 1;
|
|
|
|
|
if ( e1 && !e2) return -1;
|
|
|
|
|
|
|
|
|
|
if (shape1->width != shape2->width || shape1->height != shape2->height) {
|
|
|
|
|
if (shape1->width * shape1->height > shape2->width * shape2->height)
|
|
|
|
|
return 1;
|
|
|
|
|
else
|
|
|
|
|
return -1;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
for (i=0; i<shape1->height; ++i) {
|
|
|
|
|
int c = strcmp (shape1->chars[i], shape2->chars[i]); /* no casecmp! */
|
|
|
|
|
if (c) return c;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
shape_t *both_on_side (const shape_t shape1, const shape_t shape2)
|
1999-03-19 18:44:47 +01:00
|
|
|
|
/*
|
|
|
|
|
* Compute the side that *both* shapes are on.
|
|
|
|
|
*
|
|
|
|
|
* RETURNS: pointer to a side list on success
|
|
|
|
|
* NULL on error (e.g. shape on different sides)
|
|
|
|
|
*
|
|
|
|
|
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
|
|
|
|
|
*/
|
|
|
|
|
{
|
|
|
|
|
int i, j, found;
|
|
|
|
|
|
|
|
|
|
for (i=0; i<ANZ_SIDES; ++i) {
|
|
|
|
|
found = 0;
|
|
|
|
|
for (j=0; j<SHAPES_PER_SIDE; ++j) {
|
|
|
|
|
if (sides[i][j] == shape1 || sides[i][j] == shape2)
|
|
|
|
|
++found;
|
|
|
|
|
if (found > 1) {
|
|
|
|
|
switch (i) {
|
|
|
|
|
case 0: return north_side;
|
|
|
|
|
case 1: return east_side;
|
|
|
|
|
case 2: return south_side;
|
|
|
|
|
case 3: return west_side;
|
|
|
|
|
default: return NULL;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
int shape_distance (const shape_t s1, const shape_t s2)
|
|
|
|
|
/*
|
|
|
|
|
* Compute distance between two shapes which are located on the same side
|
|
|
|
|
* of the box. E.g. shape_distance(NW,N) == 2.
|
|
|
|
|
*
|
|
|
|
|
* RETURNS: distance in steps if ok
|
|
|
|
|
* -1 on error
|
|
|
|
|
*
|
|
|
|
|
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
|
|
|
|
|
*/
|
|
|
|
|
{
|
|
|
|
|
int i;
|
|
|
|
|
int distance = -1;
|
1999-03-30 11:36:23 +02:00
|
|
|
|
shape_t *workside = both_on_side (s1, s2);
|
1999-03-19 18:44:47 +01:00
|
|
|
|
|
|
|
|
|
if (!workside) return -1;
|
|
|
|
|
if (s1 == s2) return 0;
|
|
|
|
|
|
|
|
|
|
for (i=0; i<SHAPES_PER_SIDE; ++i) {
|
|
|
|
|
if (workside[i] == s1 || workside[i] == s2) {
|
|
|
|
|
if (distance == -1)
|
|
|
|
|
distance = 0;
|
|
|
|
|
else if (distance > -1) {
|
|
|
|
|
++distance;
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
else {
|
|
|
|
|
if (distance > -1)
|
|
|
|
|
++distance;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (distance > 0 && distance < SHAPES_PER_SIDE)
|
|
|
|
|
return distance;
|
|
|
|
|
else
|
|
|
|
|
return -1;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1999-04-01 19:26:18 +02:00
|
|
|
|
static void usage (FILE *st)
|
1999-03-30 11:36:23 +02:00
|
|
|
|
/*
|
|
|
|
|
* Print usage information on stream st.
|
|
|
|
|
*
|
|
|
|
|
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
|
|
|
|
|
*/
|
1999-03-18 16:08:57 +01:00
|
|
|
|
{
|
|
|
|
|
fprintf (st, "Usage: %s [options] [infile [outfile]]\n", PROJECT);
|
1999-04-01 19:26:18 +02:00
|
|
|
|
fprintf (st, " -a fmt alignment/positioning of text inside box [default: hlvt]\n");
|
1999-03-30 11:36:23 +02:00
|
|
|
|
fprintf (st, " -d name select box design\n");
|
1999-03-18 16:08:57 +01:00
|
|
|
|
fprintf (st, " -f file use only file as configuration file\n");
|
|
|
|
|
fprintf (st, " -h usage information\n");
|
|
|
|
|
fprintf (st, " -l generate listing of available box designs w/ samples\n");
|
1999-04-01 19:26:18 +02:00
|
|
|
|
fprintf (st, " -s wxh specify box size (width w and/or height h)\n");
|
1999-03-30 11:36:23 +02:00
|
|
|
|
fprintf (st, " -t uint tab stop distance [default: %d]\n", DEF_TABSTOP);
|
1999-03-18 16:08:57 +01:00
|
|
|
|
fprintf (st, " -v print version information\n");
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1999-04-01 19:26:18 +02:00
|
|
|
|
static int process_commandline (int argc, char *argv[])
|
1999-03-30 11:36:23 +02:00
|
|
|
|
/*
|
|
|
|
|
*
|
|
|
|
|
*
|
|
|
|
|
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
|
|
|
|
|
*/
|
1999-03-18 16:08:57 +01:00
|
|
|
|
{
|
1999-04-01 19:26:18 +02:00
|
|
|
|
int oc; /* option character */
|
1999-03-18 16:08:57 +01:00
|
|
|
|
FILE *f; /* potential input file */
|
1999-04-01 19:26:18 +02:00
|
|
|
|
int idummy;
|
|
|
|
|
char *pdummy;
|
|
|
|
|
int errfl = 0; /* true on error */
|
1999-03-18 16:08:57 +01:00
|
|
|
|
|
|
|
|
|
memset (&opt, 0, sizeof(opt));
|
1999-03-30 11:36:23 +02:00
|
|
|
|
opt.tabstop = DEF_TABSTOP;
|
1999-03-18 16:08:57 +01:00
|
|
|
|
yyin = stdin;
|
|
|
|
|
|
|
|
|
|
do {
|
1999-04-01 19:26:18 +02:00
|
|
|
|
oc = getopt (argc, argv, "a:d:f:hls:t:v");
|
1999-03-18 16:08:57 +01:00
|
|
|
|
|
|
|
|
|
switch (oc) {
|
|
|
|
|
|
1999-04-01 19:26:18 +02:00
|
|
|
|
case 'a':
|
|
|
|
|
/*
|
|
|
|
|
* Alignment/positioning of text inside box
|
|
|
|
|
*/
|
|
|
|
|
errfl = 0;
|
|
|
|
|
pdummy = optarg;
|
|
|
|
|
while (*pdummy) {
|
|
|
|
|
if (pdummy[1] == '\0') {
|
|
|
|
|
errfl = 1;
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
switch (*pdummy) {
|
|
|
|
|
case 'h':
|
|
|
|
|
case 'H':
|
|
|
|
|
switch (pdummy[1]) {
|
|
|
|
|
case 'c': case 'C': opt.halign = 'c'; break;
|
|
|
|
|
case 'l': case 'L': opt.halign = 'l'; break;
|
|
|
|
|
case 'r': case 'R': opt.halign = 'r'; break;
|
|
|
|
|
default: errfl = 1; break;
|
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
case 'v':
|
|
|
|
|
case 'V':
|
|
|
|
|
switch (pdummy[1]) {
|
|
|
|
|
case 'c': case 'C': opt.valign = 'c'; break;
|
|
|
|
|
case 't': case 'T': opt.valign = 't'; break;
|
|
|
|
|
case 'b': case 'B': opt.valign = 'b'; break;
|
|
|
|
|
default: errfl = 1; break;
|
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
default:
|
|
|
|
|
errfl = 1;
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
if (errfl)
|
|
|
|
|
break;
|
|
|
|
|
else
|
|
|
|
|
pdummy += 2;
|
|
|
|
|
}
|
|
|
|
|
if (errfl) {
|
|
|
|
|
fprintf (stderr, "%s: Illegal text format -- %s\n",
|
|
|
|
|
PROJECT, optarg);
|
|
|
|
|
return 1;
|
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
|
1999-03-30 11:36:23 +02:00
|
|
|
|
case 'd':
|
|
|
|
|
/*
|
|
|
|
|
* Box design selection
|
|
|
|
|
*/
|
|
|
|
|
opt.design = (design_t *) ((char *) strdup (optarg));
|
|
|
|
|
if (opt.design == NULL) {
|
|
|
|
|
perror (PROJECT);
|
|
|
|
|
return 1;
|
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
|
1999-03-18 16:08:57 +01:00
|
|
|
|
case 'f':
|
|
|
|
|
/*
|
|
|
|
|
* Input File
|
|
|
|
|
*/
|
|
|
|
|
f = fopen (optarg, "r");
|
|
|
|
|
if (f == NULL) {
|
|
|
|
|
fprintf (stderr, "%s: Couldn\'t open config file \'%s\' "
|
|
|
|
|
"for input.\n", PROJECT, optarg);
|
|
|
|
|
return 1;
|
|
|
|
|
}
|
|
|
|
|
yyfilename = (char *) strdup (optarg);
|
1999-03-30 11:36:23 +02:00
|
|
|
|
if (yyfilename == NULL) {
|
|
|
|
|
perror (PROJECT);
|
|
|
|
|
return 1;
|
|
|
|
|
}
|
1999-03-18 16:08:57 +01:00
|
|
|
|
yyin = f;
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 'h':
|
|
|
|
|
/*
|
|
|
|
|
* Display usage information and terminate
|
|
|
|
|
*/
|
|
|
|
|
printf ("%s - draws boxes around your text\n", PROJECT);
|
|
|
|
|
printf (" (c) Thomas Jensen <tsjensen@stud.informatik.uni-erlangen.de>\n");
|
|
|
|
|
printf (" Web page: http://home.pages.de/~jensen/%s/\n", PROJECT);
|
|
|
|
|
usage (stdout);
|
|
|
|
|
return 42;
|
|
|
|
|
|
|
|
|
|
case 'l':
|
|
|
|
|
/*
|
|
|
|
|
* List available box styles
|
|
|
|
|
*/
|
|
|
|
|
opt.l = 1;
|
|
|
|
|
break;
|
|
|
|
|
|
1999-04-01 19:26:18 +02:00
|
|
|
|
case 's':
|
|
|
|
|
/*
|
|
|
|
|
* Specify desired box target size
|
|
|
|
|
*/
|
|
|
|
|
pdummy = strchr (optarg, 'x');
|
|
|
|
|
if (!pdummy) pdummy = strchr (optarg, 'X');
|
|
|
|
|
errno = 0;
|
|
|
|
|
opt.reqwidth = strtol (optarg, NULL, 10);
|
|
|
|
|
idummy = errno;
|
|
|
|
|
if (idummy) {
|
|
|
|
|
fprintf (stderr, "%s: invalid box size specification: %s\n",
|
|
|
|
|
PROJECT, strerror(idummy));
|
|
|
|
|
return 1;
|
|
|
|
|
}
|
|
|
|
|
if (pdummy) {
|
|
|
|
|
errno = 0;
|
|
|
|
|
opt.reqheight = strtol (pdummy+1, NULL, 10);
|
|
|
|
|
idummy = errno;
|
|
|
|
|
if (idummy) {
|
|
|
|
|
fprintf (stderr, "%s: invalid box size specification: %s\n",
|
|
|
|
|
PROJECT, strerror(idummy));
|
|
|
|
|
return 1;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
if ((opt.reqwidth == 0 && opt.reqheight == 0)
|
|
|
|
|
|| opt.reqwidth < 0 || opt.reqheight < 0) {
|
|
|
|
|
fprintf (stderr, "%s: invalid box size specification -- %s\n",
|
|
|
|
|
PROJECT, optarg);
|
|
|
|
|
return 1;
|
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
|
1999-03-30 11:36:23 +02:00
|
|
|
|
case 't':
|
|
|
|
|
/*
|
|
|
|
|
* Tab stop distance
|
|
|
|
|
*/
|
|
|
|
|
idummy = (int) strtol (optarg, NULL, 10);
|
|
|
|
|
if (idummy < 1 || idummy > MAX_TABSTOP) {
|
|
|
|
|
fprintf (stderr, "%s: invalid tab stop distance -- %d\n",
|
|
|
|
|
PROJECT, idummy);
|
|
|
|
|
return 1;
|
|
|
|
|
}
|
|
|
|
|
opt.tabstop = idummy;
|
|
|
|
|
break;
|
|
|
|
|
|
1999-03-18 16:08:57 +01:00
|
|
|
|
case 'v':
|
|
|
|
|
/*
|
|
|
|
|
* Print version number
|
|
|
|
|
*/
|
|
|
|
|
printf ("%s version %s\n", PROJECT, VERSION);
|
|
|
|
|
return 42;
|
|
|
|
|
|
|
|
|
|
case ':': case '?':
|
|
|
|
|
/*
|
|
|
|
|
* Missing argument or illegal option - do nothing else
|
|
|
|
|
*/
|
|
|
|
|
return 1;
|
|
|
|
|
|
|
|
|
|
case EOF:
|
|
|
|
|
/*
|
|
|
|
|
* End of list, do nothing more
|
|
|
|
|
*/
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
default: /* This case must never be */
|
|
|
|
|
fprintf (stderr, "%s: Uh-oh! This should have been "
|
|
|
|
|
"unreachable code. %%-)\n", PROJECT);
|
|
|
|
|
return 1;
|
|
|
|
|
}
|
|
|
|
|
} while (oc != EOF);
|
|
|
|
|
|
1999-03-19 18:44:47 +01:00
|
|
|
|
/*
|
|
|
|
|
* If no config file has been specified, try getting it from other
|
|
|
|
|
* locations. (1) contents of BOXES environment variable (2) file
|
|
|
|
|
* ~/.boxes. If neither file exists, complain and die.
|
|
|
|
|
*/
|
1999-03-18 16:08:57 +01:00
|
|
|
|
if (yyin == stdin) {
|
1999-03-19 18:44:47 +01:00
|
|
|
|
char *s = getenv ("BOXES");
|
|
|
|
|
if (s) {
|
|
|
|
|
f = fopen (s, "r");
|
|
|
|
|
if (f == NULL) {
|
|
|
|
|
fprintf (stderr, "%s: Couldn\'t open config file \'%s\' "
|
|
|
|
|
"for input (taken from environment).\n", PROJECT, s);
|
|
|
|
|
return 1;
|
|
|
|
|
}
|
|
|
|
|
yyfilename = (char *) strdup (s);
|
|
|
|
|
yyin = f;
|
|
|
|
|
}
|
|
|
|
|
else {
|
|
|
|
|
char buf[PATH_MAX]; /* to build file name */
|
|
|
|
|
s = getenv ("HOME");
|
|
|
|
|
if (s) {
|
|
|
|
|
strncpy (buf, s, PATH_MAX);
|
|
|
|
|
buf[PATH_MAX-1-7] = '\0'; /* ensure space for /.boxes */
|
|
|
|
|
strcat (buf, "/.boxes");
|
|
|
|
|
f = fopen (buf, "r");
|
|
|
|
|
if (f) {
|
|
|
|
|
yyfilename = (char *) strdup (buf);
|
|
|
|
|
yyin = f;
|
|
|
|
|
}
|
|
|
|
|
else {
|
|
|
|
|
fprintf (stderr, "%s: Could not find config file.\n",
|
|
|
|
|
PROJECT);
|
|
|
|
|
return 1;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
else {
|
|
|
|
|
fprintf (stderr, "%s: Environment variable HOME must point to "
|
|
|
|
|
"the user\'s home directory.\n", PROJECT);
|
|
|
|
|
return 1;
|
|
|
|
|
}
|
|
|
|
|
}
|
1999-03-18 16:08:57 +01:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
int style_sort (const void *p1, const void *p2)
|
|
|
|
|
{
|
|
|
|
|
return strcasecmp ((const char *) ((*((design_t **) p1))->name),
|
|
|
|
|
(const char *) ((*((design_t **) p2))->name));
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
int list_styles()
|
1999-03-30 11:36:23 +02:00
|
|
|
|
/*
|
|
|
|
|
* Generate sorted listing of available box styles.
|
|
|
|
|
* Uses design name from BOX spec and sample picture plus author.
|
|
|
|
|
*
|
|
|
|
|
* RETURNS: != 0 on error (out of memory)
|
|
|
|
|
* == 0 on success
|
|
|
|
|
*
|
|
|
|
|
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
|
|
|
|
|
*/
|
1999-03-18 16:08:57 +01:00
|
|
|
|
{
|
|
|
|
|
int i;
|
1999-03-30 11:36:23 +02:00
|
|
|
|
design_t **list; /* temp list for sorting */
|
1999-03-18 16:08:57 +01:00
|
|
|
|
|
|
|
|
|
list = (design_t **) calloc (design_idx+1, sizeof(design_t *));
|
|
|
|
|
if (list == NULL) return 1;
|
|
|
|
|
|
|
|
|
|
for (i=0; i<=design_idx; ++i)
|
|
|
|
|
list[i] = &(designs[i]);
|
|
|
|
|
qsort (list, design_idx+1, sizeof(design_t *), style_sort);
|
|
|
|
|
|
|
|
|
|
printf ("Available Styles:\n");
|
|
|
|
|
printf ("-----------------\n\n");
|
|
|
|
|
for (i=0; i<=design_idx; ++i)
|
|
|
|
|
printf ("%s (%s):\n\n%s\n\n", list[i]->name,
|
|
|
|
|
list[i]->author? list[i]->author: "unknown artist",
|
|
|
|
|
list[i]->sample);
|
|
|
|
|
|
1999-03-30 11:36:23 +02:00
|
|
|
|
BFREE (list);
|
|
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
static size_t expand_tabs_into (const char *input_buffer, const int in_len,
|
|
|
|
|
const int tabstop, char **text)
|
|
|
|
|
/*
|
|
|
|
|
* Expand tab chars in input_buffer and store result in text.
|
|
|
|
|
*
|
|
|
|
|
* input_buffer Line of text with tab chars
|
|
|
|
|
* in_len length of the string in input_buffer
|
|
|
|
|
* tabstop tab stop distance
|
|
|
|
|
* text address of the pointer that will take the result
|
|
|
|
|
*
|
|
|
|
|
* Memory will be allocated for the result.
|
|
|
|
|
* Should only be called for lines of length > 0;
|
|
|
|
|
*
|
|
|
|
|
* RETURNS: Success: Length of the result line in characters (> 0)
|
|
|
|
|
* Error: 0 (e.g. out of memory)
|
|
|
|
|
*
|
|
|
|
|
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
|
|
|
|
|
*/
|
|
|
|
|
{
|
|
|
|
|
static char temp [LINE_MAX*MAX_TABSTOP+1]; /* work string */
|
|
|
|
|
int ii; /* position in input string */
|
|
|
|
|
int io; /* position in work string */
|
|
|
|
|
int jp; /* tab expansion jump point */
|
|
|
|
|
|
|
|
|
|
*text = NULL;
|
|
|
|
|
|
|
|
|
|
for (ii=0, io=0; ii<in_len && io<(LINE_MAX*tabstop-1); ++ii) {
|
|
|
|
|
if (input_buffer[ii] == '\t') {
|
|
|
|
|
for (jp=io+tabstop-(io%tabstop); io<jp; ++io)
|
|
|
|
|
temp[io] = ' ';
|
|
|
|
|
}
|
|
|
|
|
else {
|
|
|
|
|
temp[io] = input_buffer[ii];
|
|
|
|
|
++io;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
temp[io] = '\0';
|
|
|
|
|
|
|
|
|
|
*text = (char *) strdup (temp);
|
|
|
|
|
if (*text == NULL) return 0;
|
|
|
|
|
|
|
|
|
|
return io;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
int read_all_input()
|
|
|
|
|
/*
|
|
|
|
|
* Read entire input from stdin and store it in 'input' array.
|
|
|
|
|
*
|
|
|
|
|
* Tabs are expanded.
|
|
|
|
|
* Might allocate slightly more memory than it needs. Trade-off for speed.
|
|
|
|
|
*
|
|
|
|
|
* RETURNS: != 0 on error (out of memory)
|
|
|
|
|
* == 0 on success
|
|
|
|
|
*
|
|
|
|
|
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
|
|
|
|
|
*/
|
|
|
|
|
{
|
|
|
|
|
char buf[LINE_MAX+2]; /* input buffer */
|
|
|
|
|
size_t input_size = 0; /* number of elements allocated */
|
|
|
|
|
line_t *tmp = NULL;
|
|
|
|
|
char *temp = NULL; /* string resulting from tab exp. */
|
|
|
|
|
size_t newlen; /* line length after tab expansion */
|
|
|
|
|
size_t i;
|
|
|
|
|
|
|
|
|
|
input.anz_lines = 0;
|
|
|
|
|
input.indent = LINE_MAX;
|
|
|
|
|
input.maxline = 0;
|
|
|
|
|
|
|
|
|
|
while (fgets (buf, LINE_MAX+1, stdin))
|
|
|
|
|
{
|
|
|
|
|
if (input_size % 100 == 0) {
|
|
|
|
|
input_size += 100;
|
|
|
|
|
tmp = (line_t *) realloc (input.lines, input_size*sizeof(line_t));
|
|
|
|
|
if (tmp == NULL) {
|
|
|
|
|
perror (PROJECT);
|
|
|
|
|
BFREE (input.lines);
|
|
|
|
|
return 1;
|
|
|
|
|
}
|
|
|
|
|
input.lines = tmp;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
input.lines[input.anz_lines].len = strlen (buf);
|
|
|
|
|
|
|
|
|
|
while (input.lines[input.anz_lines].len > 0 &&
|
|
|
|
|
(buf[input.lines[input.anz_lines].len-1] == '\n'
|
|
|
|
|
|| buf[input.lines[input.anz_lines].len-1] == '\r'
|
|
|
|
|
|| buf[input.lines[input.anz_lines].len-1] == ' '
|
|
|
|
|
|| buf[input.lines[input.anz_lines].len-1] == '\t'))
|
|
|
|
|
{
|
|
|
|
|
buf[input.lines[input.anz_lines].len-1] = '\0';
|
|
|
|
|
input.lines[input.anz_lines].len -= 1;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (input.lines[input.anz_lines].len > 0) {
|
|
|
|
|
newlen = expand_tabs_into (buf,
|
|
|
|
|
input.lines[input.anz_lines].len, opt.tabstop, &temp);
|
|
|
|
|
if (newlen == 0) {
|
|
|
|
|
perror (PROJECT);
|
|
|
|
|
BFREE (input.lines);
|
|
|
|
|
return 1;
|
|
|
|
|
}
|
|
|
|
|
input.lines[input.anz_lines].text = temp;
|
|
|
|
|
input.lines[input.anz_lines].len = newlen;
|
|
|
|
|
temp = NULL;
|
|
|
|
|
}
|
|
|
|
|
else {
|
|
|
|
|
input.lines[input.anz_lines].text = (char *) strdup (buf);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (input.lines[input.anz_lines].len > input.maxline)
|
|
|
|
|
input.maxline = input.lines[input.anz_lines].len;
|
|
|
|
|
|
|
|
|
|
if (input.lines[input.anz_lines].len > 0) {
|
|
|
|
|
size_t ispc;
|
|
|
|
|
ispc = strspn (input.lines[input.anz_lines].text, " ");
|
|
|
|
|
if (ispc < input.indent)
|
|
|
|
|
input.indent = ispc;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
++input.anz_lines;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (ferror (stdin)) {
|
|
|
|
|
perror (PROJECT);
|
|
|
|
|
BFREE (input.lines);
|
|
|
|
|
return 1;
|
|
|
|
|
}
|
|
|
|
|
|
1999-03-30 15:30:19 +02:00
|
|
|
|
/*
|
|
|
|
|
* Exit if there was no input at all
|
|
|
|
|
*/
|
|
|
|
|
if (input.lines == NULL || input.lines[0].text == NULL) {
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
1999-03-30 11:36:23 +02:00
|
|
|
|
/*
|
|
|
|
|
* Remove indentation
|
|
|
|
|
*/
|
|
|
|
|
for (i=0; i<input.anz_lines; ++i) {
|
|
|
|
|
if (input.lines[i].len >= input.indent) {
|
|
|
|
|
memmove (input.lines[i].text, input.lines[i].text+input.indent,
|
|
|
|
|
input.lines[i].len-input.indent+1);
|
|
|
|
|
input.lines[i].len -= input.indent;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
input.maxline -= input.indent;
|
|
|
|
|
|
|
|
|
|
#if 0
|
|
|
|
|
/*
|
|
|
|
|
* Debugging Code: Display contents of input structure
|
|
|
|
|
*/
|
|
|
|
|
for (i=0; i<input.anz_lines; ++i) {
|
|
|
|
|
fprintf (stderr, "%3d [%02d] \"%s\"\n", i, input.lines[i].len,
|
|
|
|
|
input.lines[i].text);
|
|
|
|
|
}
|
|
|
|
|
fprintf (stderr, "\nLongest line: %d characters.\n", input.maxline);
|
|
|
|
|
fprintf (stderr, " Indentation: %2d spaces.\n", input.indent);
|
|
|
|
|
#endif
|
1999-03-18 16:08:57 +01:00
|
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1999-03-30 11:36:23 +02:00
|
|
|
|
size_t highest (const sentry_t *sarr, const int n, ...)
|
|
|
|
|
/*
|
|
|
|
|
* Return height (vert.) of highest shape in given list.
|
|
|
|
|
*
|
|
|
|
|
* sarr array of shapes to examine
|
|
|
|
|
* n number of shapes following
|
|
|
|
|
* ... the shapes to consider
|
|
|
|
|
*
|
|
|
|
|
* RETURNS: height in lines (may be zero)
|
|
|
|
|
*
|
|
|
|
|
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
|
|
|
|
|
*/
|
|
|
|
|
{
|
|
|
|
|
va_list ap;
|
|
|
|
|
int i;
|
|
|
|
|
size_t max = 0; /* current maximum height */
|
|
|
|
|
|
1999-03-30 15:30:19 +02:00
|
|
|
|
#if defined(DEBUG) && 0
|
1999-03-30 11:36:23 +02:00
|
|
|
|
fprintf (stderr, "highest (%d, ...)\n", n);
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
va_start (ap, n);
|
|
|
|
|
|
|
|
|
|
for (i=0; i<n; ++i) {
|
|
|
|
|
shape_t r = va_arg (ap, shape_t);
|
|
|
|
|
if (!isempty (sarr + r)) {
|
|
|
|
|
if (sarr[r].height > max)
|
|
|
|
|
max = sarr[r].height;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
va_end (ap);
|
|
|
|
|
|
|
|
|
|
return max;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
size_t widest (const sentry_t *sarr, const int n, ...)
|
|
|
|
|
/*
|
|
|
|
|
* Return width (horiz.) of widest shape in given list.
|
|
|
|
|
*
|
|
|
|
|
* sarr array of shapes to examine
|
|
|
|
|
* n number of shapes following
|
|
|
|
|
* ... the shapes to consider
|
|
|
|
|
*
|
|
|
|
|
* RETURNS: width in chars (may be zero)
|
|
|
|
|
*
|
|
|
|
|
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
|
|
|
|
|
*/
|
|
|
|
|
{
|
|
|
|
|
va_list ap;
|
|
|
|
|
int i;
|
|
|
|
|
size_t max = 0; /* current maximum width */
|
|
|
|
|
|
|
|
|
|
#if defined(DEBUG) && 0
|
|
|
|
|
fprintf (stderr, "widest (%d, ...)\n", n);
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
va_start (ap, n);
|
|
|
|
|
|
|
|
|
|
for (i=0; i<n; ++i) {
|
|
|
|
|
shape_t r = va_arg (ap, shape_t);
|
|
|
|
|
if (!isempty (sarr + r)) {
|
|
|
|
|
if (sarr[r].width > max)
|
|
|
|
|
max = sarr[r].width;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
va_end (ap);
|
|
|
|
|
|
|
|
|
|
return max;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1999-03-31 19:34:21 +02:00
|
|
|
|
static int horiz_precalc (const sentry_t *sarr,
|
|
|
|
|
size_t *topiltf, size_t *botiltf, size_t *hspace)
|
1999-03-30 11:36:23 +02:00
|
|
|
|
/*
|
|
|
|
|
* Calculate data for horizontal box side generation.
|
|
|
|
|
*
|
|
|
|
|
* sarr Array of shapes from the current design
|
1999-03-31 19:34:21 +02:00
|
|
|
|
*
|
|
|
|
|
* topiltf RESULT: individual lines (columns) to fill by shapes 1, 2, and 3
|
|
|
|
|
* botiltf in top part of box (topiltf) and bottom part of box
|
1999-03-30 11:36:23 +02:00
|
|
|
|
* hspace RESULT: number of columns excluding corners (sum over iltf)
|
|
|
|
|
*
|
|
|
|
|
* RETURNS: == 0 on success (result values are set)
|
|
|
|
|
* != 0 on error
|
|
|
|
|
*
|
|
|
|
|
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
|
|
|
|
|
*/
|
|
|
|
|
{
|
1999-03-31 19:34:21 +02:00
|
|
|
|
int tnumsh; /* number of existent shapes in top part */
|
|
|
|
|
int bnumsh;
|
|
|
|
|
size_t twidth; /* current hspace for top side */
|
|
|
|
|
size_t bwidth; /* current hspace for bottom side */
|
1999-03-30 11:36:23 +02:00
|
|
|
|
int i;
|
1999-03-31 19:34:21 +02:00
|
|
|
|
size_t target_width; /* assumed text width for minimum box size */
|
|
|
|
|
int btoggle, ttoggle; /* for case 3 w/ 2 elastics */
|
1999-03-30 11:36:23 +02:00
|
|
|
|
|
1999-03-31 19:34:21 +02:00
|
|
|
|
/*
|
|
|
|
|
* Initialize future result values
|
|
|
|
|
*/
|
|
|
|
|
memset (topiltf, 0, (SHAPES_PER_SIDE-2) * sizeof(size_t));
|
|
|
|
|
memset (botiltf, 0, (SHAPES_PER_SIDE-2) * sizeof(size_t));
|
1999-03-30 11:36:23 +02:00
|
|
|
|
*hspace = 0;
|
|
|
|
|
|
1999-03-31 19:34:21 +02:00
|
|
|
|
/*
|
|
|
|
|
* Ensure minimum width for the insides of a box in order to ensure
|
|
|
|
|
* minimum box size required by current design
|
|
|
|
|
*/
|
|
|
|
|
if (input.maxline >= (opt.design->minwidth - sarr[north_side[0]].width -
|
|
|
|
|
sarr[north_side[SHAPES_PER_SIDE-1]].width)) {
|
1999-03-30 15:30:19 +02:00
|
|
|
|
target_width = input.maxline;
|
|
|
|
|
}
|
|
|
|
|
else {
|
1999-03-31 19:34:21 +02:00
|
|
|
|
target_width = opt.design->minwidth - sarr[north_side[0]].width -
|
|
|
|
|
sarr[north_side[SHAPES_PER_SIDE-1]].width;
|
1999-03-30 15:30:19 +02:00
|
|
|
|
}
|
|
|
|
|
|
1999-03-31 19:34:21 +02:00
|
|
|
|
/*
|
|
|
|
|
* Compute number of existent shapes in top and in bottom part
|
|
|
|
|
*/
|
|
|
|
|
tnumsh = 0; bnumsh = 0;
|
|
|
|
|
for (i=1; i<SHAPES_PER_SIDE-1; ++i) {
|
|
|
|
|
if (!isempty(sarr+north_side[i])) tnumsh++;
|
|
|
|
|
if (!isempty(sarr+south_side[i])) bnumsh++;
|
|
|
|
|
}
|
1999-03-30 11:36:23 +02:00
|
|
|
|
|
1999-04-01 19:26:18 +02:00
|
|
|
|
#ifdef DEBUG
|
|
|
|
|
fprintf (stderr, "in horiz_precalc:\n ");
|
|
|
|
|
fprintf (stderr, "opt.design->minwidth %d, input.maxline %d, target_width"
|
|
|
|
|
" %d, tnumsh %d, bnumsh %d\n", opt.design->minwidth,
|
|
|
|
|
input.maxline, target_width, tnumsh, bnumsh);
|
|
|
|
|
#endif
|
|
|
|
|
|
1999-03-31 19:34:21 +02:00
|
|
|
|
twidth = 0;
|
|
|
|
|
bwidth = 0;
|
1999-03-30 11:36:23 +02:00
|
|
|
|
|
1999-03-31 19:34:21 +02:00
|
|
|
|
btoggle = 1; /* can be 1 or 3 */
|
|
|
|
|
ttoggle = 1;
|
|
|
|
|
|
|
|
|
|
do {
|
|
|
|
|
shape_t *seite; /* ptr to north_side or south_side */
|
|
|
|
|
size_t *iltf; /* ptr to botiltf or topiltf */
|
|
|
|
|
size_t *res_hspace; /* ptr to bwidth or twidth */
|
|
|
|
|
int *stoggle; /* ptr to btoggle or ttoggle */
|
|
|
|
|
int numsh; /* either bnumsh or tnumsh */
|
|
|
|
|
|
1999-04-01 19:26:18 +02:00
|
|
|
|
/* FIXME Hier h<>ngt er sich auf "boxes -d parchment -s 1x1") */
|
|
|
|
|
|
1999-03-31 19:34:21 +02:00
|
|
|
|
/*
|
|
|
|
|
* Set pointers to the side which is currently shorter,
|
|
|
|
|
* so it will be advanced in this step.
|
|
|
|
|
*/
|
|
|
|
|
if (twidth > bwidth) { /* south (bottom) is behind */
|
|
|
|
|
seite = south_side;
|
|
|
|
|
iltf = botiltf;
|
|
|
|
|
res_hspace = &bwidth;
|
|
|
|
|
numsh = bnumsh;
|
|
|
|
|
stoggle = &btoggle;
|
|
|
|
|
}
|
|
|
|
|
else { /* north (top) is behind */
|
|
|
|
|
seite = north_side;
|
|
|
|
|
iltf = topiltf;
|
|
|
|
|
res_hspace = &twidth;
|
|
|
|
|
numsh = tnumsh;
|
|
|
|
|
stoggle = &ttoggle;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
switch (numsh) {
|
|
|
|
|
|
|
|
|
|
case 1:
|
|
|
|
|
/*
|
|
|
|
|
* only one shape -> it must be elastic
|
|
|
|
|
*/
|
|
|
|
|
for (i=1; i<SHAPES_PER_SIDE-1; ++i) {
|
|
|
|
|
if (!isempty(&(sarr[seite[i]]))) {
|
|
|
|
|
if (iltf[i-1] == 0 ||
|
|
|
|
|
*res_hspace < target_width ||
|
|
|
|
|
twidth != bwidth)
|
|
|
|
|
{
|
|
|
|
|
iltf[i-1] += sarr[seite[i]].width;
|
|
|
|
|
*res_hspace += sarr[seite[i]].width;
|
|
|
|
|
}
|
|
|
|
|
break;
|
1999-03-30 11:36:23 +02:00
|
|
|
|
}
|
|
|
|
|
}
|
1999-03-31 19:34:21 +02:00
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 2:
|
|
|
|
|
/*
|
|
|
|
|
* two shapes -> one must be elastic, the other must not
|
|
|
|
|
*/
|
|
|
|
|
for (i=1; i<SHAPES_PER_SIDE-1; ++i) {
|
|
|
|
|
if (!isempty (sarr+seite[i]) && !(sarr[seite[i]].elastic)) {
|
|
|
|
|
if (iltf[i-1] == 0) {
|
|
|
|
|
iltf[i-1] += sarr[seite[i]].width;
|
|
|
|
|
*res_hspace += sarr[seite[i]].width;
|
|
|
|
|
break;
|
|
|
|
|
}
|
1999-03-30 11:36:23 +02:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
for (i=1; i<SHAPES_PER_SIDE-1; ++i) {
|
1999-03-31 19:34:21 +02:00
|
|
|
|
if (!isempty (sarr+seite[i]) && sarr[seite[i]].elastic) {
|
|
|
|
|
if (iltf[i-1] == 0 ||
|
|
|
|
|
*res_hspace < target_width ||
|
|
|
|
|
twidth != bwidth)
|
|
|
|
|
{
|
1999-03-30 11:36:23 +02:00
|
|
|
|
iltf[i-1] += sarr[seite[i]].width;
|
1999-03-31 19:34:21 +02:00
|
|
|
|
*res_hspace += sarr[seite[i]].width;
|
1999-03-30 11:36:23 +02:00
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
}
|
1999-03-31 19:34:21 +02:00
|
|
|
|
break;
|
1999-03-30 11:36:23 +02:00
|
|
|
|
|
1999-03-31 19:34:21 +02:00
|
|
|
|
case 3:
|
|
|
|
|
/*
|
|
|
|
|
* three shapes -> one or two of them must be elastic
|
|
|
|
|
* If two are elastic, they are the two outer ones.
|
|
|
|
|
*/
|
|
|
|
|
for (i=1; i<SHAPES_PER_SIDE-1; ++i) {
|
|
|
|
|
if (!(sarr[seite[i]].elastic) && iltf[i-1] == 0) {
|
|
|
|
|
iltf[i-1] += sarr[seite[i]].width;
|
|
|
|
|
*res_hspace += sarr[seite[i]].width;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
if (sarr[seite[1]].elastic && sarr[seite[3]].elastic) {
|
|
|
|
|
if (iltf[*stoggle-1] == 0 ||
|
|
|
|
|
*res_hspace < target_width ||
|
|
|
|
|
twidth != bwidth)
|
|
|
|
|
{
|
|
|
|
|
*res_hspace += sarr[seite[*stoggle]].width;
|
|
|
|
|
iltf[*stoggle-1] += sarr[seite[*stoggle]].width;
|
|
|
|
|
}
|
|
|
|
|
*stoggle = *stoggle == 1? 3 : 1;
|
|
|
|
|
}
|
|
|
|
|
else {
|
|
|
|
|
for (i=1; i<SHAPES_PER_SIDE-1; ++i) {
|
|
|
|
|
if (sarr[seite[i]].elastic) {
|
|
|
|
|
if (iltf[i-1] == 0 ||
|
|
|
|
|
*res_hspace < target_width ||
|
|
|
|
|
twidth != bwidth)
|
|
|
|
|
{
|
|
|
|
|
iltf[i-1] += sarr[seite[i]].width;
|
|
|
|
|
*res_hspace += sarr[seite[i]].width;
|
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
default:
|
|
|
|
|
fprintf (stderr, "%s: internal error in horiz_precalc()\n", PROJECT);
|
|
|
|
|
return 1;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
} while (twidth != bwidth || twidth < target_width || bwidth < target_width);
|
|
|
|
|
|
|
|
|
|
*hspace = twidth; /* return either one */
|
1999-03-30 11:36:23 +02:00
|
|
|
|
|
|
|
|
|
return 0; /* all clear */
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1999-03-31 19:34:21 +02:00
|
|
|
|
static int vert_precalc (const sentry_t *sarr,
|
|
|
|
|
size_t *leftiltf, size_t *rightiltf, size_t *vspace)
|
1999-03-30 11:36:23 +02:00
|
|
|
|
/*
|
|
|
|
|
* Calculate data for vertical box side generation.
|
|
|
|
|
*
|
1999-03-31 19:34:21 +02:00
|
|
|
|
* sarr Array of shapes from the current design
|
|
|
|
|
*
|
|
|
|
|
* leftiltf RESULT: individual lines to fill by shapes 1, 2, and 3
|
|
|
|
|
* rightiltf in left part of box (leftiltf) and right part of box
|
|
|
|
|
* vspace RESULT: number of columns excluding corners (sum over iltf)
|
1999-03-30 11:36:23 +02:00
|
|
|
|
*
|
|
|
|
|
* RETURNS: == 0 on success (result values are set)
|
|
|
|
|
* != 0 on error
|
|
|
|
|
*
|
|
|
|
|
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
|
|
|
|
|
*/
|
|
|
|
|
{
|
1999-03-31 19:34:21 +02:00
|
|
|
|
int lnumsh; /* number of existent shapes in top part */
|
|
|
|
|
int rnumsh;
|
|
|
|
|
size_t lheight; /* current vspace for top side */
|
|
|
|
|
size_t rheight; /* current vspace for bottom side */
|
1999-03-30 11:36:23 +02:00
|
|
|
|
int i;
|
1999-03-31 19:34:21 +02:00
|
|
|
|
size_t target_height; /* assumed text height for minimum box size */
|
|
|
|
|
int rtoggle, ltoggle; /* for case 3 w/ 2 elastics */
|
1999-03-30 11:36:23 +02:00
|
|
|
|
|
1999-03-31 19:34:21 +02:00
|
|
|
|
/*
|
|
|
|
|
* Initialize future result values
|
|
|
|
|
*/
|
|
|
|
|
memset (leftiltf, 0, (SHAPES_PER_SIDE-2) * sizeof(size_t));
|
|
|
|
|
memset (rightiltf, 0, (SHAPES_PER_SIDE-2) * sizeof(size_t));
|
1999-03-30 11:36:23 +02:00
|
|
|
|
*vspace = 0;
|
|
|
|
|
|
1999-03-31 19:34:21 +02:00
|
|
|
|
/*
|
|
|
|
|
* Ensure minimum height for insides of box in order to ensure
|
|
|
|
|
* minimum box size required by current design
|
|
|
|
|
*/
|
|
|
|
|
if (input.anz_lines >= (opt.design->minheight - sarr[west_side[0]].height -
|
|
|
|
|
sarr[west_side[SHAPES_PER_SIDE-1]].height)) {
|
|
|
|
|
target_height = input.anz_lines;
|
|
|
|
|
}
|
1999-03-30 15:30:19 +02:00
|
|
|
|
else {
|
1999-03-31 19:34:21 +02:00
|
|
|
|
target_height = opt.design->minheight - sarr[west_side[0]].height -
|
|
|
|
|
sarr[west_side[SHAPES_PER_SIDE-1]].height;
|
1999-03-30 15:30:19 +02:00
|
|
|
|
}
|
|
|
|
|
|
1999-03-31 19:34:21 +02:00
|
|
|
|
/*
|
|
|
|
|
* Compute number of existent shapes in left and right part (1..3)
|
|
|
|
|
*/
|
|
|
|
|
lnumsh = 0; rnumsh = 0;
|
|
|
|
|
for (i=1; i<SHAPES_PER_SIDE-1; ++i) {
|
|
|
|
|
if (!isempty(sarr+west_side[i])) lnumsh++;
|
|
|
|
|
if (!isempty(sarr+east_side[i])) rnumsh++;
|
|
|
|
|
}
|
1999-03-30 11:36:23 +02:00
|
|
|
|
|
1999-03-31 19:34:21 +02:00
|
|
|
|
lheight = 0;
|
|
|
|
|
rheight = 0;
|
1999-03-30 11:36:23 +02:00
|
|
|
|
|
1999-03-31 19:34:21 +02:00
|
|
|
|
rtoggle = 1; /* can be 1 or 3 */
|
|
|
|
|
ltoggle = 1;
|
|
|
|
|
|
|
|
|
|
do {
|
|
|
|
|
shape_t *seite; /* ptr to west_side or east_side */
|
|
|
|
|
size_t *iltf; /* ptr to rightiltf or leftiltf */
|
|
|
|
|
size_t *res_vspace; /* ptr to rheight or lheight */
|
|
|
|
|
int *stoggle; /* ptr to rtoggle or ltoggle */
|
|
|
|
|
int numsh; /* either rnumsh or lnumsh */
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Set pointers to the side which is currently shorter,
|
|
|
|
|
* so it will be advanced in this step.
|
|
|
|
|
*/
|
|
|
|
|
if (lheight > rheight) { /* east (right) is behind */
|
|
|
|
|
seite = east_side;
|
|
|
|
|
iltf = rightiltf;
|
|
|
|
|
res_vspace = &rheight;
|
|
|
|
|
numsh = rnumsh;
|
|
|
|
|
stoggle = &rtoggle;
|
|
|
|
|
}
|
|
|
|
|
else { /* west (left) is behind */
|
|
|
|
|
seite = west_side;
|
|
|
|
|
iltf = leftiltf;
|
|
|
|
|
res_vspace = &lheight;
|
|
|
|
|
numsh = lnumsh;
|
|
|
|
|
stoggle = <oggle;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
switch (numsh) {
|
|
|
|
|
|
|
|
|
|
case 1:
|
|
|
|
|
/*
|
|
|
|
|
* only one shape -> it must be elastic
|
|
|
|
|
*/
|
|
|
|
|
for (i=1; i<SHAPES_PER_SIDE-1; ++i) {
|
|
|
|
|
if (!isempty(&(sarr[seite[i]]))) {
|
|
|
|
|
if (iltf[i-1] == 0 ||
|
|
|
|
|
*res_vspace < target_height ||
|
|
|
|
|
lheight != rheight)
|
|
|
|
|
{
|
|
|
|
|
iltf[i-1] += sarr[seite[i]].height;
|
|
|
|
|
*res_vspace += sarr[seite[i]].height;
|
|
|
|
|
}
|
|
|
|
|
break;
|
1999-03-30 11:36:23 +02:00
|
|
|
|
}
|
|
|
|
|
}
|
1999-03-31 19:34:21 +02:00
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 2:
|
|
|
|
|
/*
|
|
|
|
|
* two shapes -> one must be elastic, the other must not
|
|
|
|
|
*/
|
|
|
|
|
for (i=1; i<SHAPES_PER_SIDE-1; ++i) {
|
|
|
|
|
if (!isempty (sarr+seite[i]) && !(sarr[seite[i]].elastic)) {
|
|
|
|
|
if (iltf[i-1] == 0) {
|
|
|
|
|
iltf[i-1] += sarr[seite[i]].height;
|
|
|
|
|
*res_vspace += sarr[seite[i]].height;
|
|
|
|
|
break;
|
|
|
|
|
}
|
1999-03-30 11:36:23 +02:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
for (i=1; i<SHAPES_PER_SIDE-1; ++i) {
|
1999-03-31 19:34:21 +02:00
|
|
|
|
if (!isempty (sarr+seite[i]) && sarr[seite[i]].elastic) {
|
|
|
|
|
if (iltf[i-1] == 0 ||
|
|
|
|
|
*res_vspace < target_height ||
|
|
|
|
|
lheight != rheight)
|
|
|
|
|
{
|
1999-03-30 11:36:23 +02:00
|
|
|
|
iltf[i-1] += sarr[seite[i]].height;
|
1999-03-31 19:34:21 +02:00
|
|
|
|
*res_vspace += sarr[seite[i]].height;
|
1999-03-30 11:36:23 +02:00
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
}
|
1999-03-31 19:34:21 +02:00
|
|
|
|
break;
|
1999-03-30 11:36:23 +02:00
|
|
|
|
|
1999-03-31 19:34:21 +02:00
|
|
|
|
case 3:
|
|
|
|
|
/*
|
|
|
|
|
* three shapes -> one or two of them must be elastic
|
|
|
|
|
* If two are elastic, they are the two outer ones.
|
|
|
|
|
*/
|
|
|
|
|
for (i=1; i<SHAPES_PER_SIDE-1; ++i) {
|
|
|
|
|
if (!(sarr[seite[i]].elastic) && iltf[i-1] == 0) {
|
|
|
|
|
iltf[i-1] += sarr[seite[i]].height;
|
|
|
|
|
*res_vspace += sarr[seite[i]].height;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
if (sarr[seite[1]].elastic && sarr[seite[3]].elastic) {
|
|
|
|
|
if (iltf[*stoggle-1] == 0 ||
|
|
|
|
|
*res_vspace < target_height ||
|
|
|
|
|
lheight != rheight)
|
|
|
|
|
{
|
|
|
|
|
*res_vspace += sarr[seite[*stoggle]].height;
|
|
|
|
|
iltf[*stoggle-1] += sarr[seite[*stoggle]].height;
|
|
|
|
|
}
|
|
|
|
|
*stoggle = *stoggle == 1? 3 : 1;
|
|
|
|
|
}
|
|
|
|
|
else {
|
|
|
|
|
for (i=1; i<SHAPES_PER_SIDE-1; ++i) {
|
|
|
|
|
if (sarr[seite[i]].elastic) {
|
|
|
|
|
if (iltf[i-1] == 0 ||
|
|
|
|
|
*res_vspace < target_height ||
|
|
|
|
|
lheight != rheight)
|
|
|
|
|
{
|
|
|
|
|
iltf[i-1] += sarr[seite[i]].height;
|
|
|
|
|
*res_vspace += sarr[seite[i]].height;
|
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
default:
|
|
|
|
|
fprintf (stderr, "%s: internal error in vert_precalc()\n", PROJECT);
|
|
|
|
|
return 1;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
} while (lheight != rheight || lheight < target_height || rheight < target_height);
|
|
|
|
|
|
|
|
|
|
*vspace = lheight; /* return either one */
|
1999-03-30 11:36:23 +02:00
|
|
|
|
|
|
|
|
|
return 0; /* all clear */
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
static int vert_assemble (const sentry_t *sarr, const shape_t *seite,
|
|
|
|
|
size_t *iltf, sentry_t *result)
|
|
|
|
|
/*
|
|
|
|
|
*
|
|
|
|
|
* RETURNS: == 0 on success (result values are set)
|
|
|
|
|
* != 0 on error
|
|
|
|
|
*
|
|
|
|
|
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
|
|
|
|
|
*/
|
|
|
|
|
{
|
|
|
|
|
size_t j;
|
|
|
|
|
size_t line;
|
|
|
|
|
int cshape; /* current shape (idx to iltf) */
|
|
|
|
|
|
|
|
|
|
for (line=0; line<result->height; ++line) {
|
|
|
|
|
result->chars[line] = (char *) calloc (1, result->width+1);
|
|
|
|
|
if (result->chars[line] == NULL) {
|
|
|
|
|
perror (PROJECT);
|
|
|
|
|
if ((long)--line >= 0) do {
|
|
|
|
|
BFREE (result->chars[line--]);
|
|
|
|
|
} while ((long)line >= 0);
|
|
|
|
|
return 1; /* out of memory */
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
cshape = (seite == north_side)? 0 : 2;
|
|
|
|
|
|
|
|
|
|
for (j=0; j<result->width; j+=sarr[seite[cshape+1]].width) {
|
|
|
|
|
while (iltf[cshape] == 0)
|
|
|
|
|
cshape += (seite == north_side)? 1 : -1;
|
|
|
|
|
for (line=0; line<result->height; ++line)
|
|
|
|
|
strcat (result->chars[line], sarr[seite[cshape+1]].chars[line]);
|
|
|
|
|
iltf[cshape] -= sarr[seite[cshape+1]].width;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return 0; /* all clear */
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
static void horiz_assemble (const sentry_t *sarr, const shape_t *seite,
|
|
|
|
|
size_t *iltf, sentry_t *result)
|
|
|
|
|
{
|
|
|
|
|
size_t j;
|
|
|
|
|
size_t sc; /* index to shape chars (lines) */
|
|
|
|
|
int cshape; /* current shape (idx to iltf) */
|
|
|
|
|
shape_t ctop, cbottom;
|
|
|
|
|
|
|
|
|
|
if (seite == east_side) {
|
|
|
|
|
ctop = seite[0];
|
|
|
|
|
cbottom = seite[SHAPES_PER_SIDE-1];
|
|
|
|
|
cshape = 0;
|
|
|
|
|
}
|
|
|
|
|
else {
|
|
|
|
|
ctop = seite[SHAPES_PER_SIDE-1];
|
|
|
|
|
cbottom = seite[0];
|
|
|
|
|
cshape = 2;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
for (j=0; j<sarr[ctop].height; ++j)
|
|
|
|
|
result->chars[j] = sarr[ctop].chars[j];
|
|
|
|
|
for (j=0; j<sarr[cbottom].height; ++j)
|
|
|
|
|
result->chars[result->height-sarr[cbottom].height+j] =
|
|
|
|
|
sarr[cbottom].chars[j];
|
|
|
|
|
|
|
|
|
|
sc = 0;
|
|
|
|
|
for (j=sarr[ctop].height; j < result->height-sarr[cbottom].height; ++j)
|
|
|
|
|
{
|
|
|
|
|
while (iltf[cshape] == 0) {
|
|
|
|
|
if (seite == east_side)
|
|
|
|
|
++cshape;
|
|
|
|
|
else
|
|
|
|
|
--cshape;
|
|
|
|
|
sc = 0;
|
|
|
|
|
}
|
|
|
|
|
if (sc == sarr[seite[cshape+1]].height)
|
|
|
|
|
sc = 0;
|
|
|
|
|
result->chars[j] = sarr[seite[cshape+1]].chars[sc];
|
|
|
|
|
++sc;
|
|
|
|
|
iltf[cshape] -= 1;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1999-03-31 19:34:21 +02:00
|
|
|
|
static int horiz_generate (sentry_t *tresult, sentry_t *bresult)
|
1999-03-30 11:36:23 +02:00
|
|
|
|
/*
|
1999-03-31 19:34:21 +02:00
|
|
|
|
* Generate top and bottom parts of box (excluding corners).
|
1999-03-30 11:36:23 +02:00
|
|
|
|
*
|
1999-03-31 19:34:21 +02:00
|
|
|
|
* RETURNS: == 0 if successful (resulting char array is stored in [bt]result)
|
1999-03-30 11:36:23 +02:00
|
|
|
|
* != 0 on error
|
|
|
|
|
*
|
|
|
|
|
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
|
|
|
|
|
*/
|
|
|
|
|
{
|
1999-03-31 19:34:21 +02:00
|
|
|
|
size_t biltf[SHAPES_PER_SIDE-2]; /* individual lines to fill (bottom) */
|
|
|
|
|
size_t tiltf[SHAPES_PER_SIDE-2]; /* individual lines to fill (top) */
|
1999-03-30 11:36:23 +02:00
|
|
|
|
int rc; /* received return code */
|
|
|
|
|
|
1999-03-31 19:34:21 +02:00
|
|
|
|
tresult->height = highest (opt.design->shape,
|
1999-03-30 11:36:23 +02:00
|
|
|
|
SHAPES_PER_SIDE, NW, NNW, N, NNE, NE);
|
1999-03-31 19:34:21 +02:00
|
|
|
|
bresult->height = highest (opt.design->shape,
|
|
|
|
|
SHAPES_PER_SIDE, SW, SSW, S, SSE, SE);
|
1999-03-30 11:36:23 +02:00
|
|
|
|
|
1999-03-31 19:34:21 +02:00
|
|
|
|
rc = horiz_precalc (opt.design->shape, tiltf, biltf, &(tresult->width));
|
1999-03-30 11:36:23 +02:00
|
|
|
|
if (rc) return rc;
|
1999-03-31 19:34:21 +02:00
|
|
|
|
bresult->width = tresult->width;
|
1999-03-30 11:36:23 +02:00
|
|
|
|
|
|
|
|
|
#ifdef DEBUG
|
|
|
|
|
fprintf (stderr, "Top side box rect width %d, height %d.\n",
|
1999-03-31 19:34:21 +02:00
|
|
|
|
tresult->width, tresult->height);
|
|
|
|
|
fprintf (stderr, "Top columns to fill: %s %d, %s %d, %s %d.\n",
|
|
|
|
|
shape_name[north_side[1]], tiltf[0],
|
|
|
|
|
shape_name[north_side[2]], tiltf[1],
|
|
|
|
|
shape_name[north_side[3]], tiltf[2]);
|
|
|
|
|
fprintf (stderr, "Bottom side box rect width %d, height %d.\n",
|
|
|
|
|
bresult->width, bresult->height);
|
|
|
|
|
fprintf (stderr, "Bottom columns to fill: %s %d, %s %d, %s %d.\n",
|
|
|
|
|
shape_name[south_side[1]], biltf[0],
|
|
|
|
|
shape_name[south_side[2]], biltf[1],
|
|
|
|
|
shape_name[south_side[3]], biltf[2]);
|
1999-03-30 11:36:23 +02:00
|
|
|
|
#endif
|
|
|
|
|
|
1999-03-31 19:34:21 +02:00
|
|
|
|
tresult->chars = (char **) calloc (tresult->height, sizeof(char *));
|
|
|
|
|
bresult->chars = (char **) calloc (bresult->height, sizeof(char *));
|
|
|
|
|
if (tresult->chars == NULL || bresult->chars == NULL) return 1;
|
1999-03-30 11:36:23 +02:00
|
|
|
|
|
1999-03-31 19:34:21 +02:00
|
|
|
|
rc = vert_assemble (opt.design->shape, north_side, tiltf, tresult);
|
|
|
|
|
if (rc) return rc;
|
|
|
|
|
rc = vert_assemble (opt.design->shape, south_side, biltf, bresult);
|
1999-03-30 11:36:23 +02:00
|
|
|
|
if (rc) return rc;
|
|
|
|
|
|
|
|
|
|
#if defined(DEBUG) && 1
|
|
|
|
|
{
|
|
|
|
|
/*
|
1999-03-31 19:34:21 +02:00
|
|
|
|
* Debugging code - Output horizontal sides of box
|
1999-03-30 11:36:23 +02:00
|
|
|
|
*/
|
|
|
|
|
size_t j;
|
|
|
|
|
fprintf (stderr, "TOP SIDE:\n");
|
1999-03-31 19:34:21 +02:00
|
|
|
|
for (j=0; j<tresult->height; ++j) {
|
1999-03-30 11:36:23 +02:00
|
|
|
|
fprintf (stderr, " %2d: \'%s\'\n", j,
|
1999-03-31 19:34:21 +02:00
|
|
|
|
tresult->chars[j]? tresult->chars[j] : "(null)");
|
|
|
|
|
}
|
|
|
|
|
fprintf (stderr, "BOTTOM SIDE:\n");
|
|
|
|
|
for (j=0; j<bresult->height; ++j) {
|
|
|
|
|
fprintf (stderr, " %2d: \'%s\'\n", j,
|
|
|
|
|
bresult->chars[j]? bresult->chars[j] : "(null)");
|
1999-03-30 11:36:23 +02:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
return 0; /* all clear */
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1999-03-31 19:34:21 +02:00
|
|
|
|
static int vert_generate (sentry_t *lresult, sentry_t *rresult)
|
1999-03-30 11:36:23 +02:00
|
|
|
|
/*
|
1999-03-31 19:34:21 +02:00
|
|
|
|
* Generate vertical sides of box.
|
1999-03-30 11:36:23 +02:00
|
|
|
|
*
|
1999-03-31 19:34:21 +02:00
|
|
|
|
* RETURNS: == 0 on success (resulting char array is stored in [rl]result)
|
|
|
|
|
* != 0 on error
|
1999-03-30 11:36:23 +02:00
|
|
|
|
*
|
|
|
|
|
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
|
|
|
|
|
*/
|
|
|
|
|
{
|
|
|
|
|
size_t vspace = 0;
|
1999-03-31 19:34:21 +02:00
|
|
|
|
size_t leftiltf[SHAPES_PER_SIDE-2]; /* individual lines to fill */
|
|
|
|
|
size_t rightiltf[SHAPES_PER_SIDE-2]; /* individual lines to fill */
|
1999-03-30 11:36:23 +02:00
|
|
|
|
int rc; /* received return code */
|
|
|
|
|
|
1999-03-31 19:34:21 +02:00
|
|
|
|
lresult->width = widest (opt.design->shape,
|
|
|
|
|
SHAPES_PER_SIDE, SW, WSW, W, WNW, NW);
|
|
|
|
|
rresult->width = widest (opt.design->shape,
|
1999-03-30 11:36:23 +02:00
|
|
|
|
SHAPES_PER_SIDE, SE, ESE, E, ENE, NE);
|
|
|
|
|
|
1999-03-31 19:34:21 +02:00
|
|
|
|
rc = vert_precalc (opt.design->shape, leftiltf, rightiltf, &vspace);
|
1999-03-30 11:36:23 +02:00
|
|
|
|
if (rc) return rc;
|
|
|
|
|
|
1999-03-31 19:34:21 +02:00
|
|
|
|
lresult->height = vspace +
|
|
|
|
|
opt.design->shape[NW].height + opt.design->shape[SW].height;
|
|
|
|
|
rresult->height = vspace +
|
1999-03-30 11:36:23 +02:00
|
|
|
|
opt.design->shape[NE].height + opt.design->shape[SE].height;
|
|
|
|
|
|
|
|
|
|
#ifdef DEBUG
|
1999-03-31 19:34:21 +02:00
|
|
|
|
fprintf (stderr, "Left side box rect width %d, height %d, vspace %d.\n",
|
|
|
|
|
lresult->width, lresult->height, vspace);
|
|
|
|
|
fprintf (stderr, "Left lines to fill: %s %d, %s %d, %s %d.\n",
|
|
|
|
|
shape_name[west_side[1]], leftiltf[0],
|
|
|
|
|
shape_name[west_side[2]], leftiltf[1],
|
|
|
|
|
shape_name[west_side[3]], leftiltf[2]);
|
1999-03-30 11:36:23 +02:00
|
|
|
|
fprintf (stderr, "Right side box rect width %d, height %d, vspace %d.\n",
|
1999-03-31 19:34:21 +02:00
|
|
|
|
rresult->width, rresult->height, vspace);
|
1999-03-30 11:36:23 +02:00
|
|
|
|
fprintf (stderr, "Right lines to fill: %s %d, %s %d, %s %d.\n",
|
1999-03-31 19:34:21 +02:00
|
|
|
|
shape_name[east_side[1]], rightiltf[0],
|
|
|
|
|
shape_name[east_side[2]], rightiltf[1],
|
|
|
|
|
shape_name[east_side[3]], rightiltf[2]);
|
1999-03-30 11:36:23 +02:00
|
|
|
|
#endif
|
|
|
|
|
|
1999-03-31 19:34:21 +02:00
|
|
|
|
lresult->chars = (char **) calloc (lresult->height, sizeof(char *));
|
|
|
|
|
if (lresult->chars == NULL) return 1;
|
|
|
|
|
rresult->chars = (char **) calloc (rresult->height, sizeof(char *));
|
|
|
|
|
if (rresult->chars == NULL) return 1;
|
1999-03-30 11:36:23 +02:00
|
|
|
|
|
1999-03-31 19:34:21 +02:00
|
|
|
|
horiz_assemble (opt.design->shape, west_side, leftiltf, lresult);
|
|
|
|
|
horiz_assemble (opt.design->shape, east_side, rightiltf, rresult);
|
1999-03-30 11:36:23 +02:00
|
|
|
|
|
|
|
|
|
#if defined(DEBUG) && 1
|
|
|
|
|
{
|
|
|
|
|
/*
|
1999-03-31 19:34:21 +02:00
|
|
|
|
* Debugging code - Output left and right side of box
|
1999-03-30 11:36:23 +02:00
|
|
|
|
*/
|
|
|
|
|
size_t j;
|
1999-03-31 19:34:21 +02:00
|
|
|
|
fprintf (stderr, "LEFT SIDE:\n");
|
|
|
|
|
for (j=0; j<lresult->height; ++j) {
|
1999-03-30 11:36:23 +02:00
|
|
|
|
fprintf (stderr, " %2d: \'%s\'\n", j,
|
1999-03-31 19:34:21 +02:00
|
|
|
|
lresult->chars[j]? lresult->chars[j] : "(null)");
|
1999-03-30 11:36:23 +02:00
|
|
|
|
}
|
1999-03-31 19:34:21 +02:00
|
|
|
|
fprintf (stderr, "RIGHT SIDE:\n");
|
|
|
|
|
for (j=0; j<rresult->height; ++j) {
|
1999-03-30 11:36:23 +02:00
|
|
|
|
fprintf (stderr, " %2d: \'%s\'\n", j,
|
1999-03-31 19:34:21 +02:00
|
|
|
|
rresult->chars[j]? rresult->chars[j] : "(null)");
|
1999-03-30 11:36:23 +02:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
return 0; /* all clear */
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
static int generate_box (sentry_t *thebox)
|
|
|
|
|
/*
|
|
|
|
|
*
|
|
|
|
|
* RETURNS: == 0 if successful (thebox is set)
|
|
|
|
|
* != 0 on error
|
|
|
|
|
*
|
|
|
|
|
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
|
|
|
|
|
*/
|
|
|
|
|
{
|
|
|
|
|
int rc;
|
|
|
|
|
int i;
|
|
|
|
|
|
1999-03-31 19:34:21 +02:00
|
|
|
|
rc = horiz_generate (&(thebox[0]), &(thebox[2]));
|
1999-03-30 11:36:23 +02:00
|
|
|
|
if (rc) goto err;
|
|
|
|
|
|
1999-03-31 19:34:21 +02:00
|
|
|
|
rc = vert_generate (&(thebox[3]), &(thebox[1]));
|
1999-03-30 11:36:23 +02:00
|
|
|
|
if (rc) goto err;
|
|
|
|
|
|
|
|
|
|
return 0; /* all clear */
|
|
|
|
|
|
|
|
|
|
err:
|
|
|
|
|
for (i=0; i<ANZ_SIDES; ++i) {
|
|
|
|
|
if (!isempty(&(thebox[i]))) {
|
|
|
|
|
BFREE (thebox[i].chars); /* free only pointer array */
|
|
|
|
|
memset (thebox+i, 0, sizeof(sentry_t));
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
return rc; /* error */
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
static design_t *select_design (design_t *darr, char *sel)
|
|
|
|
|
/*
|
|
|
|
|
* Select a design to use for our box.
|
|
|
|
|
*
|
|
|
|
|
* darr design array as read from config file
|
|
|
|
|
* sel name of the desired design
|
|
|
|
|
*
|
|
|
|
|
* If the specified name is not found, defaults to "C" design;
|
|
|
|
|
* If "C" design is not found, default to design number 0;
|
|
|
|
|
* If there are no designs, print error message and return error.
|
|
|
|
|
*
|
|
|
|
|
* RETURNS: pointer to current design on success
|
|
|
|
|
* NULL on error
|
|
|
|
|
*
|
|
|
|
|
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
|
|
|
|
|
*/
|
|
|
|
|
{
|
|
|
|
|
int i;
|
|
|
|
|
|
|
|
|
|
if (sel) {
|
|
|
|
|
for (i=0; i<anz_designs; ++i) {
|
|
|
|
|
if (strcasecmp (darr[i].name, sel) == 0)
|
|
|
|
|
return &(darr[i]);
|
|
|
|
|
}
|
|
|
|
|
fprintf (stderr, "%s: unknown box design -- %s\n", PROJECT, sel);
|
|
|
|
|
return NULL;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
for (i=0; i<anz_designs; ++i) {
|
|
|
|
|
if (strcasecmp (darr[i].name, "C") == 0)
|
|
|
|
|
return &(darr[i]);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (darr[0].name != NULL)
|
|
|
|
|
return darr;
|
|
|
|
|
|
|
|
|
|
fprintf (stderr, "%s: Internal error -- no box designs found\n", PROJECT);
|
|
|
|
|
return NULL;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
static int output_box (const sentry_t *thebox)
|
|
|
|
|
/*
|
|
|
|
|
*
|
|
|
|
|
* RETURNS: == 0 if successful
|
|
|
|
|
* != 0 on error
|
|
|
|
|
*
|
|
|
|
|
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
|
|
|
|
|
*/
|
|
|
|
|
{
|
|
|
|
|
size_t j;
|
|
|
|
|
size_t nol = thebox[BRIG].height; /* number of output lines */
|
|
|
|
|
char trailspc[LINE_MAX+1];
|
|
|
|
|
char *indentspc;
|
1999-04-01 19:26:18 +02:00
|
|
|
|
size_t vfill, vfill1, vfill2; /* empty lines/columns in box */
|
|
|
|
|
size_t hfill;
|
|
|
|
|
char *hfill1, *hfill2; /* space before/after text */
|
|
|
|
|
size_t r;
|
1999-03-30 11:36:23 +02:00
|
|
|
|
|
1999-04-01 19:26:18 +02:00
|
|
|
|
/*
|
|
|
|
|
* Create string of spaces for indentation
|
|
|
|
|
*/
|
1999-03-30 11:36:23 +02:00
|
|
|
|
indentspc = (char *) malloc (input.indent+1);
|
|
|
|
|
if (indentspc == NULL) {
|
|
|
|
|
perror (PROJECT);
|
|
|
|
|
return 1;
|
|
|
|
|
}
|
|
|
|
|
memset (indentspc, (int)' ', input.indent);
|
|
|
|
|
indentspc[input.indent] = '\0';
|
|
|
|
|
|
1999-04-01 19:26:18 +02:00
|
|
|
|
/*
|
|
|
|
|
* Provide string of spaces for filling of space between text and
|
|
|
|
|
* right side of box
|
|
|
|
|
*/
|
1999-03-30 11:36:23 +02:00
|
|
|
|
memset (trailspc, (int)' ', LINE_MAX);
|
|
|
|
|
trailspc[LINE_MAX] = '\0';
|
|
|
|
|
|
1999-04-01 19:26:18 +02:00
|
|
|
|
/*
|
|
|
|
|
* Compute number of empty lines in box (vfill).
|
|
|
|
|
*/
|
|
|
|
|
vfill = nol - thebox[BTOP].height - thebox[BBOT].height - input.anz_lines;
|
|
|
|
|
if (opt.valign == 'c') {
|
|
|
|
|
vfill1 = vfill / 2;
|
|
|
|
|
vfill2 = vfill1 + ((vfill % 2)? 1 : 0);
|
|
|
|
|
}
|
|
|
|
|
else if (opt.valign == 'b') {
|
|
|
|
|
vfill1 = vfill;
|
|
|
|
|
vfill2 = 0;
|
|
|
|
|
}
|
|
|
|
|
else {
|
|
|
|
|
vfill1 = 0;
|
|
|
|
|
vfill2 = vfill;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Provide strings for horizontal text alignment.
|
|
|
|
|
*/
|
|
|
|
|
hfill = thebox[BTOP].width - input.maxline;
|
|
|
|
|
hfill1 = (char *) malloc (hfill+1);
|
|
|
|
|
hfill2 = (char *) malloc (hfill+1);
|
|
|
|
|
if (!hfill1 || !hfill2) {
|
|
|
|
|
perror (PROJECT);
|
|
|
|
|
return 1;
|
|
|
|
|
}
|
|
|
|
|
memset (hfill1, (int)' ', hfill+1);
|
|
|
|
|
memset (hfill2, (int)' ', hfill+1);
|
|
|
|
|
hfill1[hfill] = '\0';
|
|
|
|
|
hfill2[hfill] = '\0';
|
|
|
|
|
if (hfill == 0) {
|
|
|
|
|
hfill1[0] = '\0';
|
|
|
|
|
hfill2[0] = '\0';
|
|
|
|
|
}
|
|
|
|
|
else if (hfill == 1) {
|
|
|
|
|
if (opt.halign == 'r') {
|
|
|
|
|
hfill1[1] = '\0';
|
|
|
|
|
hfill2[0] = '\0';
|
|
|
|
|
}
|
|
|
|
|
else {
|
|
|
|
|
hfill1[0] = '\0';
|
|
|
|
|
hfill2[1] = '\0';
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
else {
|
|
|
|
|
if (opt.halign == 'c') {
|
|
|
|
|
hfill1[hfill/2] = '\0';
|
|
|
|
|
if (hfill % 2)
|
|
|
|
|
hfill2[hfill/2+1] = '\0';
|
|
|
|
|
else
|
|
|
|
|
hfill2[hfill/2] = '\0';
|
|
|
|
|
}
|
|
|
|
|
else if (opt.halign == 'r') {
|
|
|
|
|
hfill2[0] = '\0';
|
|
|
|
|
}
|
|
|
|
|
else {
|
|
|
|
|
hfill1[0] = '\0';
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
#if defined(DEBUG)
|
|
|
|
|
fprintf (stderr, "Alignment: hfill %d hfill1 %dx\' \' hfill2 %dx\' \' "
|
|
|
|
|
"vfill %d vfill1 %d vfill2 %d.\n", hfill, strlen(hfill1),
|
|
|
|
|
strlen(hfill2), vfill, vfill1, vfill2);
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Generate actual output
|
|
|
|
|
*/
|
1999-03-30 11:36:23 +02:00
|
|
|
|
for (j=0; j<nol; ++j) {
|
1999-04-01 19:26:18 +02:00
|
|
|
|
|
1999-03-30 11:36:23 +02:00
|
|
|
|
if (j < thebox[BTOP].height) {
|
|
|
|
|
printf ("%s%s%s%s\n", indentspc, thebox[BLEF].chars[j],
|
|
|
|
|
thebox[BTOP].chars[j], thebox[BRIG].chars[j]);
|
|
|
|
|
}
|
1999-04-01 19:26:18 +02:00
|
|
|
|
|
|
|
|
|
else if (vfill1) {
|
|
|
|
|
r = thebox[BTOP].width;
|
|
|
|
|
trailspc[r] = '\0';
|
|
|
|
|
printf ("%s%s%s%s\n", indentspc, thebox[BLEF].chars[j],
|
|
|
|
|
trailspc, thebox[BRIG].chars[j]);
|
|
|
|
|
trailspc[r] = ' ';
|
|
|
|
|
--vfill1;
|
|
|
|
|
}
|
|
|
|
|
|
1999-03-30 11:36:23 +02:00
|
|
|
|
else if (j < nol-thebox[BBOT].height) {
|
1999-04-01 19:26:18 +02:00
|
|
|
|
long ti = j - thebox[BTOP].height - (vfill-vfill2);
|
1999-03-30 11:36:23 +02:00
|
|
|
|
if (ti < (long) input.anz_lines) {
|
1999-04-01 19:26:18 +02:00
|
|
|
|
r = input.maxline - input.lines[ti].len;
|
1999-03-30 11:36:23 +02:00
|
|
|
|
trailspc[r] = '\0';
|
1999-04-01 19:26:18 +02:00
|
|
|
|
printf ("%s%s%s%s%s%s%s\n", indentspc, thebox[BLEF].chars[j],
|
|
|
|
|
hfill1, ti >= 0? input.lines[ti].text : "", hfill2,
|
1999-03-30 11:36:23 +02:00
|
|
|
|
trailspc, thebox[BRIG].chars[j]);
|
|
|
|
|
}
|
|
|
|
|
else {
|
|
|
|
|
r = thebox[BTOP].width;
|
|
|
|
|
trailspc[r] = '\0';
|
|
|
|
|
printf ("%s%s%s%s\n", indentspc, thebox[BLEF].chars[j],
|
|
|
|
|
trailspc, thebox[BRIG].chars[j]);
|
|
|
|
|
}
|
|
|
|
|
trailspc[r] = ' ';
|
|
|
|
|
}
|
1999-04-01 19:26:18 +02:00
|
|
|
|
|
1999-03-30 11:36:23 +02:00
|
|
|
|
else {
|
|
|
|
|
printf ("%s%s%s%s\n", indentspc, thebox[BLEF].chars[j],
|
|
|
|
|
thebox[BBOT].chars[j-(nol-thebox[BBOT].height)],
|
|
|
|
|
thebox[BRIG].chars[j]);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
BFREE (indentspc);
|
1999-04-01 19:26:18 +02:00
|
|
|
|
BFREE (hfill1);
|
|
|
|
|
BFREE (hfill2);
|
1999-03-30 11:36:23 +02:00
|
|
|
|
return 0; /* all clear */
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1999-03-18 16:08:57 +01:00
|
|
|
|
int main (int argc, char *argv[])
|
|
|
|
|
{
|
|
|
|
|
extern int yyparse();
|
|
|
|
|
int rc; /* general return code */
|
1999-03-30 11:36:23 +02:00
|
|
|
|
design_t *tmp;
|
|
|
|
|
sentry_t *thebox;
|
|
|
|
|
|
1999-04-01 19:26:18 +02:00
|
|
|
|
#ifdef DEBUG
|
|
|
|
|
fprintf (stderr, "BOXES STARTING ...\n");
|
|
|
|
|
#endif
|
|
|
|
|
|
1999-03-30 11:36:23 +02:00
|
|
|
|
thebox = (sentry_t *) calloc (ANZ_SIDES, sizeof(sentry_t));
|
|
|
|
|
if (thebox == NULL) {
|
|
|
|
|
perror (PROJECT);
|
|
|
|
|
exit (EXIT_FAILURE);
|
|
|
|
|
}
|
1999-03-18 16:08:57 +01:00
|
|
|
|
|
1999-04-01 19:26:18 +02:00
|
|
|
|
#ifdef DEBUG
|
|
|
|
|
fprintf (stderr, "Processing Comand Line ...\n");
|
|
|
|
|
#endif
|
|
|
|
|
|
1999-03-18 16:08:57 +01:00
|
|
|
|
rc = process_commandline (argc, argv);
|
|
|
|
|
if (rc == 42) exit (EXIT_SUCCESS);
|
|
|
|
|
if (rc) exit (EXIT_FAILURE);
|
|
|
|
|
|
|
|
|
|
designs = (design_t *) calloc (1, sizeof(design_t));
|
|
|
|
|
if (designs == NULL) {
|
|
|
|
|
perror (PROJECT);
|
|
|
|
|
exit (EXIT_FAILURE);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* If the following parser is one created by lex, the application must
|
|
|
|
|
* be careful to ensure that LC_CTYPE and LC_COLLATE are set to the
|
|
|
|
|
* POSIX locale.
|
|
|
|
|
*/
|
1999-04-01 19:26:18 +02:00
|
|
|
|
#ifdef DEBUG
|
|
|
|
|
fprintf (stderr, "Parsing Config File ...\n");
|
|
|
|
|
#endif
|
1999-03-18 16:08:57 +01:00
|
|
|
|
rc = yyparse();
|
|
|
|
|
if (rc) exit (EXIT_FAILURE);
|
1999-03-30 11:36:23 +02:00
|
|
|
|
BFREE (yyfilename);
|
1999-03-18 16:08:57 +01:00
|
|
|
|
--design_idx;
|
|
|
|
|
tmp = (design_t *) realloc (designs, (design_idx+1)*sizeof(design_t));
|
|
|
|
|
if (tmp) {
|
|
|
|
|
designs = tmp; /* yyparse() allocates space */
|
|
|
|
|
} /* for one design too much */
|
|
|
|
|
else {
|
|
|
|
|
perror (PROJECT);
|
|
|
|
|
exit (EXIT_FAILURE);
|
|
|
|
|
}
|
|
|
|
|
anz_designs = design_idx + 1;
|
|
|
|
|
|
1999-04-01 19:26:18 +02:00
|
|
|
|
#ifdef DEBUG
|
|
|
|
|
fprintf (stderr, "Selecting Design ...\n");
|
|
|
|
|
#endif
|
1999-03-30 11:36:23 +02:00
|
|
|
|
tmp = select_design (designs, (char *) opt.design);
|
|
|
|
|
if (tmp == NULL) exit (EXIT_FAILURE);
|
|
|
|
|
BFREE (opt.design);
|
|
|
|
|
opt.design = tmp;
|
1999-03-18 16:08:57 +01:00
|
|
|
|
|
|
|
|
|
if (opt.l) {
|
|
|
|
|
rc = list_styles();
|
|
|
|
|
if (rc) {
|
|
|
|
|
perror (PROJECT);
|
|
|
|
|
exit (EXIT_FAILURE);
|
|
|
|
|
}
|
|
|
|
|
exit (EXIT_SUCCESS);
|
|
|
|
|
}
|
|
|
|
|
|
1999-04-01 19:26:18 +02:00
|
|
|
|
#ifdef DEBUG
|
|
|
|
|
fprintf (stderr, "Reading all input ...\n");
|
|
|
|
|
#endif
|
1999-03-30 11:36:23 +02:00
|
|
|
|
rc = read_all_input();
|
|
|
|
|
if (rc) exit (EXIT_FAILURE);
|
1999-03-30 15:30:19 +02:00
|
|
|
|
if (input.anz_lines == 0)
|
|
|
|
|
exit (EXIT_SUCCESS);
|
1999-03-30 11:36:23 +02:00
|
|
|
|
|
1999-04-01 19:26:18 +02:00
|
|
|
|
if (opt.reqheight > (long) opt.design->minheight)
|
|
|
|
|
opt.design->minheight = opt.reqheight;
|
|
|
|
|
if (opt.reqwidth > (long) opt.design->minwidth)
|
|
|
|
|
opt.design->minwidth = opt.reqwidth;
|
|
|
|
|
|
|
|
|
|
#ifdef DEBUG
|
|
|
|
|
fprintf (stderr, "Generating Box ...\n");
|
|
|
|
|
#endif
|
1999-03-30 11:36:23 +02:00
|
|
|
|
rc = generate_box (thebox);
|
|
|
|
|
if (rc) exit (EXIT_FAILURE);
|
|
|
|
|
|
1999-04-01 19:26:18 +02:00
|
|
|
|
#ifdef DEBUG
|
|
|
|
|
fprintf (stderr, "Generating Output ...\n");
|
|
|
|
|
#endif
|
1999-03-30 11:36:23 +02:00
|
|
|
|
output_box (thebox);
|
1999-03-18 16:08:57 +01:00
|
|
|
|
|
|
|
|
|
return EXIT_SUCCESS;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/*EOF*/ /* vim: set sw=4: */
|