15950f9c95
For now, a long long literal must have the 'LL' or 'll' suffix. A literal without 'LL' or 'll' acts as before: it may become unsigned long but not long long. (For targets where int and long have the same size, some literals change from unsigned int to unsigned long.) Type `arith` may be too narrow for long long values. Add a second type `writh` for wide arithmetic, and change some variables from arith to writh. This may cause bugs if I forget to use writh, or if a conversion from writh to arith overflows. I mark some conversions with (arith) or (writh) casts. - BigPars, SmallPars: Remove SPECIAL_ARITHMETICS. This feature would change arith to a different type, but can't work, because it would conflict with definitions of arith in both <em_arith.h> and <flt_arith.h>. - LLlex.c: Understand 'LL' or 'll' suffix. Cut size of constant when it overflows writh, not only when it overflows the target machine's types. (This cut might not be necessary, because we might cut it again later.) When picking signed long or unsigned long, check the target's long type, not the compiler's arith type; the old check for `val >= 0` was broken where sizeof(arith) > 4. - LLlex.h: Change struct token's tok_ival to writh, so it can hold a long long literal. - arith.c: Adjust to VL_VALUE being writh. Don't convert between float and integer at compile-time if the integer might be too wide for <flt_arith.h>. Add writh2str(), because writh might be too wide for long2str(). - arith.h: Remove SPECIAL_ARITHMETICS. Declare full_mask[] here, not in several *.c files. Declare writh2str(). - ch3.c, ch3bin.c, ch3mon.c, declarator.c, statement.g: Remove obsolete casts. Adjust to VL_VALUE being writh. - conversion.c, stab.c: Don't declare full_mask[]. - cstoper.c: Use writh for constant operations on VL_VALUE, and for full_mask[]. - declar., field.c, ival.g: Add casts. - dumpidf.c: Need to #include "parameters.h" before checking DEBUG. Use writh2str, because "%ld" might not work. - eval.c, eval.h: Add casts. Use writh when writing a wide constant in EM. - expr.c: Add and remove casts. In fill_int_expr(), make expression from long long literal. In chk_cst_expr(), allow long long as constant expression, so the compiler may accept `case 123LL:` in a switch statement. - expr.str: Change struct value's vl_value and struct expr's VL_VALUE to writh, so an expression may have a long long value at compile time. - statement.g: Remove obsolete casts. - switch.c, switch.str: Use writh in case entries for switch statements, so `switch (ll) {...}` with long long ll works. - tokenname.c: Add ULNGLNG so LLlex.c can use it for literals.
245 lines
6.1 KiB
C
245 lines
6.1 KiB
C
/*
|
|
* (c) copyright 1987 by the Vrije Universiteit, Amsterdam, The Netherlands.
|
|
* See the copyright notice in the ACK home directory, in the file "Copyright".
|
|
*/
|
|
/* $Id$ */
|
|
/* S W I T C H - S T A T E M E N T A D M I N I S T R A T I O N */
|
|
|
|
#include <assert.h>
|
|
#include "parameters.h"
|
|
#ifndef LINT
|
|
#include <em.h>
|
|
#else
|
|
#include "l_em.h"
|
|
#endif /* LINT */
|
|
#include <ack_string.h>
|
|
#include <alloc.h>
|
|
#include "Lpars.h"
|
|
#include "label.h"
|
|
#include <flt_arith.h>
|
|
#include "arith.h"
|
|
#include "switch.h"
|
|
#include "code.h"
|
|
#include "expr.h"
|
|
#include "type.h"
|
|
#include "sizes.h"
|
|
#include "switch.h"
|
|
#include "eval.h"
|
|
#include "ch3.h"
|
|
#include "error.h"
|
|
|
|
extern char options[];
|
|
|
|
int density = DENSITY;
|
|
|
|
static int compact(int nr, writh low, writh up)
|
|
{
|
|
/* Careful! up - low might not fit in an arith. And then,
|
|
the test "up-low < 0" might also not work to detect this
|
|
situation! Or is this just a bug in the M68020/M68000?
|
|
*/
|
|
writh diff = up - low;
|
|
|
|
return (nr == 0 || (diff >= 0 && diff / nr <= (density - 1)));
|
|
}
|
|
|
|
static struct switch_hdr *switch_stack = 0;
|
|
|
|
/* (EB 86.05.20) The following rules hold for switch statements:
|
|
- the expression E in "switch(E)" shall have integral type (3.6.4.2)
|
|
- the expression E in "case E:" is converted to the promoted type
|
|
of the controlling expression
|
|
For simplicity, we suppose int_size == word_size.
|
|
*/
|
|
|
|
void code_startswitch(struct expr **expp)
|
|
{
|
|
/* Check the expression, stack a new case header and
|
|
fill in the necessary fields.
|
|
*/
|
|
register label l_table = text_label();
|
|
register label l_break = text_label();
|
|
register struct switch_hdr *sh = new_switch_hdr();
|
|
int fund = any2arith(expp, SWITCH);
|
|
/* INT, LONG, LNGLNG, FLOAT, DOUBLE or LNGDBL */
|
|
|
|
switch (fund) {
|
|
case FLOAT:
|
|
case DOUBLE:
|
|
case LNGDBL:
|
|
error("floating point type in switch");
|
|
erroneous2int(expp);
|
|
break;
|
|
}
|
|
stack_stmt(l_break, NO_LABEL);
|
|
sh->sh_break = l_break;
|
|
/* sh->sh_default = 0; */
|
|
sh->sh_table = l_table;
|
|
/* sh->sh_nrofentries = 0; */
|
|
sh->sh_type = (*expp)->ex_type; /* the expression switched */
|
|
/* sh->sh_entries = (struct case_entry *) 0; -- case-entry list */
|
|
sh->sh_expr = *expp;
|
|
#ifdef LINT
|
|
code_expr(sh->sh_expr, RVAL, TRUE, NO_LABEL, NO_LABEL);
|
|
#endif
|
|
sh->next = switch_stack; /* push onto switch-stack */
|
|
switch_stack = sh;
|
|
C_bra(l_table); /* goto start of switch_table */
|
|
}
|
|
|
|
void code_endswitch(void)
|
|
{
|
|
register struct switch_hdr *sh = switch_stack;
|
|
register label tablabel;
|
|
register struct case_entry *ce;
|
|
arith size = sh->sh_type->tp_size;
|
|
|
|
if (sh->sh_default == 0) /* no default occurred yet */
|
|
sh->sh_default = sh->sh_break;
|
|
|
|
#ifndef LINT
|
|
C_bra(sh->sh_break); /* skip the switch table now */
|
|
C_df_ilb(sh->sh_table); /* switch table entry */
|
|
/* evaluate the switch expr. */
|
|
code_expr(sh->sh_expr, RVAL, TRUE, NO_LABEL, NO_LABEL);
|
|
if (sh->sh_nrofentries <= 1) {
|
|
if (sh->sh_nrofentries) {
|
|
load_cst(sh->sh_lowerbd, size);
|
|
C_cms(size);
|
|
C_zeq(sh->sh_entries->ce_label);
|
|
}
|
|
else C_asp(size);
|
|
C_bra(sh->sh_default);
|
|
}
|
|
else {
|
|
tablabel = data_label(); /* the rom must have a label */
|
|
C_df_dlb(tablabel);
|
|
C_rom_ilb(sh->sh_default);
|
|
if (compact(sh->sh_nrofentries, sh->sh_lowerbd, sh->sh_upperbd)) {
|
|
/* CSA */
|
|
writh val;
|
|
|
|
C_rom_icon(writh2str(sh->sh_lowerbd, 0), size);
|
|
C_rom_icon(writh2str(sh->sh_upperbd - sh->sh_lowerbd, 0),
|
|
size);
|
|
ce = sh->sh_entries;
|
|
for (val = sh->sh_lowerbd; val <= sh->sh_upperbd; val++) {
|
|
assert(ce);
|
|
if (val == ce->ce_value) {
|
|
C_rom_ilb(ce->ce_label);
|
|
ce = ce->next;
|
|
}
|
|
else
|
|
C_rom_ilb(sh->sh_default);
|
|
}
|
|
C_lae_dlb(tablabel, (arith)0); /* perform the switch */
|
|
C_csa(size);
|
|
}
|
|
else { /* CSB */
|
|
C_rom_icon(writh2str(sh->sh_nrofentries, 0), size);
|
|
for (ce = sh->sh_entries; ce; ce = ce->next) {
|
|
/* generate the entries: value + prog.label */
|
|
C_rom_icon(writh2str(ce->ce_value, 0), size);
|
|
C_rom_ilb(ce->ce_label);
|
|
}
|
|
C_lae_dlb(tablabel, (arith)0); /* perform the switch */
|
|
C_csb(size);
|
|
}
|
|
}
|
|
C_df_ilb(sh->sh_break);
|
|
#endif
|
|
|
|
switch_stack = sh->next; /* unstack the switch descriptor */
|
|
for (ce = sh->sh_entries; ce;) { /* free allocated switch structure */
|
|
register struct case_entry *tmp = ce->next;
|
|
|
|
free_case_entry(ce);
|
|
ce = tmp;
|
|
}
|
|
free_switch_hdr(sh);
|
|
unstack_stmt();
|
|
}
|
|
|
|
void code_case(struct expr *expr)
|
|
{
|
|
writh val;
|
|
register struct case_entry *ce;
|
|
register struct switch_hdr *sh = switch_stack;
|
|
|
|
assert(is_cp_cst(expr));
|
|
if (sh == 0) {
|
|
error("case statement not in switch");
|
|
return;
|
|
}
|
|
if (expr->ex_flags & EX_ERROR) /* is probably 0 anyway */
|
|
return;
|
|
ch3cast(&expr, CASE, sh->sh_type);
|
|
ce = new_case_entry();
|
|
C_df_ilb(ce->ce_label = text_label());
|
|
ce->ce_value = val = expr->VL_VALUE;
|
|
if (sh->sh_entries == 0) { /* first case entry */
|
|
/* ce->next = (struct case_entry *) 0; */
|
|
sh->sh_entries = ce;
|
|
sh->sh_lowerbd = sh->sh_upperbd = val;
|
|
sh->sh_nrofentries = 1;
|
|
}
|
|
else { /* second etc. case entry; put ce into proper place */
|
|
register struct case_entry *c1 = sh->sh_entries, *c2 = 0;
|
|
|
|
if (val < sh->sh_lowerbd)
|
|
sh->sh_lowerbd = val;
|
|
else
|
|
if (val > sh->sh_upperbd)
|
|
sh->sh_upperbd = val;
|
|
while (c1 && c1->ce_value < ce->ce_value) {
|
|
c2 = c1;
|
|
c1 = c1->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 to be non-empty.
|
|
*/
|
|
if (c1) {
|
|
if (c1->ce_value == ce->ce_value) {
|
|
error("multiple case entry for value %ld",
|
|
ce->ce_value);
|
|
free_case_entry(ce);
|
|
return;
|
|
}
|
|
if (c2) {
|
|
ce->next = c2->next;
|
|
c2->next = ce;
|
|
}
|
|
else {
|
|
ce->next = sh->sh_entries;
|
|
sh->sh_entries = ce;
|
|
}
|
|
}
|
|
else {
|
|
assert(c2);
|
|
ce->next = (struct case_entry *) 0;
|
|
c2->next = ce;
|
|
}
|
|
(sh->sh_nrofentries)++;
|
|
}
|
|
}
|
|
|
|
void code_default(void)
|
|
{
|
|
register struct switch_hdr *sh = switch_stack;
|
|
|
|
if (sh == 0) {
|
|
error("default statement not in switch");
|
|
return;
|
|
}
|
|
if (sh->sh_default != 0) {
|
|
error("multiple entry for default in switch");
|
|
return;
|
|
}
|
|
|
|
C_df_ilb(sh->sh_default = text_label());
|
|
}
|