package ast.nodes;

import ast.types.*;

import java.util.ArrayList;

import semanticanalysis.SemanticError;
import semanticanalysis.SymbolTable;

/**
 * Node for the `return_stmt` statement of the grammar.
 */
public class ReturnStmtNode implements Node {

    private final Node exprList;

    // VERY scatchy
    private int localvar;
    private int paramNumber;

    public ReturnStmtNode(Node exprList) {
        this.exprList = exprList;
    }

    @Override
    public ArrayList<SemanticError> checkSemantics(SymbolTable ST, int _nesting, FunctionType ft) {
        ArrayList<SemanticError> errors = new ArrayList<>();

        // If I am in a "return", `ft` will be null.
        this.localvar = ft.getLocalvarNum();
        this.paramNumber = ft.getParamNumber();
        if (this.exprList != null) {
            errors.addAll(this.exprList.checkSemantics(ST, _nesting, ft));
        }

        return errors;
    }

    @Override
    public Type typeCheck() {
        if (this.exprList != null) {
            return this.exprList.typeCheck();
        }

        return new VoidType();
    }

    @Override
    public String codeGeneration() {
        String expS = exprList.codeGeneration();
        for (int i = 0; i < localvar; i++) {
            expS += "pop\n";
        }
        return expS +
                "popr RA\n" +
                "addi SP " + paramNumber + "\n" +
                "pop\n" +
                "store FP 0(FP)\n" +
                "move FP AL\n" +
                "subi AL 1\n" +
                "pop\n" +
                "rsub RA\n";
    }

    @Override
    public String toPrint(String prefix) {
        String str = prefix + "ReturnStmt\n";

        prefix += "  ";
        if (this.exprList != null) {
            str += this.exprList.toPrint(prefix);
        }

        return str;
    }

}