Mercurial > hg > minc-tools
changeset 1355:9fd60fbae61e
Initial version of minccalc as received from Andrew Janke with updates
to match changes in mincmath (-filelist option) as well as cosmetic
and packaging changes.
| author | neelin <neelin> |
|---|---|
| date | Tue, 24 Apr 2001 18:14:03 +0000 |
| parents | 82d943095121 |
| children | 10418647baac |
| files | progs/minccalc/Makefile progs/minccalc/errx.h progs/minccalc/eval.c progs/minccalc/gram.c progs/minccalc/gram.y progs/minccalc/ident.c progs/minccalc/lex.c progs/minccalc/lex.l progs/minccalc/minccalc.c progs/minccalc/minccalc.man1 progs/minccalc/node.c progs/minccalc/node.h progs/minccalc/optim.c progs/minccalc/sym.c progs/minccalc/vector.c progs/minccalc/y.tab.h |
| diffstat | 16 files changed, 3646 insertions(+), 0 deletions(-) [+] |
line wrap: on
line diff
new file mode 100644 --- /dev/null +++ b/progs/minccalc/Makefile @@ -0,0 +1,25 @@ +# -------------------------------------------------------------------- +# +# MINC Makefile +# + +ROOT = ../.. +include $(ROOT)/Make_machine_specific +include $(ROOT)/Make_configuration + +LEX= flex +YFLAGS= -d -t + +.PRECIOUS: gram.c + +# Executable names +PROGS = minccalc +EXTRA_OBJS = vector.o eval.o ident.o sym.o node.o gram.o lex.o optim.o +HEADERS = node.h errx.h +CDEFINES = -DDEBUG # cpp defines +LDOPT = $(PROG_LDOPT) +MANSECT = 1 +MANPAGES = $(PROGS).$(MANSECT) + +include $(ROOT)/progs/Make_progs +
new file mode 100644 --- /dev/null +++ b/progs/minccalc/errx.h @@ -0,0 +1,12 @@ +/* Just in case you don't have errx, but you have gcc */ + +#if !defined(__OpenBSD__) && defined(__GNUC__) +# define errx(exitcode, fmt , args) \ + do { fprintf(stderr, "imgcalc: " fmt "\n", ## args ); exit(1); } while(0) +# define err(exitcode, fmt , args) \ + do { fprintf(stderr, "imgcalc: " fmt , ## args ); \ + fprintf(stderr, ": %s\n", strerror(errno)); exit(1); } while(0) +#else +# include <errno.h> +#endif +
new file mode 100644 --- /dev/null +++ b/progs/minccalc/eval.c @@ -0,0 +1,234 @@ +/* Copyright David Leonard & Andrew Janke, 2000. All rights reserved. */ + +#include <stdio.h> +#include <math.h> +#include "node.h" + +scalar_t eval_index(node_t, vector_t, scalar_t); +scalar_t eval_sum(node_t, vector_t); +vector_t eval_vector(node_t, sym_t); +vector_t gen_vector(node_t, sym_t); +vector_t gen_range(node_t, sym_t); + +void eval_error(node_t n, const char *msg){ + int pos = n->pos; + show_error(pos, msg); +} + +void show_error(int pos, const char *msg){ + extern const char *expression; + const char *c; + + if (pos != -1) { + fprintf(stderr, "%s\n", expression); + for (c = expression; *c; c++) { + if (pos-- == 0) + break; + if (*c == '\t') fprintf(stderr, "\t"); + else fprintf(stderr, " "); + } + fprintf(stderr, "^\n"); + } + fprintf(stderr, "%s\n", msg); + exit(1); + } + +/* Try to evaluate an expression in a scalar context */ +scalar_t eval_scalar(node_t n, sym_t sym){ + vector_t v; + scalar_t s; + sym_t y; + + switch (n->type) { + case NODETYPE_ADD: + return eval_scalar(n->expr[0], sym) + eval_scalar(n->expr[1], sym); + + case NODETYPE_SUB: + return eval_scalar(n->expr[0], sym) - eval_scalar(n->expr[1], sym); + + case NODETYPE_MUL: + return eval_scalar(n->expr[0], sym) * eval_scalar(n->expr[1], sym); + + case NODETYPE_DIV: + return eval_scalar(n->expr[0], sym) / eval_scalar(n->expr[1], sym); + + case NODETYPE_EXP: + return pow(eval_scalar(n->expr[0], sym), + eval_scalar(n->expr[1], sym)); + + case NODETYPE_INDEX: + v = eval_vector(n->expr[0], sym); + s = eval_index(n, v, eval_scalar(n->expr[1], sym)); + vector_free(v); + return s; + + case NODETYPE_SUM: + v = eval_vector(n->expr[0], sym); + s = eval_sum(n, v); + vector_free(v); + return s; + + case NODETYPE_AVG: + v = eval_vector(n->expr[0], sym); + s = eval_sum(n, v) / (scalar_t)v->len; + vector_free(v); + return s; + + case NODETYPE_LEN: + v = eval_vector(n->expr[0], sym); + s = (scalar_t) v->len; + vector_free(v); + return s; + + case NODETYPE_IDENT: + return sym_lookup_scalar(n->ident, sym); + + case NODETYPE_REAL: + return n->real; + + case NODETYPE_LET: + if (ident_is_scalar(n->ident)) { + y = sym_enter_scalar( + eval_scalar(n->expr[0], sym), n->ident, sym); + s = eval_scalar(n->expr[1], y); + sym_leave(y); + return s; + } else { + v = eval_vector(n->expr[0], sym); + y = sym_enter_vector(v, n->ident, sym); + s = eval_scalar(n->expr[1], y); + sym_leave(y); + vector_free(v); + return s; + } + + default: + eval_error(n, "expected a scalar value"); + /* NOTREACHED */ + return 0; + } +} + +/* Index into a vector */ +scalar_t eval_index(node_t n, vector_t v, scalar_t i){ + int idx = SCALAR_ROUND(i); + if (idx < 0 || idx > v->len) + eval_error(n, "index out of bounds"); + return v->el[idx]; +} + +/* Perform a sum over the arguments */ +scalar_t eval_sum(node_t n, vector_t v){ + int i; + scalar_t result; + + result = 0; + for (i = 0; i < v->len; i++) + result += eval_index(n, v, i); + return result; +} + +/* Evaluate an expression in a vector context */ +vector_t eval_vector(node_t n, sym_t sym){ + vector_t v, v2; + scalar_t s; + sym_t y; + + switch (n->type) { + case NODETYPE_LET: + if (ident_is_scalar(n->ident)) { + y = sym_enter_scalar(eval_scalar(n->expr[0], sym), + n->ident, sym); + v = eval_vector(n->expr[1], y); + sym_leave(y); + return v; + } else { + v2 = eval_vector(n->expr[0], sym); + y = sym_enter_vector(v2, n->ident, sym); + v = eval_vector(n->expr[1], y); + sym_leave(y); + vector_free(v2); + return v; + } + + case NODETYPE_VEC2: + v = eval_vector(n->expr[0], sym); + s = eval_scalar(n->expr[1], sym); + vector_append(v, s); + return v; + + case NODETYPE_VEC1: + s = eval_scalar(n->expr[0], sym); + v = new_vector(); + vector_append(v, s); + return v; + + case NODETYPE_GEN: + return gen_vector(n, sym); + + case NODETYPE_RANGE: + return gen_range(n, sym); + + case NODETYPE_IDENT: + v = sym_lookup_vector(n->ident, sym); + if (v) { + v->refcnt++; + return v; + } + /* fallthrough */ + default: + /* XXX coerce scalar to vector! */ + v = new_vector(); + vector_append(v, eval_scalar(n, sym)); + return v; + } +} + +/* Generate a vector */ +vector_t gen_vector(node_t n, sym_t sym){ + int i; + scalar_t value; + ident_t ident; + node_t expr; + sym_t s; + vector_t v; + vector_t els; + + ident = n->ident; + if (!ident_is_scalar(ident)) + eval_error(n, "expected scalar (lowercase) index as 1st arg"); + els = eval_vector(n->expr[0], sym); + expr = n->expr[1]; + v = new_vector(); + + for (i = 0; i < els->len; i++) { + s = sym_enter_scalar((scalar_t)i, ident, sym); + value = eval_scalar(expr, s); + sym_leave(s); + vector_append(v, value); + } + return v; +} + +vector_t gen_range(node_t n, sym_t sym){ + int i; + scalar_t start; + scalar_t stop; + vector_t v; + + v = new_vector(); + start = SCALAR_ROUND(eval_scalar(n->expr[0], sym)); + stop = SCALAR_ROUND(eval_scalar(n->expr[1], sym)); + + if (!(n->flags & RANGE_EXACT_LOWER)) + start++; + if (!(n->flags & RANGE_EXACT_UPPER)) + stop--; + + for (i = start; i <= stop; i++) { + vector_append(v, (scalar_t)i); + } + + return v; + +}
new file mode 100644 --- /dev/null +++ b/progs/minccalc/gram.c @@ -0,0 +1,624 @@ +#ifndef lint +static char yysccsid[] = "@(#)yaccpar 1.9 (Berkeley) 02/21/93"; +#endif +#define YYBYACC 1 +#define YYMAJOR 1 +#define YYMINOR 9 +#define yyclearin (yychar=(-1)) +#define yyerrok (yyerrflag=0) +#define YYRECOVERING (yyerrflag!=0) +#define YYPREFIX "yy" +#line 2 "gram.y" +#include <stdio.h> +#include <errno.h> +#include "node.h" +#line 7 "gram.y" +typedef union{ +int pos; +node_t node; +float real; +ident_t ident; +} YYSTYPE; +#line 23 "y.tab.c" +#define IN 257 +#define TO 258 +#define IDENT 259 +#define REAL 260 +#define AVG 261 +#define SUM 262 +#define LET 263 +#define NEG 264 +#define LEN 265 +#define YYERRCODE 256 +short yylhs[] = { -1, + 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 2, 2, 3, 3, +}; +short yylen[] = { 2, + 1, 3, 3, 7, 5, 5, 5, 5, 3, 3, + 2, 3, 3, 3, 4, 2, 2, 2, 2, 1, + 1, 5, 5, 1, 3, +}; +short yydefred[] = { 0, + 20, 21, 0, 0, 0, 0, 0, 0, 0, 0, + 0, 0, 0, 0, 0, 16, 0, 0, 0, 0, + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, + 2, 0, 0, 0, 3, 0, 0, 0, 0, 0, + 0, 0, 0, 0, 0, 0, 0, 15, 0, 0, + 5, 6, 7, 8, 0, 0, 22, 0, 4, +}; +short yydgoto[] = { 11, + 12, 16, 23, +}; +short yysindex[] = { -6, + 0, 0, -6, -6, -257, -6, -6, -6, -6, 44, + 0, 309, -87, -87, -56, 0, -87, -91, 240, 282, + -247, 309, -38, -6, -6, -6, -6, -6, -6, -6, + 0, -6, -6, -6, 0, -6, 57, 57, -91, -91, + 290, -91, 128, 219, 226, 153, 309, 0, -6, -257, + 0, 0, 0, 0, -6, 309, 0, 145, 0, +}; +short yyrindex[] = { 0, + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, + 0, 11, 1, 8, 0, 0, 15, 22, 0, 0, + 138, -37, 0, 0, 0, 0, 0, 0, 0, 0, + 0, 0, 0, 0, 0, 0, 93, 100, 29, 36, + 0, 121, 0, 0, 0, 0, -35, 0, 0, 0, + 0, 0, 0, 0, 0, 86, 0, 0, 0, +}; +short yygindex[] = { 0, + 338, -36, 0, +}; +#define YYTABLESIZE 403 +short yytable[] = { 28, + 18, 15, 29, 28, 30, 36, 24, 17, 25, 34, + 1, 0, 0, 57, 19, 0, 0, 0, 0, 0, + 0, 11, 0, 0, 0, 0, 0, 0, 12, 0, + 0, 0, 0, 8, 0, 13, 0, 0, 7, 0, + 0, 18, 18, 18, 18, 18, 0, 18, 17, 17, + 17, 17, 17, 0, 17, 19, 19, 19, 19, 19, + 0, 19, 11, 11, 11, 11, 11, 0, 11, 12, + 12, 12, 12, 12, 0, 12, 13, 13, 13, 13, + 13, 0, 13, 8, 9, 23, 35, 24, 7, 25, + 0, 0, 9, 18, 18, 0, 0, 0, 26, 10, + 17, 17, 0, 27, 0, 0, 0, 19, 19, 0, + 0, 0, 0, 0, 11, 0, 10, 0, 0, 0, + 14, 12, 0, 0, 18, 18, 23, 0, 13, 23, + 0, 17, 17, 9, 9, 9, 9, 9, 19, 19, + 10, 0, 10, 10, 10, 11, 11, 28, 0, 0, + 29, 0, 12, 12, 0, 0, 0, 0, 0, 13, + 13, 14, 14, 14, 14, 14, 10, 14, 0, 26, + 24, 50, 25, 0, 27, 0, 0, 0, 23, 20, + 20, 20, 20, 0, 20, 9, 26, 24, 0, 25, + 0, 27, 10, 0, 26, 24, 0, 25, 0, 27, + 0, 0, 0, 0, 0, 0, 0, 0, 0, 23, + 23, 0, 0, 14, 0, 0, 9, 9, 28, 0, + 0, 29, 0, 10, 10, 0, 0, 0, 20, 0, + 0, 20, 0, 0, 0, 28, 0, 0, 29, 0, + 0, 0, 0, 28, 14, 14, 29, 0, 0, 0, + 0, 0, 1, 2, 3, 4, 5, 18, 6, 51, + 26, 24, 20, 25, 17, 27, 53, 26, 24, 59, + 25, 19, 27, 0, 0, 0, 55, 0, 11, 0, + 31, 26, 24, 32, 25, 12, 27, 0, 0, 0, + 0, 0, 13, 0, 0, 0, 0, 0, 0, 0, + 0, 0, 21, 2, 3, 4, 5, 0, 6, 28, + 0, 52, 29, 0, 0, 0, 28, 0, 54, 29, + 0, 0, 0, 26, 24, 33, 25, 0, 27, 0, + 28, 26, 24, 29, 25, 0, 27, 0, 0, 0, + 13, 14, 23, 17, 18, 19, 20, 22, 0, 9, + 26, 24, 0, 25, 0, 27, 10, 0, 0, 0, + 0, 37, 38, 39, 40, 41, 42, 43, 0, 44, + 45, 46, 28, 47, 0, 29, 0, 14, 0, 0, + 28, 0, 48, 29, 49, 0, 56, 0, 0, 0, + 0, 0, 58, 0, 0, 0, 0, 0, 0, 28, + 0, 0, 29, +}; +short yycheck[] = { 91, + 0, 259, 94, 91, 61, 44, 44, 0, 44, 257, + 0, -1, -1, 50, 0, -1, -1, -1, -1, -1, + -1, 0, -1, -1, -1, -1, -1, -1, 0, -1, + -1, -1, -1, 40, -1, 0, -1, -1, 45, -1, + -1, 41, 42, 43, 44, 45, -1, 47, 41, 42, + 43, 44, 45, -1, 47, 41, 42, 43, 44, 45, + -1, 47, 41, 42, 43, 44, 45, -1, 47, 41, + 42, 43, 44, 45, -1, 47, 41, 42, 43, 44, + 45, -1, 47, 40, 91, 0, 125, 125, 45, 125, + -1, -1, 0, 93, 94, -1, -1, -1, 42, 0, + 93, 94, -1, 47, -1, -1, -1, 93, 94, -1, + -1, -1, -1, -1, 93, -1, 123, -1, -1, -1, + 0, 93, -1, -1, 124, 125, 41, -1, 93, 44, + -1, 124, 125, 41, 91, 43, 44, 45, 124, 125, + 41, -1, 43, 44, 45, 124, 125, 91, -1, -1, + 94, -1, 124, 125, -1, -1, -1, -1, -1, 124, + 125, 41, 42, 43, 44, 45, 123, 47, -1, 42, + 43, 44, 45, -1, 47, -1, -1, -1, 93, 42, + 43, 44, 45, -1, 47, 93, 42, 43, -1, 45, + -1, 47, 93, -1, 42, 43, -1, 45, -1, 47, + -1, -1, -1, -1, -1, -1, -1, -1, -1, 124, + 125, -1, -1, 93, -1, -1, 124, 125, 91, -1, + -1, 94, -1, 124, 125, -1, -1, -1, 91, -1, + -1, 94, -1, -1, -1, 91, -1, -1, 94, -1, + -1, -1, -1, 91, 124, 125, 94, -1, -1, -1, + -1, -1, 259, 260, 261, 262, 263, 257, 265, 41, + 42, 43, 125, 45, 257, 47, 41, 42, 43, 125, + 45, 257, 47, -1, -1, -1, 124, -1, 257, -1, + 41, 42, 43, 44, 45, 257, 47, -1, -1, -1, + -1, -1, 257, -1, -1, -1, -1, -1, -1, -1, + -1, -1, 259, 260, 261, 262, 263, -1, 265, 91, + -1, 93, 94, -1, -1, -1, 91, -1, 93, 94, + -1, -1, -1, 42, 43, 44, 45, -1, 47, -1, + 91, 42, 43, 94, 45, -1, 47, -1, -1, -1, + 3, 4, 257, 6, 7, 8, 9, 10, -1, 257, + 42, 43, -1, 45, -1, 47, 257, -1, -1, -1, + -1, 24, 25, 26, 27, 28, 29, 30, -1, 32, + 33, 34, 91, 36, -1, 94, -1, 257, -1, -1, + 91, -1, 93, 94, 257, -1, 49, -1, -1, -1, + -1, -1, 55, -1, -1, -1, -1, -1, -1, 91, + -1, -1, 94, +}; +#define YYFINAL 11 +#ifndef YYDEBUG +#define YYDEBUG 1 +#endif +#define YYMAXTOKEN 265 +#if YYDEBUG +char *yyname[] = { +"end-of-file",0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, +0,0,0,0,0,0,"'('","')'","'*'","'+'","','","'-'","'.'","'/'",0,0,0,0,0,0,0,0,0,0, +0,0,0,"'='",0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,"'['",0, +"']'","'^'",0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,"'{'","'|'", +"'}'",0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, +0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, +0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, +0,0,0,0,0,0,0,0,0,0,0,0,0,0,"IN","TO","IDENT","REAL","AVG","SUM","LET","NEG", +"LEN", +}; +char *yyrule[] = { +"$accept : top", +"top : expr", +"expr : '(' expr ')'", +"expr : '{' vector '}'", +"expr : '{' IDENT IN expr '|' expr '}'", +"expr : '(' expr ',' expr ')'", +"expr : '(' expr ',' expr ']'", +"expr : '[' expr ',' expr ')'", +"expr : '[' expr ',' expr ']'", +"expr : expr '+' expr", +"expr : expr '-' expr", +"expr : '-' expr", +"expr : expr '*' expr", +"expr : expr '/' expr", +"expr : expr '^' expr", +"expr : expr '[' expr ']'", +"expr : LET letexpr", +"expr : SUM expr", +"expr : AVG expr", +"expr : LEN expr", +"expr : IDENT", +"expr : REAL", +"letexpr : IDENT '=' expr ',' letexpr", +"letexpr : IDENT '=' expr IN expr", +"vector : expr", +"vector : vector ',' expr", +}; +#endif +#ifdef YYSTACKSIZE +#undef YYMAXDEPTH +#define YYMAXDEPTH YYSTACKSIZE +#else +#ifdef YYMAXDEPTH +#define YYSTACKSIZE YYMAXDEPTH +#else +#define YYSTACKSIZE 500 +#define YYMAXDEPTH 500 +#endif +#endif +int yydebug; +int yynerrs; +int yyerrflag; +int yychar; +short *yyssp; +YYSTYPE *yyvsp; +YYSTYPE yyval; +YYSTYPE yylval; +short yyss[YYSTACKSIZE]; +YYSTYPE yyvs[YYSTACKSIZE]; +#define yystacksize YYSTACKSIZE +#line 200 "gram.y" + +node_t root; + +void +yyerror(msg) + const char *msg; +{ + extern int lexpos; + + show_error(lexpos, msg); +} +#line 241 "y.tab.c" +#define YYABORT goto yyabort +#define YYREJECT goto yyabort +#define YYACCEPT goto yyaccept +#define YYERROR goto yyerrlab +int +yyparse() +{ + register int yym, yyn, yystate; +#if YYDEBUG + register char *yys; + extern char *getenv(); + + if (yys = getenv("YYDEBUG")) + { + yyn = *yys; + if (yyn >= '0' && yyn <= '9') + yydebug = yyn - '0'; + } +#endif + + yynerrs = 0; + yyerrflag = 0; + yychar = (-1); + + yyssp = yyss; + yyvsp = yyvs; + *yyssp = yystate = 0; + +yyloop: + if (yyn = yydefred[yystate]) goto yyreduce; + if (yychar < 0) + { + if ((yychar = yylex()) < 0) yychar = 0; +#if YYDEBUG + if (yydebug) + { + yys = 0; + if (yychar <= YYMAXTOKEN) yys = yyname[yychar]; + if (!yys) yys = "illegal-symbol"; + printf("%sdebug: state %d, reading %d (%s)\n", + YYPREFIX, yystate, yychar, yys); + } +#endif + } + if ((yyn = yysindex[yystate]) && (yyn += yychar) >= 0 && + yyn <= YYTABLESIZE && yycheck[yyn] == yychar) + { +#if YYDEBUG + if (yydebug) + printf("%sdebug: state %d, shifting to state %d\n", + YYPREFIX, yystate, yytable[yyn]); +#endif + if (yyssp >= yyss + yystacksize - 1) + { + goto yyoverflow; + } + *++yyssp = yystate = yytable[yyn]; + *++yyvsp = yylval; + yychar = (-1); + if (yyerrflag > 0) --yyerrflag; + goto yyloop; + } + if ((yyn = yyrindex[yystate]) && (yyn += yychar) >= 0 && + yyn <= YYTABLESIZE && yycheck[yyn] == yychar) + { + yyn = yytable[yyn]; + goto yyreduce; + } + if (yyerrflag) goto yyinrecovery; +#ifdef lint + goto yynewerror; +#endif +yynewerror: + yyerror("syntax error"); +#ifdef lint + goto yyerrlab; +#endif +yyerrlab: + ++yynerrs; +yyinrecovery: + if (yyerrflag < 3) + { + yyerrflag = 3; + for (;;) + { + if ((yyn = yysindex[*yyssp]) && (yyn += YYERRCODE) >= 0 && + yyn <= YYTABLESIZE && yycheck[yyn] == YYERRCODE) + { +#if YYDEBUG + if (yydebug) + printf("%sdebug: state %d, error recovery shifting\ + to state %d\n", YYPREFIX, *yyssp, yytable[yyn]); +#endif + if (yyssp >= yyss + yystacksize - 1) + { + goto yyoverflow; + } + *++yyssp = yystate = yytable[yyn]; + *++yyvsp = yylval; + goto yyloop; + } + else + { +#if YYDEBUG + if (yydebug) + printf("%sdebug: error recovery discarding state %d\n", + YYPREFIX, *yyssp); +#endif + if (yyssp <= yyss) goto yyabort; + --yyssp; + --yyvsp; + } + } + } + else + { + if (yychar == 0) goto yyabort; +#if YYDEBUG + if (yydebug) + { + yys = 0; + if (yychar <= YYMAXTOKEN) yys = yyname[yychar]; + if (!yys) yys = "illegal-symbol"; + printf("%sdebug: state %d, error recovery discards token %d (%s)\n", + YYPREFIX, yystate, yychar, yys); + } +#endif + yychar = (-1); + goto yyloop; + } +yyreduce: +#if YYDEBUG + if (yydebug) + printf("%sdebug: state %d, reducing by rule %d (%s)\n", + YYPREFIX, yystate, yyn, yyrule[yyn]); +#endif + yym = yylen[yyn]; + yyval = yyvsp[1-yym]; + switch (yyn) + { +case 1: +#line 34 "gram.y" +{ root = yyvsp[0].node; } +break; +case 2: +#line 38 "gram.y" +{ yyval.node = yyvsp[-1].node; } +break; +case 3: +#line 41 "gram.y" +{ yyval.node = yyvsp[-1].node; } +break; +case 4: +#line 44 "gram.y" +{ yyval.node = new_node(); + yyval.node->type = NODETYPE_GEN; + yyval.node->pos = yyvsp[0].pos; + yyval.node->ident = yyvsp[-5].ident; + yyval.node->expr[0] = yyvsp[-3].node; + yyval.node->expr[1] = yyvsp[-1].node; } +break; +case 5: +#line 52 "gram.y" +{ yyval.node = new_node(); + yyval.node->type = NODETYPE_RANGE; + yyval.node->flags = 0; + yyval.node->pos = yyvsp[0].pos; + yyval.node->expr[0] = yyvsp[-3].node; + yyval.node->expr[1] = yyvsp[-1].node; } +break; +case 6: +#line 60 "gram.y" +{ yyval.node = new_node(); + yyval.node->type = NODETYPE_RANGE; + yyval.node->flags = RANGE_EXACT_UPPER; + yyval.node->pos = yyvsp[0].pos; + yyval.node->expr[0] = yyvsp[-3].node; + yyval.node->expr[1] = yyvsp[-1].node; } +break; +case 7: +#line 68 "gram.y" +{ yyval.node = new_node(); + yyval.node->type = NODETYPE_RANGE; + yyval.node->flags = RANGE_EXACT_LOWER; + yyval.node->pos = yyvsp[0].pos; + yyval.node->expr[0] = yyvsp[-3].node; + yyval.node->expr[1] = yyvsp[-1].node; } +break; +case 8: +#line 76 "gram.y" +{ yyval.node = new_node(); + yyval.node->type = NODETYPE_RANGE; + yyval.node->flags = RANGE_EXACT_UPPER | RANGE_EXACT_LOWER; + yyval.node->pos = yyvsp[0].pos; + yyval.node->expr[0] = yyvsp[-3].node; + yyval.node->expr[1] = yyvsp[-1].node; } +break; +case 9: +#line 84 "gram.y" +{ yyval.node = new_node(); + yyval.node->type = NODETYPE_ADD; + yyval.node->pos = yyvsp[-1].pos; + yyval.node->expr[0] = yyvsp[-2].node; + yyval.node->expr[1] = yyvsp[0].node; } +break; +case 10: +#line 91 "gram.y" +{ yyval.node = new_node(); + yyval.node->type = NODETYPE_SUB; + yyval.node->pos = yyvsp[-1].pos; + yyval.node->expr[0] = yyvsp[-2].node; + yyval.node->expr[1] = yyvsp[0].node; } +break; +case 11: +#line 98 "gram.y" +{ yyval.node = new_node(); + yyval.node->type = NODETYPE_SUB; + yyval.node->pos = yyvsp[-1].pos; + yyval.node->expr[0] = new_node(); + yyval.node->expr[0]->type = NODETYPE_REAL; + yyval.node->expr[0]->real = 0.0; + yyval.node->expr[1] = yyvsp[0].node; } +break; +case 12: +#line 107 "gram.y" +{ yyval.node = new_node(); + yyval.node->pos = yyvsp[-1].pos; + yyval.node->type = NODETYPE_MUL; + yyval.node->expr[0] = yyvsp[-2].node; + yyval.node->expr[1] = yyvsp[0].node; } +break; +case 13: +#line 114 "gram.y" +{ yyval.node = new_node(); + yyval.node->pos = yyvsp[-1].pos; + yyval.node->type = NODETYPE_DIV; + yyval.node->expr[0] = yyvsp[-2].node; + yyval.node->expr[1] = yyvsp[0].node; } +break; +case 14: +#line 121 "gram.y" +{ yyval.node = new_node(); + yyval.node->pos = yyvsp[-1].pos; + yyval.node->type = NODETYPE_EXP; + yyval.node->expr[0] = yyvsp[-2].node; + yyval.node->expr[1] = yyvsp[0].node; } +break; +case 15: +#line 128 "gram.y" +{ yyval.node = new_node(); + yyval.node->type = NODETYPE_INDEX; + yyval.node->pos = yyvsp[0].pos; + yyval.node->expr[0] = yyvsp[-3].node; + yyval.node->expr[1] = yyvsp[-1].node; } +break; +case 16: +#line 135 "gram.y" +{ yyval.node = yyvsp[0].node; } +break; +case 17: +#line 138 "gram.y" +{ yyval.node = new_node(); + yyval.node->pos = yyvsp[-1].pos; + yyval.node->type = NODETYPE_SUM; + yyval.node->expr[0] = yyvsp[0].node; } +break; +case 18: +#line 144 "gram.y" +{ yyval.node = new_node(); + yyval.node->pos = yyvsp[-1].pos; + yyval.node->type = NODETYPE_AVG; + yyval.node->expr[0] = yyvsp[0].node; } +break; +case 19: +#line 150 "gram.y" +{ yyval.node = new_node(); + yyval.node->pos = yyvsp[-1].pos; + yyval.node->type = NODETYPE_LEN; + yyval.node->expr[0] = yyvsp[0].node; } +break; +case 20: +#line 156 "gram.y" +{ yyval.node = new_node(); + yyval.node->type = NODETYPE_IDENT; + yyval.node->pos = -1; + yyval.node->ident = yyvsp[0].ident; } +break; +case 21: +#line 162 "gram.y" +{ yyval.node = new_node(); + yyval.node->pos = -1; + yyval.node->type = NODETYPE_REAL; + yyval.node->real = yyvsp[0].real; } +break; +case 22: +#line 171 "gram.y" +{ yyval.node = new_node(); + yyval.node->type = NODETYPE_LET; + yyval.node->pos = yyvsp[-3].pos; + yyval.node->ident = yyvsp[-4].ident; + yyval.node->expr[0] = yyvsp[-2].node; + yyval.node->expr[1] = yyvsp[0].node; } +break; +case 23: +#line 178 "gram.y" +{ yyval.node = new_node(); + yyval.node->pos = yyvsp[-3].pos; + yyval.node->type = NODETYPE_LET; + yyval.node->ident = yyvsp[-4].ident; + yyval.node->expr[0] = yyvsp[-2].node; + yyval.node->expr[1] = yyvsp[0].node; } +break; +case 24: +#line 187 "gram.y" +{ yyval.node = new_node(); + yyval.node->pos = yyvsp[0].node->pos; + yyval.node->type = NODETYPE_VEC1; + yyval.node->expr[0] = yyvsp[0].node; } +break; +case 25: +#line 192 "gram.y" +{ yyval.node = new_node(); + yyval.node->pos = yyvsp[-1].pos; + yyval.node->type = NODETYPE_VEC2; + yyval.node->expr[0] = yyvsp[-2].node; + yyval.node->expr[1] = yyvsp[0].node; } +break; +#line 569 "y.tab.c" + } + yyssp -= yym; + yystate = *yyssp; + yyvsp -= yym; + yym = yylhs[yyn]; + if (yystate == 0 && yym == 0) + { +#if YYDEBUG + if (yydebug) + printf("%sdebug: after reduction, shifting from state 0 to\ + state %d\n", YYPREFIX, YYFINAL); +#endif + yystate = YYFINAL; + *++yyssp = YYFINAL; + *++yyvsp = yyval; + if (yychar < 0) + { + if ((yychar = yylex()) < 0) yychar = 0; +#if YYDEBUG + if (yydebug) + { + yys = 0; + if (yychar <= YYMAXTOKEN) yys = yyname[yychar]; + if (!yys) yys = "illegal-symbol"; + printf("%sdebug: state %d, reading %d (%s)\n", + YYPREFIX, YYFINAL, yychar, yys); + } +#endif + } + if (yychar == 0) goto yyaccept; + goto yyloop; + } + if ((yyn = yygindex[yym]) && (yyn += yystate) >= 0 && + yyn <= YYTABLESIZE && yycheck[yyn] == yystate) + yystate = yytable[yyn]; + else + yystate = yydgoto[yym]; +#if YYDEBUG + if (yydebug) + printf("%sdebug: after reduction, shifting from state %d \ +to state %d\n", YYPREFIX, *yyssp, yystate); +#endif + if (yyssp >= yyss + yystacksize - 1) + { + goto yyoverflow; + } + *++yyssp = yystate; + *++yyvsp = yyval; + goto yyloop; +yyoverflow: + yyerror("yacc stack overflow"); +yyabort: + return (1); +yyaccept: + return (0); +}
new file mode 100644 --- /dev/null +++ b/progs/minccalc/gram.y @@ -0,0 +1,210 @@ +%{ +#include <stdio.h> +#include <errno.h> +#include "node.h" +%} + +%union{ +int pos; +node_t node; +float real; +ident_t ident; +} + +%token IN TO IDENT REAL AVG SUM LET NEG LEN + +%type<ident> IDENT +%type<real> REAL +%type<pos> AVG SUM LET NEG LEN +%type<pos> IN TO +%type<pos> '+' '-' '*' '/' '(' ')' '[' ']' '.' '=' '^' '{' '}' ',' '|' +%type<node> expr letexpr vector + +%right '=' +%right LET +%left '-' '+' +%left '*' '/' +%left NEG +%right '^' +%right AVG SUM LEN + +%% + +top : expr + { root = $1; } + ; + +expr : '(' expr ')' + { $$ = $2; } + + | '{' vector '}' + { $$ = $2; } + + | '{' IDENT IN expr '|' expr '}' + { $$ = new_node(); + $$->type = NODETYPE_GEN; + $$->pos = $7; + $$->ident = $2; + $$->expr[0] = $4; + $$->expr[1] = $6; } + + | '(' expr ',' expr ')' + { $$ = new_node(); + $$->type = NODETYPE_RANGE; + $$->flags = 0; + $$->pos = $5; + $$->expr[0] = $2; + $$->expr[1] = $4; } + + | '(' expr ',' expr ']' + { $$ = new_node(); + $$->type = NODETYPE_RANGE; + $$->flags = RANGE_EXACT_UPPER; + $$->pos = $5; + $$->expr[0] = $2; + $$->expr[1] = $4; } + + | '[' expr ',' expr ')' + { $$ = new_node(); + $$->type = NODETYPE_RANGE; + $$->flags = RANGE_EXACT_LOWER; + $$->pos = $5; + $$->expr[0] = $2; + $$->expr[1] = $4; } + + | '[' expr ',' expr ']' + { $$ = new_node(); + $$->type = NODETYPE_RANGE; + $$->flags = RANGE_EXACT_UPPER | RANGE_EXACT_LOWER; + $$->pos = $5; + $$->expr[0] = $2; + $$->expr[1] = $4; } + + | expr '+' expr + { $$ = new_node(); + $$->type = NODETYPE_ADD; + $$->pos = $2; + $$->expr[0] = $1; + $$->expr[1] = $3; } + + | expr '-' expr + { $$ = new_node(); + $$->type = NODETYPE_SUB; + $$->pos = $2; + $$->expr[0] = $1; + $$->expr[1] = $3; } + + | '-' expr %prec NEG + { $$ = new_node(); + $$->type = NODETYPE_SUB; + $$->pos = $1; + $$->expr[0] = new_node(); + $$->expr[0]->type = NODETYPE_REAL; + $$->expr[0]->real = 0.0; + $$->expr[1] = $2; } + + | expr '*' expr + { $$ = new_node(); + $$->pos = $2; + $$->type = NODETYPE_MUL; + $$->expr[0] = $1; + $$->expr[1] = $3; } + + | expr '/' expr + { $$ = new_node(); + $$->pos = $2; + $$->type = NODETYPE_DIV; + $$->expr[0] = $1; + $$->expr[1] = $3; } + + | expr '^' expr + { $$ = new_node(); + $$->pos = $2; + $$->type = NODETYPE_EXP; + $$->expr[0] = $1; + $$->expr[1] = $3; } + + | expr '[' expr ']' + { $$ = new_node(); + $$->type = NODETYPE_INDEX; + $$->pos = $4; + $$->expr[0] = $1; + $$->expr[1] = $3; } + + | LET letexpr + { $$ = $2; } + + | SUM expr + { $$ = new_node(); + $$->pos = $1; + $$->type = NODETYPE_SUM; + $$->expr[0] = $2; } + + | AVG expr + { $$ = new_node(); + $$->pos = $1; + $$->type = NODETYPE_AVG; + $$->expr[0] = $2; } + + | LEN expr + { $$ = new_node(); + $$->pos = $1; + $$->type = NODETYPE_LEN; + $$->expr[0] = $2; } + + | IDENT + { $$ = new_node(); + $$->type = NODETYPE_IDENT; + $$->pos = -1; + $$->ident = $1; } + + | REAL + { $$ = new_node(); + $$->pos = -1; + $$->type = NODETYPE_REAL; + $$->real = $1; } + + ; + + +letexpr : IDENT '=' expr ',' letexpr + { $$ = new_node(); + $$->type = NODETYPE_LET; + $$->pos = $2; + $$->ident = $1; + $$->expr[0] = $3; + $$->expr[1] = $5; } + | IDENT '=' expr IN expr + { $$ = new_node(); + $$->pos = $2; + $$->type = NODETYPE_LET; + $$->ident = $1; + $$->expr[0] = $3; + $$->expr[1] = $5; } + ; + +vector : expr + { $$ = new_node(); + $$->pos = $1->pos; + $$->type = NODETYPE_VEC1; + $$->expr[0] = $1; } + | vector ',' expr + { $$ = new_node(); + $$->pos = $2; + $$->type = NODETYPE_VEC2; + $$->expr[0] = $1; + $$->expr[1] = $3; } + ; + +%% + +node_t root; + +void +yyerror(msg) + const char *msg; +{ + extern int lexpos; + + show_error(lexpos, msg); +}
new file mode 100644 --- /dev/null +++ b/progs/minccalc/ident.c @@ -0,0 +1,53 @@ +/* Copyright David Leonard & Andrew Janke, 2000. All rights reserved. */ + +#include <stdio.h> +#include <string.h> +#include <stdlib.h> +#include <ctype.h> +#include "node.h" + +struct intern { + const char *s; + int id; + struct intern *next; + int is_scalar; +}; + +static struct intern *head = NULL; +static ident_t nextid = 0; + +ident_t new_ident(const char *s){ + struct intern *i; + + for (i = head; i; i = i->next) + if (strcmp(i->s, s) == 0) + return i->id; + + i = malloc(sizeof *i); + i->id = nextid++; + i->s = strdup(s); + i->next = head; + i->is_scalar = islower(s[0]); + head = i; + return i->id; +} + +const char *ident_str(ident_t id){ + struct intern *i; + + for (i = head; i; i = i->next) + if (i->id == id) + return i->s; + return "?"; +} + +int ident_is_scalar(ident_t id){ + struct intern *i; + + for (i = head; i; i = i->next) + if (i->id == id) + return i->is_scalar; + /* errx(1, "ident_is_scalar: no such ident %d", id); */ + fprintf(stderr, "ident_is_scalar: no such ident %d", id); + return 0; +}
new file mode 100644 --- /dev/null +++ b/progs/minccalc/lex.c @@ -0,0 +1,1592 @@ +/* A lexical scanner generated by flex */ + +/* Scanner skeleton version: + * $Header: /private-cvsroot/minc/progs/minccalc/lex.c,v 1.1 2001-04-24 18:14:03 neelin Exp $ + */ + +#define FLEX_SCANNER +#define YY_FLEX_MAJOR_VERSION 2 +#define YY_FLEX_MINOR_VERSION 5 + +#include <stdio.h> + + +/* cfront 1.2 defines "c_plusplus" instead of "__cplusplus" */ +#ifdef c_plusplus +#ifndef __cplusplus +#define __cplusplus +#endif +#endif + + +#ifdef __cplusplus + +#include <stdlib.h> +#include <unistd.h> + +/* Use prototypes in function declarations. */ +#define YY_USE_PROTOS + +/* The "const" storage-class-modifier is valid. */ +#define YY_USE_CONST + +#else /* ! __cplusplus */ + +#if __STDC__ + +#define YY_USE_PROTOS +#define YY_USE_CONST + +#endif /* __STDC__ */ +#endif /* ! __cplusplus */ + +#ifdef __TURBOC__ + #pragma warn -rch + #pragma warn -use +#include <io.h> +#include <stdlib.h> +#define YY_USE_CONST +#define YY_USE_PROTOS +#endif + +#ifdef YY_USE_CONST +#define yyconst const +#else +#define yyconst +#endif + + +#ifdef YY_USE_PROTOS +#define YY_PROTO(proto) proto +#else +#define YY_PROTO(proto) () +#endif + +/* Returned upon end-of-file. */ +#define YY_NULL 0 + +/* Promotes a possibly negative, possibly signed char to an unsigned + * integer for use as an array index. If the signed char is negative, + * we want to instead treat it as an 8-bit unsigned char, hence the + * double cast. + */ +#define YY_SC_TO_UI(c) ((unsigned int) (unsigned char) c) + +/* Enter a start condition. This macro really ought to take a parameter, + * but we do it the disgusting crufty way forced on us by the ()-less + * definition of BEGIN. + */ +#define BEGIN yy_start = 1 + 2 * + +/* Translate the current start state into a value that can be later handed + * to BEGIN to return to the state. The YYSTATE alias is for lex + * compatibility. + */ +#define YY_START ((yy_start - 1) / 2) +#define YYSTATE YY_START + +/* Action number for EOF rule of a given start state. */ +#define YY_STATE_EOF(state) (YY_END_OF_BUFFER + state + 1) + +/* Special action meaning "start processing a new file". */ +#define YY_NEW_FILE yyrestart( yyin ) + +#define YY_END_OF_BUFFER_CHAR 0 + +/* Size of default input buffer. */ +#define YY_BUF_SIZE 16384 + +typedef struct yy_buffer_state *YY_BUFFER_STATE; + +extern int yyleng; +extern FILE *yyin, *yyout; + +#define EOB_ACT_CONTINUE_SCAN 0 +#define EOB_ACT_END_OF_FILE 1 +#define EOB_ACT_LAST_MATCH 2 + +/* The funky do-while in the following #define is used to turn the definition + * int a single C statement (which needs a semi-colon terminator). This + * avoids problems with code like: + * + * if ( condition_holds ) + * yyless( 5 ); + * else + * do_something_else(); + * + * Prior to using the do-while the compiler would get upset at the + * "else" because it interpreted the "if" statement as being all + * done when it reached the ';' after the yyless() call. + */ + +/* Return all but the first 'n' matched characters back to the input stream. */ + +#define yyless(n) \ + do \ + { \ + /* Undo effects of setting up yytext. */ \ + *yy_cp = yy_hold_char; \ + YY_RESTORE_YY_MORE_OFFSET \ + yy_c_buf_p = yy_cp = yy_bp + n - YY_MORE_ADJ; \ + YY_DO_BEFORE_ACTION; /* set up yytext again */ \ + } \ + while ( 0 ) + +#define unput(c) yyunput( c, yytext_ptr ) + +/* The following is because we cannot portably get our hands on size_t + * (without autoconf's help, which isn't available because we want + * flex-generated scanners to compile on their own). + */ +typedef unsigned int yy_size_t; + + +struct yy_buffer_state + { + FILE *yy_input_file; + + char *yy_ch_buf; /* input buffer */ + char *yy_buf_pos; /* current position in input buffer */ + + /* Size of input buffer in bytes, not including room for EOB + * characters. + */ + yy_size_t yy_buf_size; + + /* Number of characters read into yy_ch_buf, not including EOB + * characters. + */ + int yy_n_chars; + + /* Whether we "own" the buffer - i.e., we know we created it, + * and can realloc() it to grow it, and should free() it to + * delete it. + */ + int yy_is_our_buffer; + + /* Whether this is an "interactive" input source; if so, and + * if we're using stdio for input, then we want to use getc() + * instead of fread(), to make sure we stop fetching input after + * each newline. + */ + int yy_is_interactive; + + /* Whether we're considered to be at the beginning of a line. + * If so, '^' rules will be active on the next match, otherwise + * not. + */ + int yy_at_bol; + + /* Whether to try to fill the input buffer when we reach the + * end of it. + */ + int yy_fill_buffer; + + int yy_buffer_status; +#define YY_BUFFER_NEW 0 +#define YY_BUFFER_NORMAL 1 + /* When an EOF's been seen but there's still some text to process + * then we mark the buffer as YY_EOF_PENDING, to indicate that we + * shouldn't try reading from the input source any more. We might + * still have a bunch of tokens to match, though, because of + * possible backing-up. + * + * When we actually see the EOF, we change the status to "new" + * (via yyrestart()), so that the user can continue scanning by + * just pointing yyin at a new input file. + */ +#define YY_BUFFER_EOF_PENDING 2 + }; + +static YY_BUFFER_STATE yy_current_buffer = 0; + +/* We provide macros for accessing buffer states in case in the + * future we want to put the buffer states in a more general + * "scanner state". + */ +#define YY_CURRENT_BUFFER yy_current_buffer + + +/* yy_hold_char holds the character lost when yytext is formed. */ +static char yy_hold_char; + +static int yy_n_chars; /* number of characters read into yy_ch_buf */ + + +int yyleng; + +/* Points to current character in buffer. */ +static char *yy_c_buf_p = (char *) 0; +static int yy_init = 1; /* whether we need to initialize */ +static int yy_start = 0; /* start state number */ + +/* Flag which is used to allow yywrap()'s to do buffer switches + * instead of setting up a fresh yyin. A bit of a hack ... + */ +static int yy_did_buffer_switch_on_eof; + +void yyrestart YY_PROTO(( FILE *input_file )); + +void yy_switch_to_buffer YY_PROTO(( YY_BUFFER_STATE new_buffer )); +void yy_load_buffer_state YY_PROTO(( void )); +YY_BUFFER_STATE yy_create_buffer YY_PROTO(( FILE *file, int size )); +void yy_delete_buffer YY_PROTO(( YY_BUFFER_STATE b )); +void yy_init_buffer YY_PROTO(( YY_BUFFER_STATE b, FILE *file )); +void yy_flush_buffer YY_PROTO(( YY_BUFFER_STATE b )); +#define YY_FLUSH_BUFFER yy_flush_buffer( yy_current_buffer ) + +YY_BUFFER_STATE yy_scan_buffer YY_PROTO(( char *base, yy_size_t size )); +YY_BUFFER_STATE yy_scan_string YY_PROTO(( yyconst char *yy_str )); +YY_BUFFER_STATE yy_scan_bytes YY_PROTO(( yyconst char *bytes, int len )); + +static void *yy_flex_alloc YY_PROTO(( yy_size_t )); +static void *yy_flex_realloc YY_PROTO(( void *, yy_size_t )); +static void yy_flex_free YY_PROTO(( void * )); + +#define yy_new_buffer yy_create_buffer + +#define yy_set_interactive(is_interactive) \ + { \ + if ( ! yy_current_buffer ) \ + yy_current_buffer = yy_create_buffer( yyin, YY_BUF_SIZE ); \ + yy_current_buffer->yy_is_interactive = is_interactive; \ + } + +#define yy_set_bol(at_bol) \ + { \ + if ( ! yy_current_buffer ) \ + yy_current_buffer = yy_create_buffer( yyin, YY_BUF_SIZE ); \ + yy_current_buffer->yy_at_bol = at_bol; \ + } + +#define YY_AT_BOL() (yy_current_buffer->yy_at_bol) + +typedef unsigned char YY_CHAR; +FILE *yyin = (FILE *) 0, *yyout = (FILE *) 0; +typedef int yy_state_type; +extern char *yytext; +#define yytext_ptr yytext + +static yy_state_type yy_get_previous_state YY_PROTO(( void )); +static yy_state_type yy_try_NUL_trans YY_PROTO(( yy_state_type current_state )); +static int yy_get_next_buffer YY_PROTO(( void )); +static void yy_fatal_error YY_PROTO(( yyconst char msg[] )); + +/* Done after the current pattern has been matched and before the + * corresponding action - sets up yytext. + */ +#define YY_DO_BEFORE_ACTION \ + yytext_ptr = yy_bp; \ + yyleng = (int) (yy_cp - yy_bp); \ + yy_hold_char = *yy_cp; \ + *yy_cp = '\0'; \ + yy_c_buf_p = yy_cp; + +#define YY_NUM_RULES 11 +#define YY_END_OF_BUFFER 12 +static yyconst short int yy_accept[32] = + { 0, + 0, 0, 12, 10, 9, 9, 8, 7, 7, 7, + 7, 7, 7, 9, 8, 8, 0, 7, 7, 5, + 7, 7, 6, 8, 0, 8, 1, 4, 3, 2, + 0 + } ; + +static yyconst int yy_ec[256] = + { 0, + 1, 1, 1, 1, 1, 1, 1, 1, 2, 3, + 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 4, 1, 4, 5, 1, 6, 6, 6, + 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, + 1, 1, 1, 1, 7, 7, 7, 7, 8, 7, + 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, + 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, + 1, 1, 1, 1, 9, 1, 10, 7, 7, 7, + + 11, 7, 12, 7, 13, 7, 7, 14, 15, 16, + 17, 7, 7, 7, 18, 19, 20, 21, 7, 7, + 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1 + } ; + +static yyconst int yy_meta[22] = + { 0, + 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2 + } ; + +static yyconst short int yy_base[33] = + { 0, + 0, 0, 52, 53, 20, 22, 21, 0, 30, 34, + 38, 28, 30, 28, 27, 0, 30, 0, 34, 0, + 21, 30, 0, 33, 37, 36, 0, 0, 0, 0, + 53, 26 + } ; + +static yyconst short int yy_def[33] = + { 0, + 31, 1, 31, 31, 31, 31, 31, 32, 32, 32, + 32, 32, 32, 31, 31, 7, 31, 32, 32, 32, + 32, 32, 32, 31, 31, 31, 32, 32, 32, 32, + 0, 31 + } ; + +static yyconst short int yy_nxt[75] = + { 0, + 4, 5, 6, 4, 4, 7, 8, 8, 4, 9, + 8, 8, 10, 11, 8, 8, 8, 12, 13, 8, + 8, 14, 14, 14, 14, 15, 16, 18, 17, 14, + 14, 17, 24, 25, 17, 26, 28, 17, 24, 29, + 17, 26, 26, 17, 30, 27, 23, 22, 21, 20, + 19, 31, 3, 31, 31, 31, 31, 31, 31, 31, + 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, + 31, 31, 31, 31 + } ; + +static yyconst short int yy_chk[75] = + { 0, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 5, 5, 6, 6, 7, 7, 32, 7, 14, + 14, 7, 15, 17, 15, 17, 21, 15, 24, 21, + 24, 26, 25, 24, 22, 19, 13, 12, 11, 10, + 9, 3, 31, 31, 31, 31, 31, 31, 31, 31, + 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, + 31, 31, 31, 31 + } ; + +static yy_state_type yy_last_accepting_state; +static char *yy_last_accepting_cpos; + +/* The intent behind this definition is that it'll catch + * any uses of REJECT which flex missed. + */ +#define REJECT reject_used_but_not_detected +#define yymore() yymore_used_but_not_detected +#define YY_MORE_ADJ 0 +#define YY_RESTORE_YY_MORE_OFFSET +char *yytext; +#line 1 "lex.l" +#define INITIAL 0 +#line 2 "lex.l" +#include <string.h> +#include "node.h" +#include "y.tab.h" + +int lexpos = 0; +#define setpos() yylval.pos = lexpos; lexpos += yyleng + +/* Macros after this point can all be overridden by user definitions in + * section 1. + */ + +#ifndef YY_SKIP_YYWRAP +#ifdef __cplusplus +extern "C" int yywrap YY_PROTO(( void )); +#else +extern int yywrap YY_PROTO(( void )); +#endif +#endif + +#ifndef YY_NO_UNPUT +static void yyunput YY_PROTO(( int c, char *buf_ptr )); +#endif + +#ifndef yytext_ptr +static void yy_flex_strncpy YY_PROTO(( char *, yyconst char *, int )); +#endif + +#ifdef YY_NEED_STRLEN +static int yy_flex_strlen YY_PROTO(( yyconst char * )); +#endif + +#ifndef YY_NO_INPUT +#ifdef __cplusplus +static int yyinput YY_PROTO(( void )); +#else +static int input YY_PROTO(( void )); +#endif +#endif + +#if YY_STACK_USED +static int yy_start_stack_ptr = 0; +static int yy_start_stack_depth = 0; +static int *yy_start_stack = 0; +#ifndef YY_NO_PUSH_STATE +static void yy_push_state YY_PROTO(( int new_state )); +#endif +#ifndef YY_NO_POP_STATE +static void yy_pop_state YY_PROTO(( void )); +#endif +#ifndef YY_NO_TOP_STATE +static int yy_top_state YY_PROTO(( void )); +#endif + +#else +#define YY_NO_PUSH_STATE 1 +#define YY_NO_POP_STATE 1 +#define YY_NO_TOP_STATE 1 +#endif + +#ifdef YY_MALLOC_DECL +YY_MALLOC_DECL +#else +#if __STDC__ +#ifndef __cplusplus +#include <stdlib.h> +#endif +#else +/* Just try to get by without declaring the routines. This will fail + * miserably on non-ANSI systems for which sizeof(size_t) != sizeof(int) + * or sizeof(void*) != sizeof(int). + */ +#endif +#endif + +/* Amount of stuff to slurp up with each read. */ +#ifndef YY_READ_BUF_SIZE +#define YY_READ_BUF_SIZE 8192 +#endif + +/* Copy whatever the last rule matched to the standard output. */ + +#ifndef ECHO +/* This used to be an fputs(), but since the string might contain NUL's, + * we now use fwrite(). + */ +#define ECHO (void) fwrite( yytext, yyleng, 1, yyout ) +#endif + +/* Gets input and stuffs it into "buf". number of characters read, or YY_NULL, + * is returned in "result". + */ +#ifndef YY_INPUT +#define YY_INPUT(buf,result,max_size) \ + if ( yy_current_buffer->yy_is_interactive ) \ + { \ + int c = '*', n; \ + for ( n = 0; n < max_size && \ + (c = getc( yyin )) != EOF && c != '\n'; ++n ) \ + buf[n] = (char) c; \ + if ( c == '\n' ) \ + buf[n++] = (char) c; \ + if ( c == EOF && ferror( yyin ) ) \ + YY_FATAL_ERROR( "input in flex scanner failed" ); \ + result = n; \ + } \ + else if ( ((result = fread( buf, 1, max_size, yyin )) == 0) \ + && ferror( yyin ) ) \ + YY_FATAL_ERROR( "input in flex scanner failed" ); +#endif + +/* No semi-colon after return; correct usage is to write "yyterminate();" - + * we don't want an extra ';' after the "return" because that will cause + * some compilers to complain about unreachable statements. + */ +#ifndef yyterminate +#define yyterminate() return YY_NULL +#endif + +/* Number of entries by which start-condition stack grows. */ +#ifndef YY_START_STACK_INCR +#define YY_START_STACK_INCR 25 +#endif + +/* Report a fatal error. */ +#ifndef YY_FATAL_ERROR +#define YY_FATAL_ERROR(msg) yy_fatal_error( msg ) +#endif + +/* Default declaration of generated scanner - a define so the user can + * easily add parameters. + */ +#ifndef YY_DECL +#define YY_DECL int yylex YY_PROTO(( void )) +#endif + +/* Code executed at the beginning of each rule, after yytext and yyleng + * have been set up. + */ +#ifndef YY_USER_ACTION +#define YY_USER_ACTION +#endif + +/* Code executed at the end of each rule. */ +#ifndef YY_BREAK +#define YY_BREAK break; +#endif + +#define YY_RULE_SETUP \ + YY_USER_ACTION + +YY_DECL + { + register yy_state_type yy_current_state; + register char *yy_cp = NULL, *yy_bp = NULL; + register int yy_act; + +#line 10 "lex.l" + + + + if ( yy_init ) + { + yy_init = 0; + +#ifdef YY_USER_INIT + YY_USER_INIT; +#endif + + if ( ! yy_start ) + yy_start = 1; /* first start state */ + + if ( ! yyin ) + yyin = stdin; + + if ( ! yyout ) + yyout = stdout; + + if ( ! yy_current_buffer ) + yy_current_buffer = + yy_create_buffer( yyin, YY_BUF_SIZE ); + + yy_load_buffer_state(); + } + + while ( 1 ) /* loops until end-of-file is reached */ + { + yy_cp = yy_c_buf_p; + + /* Support of yytext. */ + *yy_cp = yy_hold_char; + + /* yy_bp points to the position in yy_ch_buf of the start of + * the current run. + */ + yy_bp = yy_cp; + + yy_current_state = yy_start; +yy_match: + do + { + register YY_CHAR yy_c = yy_ec[YY_SC_TO_UI(*yy_cp)]; + if ( yy_accept[yy_current_state] ) + { + yy_last_accepting_state = yy_current_state; + yy_last_accepting_cpos = yy_cp; + } + while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state ) + { + yy_current_state = (int) yy_def[yy_current_state]; + if ( yy_current_state >= 32 ) + yy_c = yy_meta[(unsigned int) yy_c]; + } + yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c]; + ++yy_cp; + } + while ( yy_base[yy_current_state] != 53 ); + +yy_find_action: + yy_act = yy_accept[yy_current_state]; + if ( yy_act == 0 ) + { /* have to back up */ + yy_cp = yy_last_accepting_cpos; + yy_current_state = yy_last_accepting_state; + yy_act = yy_accept[yy_current_state]; + } + + YY_DO_BEFORE_ACTION; + + +do_action: /* This label is used only to access EOF actions. */ + + + switch ( yy_act ) + { /* beginning of action switch */ + case 0: /* must back up */ + /* undo the effects of YY_DO_BEFORE_ACTION */ + *yy_cp = yy_hold_char; + yy_cp = yy_last_accepting_cpos; + yy_current_state = yy_last_accepting_state; + goto yy_find_action; + +case 1: +YY_RULE_SETUP +#line 12 "lex.l" +setpos(); return AVG; + YY_BREAK +case 2: +YY_RULE_SETUP +#line 13 "lex.l" +setpos(); return SUM; + YY_BREAK +case 3: +YY_RULE_SETUP +#line 14 "lex.l" +setpos(); return LET; + YY_BREAK +case 4: +YY_RULE_SETUP +#line 15 "lex.l" +setpos(); return LEN; + YY_BREAK +case 5: +YY_RULE_SETUP +#line 16 "lex.l" +setpos(); return IN; + YY_BREAK +case 6: +YY_RULE_SETUP +#line 17 "lex.l" +setpos(); return TO; + YY_BREAK +case 7: +YY_RULE_SETUP +#line 18 "lex.l" +{ + setpos(); + yylval.ident = new_ident(yytext); + return IDENT; + } + YY_BREAK +case 8: +YY_RULE_SETUP +#line 23 "lex.l" +{ + setpos(); + sscanf(yytext, "%f", &yylval.real); + return REAL; + } + YY_BREAK +case 9: +YY_RULE_SETUP +#line 28 "lex.l" +setpos(); + YY_BREAK +case 10: +YY_RULE_SETUP +#line 29 "lex.l" +setpos(); return yytext[0]; + YY_BREAK +case 11: +YY_RULE_SETUP +#line 32 "lex.l" +ECHO; + YY_BREAK +case YY_STATE_EOF(INITIAL): + yyterminate(); + + case YY_END_OF_BUFFER: + { + /* Amount of text matched not including the EOB char. */ + int yy_amount_of_matched_text = (int) (yy_cp - yytext_ptr) - 1; + + /* Undo the effects of YY_DO_BEFORE_ACTION. */ + *yy_cp = yy_hold_char; + YY_RESTORE_YY_MORE_OFFSET + + if ( yy_current_buffer->yy_buffer_status == YY_BUFFER_NEW ) + { + /* We're scanning a new file or input source. It's + * possible that this happened because the user + * just pointed yyin at a new source and called + * yylex(). If so, then we have to assure + * consistency between yy_current_buffer and our + * globals. Here is the right place to do so, because + * this is the first action (other than possibly a + * back-up) that will match for the new input source. + */ + yy_n_chars = yy_current_buffer->yy_n_chars; + yy_current_buffer->yy_input_file = yyin; + yy_current_buffer->yy_buffer_status = YY_BUFFER_NORMAL; + } + + /* Note that here we test for yy_c_buf_p "<=" to the position + * of the first EOB in the buffer, since yy_c_buf_p will + * already have been incremented past the NUL character + * (since all states make transitions on EOB to the + * end-of-buffer state). Contrast this with the test + * in input(). + */ + if ( yy_c_buf_p <= &yy_current_buffer->yy_ch_buf[yy_n_chars] ) + { /* This was really a NUL. */ + yy_state_type yy_next_state; + + yy_c_buf_p = yytext_ptr + yy_amount_of_matched_text; + + yy_current_state = yy_get_previous_state(); + + /* Okay, we're now positioned to make the NUL + * transition. We couldn't have + * yy_get_previous_state() go ahead and do it + * for us because it doesn't know how to deal + * with the possibility of jamming (and we don't + * want to build jamming into it because then it + * will run more slowly). + */ + + yy_next_state = yy_try_NUL_trans( yy_current_state ); + + yy_bp = yytext_ptr + YY_MORE_ADJ; + + if ( yy_next_state ) + { + /* Consume the NUL. */ + yy_cp = ++yy_c_buf_p; + yy_current_state = yy_next_state; + goto yy_match; + } + + else + { + yy_cp = yy_c_buf_p; + goto yy_find_action; + } + } + + else switch ( yy_get_next_buffer() ) + { + case EOB_ACT_END_OF_FILE: + { + yy_did_buffer_switch_on_eof = 0; + + if ( yywrap() ) + { + /* Note: because we've taken care in + * yy_get_next_buffer() to have set up + * yytext, we can now set up + * yy_c_buf_p so that if some total + * hoser (like flex itself) wants to + * call the scanner after we return the + * YY_NULL, it'll still work - another + * YY_NULL will get returned. + */ + yy_c_buf_p = yytext_ptr + YY_MORE_ADJ; + + yy_act = YY_STATE_EOF(YY_START); + goto do_action; + } + + else + { + if ( ! yy_did_buffer_switch_on_eof ) + YY_NEW_FILE; + } + break; + } + + case EOB_ACT_CONTINUE_SCAN: + yy_c_buf_p = + yytext_ptr + yy_amount_of_matched_text; + + yy_current_state = yy_get_previous_state(); + + yy_cp = yy_c_buf_p; + yy_bp = yytext_ptr + YY_MORE_ADJ; + goto yy_match; + + case EOB_ACT_LAST_MATCH: + yy_c_buf_p = + &yy_current_buffer->yy_ch_buf[yy_n_chars]; + + yy_current_state = yy_get_previous_state(); + + yy_cp = yy_c_buf_p; + yy_bp = yytext_ptr + YY_MORE_ADJ; + goto yy_find_action; + } + break; + } + + default: + YY_FATAL_ERROR( + "fatal flex scanner internal error--no action found" ); + } /* end of action switch */ + } /* end of scanning one token */ + } /* end of yylex */ + + +/* yy_get_next_buffer - try to read in a new buffer + * + * Returns a code representing an action: + * EOB_ACT_LAST_MATCH - + * EOB_ACT_CONTINUE_SCAN - continue scanning from current position + * EOB_ACT_END_OF_FILE - end of file + */ + +static int yy_get_next_buffer() + { + register char *dest = yy_current_buffer->yy_ch_buf; + register char *source = yytext_ptr; + register int number_to_move, i; + int ret_val; + + if ( yy_c_buf_p > &yy_current_buffer->yy_ch_buf[yy_n_chars + 1] ) + YY_FATAL_ERROR( + "fatal flex scanner internal error--end of buffer missed" ); + + if ( yy_current_buffer->yy_fill_buffer == 0 ) + { /* Don't try to fill the buffer, so this is an EOF. */ + if ( yy_c_buf_p - yytext_ptr - YY_MORE_ADJ == 1 ) + { + /* We matched a single character, the EOB, so + * treat this as a final EOF. + */ + return EOB_ACT_END_OF_FILE; + } + + else + { + /* We matched some text prior to the EOB, first + * process it. + */ + return EOB_ACT_LAST_MATCH; + } + } + + /* Try to read more data. */ + + /* First move last chars to start of buffer. */ + number_to_move = (int) (yy_c_buf_p - yytext_ptr) - 1; + + for ( i = 0; i < number_to_move; ++i ) + *(dest++) = *(source++); + + if ( yy_current_buffer->yy_buffer_status == YY_BUFFER_EOF_PENDING ) + /* don't do the read, it's not guaranteed to return an EOF, + * just force an EOF + */ + yy_current_buffer->yy_n_chars = yy_n_chars = 0; + + else + { + int num_to_read = + yy_current_buffer->yy_buf_size - number_to_move - 1; + + while ( num_to_read <= 0 ) + { /* Not enough room in the buffer - grow it. */ +#ifdef YY_USES_REJECT + YY_FATAL_ERROR( +"input buffer overflow, can't enlarge buffer because scanner uses REJECT" ); +#else + + /* just a shorter name for the current buffer */ + YY_BUFFER_STATE b = yy_current_buffer; + + int yy_c_buf_p_offset = + (int) (yy_c_buf_p - b->yy_ch_buf); + + if ( b->yy_is_our_buffer ) + { + int new_size = b->yy_buf_size * 2; + + if ( new_size <= 0 ) + b->yy_buf_size += b->yy_buf_size / 8; + else + b->yy_buf_size *= 2; + + b->yy_ch_buf = (char *) + /* Include room in for 2 EOB chars. */ + yy_flex_realloc( (void *) b->yy_ch_buf, + b->yy_buf_size + 2 ); + } + else + /* Can't grow it, we don't own it. */ + b->yy_ch_buf = 0; + + if ( ! b->yy_ch_buf ) + YY_FATAL_ERROR( + "fatal error - scanner input buffer overflow" ); + + yy_c_buf_p = &b->yy_ch_buf[yy_c_buf_p_offset]; + + num_to_read = yy_current_buffer->yy_buf_size - + number_to_move - 1; +#endif + } + + if ( num_to_read > YY_READ_BUF_SIZE ) + num_to_read = YY_READ_BUF_SIZE; + + /* Read in more data. */ + YY_INPUT( (&yy_current_buffer->yy_ch_buf[number_to_move]), + yy_n_chars, num_to_read ); + + yy_current_buffer->yy_n_chars = yy_n_chars; + } + + if ( yy_n_chars == 0 ) + { + if ( number_to_move == YY_MORE_ADJ ) + { + ret_val = EOB_ACT_END_OF_FILE; + yyrestart( yyin ); + } + + else + { + ret_val = EOB_ACT_LAST_MATCH; + yy_current_buffer->yy_buffer_status = + YY_BUFFER_EOF_PENDING; + } + } + + else + ret_val = EOB_ACT_CONTINUE_SCAN; + + yy_n_chars += number_to_move; + yy_current_buffer->yy_ch_buf[yy_n_chars] = YY_END_OF_BUFFER_CHAR; + yy_current_buffer->yy_ch_buf[yy_n_chars + 1] = YY_END_OF_BUFFER_CHAR; + + yytext_ptr = &yy_current_buffer->yy_ch_buf[0]; + + return ret_val; + } + + +/* yy_get_previous_state - get the state just before the EOB char was reached */ + +static yy_state_type yy_get_previous_state() + { + register yy_state_type yy_current_state; + register char *yy_cp; + + yy_current_state = yy_start; + + for ( yy_cp = yytext_ptr + YY_MORE_ADJ; yy_cp < yy_c_buf_p; ++yy_cp ) + { + register YY_CHAR yy_c = (*yy_cp ? yy_ec[YY_SC_TO_UI(*yy_cp)] : 1); + if ( yy_accept[yy_current_state] ) + { + yy_last_accepting_state = yy_current_state; + yy_last_accepting_cpos = yy_cp; + } + while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state ) + { + yy_current_state = (int) yy_def[yy_current_state]; + if ( yy_current_state >= 32 ) + yy_c = yy_meta[(unsigned int) yy_c]; + } + yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c]; + } + + return yy_current_state; + } + + +/* yy_try_NUL_trans - try to make a transition on the NUL character + * + * synopsis + * next_state = yy_try_NUL_trans( current_state ); + */ + +#ifdef YY_USE_PROTOS +static yy_state_type yy_try_NUL_trans( yy_state_type yy_current_state ) +#else +static yy_state_type yy_try_NUL_trans( yy_current_state ) +yy_state_type yy_current_state; +#endif + { + register int yy_is_jam; + register char *yy_cp = yy_c_buf_p; + + register YY_CHAR yy_c = 1; + if ( yy_accept[yy_current_state] ) + { + yy_last_accepting_state = yy_current_state; + yy_last_accepting_cpos = yy_cp; + } + while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state ) + { + yy_current_state = (int) yy_def[yy_current_state]; + if ( yy_current_state >= 32 ) + yy_c = yy_meta[(unsigned int) yy_c]; + } + yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c]; + yy_is_jam = (yy_current_state == 31); + + return yy_is_jam ? 0 : yy_current_state; + } + + +#ifndef YY_NO_UNPUT +#ifdef YY_USE_PROTOS +static void yyunput( int c, register char *yy_bp ) +#else +static void yyunput( c, yy_bp ) +int c; +register char *yy_bp; +#endif + { + register char *yy_cp = yy_c_buf_p; + + /* undo effects of setting up yytext */ + *yy_cp = yy_hold_char; + + if ( yy_cp < yy_current_buffer->yy_ch_buf + 2 ) + { /* need to shift things up to make room */ + /* +2 for EOB chars. */ + register int number_to_move = yy_n_chars + 2; + register char *dest = &yy_current_buffer->yy_ch_buf[ + yy_current_buffer->yy_buf_size + 2]; + register char *source = + &yy_current_buffer->yy_ch_buf[number_to_move]; + + while ( source > yy_current_buffer->yy_ch_buf ) + *--dest = *--source; + + yy_cp += (int) (dest - source); + yy_bp += (int) (dest - source); + yy_current_buffer->yy_n_chars = + yy_n_chars = yy_current_buffer->yy_buf_size; + + if ( yy_cp < yy_current_buffer->yy_ch_buf + 2 ) + YY_FATAL_ERROR( "flex scanner push-back overflow" ); + } + + *--yy_cp = (char) c; + + + yytext_ptr = yy_bp; + yy_hold_char = *yy_cp; + yy_c_buf_p = yy_cp; + } +#endif /* ifndef YY_NO_UNPUT */ + + +#ifdef __cplusplus +static int yyinput() +#else +static int input() +#endif + { + int c; + + *yy_c_buf_p = yy_hold_char; + + if ( *yy_c_buf_p == YY_END_OF_BUFFER_CHAR ) + { + /* yy_c_buf_p now points to the character we want to return. + * If this occurs *before* the EOB characters, then it's a + * valid NUL; if not, then we've hit the end of the buffer. + */ + if ( yy_c_buf_p < &yy_current_buffer->yy_ch_buf[yy_n_chars] ) + /* This was really a NUL. */ + *yy_c_buf_p = '\0'; + + else + { /* need more input */ + int offset = yy_c_buf_p - yytext_ptr; + ++yy_c_buf_p; + + switch ( yy_get_next_buffer() ) + { + case EOB_ACT_LAST_MATCH: + /* This happens because yy_g_n_b() + * sees that we've accumulated a + * token and flags that we need to + * try matching the token before + * proceeding. But for input(), + * there's no matching to consider. + * So convert the EOB_ACT_LAST_MATCH + * to EOB_ACT_END_OF_FILE. + */ + + /* Reset buffer status. */ + yyrestart( yyin ); + + /* fall through */ + + case EOB_ACT_END_OF_FILE: + { + if ( yywrap() ) + return EOF; + + if ( ! yy_did_buffer_switch_on_eof ) + YY_NEW_FILE; +#ifdef __cplusplus + return yyinput(); +#else + return input(); +#endif + } + + case EOB_ACT_CONTINUE_SCAN: + yy_c_buf_p = yytext_ptr + offset; + break; + } + } + } + + c = *(unsigned char *) yy_c_buf_p; /* cast for 8-bit char's */ + *yy_c_buf_p = '\0'; /* preserve yytext */ + yy_hold_char = *++yy_c_buf_p; + + + return c; + } + + +#ifdef YY_USE_PROTOS +void yyrestart( FILE *input_file ) +#else +void yyrestart( input_file ) +FILE *input_file; +#endif + { + if ( ! yy_current_buffer ) + yy_current_buffer = yy_create_buffer( yyin, YY_BUF_SIZE ); + + yy_init_buffer( yy_current_buffer, input_file ); + yy_load_buffer_state(); + } + + +#ifdef YY_USE_PROTOS +void yy_switch_to_buffer( YY_BUFFER_STATE new_buffer ) +#else +void yy_switch_to_buffer( new_buffer ) +YY_BUFFER_STATE new_buffer; +#endif + { + if ( yy_current_buffer == new_buffer ) + return; + + if ( yy_current_buffer ) + { + /* Flush out information for old buffer. */ + *yy_c_buf_p = yy_hold_char; + yy_current_buffer->yy_buf_pos = yy_c_buf_p; + yy_current_buffer->yy_n_chars = yy_n_chars; + } + + yy_current_buffer = new_buffer; + yy_load_buffer_state(); + + /* We don't actually know whether we did this switch during + * EOF (yywrap()) processing, but the only time this flag + * is looked at is after yywrap() is called, so it's safe + * to go ahead and always set it. + */ + yy_did_buffer_switch_on_eof = 1; + } + + +#ifdef YY_USE_PROTOS +void yy_load_buffer_state( void ) +#else +void yy_load_buffer_state() +#endif + { + yy_n_chars = yy_current_buffer->yy_n_chars; + yytext_ptr = yy_c_buf_p = yy_current_buffer->yy_buf_pos; + yyin = yy_current_buffer->yy_input_file; + yy_hold_char = *yy_c_buf_p; + } + + +#ifdef YY_USE_PROTOS +YY_BUFFER_STATE yy_create_buffer( FILE *file, int size ) +#else +YY_BUFFER_STATE yy_create_buffer( file, size ) +FILE *file; +int size; +#endif + { + YY_BUFFER_STATE b; + + b = (YY_BUFFER_STATE) yy_flex_alloc( sizeof( struct yy_buffer_state ) ); + if ( ! b ) + YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" ); + + b->yy_buf_size = size; + + /* yy_ch_buf has to be 2 characters longer than the size given because + * we need to put in 2 end-of-buffer characters. + */ + b->yy_ch_buf = (char *) yy_flex_alloc( b->yy_buf_size + 2 ); + if ( ! b->yy_ch_buf ) + YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" ); + + b->yy_is_our_buffer = 1; + + yy_init_buffer( b, file ); + + return b; + } + + +#ifdef YY_USE_PROTOS +void yy_delete_buffer( YY_BUFFER_STATE b ) +#else +void yy_delete_buffer( b ) +YY_BUFFER_STATE b; +#endif + { + if ( ! b ) + return; + + if ( b == yy_current_buffer ) + yy_current_buffer = (YY_BUFFER_STATE) 0; + + if ( b->yy_is_our_buffer ) + yy_flex_free( (void *) b->yy_ch_buf ); + + yy_flex_free( (void *) b ); + } + + +#ifndef YY_ALWAYS_INTERACTIVE +#ifndef YY_NEVER_INTERACTIVE +extern int isatty YY_PROTO(( int )); +#endif +#endif + +#ifdef YY_USE_PROTOS +void yy_init_buffer( YY_BUFFER_STATE b, FILE *file ) +#else +void yy_init_buffer( b, file ) +YY_BUFFER_STATE b; +FILE *file; +#endif + + + { + yy_flush_buffer( b ); + + b->yy_input_file = file; + b->yy_fill_buffer = 1; + +#if YY_ALWAYS_INTERACTIVE + b->yy_is_interactive = 1; +#else +#if YY_NEVER_INTERACTIVE + b->yy_is_interactive = 0; +#else + b->yy_is_interactive = file ? (isatty( fileno(file) ) > 0) : 0; +#endif +#endif + } + + +#ifdef YY_USE_PROTOS +void yy_flush_buffer( YY_BUFFER_STATE b ) +#else +void yy_flush_buffer( b ) +YY_BUFFER_STATE b; +#endif + + { + if ( ! b ) + return; + + b->yy_n_chars = 0; + + /* We always need two end-of-buffer characters. The first causes + * a transition to the end-of-buffer state. The second causes + * a jam in that state. + */ + b->yy_ch_buf[0] = YY_END_OF_BUFFER_CHAR; + b->yy_ch_buf[1] = YY_END_OF_BUFFER_CHAR; + + b->yy_buf_pos = &b->yy_ch_buf[0]; + + b->yy_at_bol = 1; + b->yy_buffer_status = YY_BUFFER_NEW; + + if ( b == yy_current_buffer ) + yy_load_buffer_state(); + } + + +#ifndef YY_NO_SCAN_BUFFER +#ifdef YY_USE_PROTOS +YY_BUFFER_STATE yy_scan_buffer( char *base, yy_size_t size ) +#else +YY_BUFFER_STATE yy_scan_buffer( base, size ) +char *base; +yy_size_t size; +#endif + { + YY_BUFFER_STATE b; + + if ( size < 2 || + base[size-2] != YY_END_OF_BUFFER_CHAR || + base[size-1] != YY_END_OF_BUFFER_CHAR ) + /* They forgot to leave room for the EOB's. */ + return 0; + + b = (YY_BUFFER_STATE) yy_flex_alloc( sizeof( struct yy_buffer_state ) ); + if ( ! b ) + YY_FATAL_ERROR( "out of dynamic memory in yy_scan_buffer()" ); + + b->yy_buf_size = size - 2; /* "- 2" to take care of EOB's */ + b->yy_buf_pos = b->yy_ch_buf = base; + b->yy_is_our_buffer = 0; + b->yy_input_file = 0; + b->yy_n_chars = b->yy_buf_size; + b->yy_is_interactive = 0; + b->yy_at_bol = 1; + b->yy_fill_buffer = 0; + b->yy_buffer_status = YY_BUFFER_NEW; + + yy_switch_to_buffer( b ); + + return b; + } +#endif + + +#ifndef YY_NO_SCAN_STRING +#ifdef YY_USE_PROTOS +YY_BUFFER_STATE yy_scan_string( yyconst char *yy_str ) +#else +YY_BUFFER_STATE yy_scan_string( yy_str ) +yyconst char *yy_str; +#endif + { + int len; + for ( len = 0; yy_str[len]; ++len ) + ; + + return yy_scan_bytes( yy_str, len ); + } +#endif + + +#ifndef YY_NO_SCAN_BYTES +#ifdef YY_USE_PROTOS +YY_BUFFER_STATE yy_scan_bytes( yyconst char *bytes, int len ) +#else +YY_BUFFER_STATE yy_scan_bytes( bytes, len ) +yyconst char *bytes; +int len; +#endif + { + YY_BUFFER_STATE b; + char *buf; + yy_size_t n; + int i; + + /* Get memory for full buffer, including space for trailing EOB's. */ + n = len + 2; + buf = (char *) yy_flex_alloc( n ); + if ( ! buf ) + YY_FATAL_ERROR( "out of dynamic memory in yy_scan_bytes()" ); + + for ( i = 0; i < len; ++i ) + buf[i] = bytes[i]; + + buf[len] = buf[len+1] = YY_END_OF_BUFFER_CHAR; + + b = yy_scan_buffer( buf, n ); + if ( ! b ) + YY_FATAL_ERROR( "bad buffer in yy_scan_bytes()" ); + + /* It's okay to grow etc. this buffer, and we should throw it + * away when we're done. + */ + b->yy_is_our_buffer = 1; + + return b; + } +#endif + + +#ifndef YY_NO_PUSH_STATE +#ifdef YY_USE_PROTOS +static void yy_push_state( int new_state ) +#else +static void yy_push_state( new_state ) +int new_state; +#endif + { + if ( yy_start_stack_ptr >= yy_start_stack_depth ) + { + yy_size_t new_size; + + yy_start_stack_depth += YY_START_STACK_INCR; + new_size = yy_start_stack_depth * sizeof( int ); + + if ( ! yy_start_stack ) + yy_start_stack = (int *) yy_flex_alloc( new_size ); + + else + yy_start_stack = (int *) yy_flex_realloc( + (void *) yy_start_stack, new_size ); + + if ( ! yy_start_stack ) + YY_FATAL_ERROR( + "out of memory expanding start-condition stack" ); + } + + yy_start_stack[yy_start_stack_ptr++] = YY_START; + + BEGIN(new_state); + } +#endif + + +#ifndef YY_NO_POP_STATE +static void yy_pop_state() + { + if ( --yy_start_stack_ptr < 0 ) + YY_FATAL_ERROR( "start-condition stack underflow" ); + + BEGIN(yy_start_stack[yy_start_stack_ptr]); + } +#endif + + +#ifndef YY_NO_TOP_STATE +static int yy_top_state() + { + return yy_start_stack[yy_start_stack_ptr - 1]; + } +#endif + +#ifndef YY_EXIT_FAILURE +#define YY_EXIT_FAILURE 2 +#endif + +#ifdef YY_USE_PROTOS +static void yy_fatal_error( yyconst char msg[] ) +#else +static void yy_fatal_error( msg ) +char msg[]; +#endif + { + (void) fprintf( stderr, "%s\n", msg ); + exit( YY_EXIT_FAILURE ); + } + + + +/* Redefine yyless() so it works in section 3 code. */ + +#undef yyless +#define yyless(n) \ + do \ + { \ + /* Undo effects of setting up yytext. */ \ + yytext[yyleng] = yy_hold_char; \ + yy_c_buf_p = yytext + n; \ + yy_hold_char = *yy_c_buf_p; \ + *yy_c_buf_p = '\0'; \ + yyleng = n; \ + } \ + while ( 0 ) + + +/* Internal utility routines. */ + +#ifndef yytext_ptr +#ifdef YY_USE_PROTOS +static void yy_flex_strncpy( char *s1, yyconst char *s2, int n ) +#else +static void yy_flex_strncpy( s1, s2, n ) +char *s1; +yyconst char *s2; +int n; +#endif + { + register int i; + for ( i = 0; i < n; ++i ) + s1[i] = s2[i]; + } +#endif + +#ifdef YY_NEED_STRLEN +#ifdef YY_USE_PROTOS +static int yy_flex_strlen( yyconst char *s ) +#else +static int yy_flex_strlen( s ) +yyconst char *s; +#endif + { + register int n; + for ( n = 0; s[n]; ++n ) + ; + + return n; + } +#endif + + +#ifdef YY_USE_PROTOS +static void *yy_flex_alloc( yy_size_t size ) +#else +static void *yy_flex_alloc( size ) +yy_size_t size; +#endif + { + return (void *) malloc( size ); + } + +#ifdef YY_USE_PROTOS +static void *yy_flex_realloc( void *ptr, yy_size_t size ) +#else +static void *yy_flex_realloc( ptr, size ) +void *ptr; +yy_size_t size; +#endif + { + /* The cast to (char *) in the following accommodates both + * implementations that use char* generic pointers, and those + * that use void* generic pointers. It works with the latter + * because both ANSI C and C++ allow castless assignment from + * any pointer type to void*, and deal with argument conversions + * as though doing an assignment. + */ + return (void *) realloc( (char *) ptr, size ); + } + +#ifdef YY_USE_PROTOS +static void yy_flex_free( void *ptr ) +#else +static void yy_flex_free( ptr ) +void *ptr; +#endif + { + free( ptr ); + } + +#if YY_MAIN +int main() + { + yylex(); + return 0; + } +#endif +#line 32 "lex.l" + + +static YY_BUFFER_STATE lex_state; + +void lex_init(const char *s){ + lex_state = yy_scan_string(s); +} + +void lex_finalize(){ + yy_delete_buffer(lex_state); +} + +int yywrap(){ + return 1; +}
new file mode 100644 --- /dev/null +++ b/progs/minccalc/lex.l @@ -0,0 +1,46 @@ +%{ +#include <string.h> +#include "node.h" +#include "y.tab.h" + +int lexpos = 0; +#define setpos() yylval.pos = lexpos; lexpos += yyleng +%} + +%% + +avg setpos(); return AVG; +sum setpos(); return SUM; +let setpos(); return LET; +len setpos(); return LEN; +in setpos(); return IN; +to setpos(); return TO; +[a-zA-Z][_a-zA-Z0-9]* { + setpos(); + yylval.ident = new_ident(yytext); + return IDENT; + } +[0-9]+(\.[0-9]*)?([eE][-+]?[0-9]+)? { + setpos(); + sscanf(yytext, "%f", &yylval.real); + return REAL; + } +[ \t\n\f]+ setpos(); +. setpos(); return yytext[0]; + + +%% + +static YY_BUFFER_STATE lex_state; + +void lex_init(const char *s){ + lex_state = yy_scan_string(s); +} + +void lex_finalize(){ + yy_delete_buffer(lex_state); +} + +int yywrap(){ + return 1; +}
new file mode 100644 --- /dev/null +++ b/progs/minccalc/minccalc.c @@ -0,0 +1,403 @@ +/* ----------------------------- MNI Header ----------------------------------- +minccalc.c +A expression parser that works voxel-by-voxel for minc files + +Andrew Janke - rotor@cmr.uq.edu.au +Center for Magnetic Resonance +University of Queensland + +Original Grammar and parser by +David Leonard - leonard@csee.uq.edu.au +Department of Computer Science +University of Queensland + +This is predominately a rehash of mincmath by Peter Neelin + +Mon May 21 01:01:01 EST 2000 - Original version "imgcalc" by David Leonard +Mon May 28 01:00:01 EST 2000 - First minc version - Andrew Janke +Thu Oct 5 17:09:12 EST 2000 - First alpha version +Thu Dec 21 17:26:46 EST 2000 - Added use of voxel_loop +---------------------------------------------------------------------------- */ + +#ifndef lint +static char rcsid[]="$Header: /private-cvsroot/minc/progs/minccalc/minccalc.c,v 1.1 2001-04-24 18:14:03 neelin Exp $"; +#endif + +#include <stdlib.h> +#include <stdio.h> +#include <sys/types.h> +#include <sys/stat.h> +#include <string.h> +#include <float.h> +#include <limits.h> +#include <math.h> +#include <ParseArgv.h> +#include <voxel_loop.h> +#include <time_stamp.h> +#include <minc_def.h> +#include "node.h" + +/* Constants */ +#ifndef public +# define public +#endif + +#ifndef TRUE +# define TRUE 1 +# define FALSE 0 +#endif + +/* Data values for invalid data and for uninitialized data */ +#define INVALID_DATA -DBL_MAX +#define UNINITIALIZED_DATA DBL_MAX + +/* Values for representing default case for command-line options */ +#define DEFAULT_DBL DBL_MAX +#define DEFAULT_BOOL -1 + +/* Structure for window information */ +typedef struct { + int num_constants; + double constants[2]; + int propagate_nan; + double illegal_value; +} Math_Data; + +/* Function prototypes */ +public void do_math(void *caller_data, long num_voxels, + int input_num_buffers, + int input_vector_length, double *input_data[], + int output_num_buffers, int output_vector_length, + double *output_data[], Loop_Info *loop_info); +public char **read_file_names(char *filelist, int *num_files); + +/* Argument variables */ +int clobber = FALSE; +int verbose = TRUE; +int debug = FALSE; +int is_signed = FALSE; +int propagate_nan = TRUE; +int check_dim_info = TRUE; +int copy_all_header = DEFAULT_BOOL; +int use_nan_for_illegal_values = TRUE; +int max_buffer_size_in_kb = 4 * 1024; +double valid_range[2] = {0.0, 0.0}; +double constant = DEFAULT_DBL; +double constant2[2] = {DEFAULT_DBL, DEFAULT_DBL}; +double value_for_illegal_operations = DEFAULT_DBL; +nc_type datatype = MI_ORIGINAL_TYPE; +char *filelist = NULL; +const char *expression = NULL; + +/* Argument table */ +ArgvInfo argTable[] = { + {NULL, ARGV_HELP, (char *) NULL, (char *) NULL, + "General options:"}, + {"-clobber", ARGV_CONSTANT, (char *) TRUE, (char *) &clobber, + "Overwrite existing file."}, + {"-noclobber", ARGV_CONSTANT, (char *) FALSE, (char *) &clobber, + "Don't overwrite existing file (default)."}, + {"-no_clobber", ARGV_CONSTANT, (char *) FALSE, (char *) &clobber, + "Synonym for -noclobber."}, + {"-verbose", ARGV_CONSTANT, (char *) TRUE, (char *) &verbose, + "Print out log messages (default)."}, + {"-quiet", ARGV_CONSTANT, (char *) FALSE, (char *) &verbose, + "Do not print out log messages."}, + {"-debug", ARGV_CONSTANT, (char *) TRUE, (char *) &debug, + "Print out debugging messages."}, + {"-filelist", ARGV_STRING, (char *) 1, (char *) &filelist, + "Specify the name of a file containing input file names (- for stdin)."}, + {"-copy_header", ARGV_CONSTANT, (char *) TRUE, (char *) ©_all_header, + "Copy all of the header from the first file."}, + {"-nocopy_header", ARGV_CONSTANT, (char *) FALSE, (char *) ©_all_header, + "Do not copy all of the header from the first file."}, + {"-filetype", ARGV_CONSTANT, (char *) MI_ORIGINAL_TYPE, (char *) &datatype, + "Use data type of first file (default)."}, + {"-byte", ARGV_CONSTANT, (char *) NC_BYTE, (char *) &datatype, + "Write out byte data."}, + {"-short", ARGV_CONSTANT, (char *) NC_SHORT, (char *) &datatype, + "Write out short integer data."}, + {"-int", ARGV_CONSTANT, (char *) NC_INT, (char *) &datatype, + "Write out 32-bit integer data."}, + {"-long", ARGV_CONSTANT, (char *) NC_INT, (char *) &datatype, + "Superseded by -int."}, + {"-float", ARGV_CONSTANT, (char *) NC_FLOAT, (char *) &datatype, + "Write out single-precision floating-point data."}, + {"-double", ARGV_CONSTANT, (char *) NC_DOUBLE, (char *) &datatype, + "Write out double-precision floating-point data."}, + {"-signed", ARGV_CONSTANT, (char *) TRUE, (char *) &is_signed, + "Write signed integer data."}, + {"-unsigned", ARGV_CONSTANT, (char *) FALSE, (char *) &is_signed, + "Write unsigned integer data (default if type specified)."}, + {"-range", ARGV_FLOAT, (char *) 2, (char *) valid_range, + "Valid range for output data."}, + {"-max_buffer_size_in_kb", ARGV_INT, (char *) 1, + (char *) &max_buffer_size_in_kb, + "Specify the maximum size of the internal buffers (in kbytes)."}, + {"-check_dimensions", ARGV_CONSTANT, (char *) TRUE, + (char *) &check_dim_info, + "Check that files have matching dimensions (default)."}, + {"-nocheck_dimensions", ARGV_CONSTANT, (char *) FALSE, + (char *) &check_dim_info, + "Do not check that files have matching dimensions."}, + {"-ignore_nan", ARGV_CONSTANT, (char *) FALSE, (char *) &propagate_nan, + "Ignore invalid data (NaN) for accumulations."}, + {"-propagate_nan", ARGV_CONSTANT, (char *) TRUE, (char *) &propagate_nan, + "Invalid data in any file at a voxel produces a NaN (default)."}, + {"-nan", ARGV_CONSTANT, (char *) TRUE, + (char *) &use_nan_for_illegal_values, + "Output NaN when an illegal operation is done (default)."}, + {"-zero", ARGV_CONSTANT, (char *) FALSE, + (char *) &use_nan_for_illegal_values, + "Output zero when an illegal operation is done."}, + {"-illegal_value", ARGV_FLOAT, (char *) 1, + (char *) &value_for_illegal_operations, + "Value to write out when an illegal operation is done."}, + {"-expression", ARGV_STRING, (char*)1, (char*) &expression, + "Expression to use in calculations."}, + {NULL, ARGV_END, NULL, NULL, NULL} +}; + +extern int yydebug; +sym_t rootsym; +vector_t A; + +/* Main program */ +public int main(int argc, char *argv[]){ + char **infiles, **outfiles; + int nfiles, nout; + char *arg_string; + Math_Data math_data; + Loop_Options *loop_options; + char *pname; + int i; + + + /* Save time stamp and args */ + arg_string = time_stamp(argc, argv); + + /* Get arguments */ + pname = argv[0]; + if (ParseArgv(&argc, argv, argTable, 0) || (argc < 2)) { + (void) fprintf(stderr, + "\nUsage: %s [options] [<in1.mnc> ...] <out.mnc>\n", + pname); + (void) fprintf(stderr, + " %s -help\n\n", pname); + exit(EXIT_FAILURE); + } + nout = 1; + outfiles = &argv[argc-1]; + + /* Get the list of input files either from the command line or + from a file, or report an error if both are specified */ + + nfiles = argc - 2; + if (filelist == NULL) { + infiles = &argv[1]; + } + else if (nfiles <= 0) { + infiles = read_file_names(filelist, &nfiles); + if (infiles == NULL) { + (void) fprintf(stderr, + "Error reading in file names from file \"%s\"\n", + filelist); + exit(EXIT_FAILURE); + } + } + else { + (void) fprintf(stderr, + "Do not specify both -filelist and input file names\n"); + exit(EXIT_FAILURE); + } + + /* Make sure that we have something to process */ + if (nfiles == 0) { + (void) fprintf(stderr, "No input files specified\n"); + exit(EXIT_FAILURE); + } + + /* Parse expression argument */ + if (expression == NULL) { + (void) fprintf(stderr, + "An expression must be specified on the command line\n"); + exit(EXIT_FAILURE); + } + if (debug) fprintf(stderr, "Feeding in expression %s\n", expression); + lex_init(expression); + if (debug) yydebug = 1; else yydebug = 0; + yyparse(); + lex_finalize(); + + /* Optimize the expression tree */ + root = optimize(root); + + /* Setup the input vector from the input files */ + A = new_vector(); + for (i=0; i<nfiles; i++) { + if (debug) fprintf(stderr,"Getting file[%d] %s\n", i, argv[i+1]); + vector_append(A, 0); + } + + /* Construct initial symbol table from the A vector */ + rootsym = sym_enter_vector(A, new_ident("A"), NULL); + + /* Set default copy_all_header according to number of input files */ + if (copy_all_header == DEFAULT_BOOL) + copy_all_header = (nfiles == 1); + + if (value_for_illegal_operations != DEFAULT_DBL) + math_data.illegal_value = value_for_illegal_operations; + else if (use_nan_for_illegal_values) + math_data.illegal_value = INVALID_DATA; + else + math_data.illegal_value = 0.0; + + /* Do math */ + loop_options = create_loop_options(); + set_loop_verbose(loop_options, verbose); + set_loop_clobber(loop_options, clobber); + set_loop_datatype(loop_options, datatype, is_signed, valid_range[0], valid_range[1]); + set_loop_copy_all_header(loop_options, copy_all_header); + set_loop_buffer_size(loop_options, (long) 1024 * max_buffer_size_in_kb); + set_loop_check_dim_info(loop_options, check_dim_info); + voxel_loop(nfiles, infiles, nout, outfiles, arg_string, loop_options, + do_math, (void *) &math_data); + free_loop_options(loop_options); + + + /* Clean up */ + sym_leave(rootsym); + exit(EXIT_SUCCESS); +} + +/* ----------------------------- MNI Header ----------------------------------- +@NAME : do_math +@INPUT : Standard for voxel loop +@OUTPUT : Standard for voxel loop +@RETURNS : (nothing) +@DESCRIPTION: Routine doing math operations. +@METHOD : +@GLOBALS : +@CALLS : +@CREATED : April 25, 1995 (Peter Neelin) +@MODIFIED : Thu Dec 21 17:08:40 EST 2000 (Andrew Janke - rotor@cmr.uq.edu.au) +---------------------------------------------------------------------------- */ +public void do_math(void *caller_data, long num_voxels, + int input_num_buffers, int input_vector_length, + double *input_data[], + int output_num_buffers, int output_vector_length, + double *output_data[], + Loop_Info *loop_info){ + long ivox, i; + + /* Check arguments */ + if ((output_num_buffers != 1) || + (output_vector_length != input_vector_length)) { + (void) fprintf(stderr, "Bad arguments to do_math!\n"); + exit(EXIT_FAILURE); + } + + /* Loop through the voxels */ + for (ivox=0; ivox < num_voxels*input_vector_length; ivox++) { + + for (i=0; i < input_num_buffers; i++){ + A->el[i] = input_data[i][ivox]; + } + + output_data[0][ivox] = eval_scalar(root, rootsym); + +/* if (debug) fprintf(stderr, "%e - %e = %e\n", value1, value2, output_data[0][ivox]); */ + + } + + return; +} + +/* ----------------------------- MNI Header ----------------------------------- +@NAME : read_file_names +@INPUT : filelist - name of file from which to read names +@OUTPUT : num_files - number of files read in +@RETURNS : Pointer to a NULL-terminated array of file names +@DESCRIPTION: Reads in a list of file names from file filelist or stdin if + "-" is specified. Returns NULL if an error occurs. If + no error occurs, then a pointer to an empty array is + returned and num_files is zero. +@METHOD : +@GLOBALS : +@CALLS : +@CREATED : March 8, 1995 (Peter Neelin) +@MODIFIED : +---------------------------------------------------------------------------- */ +public char **read_file_names(char *filelist, int *num_files) +{ +#define FILE_NAME_ALLOC_SIZE 10 + char **files; + int array_size; + int nfiles; + FILE *fp; + char line[PATH_MAX+1]; + int length; + + /* Open the file */ + if (strcmp(filelist, "-") == 0) { + fp = stdin; + } + else { + fp = fopen(filelist, "r"); + if (fp == NULL) { + (void) fprintf(stderr, "Error opening file \"%s\"\n", filelist); + return NULL; + } + } + + /* Allocate an initial array and NULL-terminate it */ + array_size = FILE_NAME_ALLOC_SIZE; + files = MALLOC(sizeof(*files) * array_size); + if (files == NULL) { + (void) fprintf(stderr, "Error allocating memory\n"); + return NULL; + } + nfiles = 0; + files[nfiles] = NULL; + + /* Read in file names */ + while (fgets(line, sizeof(line)/sizeof(line[0]), fp) != NULL) { + + /* Remove a trailing newline and check that there is a name */ + length = strlen(line); + if ((length > 0) && (line[length-1] == '\n')) { + line[length-1] = '\0'; + length--; + } + if (length == 0) continue; + + /* Make room for names if needed */ + while (nfiles >= array_size-1) { + array_size += FILE_NAME_ALLOC_SIZE; + files = REALLOC(files, sizeof(*files) * array_size); + if (files == NULL) { + (void) fprintf(stderr, "Error allocating memory\n"); + return NULL; + } + } + + /* Save the name, making sure that the list is NULL-terminated */ + files[nfiles] = strdup(line); + if (files[nfiles] == NULL) { + (void) fprintf(stderr, "Error allocating memory\n"); + return NULL; + } + nfiles++; + files[nfiles] = NULL; + } + + /* Close the file */ + (void) fclose(fp); + + /* Return the number of files */ + *num_files = nfiles; + + return files; +} +
new file mode 100644 --- /dev/null +++ b/progs/minccalc/minccalc.man1 @@ -0,0 +1,203 @@ +.\" Copyright 2000 Andrew Janke +.TH MINCCALC 1 + +.SH NAME +minccalc - perform complex math operations on minc files + +.SH SYNOPSIS +.B mincalc +[<options>] <in1>.mnc [<in2>.mnc...] <out>.mnc + +.SH DESCRIPTION +.I Minccalc +will perform complex, voxel-by-voxel math operations, on one or more +minc files of the same shape and having the same coordinate sampling, +producing a single output file. The operations to be performed are +input using the -expression argument (see EXPRESSIONS) + +.SH OPTIONS +Note that options can be specified in abbreviated form (as long as +they are unique) and can be given anywhere on the command line. + +.SH General options +.P +.I -clobber: +Overwrite an existing file. +.P +.I -noclobber: +Don't overwrite an existing file (default). +.P +.I -no_clobber: +Synonym for -noclobber. +.P +.I -verbose: +Print out progress information for each chunk of data copied (default). +.P +.I -quiet: +Do not print out progress information. +.P +.I -debug: +Print out debugging information. +.P +.I -copy_header: +Copy all of the header information from the first input file (default for +one input file). +.P +.I -nocopy_header: +Do not copy all of the header from the first input file; copy only +coordinate information (default for more than one input file). +.P +.I -filetype: +Create an output file with the same type as the first input file +(default). +.P +.I -byte: +Create an output file of type byte. +.P +.I -short: +Create an output file of type short. +.P +.I -int: +Create an output file of type int. +.P +.I -long: +Superseded by -int. +.P +.I -float: +Create an output file of type float. +.P +.I -double: +Create an output file of type double. +.P +.I -signed: +Create an output file with data stored in a signed type. This only +has an effect if the one of the -byte, -short or -long options is +specified. +.P +.I -unsigned: +Create an output file with data stored in an unsigned type. This only +has an effect if the one of the -byte, -short or -long options is +specified. +.P +.I -range +<min> <max>: +Create an output file with integer data stored in the specified +valid range. This only has an effect if the one of the -byte, -short +or -long options is specified. +.P +.I -max_buffer_size_in_kb +<size>: +Specify the maximum size of the internal buffers (in kbytes). Default +is 4 MB. +.P +.I -dimension +<dimname>: +Specify a dimension along which we wish to perform a cumulative +operation. +.P +.I -check_dimensions: +Check that all input files have matching sampling in world +dimensions (default). +.P +.I -nocheck_dimensions: +Ignore any differences in world dimensions sampling for input files . +.P +.I -propagate_nan: +Invalid data (Not-A-Number or NaN) at a voxel in any of the input +files will produce invalid data in the output file at that voxel +(default). +.P +.I -ignore_nan: +For cumulative operations, invalid data (NaN) in an input file is +ignored, ie. treated as though it is not present. +.P +.I -nan: +When an illegal operation is attempted at a voxel (such as divide by +zero), invalid data (NaN) is stored in the output file (default). Having +no valid input data for a cumulative operation is also considered an +illegal operation when -ignore_nan is used. +.P +.I -zero: +When an illegal operation is attempted at a voxel (such as divide by +zero), value zero is stored in the output file. +.P +.I -illegal_value +<value>: +When an illegal operation is attempted at a voxel (such as divide by +zero), the specified value is stored in the output file. + +.SH EXPRESSIONS +.P +The +.I -expression +argument is a single string that describes the function to evaluate. +The function expression is typically written in terms of the vector A + +For example, the following expression will sum the first two input files +together: + + A[0] + A[1] + +Besides normal scalar operators such as +, -, * and /, +the expression language also supports the infix exponentiation +operator ^ . + +There are two types of values in the language: vectors and scalars. +Scalars literals are floating point numbers or may appear as symbols +whose name starts with a lowercase letter. + +Vectors can be written in the following `extensional' form + + { value1, value2, ... } + +or by using the following range-generating notations: + + [ a , b ] generates {a, a+1, ..., b-1, b} + [ a , b ) generates {a, a+1, ..., b-1} + ( a , b ] generates {a+1, ..., b-1, b} + ( a , b ) generates {a+1, ..., b-1} + +or be generated, by `intension'. + +For example, the following intension expression generates the vector {3,2,1}: + + { i in [1,3] | 4 - i } + +Vectors may also appear as symbols whose name starts with an uppercase letter. + +Symbol names are introduced with let-expressions. +For example, the following expression will always evaluate to 3: + + let a = 1, b = 2 in a + b + +In addition to the scalar operators, the following vector operators are +supplied. + + avg - the average value of the scalars in vector + len - the length of + sum - the sum of the elements of + prod - the product of the elements of + V[s] - the s'th element of vector V with origin 0. + +.SH CAVEATS +A few things you should remember... + +Vector variables must start with an uppercase letter. + +As optimisation of the tree is not inculded in this release it'd be +advantageous if you made use of let-expressions to speed your calculations. + + "(avg[A] - 1) * (avg[A] + 1)" + + is less efficient written as + + "let avg_a = avg[A] in (avg_a - 1) * (avg_a + 1)" + +.SH AUTHOR +Andrew Janke - rotor@cmr.uq.edu.au + +.SH COPYRIGHTS +.ps 18 +Copyright 2000 by Andrew Janke + +
new file mode 100644 --- /dev/null +++ b/progs/minccalc/node.c @@ -0,0 +1,38 @@ +/* Copyright David Leonard and Andrew Janke, 2000. All rights reserved. */ + +#include <stdlib.h> +#include "node.h" + +struct nodename { enum nodetype type; const char *name; } +nodenames[] = { + { NODETYPE_ADD, "add" }, + { NODETYPE_SUB, "sub" }, + { NODETYPE_MUL, "mul" }, + { NODETYPE_DIV, "div" }, + { NODETYPE_EXP, "exp" }, + { NODETYPE_INDEX, "index" }, + { NODETYPE_SUM, "sum" }, + { NODETYPE_AVG, "avg" }, + { NODETYPE_LEN, "len" }, + { NODETYPE_IDENT, "ident" }, + { NODETYPE_REAL, "real" }, + { NODETYPE_LET, "let" }, + { NODETYPE_VEC1, "vec1" }, + { NODETYPE_VEC2, "vec2" }, + { 0, NULL } +}; + +node_t new_node(){ + node_t n; + n = malloc(sizeof *n); + return n; +} + +const char *node_name(node_t n){ + struct nodename *p; + + for (p = nodenames; p->name; p++) + if (p->type == n->type) + return p->name; + return "unknown"; +}
new file mode 100644 --- /dev/null +++ b/progs/minccalc/node.h @@ -0,0 +1,80 @@ +#include "errx.h" + +struct node; +struct vector; +struct sym; + +typedef double scalar_t; +typedef int ident_t; +typedef struct node *node_t; +typedef struct vector *vector_t; +typedef struct sym *sym_t; + +#define SCALAR_ROUND(s) (floorf(s + 0.5)) + +struct vector { + int len; + scalar_t *el; + int maxlen; + int refcnt; +}; + +enum nodetype { + NODETYPE_ADD, + NODETYPE_SUB, + NODETYPE_MUL, + NODETYPE_DIV, + NODETYPE_EXP, + NODETYPE_INDEX, + NODETYPE_SUM, + NODETYPE_AVG, + NODETYPE_LEN, + NODETYPE_IDENT, + NODETYPE_REAL, + NODETYPE_LET, + NODETYPE_VEC1, + NODETYPE_VEC2, + NODETYPE_GEN, + NODETYPE_RANGE, +}; + +#define RANGE_EXACT_UPPER 1 +#define RANGE_EXACT_LOWER 2 + +struct node { + enum nodetype type; + node_t expr[3]; + ident_t ident; + int flags; + float real; + int pos; +}; + +ident_t new_ident(const char *); +const char *ident_str(ident_t); +int ident_is_scalar(ident_t); + +node_t new_node(void); +const char * node_name(node_t); +node_t optimize(node_t); + +vector_t new_vector(void); +void vector_append(vector_t, scalar_t); +void vector_free(vector_t); + +sym_t sym_enter_scalar(scalar_t, ident_t, sym_t); +sym_t sym_enter_vector(vector_t, ident_t, sym_t); +sym_t sym_leave(sym_t); +scalar_t sym_lookup_scalar(ident_t, sym_t); +vector_t sym_lookup_vector(ident_t, sym_t); + +void lex_init(const char *); +void lex_finalize(void); + +scalar_t eval_scalar(node_t, sym_t); +void show_error(int, const char *); + +int yyparse(void); +int yylex(void); +extern node_t root; +
new file mode 100644 --- /dev/null +++ b/progs/minccalc/optim.c @@ -0,0 +1,5 @@ +#include "node.h" + +node_t optimize(node_t root){ + return root; +}
new file mode 100644 --- /dev/null +++ b/progs/minccalc/sym.c @@ -0,0 +1,72 @@ +/* Copyright David Leonard and Andrew Janke, 2000. All rights reserved. */ + +#include <stdio.h> +#include <stdlib.h> +#include "node.h" + +struct sym { + ident_t ident; + char is_scalar; + scalar_t scalar; + vector_t vector; + sym_t next; +}; + +static sym_t new_sym(ident_t id, sym_t sym){ + sym_t newsym; + + newsym = malloc(sizeof *newsym); + newsym->ident = id; + newsym->next = sym; + return newsym; +} + +sym_t sym_enter_scalar(scalar_t sc, ident_t id, sym_t sym){ + sym_t newsym = new_sym(id, sym); + newsym->is_scalar = 1; + newsym->scalar = sc; + return newsym; +} + +sym_t sym_enter_vector(vector_t v, ident_t id, sym_t sym){ + sym_t newsym = new_sym(id, sym); + newsym->is_scalar = 0; + newsym->vector = v; + return newsym; +} + +static sym_t sym_lookup(ident_t id, sym_t sym){ + while (sym) { + if (sym->ident == id) + break; + sym = sym->next; + } + return sym; +} + +scalar_t sym_lookup_scalar(ident_t id, sym_t sym){ + sym_t s = sym_lookup(id, sym); + if (!s) + /* errx(1, "%s undefined", ident_str(id)); */ + fprintf(stderr, "%s undefined", ident_str(id)); + if (!s->is_scalar) + /* errx(1, "%s is not scalar (lowercase)", ident_str(id)); */ + fprintf(stderr, "%s is not scalar (lowercase)", ident_str(id)); + return s->scalar; +} + +vector_t sym_lookup_vector(ident_t id, sym_t sym){ + sym_t s = sym_lookup(id, sym); + if (!s) + /* errx(1, "%s undefined", ident_str(id)); */ + fprintf(stderr, "%s undefined", ident_str(id)); + if (s->is_scalar) + return NULL; + return s->vector; +} + +sym_t sym_leave(sym_t sym){ + sym_t osym = sym->next; + free(sym); + return osym; +}
new file mode 100644 --- /dev/null +++ b/progs/minccalc/vector.c @@ -0,0 +1,33 @@ +/* Copyright David Leonard and Andrew Janke, 2000. All rights reserved. */ + +#include <stdlib.h> +#include "node.h" + +#define INIT_SIZE 20 + +vector_t new_vector(){ + vector_t v; + + v = malloc(sizeof *v); + v->maxlen = INIT_SIZE; + v->el = malloc(INIT_SIZE * sizeof v->el[0]); + v->len = 0; + v->refcnt = 1; + return v; +} + +void vector_append(vector_t v, scalar_t s){ + if (v->len + 1 == v->maxlen) { + v->maxlen *= 2; + v->el = realloc(v->el, v->maxlen * sizeof v->el[0]); + } + v->el[v->len++] = s; +} + +void vector_free(vector_t v){ + if (--v->refcnt == 0) { + free(v->el); + v->el = NULL; + free(v); + } +}
new file mode 100644 --- /dev/null +++ b/progs/minccalc/y.tab.h @@ -0,0 +1,16 @@ +#define IN 257 +#define TO 258 +#define IDENT 259 +#define REAL 260 +#define AVG 261 +#define SUM 262 +#define LET 263 +#define NEG 264 +#define LEN 265 +typedef union{ +int pos; +node_t node; +float real; +ident_t ident; +} YYSTYPE; +extern YYSTYPE yylval;