1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000
1.2 +++ b/toolkit/crashreporter/google-breakpad/src/processor/address_map-inl.h Wed Dec 31 06:09:35 2014 +0100
1.3 @@ -0,0 +1,93 @@
1.4 +// Copyright (c) 2006, 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 +// address_map-inl.h: Address map implementation.
1.34 +//
1.35 +// See address_map.h for documentation.
1.36 +//
1.37 +// Author: Mark Mentovai
1.38 +
1.39 +#ifndef PROCESSOR_ADDRESS_MAP_INL_H__
1.40 +#define PROCESSOR_ADDRESS_MAP_INL_H__
1.41 +
1.42 +#include "processor/address_map.h"
1.43 +
1.44 +#include <assert.h>
1.45 +
1.46 +#include "common/logging.h"
1.47 +
1.48 +namespace google_breakpad {
1.49 +
1.50 +template<typename AddressType, typename EntryType>
1.51 +bool AddressMap<AddressType, EntryType>::Store(const AddressType &address,
1.52 + const EntryType &entry) {
1.53 + // Ensure that the specified address doesn't conflict with something already
1.54 + // in the map.
1.55 + if (map_.find(address) != map_.end()) {
1.56 + BPLOG(INFO) << "Store failed, address " << HexString(address) <<
1.57 + " is already present";
1.58 + return false;
1.59 + }
1.60 +
1.61 + map_.insert(MapValue(address, entry));
1.62 + return true;
1.63 +}
1.64 +
1.65 +template<typename AddressType, typename EntryType>
1.66 +bool AddressMap<AddressType, EntryType>::Retrieve(
1.67 + const AddressType &address,
1.68 + EntryType *entry, AddressType *entry_address) const {
1.69 + BPLOG_IF(ERROR, !entry) << "AddressMap::Retrieve requires |entry|";
1.70 + assert(entry);
1.71 +
1.72 + // upper_bound gives the first element whose key is greater than address,
1.73 + // but we want the first element whose key is less than or equal to address.
1.74 + // Decrement the iterator to get there, but not if the upper_bound already
1.75 + // points to the beginning of the map - in that case, address is lower than
1.76 + // the lowest stored key, so return false.
1.77 + MapConstIterator iterator = map_.upper_bound(address);
1.78 + if (iterator == map_.begin())
1.79 + return false;
1.80 + --iterator;
1.81 +
1.82 + *entry = iterator->second;
1.83 + if (entry_address)
1.84 + *entry_address = iterator->first;
1.85 +
1.86 + return true;
1.87 +}
1.88 +
1.89 +template<typename AddressType, typename EntryType>
1.90 +void AddressMap<AddressType, EntryType>::Clear() {
1.91 + map_.clear();
1.92 +}
1.93 +
1.94 +} // namespace google_breakpad
1.95 +
1.96 +#endif // PROCESSOR_ADDRESS_MAP_INL_H__
