Skip to main content

rucc_debug/
line.rs

1//! The line table, as the bytes of the sections it goes in.
2//!
3//! Design: `spec/11-asm-objects-debug.md` section 11.4.
4//!
5//! A line table answers one question: given an address in the program, which line of which file was
6//! the compiler writing code for when it produced the instruction there. Everything else DWARF
7//! describes is about what the program means, and this is about where it came from, which is why it
8//! is a table of its own rather than an attribute on something.
9//!
10//! # Why this is the first part written
11//!
12//! Because of what a safety report is. The monitor's descriptor carries a judgement, a class, an
13//! access size and a program counter, and `spec/safe-memory/06-instrumentation.md` section 6.5
14//! deliberately keeps the source location out of it so that a compiler does not ship two line
15//! tables that can come to disagree. That is the right design and it only pays when there is one
16//! line table, and until now there was none, so every report from a corpus run had to be read
17//! backwards out of a disassembly. On a quarter of a million lines of SQLite that is the difference
18//! between a minute and an afternoon per shape.
19//!
20//! # What is here
21//!
22//! The line number program, in `.debug_line`, with the file and directory tables DWARF 5 puts in
23//! its header, and the strings those tables name, in `.debug_line_str`. Beside them the smallest
24//! compilation unit that makes them findable: one `DW_TAG_compile_unit` in `.debug_info` with the
25//! producer, the name of the file, the directory the compiler ran in, a `DW_AT_stmt_list` pointing
26//! at the program and a `DW_AT_ranges` saying which addresses this unit covers, and the
27//! abbreviation it is written against in `.debug_abbrev`. A reader handed an address walks the
28//! units, and a unit with no entry in `.debug_info` is a unit nothing walks, so the table alone
29//! would have been a section no tool reads.
30//!
31//! The ranges are a list with one entry per function rather than a low and a high address over the
32//! whole unit. Under `-ffunction-sections` each function is a section of its own and the linker may
33//! place them anywhere and drop the ones nothing reaches, so there is no single span that covers
34//! them, and writing one would be writing down something that is true of the object and false of
35//! the program.
36//!
37//! # What is not here
38//!
39//! What the program means is in `tree.rs` and goes in the same unit: the types, the functions and
40//! the variables the unit defines at file scope, which is what a debugger reads a value through.
41//! Half the locals are there too, which is the ones lowering gave a frame slot, each a
42//! `DW_OP_fbreg` at an offset the frame layout worked out. The other half are held in SSA values
43//! and need a location list built over the register allocator's output, which is the rest of
44//! tamnd/rucc#9. What makes a location a different piece of work rather than more of this one is
45//! that it is checked differently: a line table is right or wrong against `addr2line` and a local's
46//! location is right or wrong against a debugger that stops in the middle of a function and prints
47//! it.
48//!
49//! One sequence per function, each beginning at that function's own symbol. A sequence is the unit
50//! of address ordering in a line program and its rows have to run forwards, so a table with one
51//! sequence over a section would be a table that breaks the moment two functions are laid out in an
52//! order the source did not have. One per function costs a `DW_LNE_set_address` and a relocation
53//! each and is correct under every combination of flags there is.
54
55use crate::shape::{Global, Local, Place, Scope, Shape, Sig};
56use crate::tree;
57
58use rucc_object::{Chunk, Info, Reference, Reloc};
59
60/// One compilation unit's worth of debug information.
61#[derive(Debug, Clone, Default, PartialEq, Eq)]
62pub struct Unit {
63    /// The file being compiled, as the command line spelled it, already prefix mapped.
64    pub name: String,
65    /// The directory the compiler was run in, already prefix mapped.
66    ///
67    /// This is `DW_AT_comp_dir`, and what it is for is that every relative name in the tables below
68    /// is relative to it. A build that cannot say where it ran writes a single dot, which is what
69    /// the tables are already relative to and is therefore the one answer that changes nothing.
70    pub dir: String,
71    /// What produced this, which is this compiler and its version.
72    pub producer: String,
73    /// Every file any row names, in the order the rows refer to them by.
74    pub files: Vec<String>,
75    /// Every type anything in the unit names, in the order they refer to them by.
76    ///
77    /// A table of indices rather than a tree, so that a type naming itself is an ordinary entry.
78    /// See [`Shape`] for what is in one and what is deliberately left out of one.
79    pub types: Vec<Shape>,
80    /// The functions, in the order the text section holds them.
81    pub funcs: Vec<Function>,
82    /// The file-scope variables this unit defines, in the order the object file holds them.
83    ///
84    /// Only the ones it defines. A name this unit declares and another one defines is a name the
85    /// linker resolves, so an entry for it here would be an entry whose address is somebody
86    /// else's, and a reader wanting the type of one reads the unit that has it.
87    pub globals: Vec<Global>,
88    /// How many bytes an address is on this target.
89    pub pointer: u8,
90    /// Whether this build writes a call frame table, which is what a frame base is resolved
91    /// through.
92    ///
93    /// A function's `DW_AT_frame_base` is `DW_OP_call_frame_cfa`, and what answers that operation
94    /// is the unwind table the build already writes for every function, or `.debug_frame` in a
95    /// build that turned the unwind table off, which is a kernel or a freestanding image. The
96    /// caller writes that section and says here whether it did. A build with neither leaves a
97    /// reader with nothing to evaluate the operation against, so the attribute is left off there
98    /// rather than written as something no debugger can follow. The locations that would be
99    /// measured from it are left off with it.
100    pub frames: bool,
101    /// Whether the unit goes in a Mach-O object.
102    ///
103    /// ld64 reads the unit's name and directory to write the map a debugger finds the object
104    /// through, and it reads them only from `.debug_str`. Given a reference into `.debug_line_str`
105    /// it leaves the object out of the map, or crashes, so on a Mac those three strings go where
106    /// clang puts them and the line program's own strings stay where they are.
107    pub mach_o: bool,
108}
109
110/// One function: where each of its instructions came from, and what it is.
111#[derive(Debug, Clone, Default, PartialEq, Eq)]
112pub struct Function {
113    /// Its name, as the C program spelled it, which is what a relocation here asks the linker for.
114    pub name: String,
115    /// How many bytes of instructions it is.
116    pub len: u64,
117    /// The rows, in increasing order of address.
118    pub rows: Vec<Row>,
119    /// Where it was declared, and nothing when that is not known.
120    pub decl: Option<Place>,
121    /// What it takes and gives back, and [`None`] when this compiler cannot yet say.
122    ///
123    /// A function with nothing here gets no entry in `.debug_info` at all, for the reason in the
124    /// `tree.rs` module documentation: an entry with no return type is an entry saying `void`, so
125    /// half an answer here is a wrong one rather than a partial one.
126    pub sig: Option<Sig>,
127    /// Whether anything outside this unit can see it, which is the opposite of `static`.
128    pub external: bool,
129    /// The locals lowering gave a frame slot, in the order the slots were asked for, which is the
130    /// order they were declared in.
131    ///
132    /// Parameters are not among them, whether or not they have a slot. See [`Local`].
133    pub locals: Vec<Local>,
134    /// The inner scopes of the function, each after the scope it is written inside.
135    ///
136    /// The function's own body is not one of them, for the reason [`Scope`] gives. A scope nothing
137    /// above names is written down anyway and costs nothing: an entry is only made for one that has
138    /// a local of its own or holds a scope that does.
139    pub scopes: Vec<Scope>,
140}
141
142/// One row of the table: an address, and where the code at it came from.
143#[derive(Debug, Clone, Copy, Default, PartialEq, Eq)]
144pub struct Row {
145    /// How far into its function the instruction is.
146    pub at: u64,
147    /// Which of [`Unit::files`] it is in.
148    pub file: usize,
149    /// Which line of that file, counting from one, or zero for code no line of any file asked for.
150    ///
151    /// Zero is DWARF's own spelling of that and is worth more than a guess: a debugger stepping
152    /// over a row with no line knows not to stop, where one handed the nearest line it could find
153    /// would stop somewhere the program never was.
154    pub line: u32,
155    /// Which column of that line, counting from one, or zero for the left edge.
156    pub column: u32,
157}
158
159/// What went wrong while the sections were being built.
160#[derive(Debug, Clone, PartialEq, Eq)]
161pub enum Error {
162    /// The DWARF writer refused something, which is a bug here rather than in a program.
163    Refused {
164        /// What it said, already formatted.
165        why: String,
166    },
167}
168
169impl std::fmt::Display for Error {
170    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
171        match self {
172            Error::Refused { why } => {
173                write!(f, "the debug writer refused what it was given: {why}")
174            }
175        }
176    }
177}
178
179impl std::error::Error for Error {}
180
181/// One section of DWARF being written, and the relocations found while writing it.
182///
183/// The writer underneath hands a relocation over the moment it writes the hole rather than at the
184/// end, because the hole's offset is the length of what it has written so far, so this has to be
185/// one type rather than bytes now and relocations later.
186#[derive(Debug, Clone)]
187struct Section {
188    bytes: gimli::write::EndianVec<gimli::LittleEndian>,
189    relocs: Vec<gimli::write::Relocation>,
190}
191
192impl Default for Section {
193    fn default() -> Self {
194        Self { bytes: gimli::write::EndianVec::new(gimli::LittleEndian), relocs: Vec::new() }
195    }
196}
197
198impl gimli::write::RelocateWriter for Section {
199    type Writer = gimli::write::EndianVec<gimli::LittleEndian>;
200
201    fn writer(&self) -> &Self::Writer {
202        &self.bytes
203    }
204
205    fn writer_mut(&mut self) -> &mut Self::Writer {
206        &mut self.bytes
207    }
208
209    fn relocate(&mut self, relocation: gimli::write::Relocation) {
210        self.relocs.push(relocation);
211    }
212}
213
214/// The sections a unit's debug information goes in.
215///
216/// The result is empty when nothing in the unit has a row, which is a file of declarations and a
217/// file whose every function was dropped. An empty `.debug_line` is worse than no section at all,
218/// since a reader would find a unit covering no addresses and have to decide what that meant.
219///
220/// # Errors
221///
222/// [`Error::Refused`] for anything the DWARF writer objected to. Every value it is handed here came
223/// out of this compiler, so that is a bug here rather than a program's mistake.
224pub fn write(unit: &Unit) -> Result<Info, Error> {
225    if unit.funcs.iter().all(|func| func.rows.is_empty()) {
226        return Ok(Info::default());
227    }
228    let encoding =
229        gimli::Encoding { format: gimli::Format::Dwarf32, version: 5, address_size: unit.pointer };
230    let mut dwarf = gimli::write::DwarfUnit::new(encoding);
231    let dir = text(&unit.dir, encoding, &mut dwarf.line_strings);
232    let name = text(&unit.name, encoding, &mut dwarf.line_strings);
233    let mut program =
234        gimli::write::LineProgram::new(encoding, gimli::LineEncoding::default(), dir, name, None);
235    // Every file the rows name, under the directory above. The name is written whole rather than
236    // split into a directory and a base, which is legal and is not what gcc does: a reader joins
237    // the two only when the file is relative, so a whole name is one the reader takes as it stands.
238    // Splitting would buy a shorter table on a project whose files share directories and would put
239    // a second place in here where a path is taken apart.
240    let under = program.default_directory();
241    let files: Vec<gimli::write::FileId> = unit
242        .files
243        .iter()
244        .map(|file| {
245            let file = text(file, encoding, &mut dwarf.line_strings);
246            program.add_file(file, under, None)
247        })
248        .collect();
249    for (index, func) in unit.funcs.iter().enumerate() {
250        if func.rows.is_empty() {
251            continue;
252        }
253        program.begin_sequence(Some(gimli::write::Address::Symbol { symbol: index, addend: 0 }));
254        // A row that says what the row before it said is a row a reader would read and discard, so
255        // it is left out. That is most of them: a line of C is several instructions and every one
256        // of them carries the same span.
257        let mut said: Option<(usize, u32, u32)> = None;
258        for row in &func.rows {
259            let now = (row.file, row.line, row.column);
260            if said == Some(now) {
261                continue;
262            }
263            said = Some(now);
264            let Some(&file) = files.get(row.file) else {
265                let why = format!("row at {} names file {}, which is not one", row.at, row.file);
266                return Err(Error::Refused { why });
267            };
268            let state = program.row();
269            state.address_offset = row.at;
270            state.file = file;
271            state.line = u64::from(row.line);
272            state.column = u64::from(row.column);
273            // Every row is somewhere a breakpoint may attach, because at this optimization level
274            // every row is the start of a statement or is code with no statement to be the start
275            // of, and the second kind carries line zero and is not a place a debugger stops.
276            state.is_statement = true;
277            program.generate_row();
278        }
279        program.end_sequence(func.len);
280    }
281    let ranges = unit
282        .funcs
283        .iter()
284        .enumerate()
285        .filter(|(_, func)| !func.rows.is_empty())
286        .map(|(index, func)| gimli::write::Range::StartLength {
287            begin: gimli::write::Address::Symbol { symbol: index, addend: 0 },
288            length: func.len,
289        })
290        .collect();
291    dwarf.unit.line_program = program;
292    let covers = dwarf.unit.ranges.add(gimli::write::RangeList(ranges));
293    let root = dwarf.unit.root();
294    let mut said = Vec::with_capacity(3);
295    for (attr, val) in [
296        (gimli::DW_AT_producer, &unit.producer),
297        (gimli::DW_AT_name, &unit.name),
298        (gimli::DW_AT_comp_dir, &unit.dir),
299    ] {
300        let val = if unit.mach_o {
301            let bytes: Vec<u8> = val.bytes().filter(|&byte| byte != 0).collect();
302            gimli::write::AttributeValue::StringRef(dwarf.strings.add(bytes))
303        } else {
304            let string = text(val, encoding, &mut dwarf.line_strings);
305            gimli::write::AttributeValue::LineStringRef(held(string)?)
306        };
307        said.push((attr, val));
308    }
309    let root = dwarf.unit.get_mut(root);
310    let mut said = said.into_iter();
311    if let Some((attr, val)) = said.next() {
312        root.set(attr, val);
313    }
314    root.set(gimli::DW_AT_language, gimli::write::AttributeValue::Language(gimli::DW_LANG_C11));
315    for (attr, val) in said {
316        root.set(attr, val);
317    }
318    root.set(gimli::DW_AT_stmt_list, gimli::write::AttributeValue::LineProgramRef);
319    root.set(gimli::DW_AT_ranges, gimli::write::AttributeValue::RangeListRef(covers));
320    tree::describe(&mut dwarf, &unit.types, &files, &unit.funcs, &unit.globals, unit.frames)?;
321    let mut sections = gimli::write::Sections::new(Section::default());
322    dwarf.write(&mut sections).map_err(refused)?;
323    let mut info = Info::default();
324    // One index space over both lists, the functions first. `gimli` calls a relocation target a
325    // symbol number and leaves it to the caller to say what a number means, and what one means here
326    // is a position in this: the line table and a subprogram's low PC ask for a function, and a
327    // variable's location asks for a variable.
328    let named = |target: gimli::write::RelocationTarget| match target {
329        gimli::write::RelocationTarget::Symbol(index) => match unit.funcs.get(index) {
330            Some(func) => func.name.clone(),
331            None => unit.globals[index - unit.funcs.len()].name.clone(),
332        },
333        gimli::write::RelocationTarget::Section(id) => id.name().to_owned(),
334    };
335    sections.for_each(|id, section| {
336        if section.bytes.slice().is_empty() {
337            return Ok(());
338        }
339        let relocs = section
340            .relocs
341            .iter()
342            .map(|reloc| Reloc {
343                at: reloc.offset,
344                symbol: named(reloc.target),
345                kind: Reference::Address { bytes: reloc.size },
346                addend: reloc.addend,
347                after: 0,
348            })
349            .collect();
350        info.chunks.push(Chunk {
351            name: id.name().to_owned(),
352            bytes: section.bytes.slice().to_vec(),
353            relocs,
354        });
355        Ok::<(), Error>(())
356    })?;
357    Ok(info)
358}
359
360/// A string as the line program writes one, which is a reference into `.debug_line_str`.
361///
362/// Every string here goes in that section rather than in `.debug_str` or inline, because the file
363/// and directory tables of a DWARF 5 line program can reach it and the unit's own attributes can
364/// too, so one section holds all of them and a name that appears in both is written once.
365fn text(
366    val: &str,
367    encoding: gimli::Encoding,
368    strings: &mut gimli::write::LineStringTable,
369) -> gimli::write::LineString {
370    // A null byte in a path is not something a file system hands back and is something the writer
371    // underneath panics on, so it is taken out rather than passed through.
372    let val: Vec<u8> = val.bytes().filter(|&byte| byte != 0).collect();
373    gimli::write::LineString::new(val, encoding, strings)
374}
375
376/// The identifier behind a string that went into `.debug_line_str`.
377///
378/// [`text`] answers with whichever form of string the encoding wanted, and for DWARF 5 that is
379/// always a reference into that section. An attribute has to name the reference rather than repeat
380/// the bytes, so this is where the one shape the encoding can produce is taken apart, and anything
381/// else is a disagreement between this function and that one rather than anything a caller did.
382fn held(string: gimli::write::LineString) -> Result<gimli::write::LineStringId, Error> {
383    match string {
384        gimli::write::LineString::LineStringRef(id) => Ok(id),
385        _ => Err(Error::Refused {
386            why: "a string meant for the line string section was written another way".to_owned(),
387        }),
388    }
389}
390
391/// What the DWARF writer said, as the one kind of news it can be here.
392fn refused(why: gimli::write::Error) -> Error {
393    Error::Refused { why: why.to_string() }
394}
395
396#[cfg(test)]
397mod tests {
398    use super::*;
399
400    /// A unit with one function and two lines in it.
401    fn one() -> Unit {
402        Unit {
403            name: "a.c".to_owned(),
404            dir: "/tmp".to_owned(),
405            producer: "rucc".to_owned(),
406            files: vec!["a.c".to_owned()],
407            types: Vec::new(),
408            funcs: vec![Function {
409                name: "f".to_owned(),
410                len: 16,
411                rows: vec![
412                    Row { at: 0, file: 0, line: 3, column: 1 },
413                    Row { at: 8, file: 0, line: 4, column: 5 },
414                ],
415                ..Function::default()
416            }],
417            globals: Vec::new(),
418            pointer: 8,
419            frames: true,
420            mach_o: false,
421        }
422    }
423
424    /// The sections that come out, and that each of them has something in it.
425    ///
426    /// Four rather than two, because a line table nothing can find is a section no reader opens.
427    /// The unit in `.debug_info` is what a reader walks to reach the program, the abbreviation in
428    /// `.debug_abbrev` is what that unit is written against, and the strings are in
429    /// `.debug_line_str` because both the unit and the program's own tables name them.
430    #[test]
431    fn a_unit_with_rows_writes_the_four_sections_a_reader_needs() {
432        let info = write(&one()).expect("sections");
433        let names: Vec<&str> = info.chunks.iter().map(|chunk| chunk.name.as_str()).collect();
434        assert_eq!(
435            names,
436            [".debug_abbrev", ".debug_line_str", ".debug_line", ".debug_rnglists", ".debug_info"]
437        );
438        assert!(info.chunks.iter().all(|chunk| !chunk.bytes.is_empty()));
439    }
440
441    /// Where a function is is the one number no compilation knows, so every sequence asks for it.
442    ///
443    /// The relocation names the function rather than the section it is in, because under
444    /// `-ffunction-sections` the section is the function's own and under anything else the object
445    /// writer is the one that knows where in the text it landed. The others in the same section are
446    /// the header naming its own strings, which is the other thing only a linker can resolve.
447    #[test]
448    fn a_sequence_asks_the_linker_where_its_function_went() {
449        let info = write(&one()).expect("sections");
450        let line = info.chunks.iter().find(|chunk| chunk.name == ".debug_line").expect("a table");
451        let address = line.relocs.iter().find(|reloc| reloc.symbol == "f").expect("an address");
452        assert_eq!(address.kind, Reference::Address { bytes: 8 });
453        assert_eq!(address.addend, 0);
454        // The rest are the header's own, and they are section offsets rather than addresses: a
455        // directory and a file name in DWARF 5 are written as a place in `.debug_line_str`.
456        let rest = line.relocs.iter().filter(|reloc| reloc.symbol != "f");
457        assert!(rest.clone().count() > 0);
458        assert!(rest.clone().all(|reloc| reloc.symbol == ".debug_line_str"));
459        assert!(rest.clone().all(|reloc| reloc.kind == Reference::Address { bytes: 4 }));
460    }
461
462    /// On a Mac the unit's own name, directory and producer are read from `.debug_str`, which is
463    /// the only place ld64 looks for them when it writes the map `dsymutil` follows to the object.
464    #[test]
465    fn a_mach_o_unit_names_itself_in_the_strings_ld64_reads() {
466        let unit = Unit { mach_o: true, ..one() };
467        let info = write(&unit).expect("sections");
468        let strings = info.chunks.iter().find(|chunk| chunk.name == ".debug_str").expect("strings");
469        for name in ["rucc", "a.c"] {
470            let held = format!("{name}\0");
471            assert!(strings.bytes.windows(held.len()).any(|at| at == held.as_bytes()), "{name}");
472        }
473        let unit = info.chunks.iter().find(|chunk| chunk.name == ".debug_info").expect("a unit");
474        assert!(unit.relocs.iter().all(|reloc| reloc.symbol != ".debug_line_str"));
475        assert!(unit.relocs.iter().any(|reloc| reloc.symbol == ".debug_str"));
476    }
477
478    /// A file with nothing to say writes no sections rather than empty ones.
479    #[test]
480    fn a_unit_with_no_rows_writes_nothing() {
481        let mut unit = one();
482        unit.funcs[0].rows.clear();
483        assert_eq!(write(&unit).expect("sections"), Info::default());
484    }
485
486    /// A row naming a file the unit does not have is refused rather than written as something else.
487    #[test]
488    fn a_row_naming_a_file_that_is_not_there_is_refused() {
489        let mut unit = one();
490        unit.funcs[0].rows[1].file = 7;
491        assert!(write(&unit).is_err());
492    }
493}