1*9712c20fSFrederick Mayle // Copyright 2006 Google LLC 2*9712c20fSFrederick Mayle // 3*9712c20fSFrederick Mayle // Redistribution and use in source and binary forms, with or without 4*9712c20fSFrederick Mayle // modification, are permitted provided that the following conditions are 5*9712c20fSFrederick Mayle // met: 6*9712c20fSFrederick Mayle // 7*9712c20fSFrederick Mayle // * Redistributions of source code must retain the above copyright 8*9712c20fSFrederick Mayle // notice, this list of conditions and the following disclaimer. 9*9712c20fSFrederick Mayle // * Redistributions in binary form must reproduce the above 10*9712c20fSFrederick Mayle // copyright notice, this list of conditions and the following disclaimer 11*9712c20fSFrederick Mayle // in the documentation and/or other materials provided with the 12*9712c20fSFrederick Mayle // distribution. 13*9712c20fSFrederick Mayle // * Neither the name of Google LLC nor the names of its 14*9712c20fSFrederick Mayle // contributors may be used to endorse or promote products derived from 15*9712c20fSFrederick Mayle // this software without specific prior written permission. 16*9712c20fSFrederick Mayle // 17*9712c20fSFrederick Mayle // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 18*9712c20fSFrederick Mayle // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 19*9712c20fSFrederick Mayle // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 20*9712c20fSFrederick Mayle // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 21*9712c20fSFrederick Mayle // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 22*9712c20fSFrederick Mayle // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 23*9712c20fSFrederick Mayle // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 24*9712c20fSFrederick Mayle // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 25*9712c20fSFrederick Mayle // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 26*9712c20fSFrederick Mayle // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 27*9712c20fSFrederick Mayle // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 28*9712c20fSFrederick Mayle 29*9712c20fSFrederick Mayle // address_map.h: Address maps. 30*9712c20fSFrederick Mayle // 31*9712c20fSFrederick Mayle // An address map contains a set of objects keyed by address. Objects are 32*9712c20fSFrederick Mayle // retrieved from the map by returning the object with the highest key less 33*9712c20fSFrederick Mayle // than or equal to the lookup key. 34*9712c20fSFrederick Mayle // 35*9712c20fSFrederick Mayle // Author: Mark Mentovai 36*9712c20fSFrederick Mayle 37*9712c20fSFrederick Mayle #ifndef PROCESSOR_ADDRESS_MAP_H__ 38*9712c20fSFrederick Mayle #define PROCESSOR_ADDRESS_MAP_H__ 39*9712c20fSFrederick Mayle 40*9712c20fSFrederick Mayle #include <map> 41*9712c20fSFrederick Mayle 42*9712c20fSFrederick Mayle namespace google_breakpad { 43*9712c20fSFrederick Mayle 44*9712c20fSFrederick Mayle // Forward declarations (for later friend declarations). 45*9712c20fSFrederick Mayle template<class, class> class AddressMapSerializer; 46*9712c20fSFrederick Mayle 47*9712c20fSFrederick Mayle template<typename AddressType, typename EntryType> 48*9712c20fSFrederick Mayle class AddressMap { 49*9712c20fSFrederick Mayle public: AddressMap()50*9712c20fSFrederick Mayle AddressMap() : map_() {} 51*9712c20fSFrederick Mayle 52*9712c20fSFrederick Mayle // Inserts an entry into the map. Returns false without storing the entry 53*9712c20fSFrederick Mayle // if an entry is already stored in the map at the same address as specified 54*9712c20fSFrederick Mayle // by the address argument. 55*9712c20fSFrederick Mayle bool Store(const AddressType& address, const EntryType& entry); 56*9712c20fSFrederick Mayle 57*9712c20fSFrederick Mayle // Locates the entry stored at the highest address less than or equal to 58*9712c20fSFrederick Mayle // the address argument. If there is no such range, returns false. The 59*9712c20fSFrederick Mayle // entry is returned in entry, which is a required argument. If 60*9712c20fSFrederick Mayle // entry_address is not NULL, it will be set to the address that the entry 61*9712c20fSFrederick Mayle // was stored at. 62*9712c20fSFrederick Mayle bool Retrieve(const AddressType& address, 63*9712c20fSFrederick Mayle EntryType* entry, AddressType* entry_address) const; 64*9712c20fSFrederick Mayle 65*9712c20fSFrederick Mayle // Empties the address map, restoring it to the same state as when it was 66*9712c20fSFrederick Mayle // initially created. 67*9712c20fSFrederick Mayle void Clear(); 68*9712c20fSFrederick Mayle 69*9712c20fSFrederick Mayle private: 70*9712c20fSFrederick Mayle friend class AddressMapSerializer<AddressType, EntryType>; 71*9712c20fSFrederick Mayle friend class ModuleComparer; 72*9712c20fSFrederick Mayle 73*9712c20fSFrederick Mayle // Convenience types. 74*9712c20fSFrederick Mayle typedef std::map<AddressType, EntryType> AddressToEntryMap; 75*9712c20fSFrederick Mayle typedef typename AddressToEntryMap::const_iterator MapConstIterator; 76*9712c20fSFrederick Mayle typedef typename AddressToEntryMap::value_type MapValue; 77*9712c20fSFrederick Mayle 78*9712c20fSFrederick Mayle // Maps the address of each entry to an EntryType. 79*9712c20fSFrederick Mayle AddressToEntryMap map_; 80*9712c20fSFrederick Mayle }; 81*9712c20fSFrederick Mayle 82*9712c20fSFrederick Mayle } // namespace google_breakpad 83*9712c20fSFrederick Mayle 84*9712c20fSFrederick Mayle #endif // PROCESSOR_ADDRESS_MAP_H__ 85