Thu, 22 Jan 2015 13:21:57 +0100
Incorporate requested changes from Mozilla in review:
https://bugzilla.mozilla.org/show_bug.cgi?id=1123480#c6
michael@0 | 1 | // Copyright (c) 2006, Google Inc. |
michael@0 | 2 | // All rights reserved. |
michael@0 | 3 | // |
michael@0 | 4 | // Redistribution and use in source and binary forms, with or without |
michael@0 | 5 | // modification, are permitted provided that the following conditions are |
michael@0 | 6 | // met: |
michael@0 | 7 | // |
michael@0 | 8 | // * Redistributions of source code must retain the above copyright |
michael@0 | 9 | // notice, this list of conditions and the following disclaimer. |
michael@0 | 10 | // * Redistributions in binary form must reproduce the above |
michael@0 | 11 | // copyright notice, this list of conditions and the following disclaimer |
michael@0 | 12 | // in the documentation and/or other materials provided with the |
michael@0 | 13 | // distribution. |
michael@0 | 14 | // * Neither the name of Google Inc. nor the names of its |
michael@0 | 15 | // contributors may be used to endorse or promote products derived from |
michael@0 | 16 | // this software without specific prior written permission. |
michael@0 | 17 | // |
michael@0 | 18 | // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
michael@0 | 19 | // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
michael@0 | 20 | // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
michael@0 | 21 | // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
michael@0 | 22 | // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
michael@0 | 23 | // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
michael@0 | 24 | // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
michael@0 | 25 | // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
michael@0 | 26 | // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
michael@0 | 27 | // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
michael@0 | 28 | // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
michael@0 | 29 | |
michael@0 | 30 | // address_map-inl.h: Address map implementation. |
michael@0 | 31 | // |
michael@0 | 32 | // See address_map.h for documentation. |
michael@0 | 33 | // |
michael@0 | 34 | // Author: Mark Mentovai |
michael@0 | 35 | |
michael@0 | 36 | #ifndef PROCESSOR_ADDRESS_MAP_INL_H__ |
michael@0 | 37 | #define PROCESSOR_ADDRESS_MAP_INL_H__ |
michael@0 | 38 | |
michael@0 | 39 | #include "processor/address_map.h" |
michael@0 | 40 | |
michael@0 | 41 | #include <assert.h> |
michael@0 | 42 | |
michael@0 | 43 | #include "common/logging.h" |
michael@0 | 44 | |
michael@0 | 45 | namespace google_breakpad { |
michael@0 | 46 | |
michael@0 | 47 | template<typename AddressType, typename EntryType> |
michael@0 | 48 | bool AddressMap<AddressType, EntryType>::Store(const AddressType &address, |
michael@0 | 49 | const EntryType &entry) { |
michael@0 | 50 | // Ensure that the specified address doesn't conflict with something already |
michael@0 | 51 | // in the map. |
michael@0 | 52 | if (map_.find(address) != map_.end()) { |
michael@0 | 53 | BPLOG(INFO) << "Store failed, address " << HexString(address) << |
michael@0 | 54 | " is already present"; |
michael@0 | 55 | return false; |
michael@0 | 56 | } |
michael@0 | 57 | |
michael@0 | 58 | map_.insert(MapValue(address, entry)); |
michael@0 | 59 | return true; |
michael@0 | 60 | } |
michael@0 | 61 | |
michael@0 | 62 | template<typename AddressType, typename EntryType> |
michael@0 | 63 | bool AddressMap<AddressType, EntryType>::Retrieve( |
michael@0 | 64 | const AddressType &address, |
michael@0 | 65 | EntryType *entry, AddressType *entry_address) const { |
michael@0 | 66 | BPLOG_IF(ERROR, !entry) << "AddressMap::Retrieve requires |entry|"; |
michael@0 | 67 | assert(entry); |
michael@0 | 68 | |
michael@0 | 69 | // upper_bound gives the first element whose key is greater than address, |
michael@0 | 70 | // but we want the first element whose key is less than or equal to address. |
michael@0 | 71 | // Decrement the iterator to get there, but not if the upper_bound already |
michael@0 | 72 | // points to the beginning of the map - in that case, address is lower than |
michael@0 | 73 | // the lowest stored key, so return false. |
michael@0 | 74 | MapConstIterator iterator = map_.upper_bound(address); |
michael@0 | 75 | if (iterator == map_.begin()) |
michael@0 | 76 | return false; |
michael@0 | 77 | --iterator; |
michael@0 | 78 | |
michael@0 | 79 | *entry = iterator->second; |
michael@0 | 80 | if (entry_address) |
michael@0 | 81 | *entry_address = iterator->first; |
michael@0 | 82 | |
michael@0 | 83 | return true; |
michael@0 | 84 | } |
michael@0 | 85 | |
michael@0 | 86 | template<typename AddressType, typename EntryType> |
michael@0 | 87 | void AddressMap<AddressType, EntryType>::Clear() { |
michael@0 | 88 | map_.clear(); |
michael@0 | 89 | } |
michael@0 | 90 | |
michael@0 | 91 | } // namespace google_breakpad |
michael@0 | 92 | |
michael@0 | 93 | #endif // PROCESSOR_ADDRESS_MAP_INL_H__ |