1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000
1.2 +++ b/toolkit/crashreporter/google-breakpad/src/processor/static_range_map-inl.h Wed Dec 31 06:09:35 2014 +0100
1.3 @@ -0,0 +1,130 @@
1.4 +// Copyright (c) 2010 Google Inc.
1.5 +// All rights reserved.
1.6 +//
1.7 +// Redistribution and use in source and binary forms, with or without
1.8 +// modification, are permitted provided that the following conditions are
1.9 +// met:
1.10 +//
1.11 +// * Redistributions of source code must retain the above copyright
1.12 +// notice, this list of conditions and the following disclaimer.
1.13 +// * Redistributions in binary form must reproduce the above
1.14 +// copyright notice, this list of conditions and the following disclaimer
1.15 +// in the documentation and/or other materials provided with the
1.16 +// distribution.
1.17 +// * Neither the name of Google Inc. nor the names of its
1.18 +// contributors may be used to endorse or promote products derived from
1.19 +// this software without specific prior written permission.
1.20 +//
1.21 +// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
1.22 +// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
1.23 +// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
1.24 +// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
1.25 +// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
1.26 +// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
1.27 +// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
1.28 +// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
1.29 +// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
1.30 +// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
1.31 +// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
1.32 +
1.33 +// static_range_map-inl.h: StaticRangeMap implementation.
1.34 +//
1.35 +// See static_range_map.h for documentation.
1.36 +//
1.37 +// Author: Siyang Xie (lambxsy@google.com)
1.38 +
1.39 +#ifndef PROCESSOR_STATIC_RANGE_MAP_INL_H__
1.40 +#define PROCESSOR_STATIC_RANGE_MAP_INL_H__
1.41 +
1.42 +#include "processor/static_range_map.h"
1.43 +#include "common/logging.h"
1.44 +
1.45 +namespace google_breakpad {
1.46 +
1.47 +template<typename AddressType, typename EntryType>
1.48 +bool StaticRangeMap<AddressType, EntryType>::RetrieveRange(
1.49 + const AddressType &address, const EntryType *&entry,
1.50 + AddressType *entry_base, AddressType *entry_size) const {
1.51 + MapConstIterator iterator = map_.lower_bound(address);
1.52 + if (iterator == map_.end())
1.53 + return false;
1.54 +
1.55 + // The map is keyed by the high address of each range, so |address| is
1.56 + // guaranteed to be lower than the range's high address. If |range| is
1.57 + // not directly preceded by another range, it's possible for address to
1.58 + // be below the range's low address, though. When that happens, address
1.59 + // references something not within any range, so return false.
1.60 +
1.61 + const Range *range = iterator.GetValuePtr();
1.62 +
1.63 + // Make sure AddressType and EntryType are copyable basic types
1.64 + // e.g.: integer types, pointers etc
1.65 + if (address < range->base())
1.66 + return false;
1.67 +
1.68 + entry = range->entryptr();
1.69 + if (entry_base)
1.70 + *entry_base = range->base();
1.71 + if (entry_size)
1.72 + *entry_size = iterator.GetKey() - range->base() + 1;
1.73 +
1.74 + return true;
1.75 +}
1.76 +
1.77 +
1.78 +template<typename AddressType, typename EntryType>
1.79 +bool StaticRangeMap<AddressType, EntryType>::RetrieveNearestRange(
1.80 + const AddressType &address, const EntryType *&entry,
1.81 + AddressType *entry_base, AddressType *entry_size) const {
1.82 + // If address is within a range, RetrieveRange can handle it.
1.83 + if (RetrieveRange(address, entry, entry_base, entry_size))
1.84 + return true;
1.85 +
1.86 + // upper_bound gives the first element whose key is greater than address,
1.87 + // but we want the first element whose key is less than or equal to address.
1.88 + // Decrement the iterator to get there, but not if the upper_bound already
1.89 + // points to the beginning of the map - in that case, address is lower than
1.90 + // the lowest stored key, so return false.
1.91 +
1.92 + MapConstIterator iterator = map_.upper_bound(address);
1.93 + if (iterator == map_.begin())
1.94 + return false;
1.95 + --iterator;
1.96 +
1.97 + const Range *range = iterator.GetValuePtr();
1.98 + entry = range->entryptr();
1.99 + if (entry_base)
1.100 + *entry_base = range->base();
1.101 + if (entry_size)
1.102 + *entry_size = iterator.GetKey() - range->base() + 1;
1.103 +
1.104 + return true;
1.105 +}
1.106 +
1.107 +template<typename AddressType, typename EntryType>
1.108 +bool StaticRangeMap<AddressType, EntryType>::RetrieveRangeAtIndex(
1.109 + int index, const EntryType *&entry,
1.110 + AddressType *entry_base, AddressType *entry_size) const {
1.111 +
1.112 + if (index >= GetCount()) {
1.113 + BPLOG(ERROR) << "Index out of range: " << index << "/" << GetCount();
1.114 + return false;
1.115 + }
1.116 +
1.117 + MapConstIterator iterator = map_.IteratorAtIndex(index);
1.118 +
1.119 + const Range *range = iterator.GetValuePtr();
1.120 +
1.121 + entry = range->entryptr();
1.122 + if (entry_base)
1.123 + *entry_base = range->base();
1.124 + if (entry_size)
1.125 + *entry_size = iterator.GetKey() - range->base() + 1;
1.126 +
1.127 + return true;
1.128 +}
1.129 +
1.130 +} // namespace google_breakpad
1.131 +
1.132 +
1.133 +#endif // PROCESSOR_STATIC_RANGE_MAP_INL_H__
