Struct gimli::UnwindTable
[−]
[src]
pub struct UnwindTable<'input, 'cie, 'fde, 'ctx, Endian, Section> where Endian: 'cie + 'fde + 'ctx + Endianity, Section: 'cie + 'fde + 'ctx + UnwindSection<'input, Endian>, 'input: 'cie + 'fde + 'ctx { /* fields omitted */ }The UnwindTable iteratively evaluates a FrameDescriptionEntry's
CallFrameInstruction program, yielding the each row one at a time.
6.4.1 Structure of Call Frame Information
DWARF supports virtual unwinding by defining an architecture independent basis for recording how procedures save and restore registers during their lifetimes. This basis must be augmented on some machines with specific information that is defined by an architecture specific ABI authoring committee, a hardware vendor, or a compiler producer. The body defining a specific augmentation is referred to below as the “augmenter.”
Abstractly, this mechanism describes a very large table that has the following structure:
LOC CFA R0 R1 ... RN L0 L1 ... LN The first column indicates an address for every location that contains code in a program. (In shared objects, this is an object-relative offset.) The remaining columns contain virtual unwinding rules that are associated with the indicated location.
The CFA column defines the rule which computes the Canonical Frame Address value; it may be either a register and a signed offset that are added together, or a DWARF expression that is evaluated.
The remaining columns are labeled by register number. This includes some registers that have special designation on some architectures such as the PC and the stack pointer register. (The actual mapping of registers for a particular architecture is defined by the augmenter.) The register columns contain rules that describe whether a given register has been saved and the rule to find the value for the register in the previous frame.
...
This table would be extremely large if actually constructed as described. Most of the entries at any point in the table are identical to the ones above them. The whole table can be represented quite compactly by recording just the differences starting at the beginning address of each subroutine in the program.
Methods
impl<'input, 'fde, 'ctx, Endian, Section> UnwindTable<'input, 'fde, 'fde, 'ctx, Endian, Section> where Endian: Endianity, Section: UnwindSection<'input, Endian>[src]
fn new(ctx: &'ctx mut InitializedUnwindContext<'input, Endian, Section>,
fde: &'fde FrameDescriptionEntry<'input, Endian, Section>)
-> UnwindTable<'input, 'fde, 'fde, 'ctx, Endian, Section>
fde: &'fde FrameDescriptionEntry<'input, Endian, Section>)
-> UnwindTable<'input, 'fde, 'fde, 'ctx, Endian, Section>
Construct a new UnwindTable for the given
FrameDescriptionEntry's CFI unwinding program.
impl<'input, 'cie, 'fde, 'ctx, Endian, Section> UnwindTable<'input, 'cie, 'fde, 'ctx, Endian, Section> where Endian: Endianity, Section: UnwindSection<'input, Endian>[src]
fn next_row(&mut self) -> Result<Option<&UnwindTableRow<'input, Endian>>>
Evaluate call frame instructions until the next row of the table is completed, and return it.
Unfortunately, this cannot be used with FallibleIterator because of
the restricted lifetime of the yielded item.