ack/util/grind/tree.c

454 lines
8.5 KiB
C
Raw Normal View History

1990-08-31 18:22:53 +00:00
/* $Header$ */
#include <stdio.h>
#include <varargs.h>
#include <assert.h>
#include <alloc.h>
#include <out.h>
#include "operator.h"
#include "position.h"
#include "file.h"
#include "idf.h"
#include "tree.h"
#include "message.h"
#include "scope.h"
#include "symbol.h"
#include "langdep.h"
1990-09-12 16:13:59 +00:00
#include "type.h"
1990-09-19 14:31:12 +00:00
#include "expr.h"
1990-08-31 18:22:53 +00:00
extern FILE *db_out;
1990-10-17 17:00:03 +00:00
t_lineno currline;
t_lineno listline;
1990-08-31 18:22:53 +00:00
extern char *strrindex();
extern int interrupted;
1990-08-31 18:22:53 +00:00
/*VARARGS1*/
p_tree
mknode(va_alist)
va_dcl
{
va_list ap;
register p_tree p = new_tree();
va_start(ap);
{
register int i, na;
p->t_oper = va_arg(ap, int);
switch(p->t_oper) {
case OP_NAME:
case OP_HELP:
1990-08-31 18:22:53 +00:00
p->t_idf = va_arg(ap, struct idf *);
p->t_str = va_arg(ap, char *);
break;
1990-09-07 14:56:24 +00:00
case OP_STRING:
p->t_sval = va_arg(ap, char *);
break;
case OP_REAL:
p->t_fval = va_arg(ap, double);
break;
1990-08-31 18:22:53 +00:00
case OP_AT:
p->t_lino = va_arg(ap, long);
p->t_filename = va_arg(ap, char *);
break;
1990-09-20 17:51:14 +00:00
case OP_INTEGER:
1990-08-31 18:22:53 +00:00
p->t_ival = va_arg(ap, long);
break;
default:
na = nargs(p->t_oper);
assert(na <= MAXARGS);
for (i = 0; i < na; i++) {
p->t_args[i] = va_arg(ap, p_tree);
}
break;
}
}
va_end(ap);
return p;
}
freenode(p)
register p_tree p;
{
register int na, i;
if (! p) return;
1990-09-07 14:56:24 +00:00
na = nargs(p->t_oper);
assert(na <= MAXARGS);
for (i = 0; i < na; i++) {
freenode(p->t_args[i]);
1990-08-31 18:22:53 +00:00
}
free_tree(p);
}
t_addr
1990-09-25 17:40:47 +00:00
get_addr_from_node(p)
1990-09-21 16:58:20 +00:00
p_tree p;
{
t_addr a = ILL_ADDR;
register p_symbol sym;
if (! p) return NO_ADDR;
if (p->t_address != 0) return p->t_address;
switch(p->t_oper) {
case OP_AT:
if (! p->t_filename &&
(! listfile || ! (p->t_filename = listfile->sy_idf->id_text))) {
error("no current file");
break;
}
a = get_addr_from_position(&(p->t_pos));
if (a == ILL_ADDR) {
error("could not determine address of \"%s\":%d",
p->t_filename, p->t_lino);
break;
}
p->t_address = a;
break;
case OP_IN:
1990-09-25 17:40:47 +00:00
a = get_addr_from_node(p->t_args[0]);
1990-10-17 17:00:03 +00:00
if (p->t_args[1]) {
p_scope sc;
a = get_addr_from_node(p->t_args[1]);
sc = base_scope(get_scope_from_addr(a));
sym = identify(p->t_args[0], FUNCTION|PROC|MODULE);
if (! sym->sy_name.nm_scope ||
! sym->sy_name.nm_scope->sc_bp_opp) {
error("could not determine address of \"%s\"", p->t_str);
a = ILL_ADDR;
break;
}
if (sc->sc_definedby != sym) {
error("inconsistent address");
a = ILL_ADDR;
break;
}
}
1990-09-21 16:58:20 +00:00
p->t_address = a;
break;
case OP_NAME:
case OP_SELECT:
sym = identify(p, FUNCTION|PROC|MODULE);
if (! sym) {
break;
}
if (! sym->sy_name.nm_scope || ! sym->sy_name.nm_scope->sc_bp_opp) {
error("could not determine address of \"%s\"", p->t_str);
break;
}
a = sym->sy_name.nm_scope->sc_bp_opp;
break;
default:
assert(0);
}
return a;
}
1990-08-31 18:22:53 +00:00
print_node(p, top_level)
register p_tree p;
{
if (!p) return;
switch(p->t_oper) {
case OP_LIST:
fputs("list ", db_out);
if (p->t_args[0]) {
print_node(p->t_args[0], 0);
if (p->t_args[1]) {
if (p->t_args[1]->t_ival >= 0) {
fputs(", ", db_out);
print_node(p->t_args[1], 0);
}
else {
if (p->t_args[1]->t_ival < -100000000) {
fputs("-", db_out);
}
else print_node(p->t_args[1], 0);
}
1990-08-31 18:22:53 +00:00
}
}
break;
case OP_PRINT:
fputs("print ", db_out);
print_node(p->t_args[0], 0);
break;
case OP_ENABLE:
fputs("enable ", db_out);
print_node(p->t_args[0], 0);
break;
case OP_DISABLE:
fputs("disable ", db_out);
print_node(p->t_args[0], 0);
break;
1990-09-20 17:51:14 +00:00
case OP_DISPLAY:
fputs("display ", db_out);
print_node(p->t_args[0], 0);
break;
case OP_LINK:
print_node(p->t_args[0], 0);
fputs(", ", db_out);
print_node(p->t_args[1], 0);
break;
1990-08-31 18:22:53 +00:00
case OP_FILE:
fputs("file ", db_out);
print_node(p->t_args[0], 0);
break;
1990-09-19 14:31:12 +00:00
case OP_SET:
fputs("set ", db_out);
print_node(p->t_args[0], 0);
fputs(" to ", db_out);
print_node(p->t_args[1], 0);
break;
1990-09-20 17:51:14 +00:00
case OP_FIND:
fputs("find ", db_out);
print_node(p->t_args[0], 0);
break;
case OP_WHICH:
fputs("which ", db_out);
print_node(p->t_args[0], 0);
break;
1990-08-31 18:22:53 +00:00
case OP_DELETE:
fputs("delete ", db_out);
print_node(p->t_args[0], 0);
1990-08-31 18:22:53 +00:00
break;
case OP_REGS:
1990-10-17 17:00:03 +00:00
fputs("regs ", db_out);
print_node(p->t_args[0], 0);
1990-08-31 18:22:53 +00:00
break;
case OP_NEXT:
1990-10-17 17:00:03 +00:00
fputs("next ", db_out);
print_node(p->t_args[0], 0);
1990-08-31 18:22:53 +00:00
break;
case OP_STEP:
1990-10-17 17:00:03 +00:00
fputs("step ", db_out);
print_node(p->t_args[0], 0);
1990-08-31 18:22:53 +00:00
break;
case OP_STATUS:
fputs("status", db_out);
break;
case OP_DUMP:
fputs("dump ", db_out);
print_position(p->t_address, 1);
break;
case OP_RESTORE:
1990-10-17 17:00:03 +00:00
fputs("restore ", db_out);
print_node(p->t_args[0], 0);
1990-08-31 18:22:53 +00:00
break;
case OP_WHERE:
1990-10-17 17:00:03 +00:00
fputs("where ", db_out);
print_node(p->t_args[0], 0);
1990-08-31 18:22:53 +00:00
break;
case OP_HELP:
1990-10-17 17:00:03 +00:00
fputs("help ", db_out);
print_node(p->t_args[0], 0);
break;
1990-08-31 18:22:53 +00:00
case OP_CONT:
fputs("cont", db_out);
if (p->t_args[0]) {
1990-09-20 17:51:14 +00:00
fprintf(db_out, " %ld", p->t_args[0]->t_ival);
1990-08-31 18:22:53 +00:00
}
if (p->t_args[1]) {
fputs(" ", db_out);
print_node(p->t_args[1], 0);
}
break;
case OP_WHEN:
fputs("when ", db_out);
if (p->t_address != NO_ADDR) {
print_position(p->t_address, 1);
}
else print_node(p->t_args[0], 0);
if (p->t_args[1]) {
fputs(" if ", db_out);
print_node(p->t_args[1], 0);
}
p = p->t_args[2];
fputs(" { ", db_out);
1990-10-17 17:00:03 +00:00
while (p && p->t_oper == OP_LINK) {
1990-08-31 18:22:53 +00:00
print_node(p->t_args[0], 0);
fputs("; ", db_out);
p = p->t_args[1];
}
print_node(p, 0);
fputs(" }", db_out);
break;
case OP_STOP:
fputs("stop ", db_out);
if (p->t_address != NO_ADDR) {
print_position(p->t_address, 1);
}
else print_node(p->t_args[0], 0);
if (p->t_args[1]) {
fputs(" if ", db_out);
print_node(p->t_args[1], 0);
}
break;
case OP_TRACE:
fputs("trace ", db_out);
if (p->t_args[2]) {
fputs("on ", db_out);
print_node(p->t_args[2], 0);
fputs(" ", db_out);
}
if (p->t_address != NO_ADDR) {
print_position(p->t_address, 1);
}
else print_node(p->t_args[0], 0);
if (p->t_args[1]) {
fputs(" if ", db_out);
print_node(p->t_args[1], 0);
}
break;
case OP_AT:
fprintf(db_out, "at \"%s\":%ld", p->t_filename, p->t_lino);
break;
case OP_IN:
fputs("in ", db_out);
print_node(p->t_args[0], 0);
1990-10-17 17:00:03 +00:00
fputs(" ", db_out);
print_node(p->t_args[1], 0);
1990-08-31 18:22:53 +00:00
break;
case OP_SELECT:
print_node(p->t_args[0], 0);
fputs("`", db_out);
print_node(p->t_args[1], 0);
break;
case OP_NAME:
fputs(p->t_str, db_out);
break;
case OP_INTEGER:
1990-09-12 16:13:59 +00:00
fprintf(db_out, currlang->decint_fmt, p->t_ival);
1990-08-31 18:22:53 +00:00
break;
1990-09-07 14:56:24 +00:00
case OP_STRING:
1990-09-14 14:37:26 +00:00
(*currlang->printstring)(p->t_sval, strlen(p->t_sval));
1990-09-07 14:56:24 +00:00
break;
case OP_REAL:
1990-09-12 16:13:59 +00:00
fprintf(db_out, currlang->real_fmt, p->t_fval);
break;
case OP_FORMAT:
print_node(p->t_args[0], 0);
fputs("\\", db_out);
print_node(p->t_args[1], 0);
break;
1990-09-12 16:13:59 +00:00
case OP_UNOP:
case OP_BINOP:
(*currlang->printop)(p);
1990-09-07 14:56:24 +00:00
break;
1990-10-17 17:00:03 +00:00
default:
assert(0);
1990-08-31 18:22:53 +00:00
}
if (top_level) fputs("\n", db_out);
}
int
repeatable(com)
p_tree com;
{
switch(com->t_oper) {
case OP_CONT:
com->t_args[0]->t_ival = 1;
freenode(com->t_args[1]);
com->t_args[1] = 0;
return 1;
1990-08-31 18:22:53 +00:00
case OP_NEXT:
case OP_STEP:
1990-10-17 17:00:03 +00:00
freenode(com->t_args[0]);
com->t_args[0] = 0;
return 1;
1990-08-31 18:22:53 +00:00
case OP_LIST:
freenode(com->t_args[0]);
com->t_args[0] = 0;
freenode(com->t_args[1]);
com->t_args[1] = 0;
1990-08-31 18:22:53 +00:00
return 1;
}
return 0;
}
int
in_status(com)
p_tree com;
{
switch(com->t_oper) {
case OP_STOP:
case OP_WHEN:
case OP_TRACE:
case OP_DUMP:
1990-09-20 17:51:14 +00:00
case OP_DISPLAY:
1990-08-31 18:22:53 +00:00
return 1;
}
return 0;
}
eval(p)
p_tree p;
{
if (p && operators[p->t_oper].op_fun) (*operators[p->t_oper].op_fun)(p);
1990-08-31 18:22:53 +00:00
}
newfile(id)
register struct idf *id;
{
register p_symbol sym = Lookup(id, PervasiveScope, FILESYM);
1990-09-21 16:58:20 +00:00
if (listfile != sym) listline = 1;
listfile = sym;
if (! listfile) {
listline = 1;
listfile = add_file(id->id_text);
listfile->sy_file->f_scope = FileScope;
1990-08-31 18:22:53 +00:00
}
find_language(strrindex(id->id_text, '.'));
}
perform(p, a)
register p_tree p;
t_addr a;
{
switch(p->t_oper) {
case OP_WHEN:
if (p->t_args[1] && ! eval_cond(p->t_args[1])) break;
1990-08-31 18:22:53 +00:00
p = p->t_args[2];
1990-10-17 17:00:03 +00:00
while (p && p->t_oper == OP_LINK) {
if (interrupted) return;
1990-10-17 17:00:03 +00:00
if (p->t_args[0]) eval(p->t_args[0]);
1990-08-31 18:22:53 +00:00
p = p->t_args[1];
}
if (interrupted) return;
1990-10-17 17:00:03 +00:00
if (p) eval(p);
1990-08-31 18:22:53 +00:00
break;
case OP_TRACE:
if (p->t_args[0] && p->t_args[0]->t_oper == OP_IN) {
register p_scope sc = base_scope(CurrentScope);
if (sc != get_scope_from_addr(p->t_args[0]->t_address)) {
break;
}
}
if (interrupted) return;
if (p->t_args[1] && ! eval_cond(p->t_args[1])) break;
1990-09-21 16:58:20 +00:00
list_position(get_position_from_addr(a));
if (p->t_args[2]) do_print(p->t_args[2]);
1990-08-31 18:22:53 +00:00
break;
default:
assert(0);
}
}
1990-09-21 16:58:20 +00:00
list_position(pos)
p_position pos;
{
newfile(str2idf(pos->filename, 1));
currfile = listfile;
currline = pos->lineno;
lines(currfile->sy_file, (int)currline, (int)1);
listline = 0;
1990-09-21 16:58:20 +00:00
}