toolkit/crashreporter/google-breakpad/src/processor/basic_code_modules.cc@129ffea94266 (annotated)
toolkit/crashreporter/google-breakpad/src/processor/basic_code_modules.cc
Sat, 03 Jan 2015 20:18:00 +0100
- author
- Michael Schloh von Bennewitz <michael@schloh.com>
- date
- Sat, 03 Jan 2015 20:18:00 +0100
- branch
- TOR_BUG_3246
- changeset 7
- 129ffea94266
- permissions
- -rw-r--r--
Conditionally enable double key logic according to:
private browsing mode or privacy.thirdparty.isolate preference and
implement in GetCookieStringCommon and FindCookie where it counts...
With some reservations of how to convince FindCookie users to test
condition and pass a nullptr when disabling double key logic.
| michael@0 | 1 | // Copyright (c) 2006, 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 | // basic_code_modules.cc: Contains all of the CodeModule objects that |
| michael@0 | 31 | // were loaded into a single process. |
| michael@0 | 32 | // |
| michael@0 | 33 | // See basic_code_modules.h for documentation. |
| michael@0 | 34 | // |
| michael@0 | 35 | // Author: Mark Mentovai |
| michael@0 | 36 | |
| michael@0 | 37 | #include "processor/basic_code_modules.h" |
| michael@0 | 38 | |
| michael@0 | 39 | #include <assert.h> |
| michael@0 | 40 | |
| michael@0 | 41 | #include "google_breakpad/processor/code_module.h" |
| michael@0 | 42 | #include "processor/linked_ptr.h" |
| michael@0 | 43 | #include "common/logging.h" |
| michael@0 | 44 | #include "processor/range_map-inl.h" |
| michael@0 | 45 | |
| michael@0 | 46 | namespace google_breakpad { |
| michael@0 | 47 | |
| michael@0 | 48 | BasicCodeModules::BasicCodeModules(const CodeModules *that) |
| michael@0 | 49 | : main_address_(0), |
| michael@0 | 50 | map_(new RangeMap<uint64_t, linked_ptr<const CodeModule> >()) { |
| michael@0 | 51 | BPLOG_IF(ERROR, !that) << "BasicCodeModules::BasicCodeModules requires " |
| michael@0 | 52 | "|that|"; |
| michael@0 | 53 | assert(that); |
| michael@0 | 54 | |
| michael@0 | 55 | const CodeModule *main_module = that->GetMainModule(); |
| michael@0 | 56 | if (main_module) |
| michael@0 | 57 | main_address_ = main_module->base_address(); |
| michael@0 | 58 | |
| michael@0 | 59 | unsigned int count = that->module_count(); |
| michael@0 | 60 | for (unsigned int module_sequence = 0; |
| michael@0 | 61 | module_sequence < count; |
| michael@0 | 62 | ++module_sequence) { |
| michael@0 | 63 | // Make a copy of the module and insert it into the map. Use |
| michael@0 | 64 | // GetModuleAtIndex because ordering is unimportant when slurping the |
| michael@0 | 65 | // entire list, and GetModuleAtIndex may be faster than |
| michael@0 | 66 | // GetModuleAtSequence. |
| michael@0 | 67 | const CodeModule *module = that->GetModuleAtIndex(module_sequence)->Copy(); |
| michael@0 | 68 | if (!map_->StoreRange(module->base_address(), module->size(), |
| michael@0 | 69 | linked_ptr<const CodeModule>(module))) { |
| michael@0 | 70 | BPLOG(ERROR) << "Module " << module->code_file() << |
| michael@0 | 71 | " could not be stored"; |
| michael@0 | 72 | } |
| michael@0 | 73 | } |
| michael@0 | 74 | } |
| michael@0 | 75 | |
| michael@0 | 76 | BasicCodeModules::~BasicCodeModules() { |
| michael@0 | 77 | delete map_; |
| michael@0 | 78 | } |
| michael@0 | 79 | |
| michael@0 | 80 | unsigned int BasicCodeModules::module_count() const { |
| michael@0 | 81 | return map_->GetCount(); |
| michael@0 | 82 | } |
| michael@0 | 83 | |
| michael@0 | 84 | const CodeModule* BasicCodeModules::GetModuleForAddress( |
| michael@0 | 85 | uint64_t address) const { |
| michael@0 | 86 | linked_ptr<const CodeModule> module; |
| michael@0 | 87 | if (!map_->RetrieveRange(address, &module, NULL, NULL)) { |
| michael@0 | 88 | BPLOG(INFO) << "No module at " << HexString(address); |
| michael@0 | 89 | return NULL; |
| michael@0 | 90 | } |
| michael@0 | 91 | |
| michael@0 | 92 | return module.get(); |
| michael@0 | 93 | } |
| michael@0 | 94 | |
| michael@0 | 95 | const CodeModule* BasicCodeModules::GetMainModule() const { |
| michael@0 | 96 | return GetModuleForAddress(main_address_); |
| michael@0 | 97 | } |
| michael@0 | 98 | |
| michael@0 | 99 | const CodeModule* BasicCodeModules::GetModuleAtSequence( |
| michael@0 | 100 | unsigned int sequence) const { |
| michael@0 | 101 | linked_ptr<const CodeModule> module; |
| michael@0 | 102 | if (!map_->RetrieveRangeAtIndex(sequence, &module, NULL, NULL)) { |
| michael@0 | 103 | BPLOG(ERROR) << "RetrieveRangeAtIndex failed for sequence " << sequence; |
| michael@0 | 104 | return NULL; |
| michael@0 | 105 | } |
| michael@0 | 106 | |
| michael@0 | 107 | return module.get(); |
| michael@0 | 108 | } |
| michael@0 | 109 | |
| michael@0 | 110 | const CodeModule* BasicCodeModules::GetModuleAtIndex( |
| michael@0 | 111 | unsigned int index) const { |
| michael@0 | 112 | // This class stores everything in a RangeMap, without any more-efficient |
| michael@0 | 113 | // way to walk the list of CodeModule objects. Implement GetModuleAtIndex |
| michael@0 | 114 | // using GetModuleAtSequence, which meets all of the requirements, and |
| michael@0 | 115 | // in addition, guarantees ordering. |
| michael@0 | 116 | return GetModuleAtSequence(index); |
| michael@0 | 117 | } |
| michael@0 | 118 | |
| michael@0 | 119 | const CodeModules* BasicCodeModules::Copy() const { |
| michael@0 | 120 | return new BasicCodeModules(this); |
| michael@0 | 121 | } |
| michael@0 | 122 | |
| michael@0 | 123 | } // namespace google_breakpad |
