/thirdparty/breakpad/processor/static_range_map-inl.h

http://github.com/tomahawk-player/tomahawk · C++ Header · 130 lines · 59 code · 25 blank · 46 comment · 13 complexity · 060223e50b02fa1ae75861a2b96de3d0 MD5 · raw file

  1. // Copyright (c) 2010 Google Inc.
  2. // All rights reserved.
  3. //
  4. // Redistribution and use in source and binary forms, with or without
  5. // modification, are permitted provided that the following conditions are
  6. // met:
  7. //
  8. // * Redistributions of source code must retain the above copyright
  9. // notice, this list of conditions and the following disclaimer.
  10. // * Redistributions in binary form must reproduce the above
  11. // copyright notice, this list of conditions and the following disclaimer
  12. // in the documentation and/or other materials provided with the
  13. // distribution.
  14. // * Neither the name of Google Inc. nor the names of its
  15. // contributors may be used to endorse or promote products derived from
  16. // this software without specific prior written permission.
  17. //
  18. // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
  19. // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
  20. // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
  21. // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
  22. // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
  23. // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
  24. // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
  25. // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
  26. // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
  27. // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
  28. // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  29. // static_range_map-inl.h: StaticRangeMap implementation.
  30. //
  31. // See static_range_map.h for documentation.
  32. //
  33. // Author: Siyang Xie (lambxsy@google.com)
  34. #ifndef PROCESSOR_STATIC_RANGE_MAP_INL_H__
  35. #define PROCESSOR_STATIC_RANGE_MAP_INL_H__
  36. #include "processor/static_range_map.h"
  37. #include "processor/logging.h"
  38. namespace google_breakpad {
  39. template<typename AddressType, typename EntryType>
  40. bool StaticRangeMap<AddressType, EntryType>::RetrieveRange(
  41. const AddressType &address, const EntryType *&entry,
  42. AddressType *entry_base, AddressType *entry_size) const {
  43. MapConstIterator iterator = map_.lower_bound(address);
  44. if (iterator == map_.end())
  45. return false;
  46. // The map is keyed by the high address of each range, so |address| is
  47. // guaranteed to be lower than the range's high address. If |range| is
  48. // not directly preceded by another range, it's possible for address to
  49. // be below the range's low address, though. When that happens, address
  50. // references something not within any range, so return false.
  51. const Range *range = iterator.GetValuePtr();
  52. // Make sure AddressType and EntryType are copyable basic types
  53. // e.g.: integer types, pointers etc
  54. if (address < range->base())
  55. return false;
  56. entry = range->entryptr();
  57. if (entry_base)
  58. *entry_base = range->base();
  59. if (entry_size)
  60. *entry_size = iterator.GetKey() - range->base() + 1;
  61. return true;
  62. }
  63. template<typename AddressType, typename EntryType>
  64. bool StaticRangeMap<AddressType, EntryType>::RetrieveNearestRange(
  65. const AddressType &address, const EntryType *&entry,
  66. AddressType *entry_base, AddressType *entry_size) const {
  67. // If address is within a range, RetrieveRange can handle it.
  68. if (RetrieveRange(address, entry, entry_base, entry_size))
  69. return true;
  70. // upper_bound gives the first element whose key is greater than address,
  71. // but we want the first element whose key is less than or equal to address.
  72. // Decrement the iterator to get there, but not if the upper_bound already
  73. // points to the beginning of the map - in that case, address is lower than
  74. // the lowest stored key, so return false.
  75. MapConstIterator iterator = map_.upper_bound(address);
  76. if (iterator == map_.begin())
  77. return false;
  78. --iterator;
  79. const Range *range = iterator.GetValuePtr();
  80. entry = range->entryptr();
  81. if (entry_base)
  82. *entry_base = range->base();
  83. if (entry_size)
  84. *entry_size = iterator.GetKey() - range->base() + 1;
  85. return true;
  86. }
  87. template<typename AddressType, typename EntryType>
  88. bool StaticRangeMap<AddressType, EntryType>::RetrieveRangeAtIndex(
  89. int index, const EntryType *&entry,
  90. AddressType *entry_base, AddressType *entry_size) const {
  91. if (index >= GetCount()) {
  92. BPLOG(ERROR) << "Index out of range: " << index << "/" << GetCount();
  93. return false;
  94. }
  95. MapConstIterator iterator = map_.IteratorAtIndex(index);
  96. const Range *range = iterator.GetValuePtr();
  97. entry = range->entryptr();
  98. if (entry_base)
  99. *entry_base = range->base();
  100. if (entry_size)
  101. *entry_size = iterator.GetKey() - range->base() + 1;
  102. return true;
  103. }
  104. } // namespace google_breakpad
  105. #endif // PROCESSOR_STATIC_RANGE_MAP_INL_H__