|
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 |
|
30 // static_address_map-inl.h: StaticAddressMap implementation. |
|
31 // |
|
32 // See static_address_map.h for documentation. |
|
33 // |
|
34 // Author: Siyang Xie (lambxsy@google.com) |
|
35 |
|
36 #ifndef PROCESSOR_STATIC_ADDRESS_MAP_INL_H__ |
|
37 #define PROCESSOR_STATIC_ADDRESS_MAP_INL_H__ |
|
38 |
|
39 #include "processor/static_address_map.h" |
|
40 |
|
41 #include "common/logging.h" |
|
42 |
|
43 namespace google_breakpad { |
|
44 |
|
45 template<typename AddressType, typename EntryType> |
|
46 bool StaticAddressMap<AddressType, EntryType>::Retrieve( |
|
47 const AddressType &address, |
|
48 const EntryType *&entry, AddressType *entry_address) const { |
|
49 |
|
50 // upper_bound gives the first element whose key is greater than address, |
|
51 // but we want the first element whose key is less than or equal to address. |
|
52 // Decrement the iterator to get there, but not if the upper_bound already |
|
53 // points to the beginning of the map - in that case, address is lower than |
|
54 // the lowest stored key, so return false. |
|
55 |
|
56 MapConstIterator iterator = map_.upper_bound(address); |
|
57 if (iterator == map_.begin()) |
|
58 return false; |
|
59 --iterator; |
|
60 |
|
61 entry = iterator.GetValuePtr(); |
|
62 // Make sure AddressType is a copyable basic type |
|
63 if (entry_address) |
|
64 *entry_address = iterator.GetKey(); |
|
65 |
|
66 return true; |
|
67 } |
|
68 |
|
69 } // namespace google_breakpad |
|
70 |
|
71 #endif // PROCESSOR_STATIC_ADDRESS_MAP_INL_H__ |