Description

Analysis that computes reachability of CFG vertices.

Certain CFG vertices are marked as intrinsically reachable, such as program entry points, exported functions, signal handlers, etc., and then reachability is propagated through the graph.

Definition at line 31 of file Reachability.h.

#include <Rose/BinaryAnalysis/Reachability.h>

Collaboration diagram for Rose::BinaryAnalysis::Reachability:

[legend]

Classes
struct	Settings
	Settings controlling the analysis. More...

Public Types
enum	Reason { NOT_REACHABLE = 0 , PROGRAM_ENTRY_POINT = 0x00000001 , EXPORTED_FUNCTION = 0x00000002 , SIGNAL_HANDLER = 0x00000004 , ASSUMED = 0x00000080 , EXPLICIT_MEM_CONSTANT = 0x00000100 , EXPLICIT_INSN_CONSTANT = 0x00000200 , IMPLICIT_FUNC_CONSTANT = 0x00000400 , USER_DEFINED_0 = 0x00010000 , USER_DEFINED_1 = 0x00020000 , USER_DEFINED_2 = 0x00040000 , USER_DEFINED_3 = 0x00080000 , USER_DEFINED_4 = 0x00100000 , USER_DEFINED_5 = 0x00200000 , USER_DEFINED_6 = 0x00400000 , USER_DEFINED_7 = 0x00800000 , USER_DEFINED_8 = 0x01000000 , USER_DEFINED_9 = 0x02000000 , USER_DEFINED_10 = 0x04000000 , USER_DEFINED_11 = 0x08000000 , USER_DEFINED_12 = 0x10000000 , USER_DEFINED_13 = 0x20000000 , USER_DEFINED_14 = 0x40000000 , USER_DEFINED_15 = 0x80000000 }
	Predefined bit flags for why something is reachable. More...

typedef BitFlags< Reason, uint32_t >	ReasonFlags
	Bit flags for reachability.

typedef Sawyer::Container::Map< Partitioner2::FunctionPtr, std::set< size_t > >	FunctionToVertexMap

Public Member Functions
	Reachability ()
	Default constructor.

void	clear ()
	Clear previous results.

void	clearReachability ()
	Clear all reachability.

size_t	markEntryFunctions (const Partitioner2::PartitionerConstPtr &, ReasonFlags how=PROGRAM_ENTRY_POINT)
	Mark entry points as intrinsically reachable.

size_t	markExportFunctions (const Partitioner2::PartitionerConstPtr &, ReasonFlags how=EXPORTED_FUNCTION)
	Mark exported functions as intrinsically reachable.

size_t	markExplicitInstructionReferents (const Partitioner2::PartitionerConstPtr &, const Partitioner2::BasicBlockPtr &, ReasonFlags how=EXPLICIT_INSN_CONSTANT)
	Mark vertices whose addresses appear in instructions.

size_t	markExplicitMemoryReferents (const Partitioner2::PartitionerConstPtr &, const MemoryMapPtr &, size_t bytesPerWord=0, size_t alignment=0, ByteOrder::Endianness sex=ByteOrder::ORDER_UNSPECIFIED, ReasonFlags how=EXPLICIT_MEM_CONSTANT)
	Mark vertices whose addresses appear in memory.

size_t	markImplicitFunctionReferents (const Partitioner2::PartitionerConstPtr &, const Partitioner2::FunctionPtr &, ReasonFlags how=IMPLICIT_FUNC_CONSTANT)
	Mark vertices whose addressses appear in a function.

size_t	markSpecifiedVas (const Partitioner2::PartitionerConstPtr &, const std::vector< AddressInterval > &, ReasonFlags)
	Mark all basic blocks with in the specified ranges.

size_t	intrinsicallyReachable (size_t vertexId, ReasonFlags how)
	Change intrinsic reachability for one vertex.

template<class ForwardIterator >
size_t	intrinsicallyReachable (ForwardIterator begin, ForwardIterator end, ReasonFlags how)
	Change intrinsic reachabability for multiple vertices.

bool	isIntrinsicallyReachable (size_t vertexId, ReasonFlags any=ReasonFlags(), ReasonFlags all=ReasonFlags(), ReasonFlags none=ReasonFlags()) const
	Query whether a vertex is intrinsic reachable.

bool	isReachable (size_t vertexId, ReasonFlags any=ReasonFlags(), ReasonFlags all=ReasonFlags(), ReasonFlags none=ReasonFlags()) const
	Query whether a vertex is reachable.

std::vector< size_t >	reachableVertices (ReasonFlags any=ReasonFlags(), ReasonFlags all=ReasonFlags(), ReasonFlags none=ReasonFlags()) const
	Return a list of reachable vertex IDs.

void	iterate (const Partitioner2::PartitionerConstPtr &partitioner)
	Iteratively propagate and mark.

std::set< size_t >	findExplicitMemoryReferents (const Partitioner2::PartitionerConstPtr &, const MemoryMapPtr &, size_t bytesPerWord=0, size_t alignment=0, ByteOrder::Endianness sex=ByteOrder::ORDER_UNSPECIFIED)
	Find all CFG vertices mentioned in memory.


const Settings &	settings () const
	Property: Settings that influence the analysis.

Settings &	settings ()
	Property: Settings that influence the analysis.

void	settings (const Settings &s)
	Property: Settings that influence the analysis.


size_t	markStartingPoints (const Partitioner2::PartitionerConstPtr &)
	Mark starting points as intrinsically reachable according to settings.

size_t	markStartingPoints (const Partitioner2::PartitionerConstPtr &, const MemoryMapPtr &)
	Mark starting points as intrinsically reachable according to settings.


ReasonFlags	intrinsicReachability (size_t vertexId) const
	Query intrinsic reachability.

const std::vector< ReasonFlags > &	intrinsicReachability () const
	Query intrinsic reachability.


ReasonFlags	reachability (size_t vertexId) const
	Query computed reachability.

const std::vector< ReasonFlags > &	reachability () const
	Query computed reachability.


size_t	propagate (const Partitioner2::PartitionerConstPtr &)
	Propagate intrinsic reachability through the graph.

size_t	propagate (const Partitioner2::PartitionerConstPtr &, std::vector< size_t > &changedVertexIds)
	Propagate intrinsic reachability through the graph.

Static Public Member Functions
static void	initDiagnostics ()
	Initialize diagnostic streams.

static Sawyer::CommandLine::SwitchGroup	commandLineSwitches (Settings &settings)
	Describes how to parse switches related to reachability.

static std::string	reasonArgument (Reason)
	Convert a reachability reason enum constant to a parsable reason name.

static Sawyer::CommandLine::ValueParser::Ptr	reasonParser (ReasonFlags &storage)
	Creates a command-line parser for reachability reason names.

static std::string	reasonArgumentDocumentation ()
	Documentation for the possible reason arguments.

static void	insertReasonSwitch (Sawyer::CommandLine::SwitchGroup &, const std::string &switchName, ReasonFlags &storage, Reason dfltArg, const std::string &doc)
	Insert a switch that takes a reason argument.

static std::string	reasonDocumentation (Reason dflt)
	Generate documentation for the command-line switches.

static bool	hasReasons (ReasonFlags reasons, ReasonFlags any=ReasonFlags(), ReasonFlags all=ReasonFlags(), ReasonFlags none=ReasonFlags())
	Predicate to match reason flags.

static std::set< size_t >	findExplicitInstructionReferents (const Partitioner2::PartitionerConstPtr &, const Partitioner2::BasicBlockPtr &)
	Find all CFG vertices mentioned explicitly in a basic block.

static std::set< size_t >	findImplicitFunctionReferents (const Partitioner2::PartitionerConstPtr &, const Partitioner2::FunctionPtr &)
	Find all CFG vertices referenced from a function.

Static Public Attributes
static Sawyer::Message::Facility	mlog
	Facility for emitting diagnostics.

Member Typedef Documentation

◆ ReasonFlags

typedef BitFlags<Reason, uint32_t> Rose::BinaryAnalysis::Reachability::ReasonFlags

Bit flags for reachability.

Definition at line 65 of file Reachability.h.

◆ FunctionToVertexMap

typedef Sawyer::Container::Map<Partitioner2::FunctionPtr, std::set<size_t> > Rose::BinaryAnalysis::Reachability::FunctionToVertexMap

Definition at line 98 of file Reachability.h.

Member Enumeration Documentation

◆ Reason

enum Rose::BinaryAnalysis::Reachability::Reason

Predefined bit flags for why something is reachable.

Enumerator
NOT_REACHABLE	Vertex is not reachable.
PROGRAM_ENTRY_POINT	Vertex is a program entry point.
EXPORTED_FUNCTION	Vertex is an exported function.
SIGNAL_HANDLER	Vertex is a signal handler.
ASSUMED	Assumed reachable for cases when the analysis wasn't run.
EXPLICIT_MEM_CONSTANT	Address appears in memory.
EXPLICIT_INSN_CONSTANT	Address appears as a constant in some reachable instruction.
IMPLICIT_FUNC_CONSTANT	Address appears during data-flow in some reachable function.
USER_DEFINED_0	User-defined reason.
USER_DEFINED_1	User-defined reason.
USER_DEFINED_2	User-defined reason.
USER_DEFINED_3	User-defined reason.
USER_DEFINED_4	User-defined reason.
USER_DEFINED_5	User-defined reason.
USER_DEFINED_6	User-defined reason.
USER_DEFINED_7	User-defined reason.
USER_DEFINED_8	User-defined reason.
USER_DEFINED_9	User-defined reason.
USER_DEFINED_10	User-defined reason.
USER_DEFINED_11	User-defined reason.
USER_DEFINED_12	User-defined reason.
USER_DEFINED_13	User-defined reason.
USER_DEFINED_14	User-defined reason.
USER_DEFINED_15	User-defined reason.

Definition at line 34 of file Reachability.h.

Constructor & Destructor Documentation

◆ Reachability()

Rose::BinaryAnalysis::Reachability::Reachability ( )

Default constructor.

Constructs a new analysis object with an empty control flow graph.

Member Function Documentation

◆ initDiagnostics()

static void Rose::BinaryAnalysis::Reachability::initDiagnostics ( )

static

Initialize diagnostic streams.

This is called automatically by Rose::Diagnostics::initialize.

◆ settings() [1/3]

const Settings & Rose::BinaryAnalysis::Reachability::settings ( ) const

inline

Property: Settings that influence the analysis.

Definition at line 149 of file Reachability.h.

◆ settings() [2/3]

Settings & Rose::BinaryAnalysis::Reachability::settings ( )

inline

Property: Settings that influence the analysis.

Definition at line 150 of file Reachability.h.

◆ settings() [3/3]

void Rose::BinaryAnalysis::Reachability::settings ( const Settings & s )

inline

Property: Settings that influence the analysis.

Definition at line 151 of file Reachability.h.

◆ commandLineSwitches()

static Sawyer::CommandLine::SwitchGroup Rose::BinaryAnalysis::Reachability::commandLineSwitches ( Settings & settings )

static

Describes how to parse switches related to reachability.

The returned switch group is intended to be inserted into a command-line parser. The input values of the settings are documented as the defaults, and after applying the parse resuts will contain the arguments of the corresponding switches.

◆ reasonArgument()

static std::string Rose::BinaryAnalysis::Reachability::reasonArgument ( Reason )

static

Convert a reachability reason enum constant to a parsable reason name.

This is used for building command-line parsers. The returned string is the same as what would be recognized by the command-line parser for the specified enum constant.

◆ reasonParser()

static Sawyer::CommandLine::ValueParser::Ptr Rose::BinaryAnalysis::Reachability::reasonParser ( ReasonFlags & storage )

static

Creates a command-line parser for reachability reason names.

The parser accepts a list of reason names (those strings returned by reasonArgument) separated by commas. It parses each string of the list, converts it to a Reason enum constant, and sets that flag in the provided storage variable (but not until the parsed command-line is applied). If the string is that corresponding to NOT_REACHABLE, then the storage is cleared.

◆ reasonArgumentDocumentation()

static std::string Rose::BinaryAnalysis::Reachability::reasonArgumentDocumentation ( )

static

Documentation for the possible reason arguments.

This returns a documentation string describing all possible strings accepted by the reasonParser.

◆ insertReasonSwitch()

static void Rose::BinaryAnalysis::Reachability::insertReasonSwitch	(	Sawyer::CommandLine::SwitchGroup &	,
		const std::string &	switchName,
		ReasonFlags &	storage,
		Reason	dfltArg,
		const std::string &	doc
	)

static

Insert a switch that takes a reason argument.

Inserts the specified switch into the switch group, and also inserts a "no-*" version of the switch that behaves as if the primary switch were given the reason string corresponding to NOT_REACHABLE. The storage should already be initialized with a default set of flags. The dfltArg is the argument used for the switch if none is given on the command-line. In other words, the initial value of storage are the reasons that will result if the user doesn't specify the switch, and the dfltArg value is used if the user specifies the switch but no argument.

◆ reasonDocumentation()

static std::string Rose::BinaryAnalysis::Reachability::reasonDocumentation ( Reason dflt )

static

Generate documentation for the command-line switches.

The return value is a string suitable for incorporation into the documentation strings for the command-line parser. If the dflt is something other than NOT_REACHABLE, then it's used to indicate a default argument for the command-line switch.

◆ clear()

void Rose::BinaryAnalysis::Reachability::clear ( )

Clear previous results.

This does not clear the settings, only the results.

◆ clearReachability()

void Rose::BinaryAnalysis::Reachability::clearReachability ( )

Clear all reachability.

This clears all reachability (marking all vertices as not reachable) without throwing away any other data.

◆ markStartingPoints() [1/2]

size_t Rose::BinaryAnalysis::Reachability::markStartingPoints ( const Partitioner2::PartitionerConstPtr & )

Mark starting points as intrinsically reachable according to settings.

Marks the initial, intrinsically reachable starting points in the graph according the the analysis settings. These are starting points whose reachability doesn't depend directly or indirectly on any other vertices. For example, the entry points of exported functions are intrinsically reachable regardless of what other vertices are reachable because these functions can be presumably called from other specimens.

If the analysis settings specify that memory should be scanned to find addresses of basic blocks to mark as being intrinsically reachable, then the supplied memory map is used for this purpose. If the map is a null pointer, then the map from the partitioner is used instead.

Returns number of affected vertices.

◆ markStartingPoints() [2/2]

size_t Rose::BinaryAnalysis::Reachability::markStartingPoints	(	const Partitioner2::PartitionerConstPtr &	,
		const MemoryMapPtr &
	)

Mark starting points as intrinsically reachable according to settings.

Marks the initial, intrinsically reachable starting points in the graph according the the analysis settings. These are starting points whose reachability doesn't depend directly or indirectly on any other vertices. For example, the entry points of exported functions are intrinsically reachable regardless of what other vertices are reachable because these functions can be presumably called from other specimens.

If the analysis settings specify that memory should be scanned to find addresses of basic blocks to mark as being intrinsically reachable, then the supplied memory map is used for this purpose. If the map is a null pointer, then the map from the partitioner is used instead.

Returns number of affected vertices.

◆ markEntryFunctions()

size_t Rose::BinaryAnalysis::Reachability::markEntryFunctions	(	const Partitioner2::PartitionerConstPtr &	,
		ReasonFlags	how = `PROGRAM_ENTRY_POINT`
	)

Mark entry points as intrinsically reachable.

Mark all specimen entry points as intrinsically reachable. For example, ELF files will likely have their "_start" functions marked this way (although the marking is based on the ELF header, not the name of the function).

Returns number of affected vertices.

◆ markExportFunctions()

size_t Rose::BinaryAnalysis::Reachability::markExportFunctions	(	const Partitioner2::PartitionerConstPtr &	,
		ReasonFlags	how = `EXPORTED_FUNCTION`
	)

Mark exported functions as intrinsically reachable.

Marks all entry vertices of exported functions as intrinsically reachable.

Returns number of affected vertices.

◆ markExplicitInstructionReferents()

size_t Rose::BinaryAnalysis::Reachability::markExplicitInstructionReferents	(	const Partitioner2::PartitionerConstPtr &	,
		const Partitioner2::BasicBlockPtr &	,
		ReasonFlags	how = `EXPLICIT_INSN_CONSTANT`
	)

Mark vertices whose addresses appear in instructions.

Traverses the specified basic block to find all explicit constants. For each constant which is the address of a basic block, mark that block as intrinsically reachable.

◆ markExplicitMemoryReferents()

size_t Rose::BinaryAnalysis::Reachability::markExplicitMemoryReferents	(	const Partitioner2::PartitionerConstPtr &	,
		const MemoryMapPtr &	,
		size_t	bytesPerWord = `0`,
		size_t	alignment = `0`,
		ByteOrder::Endianness	sex = `ByteOrder::ORDER_UNSPECIFIED`,
		ReasonFlags	how = `EXPLICIT_MEM_CONSTANT`
	)

Mark vertices whose addresses appear in memory.

Scans all bytes of the supplied memory map to find integer constants of the specified size, alignment, and byte order. If the integer is the starting address of a basic block, then that CFG vertex is marked as reachable with the specified how flags.

If bytesPerWord, alignment, or sex are default values, then the analysis settings are used, or else if those are defaults, the values are obtained from the specimen architecture definition.

Returns number of affected vertices.

◆ markImplicitFunctionReferents()

size_t Rose::BinaryAnalysis::Reachability::markImplicitFunctionReferents	(	const Partitioner2::PartitionerConstPtr &	,
		const Partitioner2::FunctionPtr &	,
		ReasonFlags	how = `IMPLICIT_FUNC_CONSTANT`
	)

Mark vertices whose addressses appear in a function.

This looks for implicit values in the function by performing a symbolic data-flow analysis and then examining the state after each basic block in order to find concrete values. Any concrete value that's the start of some basic block causes that basic block to become intrinsically reachable.

◆ markSpecifiedVas()

size_t Rose::BinaryAnalysis::Reachability::markSpecifiedVas	(	const Partitioner2::PartitionerConstPtr &	,
		const std::vector< AddressInterval > &	,
		ReasonFlags
	)

Mark all basic blocks with in the specified ranges.

Any basic block that has an instruction beginning in any of the address intervals is marked with the given reason.

Returns number of affected vertices.

◆ intrinsicallyReachable() [1/2]

size_t Rose::BinaryAnalysis::Reachability::intrinsicallyReachable	(	size_t	vertexId,
		ReasonFlags	how
	)

Change intrinsic reachability for one vertex.

The intrinsic reachability of the specified vertex is changed to how, which is a bit vector of Reason bits. Changing the intrinsic reachability of a vertex to NOT_REACHABLE does not necessarily mark the vertex as unreachable since it might be reachable from other reachable vertices.

Returns number of affected vertices (0 or 1).

Referenced by intrinsicallyReachable().

◆ intrinsicallyReachable() [2/2]

template<class ForwardIterator >

size_t Rose::BinaryAnalysis::Reachability::intrinsicallyReachable	(	ForwardIterator	begin,
		ForwardIterator	end,
		ReasonFlags	how
	)

inline

Change intrinsic reachabability for multiple vertices.

Returns number of affected vertices.

Definition at line 291 of file Reachability.h.

References intrinsicallyReachable().

◆ hasReasons()

static bool Rose::BinaryAnalysis::Reachability::hasReasons	(	ReasonFlags	reasons,
		ReasonFlags	any = `ReasonFlags()`,
		ReasonFlags	all = `ReasonFlags()`,
		ReasonFlags	none = `ReasonFlags()`
	)

static

Predicate to match reason flags.

Returns true if the reasons matches the other arguments. Returns true if all of the following are true:

any is non-empty and reasons contains at least one of those bits, or any is empty and reasons contains any bit.

reasons contains all the bits that are set in all.

reasons contains none of the bits that are set in none.

◆ isIntrinsicallyReachable()

bool Rose::BinaryAnalysis::Reachability::isIntrinsicallyReachable	(	size_t	vertexId,
		ReasonFlags	any = `ReasonFlags()`,
		ReasonFlags	all = `ReasonFlags()`,
		ReasonFlags	none = `ReasonFlags()`
	)		const

Query whether a vertex is intrinsic reachable.

Returns true if the specified vertex's intrinsic reachability matches according to hasReasons.

◆ isReachable()

bool Rose::BinaryAnalysis::Reachability::isReachable	(	size_t	vertexId,
		ReasonFlags	any = `ReasonFlags()`,
		ReasonFlags	all = `ReasonFlags()`,
		ReasonFlags	none = `ReasonFlags()`
	)		const

Query whether a vertex is reachable.

Returns true if the specified vertex's computed reachability matches according to hasReasons.

◆ intrinsicReachability() [1/2]

ReasonFlags Rose::BinaryAnalysis::Reachability::intrinsicReachability ( size_t vertexId ) const

Query intrinsic reachability.

When a vertex ID is specified, then return the reachability reasons for that one vertex, or an empty set of reasons if the ID is out of range.

When no arguments are specified, return all intrinsic reachability information.

◆ intrinsicReachability() [2/2]

const std::vector< ReasonFlags > & Rose::BinaryAnalysis::Reachability::intrinsicReachability ( ) const

Query intrinsic reachability.

When a vertex ID is specified, then return the reachability reasons for that one vertex, or an empty set of reasons if the ID is out of range.

When no arguments are specified, return all intrinsic reachability information.

◆ reachability() [1/2]

ReasonFlags Rose::BinaryAnalysis::Reachability::reachability ( size_t vertexId ) const

Query computed reachability.

When a vertex ID is specified, then return the reachability reasons for that one vertex, or an empty set of reasons if the ID is out of range.

When no arguments are specified, return all computed reachability information.

◆ reachability() [2/2]

const std::vector< ReasonFlags > & Rose::BinaryAnalysis::Reachability::reachability ( ) const

Query computed reachability.

When a vertex ID is specified, then return the reachability reasons for that one vertex, or an empty set of reasons if the ID is out of range.

When no arguments are specified, return all computed reachability information.

◆ reachableVertices()

std::vector< size_t > Rose::BinaryAnalysis::Reachability::reachableVertices	(	ReasonFlags	any = `ReasonFlags()`,
		ReasonFlags	all = `ReasonFlags()`,
		ReasonFlags	none = `ReasonFlags()`
	)		const

Return a list of reachable vertex IDs.

Returns the sorted list of vertex IDs that have at least one of the any flags (or at least one flag if any is empty), all of the all flags, and none of the none flags. The return value is sorted by increasing vertex ID.

◆ propagate() [1/2]

size_t Rose::BinaryAnalysis::Reachability::propagate ( const Partitioner2::PartitionerConstPtr & )

Propagate intrinsic reachability through the graph.

This runs a data-flow analysis to propagate the intrinsic reachability bits through the graph.

Returns the number of affected vertices. If a vector of vertex ID is supplied as an argument, then any vertex whose reachability has changed will be appended to that vector.

◆ propagate() [2/2]

size_t Rose::BinaryAnalysis::Reachability::propagate	(	const Partitioner2::PartitionerConstPtr &	,
		std::vector< size_t > &	changedVertexIds
	)

Propagate intrinsic reachability through the graph.

This runs a data-flow analysis to propagate the intrinsic reachability bits through the graph.

Returns the number of affected vertices. If a vector of vertex ID is supplied as an argument, then any vertex whose reachability has changed will be appended to that vector.

◆ iterate()

void Rose::BinaryAnalysis::Reachability::iterate ( const Partitioner2::PartitionerConstPtr & partitioner )

Iteratively propagate and mark.

This function calls runs a propagate step and a marking step in a loop until a steady state is reached. The marking step looks for new basic blocks that can be marked as intrinsically reachable based on the newly reachable blocks from the previous propagate step.

◆ findExplicitInstructionReferents()

static std::set< size_t > Rose::BinaryAnalysis::Reachability::findExplicitInstructionReferents	(	const Partitioner2::PartitionerConstPtr &	,
		const Partitioner2::BasicBlockPtr &
	)

static

Find all CFG vertices mentioned explicitly in a basic block.

Scans the instructions of the specified basic block to look for explicit constants (i.e., "immediates") that are addresses of other basic blocks, and return the CFG vertex ID numbers for those other blocks.

◆ findExplicitMemoryReferents()

std::set< size_t > Rose::BinaryAnalysis::Reachability::findExplicitMemoryReferents	(	const Partitioner2::PartitionerConstPtr &	,
		const MemoryMapPtr &	,
		size_t	bytesPerWord = `0`,
		size_t	alignment = `0`,
		ByteOrder::Endianness	sex = `ByteOrder::ORDER_UNSPECIFIED`
	)

Find all CFG vertices mentioned in memory.

Scans the specified memory and reads values that satisfy the size, alignment, and byte order and returns the set of CFG vertices (by ID) for which starting addresses were found. If bytesPerWord, alignment, or sex are default values, then the analysis settings are used, or else if those are defaults, the values are obtained from the specimen architecture definition.

◆ findImplicitFunctionReferents()

static std::set< size_t > Rose::BinaryAnalysis::Reachability::findImplicitFunctionReferents	(	const Partitioner2::PartitionerConstPtr &	,
		const Partitioner2::FunctionPtr &
	)

static

Find all CFG vertices referenced from a function.

Performs a symbolic data-flow analysis on the specified function in order to find all CFG vertices that are mentioned in the semantic state.

Member Data Documentation

◆ mlog

Sawyer::Message::Facility Rose::BinaryAnalysis::Reachability::mlog

static

Facility for emitting diagnostics.

Definition at line 102 of file Reachability.h.

The documentation for this class was generated from the following file:

Reachability.h

Description

Classes

Public Types

Public Member Functions

Static Public Member Functions

Static Public Attributes

Member Typedef Documentation

◆ ReasonFlags

◆ FunctionToVertexMap

Member Enumeration Documentation

◆ Reason

Constructor & Destructor Documentation

◆ Reachability()

Member Function Documentation

◆ initDiagnostics()

◆ settings() [1/3]

◆ settings() [2/3]

◆ settings() [3/3]

◆ commandLineSwitches()

◆ reasonArgument()

◆ reasonParser()

◆ reasonArgumentDocumentation()

◆ insertReasonSwitch()

◆ reasonDocumentation()

◆ clear()

◆ clearReachability()

◆ markStartingPoints() [1/2]

◆ markStartingPoints() [2/2]

◆ markEntryFunctions()

◆ markExportFunctions()

◆ markExplicitInstructionReferents()

◆ markExplicitMemoryReferents()

◆ markImplicitFunctionReferents()

◆ markSpecifiedVas()

◆ intrinsicallyReachable() [1/2]

◆ intrinsicallyReachable() [2/2]

◆ hasReasons()

◆ isIntrinsicallyReachable()

◆ isReachable()

◆ intrinsicReachability() [1/2]

◆ intrinsicReachability() [2/2]

◆ reachability() [1/2]

◆ reachability() [2/2]

◆ reachableVertices()

◆ propagate() [1/2]

◆ propagate() [2/2]

◆ iterate()

◆ findExplicitInstructionReferents()

◆ findExplicitMemoryReferents()

◆ findImplicitFunctionReferents()

Member Data Documentation

◆ mlog