michael@0: // Copyright (c) 2010, Google Inc.
michael@0: // All rights reserved.
michael@0: //
michael@0: // Redistribution and use in source and binary forms, with or without
michael@0: // modification, are permitted provided that the following conditions are
michael@0: // met:
michael@0: //
michael@0: //     * Redistributions of source code must retain the above copyright
michael@0: // notice, this list of conditions and the following disclaimer.
michael@0: //     * Redistributions in binary form must reproduce the above
michael@0: // copyright notice, this list of conditions and the following disclaimer
michael@0: // in the documentation and/or other materials provided with the
michael@0: // distribution.
michael@0: //     * Neither the name of Google Inc. nor the names of its
michael@0: // contributors may be used to endorse or promote products derived from
michael@0: // this software without specific prior written permission.
michael@0: //
michael@0: // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
michael@0: // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
michael@0: // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
michael@0: // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
michael@0: // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
michael@0: // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
michael@0: // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
michael@0: // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
michael@0: // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
michael@0: // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
michael@0: // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
michael@0: //
michael@0: // static_range_map.h: StaticRangeMap.
michael@0: //
michael@0: // StaticRangeMap is similar as RangeMap.  However, StaticRangeMap wraps a
michael@0: // StaticMap instead of std::map, and does not support dynamic operations like
michael@0: // StoreRange(...).  StaticRangeMap provides same Retrieve*() interfaces as
michael@0: // RangeMap.  Please see range_map.h for more documentation.
michael@0: //
michael@0: // Author: Siyang Xie (lambxsy@google.com)
michael@0: 
michael@0: #ifndef PROCESSOR_STATIC_RANGE_MAP_H__
michael@0: #define PROCESSOR_STATIC_RANGE_MAP_H__
michael@0: 
michael@0: 
michael@0: #include "processor/static_map-inl.h"
michael@0: 
michael@0: namespace google_breakpad {
michael@0: 
michael@0: // AddressType is basic type, e.g.: integer types, pointers etc
michael@0: // EntryType could be a complex type, so we retrieve its pointer instead.
michael@0: template<typename AddressType, typename EntryType>
michael@0: class StaticRangeMap {
michael@0:  public:
michael@0:   StaticRangeMap(): map_() { }
michael@0:   explicit StaticRangeMap(const char *memory): map_(memory) { }
michael@0: 
michael@0:   // Locates the range encompassing the supplied address.  If there is
michael@0:   // no such range, returns false.  entry_base and entry_size, if non-NULL,
michael@0:   // are set to the base and size of the entry's range.
michael@0:   bool RetrieveRange(const AddressType &address, const EntryType *&entry,
michael@0:                      AddressType *entry_base, AddressType *entry_size) const;
michael@0: 
michael@0:   // Locates the range encompassing the supplied address, if one exists.
michael@0:   // If no range encompasses the supplied address, locates the nearest range
michael@0:   // to the supplied address that is lower than the address.  Returns false
michael@0:   // if no range meets these criteria.  entry_base and entry_size, if
michael@0:   // non-NULL, are set to the base and size of the entry's range.
michael@0:   bool RetrieveNearestRange(const AddressType &address, const EntryType *&entry,
michael@0:                             AddressType *entry_base, AddressType *entry_size)
michael@0:                             const;
michael@0: 
michael@0:   // Treating all ranges as a list ordered by the address spaces that they
michael@0:   // occupy, locates the range at the index specified by index.  Returns
michael@0:   // false if index is larger than the number of ranges stored.  entry_base
michael@0:   // and entry_size, if non-NULL, are set to the base and size of the entry's
michael@0:   // range.
michael@0:   //
michael@0:   // RetrieveRangeAtIndex is not optimized for speedy operation.
michael@0:   bool RetrieveRangeAtIndex(int index, const EntryType *&entry,
michael@0:                             AddressType *entry_base, AddressType *entry_size)
michael@0:                             const;
michael@0: 
michael@0:   // Returns the number of ranges stored in the RangeMap.
michael@0:   inline int GetCount() const { return map_.size(); }
michael@0: 
michael@0:  private:
michael@0:   friend class ModuleComparer;
michael@0:   class Range {
michael@0:    public:
michael@0:     AddressType base() const {
michael@0:       return *(reinterpret_cast<const AddressType*>(this));
michael@0:     }
michael@0:     const EntryType* entryptr() const {
michael@0:       return reinterpret_cast<const EntryType*>(this + sizeof(AddressType));
michael@0:     }
michael@0:   };
michael@0: 
michael@0:   // Convenience types.
michael@0:   typedef StaticRangeMap* SelfPtr;
michael@0:   typedef StaticMap<AddressType, Range> AddressToRangeMap;
michael@0:   typedef typename AddressToRangeMap::const_iterator MapConstIterator;
michael@0: 
michael@0:   AddressToRangeMap map_;
michael@0: };
michael@0: 
michael@0: }  // namespace google_breakpad
michael@0: 
michael@0: #endif  // PROCESSOR_STATIC_RANGE_MAP_H__