toolkit/crashreporter/google-breakpad/src/processor/static_range_map-inl.h@6474c204b198 (annotated)
toolkit/crashreporter/google-breakpad/src/processor/static_range_map-inl.h
Wed, 31 Dec 2014 06:09:35 +0100
- author
- Michael Schloh von Bennewitz <michael@schloh.com>
- date
- Wed, 31 Dec 2014 06:09:35 +0100
- changeset 0
- 6474c204b198
- permissions
- -rw-r--r--
Cloned upstream origin tor-browser at tor-browser-31.3.0esr-4.5-1-build1
revision ID fc1c9ff7c1b2defdbc039f12214767608f46423f for hacking purpose.
| michael@0 | 1 | // Copyright (c) 2010 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 | // static_range_map-inl.h: StaticRangeMap implementation. |
| michael@0 | 31 | // |
| michael@0 | 32 | // See static_range_map.h for documentation. |
| michael@0 | 33 | // |
| michael@0 | 34 | // Author: Siyang Xie (lambxsy@google.com) |
| michael@0 | 35 | |
| michael@0 | 36 | #ifndef PROCESSOR_STATIC_RANGE_MAP_INL_H__ |
| michael@0 | 37 | #define PROCESSOR_STATIC_RANGE_MAP_INL_H__ |
| michael@0 | 38 | |
| michael@0 | 39 | #include "processor/static_range_map.h" |
| michael@0 | 40 | #include "common/logging.h" |
| michael@0 | 41 | |
| michael@0 | 42 | namespace google_breakpad { |
| michael@0 | 43 | |
| michael@0 | 44 | template<typename AddressType, typename EntryType> |
| michael@0 | 45 | bool StaticRangeMap<AddressType, EntryType>::RetrieveRange( |
| michael@0 | 46 | const AddressType &address, const EntryType *&entry, |
| michael@0 | 47 | AddressType *entry_base, AddressType *entry_size) const { |
| michael@0 | 48 | MapConstIterator iterator = map_.lower_bound(address); |
| michael@0 | 49 | if (iterator == map_.end()) |
| michael@0 | 50 | return false; |
| michael@0 | 51 | |
| michael@0 | 52 | // The map is keyed by the high address of each range, so |address| is |
| michael@0 | 53 | // guaranteed to be lower than the range's high address. If |range| is |
| michael@0 | 54 | // not directly preceded by another range, it's possible for address to |
| michael@0 | 55 | // be below the range's low address, though. When that happens, address |
| michael@0 | 56 | // references something not within any range, so return false. |
| michael@0 | 57 | |
| michael@0 | 58 | const Range *range = iterator.GetValuePtr(); |
| michael@0 | 59 | |
| michael@0 | 60 | // Make sure AddressType and EntryType are copyable basic types |
| michael@0 | 61 | // e.g.: integer types, pointers etc |
| michael@0 | 62 | if (address < range->base()) |
| michael@0 | 63 | return false; |
| michael@0 | 64 | |
| michael@0 | 65 | entry = range->entryptr(); |
| michael@0 | 66 | if (entry_base) |
| michael@0 | 67 | *entry_base = range->base(); |
| michael@0 | 68 | if (entry_size) |
| michael@0 | 69 | *entry_size = iterator.GetKey() - range->base() + 1; |
| michael@0 | 70 | |
| michael@0 | 71 | return true; |
| michael@0 | 72 | } |
| michael@0 | 73 | |
| michael@0 | 74 | |
| michael@0 | 75 | template<typename AddressType, typename EntryType> |
| michael@0 | 76 | bool StaticRangeMap<AddressType, EntryType>::RetrieveNearestRange( |
| michael@0 | 77 | const AddressType &address, const EntryType *&entry, |
| michael@0 | 78 | AddressType *entry_base, AddressType *entry_size) const { |
| michael@0 | 79 | // If address is within a range, RetrieveRange can handle it. |
| michael@0 | 80 | if (RetrieveRange(address, entry, entry_base, entry_size)) |
| michael@0 | 81 | return true; |
| michael@0 | 82 | |
| michael@0 | 83 | // upper_bound gives the first element whose key is greater than address, |
| michael@0 | 84 | // but we want the first element whose key is less than or equal to address. |
| michael@0 | 85 | // Decrement the iterator to get there, but not if the upper_bound already |
| michael@0 | 86 | // points to the beginning of the map - in that case, address is lower than |
| michael@0 | 87 | // the lowest stored key, so return false. |
| michael@0 | 88 | |
| michael@0 | 89 | MapConstIterator iterator = map_.upper_bound(address); |
| michael@0 | 90 | if (iterator == map_.begin()) |
| michael@0 | 91 | return false; |
| michael@0 | 92 | --iterator; |
| michael@0 | 93 | |
| michael@0 | 94 | const Range *range = iterator.GetValuePtr(); |
| michael@0 | 95 | entry = range->entryptr(); |
| michael@0 | 96 | if (entry_base) |
| michael@0 | 97 | *entry_base = range->base(); |
| michael@0 | 98 | if (entry_size) |
| michael@0 | 99 | *entry_size = iterator.GetKey() - range->base() + 1; |
| michael@0 | 100 | |
| michael@0 | 101 | return true; |
| michael@0 | 102 | } |
| michael@0 | 103 | |
| michael@0 | 104 | template<typename AddressType, typename EntryType> |
| michael@0 | 105 | bool StaticRangeMap<AddressType, EntryType>::RetrieveRangeAtIndex( |
| michael@0 | 106 | int index, const EntryType *&entry, |
| michael@0 | 107 | AddressType *entry_base, AddressType *entry_size) const { |
| michael@0 | 108 | |
| michael@0 | 109 | if (index >= GetCount()) { |
| michael@0 | 110 | BPLOG(ERROR) << "Index out of range: " << index << "/" << GetCount(); |
| michael@0 | 111 | return false; |
| michael@0 | 112 | } |
| michael@0 | 113 | |
| michael@0 | 114 | MapConstIterator iterator = map_.IteratorAtIndex(index); |
| michael@0 | 115 | |
| michael@0 | 116 | const Range *range = iterator.GetValuePtr(); |
| michael@0 | 117 | |
| michael@0 | 118 | entry = range->entryptr(); |
| michael@0 | 119 | if (entry_base) |
| michael@0 | 120 | *entry_base = range->base(); |
| michael@0 | 121 | if (entry_size) |
| michael@0 | 122 | *entry_size = iterator.GetKey() - range->base() + 1; |
| michael@0 | 123 | |
| michael@0 | 124 | return true; |
| michael@0 | 125 | } |
| michael@0 | 126 | |
| michael@0 | 127 | } // namespace google_breakpad |
| michael@0 | 128 | |
| michael@0 | 129 | |
| michael@0 | 130 | #endif // PROCESSOR_STATIC_RANGE_MAP_INL_H__ |
