search
search.alignOnly catch aligned search hits Default is 0search.chunkChunk size for /+ (default size is asm.bits/8 Default is 0search.contiguousAccept contiguous/adjacent search hits Default is truesearch.distanceSearch string distance Default is 0search.esilcomboStop search after N consecutive hits Default is 8search.flagsAll search results are flagged, otherwise only printed Default is truesearch.fromSearch start address Default is 0xffffffffffffffff-
🚀
search.fromandsearch.tocan be used to set search boundaries. Helpful when searching inside a function only. asciinema
-
-
search.inSpecify 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.kwidxStore last search index count Default is 0 search.maxhitsMaximum number of hits (0 Default is 0search.overlapLook for overlapped search hits Default is falsesearch.prefixPrefix name in search hits label Default is hit-
🚀 Set the value of
search.prefixto 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.showShow search results Default is truesearch.toSearch 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