1
0
mirror of https://github.com/cc65/cc65.git synced 2024-06-01 13:41:34 +00:00
cc65/src/cc65/stmt.c

765 lines
16 KiB
C
Raw Normal View History

/*
* stmt.c
*
* Ullrich von Bassewitz, 06.08.1998
*
* Original by John R. Dunning - see copyleft.jrd
*/
#include <stdio.h>
#include <string.h>
/* common */
#include "xmalloc.h"
/* cc65 */
#include "asmcode.h"
#include "asmlabel.h"
#include "codegen.h"
#include "datatype.h"
#include "error.h"
#include "expr.h"
#include "function.h"
#include "global.h"
#include "goto.h"
#include "litpool.h"
#include "locals.h"
#include "loop.h"
#include "pragma.h"
#include "scanner.h"
#include "symtab.h"
#include "stmt.h"
/*****************************************************************************/
/* Data */
/*****************************************************************************/
/* Maximum count of cases */
#define CASE_MAX 257
/*****************************************************************************/
/* Code */
/*****************************************************************************/
static int statement (void);
/* Forward decl */
static int doif (void)
/* Handle 'if' statement here */
{
int flab1;
int flab2;
int gotbreak;
/* Skip the if */
NextToken ();
/* Generate a jump label and parse the condition */
flab1 = GetLabel ();
test (flab1, 0);
/* Parse the if body */
gotbreak = statement ();
/* Else clause present? */
if (curtok != TOK_ELSE) {
g_defloclabel (flab1);
/* Since there's no else clause, we're not sure, if the a break
* statement is really executed.
*/
return 0;
} else {
/* Skip the else */
NextToken ();
/* If we had some sort of break statement at the end of the if clause,
* there's no need to generate an additional jump around the else
* clause, since the jump is never reached.
*/
if (!gotbreak) {
flab2 = GetLabel ();
g_jump (flab2);
} else {
/* Mark the label as unused */
flab2 = 0;
}
g_defloclabel (flab1);
gotbreak &= statement ();
/* Generate the label for the else clause */
if (flab2) {
g_defloclabel (flab2);
}
/* Done */
return gotbreak;
}
}
static void dowhile (char wtype)
/* Handle 'while' statement here */
{
int loop;
int lab;
NextToken ();
loop = GetLabel ();
lab = GetLabel ();
AddLoop (oursp, loop, lab, 0, 0);
g_defloclabel (loop);
if (wtype == 'w') {
/* While loop */
test (lab, 0);
/* If the statement following the while loop is empty, that is, we have
* something like "while (1) ;", the test function ommitted the jump as
* an optimization. Since we know, the condition codes are set, we can
* do another small optimization here, and use a conditional jump
* instead an absolute one.
*/
if (curtok == TOK_SEMI) {
/* Shortcut */
NextToken ();
/* Use a conditional jump */
g_truejump (CF_NONE, loop);
} else {
/* There is code inside the while loop */
statement ();
g_jump (loop);
g_defloclabel (lab);
}
} else {
/* Do loop */
statement ();
Consume (TOK_WHILE, "`while' expected");
test (loop, 1);
ConsumeSemi ();
g_defloclabel (lab);
}
DelLoop ();
}
static void doreturn (void)
/* Handle 'return' statement here */
{
struct expent lval;
unsigned Flags = 0; /* Code generator flags */
int HaveVal = 0; /* Do we have a return value in ax? */
NextToken ();
if (curtok != TOK_SEMI) {
if (HasVoidReturn (CurrentFunc)) {
Error ("Returning a value in function with return type void");
}
if (evalexpr (CF_NONE, hie0, &lval) == 0) {
/* Constant value */
Flags = CF_CONST;
} else {
/* Value in the primary register */
HaveVal = 1;
}
/* Convert the return value to the type of the function result */
if (!HasVoidReturn (CurrentFunc)) {
Flags |= (assignadjust (GetReturnType (CurrentFunc), &lval) & ~CF_CONST) | CF_REG;
}
} else if (!HasVoidReturn (CurrentFunc)) {
Error ("Function `%s' must return a value", GetFuncName (CurrentFunc));
}
RestoreRegVars (HaveVal);
g_leave (Flags, lval.e_const);
}
static void dobreak (void)
/* Handle 'break' statement here */
{
LoopDesc* L;
/* Skip the break */
NextToken ();
/* Get the current loop descriptor */
L = CurrentLoop ();
/* Check if we are inside a loop */
if (L == 0) {
/* Error: No current loop */
Error ("`break' statement not within loop or switch");
return;
}
/* Correct the stack pointer if needed */
g_space (oursp - L->StackPtr);
/* Jump to the exit label of the loop */
g_jump (L->Label);
}
static void docontinue (void)
/* Handle 'continue' statement here */
{
LoopDesc* L;
/* Skip the continue */
NextToken ();
/* Get the current loop descriptor */
L = CurrentLoop ();
if (L) {
/* Search for the correct loop */
do {
if (L->Loop) {
break;
}
L = L->Next;
} while (L);
}
/* Did we find it? */
if (L == 0) {
Error ("`continue' statement not within a loop");
return;
}
/* Correct the stackpointer if needed */
g_space (oursp - L->StackPtr);
/* Output the loop code */
if (L->linc) {
g_jump (L->linc);
} else {
g_jump (L->Loop);
}
}
static void cascadeswitch (struct expent* eval)
/* Handle a switch statement for chars with a cmp cascade for the selector */
{
unsigned ExitLab; /* Exit label */
unsigned NextLab; /* Next case label */
unsigned CodeLab; /* Label that starts the actual selector code */
int HaveBreak; /* Remember if we exited with break */
int HaveDefault; /* Remember if we had a default label */
int lcount; /* Label count */
unsigned Flags; /* Code generator flags */
struct expent lval; /* Case label expression */
long Val; /* Case label value */
/* Create a loop so we may break out, init labels */
ExitLab = GetLabel ();
AddLoop (oursp, 0, ExitLab, 0, 0);
/* Setup some variables needed in the loop below */
Flags = TypeOf (eval->e_tptr) | CF_CONST | CF_FORCECHAR;
CodeLab = NextLab = 0;
HaveBreak = 1;
HaveDefault = 0;
/* Parse the labels */
lcount = 0;
while (curtok != TOK_RCURLY) {
if (curtok == TOK_CASE || curtok == TOK_DEFAULT) {
/* If the code for the previous selector did not end with a
* break statement, we must jump over the next selector test.
*/
if (!HaveBreak) {
/* Define a label for the code */
if (CodeLab == 0) {
CodeLab = GetLabel ();
}
g_jump (CodeLab);
}
/* If we have a cascade label, emit it */
if (NextLab) {
g_defloclabel (NextLab);
NextLab = 0;
}
while (curtok == TOK_CASE || curtok == TOK_DEFAULT) {
/* Parse the selector */
if (curtok == TOK_CASE) {
/* Count labels */
++lcount;
/* Skip the "case" token */
NextToken ();
/* Read the selector expression */
constexpr (&lval);
if (!IsClassInt (lval.e_tptr)) {
Error ("Switch quantity not an integer");
}
/* Check the range of the expression */
Val = lval.e_const;
switch (*eval->e_tptr) {
case T_SCHAR:
/* Signed char */
if (Val < -128 || Val > 127) {
Error ("Range error");
}
break;
case T_UCHAR:
if (Val < 0 || Val > 255) {
Error ("Range error");
}
break;
case T_INT:
if (Val < -32768 || Val > 32767) {
Error ("Range error");
}
break;
case T_UINT:
if (Val < 0 || Val > 65535) {
Error ("Range error");
}
break;
default:
Internal ("Invalid type: %02X", *eval->e_tptr & 0xFF);
}
/* Skip the colon */
ConsumeColon ();
/* Emit a compare */
g_cmp (Flags, Val);
/* If another case follows, we will jump to the code if
* the condition is true.
*/
if (curtok == TOK_CASE) {
/* Create a code label if needed */
if (CodeLab == 0) {
CodeLab = GetLabel ();
}
g_falsejump (CF_NONE, CodeLab);
} else if (curtok != TOK_DEFAULT) {
/* No case follows, jump to next selector */
if (NextLab == 0) {
NextLab = GetLabel ();
}
g_truejump (CF_NONE, NextLab);
}
} else {
/* Default case */
NextToken ();
/* Skip the colon */
ConsumeColon ();
/* Handle the pathologic case: DEFAULT followed by CASE */
if (curtok == TOK_CASE) {
if (CodeLab == 0) {
CodeLab = GetLabel ();
}
g_jump (CodeLab);
}
/* Remember that we had a default label */
HaveDefault = 1;
}
}
}
/* Emit a code label if we have one */
if (CodeLab) {
g_defloclabel (CodeLab);
CodeLab = 0;
}
/* Parse statements */
if (curtok != TOK_RCURLY) {
HaveBreak = statement ();
}
}
/* Check if we have any labels */
if (lcount == 0 && !HaveDefault) {
Warning ("No case labels");
}
/* Eat the closing curly brace */
NextToken ();
/* Define the exit label and, if there's a next label left, create this
* one, too.
*/
if (NextLab) {
g_defloclabel (NextLab);
}
g_defloclabel (ExitLab);
/* End the loop */
DelLoop ();
}
static void tableswitch (struct expent* eval)
/* Handle a switch statement via table based selector */
{
/* Entry for one case in a switch statement */
struct swent {
long sw_const; /* selector value */
unsigned sw_lab; /* label for this selector */
};
int dlabel; /* for default */
int lab; /* exit label */
int label; /* label for case */
int lcase; /* label for compares */
int lcount; /* Label count */
int HaveBreak; /* Last statement has a break */
int HaveDefault; /* Remember if we had a default label */
unsigned Flags; /* Code generator flags */
struct expent lval; /* Case label expression */
struct swent *p;
struct swent *swtab;
/* Allocate memory for the switch table */
swtab = xmalloc (CASE_MAX * sizeof (struct swent));
/* Create a look so we may break out, init labels */
HaveBreak = 0; /* Keep gcc silent */
HaveDefault = 0; /* No default case until now */
dlabel = 0; /* init */
lab = GetLabel (); /* get exit */
p = swtab;
AddLoop (oursp, 0, lab, 0, 0);
/* Jump behind the code for the CASE labels */
g_jump (lcase = GetLabel ());
lcount = 0;
while (curtok != TOK_RCURLY) {
if (curtok == TOK_CASE || curtok == TOK_DEFAULT) {
if (lcount >= CASE_MAX) {
Fatal ("Too many case labels");
}
label = GetLabel ();
do {
if (curtok == TOK_CASE) {
NextToken ();
constexpr (&lval);
if (!IsClassInt (lval.e_tptr)) {
Error ("Switch quantity not an integer");
}
p->sw_const = lval.e_const;
p->sw_lab = label;
++p;
++lcount;
} else {
NextToken ();
dlabel = label;
HaveDefault = 1;
}
ConsumeColon ();
} while (curtok == TOK_CASE || curtok == TOK_DEFAULT);
g_defloclabel (label);
HaveBreak = 0;
}
if (curtok != TOK_RCURLY) {
HaveBreak = statement ();
}
}
/* Check if we have any labels */
if (lcount == 0 && !HaveDefault) {
Warning ("No case labels");
}
/* Eat the closing curly brace */
NextToken ();
/* If the last statement doesn't have a break or return, add one */
if (!HaveBreak) {
g_jump (lab);
}
/* Actual selector code goes here */
g_defloclabel (lcase);
/* Create the call to the switch subroutine */
Flags = TypeOf (eval->e_tptr);
g_switch (Flags);
/* First entry is negative of label count */
g_defdata (CF_INT | CF_CONST, -((int)lcount)-1, 0);
/* Create the case selector table */
AddCodeHint ("casetable");
p = swtab;
while (lcount) {
g_case (Flags, p->sw_lab, p->sw_const); /* Create one label */
--lcount;
++p;
}
if (dlabel) {
g_jump (dlabel);
}
g_defloclabel (lab);
DelLoop ();
/* Free the allocated space for the labels */
xfree (swtab);
}
static void doswitch (void)
/* Handle 'switch' statement here */
{
struct expent eval; /* Switch statement expression */
/* Eat the "switch" */
NextToken ();
/* Read the switch expression */
ConsumeLParen ();
intexpr (&eval);
ConsumeRParen ();
/* result of expr is in P */
ConsumeLCurly ();
/* Now decide which sort of switch we will create: */
if (IsTypeChar (eval.e_tptr) || (CodeSizeFactor >= 200 && IsClassInt (eval.e_tptr))) {
cascadeswitch (&eval);
} else {
tableswitch (&eval);
}
}
static void dofor (void)
/* Handle 'for' statement here */
{
int loop;
int lab;
int linc;
int lstat;
struct expent lval1;
struct expent lval2;
struct expent lval3;
NextToken ();
loop = GetLabel ();
lab = GetLabel ();
linc = GetLabel ();
lstat = GetLabel ();
AddLoop (oursp, loop, lab, linc, lstat);
ConsumeLParen ();
if (curtok != TOK_SEMI) { /* exp1 */
expression (&lval1);
}
ConsumeSemi ();
g_defloclabel (loop);
if (curtok != TOK_SEMI) { /* exp2 */
boolexpr (&lval2);
g_truejump (CF_NONE, lstat);
g_jump (lab);
} else {
g_jump (lstat);
}
ConsumeSemi ();
g_defloclabel (linc);
if (curtok != TOK_RPAREN) { /* exp3 */
expression (&lval3);
}
ConsumeRParen ();
g_jump (loop);
g_defloclabel (lstat);
statement ();
g_jump (linc);
g_defloclabel (lab);
DelLoop ();
}
static int statement (void)
/* Statement parser. Called whenever syntax requires a statement.
* This routine performs that statement and returns 1 if it is a branch,
* 0 otherwise
*/
{
struct expent lval;
/* */
if (curtok == TOK_IDENT && nxttok == TOK_COLON) {
/* Special handling for a label */
DoLabel ();
} else {
switch (curtok) {
case TOK_LCURLY:
return compound ();
case TOK_IF:
return doif ();
case TOK_WHILE:
dowhile ('w');
break;
case TOK_DO:
dowhile ('d');
break;
case TOK_SWITCH:
doswitch ();
break;
case TOK_RETURN:
doreturn ();
ConsumeSemi ();
return 1;
case TOK_BREAK:
dobreak ();
ConsumeSemi ();
return 1;
case TOK_CONTINUE:
docontinue ();
ConsumeSemi ();
return 1;
case TOK_FOR:
dofor ();
break;
case TOK_GOTO:
DoGoto ();
ConsumeSemi ();
return 1;
case TOK_SEMI:
/* ignore it. */
NextToken ();
break;
case TOK_PRAGMA:
DoPragma ();
break;
default:
AddCodeHint ("stmt:start");
expression (&lval);
AddCodeHint ("stmt:end");
ConsumeSemi ();
}
}
return 0;
}
int compound (void)
/* Compound statement. Allow any number of statements, inside braces. */
{
static unsigned CurrentLevel = 0;
int isbrk;
int oldsp;
/* eat LCURLY */
NextToken ();
/* Remember the stack at block entry */
oldsp = oursp;
/* If we're not on function level, enter a new lexical level */
if (CurrentLevel++ > 0) {
/* A nested block */
EnterBlockLevel ();
}
/* Parse local variable declarations if any */
DeclareLocals ();
/* Now process statements in the function body */
isbrk = 0;
while (curtok != TOK_RCURLY) {
if (curtok == TOK_CEOF)
break;
else {
isbrk = statement ();
}
}
/* Emit references to imports/exports for this block */
EmitExternals ();
/* If this is not the top level compound statement, clean up the stack.
* For a top level statement this will be done by the function exit code.
*/
if (--CurrentLevel != 0) {
/* Some sort of nested block */
LeaveBlockLevel ();
if (isbrk) {
oursp = oldsp;
} else {
g_space (oursp - oldsp);
oursp = oldsp;
}
}
/* Eat closing brace */
ConsumeRCurly ();
return isbrk;
}