rucc-asm 0.12.3

//! Machine functions as assembly text, in AT&T syntax.
//!
//! Design: `spec/11-asm-objects-debug.md` section 11.1, which asks that the text path and the
//! binary path share one instruction description so they cannot disagree about what an
//! instruction is. This is the text path, and the description is `rucc_target::x86_64`.
//!
//! An AArch64 file is written by the same walk, since sections, labels, unwind rows and variables
//! are spelled the same way for both machines. Only the instruction is handed to [`crate::a64`].
//!
//! So there is almost nothing about x86-64 in this file. What an opcode is called, how many
//! instructions it really is, which operand each of them is given and how wide each of those is
//! written are all read out of the target. What is here is the syntax: a register carries a `%`,
//! an immediate carries a `$`, an address is a displacement in front of a parenthesised base and
//! index, and the source is written before the destination.
//!
//! Intel syntax, which section 11.1 requires as an input and which `-masm=intel` will ask for as
//! an output, is the other order, no sigils and a different spelling of an address. It is a
//! second walk over the same description rather than a second description, and it is not written
//! yet.
//!
//! # What a block is
//!
//! A label, and then the instructions in it. Where a block goes is on the block rather than on
//! its terminator, so a jump has already been made into an instruction by the block layout by
//! the time anything gets here: what is left is to give each block a name, and the name is local
//! so that it leaves no symbol behind for a debugger to show as if it were a function.
//!
//! # What the unwinder is told
//!
//! Every ELF function is wrapped in `.cfi_startproc` and `.cfi_endproc`, including the ones with
//! no rows in them. An unwinder that lands on an address with no record covering it has to give
//! up, so a leaf that never moves the stack pointer still needs a record: the one the CIE hands
//! it, which says the frame ends at `rsp+8` and the return address is the word below that, is
//! already the right answer for such a function and the empty record is how it asks for it.
//!
//! A row written after the last instruction of the last block is dropped. It would describe an
//! address at or past the end of the function, which is outside what the record covers, and the
//! usual thing to find there is an epilogue putting back a state nothing is going to read.
//!
//! # What is not written
//!
//! An opcode that is not an instruction is written as nothing. Three of them exist to hold a
//! value in a register until something reads it, which is a fact the allocator needed and the
//! machine does not, and by here it has been acted on: the register in the operand is the answer.

use std::collections::HashMap;
use std::fmt::Write as _;

use rucc_base::Interner;
use rucc_mir::{Amode, Block, CfiOp, Func, Inst, Opcode, Operand, Reach, defs};
use rucc_object::{Alias, FUNC_ALIGN, Output, Sections};
use rucc_target::x86_64::{self, Arg, Width};
use rucc_target::{PhysReg, RegClass, Segment, TargetInfo, aarch64};
use rucc_tuple::Arch;

use crate::Error;
use crate::a64;
use crate::data::{Globals, Piece, Variable};
use crate::format::{Directives, binding, visibility};

/// The prefix every x86-64 opcode carries in the machine IR.
///
/// An opcode is a name and a machine IR that holds two machines' instructions would otherwise
/// have two `add_rr_32` in it. The description in `rucc-target` is indexed without it, because
/// there it is already known which machine is being described.
const PREFIX: &str = "x64.";

/// Every function and every variable, as assembly text.
///
/// The functions first and the variables after them, which is the order every toolchain writes a
/// file in and the order a person reading one expects. The second names come last, because a
/// `.set` says nothing until the thing it names has been written down.
///
/// `unwind` is whether a function is described to an unwinder, which is
/// `rucc_session::Options::unwinds` and is asked of the build rather than worked out here, so that
/// this and the byte writer cannot answer it differently for one function.
///
/// `output` is whether each function and each variable is given a section of its own and what the
/// file says it was built to have checked, which are the other things about this listing the caller
/// decides: everything else is worked out from the functions and the target.
///
/// # Errors
///
/// [`Error::Machine`] for an architecture nothing here writes, and the two internal errors for a
/// function that should not have got this far. See [`Error`].
pub fn print(
    funcs: &[Func],
    globals: &Globals,
    aliases: &[Alias],
    names: &Interner,
    target: &TargetInfo,
    unwind: bool,
    output: Output,
) -> Result<String, Error> {
    listing(funcs, globals, aliases, names, target, unwind, output, false)
}

/// The same listing as [`print()`], with a label in front of every instruction named by [`mark`].
///
/// For an object built from a listing that asked for debug information. The listing has no line
/// table of its own, so the reader is left to place a label in front of each instruction the way
/// it places any other, and where those land is where the line table's rows go. The labels are
/// local ones, so the reader keeps them out of the symbol table like every other.
///
/// # Errors
///
/// As for [`print()`].
pub fn print_marked(
    funcs: &[Func],
    globals: &Globals,
    aliases: &[Alias],
    names: &Interner,
    target: &TargetInfo,
    unwind: bool,
    output: Output,
) -> Result<String, Error> {
    listing(funcs, globals, aliases, names, target, unwind, output, true)
}

/// The label [`print_marked`] writes in front of an instruction, given which function of the list
/// it is in and the instruction.
#[must_use]
pub fn mark(target: &TargetInfo, func: usize, inst: Inst) -> String {
    spell_mark(Directives::of(target.object_format), func, inst)
}

/// The label [`print_marked`] puts after the last instruction of the function with this place in
/// the list.
///
/// ELF says how long a function is with `.size` and the reader keeps it, but Mach-O has no such
/// directive, and how far this label is from the function's own symbol is the same length there.
#[must_use]
pub fn mark_end(target: &TargetInfo, func: usize) -> String {
    format!("{}rucc_end{func}", Directives::of(target.object_format).local())
}

fn spell_mark(directives: Directives, func: usize, inst: Inst) -> String {
    format!("{}rucc_row{func}_{}", directives.local(), inst.index())
}

#[allow(clippy::too_many_arguments)]
fn listing(
    funcs: &[Func],
    globals: &Globals,
    aliases: &[Alias],
    names: &Interner,
    target: &TargetInfo,
    unwind: bool,
    output: Output,
    marks: bool,
) -> Result<String, Error> {
    let Output { sections, property } = output;
    let arch = target.tuple.arch();
    if !matches!(arch, Arch::X86_64 | Arch::Aarch64) {
        return Err(Error::Machine { triple: target.tuple.to_string() });
    }
    let directives = Directives::of(target.object_format);
    let mut writer = Writer {
        arch,
        names,
        directives,
        // Apple's assembler reads the same directives gas does and so does the reader here, which
        // makes the DWARF table ld64 turns into its own. COFF's are other directives, so a request
        // for a table there is a request for nothing.
        unwind: unwind && directives != Directives::Coff,
        out: String::new(),
        labels: Vec::new(),
        sections,
        marks: marks.then_some(0),
    };
    writer.out.push_str(writer.directives.text());
    writer.out.push('\n');
    // The `asm` at file scope that is instructions, first and between the markers gcc writes
    // around it, which the reader takes as comments. What section it leaves the assembler in is
    // its own business, so the functions after it are put back in the text section, which is
    // where they would have been without it.
    if !globals.file_asm.is_empty() {
        for text in &globals.file_asm {
            let _ = writeln!(writer.out, "#APP\n{text}\n#NO_APP");
        }
        writer.out.push_str(writer.directives.text());
        writer.out.push('\n');
    }
    for func in funcs {
        writer.func(func)?;
    }
    for var in &globals.vars {
        writer.variable(var);
    }
    for alias in aliases {
        writer.directives.alias(&mut writer.out, alias);
    }
    // Last, which is where gcc puts them. Each is a name and no bytes, so there is nothing to open
    // a section for and nothing to close.
    for name in &globals.weak {
        writer.directives.absent(&mut writer.out, name);
    }
    writer.directives.end(&mut writer.out, property);
    Ok(writer.out)
}

/// One template kept as text, filled in the way [`print()`] writes it into a listing.
///
/// For the byte writer, which reads a template on its own when the text allows it rather than
/// sending the whole unit to the assembler. See `crate::bytes::template`. What goes into the holes
/// is the same text either way, so a template cannot come out as one instruction in the listing and
/// another in the object.
pub(crate) fn template(
    func: &Func,
    block: Block,
    inst: Inst,
    names: &Interner,
    directives: Directives,
) -> Result<String, Error> {
    let mut writer = Writer {
        arch: Arch::X86_64,
        names,
        directives,
        unwind: false,
        out: String::new(),
        labels: Vec::new(),
        sections: Sections::default(),
        marks: None,
    };
    writer.inst(func, block, inst, names.resolve(func.name))?;
    Ok(writer.out)
}

/// A file being written out.
struct Writer<'a> {
    /// The machine the instructions are for, which is the one thing about a file that decides how
    /// an instruction is spelled. See [`crate::a64`].
    arch: Arch,
    names: &'a Interner,
    directives: Directives,
    /// Whether each function is wrapped in an unwind record.
    unwind: bool,
    out: String,
    /// The number each block is written as, indexed by its own, which is its place in the layout
    /// rather than the order somebody happened to create the blocks in.
    labels: Vec<u32>,
    /// Whether each function and each variable is given a section of its own.
    sections: Sections,
    /// Which function of the list is being written, in a listing that puts a label in front of
    /// every instruction, and `None` in one that does not. See [`print_marked`].
    marks: Option<usize>,
}

impl Writer<'_> {
    /// One function: what the assembler is told about it, then its blocks.
    fn func(&mut self, func: &Func) -> Result<(), Error> {
        let name = self.names.resolve(func.name).to_owned();
        self.number(func);
        let binding = binding(func.binding);
        let seen = visibility(func.visibility);
        let align = func.align.unwrap_or(FUNC_ALIGN);
        self.directives.code(&mut self.out, &name, self.sections);
        // What has to be written between what the assembler is told about the function and the
        // function's own label, which is nothing at all unless a patcher was promised room in
        // front of the label. See `patch`.
        let patch =
            func.patch.map(|patch| (patch, format!("{}pfe_{name}", self.directives.local())));
        let mut ahead = String::new();
        if let Some((patch, label)) = &patch {
            let back = if self.sections.functions {
                format!("\t.section\t.text.{name}")
            } else {
                self.directives.text().to_owned()
            };
            self.directives.patchable(&mut ahead, label, &back);
            if patch.before > 0 {
                let _ = writeln!(ahead, "{label}:");
                self.pad(&mut ahead, patch.pad, patch.before);
            }
        }
        let fill = self.fill();
        self.directives.open(&mut self.out, &name, align, fill, binding, seen, &ahead);
        let unwind = self.unwind;
        if unwind {
            let _ = writeln!(self.out, "\t.cfi_startproc");
        }
        // The personality routine and the call site table, for a function with a landing pad, in
        // gcc's spelling, which is what the unwind writer puts in the object as well. See
        // `crate::unwind`. The calls with a pad are named on either side below, since the table
        // says where they are by label.
        //
        // Only on ELF, since both are spelled in ELF's terms: the routine through a slot gcc's
        // runtime fills in and the table in ELF's section for it. A Mach-O function is unwound
        // through without either. See `crate::unwind::table`.
        let pads: HashMap<Inst, Block> = if self.directives == Directives::Elf {
            func.landings.iter().copied().collect()
        } else {
            HashMap::new()
        };
        let local = self.directives.local();
        if unwind && !pads.is_empty() {
            let _ = writeln!(self.out, "\t.cfi_personality 0x9b,{}", rucc_ir::PERSONALITY_REF);
            let _ = writeln!(self.out, "\t.cfi_lsda 0x1b,{local}LSDA_{name}");
        }
        let mut sites = Vec::new();
        let end = func.cfi_end();
        // How long each loop is, which the listing cannot say without the lengths of the
        // instructions in it. The object writer's encoder is asked, and a function it cannot
        // encode, which is one for another machine, has its loops left where they fall.
        let loops = crate::bytes::loop_sizes(self.names, self.directives, func).unwrap_or_default();
        for (index, block) in func.blocks().enumerate() {
            let size = loops.get(block.index()).copied().unwrap_or(0);
            if let Some(most) = crate::loop_room(size) {
                let _ = writeln!(self.out, "\t.p2align\t6,,{most}");
            }
            let _ = writeln!(self.out, "{}{name}_{index}:", self.directives.local());
            // And the name an image knows the block by, as a second label on the same address. The
            // block's own label is written by this file and is a number, which is no good to a
            // relocation in another section: what that names is a symbol, and the name here is the
            // one the front end minted for it when it lowered the image.
            if let Some(label) = func.block_name(block) {
                let _ = writeln!(self.out, "{}:", self.names.resolve(label));
            }
            for inst in func.insts(block) {
                // The other half of the room, which is named here rather than laid down here: the
                // instructions it is made of are in the entry block like any others, and all that
                // is missing is somewhere for the record to point. Named at the instruction rather
                // than at the top of the block because a landing pad goes in front of it, and the
                // room a patcher writes over does not include the pad.
                if let Some((patch, label)) = &patch {
                    if patch.before == 0 && patch.after == Some(inst) {
                        let _ = writeln!(self.out, "{label}:");
                    }
                }
                if let Some(which) = self.marks {
                    let _ = writeln!(self.out, "{}:", spell_mark(self.directives, which, inst));
                }
                let site = pads.get(&inst).map(|&pad| (sites.len(), pad));
                if let Some((at, _)) = site {
                    let _ = writeln!(self.out, "{local}EHB{at}_{name}:");
                }
                self.inst(func, block, inst, &name)?;
                if let Some((at, pad)) = site {
                    let _ = writeln!(self.out, "{local}EHE{at}_{name}:");
                    sites.push(pad);
                }
                if unwind && Some(inst) != end {
                    for op in func.cfi_after(inst) {
                        self.cfi(op);
                    }
                }
            }
        }
        if let Some(which) = self.marks {
            let _ = writeln!(self.out, "{}rucc_end{which}:", self.directives.local());
        }
        self.tables(func, &name);
        if unwind {
            let _ = writeln!(self.out, "\t.cfi_endproc");
            if !sites.is_empty() {
                self.call_sites(&name, &sites);
            }
        }
        self.directives.close(&mut self.out, &name);
        if let Some(which) = &mut self.marks {
            *which += 1;
        }
        Ok(())
    }

    /// The instructions that do nothing which go in front of a function's own label.
    ///
    /// Written from the opcode rather than through the machinery every other instruction goes
    /// through, because these are the only instructions in a finished function that are not in a
    /// block and so are not instructions the function holds. The opcode is one with no operands,
    /// which is what makes writing the mnemonic and nothing else the whole of it.
    fn pad(&self, out: &mut String, pad: Opcode, count: u32) {
        let spelled = self.names.resolve(pad.name());
        let opcode = spelled.strip_prefix(self.prefix()).unwrap_or(spelled);
        for _ in 0..count {
            let _ = writeln!(out, "\t{opcode}");
        }
    }

    /// One row of the unwind table, as the directive an assembler reads it as.
    ///
    /// The registers are written as numbers rather than as names, which is what gcc writes and
    /// what avoids a second spelling of a register that could disagree with the first. They are
    /// DWARF's numbers, which are not the machine's, and the one place the mapping lives is the
    /// calling convention the prologue read it out of.
    fn cfi(&mut self, op: CfiOp) {
        let _ = match op {
            CfiOp::DefCfa { reg, offset } => {
                writeln!(self.out, "\t.cfi_def_cfa {reg}, {offset}")
            }
            CfiOp::DefCfaOffset(offset) => writeln!(self.out, "\t.cfi_def_cfa_offset {offset}"),
            CfiOp::DefCfaRegister(reg) => writeln!(self.out, "\t.cfi_def_cfa_register {reg}"),
            CfiOp::Offset { reg, offset } => writeln!(self.out, "\t.cfi_offset {reg}, {offset}"),
            CfiOp::Restore(reg) => writeln!(self.out, "\t.cfi_restore {reg}"),
            CfiOp::RememberState => writeln!(self.out, "\t.cfi_remember_state"),
            CfiOp::RestoreState => writeln!(self.out, "\t.cfi_restore_state"),
        };
    }

    /// One variable: what the assembler is told about it, then its image.
    fn variable(&mut self, var: &Variable) {
        if !self.directives.variable(&mut self.out, var, self.sections) {
            return;
        }
        for piece in &var.pieces {
            self.piece(piece);
        }
        self.directives.close(&mut self.out, &var.name);
        self.directives.descriptor(&mut self.out, var);
    }

    /// One piece of an image, as the directive that says it.
    ///
    /// A number is written at the width it is rather than as the bytes it is made of, because the
    /// point of a listing is to be read and `.long 258` is what a person wrote. The bytes are the
    /// same either way, which is what [`crate::data`] is for.
    fn piece(&mut self, piece: &Piece) {
        match piece {
            // `.space` rather than `.zero`, which every assembler also takes, because the
            // directive set `spec/11-asm-objects-debug.md` says this compiler's own assembler
            // reads has the one and not the other in it.
            Piece::Zero(bytes) => {
                let _ = writeln!(self.out, "\t.space\t{bytes}");
            }
            Piece::Bytes(bytes) => {
                let _ = writeln!(self.out, "\t.ascii\t\"{}\"", escape(bytes));
            }
            Piece::Scalar(bytes) => match width(bytes.len()) {
                Some(directive) => {
                    let mut value = [0u8; 16];
                    value[..bytes.len()].copy_from_slice(bytes);
                    let _ = writeln!(self.out, "\t{directive}\t{}", u128::from_le_bytes(value));
                }
                // A width no directive names, which on this machine is the eighty bit float and
                // nothing else. Its bytes are what it is.
                None => {
                    let list = bytes.iter().map(u8::to_string).collect::<Vec<_>>().join(", ");
                    let _ = writeln!(self.out, "\t.byte\t{list}");
                }
            },
            // Four and eight are the only widths that reach here, because the walk that built
            // this refused every other one rather than leave the two halves to disagree.
            // Written the way the template that asked for it wrote it, which is the one spelling
            // an assembler reading this back would give the same relocation to.
            Piece::Away { symbol, addend } => {
                let name = format!("{}{symbol}", self.directives.symbol());
                match addend {
                    0 => {
                        let _ = writeln!(self.out, "\t.long\t{name} - .");
                    }
                    _ => {
                        let sign = if *addend < 0 { '-' } else { '+' };
                        let _ = writeln!(self.out, "\t.long\t{name}{sign}{} - .", addend.abs());
                    }
                }
            }
            Piece::Addr { symbol, addend, bytes } => {
                let directive = if *bytes == 8 { ".quad" } else { ".long" };
                let name = format!("{}{symbol}", self.directives.symbol());
                match addend {
                    0 => {
                        let _ = writeln!(self.out, "\t{directive}\t{name}");
                    }
                    _ => {
                        let sign = if *addend < 0 { '-' } else { '+' };
                        let _ = writeln!(self.out, "\t{directive}\t{name}{sign}{}", addend.abs());
                    }
                }
            }
            // Spelled the way a jump table's cells are, which is what gas reads as a number it
            // works out itself when both labels are in one section.
            Piece::Apart { to, from, addend, bytes } => {
                let directive = width(usize::from(*bytes)).unwrap_or(".long");
                let prefix = self.directives.symbol();
                let _ = write!(self.out, "\t{directive}\t{prefix}{to}-{prefix}{from}");
                let _ = match addend.signum() {
                    1 => writeln!(self.out, "+{addend}"),
                    -1 => writeln!(self.out, "-{}", addend.unsigned_abs()),
                    _ => writeln!(self.out),
                };
            }
        }
    }

    /// Gives every block the number its label carries.
    fn number(&mut self, func: &Func) {
        self.labels.clear();
        self.labels.resize(func.block_count(), u32::MAX);
        for (index, block) in func.blocks().enumerate() {
            self.labels[block.index()] = u32::try_from(index).expect("a block number");
        }
    }

    /// One instruction of the machine IR, as however many instructions of the machine it is.
    fn inst(
        &mut self,
        func: &Func,
        block: Block,
        inst: Inst,
        func_name: &str,
    ) -> Result<(), Error> {
        if self.arch == Arch::Aarch64 {
            let spelling = match self.directives {
                Directives::MachO => aarch64::Spelling::Apple,
                Directives::Elf | Directives::Coff => aarch64::Spelling::Gnu,
            };
            let at = a64::Context {
                names: self.names,
                symbol: self.directives.symbol(),
                spelling,
                func_name,
            };
            let mut line = String::new();
            let label = |to| self.label(func_name, to);
            let table = |at: u32| self.table(func_name, at as usize);
            a64::inst(&mut line, &at, func, block, inst, label, table)?;
            self.out.push_str(&line);
            return Ok(());
        }
        let data = func[inst];
        let spelled = self.names.resolve(data.opcode.name());
        let opcode = spelled.strip_prefix(PREFIX).unwrap_or(spelled);
        // The one opcode that is not an instruction and is still written down. Everything below
        // spells a mnemonic and its arguments, and this has neither: what it says is where the next
        // instruction starts, which in a listing is the assembler's own directive. The fill byte is
        // the one that does nothing, because a gap in the middle of a function is reached by falling
        // into it rather than by jumping over it.
        if opcode == x86_64::ALIGN {
            let bytes = data.imm.map_or(0, |imm| func[imm].0);
            let boundary = u32::try_from(bytes).ok().filter(|at| at.is_power_of_two());
            let Some(boundary) = boundary else {
                return Err(Error::Opcode {
                    func: func_name.to_owned(),
                    opcode: spelled.to_owned(),
                });
            };
            let _ = writeln!(self.out, "\t.p2align\t{}, 0x90", boundary.trailing_zeros());
            return Ok(());
        }
        // The other one, which is the bytes a template wrote out as themselves. They come back the
        // way they went in, since the directive is what the program wrote and an assembler reading
        // this listing has to get the same bytes out of it. One directive, because that is how many
        // the instruction carries.
        if opcode == x86_64::LITERAL {
            let bytes: Vec<u8> =
                data.imm.map(|imm| x86_64::unpacked(func[imm].0).collect()).unwrap_or_default();
            if bytes.is_empty() {
                return Err(Error::Opcode {
                    func: func_name.to_owned(),
                    opcode: spelled.to_owned(),
                });
            }
            let written: Vec<String> = bytes.iter().map(|byte| format!("0x{byte:02x}")).collect();
            let _ = writeln!(self.out, "\t.byte\t{}", written.join(", "));
            return Ok(());
        }
        // A template kept as text, written back as the text with what it names filled in. Each of
        // its lines goes down as a line of the listing, which is where gcc puts one too.
        if opcode == x86_64::TEMPLATE {
            let Some(text) = data.symbol else {
                return Err(Error::Opcode {
                    func: func_name.to_owned(),
                    opcode: spelled.to_owned(),
                });
            };
            let mem = match data.mem {
                Some(mem) => self.amode(&func[data.operands], &func[mem], func_name, spelled)?,
                None => String::new(),
            };
            // A register it names is the operand's, spelled at the width the hole says. Every one
            // of them has a register by now, and one that has not is the same mistake it is in any
            // other instruction.
            let operands = &func[data.operands];
            if operands.iter().any(|operand| operand.reg.phys().is_none()) {
                return Err(Error::Virtual {
                    func: func_name.to_owned(),
                    opcode: spelled.to_owned(),
                });
            }
            let prefix = self.directives.symbol();
            let reg = |at: usize, width: char| {
                let Some(operand) = operands.get(at) else { return String::from("?") };
                let phys = operand.reg.phys().expect("every operand was checked above");
                let named = match width {
                    'b' => name_of(operand.class, phys, Width::Byte),
                    'w' => name_of(operand.class, phys, Width::Word),
                    'k' => name_of(operand.class, phys, Width::Long),
                    'h' => x86_64::gpr_high(phys).unwrap_or("?"),
                    _ => name_of(operand.class, phys, Width::Quad),
                };
                format!("%{named}")
            };
            let filled = x86_64::template_filled(
                self.names.resolve(text),
                &mem,
                |name| format!("{prefix}{name}"),
                reg,
            );
            for line in filled.lines() {
                let _ = writeln!(self.out, "\t{}", line.trim_start());
            }
            return Ok(());
        }
        let Some(written) = x86_64::written(opcode) else {
            return Err(Error::Opcode { func: func_name.to_owned(), opcode: spelled.to_owned() });
        };
        let operands = &func[data.operands];
        for machine in written {
            let mut args = Vec::with_capacity(machine.args.len());
            for arg in machine.args {
                args.push(match *arg {
                    Arg::Reg(at, width) => {
                        let operand = operands[usize::from(at)];
                        self.reg(operand, width, func_name, spelled)?
                    }
                    // A whole vector register, whose name the register file holds outright. The
                    // width is asked for anyway because the one thing that reads it is the general
                    // purpose file, and a register in any other class has one name.
                    Arg::Xmm(at) => {
                        let operand = operands[usize::from(at)];
                        self.reg(operand, Width::Quad, func_name, spelled)?
                    }
                    // The two halves of one word, which is the one instruction that names part of
                    // a register rather than an amount of it. The low half is the byte the name
                    // above would give it and the high half is the one only four registers have,
                    // which is why the operand is fixed to one of the four where it is described.
                    Arg::Low(at) => {
                        let operand = operands[usize::from(at)];
                        self.reg(operand, Width::Byte, func_name, spelled)?
                    }
                    Arg::High(at) => {
                        let operand = operands[usize::from(at)];
                        let Some(phys) = operand.reg.phys() else {
                            return Err(Error::Virtual {
                                func: func_name.to_owned(),
                                opcode: spelled.to_owned(),
                            });
                        };
                        format!("%{}", x86_64::gpr_high(phys).unwrap_or("?"))
                    }
                    Arg::Named(register) => format!("%{register}"),
                    // A depth on the x87 stack rather than a register, which is why the number
                    // comes from the table and not from an operand. The assembler writes the top
                    // of the stack as `%st` on its own as well, and this writes `%st(0)` for it,
                    // because one spelling for all eight is one thing fewer to know.
                    Arg::Stack(depth) => format!("%st({depth})"),
                    Arg::Lit(lane) => format!("${lane}"),
                    // The first operand read, which is where a call puts the address it goes
                    // through. Everything in front of it is a register the call writes.
                    Arg::Through => {
                        let operand = operands[defs(operands)];
                        format!("*{}", self.reg(operand, Width::Quad, func_name, spelled)?)
                    }
                    Arg::Imm => match data.imm {
                        Some(imm) => format!("${}", func[imm].0),
                        None => "$0".to_owned(),
                    },
                    Arg::Mem => match data.mem {
                        Some(mem) => self.amode(operands, &func[mem], func_name, spelled)?,
                        None => "0".to_owned(),
                    },
                    Arg::Symbol => match data.symbol {
                        Some(symbol) => {
                            format!("{}{}", self.directives.symbol(), self.names.resolve(symbol))
                        }
                        None => "0".to_owned(),
                    },
                    // Where a conditional jump goes is the first arm, because the block layout
                    // guarantees the second is the block laid out next and is fallen into. An
                    // unconditional jump has one arm and it is the same one.
                    Arg::Label => match func[block].succs.first() {
                        Some(call) => self.label(func_name, call.block),
                        None => "0".to_owned(),
                    },
                });
            }
            if args.is_empty() {
                let _ = writeln!(self.out, "\t{}", machine.mnemonic);
            } else {
                let _ = writeln!(self.out, "\t{}\t{}", machine.mnemonic, args.join(", "));
            }
        }
        Ok(())
    }

    /// One register operand, as much of it as the instruction reads or writes.
    fn reg(
        &self,
        operand: Operand,
        width: Width,
        func_name: &str,
        opcode: &str,
    ) -> Result<String, Error> {
        let Some(phys) = operand.reg.phys() else {
            return Err(Error::Virtual { func: func_name.to_owned(), opcode: opcode.to_owned() });
        };
        Ok(format!("%{}", name_of(operand.class, phys, width)))
    }

    /// One address, which is a displacement and then whichever registers it names.
    ///
    /// A symbol with no base and no index is written relative to the instruction pointer, which
    /// is how a global is reached in position independent code and is the only way this compiler
    /// reaches one. A block is written the same way, and is the address a `&&label` produces.
    fn amode(
        &self,
        operands: &[Operand],
        amode: &Amode,
        func_name: &str,
        opcode: &str,
    ) -> Result<String, Error> {
        let mut out = String::new();
        // In front of everything, which is where an assembler wants it: the segment says which
        // storage the rest of the address is counted in, so `%fs:40` reads left to right.
        match amode.segment {
            Some(Segment::Fs) => out.push_str("%fs:"),
            Some(Segment::Gs) => out.push_str("%gs:"),
            None => {}
        }
        if let Some(symbol) = amode.symbol {
            let _ = write!(out, "{}{}", self.directives.symbol(), self.names.resolve(symbol));
            // The slot rather than the thing, which the assembler is told by the suffix and not by
            // the instruction: the two are the same `movq` and differ only in what goes in the
            // four bytes, so there is nowhere else to say it. The third one is a slot as well, and
            // what it holds is an offset into a thread's own block rather than an address. On
            // Mach-O the slot holds the address of the variable's descriptor instead, which is
            // what the code calls through.
            match amode.reach {
                Reach::Itself => {}
                Reach::Table => out.push_str("@GOTPCREL"),
                Reach::Thread if self.directives == Directives::MachO => out.push_str("@TLVP"),
                Reach::Thread => out.push_str("@GOTTPOFF"),
                // How far into its section, which is how far into a thread's copy of `.tls`.
                Reach::Section => out.push_str("@SECREL32"),
            }
            if amode.disp != 0 {
                let sign = if amode.disp < 0 { '-' } else { '+' };
                let _ = write!(out, "{sign}{}", i64::from(amode.disp).abs());
            }
        } else if let Some(block) = amode.block {
            // A label of this function, which is written the way a symbol is and reached the way a
            // symbol is, and is neither: what the assembler puts in the four bytes is a distance it
            // works out itself, since both ends are in the section it is writing.
            out.push_str(&self.label(func_name, block));
            if amode.disp != 0 {
                let sign = if amode.disp < 0 { '-' } else { '+' };
                let _ = write!(out, "{sign}{}", i64::from(amode.disp).abs());
            }
        } else if let Some(table) = amode.table {
            // A jump table of this function, which is a place in it the way a label is.
            out.push_str(&self.table(func_name, table as usize));
            if amode.disp != 0 {
                let sign = if amode.disp < 0 { '-' } else { '+' };
                let _ = write!(out, "{sign}{}", i64::from(amode.disp).abs());
            }
        } else if amode.disp != 0 || (amode.base.is_none() && amode.index.is_none()) {
            // A mode that names no register at all is an absolute address, and zero is one of
            // them, so the number is written even when it is zero and there is nothing else.
            let _ = write!(out, "{}", amode.disp);
        }
        let base = amode.base.and_then(|at| operands.get(usize::from(at)));
        let index = amode.index.and_then(|at| operands.get(usize::from(at)));
        if base.is_some() || index.is_some() {
            out.push('(');
            if let Some(operand) = base {
                out.push_str(&self.reg(*operand, Width::Quad, func_name, opcode)?);
            }
            if let Some(operand) = index {
                let reg = self.reg(*operand, Width::Quad, func_name, opcode)?;
                let _ = write!(out, ",{reg},{}", amode.scale);
            }
            out.push(')');
        } else if amode.symbol.is_some() || amode.block.is_some() || amode.table.is_some() {
            out.push_str("(%rip)");
        }
        Ok(out)
    }

    /// The jump tables, where the encoder puts them. Each cell is the distance from the table to a
    /// block. See `bytes::Assembler::tables`.
    ///
    /// On x86-64 ELF they go in `.rodata`, or `.rodata.` and the function's name under
    /// `-fdata-sections`, which is what gcc writes, and the listing goes back to the function's
    /// own section afterwards so that what follows is still inside it. The assembler turns each
    /// cell into a relocation, since its two ends are in different sections. Everywhere else they
    /// stay after the last instruction, where the assembler works each cell out itself.
    fn tables(&mut self, func: &Func, func_name: &str) {
        if func.tables.is_empty() {
            return;
        }
        let apart = self.arch == Arch::X86_64 && self.directives == Directives::Elf;
        if apart {
            let _ = if self.sections.data {
                writeln!(self.out, "\t.section\t.rodata.{func_name},\"a\",@progbits")
            } else {
                writeln!(self.out, "\t.section\t.rodata")
            };
            let _ = writeln!(self.out, "\t.p2align\t2");
        } else {
            let _ = match self.fill() {
                Some(byte) => writeln!(self.out, "\t.p2align\t2, {byte:#x}"),
                None => writeln!(self.out, "\t.p2align\t2"),
            };
        }
        for (index, table) in func.tables.iter().enumerate() {
            let label = self.table(func_name, index);
            let _ = writeln!(self.out, "{label}:");
            let block = func.block_of(table.jump).expect("a table read by a jump in no block");
            let succs = &func[block].succs;
            for &cell in &table.cells {
                let to = self.label(func_name, succs[cell as usize].block);
                let _ = writeln!(self.out, "\t.long\t{to}-{label}");
            }
        }
        if apart {
            if self.sections.functions {
                let _ = writeln!(self.out, "\t.section\t.text.{func_name},\"ax\",@progbits");
            } else {
                let _ = writeln!(self.out, "{}", self.directives.text());
            }
        }
    }

    /// The call site table of a function with a landing pad, in its own section as gcc writes it.
    ///
    /// No landing pad base and no type table, then one row per call: where it starts and how long
    /// it is, where its pad is, and an action of zero, which says the pad is a cleanup. Every
    /// distance is from the function's own label, which is what a missing base means. `sites` is
    /// the pad of each call in the order the calls were written, which is the order the unwinder
    /// wants them in.
    fn call_sites(&mut self, name: &str, sites: &[Block]) {
        let local = self.directives.local();
        let _ = writeln!(self.out, "\t.section\t{},\"a\",@progbits", rucc_object::EXCEPT_TABLE);
        let _ = writeln!(self.out, "\t.p2align\t2");
        let _ = writeln!(self.out, "{local}LSDA_{name}:");
        let _ = writeln!(self.out, "\t.byte\t0xff\n\t.byte\t0xff\n\t.byte\t0x1");
        let _ = writeln!(self.out, "\t.uleb128\t{local}LSDACSE_{name}-{local}LSDACSB_{name}");
        let _ = writeln!(self.out, "{local}LSDACSB_{name}:");
        for (at, &pad) in sites.iter().enumerate() {
            let pad = self.label(name, pad);
            let _ = writeln!(self.out, "\t.uleb128\t{local}EHB{at}_{name}-{name}");
            let _ = writeln!(self.out, "\t.uleb128\t{local}EHE{at}_{name}-{local}EHB{at}_{name}");
            let _ = writeln!(self.out, "\t.uleb128\t{pad}-{name}");
            let _ = writeln!(self.out, "\t.uleb128\t0");
        }
        let _ = writeln!(self.out, "{local}LSDACSE_{name}:");
        // Back to the function's section, since what closes the function measures its size from
        // where the assembler is.
        if self.sections.functions {
            let _ = writeln!(self.out, "\t.section\t.text.{name},\"ax\",@progbits");
        } else {
            let _ = writeln!(self.out, "{}", self.directives.text());
        }
    }

    /// The label one jump table of one function carries. The `j` is what keeps it apart from a
    /// block's label, which is a number after the same underscore.
    fn table(&self, func_name: &str, index: usize) -> String {
        format!("{}{func_name}_j{index}", self.directives.local())
    }

    /// What the machine IR puts in front of an opcode of this machine.
    fn prefix(&self) -> &'static str {
        if self.arch == Arch::Aarch64 { a64::PREFIX } else { PREFIX }
    }

    /// The byte padding inside code is made of, which is the one byte `nop` on x86-64. AArch64 has
    /// no one byte instruction, so the assembler is left to pad with its own `nop`.
    fn fill(&self) -> Option<u8> {
        if self.arch == Arch::Aarch64 { None } else { Some(0x90) }
    }

    /// The label one block of one function carries.
    fn label(&self, func_name: &str, block: Block) -> String {
        match self.labels.get(block.index()).copied() {
            Some(u32::MAX) | None => format!("{}{func_name}_?", self.directives.local()),
            Some(number) => format!("{}{func_name}_{number}", self.directives.local()),
        }
    }
}

/// The directive that writes a number that many bytes wide, and `None` for a width none does.
fn width(bytes: usize) -> Option<&'static str> {
    match bytes {
        1 => Some(".byte"),
        2 => Some(".short"),
        4 => Some(".long"),
        8 => Some(".quad"),
        _ => None,
    }
}

/// Those bytes as the inside of a string an assembler reads back as the same bytes.
///
/// Everything outside printable ASCII is written as three octal digits rather than as itself,
/// which is what keeps a string with a newline in it on one line and what stops a digit after an
/// escape from being read as part of it.
fn escape(bytes: &[u8]) -> String {
    let mut out = String::with_capacity(bytes.len());
    for byte in bytes {
        match byte {
            b'"' => out.push_str("\\\""),
            b'\\' => out.push_str("\\\\"),
            0x20..=0x7e => out.push(char::from(*byte)),
            _ => {
                let _ = write!(out, "\\{byte:03o}");
            }
        }
    }
    out
}

/// What one register is called, at that width, without the sigil.
///
/// The width is a general purpose register's business and nothing else's on this machine, since
/// every other class here has one name per register, which is the name the register file gives.
fn name_of(class: RegClass, reg: PhysReg, width: Width) -> &'static str {
    let named = if class == x86_64::GPR {
        x86_64::gpr_name(reg, width)
    } else {
        x86_64::REGS.name(class, reg)
    };
    named.unwrap_or("?")
}

#[cfg(test)]
mod tests {
    use super::*;

    use rucc_base::Interner;
    use rucc_mir::{Func, Mem, Operand, Reg};
    use rucc_object::{Binding, Place, Visibility};
    use rucc_target::x86_64::{GPR, RAX, RCX, RDX, RSP};
    use rucc_target::{Arch, Env, Os, TargetInfo, Triple};

    /// A target of that object format, which is what decides how a symbol is spelled.
    fn target(os: Os) -> TargetInfo {
        TargetInfo::new(Triple::new(Arch::X86_64, os, Env::Gnu))
    }

    /// One function of one block, with those instructions in it, written out.
    fn write(build: impl FnOnce(&mut Func, &mut Interner)) -> String {
        let mut names = Interner::new();
        let mut func = Func::new(names.intern("f"));
        build(&mut func, &mut names);
        print(
            &[func],
            &Globals::default(),
            &[],
            &names,
            &target(Os::Linux),
            true,
            Output::default(),
        )
        .expect("a function that was allocated")
    }

    /// Those variables, written out for that object format.
    fn data(vars: Vec<Variable>, os: Os) -> String {
        let names = Interner::new();
        print(
            &[],
            &Globals { vars, ..Globals::default() },
            &[],
            &names,
            &target(os),
            true,
            Output::default(),
        )
        .expect("a machine with a writer")
    }

    /// The same, with every variable given a section of its own.
    fn split(vars: Vec<Variable>, os: Os) -> String {
        let names = Interner::new();
        let sections =
            Output { sections: Sections { functions: false, data: true }, ..Output::default() };
        print(
            &[],
            &Globals { vars, ..Globals::default() },
            &[],
            &names,
            &target(os),
            true,
            sections,
        )
        .expect("a machine with a writer")
    }

    /// Two functions of those names, written out with each of them given a section of its own.
    fn split_code(first: &str, second: &str, os: Os) -> String {
        let mut names = Interner::new();
        let mut funcs = Vec::new();
        for name in [first, second] {
            let mut func = Func::new(names.intern(name));
            func.create_block();
            funcs.push(func);
        }
        let sections =
            Output { sections: Sections { functions: true, data: false }, ..Output::default() };
        print(&funcs, &Globals::default(), &[], &names, &target(os), true, sections)
            .expect("a machine with a writer")
    }

    /// A four byte variable of that name, in that section, holding that image.
    fn var(name: &str, place: Place, pieces: Vec<Piece>) -> Variable {
        Variable {
            name: name.to_owned(),
            size: 4,
            align: 4,
            place,
            binding: Binding::Global,
            visibility: Visibility::Default,
            pieces,
        }
    }

    /// The instruction lines of that text, without the directives or the labels.
    fn body(text: &str) -> Vec<&str> {
        text.lines()
            .filter(|line| line.starts_with('\t') && !line.trim_start().starts_with('.'))
            .map(|line| line.trim_start())
            .collect()
    }

    #[test]
    fn an_instruction_is_written_the_way_the_target_says_it_is() {
        let text = write(|func, names| {
            let block = func.create_block();
            let add = Opcode::new(names.intern("x64.add_rr_32"));
            func.build(block, add)
                .operand(Operand::write(Reg::physical(RAX), GPR))
                .operand(Operand::read(Reg::physical(RAX), GPR))
                .operand(Operand::read(Reg::physical(RCX), GPR))
                .finish();
        });
        // The source before the destination, which is the reverse of the operand vector, and the
        // first source not written at all, because it is the destination.
        assert_eq!(body(&text), ["addl\t%ecx, %eax"]);
    }

    #[test]
    fn an_opcode_the_machine_has_no_single_instruction_for_is_written_as_the_ones_it_has() {
        let text = write(|func, names| {
            let block = func.create_block();
            let cmp = Opcode::new(names.intern("x64.cmp_set_l_64"));
            func.build(block, cmp)
                .operand(Operand::write(Reg::physical(RAX), GPR))
                .operand(Operand::read(Reg::physical(RCX), GPR))
                .operand(Operand::read(Reg::physical(RDX), GPR))
                .finish();
        });
        // Two instructions, the comparison at the width it was asked for and the set at the width
        // a set is, which is the case that says why a width is a fact about an argument.
        assert_eq!(body(&text), ["cmpq\t%rdx, %rcx", "setl\t%al"]);
    }

    #[test]
    fn an_opcode_that_is_not_an_instruction_is_written_as_nothing() {
        let text = write(|func, names| {
            let block = func.create_block();
            let ret = Opcode::new(names.intern("x64.ret_val_32"));
            func.build(block, ret).operand(Operand::read(Reg::physical(RAX), GPR)).finish();
        });
        assert_eq!(body(&text), Vec::<&str>::new());
    }

    #[test]
    fn an_alignment_is_written_as_the_directive_that_asks_for_it() {
        let text = write(|func, names| {
            let block = func.create_block();
            let align = Opcode::new(names.intern("x64.align"));
            func.build(block, align).imm(32).finish();
        });
        // The boundary is a power here and a count of bytes in the machine IR, because the
        // assembler reads the one and a program writes the other. The fill is the one byte that
        // does nothing, so a jump that lands in the padding still arrives. A directive rather than
        // an instruction, which is why it is looked for in the whole text and not in the body.
        assert!(text.contains("\n\t.p2align\t5, 0x90\n"), "{text}");
        assert_eq!(body(&text), Vec::<&str>::new());
    }

    #[test]
    fn an_address_is_a_displacement_and_then_the_registers_it_names() {
        let text = write(|func, names| {
            let block = func.create_block();
            let lea = Opcode::new(names.intern("x64.lea_64"));
            func.build(block, lea)
                .operand(Operand::write(Reg::physical(RAX), GPR))
                .mem(
                    Mem::at(Operand::read(Reg::physical(RCX), GPR))
                        .indexed(Operand::read(Reg::physical(RDX), GPR), 4)
                        .plus(-16),
                )
                .finish();
        });
        assert_eq!(body(&text), ["leaq\t-16(%rcx,%rdx,4), %rax"]);
    }

    #[test]
    fn an_address_in_a_thread_s_own_block_names_the_segment_and_no_register() {
        let text = write(|func, names| {
            let block = func.create_block();
            let load = Opcode::new(names.intern("x64.mov_rm_64"));
            func.build(block, load)
                .operand(Operand::write(Reg::physical(RAX), GPR))
                .mem(Mem::in_segment(Segment::Fs, 40))
                .finish();
        });
        // The first line of every function this compiler protects. No base and no index, because
        // where the block begins is something only the machine knows, and the segment written in
        // front of the constant rather than behind it, which is what an assembler reads.
        assert_eq!(body(&text), ["movq\t%fs:40, %rax"]);
    }

    #[test]
    fn the_touch_a_probing_prologue_writes_is_an_immediate_and_then_an_address() {
        let text = write(|func, names| {
            let block = func.create_block();
            let touch = Opcode::new(names.intern("x64.or_mi_8"));
            func.build(block, touch)
                .imm(0)
                .mem(Mem::at(Operand::read(Reg::physical(RSP), GPR)))
                .finish();
        });
        // The only instruction this compiler writes that has a number and an address and no
        // register of its own. An inclusive or of zero, so the byte it writes is the byte that was
        // there, which is what makes it safe on a page nothing has been put in yet.
        assert_eq!(body(&text), ["orb\t$0, (%rsp)"]);
    }

    #[test]
    fn an_address_with_nothing_but_a_symbol_in_it_is_relative_to_the_instruction_pointer() {
        let text = write(|func, names| {
            let block = func.create_block();
            let load = Opcode::new(names.intern("x64.mov_rm_64"));
            let global = names.intern("counter");
            func.build(block, load)
                .operand(Operand::write(Reg::physical(RAX), GPR))
                .mem(Mem::of(global))
                .finish();
        });
        assert_eq!(body(&text), ["movq\tcounter(%rip), %rax"]);
    }

    #[test]
    fn an_address_with_a_label_in_it_is_the_label_and_is_relative_as_well() {
        let text = write(|func, names| {
            let head = func.create_block();
            let there = func.create_block();
            let lea = Opcode::new(names.intern("x64.lea_64"));
            let jump = Opcode::new(names.intern("x64.jmp_reg"));
            func.build(head, lea)
                .operand(Operand::write(Reg::physical(RAX), GPR))
                .mem(Mem::block(there))
                .finish();
            func.build(head, jump).operand(Operand::read(Reg::physical(RAX), GPR)).finish();
            func.build(there, Opcode::new(names.intern("x64.ret"))).finish();
        });
        // The four bytes a symbol would leave, holding a distance the assembler works out for
        // itself rather than one a relocation asks the linker for, since both ends of it are in
        // the section being written.
        assert_eq!(body(&text), ["leaq\t.Lf_1(%rip), %rax", "jmp\t*%rax", "ret"]);
    }

    /// A function that jumps through a table of three cells to one of two returns, written out for
    /// that object format with its sections split up or not.
    fn switching(os: Os, sections: Sections) -> String {
        let mut names = Interner::new();
        let mut func = Func::new(names.intern("f"));
        let head = func.create_block();
        let first = func.create_block();
        let second = func.create_block();
        let lea = Opcode::new(names.intern("x64.lea_64"));
        let jmp = Opcode::new(names.intern("x64.jmp_reg"));
        func.build(head, lea)
            .operand(Operand::write(Reg::physical(RAX), GPR))
            .mem(Mem::table(0))
            .finish();
        let jump = func.build(head, jmp).operand(Operand::read(Reg::physical(RAX), GPR)).finish();
        func.succs_mut(head).push(rucc_mir::BlockCall::to(first));
        func.succs_mut(head).push(rucc_mir::BlockCall::to(second));
        func.build(first, Opcode::new(names.intern("x64.ret"))).finish();
        func.build(second, Opcode::new(names.intern("x64.ret"))).finish();
        func.tables.push(rucc_mir::Table { jump, cells: vec![0, 1, 0] });
        let output = Output { sections, ..Output::default() };
        print(&[func], &Globals::default(), &[], &names, &target(os), true, output)
            .expect("a function that was allocated")
    }

    /// The lines from the one in front of the table's label to the one after its last cell.
    fn around_table(text: &str) -> Vec<&str> {
        let lines: Vec<&str> = text.lines().collect();
        let at = lines.iter().position(|line| *line == ".Lf_j0:").expect("a table");
        lines[at - 2..at + 5].to_vec()
    }

    #[test]
    fn a_jump_table_is_a_label_and_the_distance_to_each_block_from_it_in_rodata() {
        let text = switching(Os::Linux, Sections::default());
        assert_eq!(body(&text), ["leaq\t.Lf_j0(%rip), %rax", "jmp\t*%rax", "ret", "ret"]);
        assert_eq!(
            around_table(&text),
            [
                "\t.section\t.rodata",
                "\t.p2align\t2",
                ".Lf_j0:",
                "\t.long\t.Lf_1-.Lf_j0",
                "\t.long\t.Lf_2-.Lf_j0",
                "\t.long\t.Lf_1-.Lf_j0",
                "\t.text",
            ],
            "{text}"
        );
        // Back in the code before the function is closed, so that its size is still counted there.
        let closed = text.find("\t.size\tf").expect("a size");
        assert!(text[..closed].ends_with("\t.text\n\t.cfi_endproc\n"), "{text}");
    }

    #[test]
    fn a_jump_table_under_data_sections_goes_in_a_section_named_after_its_function() {
        let text = switching(Os::Linux, Sections { functions: true, data: true });
        assert_eq!(around_table(&text)[0], "\t.section\t.rodata.f,\"a\",@progbits", "{text}");
        assert_eq!(around_table(&text)[6], "\t.section\t.text.f,\"ax\",@progbits", "{text}");
        // Code sections alone leave the tables in the one `.rodata`, which is what gcc does.
        let text = switching(Os::Linux, Sections { functions: true, data: false });
        assert_eq!(around_table(&text)[0], "\t.section\t.rodata", "{text}");
        assert_eq!(around_table(&text)[6], "\t.section\t.text.f,\"ax\",@progbits", "{text}");
    }

    #[test]
    fn a_jump_table_on_windows_stays_after_the_code() {
        let text = switching(Os::Windows, Sections::default());
        assert!(!text.contains("rodata"), "{text}");
        let lines: Vec<&str> = text.lines().collect();
        let at = lines.iter().position(|line| *line == ".Lf_j0:").expect("a table");
        assert_eq!(lines[at - 2..=at], ["\tret", "\t.p2align\t2, 0x90", ".Lf_j0:"], "{text}");
    }

    #[test]
    fn an_address_that_reads_the_offset_table_says_so_on_the_symbol() {
        let text = write(|func, names| {
            let block = func.create_block();
            let load = Opcode::new(names.intern("x64.mov_rm_64"));
            let away = names.intern("away");
            func.build(block, load)
                .operand(Operand::write(Reg::physical(RAX), GPR))
                .mem(Mem::got(away))
                .finish();
        });
        // The same instruction and the same four bytes as the one above. What is different is
        // which relocation those four bytes take, and the suffix on the name is the only place
        // the assembler is told which.
        assert_eq!(body(&text), ["movq\taway@GOTPCREL(%rip), %rax"]);
    }

    #[test]
    fn an_address_that_reads_the_offset_of_a_thread_local_says_so_on_the_symbol_as_well() {
        let text = write(|func, names| {
            let block = func.create_block();
            let load = Opcode::new(names.intern("x64.mov_rm_64"));
            let away = names.intern("away");
            func.build(block, load)
                .operand(Operand::write(Reg::physical(RAX), GPR))
                .mem(Mem::thread(away))
                .finish();
        });
        // The third instruction that is the same instruction as the two above it. What comes back
        // this time is not an address at all: it is how far into a thread's own block the variable
        // sits, and what makes it an address is the addition that follows it.
        assert_eq!(body(&text), ["movq\taway@GOTTPOFF(%rip), %rax"]);
    }

    #[test]
    fn a_jump_goes_to_the_label_of_the_block_the_first_arm_names() {
        let mut names = Interner::new();
        let mut func = Func::new(names.intern("f"));
        let first = func.create_block();
        let second = func.create_block();
        let jmp = Opcode::new(names.intern("x64.jmp"));
        func.build(first, jmp).finish();
        func.succs_mut(first).push(rucc_mir::BlockCall::to(second));
        let text = print(
            &[func],
            &Globals::default(),
            &[],
            &names,
            &target(Os::Linux),
            true,
            Output::default(),
        )
        .expect("a function of two blocks");
        assert!(text.contains("\tjmp\t.Lf_1\n"), "{text}");
        assert!(text.contains("\n.Lf_1:\n"), "{text}");
    }

    #[test]
    fn a_marked_listing_has_a_label_in_front_of_every_instruction_and_numbers_the_functions() {
        let mut names = Interner::new();
        let jmp = Opcode::new(names.intern("x64.jmp"));
        let mut funcs = Vec::new();
        for name in ["f", "g"] {
            let mut func = Func::new(names.intern(name));
            let first = func.create_block();
            let second = func.create_block();
            func.build(first, jmp).finish();
            func.succs_mut(first).push(rucc_mir::BlockCall::to(second));
            funcs.push(func);
        }
        let target = target(Os::Linux);
        let text = print_marked(
            &funcs,
            &Globals::default(),
            &[],
            &names,
            &target,
            true,
            Output::default(),
        )
        .expect("two functions");
        let inst = funcs[1].insts(funcs[1].blocks().next().unwrap()).next().unwrap();
        let label = mark(&target, 1, inst);
        assert!(label.starts_with(".L"), "{label}");
        assert!(text.contains(&format!("\n{label}:\n\tjmp\t.Lg_1\n")), "{text}");
        assert!(text.contains(&format!("\n{}:\n", mark(&target, 0, inst))), "{text}");
        // And none at all in the listing `-S` writes.
        let plain =
            print(&funcs, &Globals::default(), &[], &names, &target, true, Output::default())
                .expect("two functions");
        assert!(!plain.contains("rucc_row"), "{plain}");
    }

    #[test]
    fn a_symbol_is_spelled_the_way_the_object_format_spells_one() {
        let mut names = Interner::new();
        let mut func = Func::new(names.intern("f"));
        let block = func.create_block();
        let call = Opcode::new(names.intern("x64.call"));
        let callee = names.intern("puts");
        func.build(block, call).symbol(callee).finish();

        let elf = print(
            std::slice::from_ref(&func),
            &Globals::default(),
            &[],
            &names,
            &target(Os::Linux),
            true,
            Output::default(),
        )
        .expect("elf");
        assert!(elf.contains("\tcall\tputs\n"), "{elf}");
        assert!(elf.contains("\n.Lf_0:\n"), "{elf}");

        // The underscore, which is the difference that would fail to link against every library
        // on an Apple machine rather than merely looking odd.
        let macho = print(
            &[func],
            &Globals::default(),
            &[],
            &names,
            &target(Os::Darwin),
            true,
            Output::default(),
        )
        .expect("mach-o");
        assert!(macho.contains("\tcall\t_puts\n"), "{macho}");
        assert!(macho.contains("\n_f:\n"), "{macho}");
        assert!(macho.contains("\nLf_0:\n"), "{macho}");
    }

    #[test]
    fn a_function_that_was_never_allocated_is_refused_rather_than_written_wrongly() {
        let mut names = Interner::new();
        let mut func = Func::new(names.intern("f"));
        let block = func.create_block();
        let vreg = func.new_vreg(GPR);
        let neg = Opcode::new(names.intern("x64.neg_r_32"));
        func.build(block, neg).operand(Operand::write(vreg, GPR)).finish();
        let error = print(
            &[func],
            &Globals::default(),
            &[],
            &names,
            &target(Os::Linux),
            true,
            Output::default(),
        )
        .expect_err("a virtual register");
        assert_eq!(
            error,
            Error::Virtual { func: "f".to_owned(), opcode: "x64.neg_r_32".to_owned() }
        );
    }

    #[test]
    fn an_opcode_the_target_does_not_describe_is_refused() {
        let mut names = Interner::new();
        let mut func = Func::new(names.intern("f"));
        let block = func.create_block();
        let made_up = Opcode::new(names.intern("x64.frobnicate"));
        func.build(block, made_up).finish();
        let error = print(
            &[func],
            &Globals::default(),
            &[],
            &names,
            &target(Os::Linux),
            true,
            Output::default(),
        )
        .expect_err("no such instruction");
        assert_eq!(
            error,
            Error::Opcode { func: "f".to_owned(), opcode: "x64.frobnicate".to_owned() }
        );
    }

    #[test]
    fn a_function_no_other_file_can_see_is_not_announced_to_the_linker() {
        let mut names = Interner::new();
        let mut hidden = Func::new(names.intern("hidden"));
        hidden.binding = rucc_mir::Binding::Local;
        hidden.create_block();
        let text = print(
            &[hidden],
            &Globals::default(),
            &[],
            &names,
            &target(Os::Linux),
            true,
            Output::default(),
        )
        .expect("elf");
        // Still a symbol, and still at the alignment a function gets, because a local name is one
        // the linker keeps and does not let another file reach.
        assert!(text.contains("\nhidden:\n"), "{text}");
        assert!(text.contains("\t.type\thidden, @function\n"), "{text}");
        // What two files each defining their own `static helper` come down to.
        assert!(!text.contains(".globl"), "{text}");
    }

    #[test]
    fn a_function_that_may_lose_to_another_definition_is_written_weak() {
        let mut names = Interner::new();
        let mut shared = Func::new(names.intern("shared"));
        shared.binding = rucc_mir::Binding::Weak;
        shared.create_block();
        let text = print(
            &[shared],
            &Globals::default(),
            &[],
            &names,
            &target(Os::Linux),
            true,
            Output::default(),
        )
        .expect("elf");
        assert!(text.contains("\t.weak\tshared\n"), "{text}");
        assert!(!text.contains(".globl"), "{text}");
    }

    /// The whole of what an assembler is told about one, and none of what it works out itself:
    /// the type and the size of the new name come from the old one, so they are not written
    /// again. gcc 16 writes exactly these two lines for the same input.
    #[test]
    fn a_second_name_is_a_binding_and_a_set_and_nothing_else() {
        let names = Interner::new();
        let aliases = [
            Alias {
                name: "b".to_owned(),
                target: "a".to_owned(),
                binding: Binding::Global,
                visibility: Visibility::Default,
            },
            Alias {
                name: "c".to_owned(),
                target: "a".to_owned(),
                binding: Binding::Weak,
                visibility: Visibility::Default,
            },
            Alias {
                name: "d".to_owned(),
                target: "a".to_owned(),
                binding: Binding::Local,
                visibility: Visibility::Default,
            },
        ];
        let vars = vec![var("a", Place::Written, vec![Piece::Scalar(vec![1, 0, 0, 0])])];
        let text = print(
            &[],
            &Globals { vars, ..Globals::default() },
            &aliases,
            &names,
            &target(Os::Linux),
            true,
            Output::default(),
        )
        .expect("a machine with a writer");
        assert!(text.contains("\t.globl\tb\n\t.set\tb,a\n"), "{text}");
        assert!(text.contains("\t.weak\tc\n\t.set\tc,a\n"), "{text}");
        // A local one is a name no directive announces, which is still an entry in the symbol
        // table and is what a `static` alias comes down to.
        assert!(text.contains("\t.set\td,a\n"), "{text}");
        assert!(!text.contains("\t.type\tb"), "the type comes from what it points at: {text}");
        assert!(!text.contains("\t.size\tb"), "and so does the size: {text}");
        // Four bytes of image and not sixteen, since three more names for one variable are three
        // more names and not three more variables.
        assert_eq!(text.matches(".long\t1").count(), 1, "{text}");
    }

    #[test]
    fn a_variable_is_a_section_a_name_and_the_bytes_between_them() {
        let text = data(
            vec![var("counter", Place::Written, vec![Piece::Scalar(vec![42, 0, 0, 0])])],
            Os::Linux,
        );
        assert!(text.contains("\t.data\n"), "{text}");
        assert!(text.contains("\t.globl\tcounter\n"), "{text}");
        assert!(text.contains("\t.p2align\t2\n"), "{text}");
        assert!(text.contains("\t.type\tcounter, @object\n"), "{text}");
        // The number at the width it is, rather than the four bytes it is made of, because a
        // listing is a thing to read and the bytes are the object's business.
        assert!(text.contains("\ncounter:\n\t.long\t42\n"), "{text}");
        assert!(text.contains("\t.size\tcounter, .-counter\n"), "{text}");
    }

    /// The flag and the type are the whole of what makes it thread-local in a listing, and they
    /// are what gcc 16.2.0 writes for `_Thread_local int counter = 42;`.
    #[test]
    fn a_thread_local_variable_is_a_section_with_the_flag_on_it_and_a_type_of_its_own() {
        let text = data(
            vec![var(
                "counter",
                Place::Thread { zero: false },
                vec![Piece::Scalar(vec![42, 0, 0, 0])],
            )],
            Os::Linux,
        );
        assert!(text.contains("\t.section\t.tdata,\"awT\",@progbits\n"), "{text}");
        assert!(text.contains("\t.type\tcounter, @tls_object\n"), "{text}");
        assert!(text.contains("\ncounter:\n\t.long\t42\n"), "{text}");
    }

    /// The other half of the pair, which is `.bss` to the one above's `.data`.
    #[test]
    fn a_thread_local_variable_with_no_image_to_carry_goes_in_the_section_that_carries_none() {
        let text = data(
            vec![var("counter", Place::Thread { zero: true }, vec![Piece::Zero(4)])],
            Os::Linux,
        );
        assert!(text.contains("\t.section\t.tbss,\"awT\",@nobits\n"), "{text}");
        assert!(text.contains("\t.type\tcounter, @tls_object\n"), "{text}");
        assert!(text.contains("\ncounter:\n\t.space\t4\n"), "{text}");
    }

    /// What clang writes for `__thread int counter = 42;` on either Apple architecture: the image
    /// under a name of its own, and the name the program uses on a descriptor that points at it.
    #[test]
    fn a_thread_local_variable_on_mach_o_is_an_image_and_a_descriptor() {
        let text = data(
            vec![var(
                "counter",
                Place::Thread { zero: false },
                vec![Piece::Scalar(vec![42, 0, 0, 0])],
            )],
            Os::Darwin,
        );
        let image = "\t.section\t__DATA,__thread_data,thread_local_regular\n\t.p2align\t2\n\
                     _counter$tlv$init:\n\t.long\t42\n";
        assert!(text.contains(image), "{text}");
        let descriptor = "\t.section\t__DATA,__thread_vars,thread_local_variables\n\
                          \t.globl\t_counter\n\t.p2align\t3\n_counter:\n\
                          \t.quad\t__tlv_bootstrap\n\t.quad\t0\n\t.quad\t_counter$tlv$init\n";
        assert!(text.contains(descriptor), "{text}");
        let zero = data(
            vec![var("counter", Place::Thread { zero: true }, vec![Piece::Zero(4)])],
            Os::Darwin,
        );
        assert!(zero.contains("\t.tbss\t_counter$tlv$init,4,2\n"), "{zero}");
        assert!(zero.contains(descriptor), "{zero}");
    }

    #[test]
    fn a_variable_no_other_file_can_see_is_not_announced_to_the_linker() {
        let mut hidden = var("hidden", Place::Zero, vec![Piece::Zero(4)]);
        hidden.binding = Binding::Local;
        let text = data(vec![hidden], Os::Linux);
        assert!(text.contains("\t.bss\n"), "{text}");
        assert!(text.contains("\nhidden:\n\t.space\t4\n"), "{text}");
        // The whole of what `static` at file scope means, and the one thing a reader would not
        // notice missing until two files each defined their own and the linker took one.
        assert!(!text.contains(".globl"), "{text}");
    }

    #[test]
    fn a_tentative_definition_is_a_request_rather_than_a_section_and_a_label() {
        let text = data(vec![var("x", Place::Merged, vec![Piece::Zero(4)])], Os::Linux);
        assert_eq!(text.lines().find(|line| line.contains(".comm")), Some("\t.comm\tx,4,4"));
        assert!(!text.contains("\nx:\n"), "nothing here says where it is: {text}");
    }

    /// The listing half of `-ffunction-sections`, which is the flag that makes `--gc-sections` able
    /// to drop anything: a linker can leave out a section nothing reaches and cannot leave out half
    /// of one.
    ///
    /// The empty `.text` at the top stays. It is what the file opens with either way, gcc 16 writes
    /// one under the flag too, and a section with nothing in it costs a header and confuses nobody.
    #[test]
    fn every_function_gets_a_section_of_its_own_when_that_is_what_was_asked_for() {
        let text = split_code("first", "second", Os::Linux);
        assert!(text.starts_with("\t.text\n"), "{text}");
        assert!(text.contains("\t.section\t.text.first,\"ax\",@progbits\n"), "{text}");
        assert!(text.contains("\t.section\t.text.second,\"ax\",@progbits\n"), "{text}");
        // In front of the alignment and the name rather than after them, since the padding belongs
        // to the section the function is in and a label in the wrong section is a wrong address.
        let opened = text.find(".section\t.text.first").expect("a section");
        assert!(opened < text.find("\nfirst:\n").expect("a label"), "{text}");
        // And one text section when nothing asked, which is the default.
        let plain = write(|_, _| {});
        assert!(!plain.contains(".text."), "{plain}");
    }

    /// Mach-O takes the flag and writes what it wrote before, because every Mach-O object ends
    /// with `.subsections_via_symbols` and so already tells the linker it may split a section at
    /// each symbol and drop the parts nothing reaches. Clang does the same on an Apple target.
    #[test]
    fn a_format_that_already_lets_the_linker_split_a_section_is_not_asked_to_split_it_again() {
        let text = split_code("first", "second", Os::Darwin);
        assert!(text.contains("\t.subsections_via_symbols\n"), "{text}");
        assert_eq!(text.matches(".section").count(), 1, "the one it opens with: {text}");
        let vars = vec![var("counter", Place::Written, vec![Piece::Scalar(vec![1, 0, 0, 0])])];
        assert_eq!(split(vars.clone(), Os::Darwin), data(vars, Os::Darwin));
    }

    /// The listing half of `-fdata-sections`, where the name of the section is the name of the one
    /// it came out of with the variable's name after it. That is what gcc writes, and the part in
    /// front of the dot is what a linker script and `--gc-sections` both match on.
    #[test]
    fn every_variable_gets_a_section_named_after_it_when_that_is_what_was_asked_for() {
        let vars = vec![
            var("g", Place::Written, vec![Piece::Scalar(vec![1, 0, 0, 0])]),
            var("z", Place::Zero, vec![Piece::Zero(4)]),
            var("r", Place::ReadOnly, vec![Piece::Scalar(vec![3, 0, 0, 0])]),
        ];
        let text = split(vars.clone(), Os::Linux);
        assert!(text.contains("\t.section\t.data.g,\"aw\"\n\t.globl\tg\n"), "{text}");
        assert!(text.contains("\t.section\t.bss.z,\"aw\",@nobits\n"), "{text}");
        assert!(text.contains("\t.section\t.rodata.r,\"a\"\n"), "{text}");
        // Everything else about the variable is what it was: splitting moves which section header
        // the name is in and must not change the image, the size or who can see it.
        assert!(text.contains("\ng:\n\t.long\t1\n"), "{text}");
        assert!(text.contains("\t.size\tg, .-g\n"), "{text}");
        assert!(text.contains("\t.space\t4\n"), "{text}");
        // And the flag reaches the data without reaching the code, since gcc has two flags and a
        // build that asked for one of them measured something.
        assert!(!text.contains(".text."), "{text}");
        let plain = data(vars, Os::Linux);
        assert!(plain.contains("\t.data\n") && plain.contains("\t.bss\n"), "{plain}");
        assert!(!plain.contains(".data.g"), "{plain}");
    }

    #[test]
    fn the_object_format_decides_how_a_variable_is_written_as_much_as_a_function() {
        let text = data(vec![var("x", Place::Zero, vec![Piece::Zero(4)])], Os::Darwin);
        // Mach-O has no way to put bytes in its zero filled section, so a variable that goes
        // there is asked for by size the way a tentative definition is on every format.
        // The directive is also the definition, so the binding goes above it or the variable is
        // one no other file can find.
        assert!(text.contains("\t.globl\t_x\n\t.zerofill\t__DATA,__bss,_x,4,2\n"), "{text}");
        let read_only = data(vec![var("x", Place::ReadOnly, vec![Piece::Zero(4)])], Os::Darwin);
        assert!(read_only.contains("\t.section\t__TEXT,__const\n"), "{read_only}");
        assert!(read_only.contains("\n_x:\n"), "the underscore, without which nothing links");
    }

    #[test]
    fn a_run_of_bytes_is_written_so_that_it_reads_back_as_the_same_bytes() {
        let bytes = Piece::Bytes(b"a\"b\\\n\0\x801".to_vec());
        let text = data(vec![var("s", Place::ReadOnly, vec![bytes])], Os::Linux);
        // Three octal digits every time, so that the digit after an escape is not read as part
        // of it, and the quote and the backslash escaped so the string ends where it should.
        assert!(text.contains("\t.ascii\t\"a\\\"b\\\\\\012\\000\\2001\"\n"), "{text}");
    }

    #[test]
    fn the_address_of_a_name_in_an_image_is_written_as_the_name() {
        let addr = Piece::Addr { symbol: "y".to_owned(), addend: 16, bytes: 8 };
        let text = data(vec![var("p", Place::Written, vec![addr])], Os::Linux);
        assert!(text.contains("\np:\n\t.quad\ty+16\n"), "{text}");
    }

    #[test]
    fn a_distance_in_an_image_is_written_as_the_name_less_where_it_is() {
        let away = Piece::Away { symbol: "y".to_owned(), addend: 0 };
        let text = data(vec![var("d", Place::ReadOnly, vec![away])], Os::Linux);
        assert!(text.contains("\nd:\n\t.long\ty - .\n"), "{text}");

        let away = Piece::Away { symbol: "y".to_owned(), addend: -3 };
        let text = data(vec![var("d", Place::ReadOnly, vec![away])], Os::Linux);
        assert!(text.contains("\nd:\n\t.long\ty-3 - .\n"), "{text}");
    }

    #[test]
    fn a_distance_between_two_labels_is_written_as_one_less_the_other() {
        let piece = |addend, bytes| Piece::Apart {
            to: ".Llbl.1".to_owned(),
            from: ".Llbl.0".to_owned(),
            addend,
            bytes,
        };
        let text = data(vec![var("b", Place::ReadOnly, vec![piece(0, 4)])], Os::Linux);
        assert!(text.contains("\nb:\n\t.long\t.Llbl.1-.Llbl.0\n"), "{text}");

        let text = data(vec![var("b", Place::ReadOnly, vec![piece(-2, 2)])], Os::Linux);
        assert!(text.contains("\nb:\n\t.short\t.Llbl.1-.Llbl.0-2\n"), "{text}");
    }

    #[test]
    fn a_machine_with_no_writer_here_is_said_so_rather_than_written_as_x86_64() {
        let names = Interner::new();
        let riscv = TargetInfo::new(Triple::new(Arch::Riscv64, Os::Linux, Env::Gnu));
        let error = print(&[], &Globals::default(), &[], &names, &riscv, true, Output::default())
            .expect_err("no writer");
        assert!(matches!(error, Error::Machine { .. }), "{error:?}");
    }

    /// One AArch64 function of one block, with those instructions in it, written out.
    fn write_a64(build: impl FnOnce(&mut Func, &mut Interner)) -> Result<String, Error> {
        let mut names = Interner::new();
        let mut func = Func::new(names.intern("f"));
        build(&mut func, &mut names);
        let target = TargetInfo::new(Triple::new(Arch::Aarch64, Os::Linux, Env::Gnu));
        print(&[func], &Globals::default(), &[], &names, &target, true, Output::default())
    }

    #[test]
    fn an_aarch64_instruction_is_written_the_way_its_own_table_says() {
        use rucc_target::aarch64::{self, x};
        let text = write_a64(|func, names| {
            let block = func.create_block();
            let add = Opcode::new(names.intern("a64.add_rr_32"));
            func.build(block, add)
                .operand(Operand::write(Reg::physical(x(0)), aarch64::GPR))
                .operand(Operand::read(Reg::physical(x(1)), aarch64::GPR))
                .operand(Operand::read(Reg::physical(x(2)), aarch64::GPR))
                .finish();
            let load = Opcode::new(names.intern("a64.ldr_64"));
            let base = Operand::read(Reg::physical(aarch64::SP), aarch64::GPR);
            func.build(block, load)
                .operand(Operand::write(Reg::physical(x(3)), aarch64::GPR))
                .mem(Mem::at(base).plus(16))
                .finish();
        })
        .expect("an allocated function");
        // Destination first, which is the order the operands are in already, and the stack
        // pointer as `sp` because 31 in a base is never the zero register.
        assert_eq!(body(&text), ["add w0, w1, w2", "ldr x3, [sp, #16]"]);
        // Padded by the assembler's own `nop`, since `0x90` is not an instruction here.
        assert!(text.contains("\t.p2align\t4\n"), "{text}");
        assert!(!text.contains("0x90"), "{text}");
    }

    #[test]
    fn an_aarch64_register_left_virtual_is_refused() {
        let error = write_a64(|func, names| {
            let block = func.create_block();
            let mov = Opcode::new(names.intern("a64.mov_rr_64"));
            let class = aarch64::GPR;
            let v0 = func.new_vreg(class);
            let v1 = func.new_vreg(class);
            func.build(block, mov)
                .operand(Operand::write(v0, class))
                .operand(Operand::read(v1, class))
                .finish();
        })
        .expect_err("a register was never allocated");
        assert!(matches!(error, Error::Virtual { .. }), "{error:?}");
    }

    #[test]
    fn an_aarch64_access_through_an_index_shifts_it_by_the_size() {
        use rucc_target::aarch64::{self, x};
        let text = write_a64(|func, names| {
            let block = func.create_block();
            let store = Opcode::new(names.intern("a64.str_32"));
            let base = Operand::read(Reg::physical(x(0)), aarch64::GPR);
            let index = Operand::read(Reg::physical(x(2)), aarch64::GPR);
            func.build(block, store)
                .operand(Operand::read(Reg::physical(x(3)), aarch64::GPR))
                .mem(Mem::at(base).indexed(index, 4))
                .finish();
            let load = Opcode::new(names.intern("a64.ldr_64"));
            func.build(block, load)
                .operand(Operand::write(Reg::physical(x(1)), aarch64::GPR))
                .mem(Mem::at(base).indexed(index, 1))
                .finish();
        })
        .expect("an allocated function");
        assert_eq!(body(&text), ["str w3, [x0, x2, lsl #2]", "ldr x1, [x0, x2]"]);
    }

    #[test]
    fn an_aarch64_offset_the_encoder_refuses_is_not_written() {
        use rucc_target::aarch64::{self, x};
        let error = write_a64(|func, names| {
            let block = func.create_block();
            let load = Opcode::new(names.intern("a64.ldr_64"));
            let base = Operand::read(Reg::physical(x(0)), aarch64::GPR);
            func.build(block, load)
                .operand(Operand::write(Reg::physical(x(1)), aarch64::GPR))
                .mem(Mem::at(base).plus(1 << 20))
                .finish();
        })
        .expect_err("an offset no load can hold");
        assert!(matches!(error, Error::Encode { .. }), "{error:?}");
    }

    #[test]
    fn an_opcode_aarch64_does_not_have_is_refused_rather_than_written_as_x86() {
        let error = write_a64(|func, names| {
            let block = func.create_block();
            func.build(block, Opcode::new(names.intern("x64.ret"))).finish();
        })
        .expect_err("not an AArch64 opcode");
        assert!(matches!(error, Error::Opcode { .. }), "{error:?}");
    }

    #[test]
    fn the_head_of_a_loop_is_asked_to_stay_inside_one_line() {
        let mut names = Interner::new();
        let mut func = Func::new(names.intern("f"));
        func.create_block();
        let head = func.create_block();
        let jmp = Opcode::new(names.intern("x64.jmp"));
        func.build(head, jmp).finish();
        func.succs_mut(head).push(rucc_mir::BlockCall::to(head));
        func.heads = vec![head];
        let text = print(
            &[func],
            &Globals::default(),
            &[],
            &names,
            &target(Os::Linux),
            true,
            Output::default(),
        )
        .expect("a function with a loop in it");
        // The loop is the jump back to itself, five bytes, so it crosses a line only when it
        // starts in the last four bytes of one.
        let wanted = "\n.Lf_0:\n\t.p2align\t6,,4\n.Lf_1:\n";
        assert!(text.contains(wanted), "{text}");
    }
}