Struct goblin::mach::symbols::Symbols

pub struct Symbols<'a> { /* fields omitted */ }

A zero-copy “nlist” style symbol table (“stab”), including the string table

Implementations

impl<'a> Symbols<'a>

pub fn new(
    bytes: &'a [u8],
    start: usize,
    count: usize,
    strtab: usize
) -> Result<Symbols<'a>>

Creates a new symbol table with count elements, from the start offset, using the string table at strtab, with a default ctx. Beware, this will provide incorrect results if you construct this on a 32-bit mach binary, using a 64-bit machine; use parse instead if you want 32/64 bit support

pub fn parse(
    bytes: &'a [u8],
    symtab: &SymtabCommand,
    ctx: Ctx
) -> Result<Symbols<'a>>

pub fn iter(&self) -> SymbolIterator<'a>

pub fn get(&self, index: usize) -> Result<(&'a str, Nlist)>

Parses a single Nlist symbol from the binary, with its accompanying name

Trait Implementations

impl<'a> Debug for Symbols<'a>

fn fmt(&self, fmt: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<'a, 'b> IntoIterator for &'b Symbols<'a>

type Item = <SymbolIterator<'a> as Iterator>::Item

The type of the elements being iterated over.

type IntoIter = SymbolIterator<'a>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<'a, T: ?Sized> TryFromCtx<'a, SymbolsCtx, T> for Symbols<'a> where
    T: AsRef<[u8]>, 

type Error = Error

fn try_from_ctx(bytes: &'a T, _: SymbolsCtx) -> Result<(Self, usize)>