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_address_map-inl.h: StaticAddressMap implementation.
michael@0: //
michael@0: // See static_address_map.h for documentation.
michael@0: //
michael@0: // Author: Siyang Xie (lambxsy@google.com)
michael@0: 
michael@0: #ifndef PROCESSOR_STATIC_ADDRESS_MAP_INL_H__
michael@0: #define PROCESSOR_STATIC_ADDRESS_MAP_INL_H__
michael@0: 
michael@0: #include "processor/static_address_map.h"
michael@0: 
michael@0: #include "common/logging.h"
michael@0: 
michael@0: namespace google_breakpad {
michael@0: 
michael@0: template<typename AddressType, typename EntryType>
michael@0: bool StaticAddressMap<AddressType, EntryType>::Retrieve(
michael@0:     const AddressType &address,
michael@0:     const EntryType *&entry, AddressType *entry_address) const {
michael@0: 
michael@0:   // upper_bound gives the first element whose key is greater than address,
michael@0:   // but we want the first element whose key is less than or equal to address.
michael@0:   // Decrement the iterator to get there, but not if the upper_bound already
michael@0:   // points to the beginning of the map - in that case, address is lower than
michael@0:   // the lowest stored key, so return false.
michael@0: 
michael@0:   MapConstIterator iterator = map_.upper_bound(address);
michael@0:   if (iterator == map_.begin())
michael@0:     return false;
michael@0:   --iterator;
michael@0: 
michael@0:   entry = iterator.GetValuePtr();
michael@0:   // Make sure AddressType is a copyable basic type
michael@0:   if (entry_address)
michael@0:     *entry_address = iterator.GetKey();
michael@0: 
michael@0:   return true;
michael@0: }
michael@0: 
michael@0: }  // namespace google_breakpad
michael@0: 
michael@0: #endif  // PROCESSOR_STATIC_ADDRESS_MAP_INL_H__