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, 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. A build that turns the
95    /// table off, which is a kernel or a freestanding image, leaves a reader with nothing to
96    /// evaluate the operation against, so the attribute is left off there rather than written as
97    /// something no debugger can follow. The locations that would be measured from it are left off
98    /// with it.
99    pub frames: bool,
100}
101
102/// One function: where each of its instructions came from, and what it is.
103#[derive(Debug, Clone, Default, PartialEq, Eq)]
104pub struct Function {
105    /// Its name, as the C program spelled it, which is what a relocation here asks the linker for.
106    pub name: String,
107    /// How many bytes of instructions it is.
108    pub len: u64,
109    /// The rows, in increasing order of address.
110    pub rows: Vec<Row>,
111    /// Where it was declared, and nothing when that is not known.
112    pub decl: Option<Place>,
113    /// What it takes and gives back, and [`None`] when this compiler cannot yet say.
114    ///
115    /// A function with nothing here gets no entry in `.debug_info` at all, for the reason in the
116    /// `tree.rs` module documentation: an entry with no return type is an entry saying `void`, so
117    /// half an answer here is a wrong one rather than a partial one.
118    pub sig: Option<Sig>,
119    /// Whether anything outside this unit can see it, which is the opposite of `static`.
120    pub external: bool,
121    /// The locals lowering gave a frame slot, in the order the slots were asked for, which is the
122    /// order they were declared in.
123    ///
124    /// Parameters are not among them, whether or not they have a slot. See [`Local`].
125    pub locals: Vec<Local>,
126}
127
128/// One row of the table: an address, and where the code at it came from.
129#[derive(Debug, Clone, Copy, Default, PartialEq, Eq)]
130pub struct Row {
131    /// How far into its function the instruction is.
132    pub at: u64,
133    /// Which of [`Unit::files`] it is in.
134    pub file: usize,
135    /// Which line of that file, counting from one, or zero for code no line of any file asked for.
136    ///
137    /// Zero is DWARF's own spelling of that and is worth more than a guess: a debugger stepping
138    /// over a row with no line knows not to stop, where one handed the nearest line it could find
139    /// would stop somewhere the program never was.
140    pub line: u32,
141    /// Which column of that line, counting from one, or zero for the left edge.
142    pub column: u32,
143}
144
145/// What went wrong while the sections were being built.
146#[derive(Debug, Clone, PartialEq, Eq)]
147pub enum Error {
148    /// The DWARF writer refused something, which is a bug here rather than in a program.
149    Refused {
150        /// What it said, already formatted.
151        why: String,
152    },
153}
154
155impl std::fmt::Display for Error {
156    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
157        match self {
158            Error::Refused { why } => {
159                write!(f, "the debug writer refused what it was given: {why}")
160            }
161        }
162    }
163}
164
165impl std::error::Error for Error {}
166
167/// One section of DWARF being written, and the relocations found while writing it.
168///
169/// The writer underneath hands a relocation over the moment it writes the hole rather than at the
170/// end, because the hole's offset is the length of what it has written so far, so this has to be
171/// one type rather than bytes now and relocations later.
172#[derive(Debug, Clone)]
173struct Section {
174    bytes: gimli::write::EndianVec<gimli::LittleEndian>,
175    relocs: Vec<gimli::write::Relocation>,
176}
177
178impl Default for Section {
179    fn default() -> Self {
180        Self { bytes: gimli::write::EndianVec::new(gimli::LittleEndian), relocs: Vec::new() }
181    }
182}
183
184impl gimli::write::RelocateWriter for Section {
185    type Writer = gimli::write::EndianVec<gimli::LittleEndian>;
186
187    fn writer(&self) -> &Self::Writer {
188        &self.bytes
189    }
190
191    fn writer_mut(&mut self) -> &mut Self::Writer {
192        &mut self.bytes
193    }
194
195    fn relocate(&mut self, relocation: gimli::write::Relocation) {
196        self.relocs.push(relocation);
197    }
198}
199
200/// The sections a unit's debug information goes in.
201///
202/// The result is empty when nothing in the unit has a row, which is a file of declarations and a
203/// file whose every function was dropped. An empty `.debug_line` is worse than no section at all,
204/// since a reader would find a unit covering no addresses and have to decide what that meant.
205///
206/// # Errors
207///
208/// [`Error::Refused`] for anything the DWARF writer objected to. Every value it is handed here came
209/// out of this compiler, so that is a bug here rather than a program's mistake.
210pub fn write(unit: &Unit) -> Result<Info, Error> {
211    if unit.funcs.iter().all(|func| func.rows.is_empty()) {
212        return Ok(Info::default());
213    }
214    let encoding =
215        gimli::Encoding { format: gimli::Format::Dwarf32, version: 5, address_size: unit.pointer };
216    let mut dwarf = gimli::write::DwarfUnit::new(encoding);
217    let dir = text(&unit.dir, encoding, &mut dwarf.line_strings);
218    let name = text(&unit.name, encoding, &mut dwarf.line_strings);
219    let mut program =
220        gimli::write::LineProgram::new(encoding, gimli::LineEncoding::default(), dir, name, None);
221    // Every file the rows name, under the directory above. The name is written whole rather than
222    // split into a directory and a base, which is legal and is not what gcc does: a reader joins
223    // the two only when the file is relative, so a whole name is one the reader takes as it stands.
224    // Splitting would buy a shorter table on a project whose files share directories and would put
225    // a second place in here where a path is taken apart.
226    let under = program.default_directory();
227    let files: Vec<gimli::write::FileId> = unit
228        .files
229        .iter()
230        .map(|file| {
231            let file = text(file, encoding, &mut dwarf.line_strings);
232            program.add_file(file, under, None)
233        })
234        .collect();
235    for (index, func) in unit.funcs.iter().enumerate() {
236        if func.rows.is_empty() {
237            continue;
238        }
239        program.begin_sequence(Some(gimli::write::Address::Symbol { symbol: index, addend: 0 }));
240        // A row that says what the row before it said is a row a reader would read and discard, so
241        // it is left out. That is most of them: a line of C is several instructions and every one
242        // of them carries the same span.
243        let mut said: Option<(usize, u32, u32)> = None;
244        for row in &func.rows {
245            let now = (row.file, row.line, row.column);
246            if said == Some(now) {
247                continue;
248            }
249            said = Some(now);
250            let Some(&file) = files.get(row.file) else {
251                let why = format!("row at {} names file {}, which is not one", row.at, row.file);
252                return Err(Error::Refused { why });
253            };
254            let state = program.row();
255            state.address_offset = row.at;
256            state.file = file;
257            state.line = u64::from(row.line);
258            state.column = u64::from(row.column);
259            // Every row is somewhere a breakpoint may attach, because at this optimization level
260            // every row is the start of a statement or is code with no statement to be the start
261            // of, and the second kind carries line zero and is not a place a debugger stops.
262            state.is_statement = true;
263            program.generate_row();
264        }
265        program.end_sequence(func.len);
266    }
267    let ranges = unit
268        .funcs
269        .iter()
270        .enumerate()
271        .filter(|(_, func)| !func.rows.is_empty())
272        .map(|(index, func)| gimli::write::Range::StartLength {
273            begin: gimli::write::Address::Symbol { symbol: index, addend: 0 },
274            length: func.len,
275        })
276        .collect();
277    dwarf.unit.line_program = program;
278    let covers = dwarf.unit.ranges.add(gimli::write::RangeList(ranges));
279    let root = dwarf.unit.root();
280    let producer = text(&unit.producer, encoding, &mut dwarf.line_strings);
281    let name = text(&unit.name, encoding, &mut dwarf.line_strings);
282    let dir = text(&unit.dir, encoding, &mut dwarf.line_strings);
283    let root = dwarf.unit.get_mut(root);
284    root.set(gimli::DW_AT_producer, gimli::write::AttributeValue::LineStringRef(held(producer)?));
285    root.set(gimli::DW_AT_language, gimli::write::AttributeValue::Language(gimli::DW_LANG_C11));
286    root.set(gimli::DW_AT_name, gimli::write::AttributeValue::LineStringRef(held(name)?));
287    root.set(gimli::DW_AT_comp_dir, gimli::write::AttributeValue::LineStringRef(held(dir)?));
288    root.set(gimli::DW_AT_stmt_list, gimli::write::AttributeValue::LineProgramRef);
289    root.set(gimli::DW_AT_ranges, gimli::write::AttributeValue::RangeListRef(covers));
290    tree::describe(&mut dwarf, &unit.types, &files, &unit.funcs, &unit.globals, unit.frames)?;
291    let mut sections = gimli::write::Sections::new(Section::default());
292    dwarf.write(&mut sections).map_err(refused)?;
293    let mut info = Info::default();
294    // One index space over both lists, the functions first. `gimli` calls a relocation target a
295    // symbol number and leaves it to the caller to say what a number means, and what one means here
296    // is a position in this: the line table and a subprogram's low PC ask for a function, and a
297    // variable's location asks for a variable.
298    let named = |target: gimli::write::RelocationTarget| match target {
299        gimli::write::RelocationTarget::Symbol(index) => match unit.funcs.get(index) {
300            Some(func) => func.name.clone(),
301            None => unit.globals[index - unit.funcs.len()].name.clone(),
302        },
303        gimli::write::RelocationTarget::Section(id) => id.name().to_owned(),
304    };
305    sections.for_each(|id, section| {
306        if section.bytes.slice().is_empty() {
307            return Ok(());
308        }
309        let relocs = section
310            .relocs
311            .iter()
312            .map(|reloc| Reloc {
313                at: reloc.offset,
314                symbol: named(reloc.target),
315                kind: Reference::Address { bytes: reloc.size },
316                addend: reloc.addend,
317                after: 0,
318            })
319            .collect();
320        info.chunks.push(Chunk {
321            name: id.name().to_owned(),
322            bytes: section.bytes.slice().to_vec(),
323            relocs,
324        });
325        Ok::<(), Error>(())
326    })?;
327    Ok(info)
328}
329
330/// A string as the line program writes one, which is a reference into `.debug_line_str`.
331///
332/// Every string here goes in that section rather than in `.debug_str` or inline, because the file
333/// and directory tables of a DWARF 5 line program can reach it and the unit's own attributes can
334/// too, so one section holds all of them and a name that appears in both is written once.
335fn text(
336    val: &str,
337    encoding: gimli::Encoding,
338    strings: &mut gimli::write::LineStringTable,
339) -> gimli::write::LineString {
340    // A null byte in a path is not something a file system hands back and is something the writer
341    // underneath panics on, so it is taken out rather than passed through.
342    let val: Vec<u8> = val.bytes().filter(|&byte| byte != 0).collect();
343    gimli::write::LineString::new(val, encoding, strings)
344}
345
346/// The identifier behind a string that went into `.debug_line_str`.
347///
348/// [`text`] answers with whichever form of string the encoding wanted, and for DWARF 5 that is
349/// always a reference into that section. An attribute has to name the reference rather than repeat
350/// the bytes, so this is where the one shape the encoding can produce is taken apart, and anything
351/// else is a disagreement between this function and that one rather than anything a caller did.
352fn held(string: gimli::write::LineString) -> Result<gimli::write::LineStringId, Error> {
353    match string {
354        gimli::write::LineString::LineStringRef(id) => Ok(id),
355        _ => Err(Error::Refused {
356            why: "a string meant for the line string section was written another way".to_owned(),
357        }),
358    }
359}
360
361/// What the DWARF writer said, as the one kind of news it can be here.
362fn refused(why: gimli::write::Error) -> Error {
363    Error::Refused { why: why.to_string() }
364}
365
366#[cfg(test)]
367mod tests {
368    use super::*;
369
370    /// A unit with one function and two lines in it.
371    fn one() -> Unit {
372        Unit {
373            name: "a.c".to_owned(),
374            dir: "/tmp".to_owned(),
375            producer: "rucc".to_owned(),
376            files: vec!["a.c".to_owned()],
377            types: Vec::new(),
378            funcs: vec![Function {
379                name: "f".to_owned(),
380                len: 16,
381                rows: vec![
382                    Row { at: 0, file: 0, line: 3, column: 1 },
383                    Row { at: 8, file: 0, line: 4, column: 5 },
384                ],
385                ..Function::default()
386            }],
387            globals: Vec::new(),
388            pointer: 8,
389            frames: true,
390        }
391    }
392
393    /// The sections that come out, and that each of them has something in it.
394    ///
395    /// Four rather than two, because a line table nothing can find is a section no reader opens.
396    /// The unit in `.debug_info` is what a reader walks to reach the program, the abbreviation in
397    /// `.debug_abbrev` is what that unit is written against, and the strings are in
398    /// `.debug_line_str` because both the unit and the program's own tables name them.
399    #[test]
400    fn a_unit_with_rows_writes_the_four_sections_a_reader_needs() {
401        let info = write(&one()).expect("sections");
402        let names: Vec<&str> = info.chunks.iter().map(|chunk| chunk.name.as_str()).collect();
403        assert_eq!(
404            names,
405            [".debug_abbrev", ".debug_line_str", ".debug_line", ".debug_rnglists", ".debug_info"]
406        );
407        assert!(info.chunks.iter().all(|chunk| !chunk.bytes.is_empty()));
408    }
409
410    /// Where a function is is the one number no compilation knows, so every sequence asks for it.
411    ///
412    /// The relocation names the function rather than the section it is in, because under
413    /// `-ffunction-sections` the section is the function's own and under anything else the object
414    /// writer is the one that knows where in the text it landed. The others in the same section are
415    /// the header naming its own strings, which is the other thing only a linker can resolve.
416    #[test]
417    fn a_sequence_asks_the_linker_where_its_function_went() {
418        let info = write(&one()).expect("sections");
419        let line = info.chunks.iter().find(|chunk| chunk.name == ".debug_line").expect("a table");
420        let address = line.relocs.iter().find(|reloc| reloc.symbol == "f").expect("an address");
421        assert_eq!(address.kind, Reference::Address { bytes: 8 });
422        assert_eq!(address.addend, 0);
423        // The rest are the header's own, and they are section offsets rather than addresses: a
424        // directory and a file name in DWARF 5 are written as a place in `.debug_line_str`.
425        let rest = line.relocs.iter().filter(|reloc| reloc.symbol != "f");
426        assert!(rest.clone().count() > 0);
427        assert!(rest.clone().all(|reloc| reloc.symbol == ".debug_line_str"));
428        assert!(rest.clone().all(|reloc| reloc.kind == Reference::Address { bytes: 4 }));
429    }
430
431    /// A file with nothing to say writes no sections rather than empty ones.
432    #[test]
433    fn a_unit_with_no_rows_writes_nothing() {
434        let mut unit = one();
435        unit.funcs[0].rows.clear();
436        assert_eq!(write(&unit).expect("sections"), Info::default());
437    }
438
439    /// A row naming a file the unit does not have is refused rather than written as something else.
440    #[test]
441    fn a_row_naming_a_file_that_is_not_there_is_refused() {
442        let mut unit = one();
443        unit.funcs[0].rows[1].file = 7;
444        assert!(write(&unit).is_err());
445    }
446}