uwucc/analysis/src/lower.rs

mod builder;

use std::cell::{Cell, RefCell};

use parser::{
    ast::{self, IntTy, IntTyKind, IntTySignedness},
    Span, Symbol,
};
use rustc_hash::{FxHashMap, FxHashSet};

use self::builder::FuncBuilder;
use crate::{
    ir::{
        self, BbIdx, BinKind, Branch, ConstValue, DefId, Func, Ir, Layout, Operand, Register,
        TyLayout, UnaryKind,
    },
    ty::{Ty, TyKind},
    Error,
};

type Result<T, E = Error> = std::result::Result<T, E>;

#[derive(Debug)]
struct LoweringCx<'cx> {
    tys: RefCell<FxHashSet<&'cx TyKind<'cx>>>,
    layouts: RefCell<FxHashSet<&'cx Layout>>,
    arena: &'cx bumpalo::Bump,
    next_def_id: Cell<DefId>,
}

impl<'cx> LoweringCx<'cx> {
    fn next_def_id(&self) -> DefId {
        let def_id = self.next_def_id.get();
        self.next_def_id.set(DefId(def_id.0 + 1));
        def_id
    }
    fn lower_ty(&self, ty: &ast::TypeSpecifier) -> Ty<'cx> {
        let kind = match ty {
            ast::TypeSpecifier::Void => TyKind::Void,
            ast::TypeSpecifier::Char => TyKind::Char,
            ast::TypeSpecifier::SChar => TyKind::SChar,
            ast::TypeSpecifier::UChar => TyKind::UChar,
            ast::TypeSpecifier::Integer(int) => TyKind::Integer(*int),
            ast::TypeSpecifier::Float => TyKind::Float,
            ast::TypeSpecifier::Double => TyKind::Double,
            ast::TypeSpecifier::LongDouble => TyKind::LongDouble,
            ast::TypeSpecifier::Bool => TyKind::Bool,
        };
        self.intern_ty(kind)
    }

    fn intern_ty(&self, kind: TyKind<'cx>) -> Ty<'cx> {
        let opt_kind = self.tys.borrow().get(&kind).copied();
        match opt_kind {
            Some(ty) => Ty::new_unchecked(ty),
            None => {
                let kind = self.arena.alloc(kind);
                self.tys.borrow_mut().insert(kind);
                Ty::new_unchecked(kind)
            }
        }
    }

    fn intern_layout(&self, layout: Layout) -> &'cx Layout {
        let opt_layout = self.layouts.borrow().get(&layout).copied();
        match opt_layout {
            Some(layout) => layout,
            None => {
                let layout = self.arena.alloc(layout);
                self.layouts.borrow_mut().insert(layout);
                layout
            }
        }
    }

    fn layout_of(&self, ty: Ty<'cx>) -> TyLayout<'cx> {
        let layout = match *ty {
            TyKind::Void => Layout::size_align(0, 1),
            TyKind::Char => Layout::size_align(1, 1),
            TyKind::SChar => Layout::size_align(1, 1),
            TyKind::UChar => Layout::size_align(1, 1),
            TyKind::Integer(int) => match int.kind {
                parser::ast::IntTyKind::Short => Layout::size_align(2, 2),
                parser::ast::IntTyKind::Int => Layout::size_align(4, 4),
                parser::ast::IntTyKind::Long => Layout::size_align(8, 8),
                parser::ast::IntTyKind::LongLong => Layout::size_align(8, 8),
            },
            TyKind::Float => Layout::size_align(4, 4),
            TyKind::Double => Layout::size_align(8, 8),
            TyKind::LongDouble => Layout::size_align(8, 8),
            TyKind::Bool => Layout::size_align(1, 1),
            TyKind::Struct(_) => todo!("layout_of struct"),
            TyKind::Union(_) => todo!("layout_of union"),
            TyKind::Enum(_) => todo!("layout_of enum"),
            TyKind::Ptr(_) => Layout::size_align(8, 8),
        };
        let layout = self.intern_layout(layout);
        TyLayout { ty, layout }
    }
}

pub fn lower_translation_unit<'cx>(
    arena: &'cx bumpalo::Bump,
    ast: &ast::TranslationUnit,
) -> Result<Ir<'cx>, Error> {
    let lcx = LoweringCx {
        tys: RefCell::default(),
        layouts: RefCell::default(),
        arena,
        next_def_id: Cell::new(DefId(0)),
    };

    let mut ir = Ir {
        funcs: FxHashMap::default(),
    };

    for (decl, _) in ast {
        match decl {
            ast::ExternalDecl::Decl(_) => todo!("decl is unsupported"),
            ast::ExternalDecl::FunctionDef(def) => {
                let decl = def.decl.unwrap_normal();
                let body = &def.body;
                let ret_ty = lcx.lower_ty(&decl.decl_spec.ty);

                let (ref declarator, def_span) = decl.init_declarators[0];

                let ast::DirectDeclarator::WithParams { ident, params } = &declarator.declarator.decl else {
                    unreachable!("function def needs withparams declarator");
                };

                let func = lower_func(&lcx, body, def_span, ident.0, ret_ty, params)?;
                ir.funcs.insert(lcx.next_def_id(), func);
            }
        }
    }

    ir::validate(&ir);

    Ok(ir)
}

#[derive(Debug)]
struct FnLoweringCtxt<'a, 'cx> {
    scopes: Vec<FxHashMap<Symbol, VariableInfo<'cx>>>,
    build: FuncBuilder<'a, 'cx>,
    lcx: &'a LoweringCx<'cx>,
}

impl<'a, 'cx> FnLoweringCtxt<'a, 'cx> {
    fn dummy_tyl(&self) -> TyLayout<'cx> {
        self.ty_layout(TyKind::Void)
    }

    fn ty_layout(&self, ty_kind: TyKind<'cx>) -> TyLayout<'cx> {
        self.lcx.layout_of(self.lcx.intern_ty(ty_kind))
    }

    fn resolve_ident(&self, ident: Symbol) -> Option<&VariableInfo<'cx>> {
        self.scopes.iter().rev().find_map(|s| s.get(&ident))
    }

    fn lower_block(&mut self, body: &[(ast::Stmt, Span)]) -> Result<()> {
        self.scopes.push(Default::default());
        for (stmt, stmt_span) in body {
            self.lower_stmt(stmt, *stmt_span)?;
        }
        self.scopes.pop();
        Ok(())
    }

    fn declare_local(&mut self, decl: &ast::Decl, span: Span) -> Result<()> {
        let decl = decl.unwrap_normal();
        let ty = self.lcx.lower_ty(&decl.decl_spec.ty);
        let decl_attr = decl.decl_spec.attrs;

        for (var, def_span) in &decl.init_declarators {
            let tyl = self.lcx.layout_of(ty);
            let (name, name_span) = var.declarator.decl.name();
            let ptr_to = self.build.alloca(tyl.layout, Some(name), span);

            let variable_info = VariableInfo {
                def_span: *def_span,
                ptr_to,
                decl_attr,
                tyl: tyl.clone(),
            };
            let predeclared = self.scopes.last_mut().unwrap().insert(name, variable_info);
            if let Some(predeclared) = predeclared {
                return Err(Error::new(
                    format!("variable {name} has already been declared"),
                    name_span,
                )
                .note_spanned("already declared here", predeclared.def_span));
            }
            if let Some((init, init_span)) = &var.init {
                let init = self.lower_expr(init, *init_span)?;
                self.build.store(ptr_to, init.0, tyl.layout, *init_span);
            }
        }
        Ok(())
    }

    fn expr_as_lvalue(&mut self, expr: &ast::Expr) -> Result<Register> {
        let ast::Expr::Atom(ast::Atom::Ident((ident, ident_span))) = *expr else {
            todo!("complex lvalues")
        };
        let Some(var) = self.resolve_ident(ident) else {
            return Err(Error::new(format!("cannot find variable {ident}"), ident_span));
        };
        Ok(var.ptr_to)
    }

    fn lower_stmt(&mut self, stmt: &ast::Stmt, stmt_span: Span) -> Result<()> {
        match stmt {
            ast::Stmt::Decl(decl) => {
                self.declare_local(decl, stmt_span)?;
            }
            ast::Stmt::Labeled { .. } => todo!("labels are not implemented"),
            ast::Stmt::Compound(block) => {
                self.lower_block(block)?;
            }
            ast::Stmt::If {
                cond,
                then: then_body,
                otherwise,
            } => {
                let cond = self.lower_expr(&cond.0, cond.1)?;
                let pred = self.build.current_bb;
                let then = self.build.new_block();
                let els = otherwise
                    .as_deref()
                    .map(|oth| (oth, self.build.new_block()));
                let cont = self.build.new_block();

                self.build.current_bb = then;
                self.lower_block(then_body)?;
                self.build.cur_bb_mut().term = Branch::Goto(cont);

                let false_branch = match els {
                    Some((otherwise, els)) => {
                        self.build.current_bb = els;
                        self.lower_block(otherwise)?;
                        self.build.cur_bb_mut().term = Branch::Goto(cont);
                        els
                    }
                    None => cont,
                };
                self.build.bb_mut(pred).term = Branch::Switch {
                    cond: cond.0,
                    yes: then,
                    no: false_branch,
                };
                self.build.current_bb = cont;
            }
            ast::Stmt::Switch => todo!(),
            ast::Stmt::While { .. } => todo!(),
            ast::Stmt::For { .. } => todo!(),
            ast::Stmt::Goto(_) => todo!(),
            ast::Stmt::Continue => todo!(),
            ast::Stmt::Break => todo!(),
            ast::Stmt::Return(expr) => {
                let ret = match expr {
                    Some(expr) => self.lower_expr(&expr.0, expr.1)?.0,
                    None => Operand::Const(ConstValue::Void),
                };
                self.build.cur_bb_mut().term = Branch::Ret(ret);
            }
            ast::Stmt::Expr(ast::Expr::Binary(ast::ExprBinary {
                op: ast::BinaryOp::Assign(assign),
                lhs,
                rhs,
            })) => {
                if assign.is_some() {
                    todo!("assign operation");
                }
                let rhs = self.lower_expr(&rhs.0, rhs.1)?;
                let (ast::Expr::Atom(ast::Atom::Ident((ident, ident_span))), _) = **lhs else {
                    todo!("complex assignments")
                };
                let Some(var) = self.resolve_ident(ident) else {
                    return Err(Error::new(format!("cannot find variable {ident}"), ident_span));
                };
                self.build
                    .store(var.ptr_to, rhs.0, var.tyl.layout, stmt_span);
            }
            ast::Stmt::Expr(expr) => {
                self.lower_expr(expr, stmt_span)?;
            }
        }

        Ok(())
    }

    fn lower_expr(&mut self, expr: &ast::Expr, span: Span) -> Result<(Operand, TyLayout<'cx>)> {
        match expr {
            ast::Expr::Atom(ast::Atom::Char(c)) => Ok((
                Operand::Const(ConstValue::Int((*c).into())),
                self.ty_layout(TyKind::Char),
            )),
            ast::Expr::Atom(ast::Atom::Int(i)) => Ok((
                Operand::Const(ConstValue::Int(*i as _)),
                self.ty_layout(TyKind::Integer(IntTy {
                    sign: IntTySignedness::Signed,
                    kind: IntTyKind::Int,
                })),
            )),
            ast::Expr::Atom(ast::Atom::Float(_)) => todo!("no floats"),
            ast::Expr::Atom(ast::Atom::Ident((ident, ident_span))) => {
                let Some(var) = self.resolve_ident(*ident) else {
                    return Err(Error::new(format!("cannot find variable {ident}"), *ident_span));
                };
                let tyl = var.tyl;
                let op = self.build.load(var.tyl, var.ptr_to, span);
                Ok((Operand::Reg(op), tyl))
            }
            ast::Expr::Atom(ast::Atom::String(_)) => todo!("no string literals"),
            ast::Expr::Unary(ast::ExprUnary {
                op: op @ (ast::UnaryOp::Increment | ast::UnaryOp::Decrement),
                rhs: rhs_expr,
            }) => {
                // First increment/decrement, then return the value.
                let (rhs, rhs_tyl) = self.lower_expr(&rhs_expr.0, rhs_expr.1)?;
                let is_incr = matches!(op, ast::UnaryOp::Increment);

                if !rhs_tyl.ty.is_integral() {
                    return Err(Error::new(
                        format!(
                            "cannot {} {}",
                            if is_incr { "increment" } else { "decrement" },
                            rhs_tyl.ty
                        ),
                        rhs_expr.1,
                    ));
                }

                let lvalue = self.expr_as_lvalue(&rhs_expr.0)?;
                let bin_kind = if is_incr { BinKind::Add } else { BinKind::Sub };
                let lhs = self.build.load(self.dummy_tyl(), lvalue, span);
                let result =
                    self.build
                        .binary(bin_kind, Operand::Reg(lhs), rhs, span, self.dummy_tyl());
                self.build.store(lhs, rhs, self.dummy_tyl().layout, span);

                Ok((Operand::Reg(result), self.dummy_tyl()))
            }
            ast::Expr::Unary(unary) => {
                let rhs = self.lower_expr(&unary.rhs.0, unary.rhs.1)?;
                let kind = match unary.op {
                    ast::UnaryOp::Increment => unreachable!("handled prefix increment above"),
                    ast::UnaryOp::Decrement => unreachable!("handled prefix increment above"),
                    ast::UnaryOp::AddrOf => todo!("addr of"),
                    ast::UnaryOp::Deref => todo!("deref?"),
                    ast::UnaryOp::Plus => todo!("unary plus lol"),
                    ast::UnaryOp::Minus => UnaryKind::Negate,
                    ast::UnaryOp::Tilde => UnaryKind::BitNot,
                    ast::UnaryOp::Bang => UnaryKind::LogicalNot,
                };

                let reg = self.build.unary(kind, rhs.0, span, self.dummy_tyl());
                Ok((Operand::Reg(reg), self.dummy_tyl()))
            }
            ast::Expr::Binary(ast::ExprBinary {
                lhs,
                rhs,
                op: ast::BinaryOp::Assign(assign),
            }) => {
                if assign.is_some() {
                    todo!("assign operation");
                }
                let rhs = self.lower_expr(&rhs.0, rhs.1)?;

                let ptr_to = self.expr_as_lvalue(&lhs.0)?;
                self.build
                    .store(ptr_to, rhs.0, self.dummy_tyl().layout, span);
                Ok(rhs)
            }
            ast::Expr::Binary(binary) => {
                let lhs = self.lower_expr(&binary.lhs.0, binary.lhs.1)?;
                let rhs = self.lower_expr(&binary.rhs.0, binary.rhs.1)?;
                let kind = match binary.op {
                    ast::BinaryOp::Arith(ast::ArithOpKind::Mul) => BinKind::Mul,
                    ast::BinaryOp::Arith(ast::ArithOpKind::Div) => BinKind::Div,
                    ast::BinaryOp::Arith(ast::ArithOpKind::Mod) => BinKind::Mod,
                    ast::BinaryOp::Arith(ast::ArithOpKind::Add) => BinKind::Add,
                    ast::BinaryOp::Arith(ast::ArithOpKind::Sub) => BinKind::Sub,
                    ast::BinaryOp::Arith(ast::ArithOpKind::Shl) => BinKind::Shl,
                    ast::BinaryOp::Arith(ast::ArithOpKind::Shr) => BinKind::Shr,
                    ast::BinaryOp::Arith(ast::ArithOpKind::BitAnd) => BinKind::BitAnd,
                    ast::BinaryOp::Arith(ast::ArithOpKind::BitXor) => BinKind::BitXor,
                    ast::BinaryOp::Arith(ast::ArithOpKind::BitOr) => BinKind::BitOr,
                    ast::BinaryOp::LogicalAnd => todo!("no logical or"),
                    ast::BinaryOp::LogicalOr => todo!("no logical and"),
                    ast::BinaryOp::Comparison(ast::ComparisonKind::Lt) => BinKind::Lt,
                    ast::BinaryOp::Comparison(ast::ComparisonKind::Gt) => BinKind::Gt,
                    ast::BinaryOp::Comparison(ast::ComparisonKind::LtEq) => BinKind::Leq,
                    ast::BinaryOp::Comparison(ast::ComparisonKind::GtEq) => BinKind::Geq,
                    ast::BinaryOp::Comparison(ast::ComparisonKind::Eq) => BinKind::Eq,
                    ast::BinaryOp::Comparison(ast::ComparisonKind::Neq) => BinKind::Neq,
                    ast::BinaryOp::Comma => {
                        // Discard the lhs, evaluate to the rhs.
                        return Ok(rhs);
                    }
                    ast::BinaryOp::Index => todo!("no index"),
                    ast::BinaryOp::Assign(_) => unreachable!("assign handled above"),
                };

                let reg = self
                    .build
                    .binary(kind, lhs.0, rhs.0, span, self.dummy_tyl());

                Ok((Operand::Reg(reg), self.dummy_tyl()))
            }
            ast::Expr::Postfix(postfix) => {
                let lhs = self.lower_expr(&postfix.lhs.0, postfix.lhs.1)?;
                match &postfix.op {
                    ast::PostfixOp::Call(args) => {
                        let args = args
                            .iter()
                            .map(|(arg, sp)| self.lower_expr(arg, *sp).map(|o| o.0))
                            .collect::<Result<_, _>>()?;

                        let reg = self.build.call(self.dummy_tyl(), lhs.0, args, span);
                        Ok((Operand::Reg(reg), self.dummy_tyl()))
                    }
                    ast::PostfixOp::Member(_) => todo!("member expr"),
                    ast::PostfixOp::ArrowMember(_) => todo!("arrow member expr"),
                    ast::PostfixOp::Increment => {
                        todo!("gotta have lvalues")
                    }
                    ast::PostfixOp::Decrement => todo!(),
                }
            }
        }
    }
}

#[derive(Debug)]
struct VariableInfo<'cx> {
    def_span: Span,
    tyl: TyLayout<'cx>,
    ptr_to: Register,
    decl_attr: ast::DeclAttr,
}

fn lower_func<'cx>(
    // may be used later
    lcx: &LoweringCx<'cx>,
    body: &[(ast::Stmt, Span)],
    def_span: Span,
    name: Symbol,
    ret_ty: Ty<'cx>,
    params: &[ast::FunctionParamDecl],
) -> Result<Func<'cx>, Error> {
    let mut cx = FnLoweringCtxt {
        scopes: vec![Default::default()],
        build: FuncBuilder::new(
            name,
            def_span,
            ret_ty,
            lcx,
            params.len().try_into().unwrap(),
        ),
        lcx,
    };

    for param in params {
        let decl_spec = &param.decl_spec.0;
        let ty = lcx.lower_ty(&decl_spec.ty);
        let tyl = lcx.layout_of(ty);
        // Create all the parameter registers.
        let _ = cx
            .build
            .new_reg(Some(param.declarator.0.decl.name().0), tyl);
    }

    for (i, param) in params.iter().enumerate() {
        // For every param, we create an allocation and store the register into it.
        let param_reg_data = &cx.build.ir.regs[i];
        let name = param.declarator.0.decl.name().0;

        let decl_spec = &param.decl_spec.0;
        let decl_attr = decl_spec.attrs;
        let tyl = param_reg_data.tyl;
        let span = param.declarator.1;

        let alloca_name = Symbol::intern(&format!("{}.local", name));
        let ptr_to = cx.build.alloca(tyl.layout, Some(alloca_name), span);

        let variable_info = VariableInfo {
            def_span: span,
            ptr_to,
            decl_attr,
            tyl,
        };
        let predeclared = cx.scopes.last_mut().unwrap().insert(name, variable_info);
        if let Some(predeclared) = predeclared {
            return Err(
                Error::new(format!("parameter {name} has already been declared"), span)
                    .note_spanned("already declared here", predeclared.def_span),
            );
        }

        cx.build
            .store(ptr_to, Operand::Reg(Register(i as _)), tyl.layout, span);
    }

    cx.lower_block(body)?;

    if let Branch::Goto(BbIdx(u32::MAX)) = cx.build.cur_bb_mut().term {
        cx.build.cur_bb_mut().term = Branch::Ret(Operand::Const(ConstValue::Void));
    }

    Ok(cx.build.finish())
}