ROSE  0.9.10.75
Rose::BinaryAnalysis::MemoryMap Member List

This is the complete list of members for Rose::BinaryAnalysis::MemoryMap, including all inherited members.

access(unsigned x) constSawyer::Container::AddressMap< rose_addr_t, uint8_t >inline
access(unsigned x)Sawyer::Container::AddressMap< rose_addr_t, uint8_t >inline
Address typedef (defined in Rose::BinaryAnalysis::MemoryMap)Rose::BinaryAnalysis::MemoryMap
AddressMap()Sawyer::Container::AddressMap< rose_addr_t, uint8_t >inline
AddressMap(const AddressMap &other, bool copyOnWrite=false)Sawyer::Container::AddressMap< rose_addr_t, uint8_t >inline
after(Address x) constSawyer::Container::AddressMap< rose_addr_t, uint8_t >inline
after(Address x)Sawyer::Container::AddressMap< rose_addr_t, uint8_t >inline
AllocatingBuffer typedef (defined in Rose::BinaryAnalysis::MemoryMap)Rose::BinaryAnalysis::MemoryMap
any() constSawyer::Container::AddressMap< rose_addr_t, uint8_t >inline
any()Sawyer::Container::AddressMap< rose_addr_t, uint8_t >inline
at(Address x) constSawyer::Container::AddressMap< rose_addr_t, uint8_t >inline
at(Address x)Sawyer::Container::AddressMap< rose_addr_t, uint8_t >inline
at(const Sawyer::Container::Interval< Address > &x) constSawyer::Container::AddressMap< rose_addr_t, uint8_t >inline
at(const Sawyer::Container::Interval< Address > &x)Sawyer::Container::AddressMap< rose_addr_t, uint8_t >inline
atOrAfter(Address x) constSawyer::Container::AddressMap< rose_addr_t, uint8_t >inline
atOrAfter(Address x)Sawyer::Container::AddressMap< rose_addr_t, uint8_t >inline
atOrBefore(Address x) constSawyer::Container::AddressMap< rose_addr_t, uint8_t >inline
atOrBefore(Address x)Sawyer::Container::AddressMap< rose_addr_t, uint8_t >inline
available(const AddressMapConstraints< const AddressMap > &c, MatchFlags flags=0) constSawyer::Container::AddressMap< rose_addr_t, uint8_t >inline
baseSize(Address base, Address size) constSawyer::Container::AddressMap< rose_addr_t, uint8_t >inline
baseSize(Address base, Address size)Sawyer::Container::AddressMap< rose_addr_t, uint8_t >inline
before(Address x) constSawyer::Container::AddressMap< rose_addr_t, uint8_t >inline
before(Address x)Sawyer::Container::AddressMap< rose_addr_t, uint8_t >inline
bestFit(const typename Interval::Value &size, NodeIterator start)Sawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >inline
bestFit(const typename Interval::Value &size, ConstNodeIterator start) constSawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >inline
bestFitImpl(IMap &imap, const typename Interval::Value &size, typename IntervalMapTraits< IMap >::NodeIterator start)Sawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >inlinestatic
Buffer typedef (defined in Rose::BinaryAnalysis::MemoryMap)Rose::BinaryAnalysis::MemoryMap
byteOrder() const Rose::BinaryAnalysis::MemoryMapinline
byteOrder(ByteOrder::Endianness order)Rose::BinaryAnalysis::MemoryMapinline
changeAccess(unsigned requiredAccess, unsigned prohibitedAccess, const AddressMapConstraints< AddressMap > &c, MatchFlags flags=0)Sawyer::Container::AddressMap< rose_addr_t, uint8_t >inline
checkConsistency() constSawyer::Container::AddressMap< rose_addr_t, uint8_t >inline
clear()Sawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >inline
ConstConstraints typedef (defined in Rose::BinaryAnalysis::MemoryMap)Rose::BinaryAnalysis::MemoryMap
ConstIntervalIterator typedefSawyer::Container::AddressMap< rose_addr_t, uint8_t >
ConstNodeIterator typedefSawyer::Container::AddressMap< rose_addr_t, uint8_t >
Constraints typedef (defined in Rose::BinaryAnalysis::MemoryMap)Rose::BinaryAnalysis::MemoryMap
ConstSegmentIterator typedefSawyer::Container::AddressMap< rose_addr_t, uint8_t >
ConstValueIterator typedefSawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >
contains(Interval key) const (defined in Sawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >)Sawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >inline
contains(const IntervalMap< Interval, T2, Policy2 > &other) const (defined in Sawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >)Sawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >inline
dump(FILE *, const char *prefix="") const Rose::BinaryAnalysis::MemoryMap
dump(std::ostream &, std::string prefix="") const Rose::BinaryAnalysis::MemoryMap
erase(const Interval &erasure)Sawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >inline
eraseMultiple(const IntervalMap< Interval, T2, Policy2 > &other)Sawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >inline
eraseZeros(size_t minsize)Rose::BinaryAnalysis::MemoryMap
EXECUTABLE (defined in Rose::BinaryAnalysis::MemoryMap)Rose::BinaryAnalysis::MemoryMapstatic
exists(const AddressMapConstraints< const AddressMap > &c, MatchFlags flags=0) constSawyer::Container::AddressMap< rose_addr_t, uint8_t >inline
IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >::exists(const typename Interval::Value &size) constSawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >inline
find(const typename Interval::Value &scalar)Sawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >inline
find(const typename Interval::Value &scalar) constSawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >inline
findAll(const Interval &interval)Sawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >inline
findAll(const Interval &interval) constSawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >inline
findAllImpl(IMap &imap, const Interval &interval)Sawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >inlinestatic
findAny(const Extent &limits, const std::vector< uint8_t > &bytesToFind, unsigned requiredPerms=READABLE, unsigned prohibitedPerms=0) const Rose::BinaryAnalysis::MemoryMap
findAny(const AddressInterval &limits, const std::vector< uint8_t > &bytesToFind, unsigned requiredPerms=READABLE, unsigned prohibitedPerms=0) const Rose::BinaryAnalysis::MemoryMap
findFirstOverlap(const Interval &interval)Sawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >inline
findFirstOverlap(const Interval &interval) constSawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >inline
findFirstOverlap(typename IntervalMap::NodeIterator thisIter, const IntervalMap< Interval, T2, Policy2 > &other, typename IntervalMap< Interval, T2, Policy2 >::ConstNodeIterator otherIter)Sawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >inline
findFirstOverlap(typename IntervalMap::ConstNodeIterator thisIter, const IntervalMap< Interval, T2, Policy2 > &other, typename IntervalMap< Interval, T2, Policy2 >::ConstNodeIterator otherIter) constSawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >inline
findFirstOverlapImpl(IMap &imap, const Interval &interval)Sawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >inlinestatic
findFirstOverlapImpl(IMap &imap, typename IntervalMapTraits< IMap >::NodeIterator thisIter, const IntervalMap< Interval, T2, Policy2 > &other, typename IntervalMap< Interval, T2, Policy2 >::ConstNodeIterator otherIter)Sawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >inlinestatic
findFreeSpace(size_t nValues, size_t alignment=1, Sawyer::Container::Interval< Address > restriction=Sawyer::Container::Interval< Address >::whole(), MatchFlags flags=0) constSawyer::Container::AddressMap< rose_addr_t, uint8_t >inline
findImpl(IMap &imap, const typename Interval::Value &scalar)Sawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >inlinestatic
findNode(const AddressMapConstraints< const AddressMap > &c, MatchFlags flags=0) constSawyer::Container::AddressMap< rose_addr_t, uint8_t >inline
findNode(const AddressMapConstraints< AddressMap > &c, MatchFlags flags=0)Sawyer::Container::AddressMap< rose_addr_t, uint8_t >inline
findPrior(const typename Interval::Value &scalar)Sawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >inline
findPrior(const typename Interval::Value &scalar) constSawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >inline
findPriorImpl(IMap &imap, const typename Interval::Value &scalar)Sawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >inlinestatic
findSequence(const AddressInterval &interval, const std::vector< uint8_t > &sequence) const Rose::BinaryAnalysis::MemoryMap
firstFit(const typename Interval::Value &size, NodeIterator start)Sawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >inline
firstFit(const typename Interval::Value &size, ConstNodeIterator start) constSawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >inline
firstFitImpl(IMap &imap, const typename Interval::Value &size, typename IntervalMapTraits< IMap >::NodeIterator start)Sawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >inlinestatic
firstUnmapped(typename Interval::Value minAddr) constSawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >inline
get(const typename Interval::Value &scalar) constSawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >inline
getOptional(const typename Interval::Value &scalar) constSawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >inline
getOrDefault(const typename Interval::Value &scalar) constSawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >inline
getOrElse(const typename Interval::Value &scalar, Value &dflt)Sawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >inline
getOrElse(const typename Interval::Value &scalar, const Value &dflt) constSawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >inline
greatest() constSawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >inline
greatest(typename Interval::Value upperLimit) constSawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >inline
greatestUnmapped(typename Interval::Value upperLimit) constSawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >inline
hash(Combinatorics::Hasher &) const Rose::BinaryAnalysis::MemoryMap
hull() constSawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >inline
IMMUTABLE (defined in Rose::BinaryAnalysis::MemoryMap)Rose::BinaryAnalysis::MemoryMapstatic
INITIALIZED (defined in Rose::BinaryAnalysis::MemoryMap)Rose::BinaryAnalysis::MemoryMapstatic
insert(Interval key, Value value, bool makeHole=true)Sawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >inline
insertFile(const std::string &fileName, rose_addr_t va, InsertFileMapMode mode=MAP_PRIVATE, std::string segmentName="")Rose::BinaryAnalysis::MemoryMap
insertFile(const std::string &locatorString)Rose::BinaryAnalysis::MemoryMap
insertFileDocumentation()Rose::BinaryAnalysis::MemoryMapstatic
InsertFileMapMode enum nameRose::BinaryAnalysis::MemoryMap
insertMultiple(const IntervalMap< Interval, T2, Policy2 > &other, bool makeHole=true)Sawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >inline
insertProcess(pid_t pid, Attach::Boolean attach)Rose::BinaryAnalysis::MemoryMap
insertProcess(const std::string &locatorString)Rose::BinaryAnalysis::MemoryMap
insertProcessDocumentation()Rose::BinaryAnalysis::MemoryMapstatic
instance()Rose::BinaryAnalysis::MemoryMapinlinestatic
Interval typedefSawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >
IntervalMap()Sawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >inline
IntervalMap(const IntervalMap< Interval2, T2, Policy2 > &other)Sawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >inline
intervals() constSawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >inline
isDistinct(const Interval &interval) const (defined in Sawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >)Sawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >inline
isDistinct(const IntervalMap< Interval, T2, Policy2 > &other) const (defined in Sawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >)Sawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >inline
isEmpty() constSawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >inline
isOverlapping(const Interval &interval) const (defined in Sawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >)Sawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >inline
isOverlapping(const IntervalMap< Interval, T2, Policy2 > &other) const (defined in Sawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >)Sawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >inline
keep(const AddressMapConstraints< AddressMap > &c, MatchFlags flags=0)Sawyer::Container::AddressMap< rose_addr_t, uint8_t >inline
lastUnmapped(typename Interval::Value maxAddr) constSawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >inline
least() constSawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >inline
least(typename Interval::Value lowerLimit) constSawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >inline
leastUnmapped(typename Interval::Value lowerLimit) constSawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >inline
limit(size_t x) constSawyer::Container::AddressMap< rose_addr_t, uint8_t >inline
limit(size_t x)Sawyer::Container::AddressMap< rose_addr_t, uint8_t >inline
lowerBound(const typename Interval::Value &scalar)Sawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >inline
lowerBound(const typename Interval::Value &scalar) constSawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >inline
Map typedefSawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >
MAP_PRIVATE enum valueRose::BinaryAnalysis::MemoryMap
MAP_RDONLY enum valueRose::BinaryAnalysis::MemoryMap
MAP_READWRITE enum valueRose::BinaryAnalysis::MemoryMap
MappedBuffer typedef (defined in Rose::BinaryAnalysis::MemoryMap)Rose::BinaryAnalysis::MemoryMap
MemoryMap()Rose::BinaryAnalysis::MemoryMapinlineprotected
next(const AddressMapConstraints< const AddressMap > &c, MatchFlags flags=0) constSawyer::Container::AddressMap< rose_addr_t, uint8_t >inline
nIntervals() constSawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >inline
NO_ACCESS (defined in Rose::BinaryAnalysis::MemoryMap)Rose::BinaryAnalysis::MemoryMapstatic
Node typedefSawyer::Container::AddressMap< rose_addr_t, uint8_t >
NodeIterator typedefSawyer::Container::AddressMap< rose_addr_t, uint8_t >
nodes()Sawyer::Container::AddressMap< rose_addr_t, uint8_t >inline
nodes() constSawyer::Container::AddressMap< rose_addr_t, uint8_t >inline
nodes(const AddressMapConstraints< const AddressMap > &c, MatchFlags flags=0) constSawyer::Container::AddressMap< rose_addr_t, uint8_t >inline
nodes(const AddressMapConstraints< AddressMap > &c, MatchFlags flags=0)Sawyer::Container::AddressMap< rose_addr_t, uint8_t >inline
none() constSawyer::Container::AddressMap< rose_addr_t, uint8_t >inline
none()Sawyer::Container::AddressMap< rose_addr_t, uint8_t >inline
nSegments() constSawyer::Container::AddressMap< rose_addr_t, uint8_t >inline
NullBuffer typedef (defined in Rose::BinaryAnalysis::MemoryMap)Rose::BinaryAnalysis::MemoryMap
operator<< (defined in Rose::BinaryAnalysis::MemoryMap)Rose::BinaryAnalysis::MemoryMapfriend
AddressMap< rose_addr_t, uint8_t >::operator=(const IntervalMap< Interval2, T2, Policy2 > &other)Sawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >inline
Sawyer::SharedObject::operator=(const SharedObject &)Sawyer::SharedObjectinline
operator[](const typename Interval::Value &scalar) constSawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >inline
print(std::ostream &o, std::string prefix="") const Rose::BinaryAnalysis::MemoryMapinline
PRIVATE (defined in Rose::BinaryAnalysis::MemoryMap)Rose::BinaryAnalysis::MemoryMapstatic
prohibit(unsigned x) constSawyer::Container::AddressMap< rose_addr_t, uint8_t >inline
prohibit(unsigned x)Sawyer::Container::AddressMap< rose_addr_t, uint8_t >inline
prune(const AddressMapConstraints< AddressMap > &c, MatchFlags flags=0)Sawyer::Container::AddressMap< rose_addr_t, uint8_t >inline
Ptr typedef (defined in Rose::BinaryAnalysis::MemoryMap)Rose::BinaryAnalysis::MemoryMap
read(Value *buf, const AddressMapConstraints< const AddressMap > &c, MatchFlags flags=0) constSawyer::Container::AddressMap< rose_addr_t, uint8_t >inline
read(std::vector< Value > &buf, const AddressMapConstraints< const AddressMap > &c, MatchFlags flags=0) constSawyer::Container::AddressMap< rose_addr_t, uint8_t >inline
READ_EXECUTE (defined in Rose::BinaryAnalysis::MemoryMap)Rose::BinaryAnalysis::MemoryMapstatic
READ_WRITE (defined in Rose::BinaryAnalysis::MemoryMap)Rose::BinaryAnalysis::MemoryMapstatic
READ_WRITE_EXECUTE (defined in Rose::BinaryAnalysis::MemoryMap)Rose::BinaryAnalysis::MemoryMapstatic
READABLE (defined in Rose::BinaryAnalysis::MemoryMap)Rose::BinaryAnalysis::MemoryMapstatic
readQuick(void *buf, rose_addr_t startVa, size_t desired) const Rose::BinaryAnalysis::MemoryMapinline
readString(rose_addr_t startVa, size_t desired, int(*validChar)(int)=NULL, int(*invalidChar)(int)=NULL, unsigned requiredPerms=READABLE, unsigned prohibitedPerms=0, char terminator='\0') const Rose::BinaryAnalysis::MemoryMap
readUnsigned(rose_addr_t startVa) const Rose::BinaryAnalysis::MemoryMapinline
readVector(rose_addr_t startVa, size_t desired, unsigned requiredPerms=READABLE) const Rose::BinaryAnalysis::MemoryMap
require(unsigned x) constSawyer::Container::AddressMap< rose_addr_t, uint8_t >inline
require(unsigned x)Sawyer::Container::AddressMap< rose_addr_t, uint8_t >inline
RESERVED_ACCESS_BITS (defined in Rose::BinaryAnalysis::MemoryMap)Rose::BinaryAnalysis::MemoryMapstatic
Segment typedefSawyer::Container::AddressMap< rose_addr_t, uint8_t >
SegmentIterator typedefSawyer::Container::AddressMap< rose_addr_t, uint8_t >
SegmentPredicate typedef (defined in Rose::BinaryAnalysis::MemoryMap)Rose::BinaryAnalysis::MemoryMap
segmentPredicate(SegmentPredicate< Address, Value > *p) constSawyer::Container::AddressMap< rose_addr_t, uint8_t >inline
segmentPredicate(SegmentPredicate< Address, Value > *p)Sawyer::Container::AddressMap< rose_addr_t, uint8_t >inline
segments()Sawyer::Container::AddressMap< rose_addr_t, uint8_t >inline
segments() constSawyer::Container::AddressMap< rose_addr_t, uint8_t >inline
segments(const AddressMapConstraints< const AddressMap > &c, MatchFlags flags=0) constSawyer::Container::AddressMap< rose_addr_t, uint8_t >inline
segments(const AddressMapConstraints< AddressMap > &c, MatchFlags flags=0)Sawyer::Container::AddressMap< rose_addr_t, uint8_t >inline
segmentTitle(const Segment &)Rose::BinaryAnalysis::MemoryMapstatic
shallowCopy()Rose::BinaryAnalysis::MemoryMapinline
SharedObject()Sawyer::SharedObjectinline
SharedObject(const SharedObject &)Sawyer::SharedObjectinline
shrinkUnshare()Rose::BinaryAnalysis::MemoryMap
singleSegment() constSawyer::Container::AddressMap< rose_addr_t, uint8_t >inline
singleSegment()Sawyer::Container::AddressMap< rose_addr_t, uint8_t >inline
size() constSawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >inline
StaticBuffer typedef (defined in Rose::BinaryAnalysis::MemoryMap)Rose::BinaryAnalysis::MemoryMap
substr(const std::string &x) constSawyer::Container::AddressMap< rose_addr_t, uint8_t >inline
substr(const std::string &x)Sawyer::Container::AddressMap< rose_addr_t, uint8_t >inline
Super typedef (defined in Rose::BinaryAnalysis::MemoryMap)Rose::BinaryAnalysis::MemoryMap
traverse(Functor &functor, const AddressMapConstraints< const AddressMap > &c, MatchFlags flags=0) constSawyer::Container::AddressMap< rose_addr_t, uint8_t >inline
traverse(Functor &functor, const AddressMapConstraints< AddressMap > &c, MatchFlags flags=0)Sawyer::Container::AddressMap< rose_addr_t, uint8_t >inline
traverse(Visitor &visitor, const AddressMapConstraints< const AddressMap > &c, MatchFlags flags=0) constSawyer::Container::AddressMap< rose_addr_t, uint8_t >inline
traverse(Visitor &visitor, const AddressMapConstraints< AddressMap > &c, MatchFlags flags=0)Sawyer::Container::AddressMap< rose_addr_t, uint8_t >inline
unmapped(Address boundary, MatchFlags flags=0) constSawyer::Container::AddressMap< rose_addr_t, uint8_t >inline
upperBound(const typename Interval::Value &scalar)Sawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >inline
upperBound(const typename Interval::Value &scalar) constSawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >inline
Value typedef (defined in Rose::BinaryAnalysis::MemoryMap)Rose::BinaryAnalysis::MemoryMap
ValueIterator typedefSawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >
values()Sawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >inline
values() constSawyer::Container::IntervalMap< Interval< rose_addr_t >, AddressSegment< rose_addr_t, uint8_t >, AddressMapImpl::SegmentMergePolicy< rose_addr_t, uint8_t > >inline
within(const Sawyer::Container::Interval< Address > &x) constSawyer::Container::AddressMap< rose_addr_t, uint8_t >inline
within(const Sawyer::Container::Interval< Address > &x)Sawyer::Container::AddressMap< rose_addr_t, uint8_t >inline
within(Address x, Address y) constSawyer::Container::AddressMap< rose_addr_t, uint8_t >inline
within(Address x, Address y)Sawyer::Container::AddressMap< rose_addr_t, uint8_t >inline
WRITABLE (defined in Rose::BinaryAnalysis::MemoryMap)Rose::BinaryAnalysis::MemoryMapstatic
write(const Value *buf, const AddressMapConstraints< AddressMap > &c, MatchFlags flags=0)Sawyer::Container::AddressMap< rose_addr_t, uint8_t >inline
write(const std::vector< Value > &buf, const AddressMapConstraints< AddressMap > &c, MatchFlags flags=0)Sawyer::Container::AddressMap< rose_addr_t, uint8_t >inline
writeQuick(const void *buf, rose_addr_t startVa, size_t desired)Rose::BinaryAnalysis::MemoryMapinline
~SharedObject()Sawyer::SharedObjectinlinevirtual