* Fixing of potential crash issue with function tables in compiler.
+ SYSTEM.h is now renamed to SYSTEMM2.h to avoid conflicts on non case sensitive filesystems.
!File: debugcst.h
-/*#define DEBUG 1 /* perform various self-tests */
+/*#define DEBUG 1 *//* perform various self-tests */
#define NDEBUG 1 /* disable assertions */
!File: inputtype.h
!File: squeeze.h
-/*#define SQUEEZE 1 /* define on "small" machines */
+/*#define SQUEEZE 1 *//* define on "small" machines */
!File: strict3rd.h
-/*#define STRICT_3RD_ED 1 /* define on "small" machines, and if you want
+/*#define STRICT_3RD_ED 1 *//* define on "small" machines, and if you want
a compiler that only implements "3rd edition"
Modula-2
*/
!File: nocross.h
-/*#define NOCROSS 1 /* define when cross-compiler not needed */
+/*#define NOCROSS 1 *//* define when cross-compiler not needed */
!File: nostrict.h
-/*#define NOSTRICT 1 /* define when STRICT warnings disabled
+/*#define NOSTRICT 1 *//* define when STRICT warnings disabled
(yet another squeezing method)
*/
#include "f_info.h"
#include "Lpars.h"
#include "class.h"
+#include "error.h"
#include "idf.h"
#include "def.h"
#include "type.h"
extern char options[];
extern int flt_status;
-STATIC
-SkipComment()
+static void SkipComment(void)
{
/* Skip Modula-2 comments (* ... *).
Note that comments may be nested (par. 3.5).
}
}
-STATIC struct string *
-GetString(upto)
+static struct string *GetString(int upto)
{
/* Read a Modula-2 string, delimited by the character "upto".
*/
static char *s_error = "illegal line directive";
-STATIC int
-getch()
+static int getch(void)
{
register int ch;
return ch;
}
-void
-CheckForLineDirective()
+void CheckForLineDirective(void)
{
register int ch = getch();
register int i = 0;
}
}
-STATIC
-CheckForLet()
+static void CheckForLet()
{
register int ch;
}
}
-int
-LLlex()
+int LLlex(void)
{
/* LLlex() is the Lexical Analyzer.
The putting aside of tokens is taken into account.
extern int token_nmb;
extern int tk_nmb_at_last_syn_err;
+
+void CheckForLineDirective(void);
#include <em_arith.h>
#include <em_label.h>
-#include "parameters.h"
+#include "parameters.h"
#include "idf.h"
+#include "error.h"
#include "LLlex.h"
#include "Lpars.h"
+#include "misc.h"
extern char *symbol2str();
-extern t_idf *gen_anon_idf();
-LLmessage(tk)
- register int tk;
+
+void LLmessage(register int tk)
{
if (tk > 0) {
/* if (tk > 0), it represents the token to be inserted.
cases themselves.
*/
-#include "parameters.h"
+#include "parameters.h"
#include "debug.h"
-#include <em_label.h>
-#include <em_arith.h>
-#include <em_code.h>
-#include <alloc.h>
#include <assert.h>
+#include "em_label.h"
+#include "em_arith.h"
+#include "em_code.h"
+#include "alloc.h"
+
#include "Lpars.h"
#include "type.h"
+#include "error.h"
#include "LLlex.h"
#include "node.h"
#include "desig.h"
#include "walk.h"
+#include "code.h"
+#include "typequiv.h"
#include "chk_expr.h"
#include "def.h"
arith ce_low, ce_up; /* lower and upper bound of range */
};
-void AddCases();
-void AddOneCase();
+
/* STATICALLOCDEF "case_entry" 20 */
+
+
/* The constant DENSITY determines when CSA and when CSB instructions
are generated. Reasonable values are: 2, 3, 4.
On machines that have lots of address space and memory, higher values
may be lower.
*/
-compact(nr, low, up)
- arith low, up;
+static int compact(int nr, arith low, arith up)
{
/* Careful! up - low might not fit in an arith. And then,
the test "up-low < 0" might also not work to detect this
}
#define nd_lab nd_symb
-int
-CaseCode(nd, exitlabel, end_reached)
- t_node *nd;
- label exitlabel;
+static void AddOneCase(struct switch_hdr *sh, t_node *lnode, t_node *rnode, label lbl)
+{
+ register struct case_entry *ce = new_case_entry();
+ register struct case_entry *c1 = sh->sh_entries, *c2 = 0;
+ int fund = sh->sh_type->tp_fund;
+ arith diff;
+
+ if (! ChkCompat(&lnode, sh->sh_type, "case") ||
+ ! ChkCompat(&rnode, sh->sh_type, "case")) {
+ }
+ ce->ce_label = lbl;
+ ce->ce_low = lnode->nd_INT;
+ ce->ce_up = rnode->nd_INT;
+ diff = rnode->nd_INT - lnode->nd_INT;
+#define MAXRANGE 100
+ if (diff < 0 || diff > MAXRANGE) {
+ /* This is a bit of a hack, but it prevents the compiler
+ from crashing on things like
+ CASE a OF
+ 10 .. MAX(CARDINAL): ....
+
+ If the range covers more than MAXRANGE cases, this case
+ is dealt with separately.
+ */
+ label cont = ++text_label;
+
+ C_dup(int_size);
+ C_loc(lnode->nd_INT);
+ if (fund == T_INTEGER) {
+ C_blt(cont);
+ }
+ else {
+ C_cmu(int_size);
+ C_zlt(cont);
+ }
+ C_dup(int_size);
+ C_loc(rnode->nd_INT);
+ if (fund == T_INTEGER) {
+ C_bgt(cont);
+ }
+ else {
+ C_cmu(int_size);
+ C_zgt(cont);
+ }
+ C_asp(int_size);
+ c_bra(lbl);
+ C_df_ilb(cont);
+ ce->ce_label = 0;
+ }
+ if (sh->sh_entries == 0) {
+ /* first case entry
+ */
+ sh->sh_entries = ce;
+ if (ce->ce_label) {
+ sh->sh_lowerbd = ce->ce_low;
+ sh->sh_upperbd = ce->ce_up;
+ }
+ }
+ else {
+ /* second etc. case entry
+ find the proper place to put ce into the list
+ */
+
+ while (c1 && chk_bounds(c1->ce_low, ce->ce_low, fund)) {
+ c2 = c1;
+ c1 = c1->ce_next;
+ }
+ /* At this point three cases are possible:
+ 1: c1 != 0 && c2 != 0:
+ insert ce somewhere in the middle
+ 2: c1 != 0 && c2 == 0:
+ insert ce right after the head
+ 3: c1 == 0 && c2 != 0:
+ append ce to last element
+ The case c1 == 0 && c2 == 0 cannot occur, since
+ the list is guaranteed not to be empty.
+ */
+ if (c2) {
+ if ( chk_bounds(ce->ce_low, c2->ce_up, fund)) {
+node_error(rnode, "multiple case entry for value %ld", (long)(ce->ce_low));
+ free_case_entry(ce);
+ return;
+ }
+ }
+ if (c1) {
+ if ( chk_bounds(c1->ce_low, ce->ce_up, fund)) {
+node_error(rnode, "multiple case entry for value %ld", (long)(ce->ce_up));
+ free_case_entry(ce);
+ return;
+ }
+ if (c2) {
+ ce->ce_next = c2->ce_next;
+ c2->ce_next = ce;
+ }
+ else {
+ ce->ce_next = sh->sh_entries;
+ sh->sh_entries = ce;
+ }
+ }
+ else {
+ assert(c2);
+
+ c2->ce_next = ce;
+ }
+ if (ce->ce_label) {
+ if (! chk_bounds(sh->sh_lowerbd, ce->ce_low, fund)) {
+ sh->sh_lowerbd = ce->ce_low;
+ }
+ if (! chk_bounds(ce->ce_up, sh->sh_upperbd, fund)) {
+ sh->sh_upperbd = ce->ce_up;
+ }
+ }
+ }
+ if (ce->ce_label) sh->sh_nrofentries += ce->ce_up - ce->ce_low + 1;
+}
+
+
+static void AddCases(struct switch_hdr *sh, register t_node *node, label lbl)
+{
+ /* Add case labels to the case label list
+ */
+
+ if (node->nd_class == Link) {
+ if (node->nd_symb == UPTO) {
+ assert(node->nd_LEFT->nd_class == Value);
+ assert(node->nd_RIGHT->nd_class == Value);
+
+ AddOneCase(sh, node->nd_LEFT, node->nd_RIGHT, lbl);
+ return;
+ }
+
+ assert(node->nd_symb == ',');
+ AddCases(sh, node->nd_LEFT, lbl);
+ AddCases(sh, node->nd_RIGHT, lbl);
+ return;
+ }
+
+ assert(node->nd_class == Value);
+ AddOneCase(sh, node, node, lbl);
+}
+
+
+static void FreeSh(struct switch_hdr *sh)
+{
+ /* free the allocated switch structure
+ */
+ register struct case_entry *ce;
+
+ ce = sh->sh_entries;
+ while (ce) {
+ struct case_entry *tmp = ce->ce_next;
+
+ free_case_entry(ce);
+ ce = tmp;
+ }
+
+ free_switch_hdr(sh);
+}
+
+int CaseCode(t_node *nd, label exitlabel, int end_reached)
{
/* Check the expression, stack a new case header and
fill in the necessary fields.
/* Now, create case label list
*/
- while (pnode = pnode->nd_RIGHT) {
+ while ( (pnode = pnode->nd_RIGHT) ) {
if (pnode->nd_class == Link && pnode->nd_symb == '|') {
if (pnode->nd_LEFT) {
/* non-empty case
*/
pnode = nd;
rval = 0;
- while (pnode = pnode->nd_RIGHT) {
+ while ( (pnode = pnode->nd_RIGHT) ) {
if (pnode->nd_class == Link && pnode->nd_symb == '|') {
if (pnode->nd_LEFT) {
rval |= LblWalkNode((label) pnode->nd_LEFT->nd_lab,
return rval;
}
-FreeSh(sh)
- register struct switch_hdr *sh;
-{
- /* free the allocated switch structure
- */
- register struct case_entry *ce;
-
- ce = sh->sh_entries;
- while (ce) {
- struct case_entry *tmp = ce->ce_next;
-
- free_case_entry(ce);
- ce = tmp;
- }
-
- free_switch_hdr(sh);
-}
-
-void
-AddCases(sh, node, lbl)
- struct switch_hdr *sh;
- register t_node *node;
- label lbl;
-{
- /* Add case labels to the case label list
- */
-
- if (node->nd_class == Link) {
- if (node->nd_symb == UPTO) {
- assert(node->nd_LEFT->nd_class == Value);
- assert(node->nd_RIGHT->nd_class == Value);
-
- AddOneCase(sh, node->nd_LEFT, node->nd_RIGHT, lbl);
- return;
- }
-
- assert(node->nd_symb == ',');
- AddCases(sh, node->nd_LEFT, lbl);
- AddCases(sh, node->nd_RIGHT, lbl);
- return;
- }
-
- assert(node->nd_class == Value);
- AddOneCase(sh, node, node, lbl);
-}
-
-void
-AddOneCase(sh, lnode, rnode, lbl)
- register struct switch_hdr *sh;
- t_node *lnode, *rnode;
- label lbl;
-{
- register struct case_entry *ce = new_case_entry();
- register struct case_entry *c1 = sh->sh_entries, *c2 = 0;
- int fund = sh->sh_type->tp_fund;
- arith diff;
- if (! ChkCompat(&lnode, sh->sh_type, "case") ||
- ! ChkCompat(&rnode, sh->sh_type, "case")) {
- }
- ce->ce_label = lbl;
- ce->ce_low = lnode->nd_INT;
- ce->ce_up = rnode->nd_INT;
- diff = rnode->nd_INT - lnode->nd_INT;
-#define MAXRANGE 100
- if (diff < 0 || diff > MAXRANGE) {
- /* This is a bit of a hack, but it prevents the compiler
- from crashing on things like
- CASE a OF
- 10 .. MAX(CARDINAL): ....
-
- If the range covers more than MAXRANGE cases, this case
- is dealt with separately.
- */
- label cont = ++text_label;
- C_dup(int_size);
- C_loc(lnode->nd_INT);
- if (fund == T_INTEGER) {
- C_blt(cont);
- }
- else {
- C_cmu(int_size);
- C_zlt(cont);
- }
- C_dup(int_size);
- C_loc(rnode->nd_INT);
- if (fund == T_INTEGER) {
- C_bgt(cont);
- }
- else {
- C_cmu(int_size);
- C_zgt(cont);
- }
- C_asp(int_size);
- c_bra(lbl);
- C_df_ilb(cont);
- ce->ce_label = 0;
- }
- if (sh->sh_entries == 0) {
- /* first case entry
- */
- sh->sh_entries = ce;
- if (ce->ce_label) {
- sh->sh_lowerbd = ce->ce_low;
- sh->sh_upperbd = ce->ce_up;
- }
- }
- else {
- /* second etc. case entry
- find the proper place to put ce into the list
- */
-
- while (c1 && chk_bounds(c1->ce_low, ce->ce_low, fund)) {
- c2 = c1;
- c1 = c1->ce_next;
- }
- /* At this point three cases are possible:
- 1: c1 != 0 && c2 != 0:
- insert ce somewhere in the middle
- 2: c1 != 0 && c2 == 0:
- insert ce right after the head
- 3: c1 == 0 && c2 != 0:
- append ce to last element
- The case c1 == 0 && c2 == 0 cannot occur, since
- the list is guaranteed not to be empty.
- */
- if (c2) {
- if ( chk_bounds(ce->ce_low, c2->ce_up, fund)) {
-node_error(rnode, "multiple case entry for value %ld", (long)(ce->ce_low));
- free_case_entry(ce);
- return;
- }
- }
- if (c1) {
- if ( chk_bounds(c1->ce_low, ce->ce_up, fund)) {
-node_error(rnode, "multiple case entry for value %ld", (long)(ce->ce_up));
- free_case_entry(ce);
- return;
- }
- if (c2) {
- ce->ce_next = c2->ce_next;
- c2->ce_next = ce;
- }
- else {
- ce->ce_next = sh->sh_entries;
- sh->sh_entries = ce;
- }
- }
- else {
- assert(c2);
-
- c2->ce_next = ce;
- }
- if (ce->ce_label) {
- if (! chk_bounds(sh->sh_lowerbd, ce->ce_low, fund)) {
- sh->sh_lowerbd = ce->ce_low;
- }
- if (! chk_bounds(ce->ce_up, sh->sh_upperbd, fund)) {
- sh->sh_upperbd = ce->ce_up;
- }
- }
- }
- if (ce->ce_label) sh->sh_nrofentries += ce->ce_up - ce->ce_low + 1;
-}
/* Check expressions, and try to evaluate them as far as possible.
*/
-#include <stdlib.h>
-#include <string.h>
-#include "parameters.h"
+#include <stdlib.h>
+#include <string.h>
+#include "parameters.h"
#include "debug.h"
#include <em_arith.h>
#include <em_label.h>
#include <assert.h>
#include <alloc.h>
+#include <flt_arith.h>
+#include <system.h>
#include "Lpars.h"
#include "idf.h"
#include "def.h"
#include "node.h"
#include "scope.h"
+#include "error.h"
#include "standards.h"
#include "chk_expr.h"
+#include "cstoper.h"
+#include "typequiv.h"
#include "misc.h"
+#include "lookup.h"
+#include "print.h"
#include "warning.h"
#include "main.h"
extern char *symbol2str();
-extern char *sprint();
-extern arith flt_flt2arith();
-
-STATIC
-df_error(nd, mess, edf)
- t_node *nd; /* node on which error occurred */
- char *mess; /* error message */
- register t_def *edf; /* do we have a name? */
+
+/* Forward file declarations */
+static int ChkStandard(t_node **);
+static int ChkCast(t_node **);
+
+
+
+
+static void df_error(
+ t_node *nd, /* node on which error occurred */
+ char *mess, /* error message */
+ register t_def *edf) /* do we have a name? */
{
if (edf) {
if (edf->df_kind != D_ERROR) {
else node_error(nd, mess);
}
-void
-MkCoercion(pnd, tp)
- t_node **pnd;
- register t_type *tp;
+void MkCoercion(t_node **pnd, register t_type *tp)
{
/* Make a coercion from the node indicated by *pnd to the
type indicated by tp. If the node indicated by *pnd
*pnd = nd;
}
-int
-ChkVariable(expp, flags)
- register t_node **expp;
+int ChkVariable(register t_node **expp, int flags)
{
/* Check that "expp" indicates an item that can be
assigned to.
return 1;
}
-STATIC int
-ChkArrow(expp)
- t_node **expp;
+static int ChkArrow(t_node **expp, int flags)
{
/* Check an application of the '^' operator.
The operand must be a variable of a pointer type.
return 1;
}
-STATIC int
-ChkArr(expp, flags)
- t_node **expp;
+static int ChkArr(t_node **expp, int flags)
{
/* Check an array selection.
The left hand side must be a variable of an array type,
}
/*ARGSUSED*/
-STATIC int
-ChkValue(expp)
- t_node **expp;
+static int ChkValue(t_node **expp, int flags)
{
#ifdef DEBUG
switch((*expp)->nd_symb) {
return 1;
}
-STATIC int
-ChkSelOrName(expp, flags)
- t_node **expp;
+static int ChkSelOrName(t_node **expp, int flags)
{
/* Check either an ID or a construction of the form
ID.ID [ .ID ]*
return exp->nd_def->df_kind != D_ERROR;
}
-STATIC int
-ChkExSelOrName(expp)
- t_node **expp;
+static int ChkExSelOrName(t_node **expp, int flags)
{
/* Check either an ID or an ID.ID [.ID]* occurring in an
expression.
return 1;
}
-STATIC int
-ChkEl(expp, tp)
- register t_node **expp;
- t_type *tp;
+static int ChkEl(register t_node **expp, t_type *tp)
{
return ChkExpression(expp) && ChkCompat(expp, tp, "set element");
}
-STATIC int
-ChkElement(expp, tp, set)
- t_node **expp;
- t_type *tp;
- arith *set;
+static int ChkElement(t_node **expp, t_type *tp, arith *set)
{
/* Check elements of a set. This routine may call itself
recursively.
return 1;
}
-arith *
-MkSet(size)
- unsigned size;
+arith *MkSet(unsigned int size)
{
register arith *s, *t;
return s;
}
-FreeSet(s)
- register arith *s;
+void FreeSet(register arith *s)
{
dec_refcount(s);
if (refcount(s) <= 0) {
}
}
-STATIC int
-ChkSet(expp)
- t_node **expp;
+static int ChkSet(t_node **expp, int flags)
{
/* Check the legality of a SET aggregate, and try to evaluate it
compile time. Unfortunately this is all rather complicated.
return retval;
}
-STATIC t_node *
-nextarg(argp, edf)
- t_node **argp;
- t_def *edf;
+static t_node *nextarg(t_node **argp, t_def *edf)
{
register t_node *arg = (*argp)->nd_RIGHT;
return arg;
}
-STATIC t_node *
-getarg(argp, bases, designator, edf)
- t_node **argp;
- t_def *edf;
+static t_node *getarg(t_node **argp, int bases, int designator, t_def *edf)
{
/* This routine is used to fetch the next argument from an
argument list. The argument list is indicated by "argp".
return left;
}
-STATIC t_node *
-getname(argp, kinds, bases, edf)
- t_node **argp;
- t_def *edf;
+static t_node *getname(t_node **argp, int kinds, int bases, t_def *edf)
{
/* Get the next argument from argument list "argp".
The argument must indicate a definition, and the
return left;
}
-STATIC int
-ChkProcCall(exp)
- register t_node *exp;
+static int ChkProcCall(register t_node *exp)
{
/* Check a procedure call
*/
return retval;
}
-STATIC int
-ChkFunCall(expp)
- register t_node **expp;
+static int ChkFunCall(register t_node **expp, int flags)
{
/* Check a call that must have a result
*/
return 0;
}
-STATIC int ChkStandard();
-STATIC int ChkCast();
-int
-ChkCall(expp)
- t_node **expp;
+
+int ChkCall(t_node **expp)
{
/* Check something that looks like a procedure or function call.
Of course this does not have to be a call at all,
return ChkProcCall(*expp);
}
-STATIC t_type *
-ResultOfOperation(operator, tp)
- t_type *tp;
+static t_type *ResultOfOperation(int operator, t_type *tp)
{
/* Return the result type of the binary operation "operator",
with operand type "tp".
#define Boolean(operator) (operator == OR || operator == AND)
-STATIC int
-AllowedTypes(operator)
+static int AllowedTypes(int operator)
{
/* Return a bit mask indicating the allowed operand types
for binary operator "operator".
/*NOTREACHED*/
}
-STATIC int
-ChkAddressOper(tpl, tpr, expp)
- register t_type *tpl, *tpr;
- register t_node *expp;
+static int ChkAddressOper(
+ register t_type *tpl,
+ register t_type *tpr,
+ register t_node *expp)
{
/* Check that either "tpl" or "tpr" are both of type
address_type, or that one of them is, but the other is
return 0;
}
-STATIC int
-ChkBinOper(expp)
- t_node **expp;
+static int ChkBinOper(t_node **expp, int flags)
{
/* Check a binary operation.
*/
return 1;
}
-STATIC int
-ChkUnOper(expp)
- t_node **expp;
+static int ChkUnOper(t_node **expp, int flags)
{
/* Check an unary operation.
*/
return 0;
}
-STATIC t_node *
-getvariable(argp, edf, flags)
- t_node **argp;
- t_def *edf;
+static t_node *getvariable(t_node **argp, t_def *edf, int flags)
{
/* Get the next argument from argument list "argp".
It must obey the rules of "ChkVariable".
return arg->nd_LEFT;
}
-STATIC int
-ChkStandard(expp)
- t_node **expp;
+static int ChkStandard(t_node **expp)
{
/* Check a call of a standard procedure or function
*/
#endif
#ifndef STRICT_3RD_ED
if (! options['3'] && edf->df_value.df_stdname == S_TSIZE) {
- if (arg = arglink->nd_RIGHT) {
+ if ( (arg = arglink->nd_RIGHT) ) {
node_warning(arg,
W_OLDFASHIONED,
"TSIZE with multiple parameters, only first parameter used");
return 1;
}
-STATIC int
-ChkCast(expp)
- t_node **expp;
+static int ChkCast(t_node **expp)
{
/* Check a cast and perform it if the argument is constant.
If the sizes don't match, only complain if at least one of them
return 1;
}
-TryToString(nd, tp)
- register t_node *nd;
- t_type *tp;
+void TryToString(register t_node *nd, t_type *tp)
{
/* Try a coercion from character constant to string.
*/
}
}
-STATIC int
-no_desig(expp)
- t_node **expp;
+static int no_desig(t_node **expp, int flags)
{
node_error(*expp, "designator expected");
return 0;
}
-STATIC int
-add_flags(expp, flags)
- t_node **expp;
+static int add_flags(t_node **expp, int flags)
{
(*expp)->nd_def->df_flags |= flags;
return 1;
}
-extern int PNodeCrash();
-int (*ExprChkTable[])() = {
+int (*ExprChkTable[])(t_node **, int) = {
ChkValue,
ChkArr,
ChkBinOper,
PNodeCrash,
};
-int (*DesigChkTable[])() = {
+int (*DesigChkTable[])(t_node **, int) = {
no_desig,
ChkArr,
no_desig,
*
* Author: Ceriel J.H. Jacobs
*/
+#ifndef CHK_EXPR_H_
+#define CHK_EXPR_H_
/* E X P R E S S I O N C H E C K I N G */
/* $Id$ */
-extern int (*ExprChkTable[])(); /* table of expression checking
+extern int (*ExprChkTable[])(t_node **, int); /* table of expression checking
functions, indexed by node class
*/
-extern int (*DesigChkTable[])(); /* table of designator checking
+extern int (*DesigChkTable[])(t_node **, int); /* table of designator checking
functions, indexed by node class
*/
-#define ChkExpression(expp) ((*ExprChkTable[(*expp)->nd_class])(expp,D_USED))
-#define ChkDesig(expp, flags) ((*DesigChkTable[(*expp)->nd_class])(expp,flags))
+#define ChkExpression(expp) ((*ExprChkTable[(unsigned int)((*expp)->nd_class)])(expp,D_USED))
+#define ChkDesig(expp, flags) ((*DesigChkTable[(unsigned int)((*expp)->nd_class)])(expp,flags))
/* handle reference counts for sets */
#define inc_refcount(s) (*((int *)(s) - 1) += 1)
#define dec_refcount(s) (*((int *)(s) - 1) -= 1)
#define refcount(s) (*((int *)(s) - 1))
+
+void MkCoercion(t_node **pnd, register t_type *tp);
+int ChkVariable(register t_node **expp, int flags);
+int ChkCall(t_node **expp);
+void TryToString(register t_node *nd, t_type *tp);
+
+/* Generates a set of "size" bytes and increments its reference count. */
+arith *MkSet(unsigned int size);
+/* Decrements the reference counter of set "s" and if reference count
+ * is zero, then it frees the memory associated with the set.
+ */
+void FreeSet(register arith *s);
+
+#endif /* CHK_EXPR_H_ */
/* Code generation for expressions and coercions
*/
-#include "parameters.h"
+#include "parameters.h"
#include "debug.h"
-#include <em_arith.h>
-#include <em_label.h>
-#include <em_code.h>
-#include <em_abs.h>
#include <assert.h>
-#include <alloc.h>
+#include "em_arith.h"
+#include "em_label.h"
+#include "em_code.h"
+#include "em_abs.h"
+#include "alloc.h"
+#include "code.h"
#include "type.h"
+#include "error.h"
#include "LLlex.h"
#include "def.h"
#include "scope.h"
#include "desig.h"
+#include "chk_expr.h"
#include "node.h"
#include "Lpars.h"
+#include "tmpvar.h"
#include "standards.h"
#include "walk.h"
extern t_desig null_desig;
int fp_used;
-void RangeCheck();
-void CodeParameters();
-void CodeCall();
-
-CodeConst(cst, size)
- arith cst;
- int size;
+/* Forward declarations */
+static void CodeParameters(t_param *, register t_node *);
+static void CodeStd(t_node *);
+static void compare(int, label);
+static void truthvalue(int);
+static void CodeUoper(register t_node *);
+static void CodeSet(register t_node *, int);
+static void CodeEl(register t_node *, register t_type *, int);
+static void CodeDAddress(t_node *, int);
+static void DoHIGH(register t_def *);
+
+void CodeConst(arith cst, int size)
{
- /* Generate code to push constant "cst" with size "size"
- */
-
if (size <= (int) word_size) {
C_loc(cst);
}
}
}
-void
-CodeString(nd)
- register t_node *nd;
+void CodeString(register t_node *nd)
{
if (nd->nd_type->tp_fund != T_STRING) {
/* Character constant */
c_lae_dlb(data_label);
}
-CodeExpr(nd, ds, true_label, false_label)
- register t_node *nd;
- register t_desig *ds;
- label true_label, false_label;
+void CodeExpr(t_node *nd, t_desig *ds, label true_label, label false_label)
{
register t_type *tp = nd->nd_type;
}
}
-CodeCoercion(t1, t2)
- t_type *t1, *t2;
+void CodeCoercion(t_type *t1, t_type *t2)
{
int fund1, fund2;
int sz1 = t1->tp_size;
}
}
-void
-CodeCall(nd)
- register t_node *nd;
+void CodeCall(t_node *nd)
{
- /* Generate code for a procedure call. Checking of parameters
- and result is already done.
- */
+
register t_node *left = nd->nd_LEFT;
t_type *result_tp;
int needs_fn;
DoLineno(nd);
}
-void
-CodeParameters(param, arg)
- t_param *param;
- register t_node *arg;
+/* Generates code to setup the parameters of a procedure call. */
+static void CodeParameters(t_param *param, register t_node *arg)
{
register t_type *tp;
register t_type *arg_type;
CodePExpr(arg);
}
-CodePString(nd, tp)
- t_node *nd;
- t_type *tp;
+void CodePString(t_node *nd, t_type *tp)
{
arith szarg = WA(nd->nd_type->tp_size);
register arith zersz = WA(tp->tp_size) - szarg;
C_loi(szarg);
}
-static
-subu(sz)
- int sz;
+
+
+static void subu(int sz)
{
if (! options['R']) {
C_cal(sz == (int) word_size ? "subuchk" : "subulchk");
C_sbu((arith) sz);
}
-static
-addu(sz)
- int sz;
+static void addu(int sz)
{
if (! options['R']) {
C_cal(sz == (int) word_size ? "adduchk" : "addulchk");
C_adu((arith)sz);
}
-static int
-complex_lhs(nd)
- register t_node *nd;
+static int complex_lhs(register t_node *nd)
{
switch(nd->nd_class) {
case Value:
}
}
-CodeStd(nd)
- t_node *nd;
+/* Generate code for internal procedures */
+static void CodeStd(t_node *nd)
{
register t_node *arg = nd->nd_RIGHT;
register t_node *left = 0;
}
}
-int
-needs_rangecheck(tpl, tpr)
- register t_type *tpl, *tpr;
+static int needs_rangecheck(register t_type *tpl, t_type *tpr)
{
arith rlo, rhi;
return 0;
}
-void
-RangeCheck(tpl, tpr)
- register t_type *tpl, *tpr;
+void RangeCheck(register t_type *tpl, t_type *tpr)
{
- /* Generate a range check if neccessary
- */
-
arith rlo, rhi;
if (options['R']) return;
}
}
-Operands(nd)
- register t_node *nd;
+void Operands(register t_node *nd)
{
CodePExpr(nd->nd_LEFT);
DoLineno(nd);
}
-CodeOper(expr, true_label, false_label)
- register t_node *expr; /* the expression tree itself */
- label true_label;
- label false_label; /* labels to jump to in logical expr's */
+void CodeOper(
+ register t_node *expr, /* the expression tree itself */
+ label true_label,
+ label false_label /* labels to jump to in logical expr's */
+)
{
register t_node *leftop = expr->nd_LEFT;
register t_node *rightop = expr->nd_RIGHT;
}
}
-/* compare() serves as an auxiliary function of CodeOper */
-compare(relop, lbl)
- int relop;
- register label lbl;
+/* Serves as an auxiliary function of CodeOper */
+static void compare(int relop, label lbl)
{
switch (relop) {
case '<':
}
}
-/* truthvalue() serves as an auxiliary function of CodeOper */
-truthvalue(relop)
- int relop;
+/* Serves as an auxiliary function of CodeOper */
+static void truthvalue(int relop)
{
switch (relop) {
case '<':
}
}
-CodeUoper(nd)
- register t_node *nd;
+
+/* Generates code for an unary expression */
+void CodeUoper(register t_node *nd)
{
register t_type *tp = nd->nd_type;
}
}
-CodeSet(nd, null_set)
- register t_node *nd;
+static void CodeSet(register t_node *nd, int null_set)
{
register t_type *tp = nd->nd_type;
if (null_set) C_zer(tp->tp_size);
}
-CodeEl(nd, tp, null_set)
- register t_node *nd;
- register t_type *tp;
+static void CodeEl(register t_node *nd, register t_type *tp, int null_set)
{
register t_type *eltype = ElementType(tp);
}
}
-CodePExpr(nd)
- register t_node *nd;
+void CodePExpr(register t_node *nd)
{
- /* Generate code to push the value of the expression "nd"
- on the stack.
- */
+
t_desig designator;
designator = null_desig;
CodeValue(&designator, nd->nd_type);
}
-CodeDAddress(nd, chk_controlvar)
- t_node *nd;
+static void CodeDAddress(t_node *nd, int chk_controlvar)
{
/* Generate code to push the address of the designator "nd"
on the stack.
}
}
-CodeDStore(nd)
- register t_node *nd;
+void CodeDStore(register t_node *nd)
{
- /* Generate code to store the expression on the stack into the
- designator "nd".
- */
+
t_desig designator;
CodeStore(&designator, nd->nd_type);
}
-DoHIGH(df)
- register t_def *df;
+static void DoHIGH(register t_def *df)
{
/* Get the high index of a conformant array, indicated by "nd".
The high index is the second field in the descriptor of
}
#ifdef SQUEEZE
-c_bra(l)
- label l;
+void c_bra(label l)
{
C_bra((label) l);
}
-c_loc(n)
+void c_loc(int n)
{
C_loc((arith) n);
}
-c_lae_dlb(l)
- label l;
+void c_lae_dlb(label l)
{
C_lae_dlb(l, (arith) 0);
}
-CAL(name, ssp)
- char *name;
- int ssp;
+void CAL(char *name, int ssp)
{
C_cal(name);
C_asp((arith) ssp);
--- /dev/null
+/* Copyright (c) 2019 ACK Project.
+ * See the copyright notice in the ACK home directory,
+ * in the file "Copyright".
+ *
+ * Created on: 2019-02-26
+ *
+ */
+#ifndef CODE_H_
+#define CODE_H_
+
+#include "parameters.h"
+#include <em_arith.h>
+#include <em_label.h>
+
+/* Forward declarations. */
+typedef struct node t_node;
+typedef struct desig t_desig;
+typedef struct type t_type;
+
+/* Generate code to push constant "cst" with size "size" bytes. */
+void CodeConst(arith cst, int size);
+/* Generate constant character or string. */
+void CodeString(register t_node *nd);
+/* Generate code for an expression contained in "nd". */
+void CodeExpr(t_node *nd, t_desig *ds, label true_label, label false_label);
+/* Generate implicit type conversion code. */
+void CodeCoercion(t_type *t1, t_type *t2);
+/* Generate code for a procedure call including parameter setup. Checking of parameters
+ and result is already done. */
+void CodeCall(t_node *nd);
+void CodePString(t_node *nd, t_type *tp);
+/* Generate a range check if necessary */
+void RangeCheck(register t_type *tpl, t_type *tpr);
+void CodeOper(register t_node *expr, label true_label, label false_label);
+/* Generate code to push the value of the expression "nd"
+ on the stack. */
+void CodePExpr(register t_node *nd);
+/* Generate code to store the expression on the stack into the
+ designator "nd".
+*/
+void CodeDStore(register t_node *nd);
+
+#ifdef SQUEEZE
+void c_bra(label l);
+void c_loc(int n);
+void c_lae_dlb(label l);
+void CAL(char *name, int ssp);
+#endif
+
+
+
+
+#endif /* CODE_H_ */
/* $Id$ */
-#include <stdlib.h>
-#include "parameters.h"
+#include <stdlib.h>
+#include "parameters.h"
#include "debug.h"
#include <em_arith.h>
#include "node.h"
#include "Lpars.h"
#include "standards.h"
+#include "cstoper.h"
+#include "chk_expr.h"
#include "warning.h"
+#include "error.h"
extern char *symbol2str();
extern char options[];
-void CutSize();
+static void CutSize(register t_node *);
-overflow(expp)
- t_node *expp;
+
+static void overflow(t_node *expp)
{
if (expp->nd_type != address_type) {
node_warning(expp, W_ORDINARY, "overflow in constant expression");
}
}
-STATIC
-commonbin(expp)
- t_node **expp;
+static void commonbin(t_node **expp)
{
register t_node *exp = *expp;
t_type *tp = exp->nd_type;
right->nd_type = tp;
}
-cstunary(expp)
- t_node **expp;
+void cstunary(t_node **expp)
{
/* The unary operation in "expp" is performed on the constant
- expression below it, and the result restored in expp.
+ expression below it, and the result stored in expp.
*/
register t_node *exp = *expp;
register t_node *right = exp->nd_RIGHT;
CutSize(*expp);
}
-STATIC
-divide(pdiv, prem)
- arith *pdiv, *prem;
+static void divide(arith *pdiv, arith *prem)
{
/* Unsigned divide *pdiv by *prem, and store result in *pdiv,
remainder in *prem
*prem = (unsigned arith) o1 % (unsigned arith) o2;
}
-void
-cstibin(expp)
- t_node **expp;
+void cstibin(t_node **expp)
{
/* The binary operation in "expp" is performed on the constant
expressions below it, and the result restored in expp.
CutSize(*expp);
}
-cstfbin(expp)
- t_node **expp;
+void cstfbin(t_node **expp)
{
/* The binary operation in "expp" is performed on the constant
expressions below it, and the result restored in expp.
CutSize(exp);
}
-void
-cstubin(expp)
- t_node **expp;
+void cstubin(t_node **expp)
{
/* The binary operation in "expp" is performed on the constant
expressions below it, and the result restored in
CutSize(exp);
}
-void
-cstset(expp)
- t_node **expp;
+void cstset(t_node **expp)
{
extern arith *MkSet();
register t_node *exp = *expp;
FreeNode(exp);
}
-cstcall(expp, call)
- t_node **expp;
+void cstcall(t_node **expp, int call)
{
/* a standard procedure call is found that can be evaluated
compile time, so do so.
}
}
-void
-CutSize(expr)
- register t_node *expr;
+static void CutSize(register t_node *expr)
{
/* The constant value of the expression expr is made to
conform to the size of the type of the expression.
}
}
-InitCst()
+void InitCst(void)
{
register int i = 0;
#ifndef NOCROSS
--- /dev/null
+/* Copyright (c) 2019 ACK Project.
+ * See the copyright notice in the ACK home directory,
+ * in the file "Copyright".
+ *
+ * Created on: 2019-02-25
+ *
+ */
+#ifndef CSTOPER_H_
+#define CSTOPER_H_
+
+/* Compile time constant evaluations */
+
+
+void cstunary(t_node **expp);
+void cstibin(t_node **expp);
+void cstfbin(t_node **expp);
+void cstubin(t_node **expp);
+/** Evaluates the constant set operators at compile time
+ * and returns the result in "expp".
+ */
+void cstset(t_node **expp);
+/* Evaluates the result of internal procedures on constants
+ * at compile time, and returns the result in "expp".
+ */
+void cstcall(t_node **expp, int call);
+/* Compile time constant evaluator system initialization. */
+void InitCst(void);
+
+#endif /* CSTOPER_H_ */
/* $Id$ */
{
-#include "parameters.h"
+#include "parameters.h"
#include "debug.h"
-#include <em_arith.h>
-#include <em_label.h>
-#include <alloc.h>
#include <assert.h>
+#include "em_arith.h"
+#include "em_label.h"
+#include "alloc.h"
#include "idf.h"
#include "LLlex.h"
#include "type.h"
#include "scope.h"
#include "node.h"
+#include "enter.h"
+#include "error.h"
#include "misc.h"
#include "main.h"
+#include "typequiv.h"
#include "chk_expr.h"
#include "warning.h"
#include <stdlib.h>
#include <string.h>
-#include "parameters.h"
+#include "parameters.h"
#include "debug.h"
-#include <alloc.h>
-#include <em_arith.h>
-#include <em_label.h>
-#include <em_code.h>
#include <assert.h>
+#include "alloc.h"
+#include "em_arith.h"
+#include "em_label.h"
+#include "em_code.h"
+
+#include "typequiv.h"
#include "LLlex.h"
#include "main.h"
#include "def.h"
#include "type.h"
#include "idf.h"
+#include "print.h"
#include "scope.h"
+#include "lookup.h"
#include "node.h"
+#include "misc.h"
#include "Lpars.h"
#include "warning.h"
+#include "error.h"
+
-extern char *sprint();
-STATIC
-internal(c)
- register char *c;
+static void internal(register char *c)
{
- if (options['x']) {
+ if (options['x'])
+ {
C_exp(c);
}
- else C_inp(c);
+ else
+ C_inp(c);
}
-STATIC
-DefInFront(df)
- register t_def *df;
+static void DefInFront(register t_def *df)
{
/* Put definition "df" in front of the list of definitions
- in its scope.
- This is neccessary because in some cases the order in this
- list is important.
- */
+ in its scope.
+ This is neccessary because in some cases the order in this
+ list is important.
+ */
register t_def *df1 = df->df_scope->sc_def;
- if (df1 != df) {
+ if (df1 != df)
+ {
/* Definition "df" is not in front of the list
- */
- while (df1) {
+ */
+ while (df1)
+ {
/* Find definition "df"
- */
- if (df1->df_nextinscope == df) {
+ */
+ if (df1->df_nextinscope == df)
+ {
/* It already was in the list. Remove it
- */
+ */
df1->df_nextinscope = df->df_nextinscope;
break;
}
}
/* Now put it in front
- */
+ */
df->df_nextinscope = df->df_scope->sc_def;
df->df_scope->sc_def = df;
}
}
-t_def *
-MkDef(id, scope, kind)
- register t_idf *id;
- register t_scope *scope;
+t_def *MkDef(register t_idf *id, register t_scope *scope, int kind)
{
/* Create a new definition structure in scope "scope", with
- id "id" and kind "kind".
- */
+ id "id" and kind "kind".
+ */
register t_def *df;
df = new_def();
df->df_kind = kind;
df->df_next = id->id_def;
id->id_def = df;
- if (kind == D_ERROR || kind == D_FORWARD) df->df_type = error_type;
- if (kind & (D_TYPE|D_PROCEDURE|D_CONST)) {
+ if (kind == D_ERROR || kind == D_FORWARD)
+ df->df_type = error_type;
+ if (kind & (D_TYPE | D_PROCEDURE | D_CONST))
+ {
df->df_flags = D_DEFINED;
}
/* enter the definition in the list of definitions in this scope
- */
+ */
df->df_nextinscope = scope->sc_def;
scope->sc_def = df;
return df;
}
-t_def *
-define(id, scope, kind)
- register t_idf *id;
- register t_scope *scope;
- int kind;
+t_def *define(register t_idf *id, register t_scope *scope, int kind)
{
/* Declare an identifier in a scope, but first check if it
- already has been defined.
- If so, then check for the cases in which this is legal,
- and otherwise give an error message.
- */
+ already has been defined.
+ If so, then check for the cases in which this is legal,
+ and otherwise give an error message.
+ */
register t_def *df;
DO_DEBUG(options['S'], print("define %s, %x\n", id->id_text, kind));
df = lookup(id, scope, D_IMPORT, 0);
- if ( /* Already in this scope */
- df
- ) {
- switch(df->df_kind) {
+ if ( /* Already in this scope */
+ df)
+ {
+ switch (df->df_kind)
+ {
case D_INUSE:
- if (kind != D_INUSE && kind != D_ERROR) {
- error("identifier \"%s\" already used; may not be redefined in this scope", df->df_idf->id_text);
+ if (kind != D_INUSE && kind != D_ERROR)
+ {
+ error(
+ "identifier \"%s\" already used; may not be redefined in this scope",
+ df->df_idf->id_text);
df->df_kind = D_ERROR;
break;
}
case D_HIDDEN:
/* An opaque type. We may now have found the
- definition of this type.
- */
- if (kind == D_TYPE && df->df_scope == CurrentScope &&
- !DefinitionModule) {
+ definition of this type.
+ */
+ if (kind == D_TYPE && df->df_scope == CurrentScope
+ && !DefinitionModule)
+ {
df->df_kind = D_TYPE;
return df;
}
case D_FORWMODULE:
/* A forward reference to a module. We may have found
- another one, or we may have found the definition
- for this module.
- */
- if (kind & (D_FORWMODULE|D_FORWARD)) {
+ another one, or we may have found the definition
+ for this module.
+ */
+ if (kind & (D_FORWMODULE | D_FORWARD))
+ {
return df;
}
- if (kind == D_MODULE) {
+ if (kind == D_MODULE)
+ {
FreeNode(df->for_node);
df->mod_vis = df->for_vis;
df->df_kind = kind;
break;
case D_TYPE:
- if (kind == D_FORWTYPE) return df;
+ if (kind == D_FORWTYPE)
+ return df;
break;
case D_FORWTYPE:
- if (kind & (D_FORWTYPE|D_TYPE)) return df;
+ if (kind & (D_FORWTYPE | D_TYPE))
+ return df;
error("identifier \"%s\" must be a type", id->id_text);
df->df_kind = D_ERROR;
break;
case D_FORWARD:
/* A forward reference, for which we may now have
- found a definition.
- */
- if (! (kind & (D_FORWARD | D_FORWMODULE))) {
+ found a definition.
+ */
+ if (!(kind & (D_FORWARD | D_FORWMODULE)))
+ {
FreeNode(df->for_node);
}
- df->df_kind = D_ERROR; /* avoiding error message */
+ df->df_kind = D_ERROR; /* avoiding error message */
break;
}
- if (kind != D_ERROR && df->df_kind != D_ERROR) {
+ if (kind != D_ERROR && df->df_kind != D_ERROR)
+ {
/* Avoid spurious error messages
- */
- error("identifier \"%s\" already declared",
- id->id_text);
+ */
+ error("identifier \"%s\" already declared", id->id_text);
}
- if (df->df_scope == scope || df->df_kind == D_ERROR) {
+ if (df->df_scope == scope || df->df_kind == D_ERROR)
+ {
df->df_kind = kind;
- if (kind & (D_TYPE|D_PROCEDURE|D_CONST)) {
+ if (kind & (D_TYPE | D_PROCEDURE | D_CONST))
+ {
df->df_flags = D_DEFINED;
}
return MkDef(id, scope, kind);
}
-end_definition_list(pdf)
- register t_def **pdf;
+void end_definition_list(register t_def **pdf)
{
/* Remove all imports from a definition module. This is
- neccesary because the implementation module might import
- them again.
- Also, mark all other definitions "QUALIFIED EXPORT".
- */
+ neccesary because the implementation module might import
+ them again.
+ Also, mark all other definitions "QUALIFIED EXPORT".
+ */
register t_def *df;
- while (df = *pdf) {
- if (df->df_kind & D_IMPORTED) {
- if (! (df->df_flags & D_USED)) {
- warning(W_ORDINARY, "identifier \"%s\" imported but not used", df->df_idf->id_text);
+ while ( (df = *pdf) )
+ {
+ if (df->df_kind & D_IMPORTED)
+ {
+ if (!(df->df_flags & D_USED))
+ {
+ warning(W_ORDINARY, "identifier \"%s\" imported but not used",
+ df->df_idf->id_text);
}
RemoveFromIdList(df);
*pdf = df->df_nextinscope;
free_def(df);
}
- else {
+ else
+ {
df->df_flags |= D_QEXPORTED;
pdf = &(df->df_nextinscope);
}
}
}
-RemoveFromIdList(df)
- register t_def *df;
+void RemoveFromIdList(register t_def *df)
{
/* Remove definition "df" from the definition list
- */
+ */
register t_idf *id = df->df_idf;
register t_def *df1;
- if ((df1 = id->id_def) == df) id->id_def = df->df_next;
- else {
- while (df1->df_next != df) {
+ if ((df1 = id->id_def) == df)
+ id->id_def = df->df_next;
+ else
+ {
+ while (df1->df_next != df)
+ {
assert(df1->df_next != 0);
df1 = df1->df_next;
}
}
}
-t_def *
-DeclProc(type, id)
- register t_idf *id;
+t_def * DeclProc(int type, register t_idf *id)
{
/* A procedure is declared, either in a definition or a program
- module. Create a def structure for it (if neccessary).
- Also create a name for it.
- */
+ module. Create a def structure for it (if neccessary).
+ Also create a name for it.
+ */
register t_def *df;
register t_scope *scope;
static int nmcount;
assert(type & (D_PROCEDURE | D_PROCHEAD));
- if (type == D_PROCHEAD) {
+ if (type == D_PROCHEAD)
+ {
/* In a definition module
- */
+ */
df = define(id, CurrentScope, type);
df->for_node = dot2leaf(Name);
df->df_flags |= D_USED | D_DEFINED;
- if (CurrentScope->sc_definedby->df_flags & D_FOREIGN) {
+ if (CurrentScope->sc_definedby->df_flags & D_FOREIGN)
+ {
df->prc_name = id->id_text;
}
- else {
- sprint(buf,"%s_%s",CurrentScope->sc_name,id->id_text);
- df->prc_name = Salloc(buf, (unsigned) (strlen(buf)+1));
+ else
+ {
+ sprint(buf, "%s_%s", CurrentScope->sc_name, id->id_text);
+ df->prc_name = Salloc(buf, (unsigned) (strlen(buf) + 1));
}
- if (CurrVis == Defined->mod_vis) {
+ if (CurrVis == Defined->mod_vis)
+ {
/* The current module will define this routine.
- make sure the name is exported.
- */
+ make sure the name is exported.
+ */
C_exp(df->prc_name);
}
}
- else {
+ else
+ {
df = lookup(id, CurrentScope, D_IMPORTED, 0);
- if (df && df->df_kind == D_PROCHEAD) {
+ if (df && df->df_kind == D_PROCHEAD)
+ {
/* C_exp already generated when we saw the definition
- in the definition module
- */
+ in the definition module
+ */
DefInFront(df);
}
- else {
+ else
+ {
df = define(id, CurrentScope, type);
- sprint(buf,"_%d_%s",++nmcount,id->id_text);
- df->prc_name = Salloc(buf, (unsigned)(strlen(buf)+1));
+ sprint(buf, "_%d_%s", ++nmcount, id->id_text);
+ df->prc_name = Salloc(buf, (unsigned) (strlen(buf) + 1));
internal(buf);
df->df_flags |= D_DEFINED;
}
return df;
}
-EndProc(df, id)
- register t_def *df;
- t_idf *id;
+void EndProc(register t_def *df, t_idf *id)
{
/* The end of a procedure declaration.
- Check that the closing identifier matches the name of the
- procedure, close the scope, and check that a function
- procedure has at least one RETURN statement.
- */
+ Check that the closing identifier matches the name of the
+ procedure, close the scope, and check that a function
+ procedure has at least one RETURN statement.
+ */
extern int return_occurred;
match_id(id, df->df_idf);
- close_scope(SC_CHKFORW|SC_REVERSE);
- if (! return_occurred && ResultType(df->df_type)) {
+ close_scope(SC_CHKFORW | SC_REVERSE);
+ if (!return_occurred && ResultType(df->df_type))
+ {
error("function procedure %s does not return a value",
- df->df_idf->id_text);
+ df->df_idf->id_text);
}
}
-t_def *
-DefineLocalModule(id)
- t_idf *id;
+t_def * DefineLocalModule(t_idf *id)
{
/* Create a definition for a local module. Also give it
- a name to be used for code generation.
- */
+ a name to be used for code generation.
+ */
register t_def *df = define(id, CurrentScope, D_MODULE);
register t_scope *sc;
static int modulecount = 0;
sprint(buf, "_%d%s_", ++modulecount, id->id_text);
- if (!df->mod_vis) {
+ if (!df->mod_vis)
+ {
/* We never saw the name of this module before. Create a
- scope for it.
- */
- open_scope(CLOSEDSCOPE);
- df->mod_vis = CurrVis;
+ scope for it.
+ */
+ open_scope(CLOSEDSCOPE);
+ df->mod_vis = CurrVis;
}
CurrVis = df->mod_vis;
sc->sc_name = Salloc(buf, (unsigned) (strlen(buf) + 1));
/* Create a type for it
- */
+ */
df->df_type = standard_type(T_RECORD, 1, (arith) 0);
df->df_type->rec_scope = sc;
/* Generate code that indicates that the initialization procedure
- for this module is local.
- */
+ for this module is local.
+ */
internal(buf);
return df;
}
-CheckWithDef(df, tp)
- register t_def *df;
- t_type *tp;
+void CheckWithDef(register t_def *df, t_type *tp)
{
/* Check the header of a procedure declaration against a
- possible earlier definition in the definition module.
- */
+ possible earlier definition in the definition module.
+ */
- if (df->df_kind == D_PROCHEAD &&
- df->df_type &&
- df->df_type != error_type) {
+ if (df->df_kind == D_PROCHEAD && df->df_type && df->df_type != error_type)
+ {
/* We already saw a definition of this type
- in the definition module.
- */
+ in the definition module.
+ */
- if (!TstProcEquiv(tp, df->df_type)) {
+ if (!TstProcEquiv(tp, df->df_type))
+ {
error("inconsistent procedure declaration for \"%s\"",
- df->df_idf->id_text);
+ df->df_idf->id_text);
}
FreeType(df->df_type);
df->df_kind = D_PROCEDURE;
}
#ifdef DEBUG
-PrDef(df)
- register t_def *df;
+void PrDef(register t_def *df)
{
print("n: %s, k: %d\n", df->df_idf->id_text, df->df_kind);
}
*
* Author: Ceriel J.H. Jacobs
*/
+#ifndef DEF_H_
+#define DEF_H_
/* I D E N T I F I E R D E S C R I P T O R S T R U C T U R E */
typedef struct def t_def;
/* ALLOCDEF "def" 50 */
-extern t_def
- *define(),
- *DefineLocalModule(),
- *MkDef(),
- *DeclProc(),
- *lookup(),
- *lookfor();
#define NULLDEF ((t_def *) 0)
+
+typedef struct scope t_scope;
+typedef struct idf t_idf;
+typedef struct type t_type;
+
+t_def *MkDef(register t_idf *id, register t_scope *scope, int kind);
+t_def *define(register t_idf *id, register t_scope *scope, int kind);
+void RemoveFromIdList(register t_def *df);
+t_def * DeclProc(int type, register t_idf *id);
+void EndProc(register t_def *df, t_idf *id);
+t_def * DefineLocalModule(t_idf *id);
+void CheckWithDef(register t_def *df, t_type *tp);
+void end_definition_list(register t_def **pdf);
+
+#endif /* DEF_H_ */
\ No newline at end of file
#include "f_info.h"
#include "idf.h"
#include "input.h"
+#include "error.h"
#include "main.h"
#include "misc.h"
#include "node.h"
+#include "lookup.h"
+#include "main.h"
#include "scope.h"
#include "type.h"
size_t sys_filesize();
#endif
+extern void DefModule(void); /* Lpars */
+
t_idf* DefId;
-char*
- getwdir(fn) register char* fn;
+char* getwdir(register char *fn)
{
register char* p;
- char* strrchr();
while ((p = strrchr(fn, '/')) && *(p + 1) == '\0')
{
return "";
}
-STATIC int
-GetFile(name) char* name;
+static int GetFile(char *name)
{
/* Try to find a file with basename "name" and extension ".def",
in the directories mentioned in "DEFPATH".
return 1;
}
-t_def*
- GetDefinitionModule(id, incr) register t_idf* id;
+t_def* GetDefinitionModule(register t_idf* id, int incr)
{
/* Return a pointer to the "def" structure of the definition
module indicated by "id".
or perform a store.
*/
-#include "parameters.h"
+#include "parameters.h"
#include "debug.h"
-#include <em_arith.h>
-#include <em_label.h>
-#include <em_code.h>
#include <assert.h>
-#include <alloc.h>
+#include "em_arith.h"
+#include "em_label.h"
+#include "em_code.h"
+#include "alloc.h"
#include "type.h"
#include "LLlex.h"
#include "desig.h"
#include "node.h"
#include "warning.h"
+#include "error.h"
+#include "code.h"
+#include "tmpvar.h"
#include "walk.h"
extern int proclevel;
-extern arith NewPtr();
extern char options[];
-int
-WordOrDouble(ds, size)
- t_desig *ds;
- arith size;
+static int WordOrDouble(t_desig *ds, arith size)
{
/* Check if designator is suitable for word or double-word
operation
return 0;
}
-LOL(offset, size)
- arith offset, size;
+void LOL(arith offset, arith size)
{
if (size == word_size) {
C_lol(offset);
}
}
-STL(offset, size)
- arith offset, size;
+void STL(arith offset, arith size)
{
if (size == word_size) {
C_stl(offset);
}
}
-int
-DoLoad(ds, size)
- register t_desig *ds;
- arith size;
+int DoLoad(register t_desig *ds, arith size)
{
/* Try to load designator with word or double-word operation.
Return 0 if not done
return 1;
}
-int
-DoStore(ds, size)
- register t_desig *ds;
- arith size;
+int DoStore(register t_desig *ds, arith size)
{
/* Try to store designator with word or double-word operation.
Return 0 if not done
multiple of word_size only
*/
-STATIC int
-suitable_move(tp)
- register t_type *tp;
+static int suitable_move(register t_type *tp)
{
/* Find out how to load or store the value indicated by "ds".
There are four ways:
return USE_BLM;
}
-CodeValue(ds, tp)
- register t_desig *ds;
- register t_type *tp;
+void CodeValue(register t_desig *ds, register t_type *tp)
{
/* Generate code to load the value of the designator described
in "ds".
ds->dsg_kind = DSG_LOADED;
}
-ChkForFOR(nd)
- register t_node *nd;
+void ChkForFOR(register t_node *nd)
{
/* Check for an assignment to a FOR-loop control variable
*/
}
}
-CodeStore(ds, tp)
- register t_desig *ds;
- register t_type *tp;
+void CodeStore(register t_desig *ds, register t_type *tp)
{
/* Generate code to store the value on the stack in the designator
described in "ds"
ds->dsg_kind = DSG_INIT;
}
-CodeCopy(lhs, rhs, sz, psize)
- register t_desig *lhs, *rhs;
- arith sz, *psize;
+void CodeCopy(register t_desig *lhs, register t_desig *rhs, arith sz, arith *psize)
{
/* Do part of a copy, which is assumed to be "reasonable",
so that it can be done with LOI/STI or BLM.
t_desig null_desig;
-CodeMove(rhs, left, rtp)
- register t_desig *rhs;
- register t_node *left;
- t_type *rtp;
+void CodeMove(register t_desig *rhs, register t_node *left, t_type *rtp)
{
/* Generate code for an assignment. Testing of type
compatibility and the like is already done.
}
}
-CodeAddress(ds)
- register t_desig *ds;
+void CodeAddress(register t_desig *ds)
{
/* Generate code to load the address of the designator described
in "ds"
ds->dsg_kind = DSG_PLOADED;
}
-CodeFieldDesig(df, ds)
- register t_def *df;
- register t_desig *ds;
+void CodeFieldDesig(register t_def *df, register t_desig *ds)
{
/* Generate code for a field designator. Only the code common for
address as well as value computation is generated, and the
}
}
-void
-CodeVarDesig(df, ds)
- register t_def *df;
- register t_desig *ds;
+void CodeVarDesig(register t_def *df, register t_desig *ds)
{
/* Generate code for a variable represented by a "def" structure.
Of course, there are numerous cases: the variable is local,
ds->dsg_def = df;
}
-CodeDesig(nd, ds)
- register t_node *nd;
- register t_desig *ds;
+void CodeDesig(register t_node *nd, register t_desig *ds)
{
/* Generate code for a designator. Use divide and conquer
principle
*
* Author: Ceriel J.H. Jacobs
*/
+#ifndef DESIG_H_
+#define DESIG_H_
/* D E S I G N A T O R D E S C R I P T I O N S */
/* $Id$ */
+#include <em_arith.h>
+
/* Generating code for designators is not particularly easy, especially if
you don't know wether you want the address or the value.
The next structure is used to generate code for designators.
extern struct withdesig *WithDesigs;
#define NO_LABEL ((label) 0)
+
+typedef struct type t_type;
+typedef struct node t_node;
+
+
+void LOL(arith offset, arith size);
+void STL(arith offset, arith size);
+void CodeValue(register t_desig *ds, register t_type *tp);
+void ChkForFOR(register t_node *nd);
+void CodeStore(register t_desig *ds, register t_type *tp);
+void CodeCopy(register t_desig *lhs, register t_desig *rhs, arith sz, arith *psize);
+void CodeMove(register t_desig *rhs, register t_node *left, t_type *rtp);
+void CodeAddress(register t_desig *ds);
+void CodeFieldDesig(register t_def *df, register t_desig *ds);
+void CodeVarDesig(register t_def *df, register t_desig *ds);
+void CodeDesig(register t_node *nd, register t_desig *ds);
+
+#endif /* DESIG_H_ */
#include "em_code.h"
#include "assert.h"
+#include "enter.h"
#include "idf.h"
#include "LLlex.h"
#include "def.h"
#include "type.h"
+#include "error.h"
#include "scope.h"
#include "node.h"
+#include "stab.h"
#include "main.h"
+#include "lookup.h"
#include "misc.h"
#include "f_info.h"
-t_def *
-Enter(name, kind, type, pnam)
- char *name;
- t_type *type;
+
+static t_def *DoImport(register t_def *, t_scope *, int);
+
+t_def *Enter(char *name, int kind, t_type *type, int pnam)
{
/* Enter a definition for "name" with kind "kind" and type
"type" in the Current Scope. If it is a standard name, also
return df;
}
-t_def *
-EnterType(name, type)
- char *name;
- t_type *type;
+t_def *EnterType(char *name, t_type *type)
{
/* Enter a type definition for "name" and type
"type" in the Current Scope.
return Enter(name, D_TYPE, type, 0);
}
-EnterEnumList(Idlist, type)
- t_node *Idlist;
- register t_type *type;
+void EnterEnumList(t_node *Idlist, register t_type *type)
{
/* Put a list of enumeration literals in the symbol table.
They all have type "type".
FreeNode(Idlist);
}
-EnterFieldList(Idlist, type, scope, addr)
- t_node *Idlist;
- register t_type *type;
- t_scope *scope;
- arith *addr;
+void EnterFieldList(t_node *Idlist, register t_type *type, t_scope *scope,
+ arith *addr)
{
/* Put a list of fields in the symbol table.
They all have type "type", and are put in scope "scope".
FreeNode(Idlist);
}
-EnterVarList(Idlist, type, local)
- t_node *Idlist;
- t_type *type;
+void EnterVarList(t_node *Idlist, t_type *type, int local)
{
- /* Enter a list of identifiers representing variables into the
- name list. "type" represents the type of the variables.
- "local" is set if the variables are declared local to a
- procedure.
- */
register t_def *df;
register t_node *idlist = Idlist;
register t_scopelist *sc = CurrVis;
FreeNode(Idlist);
}
-EnterParamList(ppr, Idlist, type, VARp, off)
- t_param **ppr;
- t_node *Idlist;
- t_type *type;
- int VARp;
- arith *off;
+void EnterParamList(t_param **ppr,
+ t_node *Idlist,
+ t_type *type,
+ int VARp,
+ arith *off)
{
- /* Create (part of) a parameterlist of a procedure.
- "ids" indicates the list of identifiers, "tp" their type, and
- "VARp" indicates D_VARPAR or D_VALPAR.
- */
register t_param *pr;
register t_def *df;
register t_node *idlist = Idlist;
FreeNode(Idlist);
}
-STATIC t_def *DoImport();
-void
-ImportEffects(idef, scope, flag)
- register t_def *idef;
- t_scope *scope;
+static void ImportEffects(register t_def *idef, t_scope *scope, int flag)
{
/* Handle side effects of an import:
- a module could have unqualified exports ???
}
}
-STATIC t_def *
-DoImport(df, scope, flag)
- register t_def *df;
- t_scope *scope;
+static t_def *DoImport(register t_def *df, t_scope *scope, int flag)
{
/* Definition "df" is imported to scope "scope".
*/
}
-STATIC
-ForwModule(df, nd)
- register t_def *df;
- t_node *nd;
+static void ForwModule(register t_def *df, t_node *nd)
{
/* An import is done from a not yet defined module "df".
We could also end up here for not found DEFINITION MODULES.
df->for_node = nd;
}
-STATIC t_def *
-ForwDef(ids, scope)
- register t_node *ids;
- t_scope *scope;
+static t_def *ForwDef(register t_node *ids, t_scope *scope)
{
/* Enter a forward definition of "ids" in scope "scope",
if it is not already defined.
return df;
}
-EnterExportList(Idlist, qualified)
- t_node *Idlist;
+void EnterExportList(t_node *Idlist, int qualified)
{
- /* From the current scope, the list of identifiers "ids" is
- exported. Note this fact. If the export is not qualified, make
- all the "ids" visible in the enclosing scope by defining them
- in this scope as "imported".
- */
register t_node *idlist = Idlist;
register t_def *df, *df1;
FreeNode(Idlist);
}
-CheckForImports(df)
- t_def *df;
+void CheckForImports(t_def *df)
{
/* We have a definition for "df"; check all imports of
it for side-effects
}
}
-void
-EnterFromImportList(idlist, FromDef, FromId)
- register t_node *idlist;
- register t_def *FromDef;
- t_node *FromId;
+void EnterFromImportList(t_node *idlist, t_def *FromDef, t_node *FromId)
{
/* Import the list Idlist from the module indicated by Fromdef.
*/
FreeNode(FromId);
}
-EnterImportList(idlist, local, sc)
- register t_node *idlist;
- t_scope *sc;
+void EnterImportList(t_node *idlist, int local, t_scope *sc)
{
/* Import "idlist" from scope "sc".
If the import is not local, definition modules must be read
--- /dev/null
+/* Copyright (c) 2019 ACK Project.
+ * See the copyright notice in the ACK home directory,
+ * in the file "Copyright".
+ *
+ * Created on: 2019-02-27
+ *
+ */
+#ifndef ENTER_H_
+#define ENTER_H_
+
+/* Forward declarations. */
+typedef struct type t_type;
+typedef struct def t_def;
+typedef struct node t_node;
+typedef struct scope t_scope;
+typedef struct paramlist t_param;
+
+
+t_def *Enter(char *name, int kind, t_type *type, int pnam);
+t_def *EnterType(char *name, t_type *type);
+void EnterEnumList(t_node *Idlist, register t_type *type);
+void EnterFieldList(t_node *Idlist, register t_type *type, t_scope *scope,
+ arith *addr);
+/* Enter a list of identifiers representing variables into the
+ name list. "type" represents the type of the variables.
+ "local" is set if the variables are declared local to a
+ procedure.
+*/
+void EnterVarList(t_node *Idlist, t_type *type, int local);
+/* Create (part of) a parameterlist of a procedure.
+ "ids" indicates the list of identifiers, "tp" their type, and
+ "VARp" indicates D_VARPAR or D_VALPAR.
+*/
+void EnterParamList(t_param **ppr, t_node *Idlist, t_type *type,
+ int VARp, arith *off);
+/* From the current scope, the list of identifiers "ids" is
+ exported. Note this fact. If the export is not qualified, make
+ all the "ids" visible in the enclosing scope by defining them
+ in this scope as "imported".
+*/
+void EnterExportList(t_node *Idlist, int qualified);
+void CheckForImports(t_def *df);
+void EnterFromImportList(t_node *idlist, t_def *FromDef, t_node *FromId);
+void EnterImportList(t_node *idlist, int local, t_scope *sc);
+
+#endif /* ENTER_H_ */
#include "input.h"
#include "f_info.h"
+#include "print.h"
#include "LLlex.h"
#include "main.h"
#include "node.h"
#include "warning.h"
+#include "error.h"
/* error classes */
#define ERROR 1
FileName, node errors get their information from the
node, whereas other errors use the information in the token.
*/
-
-void _error();
+static void _error(int, t_node *, char *, register va_list, int);
#if __STDC__
#ifdef DEBUG
/*VARARGS*/
-debug(char *fmt, ...)
+void debug(char *fmt, ...)
{
va_list ap;
#endif /* DEBUG */
/*VARARGS*/
-error(char *fmt, ...)
+void error(char *fmt, ...)
{
va_list ap;
}
/*VARARGS*/
-node_error(t_node *node, char *fmt, ...)
+void node_error(t_node *node, char *fmt, ...)
{
va_list ap;
}
/*VARARGS*/
-warning(int class, char *fmt, ...)
+void warning(int class, char *fmt, ...)
{
va_list ap;
}
/*VARARGS*/
-node_warning(t_node *node, int class, char *fmt, ...)
+void node_warning(t_node *node, int class, char *fmt, ...)
{
va_list ap;
}
/*VARARGS*/
-lexerror(char *fmt, ...)
+void lexerror(char *fmt, ...)
{
va_list ap;
}
/*VARARGS*/
-lexwarning(int class, char *fmt, ...)
+void lexwarning(int class, char *fmt, ...)
{
va_list ap;
}
/*VARARGS*/
-fatal(char *fmt, ...)
+void fatal(char *fmt, ...)
{
va_list ap;
}
/*VARARGS*/
-crash(char *fmt, ...)
+void crash(char *fmt, ...)
{
va_list ap;
#else
#ifdef DEBUG
/*VARARGS*/
-debug(va_alist)
+void debug(va_alist)
va_dcl
{
va_list ap;
#endif /* DEBUG */
/*VARARGS*/
-error(va_alist)
+void error(va_alist)
va_dcl
{
va_list ap;
}
/*VARARGS*/
-node_error(va_alist)
+void node_error(va_alist)
va_dcl
{
va_list ap;
}
/*VARARGS*/
-warning(va_alist)
+void warning(va_alist)
va_dcl
{
va_list ap;
}
/*VARARGS*/
-node_warning(va_alist)
+void node_warning(va_alist)
va_dcl
{
va_list ap;
}
/*VARARGS*/
-lexerror(va_alist)
+void lexerror(va_alist)
va_dcl
{
va_list ap;
}
/*VARARGS*/
-lexwarning(va_alist)
+void lexwarning(va_alist)
va_dcl
{
va_list ap;
}
/*VARARGS*/
-fatal(va_alist)
+void fatal(va_alist)
va_dcl
{
va_list ap;
}
/*VARARGS*/
-crash(va_alist)
+void crash(va_alist)
va_dcl
{
va_list ap;
}
#endif
-void
-_error(class, node, fmt, ap, warn_class)
- int class;
- t_node *node;
- char *fmt;
- register va_list ap;
- int warn_class;
+static void _error(int class, t_node *node, char *fmt, register va_list ap, int warn_class)
{
/* _error attempts to limit the number of error messages
for a given line to MAXERR_LINE.
--- /dev/null
+/* Copyright (c) 2019 ACK Project.
+ * See the copyright notice in the ACK home directory,
+ * in the file "Copyright".
+ *
+ * Created on: 2019-02-26
+ *
+ */
+#ifndef ERROR_H_
+#define ERROR_H_
+
+typedef struct node t_node;
+
+#if __STDC__
+#ifdef DEBUG
+/*VARARGS*/
+void debug(char *fmt, ...);
+#endif /* DEBUG */
+
+/*VARARGS*/
+void error(char *fmt, ...);
+/*VARARGS*/
+void node_error(t_node *node, char *fmt, ...);
+/*VARARGS*/
+void warning(int class, char *fmt, ...);
+/*VARARGS*/
+void node_warning(t_node *node, int class, char *fmt, ...);
+/*VARARGS*/
+void lexerror(char *fmt, ...);
+/*VARARGS*/
+void lexwarning(int class, char *fmt, ...);
+/*VARARGS*/
+void fatal(char *fmt, ...);
+/*VARARGS*/
+void crash(char *fmt, ...);
+#else
+
+#ifdef DEBUG
+/*VARARGS*/
+void debug(va_alist);
+#endif /* DEBUG */
+
+/*VARARGS*/
+void error(va_alist);
+/*VARARGS*/
+void node_error(va_alist);
+/*VARARGS*/
+void warning(va_alist);
+/*VARARGS*/
+void node_warning(va_alist);
+/*VARARGS*/
+void lexerror(va_alist);
+/*VARARGS*/
+void lexwarning(va_alist);
+/*VARARGS*/
+void fatal(va_alist);
+/*VARARGS*/
+void crash(va_alist);
+#endif
+
+#endif /* ERROR_H_ */
/* $Id$ */
{
-#include "parameters.h"
+#include "parameters.h"
#include "debug.h"
-#include <alloc.h>
-#include <em_arith.h>
-#include <em_label.h>
+#include "alloc.h"
+#include "em_arith.h"
+#include "em_label.h"
#include <assert.h>
#include "LLlex.h"
#include "def.h"
#include "node.h"
#include "type.h"
+#include "error.h"
#include "chk_expr.h"
#include "warning.h"
/* $Id$ */
-#include "parameters.h"
+#include "parameters.h"
#include "idf.h"
#include <idf_pkg.body>
#include <stdio.h>
#include <string.h>
#include "parameters.h"
-#include "f_info.h"
+#include "f_info.h"
struct f_info file_info;
-#include "input.h"
-#include <inp_pkg.body>
+#include "input.h"
+#include <inp_pkg.body>
int AtEoIF(void)
/* $Id$ */
-#include "parameters.h"
+#include "parameters.h"
#include "debug.h"
#include <em_arith.h>
#include <em_label.h>
#include <assert.h>
+#include "lookup.h"
#include "LLlex.h"
#include "def.h"
#include "idf.h"
extern char options[];
#endif
-t_def *
-lookup(id, scope, import, flags)
- register t_idf *id;
- t_scope *scope;
+t_def *lookup(register t_idf *id, t_scope *scope, int import, int flags)
{
/* Look up a definition of an identifier in scope "scope".
Make the "def" list self-organizing.
return df;
}
-t_def *
-lookfor(id, vis, message, flags)
- register t_node *id;
- register t_scopelist *vis;
+t_def *lookfor(register t_node *id, register t_scopelist *vis, int message, int flags)
{
/* Look for an identifier in the visibility range started by "vis".
If it is not defined create a dummy definition and,
--- /dev/null
+/* Copyright (c) 2019 ACK Project.
+ * See the copyright notice in the ACK home directory,
+ * in the file "Copyright".
+ *
+ * Created on: 2019-02-27
+ *
+ */
+#ifndef LOOKUP_H_
+#define LOOKUP_H_
+
+/* Forward declarations. */
+typedef struct idf t_idf;
+typedef struct scope t_scope;
+typedef struct node t_node;
+typedef struct def t_def;
+typedef struct scopelist t_scopelist;
+
+t_def *lookup(register t_idf *id, t_scope *scope, int import, int flags);
+t_def *lookfor(register t_node *id, register t_scopelist *vis, int message, int flags);
+
+#endif /* LOOKUP_H_ */
/* $Id$ */
-#include "parameters.h"
+#include "parameters.h"
#include "debug.h"
-#include <system.h>
-#include <em_arith.h>
-#include <em_label.h>
-#include <em_code.h>
-#include <alloc.h>
#include <assert.h>
+#include "system.h"
+#include "em_arith.h"
+#include "em_label.h"
+#include "em_code.h"
+#include "print.h"
+#include "alloc.h"
+
#include <stb.h>
#include "input.h"
#include "standards.h"
#include "tokenname.h"
#include "node.h"
+#include "walk.h"
+#include "cstoper.h"
+#include "error.h"
+#include "options.h"
#include "warning.h"
-#include "SYSTEM.h"
+#include "SYSTEMM2.h"
int state; /* either IMPLEMENTATION or PROGRAM */
-char options[128];
+char options[128];
int DefinitionModule;
-char *ProgName;
-char **DEFPATH;
+char *ProgName;
+char **DEFPATH;
int nDEF = 2, mDEF = 10;
int pass_1 = 1;
-t_def *Defined;
+t_def *Defined;
extern int err_occurred;
extern int fp_used; /* set if floating point used */
static t_node _emptystat = { Stat, 0, NULLTYPE, { ';' }};
t_node *EmptyStatement = &_emptystat;
-main(argc, argv)
- register char **argv;
+
+/* Forward declarations. */
+struct stdproc;
+int Compile(char *, char *);
+static void AddProcs(register struct stdproc *);
+static void AddStandards(void);
+/* External function declarations */
+extern void CompUnit(void);
+extern void DefModule(void); /* Lpars */
+extern void reserve(register struct tokenname *); /* tokenname */
+char* getwdir(register char *); /* defmodule */
+
+int main(int argc, char **argv)
{
register int Nargc = 1;
register char **Nargv = &argv[0];
/*NOTREACHED*/
}
-Compile(src, dst)
- char *src, *dst;
+int Compile(char *src, char *dst)
{
extern struct tokenname tkidf[];
- extern char *getwdir();
if (! InsertFile(src, (char **) 0, &src)) {
fprint(STDERR,"%s: cannot open %s\n", ProgName, src);
}
#ifdef DEBUG
-LexScan()
+void LexScan(void)
{
register t_token *tkp = ˙
extern char *symbol2str();
extern t_def *Enter(), *EnterType();
-AddProcs(p)
- register struct stdproc *p;
+static void AddProcs(register struct stdproc *p)
{
for (; p->st_nam != 0; p++) {
if (! Enter(p->st_nam, D_PROCEDURE, std_type, p->st_con)) {
}
}
-AddStandards()
+static void AddStandards(void)
{
register t_def *df;
static t_token nilconst = { INTEGER, 0};
EnterType("BOOLEAN", bool_type);
}
-do_SYSTEM()
+void do_SYSTEM(void)
{
/* Simulate the reading of the SYSTEM definition module
*/
int cntlines;
-Info()
+void Info(void)
{
extern int cnt_def, cnt_node, cnt_paramlist, cnt_type,
cnt_switch_hdr, cnt_case_entry,
}
#endif
-void
-No_Mem()
+void No_Mem(void)
{
fatal("out of memory");
}
-void
-C_failed()
+void C_failed(void)
{
fatal("write failed");
}
*/
/* S O M E G L O B A L V A R I A B L E S */
-
-/* $Id$ */
+#ifndef MAIN_H_
+#define MAIN_H_
extern char options[]; /* indicating which options were given */
extern char **DEFPATH; /* search path for DEFINITION MODULE's */
extern int mDEF, nDEF;
extern int state; /* either IMPLEMENTATION or PROGRAM */
+
+void do_SYSTEM(void);
+
+#endif /* MAIN_H_ */
#include "em_arith.h"
#include "em_label.h"
-#include "parameters.h"
+#include "parameters.h"
#include "f_info.h"
#include "misc.h"
#include "LLlex.h"
#include "idf.h"
#include "node.h"
+#include "error.h"
-match_id(id1, id2)
- register t_idf *id1, *id2;
+void match_id(register t_idf *id1, t_idf *id2)
{
/* Check that identifiers id1 and id2 are equal. If they
are not, check that we did'nt generate them in the
}
}
-t_idf *
-gen_anon_idf()
+t_idf *gen_anon_idf(void)
{
/* A new idf is created out of nowhere, to serve as an
anonymous name.
return str2idf(s, 0);
}
-not_declared(what, id, where)
- char *what, *where;
- register t_node *id;
+void not_declared(char *what, t_node *id, char *where)
{
/* The identifier "id" is not declared. If it is not generated,
give an error message
#define is_anon_idf(x) ((x)->id_text[0] == '#')
#define id_not_declared(x) (not_declared("identifier", (x), ""))
-extern struct idf
- *gen_anon_idf();
+/* Forward declarations. */
+typedef struct idf t_idf;
+typedef struct node t_node;
+
+void match_id(register t_idf *id1, t_idf *id2);
+t_idf *gen_anon_idf(void);
+void not_declared(char *what, t_node *id, char *where);
--- /dev/null
+#include "parameters.h"
#include "type.h"
#include "node.h"
#include "main.h"
+#include "error.h"
static int nsubnodes[] = {
0,
2
};
-t_node *
-getnode(class)
+t_node *getnode(int class)
{
register t_node *nd = new_node();
return nd;
}
-t_node *
-dot2node(class, left, right)
- t_node *left, *right;
+t_node *dot2node(int class, t_node *left, t_node *right)
{
register t_node *nd = getnode(class);
return nd;
}
-t_node *
-dot2leaf(class)
+t_node *dot2leaf(int class)
{
register t_node *nd = getnode(class);
return nd;
}
-void
-FreeNode(nd)
- register t_node *nd;
+void FreeNode(register t_node *nd)
{
/* Put nodes that are no longer needed back onto the free
list
*/
if (!nd) return;
- switch(nsubnodes[nd->nd_class]) {
+ switch(nsubnodes[(unsigned int)nd->nd_class]) {
case 2:
FreeNode(nd->nd_LEFT);
FreeNode(nd->nd_RIGHT);
}
/*ARGSUSED*/
-NodeCrash(expp)
- t_node *expp;
+int NodeCrash(register t_node* expp, label exit_label, int end_reached)
{
crash("(NodeCrash) Illegal node");
}
/*ARGSUSED*/
-PNodeCrash(expp)
- t_node **expp;
+int PNodeCrash(t_node **expp, int flags)
{
crash("(PNodeCrash) Illegal node");
}
extern char *symbol2str();
-indnt(lvl)
+void indnt(int lvl)
{
while (lvl--) {
print(" ");
}
}
-printnode(nd, lvl)
- register t_node *nd;
+void printnode(register t_node *nd, int lvl)
{
indnt(lvl);
print("Class: %d; Symbol: %s; Flags: %d\n", nd->nd_class, symbol2str(nd->nd_symb), nd->nd_flags);
}
}
-PrNode(nd, lvl)
- register t_node *nd;
+void PrNode(register t_node *nd, int lvl)
{
if (! nd) {
indnt(lvl); print("<nilnode>\n");
#define IsCast(lnd) ((lnd)->nd_class == Def && is_type((lnd)->nd_def))
#define IsProc(lnd) ((lnd)->nd_type->tp_fund == T_PROCEDURE)
+
+
+
+t_node *getnode(int class);
+t_node *dot2node(int class, t_node *left, t_node *right);
+t_node *dot2leaf(int class);
+void FreeNode(register t_node *nd);
+int NodeCrash(register t_node* expp, label exit_label, int end_reached);
+int PNodeCrash(t_node **expp, int flags);
+
#include "main.h"
#include "warning.h"
#include "class.h"
+#include "error.h"
#define MINIDFSIZE 14
int warning_classes = W_INITIAL;
int gdb_flag;
-DoOption(text)
- register char *text;
+#if (!SQUEEZE) | (!NOCROSS)
+static int txt2int(register char **tp)
+{
+ /* the integer pointed to by *tp is read, while increasing
+ *tp; the resulting value is yielded.
+ */
+ register int val = 0;
+ register int ch;
+
+ while (ch = **tp, ch >= '0' && ch <= '9') {
+ val = val * 10 + ch - '0';
+ (*tp)++;
+ }
+ return val;
+}
+#endif
+
+
+void DoOption(register char *text)
{
switch(*text++) {
case '-':
- options[*text]++; /* debug options etc. */
+ options[(unsigned int)*text]++; /* debug options etc. */
break;
case 'U': /* allow underscores in identifiers */
case 's': /* symmetric: MIN(INTEGER) = -MAX(INTEGER) */
case '3': /* strict 3rd edition Modula-2 */
case 'l': /* local additions enabled */
- options[text[-1]]++;
+ options[(unsigned int)text[-1]]++;
break;
#ifdef DBSYMTAB
char c;
char *t;
- while (c = *text++) {
+ while ( (c = *text++) != 0) {
char *strchr();
t = text;
}
}
-#if (!SQUEEZE) | (!NOCROSS)
-int
-txt2int(tp)
- register char **tp;
-{
- /* the integer pointed to by *tp is read, while increasing
- *tp; the resulting value is yielded.
- */
- register int val = 0;
- register int ch;
-
- while (ch = **tp, ch >= '0' && ch <= '9') {
- val = val * 10 + ch - '0';
- (*tp)++;
- }
- return val;
-}
-#endif
--- /dev/null
+/* Copyright (c) 2019 ACK Project.
+ * See the copyright notice in the ACK home directory,
+ * in the file "Copyright".
+ *
+ * Created on: 2019-02-27
+ *
+ */
+#ifndef OPTIONS_H_
+#define OPTIONS_H_
+
+void DoOption(register char *text);
+
+#endif /* OPTIONS_H_ */
{
#include <stdlib.h>
#include <string.h>
-#include "parameters.h"
+#include "parameters.h"
#include "debug.h"
-#include <alloc.h>
-#include <em_arith.h>
-#include <em_label.h>
-#include <em_code.h>
-#include <stb.h>
+#include "alloc.h"
+#include "em_arith.h"
+#include "em_label.h"
+#include "em_code.h"
+#include "stb.h"
#include "main.h"
#include "idf.h"
#include "scope.h"
#include "def.h"
#include "type.h"
+#include "lookup.h"
+#include "error.h"
+#include "stab.h"
+#include "enter.h"
#include "node.h"
#include "f_info.h"
#include "warning.h"
*/
/* S C O P E M E C H A N I S M */
+#ifndef SCOPE_H_
+#define SCOPE_H_
+
-/* $Id$ */
#define OPENSCOPE 0 /* Indicating an open scope */
#define CLOSEDSCOPE 1 /* Indicating a closed scope (module) */
#define scopeclosed(x) ((x)->sc_scopeclosed)
#define nextvisible(x) ((x)->sc_next) /* use with scopelists */
-t_scope *open_and_close_scope();
+
+typedef struct def t_def;
+
+void Reverse(t_def **pdf);
+void open_scope(int scopetype);
+t_scope * open_and_close_scope(int scopetype);
+void InitScope(void);
+void close_scope(int flag);
+#ifdef DEBUG
+void DumpScope(register t_def *df);
+#endif
+
+
+#endif /* SCOPE_H_ */
/* $Id$ */
-#include "parameters.h"
+#include "parameters.h"
#include "debug.h"
#include <assert.h>
-#include <alloc.h>
-#include <em_arith.h>
-#include <em_label.h>
+#include "alloc.h"
+#include "em_arith.h"
+#include "em_label.h"
#include "LLlex.h"
#include "idf.h"
#include "type.h"
#include "def.h"
#include "node.h"
+#include "lookup.h"
+#include "error.h"
t_scope *PervasiveScope;
t_scopelist *CurrVis, *GlobalVis;
static int sc_count;
-open_scope(scopetype)
+void open_scope(int scopetype)
{
/* Open a scope that is either open (automatic imports) or closed.
*/
CurrVis = ls;
}
-t_scope *
-open_and_close_scope(scopetype)
+t_scope * open_and_close_scope(int scopetype)
{
t_scope *sc;
return sc;
}
-InitScope()
+void InitScope(void)
{
register t_scope *sc = new_scope();
register t_scopelist *ls = new_scopelist();
CurrVis = ls;
}
-STATIC
-chk_proc(df)
- register t_def *df;
+static void chk_proc(register t_def *df)
{
/* Called at scope closing. Check all definitions, and if one
is a D_PROCHEAD, the procedure was not defined.
}
}
-STATIC
-chk_forw(pdf)
- t_def **pdf;
+static void chk_forw(t_def **pdf)
{
/* Called at scope close. Look for all forward definitions and
if the scope was a closed scope, give an error message for
*/
register t_def *df;
- while (df = *pdf) {
+ while ( (df = *pdf) ) {
if (df->df_kind == D_FORWTYPE) {
pdf = &df->df_nextinscope;
ForceForwardTypeDef(df); /* removes df */
}
}
-Reverse(pdf)
- t_def **pdf;
+void Reverse(t_def **pdf)
{
/* Reverse the order in the list of definitions in a scope.
This is neccesary because this list is built in reverse.
*pdf = df;
}
-close_scope(flag)
- register int flag;
+void close_scope(int flag)
{
/* Close a scope. If "flag" is set, check for forward declarations,
either POINTER declarations, or EXPORTs, or forward references
}
#ifdef DEBUG
-DumpScope(df)
- register t_def *df;
+void DumpScope(register t_def *df)
{
while (df) {
PrDef(df);
#include "type.h"
#include "idf.h"
#include "scope.h"
+#include "error.h"
+#include "stab.h"
#include "main.h"
extern int gdb_flag;
char *currpos;
} db_str;
-static
-create_db_str()
+static void create_db_str(void)
{
if (! db_str.base) {
db_str.base = Malloc(INCR_SIZE);
db_str.currpos = db_str.base;
}
-static
-addc_db_str(c)
- int c;
+static void addc_db_str(int c)
{
int df = db_str.currpos - db_str.base;
if (df >= db_str.sz-1) {
*db_str.currpos = '\0';
}
-static
-adds_db_str(s)
- char *s;
+static void adds_db_str(char *s)
{
while (*s) addc_db_str(*s++);
}
-static void
-stb_type(tp, assign_num)
- register t_type *tp;
+static void stb_type(register t_type *tp, int assign_num)
{
char buf[128];
static int stb_count;
}
}
-stb_addtp(s, tp)
- char *s;
- t_type *tp;
+void stb_addtp(char *s, t_type *tp)
{
create_db_str();
adds_db_str(s);
(arith) 0);
}
-stb_string(df, kind)
- register t_def *df;
+void stb_string(register t_def *df, int kind)
{
register t_type *tp = df->df_type;
char buf[64];
--- /dev/null
+/* Copyright (c) 2019 ACK Project.
+ * See the copyright notice in the ACK home directory,
+ * in the file "Copyright".
+ *
+ * Created on: 2019-02-27
+ *
+ */
+#ifndef STAB_H_
+#define STAB_H_
+/* D E B U G G E R S Y M B O L T A B L E */
+
+typedef struct type t_type;
+typedef struct def t_def;
+
+void stb_addtp(char *s, t_type *tp);
+void stb_string(register t_def *df, int kind);
+
+
+#endif /* STAB_H_ */
{
#include <assert.h>
-#include <em_arith.h>
-#include <em_label.h>
+#include "em_arith.h"
+#include "em_label.h"
-#include "parameters.h"
+#include "parameters.h"
#include "idf.h"
#include "LLlex.h"
#include "scope.h"
#include "def.h"
#include "type.h"
+#include "error.h"
#include "node.h"
static int loopcount = 0; /* Count nested loops */
--- /dev/null
+/* Copyright (c) 2019 ACK Project.
+ * See the copyright notice in the ACK home directory,
+ * in the file "Copyright".
+ *
+ * Created on: 2019-02-27
+ *
+ */
+/* T E M P O R A R Y V A R I A B L E S */
+#ifndef TMPVAR_H_
+#define TMPVAR_H_
+
+#include "em_arith.h"
+
+typedef struct scope t_scope;
+
+void TmpOpen(t_scope *sc);
+arith TmpSpace(arith sz, int al);
+arith NewInt(void);
+arith NewPtr(void);
+void FreeInt(arith off);
+void FreePtr(arith off);
+void TmpClose(void);
+
+
+
+#endif /* TMPVAR_H_ */
have local variabes.
*/
-#include "parameters.h"
+#include "parameters.h"
#include "debug.h"
#include <em_arith.h>
#include "def.h"
#include "type.h"
#include "scope.h"
+#include "tmpvar.h"
#include "main.h"
struct tmpvar {
temporaries are allocated
*/
-TmpOpen(sc) t_scope *sc;
+void TmpOpen(t_scope *sc)
{
/* Initialize for temporaries in scope "sc".
*/
ProcScope = sc;
}
-arith
-TmpSpace(sz, al)
- arith sz;
+arith TmpSpace(arith sz, int al)
{
register t_scope *sc = ProcScope;
return sc->sc_off;
}
-STATIC arith
-NewTmp(plist, sz, al, regtype)
- register struct tmpvar **plist;
- arith sz;
+static arith NewTmp(struct tmpvar **plist, arith sz, int al, int regtype)
{
register arith offset;
register struct tmpvar *tmp;
return offset;
}
-arith
-NewInt()
+arith NewInt(void)
{
return NewTmp(&TmpInts, int_size, int_align, reg_any);
}
-arith
-NewPtr()
+arith NewPtr(void)
{
return NewTmp(&TmpPtrs, pointer_size, pointer_align, reg_pointer);
}
-STATIC
-FreeTmp(plist, off)
- struct tmpvar **plist;
- arith off;
+
+static void FreeTmp(struct tmpvar **plist, arith off)
{
register struct tmpvar *tmp = new_tmpvar();
*plist = tmp;
}
-FreeInt(off)
- arith off;
+void FreeInt(arith off)
{
FreeTmp(&TmpInts, off);
}
-FreePtr(off)
- arith off;
+void FreePtr(arith off)
{
FreeTmp(&TmpPtrs, off);
}
-TmpClose()
+void TmpClose(void)
{
register struct tmpvar *tmp, *tmp1;
/* $Id$ */
-#include "parameters.h"
+#include "parameters.h"
#include "tokenname.h"
#include "Lpars.h"
#include "idf.h"
+#include "error.h"
/* To centralize the declaration of %tokens, their presence in this
file is taken as their declaration. The Makefile will produce
/* Some routines to handle tokennames */
-reserve(resv)
- register struct tokenname *resv;
+void reserve(register struct tokenname *resv)
{
/* The names of the tokens described in resv are entered
as reserved words.
/* $Id$ */
-#include "parameters.h"
+#include "parameters.h"
#include "debug.h"
#include <assert.h>
#include "idf.h"
#include "node.h"
#include "scope.h"
+#include "error.h"
#include "walk.h"
+#include "lookup.h"
+#include "stab.h"
+#include "enter.h"
+#include "typequiv.h"
#include "main.h"
#include "chk_expr.h"
#include "warning.h"
*std_type,
*error_type;
-void ArraySizes();
-t_type *
-construct_type(fund, tp)
- int fund;
- register t_type *tp;
+t_type *construct_type(int fund, register t_type *tp)
{
/* fund must be a type constructor.
The pointer to the constructed type is returned.
return dtp;
}
-arith
-align(pos, al)
- arith pos;
- int al;
+/* Aligns "pos" to the specified alignment "al"
+ * and returns the aligned "pos".
+ */
+arith align(arith pos, int al)
{
int i = pos % al;
return pos;
}
-t_type *
-standard_type(fund, algn, size)
- int fund;
- int algn;
- arith size;
+t_type *standard_type(int fund, int algn, arith size)
{
register t_type *tp = new_type();
return tp;
}
-InitTypes()
+void InitTypes(void)
{
- /* Initialize the predefined types
- */
register t_type *tp;
/* first, do some checking
void_type = error_type;
}
-int
-fit(sz, nbytes)
- arith sz;
+int fit(arith sz, int nbytes)
{
return ((sz) + ((arith)0x80<<(((nbytes)-1)*8)) & ~full_mask[(nbytes)]) == 0;
}
-STATIC
-u_small(tp, n)
- register t_type *tp;
- arith n;
+static void u_small(register t_type *tp, arith n)
{
if (ufit(n, 1)) {
tp->tp_size = 1;
}
}
-t_type *
-enum_type(EnumList)
- t_node *EnumList;
+t_type *enum_type(t_node *EnumList)
{
register t_type *tp =
standard_type(T_ENUMERATION, int_align, int_size);
return tp;
}
-t_type *
-qualified_type(pnd)
- t_node **pnd;
+t_type *qualified_type(t_node **pnd)
{
register t_def *df;
}
-int
-chk_bounds(l1, l2, fund)
- arith l1, l2;
+int chk_bounds(arith l1, arith l2, int fund)
{
- /* compare to arith's, but be careful. They might be unsigned
- */
+
if (fund == T_INTEGER) {
return l2 >= l1;
}
return (unsigned arith) l2 >= (unsigned arith) l1;
}
-int
-in_range(i, tp)
- arith i;
- register t_type *tp;
+int in_range(arith i, register t_type *tp)
{
- /* Check that the value i fits in the subrange or enumeration
- type tp. Return 1 if so, 0 otherwise
- */
+
switch(tp->tp_fund) {
case T_ENUMERATION:
/*NOTREACHED*/
}
-t_type *
-subr_type(lb, ub, base)
- register t_node *lb;
- t_node *ub;
- t_type *base;
+t_type *subr_type(t_node *lb, t_node *ub, t_type *base)
{
- /* Construct a subrange type from the constant expressions
- indicated by "lb" and "ub", but first perform some
- checks. "base" is either a user-specified base-type, or NULL.
- */
register t_type *tp = BaseType(lb->nd_type);
register t_type *res;
return res;
}
-t_type *
-proc_type(result_type, parameters, n_bytes_params)
- t_type *result_type;
- t_param *parameters;
- arith n_bytes_params;
+t_type *proc_type(t_type *result_type, t_param *parameters, arith n_bytes_params)
{
register t_type *tp = construct_type(T_PROCEDURE, result_type);
return tp;
}
-genrck(tp)
- register t_type *tp;
+void genrck(register t_type *tp)
{
/* generate a range check descriptor for type "tp" when
neccessary. Return its label.
}
}
-getbounds(tp, plo, phi)
- register t_type *tp;
- arith *plo, *phi;
+void getbounds(register t_type *tp, arith *plo, arith *phi)
{
- /* Get the bounds of a bounded type
- */
-
assert(bounded(tp));
if (tp->tp_fund == T_SUBRANGE) {
}
}
-t_type *
-set_type(tp)
- register t_type *tp;
+t_type *set_type(register t_type *tp)
{
- /* Construct a set type with base type "tp", but first
- perform some checks
- */
+
arith lb, ub, diff, alloc_size;
if (! bounded(tp) || tp->tp_size > word_size) {
return tp;
}
-ArrayElSize(tp)
- register t_type *tp;
+void ArrayElSize(register t_type *tp)
{
/* Align element size to alignment requirement of element type.
Also make sure that its size is either a dividor of the word_size,
}
}
-void
-ArraySizes(tp)
- register t_type *tp;
+void ArraySizes(register t_type *tp)
{
/* Assign sizes to an array type, and check index type
*/
C_rom_cst(tp->arr_elsize);
}
-FreeType(tp)
- register t_type *tp;
+void FreeType(register t_type *tp)
{
/* Release type structures indicated by "tp".
This procedure is only called for types, constructed with
free_type(tp);
}
-DeclareType(nd, df, tp)
- register t_def *df;
- register t_type *tp;
- t_node *nd;
+void DeclareType(t_node *nd, register t_def *df, register t_type *tp)
{
/* A type with type-description "tp" is declared and must
be bound to definition "df".
SolveForwardTypeRefs(df);
}
-SolveForwardTypeRefs(df)
- register t_def *df;
+void SolveForwardTypeRefs(register t_def *df)
{
register t_node *nd;
}
-ForceForwardTypeDef(df)
- register t_def *df;
+void ForceForwardTypeDef(register t_def *df)
{
register t_def *df1 = df, *df2;
register t_node *nd = df->df_forw_node;
}
}
-t_type *
-RemoveEqual(tpx)
- register t_type *tpx;
+t_type *RemoveEqual(register t_type *tpx)
{
if (tpx) while (tpx->tp_fund == T_EQUAL) tpx = tpx->tp_next;
return tpx;
}
-int
-type_or_forward(tp)
- t_type *tp;
+int type_or_forward(t_type *tp)
{
/* POINTER TO IDENTIFIER construction. The IDENTIFIER resides
in "dot". This routine handles the different cases.
return 0;
}
-int
-gcd(m, n)
- register int m, n;
+int gcd(int m, int n)
{
/* Greatest Common Divisor
*/
return m;
}
-int
-lcm(m, n)
- int m, n;
+int lcm(int m, int n)
{
/* Least Common Multiple
*/
return m * (n / gcd(m, n));
}
-t_type *
-intorcard(left, right)
- register t_type *left, *right;
+t_type *intorcard(register t_type *left, register t_type *right)
{
if (left->tp_fund == T_INTORCARD) {
t_type *tmp = left;
}
#ifdef DEBUG
-DumpType(tp)
- register t_type *tp;
+void DumpType(register t_type *tp)
{
if (!tp) return;
*
* Author: Ceriel J.H. Jacobs
*/
+#ifndef TYPE_H_
+#define TYPE_H_
/* T Y P E D E S C R I P T O R S T R U C T U R E */
-/* $Id$ */
+#include "em_arith.h"
+
+
+
+typedef struct def t_def;
+typedef struct node t_node;
struct paramlist { /* structure for parameterlist of a PROCEDURE */
struct paramlist *par_next;
extern arith
ret_area_size;
-extern arith
- align(); /* type.c */
-extern t_type
- *construct_type(),
- *standard_type(),
- *set_type(),
- *subr_type(),
- *proc_type(),
- *enum_type(),
- *qualified_type(),
- *intorcard(),
- *RemoveEqual(); /* All from type.c */
#define NULLTYPE ((t_type *) 0)
extern arith min_int[];
#define ufit(n, i) (((n) & ~full_mask[(i)]) == 0)
+
+/* Forward declarations. */
+
+/* Initialize predefined types. */
+void InitTypes(void);
+/* Compare arith's, and return 1 if "l2" is
+ * greater or equal than "l1", otherwise returns 0.
+ * Takes into account that arith might be unsigned. */
+int chk_bounds(arith l1, arith l2, int fund);
+/* Aligns "pos" to the specified alignment "al" and returns the
+ aligned "pos".
+ */
+arith align(arith pos, int al);
+/* Create a new standard type "fund" with specified
+ alignment "algn" and "size" bytes. */
+t_type *standard_type(int fund, int algn, arith size);
+t_type *enum_type(t_node *EnumList);
+t_type *construct_type(int fund, register t_type *tp);
+t_type *qualified_type(t_node **pnd);
+/* Check that the value "i" fits in the subrange or enumeration
+ type "tp". Return 1 if so, 0 otherwise
+*/
+int in_range(arith i, register t_type *tp);
+/* Construct a subrange type from the constant expressions
+ indicated by "lb" and "ub", but first perform some
+ checks. "base" is either a user-specified base-type, or NULL.
+*/
+t_type *subr_type(t_node *lb, t_node *ub, t_type *base);
+t_type *proc_type(t_type *result_type, t_param *parameters, arith n_bytes_params);
+void genrck(register t_type *tp);
+/* Get the bounds of a bounded type. */
+void getbounds(register t_type *tp, arith *plo, arith *phi);
+/* Construct a set type with base type "tp", but first
+ * perform some checks */
+t_type *set_type(register t_type *tp);
+void ArrayElSize(register t_type *tp);
+void ArraySizes(register t_type *tp);
+void FreeType(register t_type *tp);
+void DeclareType(t_node *nd, register t_def *df, register t_type *tp);
+void SolveForwardTypeRefs(register t_def *df);
+void ForceForwardTypeDef(register t_def *df);
+t_type *RemoveEqual(register t_type *tpx);
+int type_or_forward(t_type *tp);
+t_type *intorcard(register t_type *left, register t_type *right);
+#ifdef DEBUG
+void DumpType(register t_type *tp);
+#endif
+int fit(arith sz, int nbytes);
+/* Greatest common divisotr. */
+int gcd(int m, int n);
+/* Least common multiple. */
+int lcm(int m, int n);
+
+
+
+#endif /* TYPE_H_ */
\ No newline at end of file
/* Routines for testing type equivalence, type compatibility, and
assignment compatibility
*/
-#include "parameters.h"
+#include "parameters.h"
#include "debug.h"
#include <em_arith.h>
#include <em_label.h>
#include <assert.h>
+
#include "type.h"
#include "LLlex.h"
#include "idf.h"
#include "def.h"
#include "node.h"
+#include "error.h"
+#include "typequiv.h"
#include "warning.h"
#include "main.h"
+#include "stab.h"
#include "Lpars.h"
+#include "print.h"
+#include "chk_expr.h"
-extern char *sprint();
-int
-TstTypeEquiv(tp1, tp2)
- t_type *tp1, *tp2;
+static int TstTypeEquiv(t_type *tp1, t_type *tp2)
{
/* test if two types are equivalent.
*/
- return tp1 == tp2
- ||
- tp1 == error_type
- ||
- tp2 == error_type;
+ return (tp1 == tp2) ||
+ (tp1 == error_type) ||
+ (tp2 == error_type);
}
-int
-TstParEquiv(tp1, tp2)
- register t_type *tp1, *tp2;
+static int TstParEquiv(register t_type *tp1, register t_type *tp2)
{
/* test if two parameter types are equivalent. This routine
is used to check if two different procedure declarations
);
}
-int
-TstProcEquiv(tp1, tp2)
- t_type *tp1, *tp2;
+int TstProcEquiv(t_type *tp1, t_type *tp2)
{
/* Test if two procedure types are equivalent. This routine
may also be used for the testing of assignment compatibility
return p1 == p2;
}
-int
-TstCompat(tp1, tp2)
- register t_type *tp1, *tp2;
+int TstCompat(register t_type *tp1, register t_type *tp2)
{
/* test if two types are compatible. See section 6.3 of the
Modula-2 Report for a definition of "compatible".
;
}
-int
-TstAssCompat(tp1, tp2)
- register t_type *tp1, *tp2;
+int TstAssCompat(register t_type *tp1, register t_type *tp2)
{
/* Test if two types are assignment compatible.
See Def 9.1.
return 0;
}
-char *
-incompat(tp1, tp2)
- register t_type *tp1, *tp2;
+char *incompat(register t_type *tp1, register t_type *tp2)
{
if (tp1->tp_fund == T_HIDDEN || tp2->tp_fund == T_HIDDEN) {
return "type incompatibility";
}
-int
-TstParCompat(parno, formaltype, VARflag, nd, edf)
- register t_type *formaltype;
- t_node **nd;
- t_def *edf;
+int TstParCompat(int parno, register t_type *formaltype, int VARflag, t_node **nd, t_def *edf)
{
/* Check type compatibility for a parameter in a procedure call.
Assignment compatibility may do if the parameter is
return 0;
}
-CompatCheck(nd, tp, message, fc)
- register t_node **nd;
- t_type *tp;
- char *message;
- int (*fc)();
+int CompatCheck(register t_node **nd, t_type *tp, char *message, int (*fc)())
{
if (! (*fc)(tp, (*nd)->nd_type)) {
if (message) {
return 1;
}
-ChkAssCompat(nd, tp, message)
- t_node **nd;
- t_type *tp;
- char *message;
+int ChkAssCompat(t_node **nd, t_type *tp, char *message)
{
/* Check assignment compatibility of node "nd" with type "tp".
Give an error message when it fails
return CompatCheck(nd, tp, message, TstAssCompat);
}
-ChkCompat(nd, tp, message)
- t_node **nd;
- t_type *tp;
- char *message;
+int ChkCompat(t_node **nd, t_type *tp, char *message)
{
/* Check compatibility of node "nd" with type "tp".
Give an error message when it fails
--- /dev/null
+/* Copyright (c) 2019 ACK Project.
+ * See the copyright notice in the ACK home directory,
+ * in the file "Copyright".
+ *
+ * Created on: 2019-02-25
+ *
+ */
+#ifndef TYPEQUIV_H_
+#define TYPEQUIV_H_
+
+typedef struct type t_type;
+typedef struct node t_node;
+typedef struct def t_def;
+
+int TstProcEquiv(t_type *tp1, t_type *tp2);
+int TstCompat(register t_type *tp1, register t_type *tp2);
+int TstAssCompat(register t_type *tp1, register t_type *tp2);
+int TstParCompat(int parno, register t_type *formaltype, int VARflag, t_node **nd, t_def *edf);
+
+int ChkCompat(t_node **nd, t_type *tp, char *message);
+int ChkAssCompat(t_node **nd, t_type *tp, char *message);
+
+char *incompat(register t_type *tp1, register t_type *tp2);
+
+#endif /* TYPEQUIV_H_ */
#include "node.h"
#include "Lpars.h"
#include "desig.h"
+#include "typequiv.h"
#include "f_info.h"
#include "idf.h"
#include "chk_expr.h"
#include "walk.h"
#include "misc.h"
+#include "error.h"
+#include "tmpvar.h"
+#include "stab.h"
+#include "code.h"
#include "warning.h"
-extern arith NewPtr();
-extern arith NewInt();
-extern arith TmpSpace();
+int CaseCode(t_node *, label, int);
extern int proclevel;
extern int gdb_flag;
static t_node* priority;
static int oldlineno;
-static int RegisterMessage();
-static int WalkDef();
-#ifdef DBSYMTAB
-static int stabdef();
-#endif
-static int MkCalls();
-static void UseWarnings();
+
+
#define NO_EXIT_LABEL ((label)0)
#define RETURN_LABEL ((label)1)
#define REACH_FLAG 1
#define EXIT_FLAG 2
-void DoAssign();
+/* Forward declarations. */
+static void WalkDef(register t_def*);
+static void MkCalls(register t_def*);
+static void UseWarnings(register t_def*);
+static void RegisterMessage(register t_def*);
+static void WalkDefList(register t_def*, void (*proc)(t_def*));
+#ifdef DBSYMTAB
+static void stabdef(t_def*);
+#endif
+
-int
- LblWalkNode(lbl, nd, exit, reach)
- label lbl,
- exit;
-t_node* nd;
+int LblWalkNode(label lbl, t_node *nd, int exit, int reach)
{
/* Generate code for node "nd", after generating instruction
label "lbl". "exit" is the exit label for the closest
static arith tmpprio;
-STATIC
-DoPriority()
+static void DoPriority(void)
{
/* For the time being (???), handle priorities by calls to
the runtime system
}
}
-STATIC
-EndPriority()
+static void EndPriority(void)
{
if (priority)
{
}
}
-def_ilb(l)
- label l;
+void def_ilb(label l)
{
/* Instruction label definition. Forget about line number.
*/
oldlineno = 0;
}
-DoLineno(nd) register t_node* nd;
+void DoLineno(register t_node* nd)
{
- /* Generate line number information, if necessary.
- */
if ((!options['L']
#ifdef DBSYMTAB
|| options['g']
}
}
-DoFilename(needed)
+void DoFilename(int needed)
{
- /* Generate filename information, when needed.
- This routine is called at the generation of a
- procedure entry, and after generating a call to
- another procedure.
- */
static label filename_label = 0;
oldlineno = 0; /* always invalidate remembered line number */
}
}
-WalkModule(module) register t_def* module;
+void WalkModule(register t_def* module)
{
- /* Walk through a module, and all its local definitions.
- Also generate code for its body.
- This code is collected in an initialization routine.
- */
register t_scope* sc;
t_scopelist* savevis = CurrVis;
WalkDefList(sc->sc_def, UseWarnings);
}
-WalkProcedure(procedure) register t_def* procedure;
+void WalkProcedure(register t_def* procedure)
{
- /* Walk through the definition of a procedure and all its
- local definitions, checking and generating code.
- */
+
t_scopelist* savevis = CurrVis;
register t_type* tp;
register t_param* param;
WalkDefList(procscope->sc_def, UseWarnings);
}
-static WalkDef(df) register t_def* df;
+/* Walk through a list of definitions */
+static void WalkDef(register t_def* df)
{
- /* Walk through a list of definitions
- */
+
switch (df->df_kind)
{
}
}
-static MkCalls(df) register t_def* df;
+/* Generate calls to initialization routines of modules */
+static void MkCalls(register t_def* df)
{
- /* Generate calls to initialization routines of modules
- */
+
if (df->df_kind == D_MODULE)
{
}
}
-WalkLink(nd, exit_label, end_reached) register t_node* nd;
-label exit_label;
+int WalkLink(register t_node* nd, label exit_label, int end_reached)
{
- /* Walk node "nd", which is a link.
- "exit_label" is set to a label number when inside a LOOP.
- "end_reached" maintains info about reachability (REACH_FLAG),
- and whether an EXIT statement was seen (EXIT_FLAG).
- */
while (nd && nd->nd_class == Link)
{ /* statement list */
return WalkNode(nd, exit_label, end_reached);
}
-STATIC
-ForLoopVarExpr(nd) register t_node* nd;
+static void ForLoopVarExpr(register t_node* nd)
{
register t_type* tp = nd->nd_type;
CodeCoercion(tp, BaseType(tp));
}
-int
- WalkStat(nd, exit_label, end_reached) register t_node* nd;
-label exit_label;
+int WalkStat(register t_node* nd, label exit_label, int end_reached)
{
- /* Walk through a statement, generating code for it.
- */
+
register t_node* left = nd->nd_LEFT;
register t_node* right = nd->nd_RIGHT;
return end_reached;
}
-extern int NodeCrash();
-int (*WalkTable[])() = {
+int (*WalkTable[])(t_node*, label, int) = {
NodeCrash,
NodeCrash,
NodeCrash,
extern t_desig null_desig;
-ExpectBool(pnd, true_label, false_label) register t_node** pnd;
-label true_label, false_label;
+void ExpectBool(register t_node** pnd, label true_label, label false_label)
{
- /* "pnd" must indicate a boolean expression. Check this and
- generate code to evaluate the expression.
- */
+
t_desig ds;
ds = null_desig;
}
}
-int
- WalkDesignator(pnd, ds, flags)
- t_node** pnd;
-t_desig* ds;
+int WalkDesignator(t_node** pnd, t_desig* ds, int flags)
{
- /* Check designator and generate code for it
- */
if (!ChkVariable(pnd, flags))
return 0;
return 1;
}
-DoForInit(nd)
- t_node* nd;
+int DoForInit(t_node* nd)
{
register t_node* right = nd->nd_RIGHT;
register t_def* df;
return 1;
}
-void
- DoAssign(nd) register t_node* nd;
+
+void DoAssign(register t_node* nd)
{
/* May we do it in this order (expression first) ???
The reference manual sais nothing about it, but the book does:
CodeMove(&dsr, nd->nd_LEFT, tp);
}
-static RegisterMessage(df) register t_def* df;
+static void RegisterMessage(register t_def* df)
{
register t_type* tp;
}
}
-static void
- df_warning(nd, df, warning)
- t_node* nd;
-t_def* df;
-char* warning;
+static void df_warning(t_node* nd, t_def* df, char* warning)
{
if (!(df->df_kind & (D_VARIABLE | D_PROCEDURE | D_TYPE | D_CONST | D_PROCHEAD)))
{
}
}
-static void
- UseWarnings(df) register t_def* df;
+static void UseWarnings(register t_def* df)
{
t_node* nd = df->df_scope->sc_end;
}
}
-WalkDefList(df, proc) register t_def* df;
-int (*proc)();
+static void WalkDefList(register t_def* df, void (*proc)(t_def*))
{
for (; df; df = df->df_nextinscope)
{
}
#ifdef DBSYMTAB
-static int
- stabdef(df)
- t_def* df;
+static void stabdef(t_def* df)
{
switch (df->df_kind)
{
*
* Author: Ceriel J.H. Jacobs
*/
-
/* P A R S E T R E E W A L K E R */
+#ifndef WALK_H_
+#define WALK_H_
+
+#include "em_label.h"
-/* $Id$ */
+/* Forward type declarations. */
+typedef struct node t_node;
+typedef struct def t_def;
+typedef struct desig t_desig;
/* Definition of WalkNode macro
*/
+extern int (*WalkTable[])(t_node*, label, int);
-extern int (*WalkTable[])();
-
-#define WalkNode(xnd, xlab, rch) (*WalkTable[(xnd)->nd_class])((xnd), (xlab),(rch))
+#define WalkNode(xnd, xlab, rch) (*WalkTable[(unsigned int)((xnd)->nd_class)])((xnd), (xlab),(rch))
extern label text_label;
extern label data_label;
#define CAL(nm, sz) (C_cal(nm), C_asp((arith)(sz)))
#define c_bra(x) C_bra((label) (x))
#endif
+
+
+
+int LblWalkNode(label lbl, t_node *nd, int exit, int reach);
+void def_ilb(label l);
+/* Generate line information as necessary for "nd". */
+void DoLineno(register t_node* nd);
+/* Generate filename information, when needed.
+ This routine is called at the generation of a
+ procedure entry, and after generating a call to
+ another procedure. The current active filename
+ is used.
+*/
+void DoFilename(int needed);
+
+/* Walk through a module, and all its local definitions.
+ Also generate code for its body.
+ This code is collected in an initialization routine.
+*/
+void WalkModule(register t_def* module);
+/* Walk through the definition of a procedure and all its
+ local definitions, checking and generating code.
+*/
+void WalkProcedure(register t_def* procedure);
+
+/* Walk node "nd", which is a link.
+ "exit_label" is set to a label number when inside a LOOP.
+ "end_reached" maintains info about reachability (REACH_FLAG),
+ and whether an EXIT statement was seen (EXIT_FLAG).
+*/
+int WalkLink(register t_node* nd, label exit_label, int end_reached);
+/* Walk through a statement node "nd", generating code for it. */
+int WalkStat(register t_node* nd, label exit_label, int end_reached);
+/* Generate code to evaluate a boolean expression "pnd" */
+void ExpectBool(register t_node** pnd, label true_label, label false_label);
+/* Check designator and generate code for it */
+int WalkDesignator(t_node** pnd, t_desig* ds, int flags);
+
+void DoAssign(register t_node* nd);
+
+int DoForInit(t_node* nd);
+
+#endif /* WALK_H_ */
public / ack.git / commitdiff