search
search.align
Only catch aligned search hits Default is 0search.chunk
Chunk size for /+ (default size is asm.bits/8 Default is 0search.contiguous
Accept contiguous/adjacent search hits Default is truesearch.distance
Search string distance Default is 0search.esilcombo
Stop search after N consecutive hits Default is 8search.flags
All search results are flagged, otherwise only printed Default is truesearch.from
Search start address Default is 0xffffffffffffffff-
🚀
search.from
andsearch.to
can be used to set search boundaries. Helpful when searching inside a function only. asciinema
-
-
search.in
Specify search boundaries Default is io.maps-
Example:
e search.in = dbg.maps
-
To see available options, use
e search.in=?
Available sections are: - raw - block - bin.sections - io.map - io.maps - io.sections - io.sections.write - io.sections.exec - io.sections.readonly - dbg.stack - dbg.heap - dbg.map - dbg.maps - dbg.maps.exec - dbg.maps.write - dbg.maps.readonly - anal.fcn - anal .bb
-
-
search.kwidx
Store last search index count Default is 0 search.maxhits
Maximum number of hits (0 Default is 0search.overlap
Look for overlapped search hits Default is falsesearch.prefix
Prefix name in search hits label Default is hit-
🚀 Set the value of
search.prefix
to group different searches together. This is helpful when a binary can contain many different searches, and reduces confusion when looking through the results of different searches. asciinema
-
search.show
Show search results Default is truesearch.to
Search end address Default is 0xffffffffffffffff
search.align search.chunk search.contiguous search.distance search.esilcombo search.flags search.from search.in search.kwidx search.maxhits search.overlap search.prefix search.show search.to