cc65/src/cc65/stmt.c

/*
 * 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 DoIf (void)
/* Handle an 'if' statement */
{
    int flab1;
    int flab2;
    int gotbreak;

    /* Skip the if */
    NextToken ();

    /* Generate a jump label and parse the condition */
    flab1 = GetLocalLabel ();
    test (flab1, 0);

    /* Parse the if body */
    gotbreak = Statement ();

    /* Else clause present? */
    if (CurTok.Tok != TOK_ELSE) {

      	g_defcodelabel (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 = GetLocalLabel ();
     	    g_jump (flab2);
     	} else {
     	    /* Mark the label as unused */
     	    flab2 = 0;
     	}
     	g_defcodelabel (flab1);
     	gotbreak &= Statement ();

     	/* Generate the label for the else clause */
     	if (flab2) {
     	    g_defcodelabel (flab2);
     	}

     	/* Done */
     	return gotbreak;
    }
}



static void DoDo (void)
/* Handle the 'do' statement */
{
    /* Get the loop control labels */
    unsigned loop = GetLocalLabel ();
    unsigned lab = GetLocalLabel ();

    /* Skip the while token */
    NextToken ();

    /* Add the loop to the loop stack */
    AddLoop (oursp, loop, lab, 0, 0);

    /* Define the head label */
    g_defcodelabel (loop);

    /* Parse the loop body */
    Statement ();

    /* Parse the end condition */
    Consume (TOK_WHILE, "`while' expected");
    test (loop, 1);
    ConsumeSemi ();

    /* Define the break label */
    g_defcodelabel (lab);

    /* Remove the loop from the loop stack */
    DelLoop ();
}



static void DoWhile (void)
/* Handle the 'while' statement */
{
    /* Get the loop control labels */
    unsigned loop = GetLocalLabel ();
    unsigned lab = GetLocalLabel ();

    /* Skip the while token */
    NextToken ();

    /* Add the loop to the loop stack */
    AddLoop (oursp, loop, lab, 0, 0);

    /* Define the head label */
    g_defcodelabel (loop);

    /* Test the loop condition */
    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 == TOK_SEMI) {
    	/* Use a conditional jump */
    	g_truejump (CF_NONE, loop);
    	/* Shortcut */
    	NextToken ();
    } else {
    	/* There is code inside the while loop, parse the body */
    	Statement ();
    	g_jump (loop);
    	g_defcodelabel (lab);
    }

    /* Remove the loop from the loop stack */
    DelLoop ();
}



static void DoReturn (void)
/* Handle the 'return' statement */
{
    struct expent lval;

    NextToken ();
    if (CurTok.Tok != TOK_SEMI) {
       	if (HasVoidReturn (CurrentFunc)) {
       	    Error ("Returning a value in function with return type void");
       	}

	/* Evaluate the return expression. Result will be in primary */
	expression (&lval);

    	/* Convert the return value to the type of the function result */
    	if (!HasVoidReturn (CurrentFunc)) {
       	    assignadjust (GetReturnType (CurrentFunc), &lval);
    	}
    } else if (!HasVoidReturn (CurrentFunc)) {
    	Error ("Function `%s' must return a value", GetFuncName (CurrentFunc));
    }

    /* Cleanup the stack in case we're inside a block with locals */
    g_space (oursp - GetTopLevelSP (CurrentFunc));

    /* Output a jump to the function exit code */
    g_jump (GetRetLab (CurrentFunc));
}



static void DoBreak (void)
/* Handle the 'break' statement */
{
    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 the 'continue' statement */
{
    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 = GetLocalLabel ();
    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 != TOK_RCURLY) {

	if (CurTok.Tok == TOK_CASE || CurTok.Tok == 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 = GetLocalLabel ();
		}
		g_jump (CodeLab);
	    }

	    /* If we have a cascade label, emit it */
	    if (NextLab) {
		g_defcodelabel (NextLab);
		NextLab = 0;
	    }

	    while (CurTok.Tok == TOK_CASE || CurTok.Tok == TOK_DEFAULT) {

		/* Parse the selector */
		if (CurTok.Tok == 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);
		    }

		    /* 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 == TOK_CASE) {
			/* Create a code label if needed */
		    	if (CodeLab == 0) {
			    CodeLab = GetLocalLabel ();
			}
			g_falsejump (CF_NONE, CodeLab);
		    } else if (CurTok.Tok != TOK_DEFAULT) {
		  	/* No case follows, jump to next selector */
		  	if (NextLab == 0) {
		  	    NextLab = GetLocalLabel ();
		  	}
		  	g_truejump (CF_NONE, NextLab);
		    }

		    /* Skip the colon */
		    ConsumeColon ();

		} else {

		    /* Default case */
		    NextToken ();

		    /* Handle the pathologic case: DEFAULT followed by CASE */
		    if (CurTok.Tok == TOK_CASE) {
		  	if (CodeLab == 0) {
		   	    CodeLab = GetLocalLabel ();
		  	}
		    	g_jump (CodeLab);
		    }

		    /* Skip the colon */
		    ConsumeColon ();

		    /* Remember that we had a default label */
		    HaveDefault = 1;
		}

	    }

        }

	/* Emit a code label if we have one */
	if (CodeLab) {
	    g_defcodelabel (CodeLab);
	    CodeLab = 0;
	}

	/* Parse statements */
	if (CurTok.Tok != TOK_RCURLY) {
       	    HaveBreak = Statement ();
	}
    }

    /* Check if we have any labels */
    if (lcount == 0 && !HaveDefault) {
     	Warning ("No case labels");
    }

    /* Define the exit label and, if there's a next label left, create this
     * one, too.
     */
    if (NextLab) {
	g_defcodelabel (NextLab);
    }
    g_defcodelabel (ExitLab);

    /* Eat the closing curly brace */
    NextToken ();

    /* 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 = GetLocalLabel ();	/* get exit */
    p = swtab;
    AddLoop (oursp, 0, lab, 0, 0);

    /* Jump behind the code for the CASE labels */
    g_jump (lcase = GetLocalLabel ());
    lcount = 0;
    while (CurTok.Tok != TOK_RCURLY) {
    	if (CurTok.Tok == TOK_CASE || CurTok.Tok == TOK_DEFAULT) {
	    if (lcount >= CASE_MAX) {
       	       	Fatal ("Too many case labels");
     	    }
    	    label = GetLocalLabel ();
    	    do {
    	    	if (CurTok.Tok == 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 == TOK_CASE || CurTok.Tok == TOK_DEFAULT);
    	    g_defcodelabel (label);
	    HaveBreak = 0;
    	}
    	if (CurTok.Tok != 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_defcodelabel (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 */
    p = swtab;
    while (lcount) {
       	g_case (Flags, p->sw_lab, p->sw_const);	/* Create one label */
	--lcount;
	++p;
    }

    if (dlabel) {
       	g_jump (dlabel);
    }
    g_defcodelabel (lab);
    DelLoop ();

    /* Free the allocated space for the labels */
    xfree (swtab);
}



static void DoSwitch (void)
/* Handle a 'switch' statement */
{
    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 a 'for' statement */
{
    int loop;
    int lab;
    int linc;
    int lstat;
    struct expent lval1;
    struct expent lval2;
    struct expent lval3;

    NextToken ();
    loop = GetLocalLabel ();
    lab = GetLocalLabel ();
    linc = GetLocalLabel ();
    lstat = GetLocalLabel ();
    AddLoop (oursp, loop, lab, linc, lstat);
    ConsumeLParen ();
    if (CurTok.Tok != TOK_SEMI) {	/* exp1 */
	expression (&lval1);
    }
    ConsumeSemi ();
    g_defcodelabel (loop);
    if (CurTok.Tok != TOK_SEMI) { 	/* exp2 */
	boolexpr (&lval2);
	g_truejump (CF_NONE, lstat);
	g_jump (lab);
    } else {
	g_jump (lstat);
    }
    ConsumeSemi ();
    g_defcodelabel (linc);
    if (CurTok.Tok != TOK_RPAREN) {	/* exp3 */
    	expression (&lval3);
    }
    ConsumeRParen ();
    g_jump (loop);
    g_defcodelabel (lstat);
    Statement ();
    g_jump (linc);
    g_defcodelabel (lab);
    DelLoop ();
}



static int CompoundStatement (void)
/* Compound statement. Allow any number of statements inside braces. */
{
    int isbrk;
    int oldsp;

    /* eat LCURLY */
    NextToken ();

    /* Remember the stack at block entry */
    oldsp = oursp;

    /* Enter a new lexical level */
    EnterBlockLevel ();

    /* Parse local variable declarations if any */
    DeclareLocals ();

    /* Now process statements in this block */
    isbrk = 0;
    while (CurTok.Tok != TOK_RCURLY) {
     	if (CurTok.Tok != TOK_CEOF) {
     	    isbrk = Statement ();
     	} else {
     	    break;
     	}
    }

    /* Emit references to imports/exports for this block */
    EmitExternals ();

    /* Clean up the stack. */
    if (isbrk) {
	oursp = oldsp;
    } else {
	g_space (oursp - oldsp);
	oursp = oldsp;
    }

    /* Leave the lexical level */
    LeaveBlockLevel ();

    /* Eat closing brace */
    ConsumeRCurly ();

    return isbrk;
}



int Statement (void)
/* Statement parser. Returns 1 if the statement does a return/break, returns
 * 0 otherwise
 */
{
    struct expent lval;

    /* */
    if (CurTok.Tok == TOK_IDENT && NextTok.Tok == TOK_COLON) {

	/* Special handling for a label */
	DoLabel ();

    } else {

     	switch (CurTok.Tok) {

     	    case TOK_LCURLY:
     	    	return CompoundStatement ();

     	    case TOK_IF:
     	    	return DoIf ();

     	    case TOK_WHILE:
     	    	DoWhile ();
	    	break;

	    case TOK_DO:
	    	DoDo ();
	    	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:
	        /* Actual statement */
		expression (&lval);
		ConsumeSemi ();
	}
    }
    return 0;
}