pub struct Info {
pub chunks: Vec<Chunk>,
}Expand description
The debug information, as the bytes of the sections it goes in.
Bytes rather than anything shaped like DWARF, for the reason Unwind is bytes: what a record
is is the format’s answer and the layer that knows what the program was doing is the one that
can say it, and what is left for the writer is where the sections go and what their relocations
are. The difference between the two is only that there are more than two sections here and that
their names are not the writer’s to choose, so each one carries its own.
Fields§
§chunks: Vec<Chunk>One entry per section that has anything in it, in the order they are to be written.
The order matters because a relocation in one of them can name another, and a name is resolved against the sections this file already has. Writing them in the order the producer hands them over keeps that a property of the list rather than of the writer.
Trait Implementations§
impl Eq for Info
impl StructuralPartialEq for Info
Auto Trait Implementations§
impl Freeze for Info
impl RefUnwindSafe for Info
impl Send for Info
impl Sync for Info
impl Unpin for Info
impl UnsafeUnpin for Info
impl UnwindSafe for Info
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key and return true if they are equal.