|
| | function_item_iterator_t () |
| | function_item_iterator_t (ea_t func_ea, ea_t ea=BADADDR) |
| bool | set (ea_t func_ea, ea_t ea=BADADDR) |
| | Set a function range. if func_ea == BADADDR then a segment range will be set.
|
| bool | set_range (ea_t ea1, ea_t ea2) |
| | Set an arbitrary range.
|
| bool | first () |
| bool | last () |
| ea_t | current () const |
| bool | set_ea (ea_t ea) |
| void | chunk (range_t *out) const |
| bool | next (testf_t *func, void *ud) |
| bool | prev (testf_t *func, void *ud) |
| bool | next_addr () |
| bool | next_head () |
| bool | next_code () |
| bool | next_data () |
| bool | next_not_tail () |
| bool | prev_addr () |
| bool | prev_head () |
| bool | prev_code () |
| bool | prev_data () |
| bool | prev_not_tail () |
| bool | decode_prev_insn (insn_t *out) |
| bool | decode_preceding_insn (eavec_t *visited, bool *p_farref, insn_t *out) |
| bool | succ (testf_t *func, void *ud) |
| | Similar to next(), but succ() iterates the chunks from low to high addresses, while next() iterates through chunks starting at the function entry chunk.
|
| bool | succ_code () |
Class to enumerate all function instructions and data sorted by addresses.
The function entry chunk items are enumerated first regardless of their addresses
Sample code:
ea_t current() const
Definition funcs.hpp:1954
bool next_addr()
Definition funcs.hpp:1965
function_item_iterator_t()
Definition funcs.hpp:1925
bool set(ea_t func_ea, ea_t ea=BADADDR)
Set a function range. if func_ea == BADADDR then a segment range will be set.
Definition funcs.hpp:1928
bool ok
Definition kernwin.hpp:7410
If 'ea' is not specified in the call to set(), then the enumeration starts at the function entry point. If 'func_ea' is specified as BADADDR then the set() function will fail, but it is still possible to use the class. In this case the iteration will be limited by the segment boundaries. It is also possible to enumerate addresses in an arbitrary range using set_range().
