michael@0: // Copyright (c) 2006, Google Inc.
michael@0: // All rights reserved.
michael@0: //
michael@0: // Redistribution and use in source and binary forms, with or without
michael@0: // modification, are permitted provided that the following conditions are
michael@0: // met:
michael@0: //
michael@0: //     * Redistributions of source code must retain the above copyright
michael@0: // notice, this list of conditions and the following disclaimer.
michael@0: //     * Redistributions in binary form must reproduce the above
michael@0: // copyright notice, this list of conditions and the following disclaimer
michael@0: // in the documentation and/or other materials provided with the
michael@0: // distribution.
michael@0: //     * Neither the name of Google Inc. nor the names of its
michael@0: // contributors may be used to endorse or promote products derived from
michael@0: // this software without specific prior written permission.
michael@0: //
michael@0: // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
michael@0: // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
michael@0: // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
michael@0: // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
michael@0: // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
michael@0: // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
michael@0: // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
michael@0: // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
michael@0: // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
michael@0: // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
michael@0: // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
michael@0: 
michael@0: // basic_code_modules.cc: Contains all of the CodeModule objects that
michael@0: // were loaded into a single process.
michael@0: //
michael@0: // See basic_code_modules.h for documentation.
michael@0: //
michael@0: // Author: Mark Mentovai
michael@0: 
michael@0: #include "processor/basic_code_modules.h"
michael@0: 
michael@0: #include <assert.h>
michael@0: 
michael@0: #include "google_breakpad/processor/code_module.h"
michael@0: #include "processor/linked_ptr.h"
michael@0: #include "common/logging.h"
michael@0: #include "processor/range_map-inl.h"
michael@0: 
michael@0: namespace google_breakpad {
michael@0: 
michael@0: BasicCodeModules::BasicCodeModules(const CodeModules *that)
michael@0:     : main_address_(0),
michael@0:       map_(new RangeMap<uint64_t, linked_ptr<const CodeModule> >()) {
michael@0:   BPLOG_IF(ERROR, !that) << "BasicCodeModules::BasicCodeModules requires "
michael@0:                             "|that|";
michael@0:   assert(that);
michael@0: 
michael@0:   const CodeModule *main_module = that->GetMainModule();
michael@0:   if (main_module)
michael@0:     main_address_ = main_module->base_address();
michael@0: 
michael@0:   unsigned int count = that->module_count();
michael@0:   for (unsigned int module_sequence = 0;
michael@0:        module_sequence < count;
michael@0:        ++module_sequence) {
michael@0:     // Make a copy of the module and insert it into the map.  Use
michael@0:     // GetModuleAtIndex because ordering is unimportant when slurping the
michael@0:     // entire list, and GetModuleAtIndex may be faster than
michael@0:     // GetModuleAtSequence.
michael@0:     const CodeModule *module = that->GetModuleAtIndex(module_sequence)->Copy();
michael@0:     if (!map_->StoreRange(module->base_address(), module->size(),
michael@0:                           linked_ptr<const CodeModule>(module))) {
michael@0:       BPLOG(ERROR) << "Module " << module->code_file() <<
michael@0:                       " could not be stored";
michael@0:     }
michael@0:   }
michael@0: }
michael@0: 
michael@0: BasicCodeModules::~BasicCodeModules() {
michael@0:   delete map_;
michael@0: }
michael@0: 
michael@0: unsigned int BasicCodeModules::module_count() const {
michael@0:   return map_->GetCount();
michael@0: }
michael@0: 
michael@0: const CodeModule* BasicCodeModules::GetModuleForAddress(
michael@0:     uint64_t address) const {
michael@0:   linked_ptr<const CodeModule> module;
michael@0:   if (!map_->RetrieveRange(address, &module, NULL, NULL)) {
michael@0:     BPLOG(INFO) << "No module at " << HexString(address);
michael@0:     return NULL;
michael@0:   }
michael@0: 
michael@0:   return module.get();
michael@0: }
michael@0: 
michael@0: const CodeModule* BasicCodeModules::GetMainModule() const {
michael@0:   return GetModuleForAddress(main_address_);
michael@0: }
michael@0: 
michael@0: const CodeModule* BasicCodeModules::GetModuleAtSequence(
michael@0:     unsigned int sequence) const {
michael@0:   linked_ptr<const CodeModule> module;
michael@0:   if (!map_->RetrieveRangeAtIndex(sequence, &module, NULL, NULL)) {
michael@0:     BPLOG(ERROR) << "RetrieveRangeAtIndex failed for sequence " << sequence;
michael@0:     return NULL;
michael@0:   }
michael@0: 
michael@0:   return module.get();
michael@0: }
michael@0: 
michael@0: const CodeModule* BasicCodeModules::GetModuleAtIndex(
michael@0:     unsigned int index) const {
michael@0:   // This class stores everything in a RangeMap, without any more-efficient
michael@0:   // way to walk the list of CodeModule objects.  Implement GetModuleAtIndex
michael@0:   // using GetModuleAtSequence, which meets all of the requirements, and
michael@0:   // in addition, guarantees ordering.
michael@0:   return GetModuleAtSequence(index);
michael@0: }
michael@0: 
michael@0: const CodeModules* BasicCodeModules::Copy() const {
michael@0:   return new BasicCodeModules(this);
michael@0: }
michael@0: 
michael@0: }  // namespace google_breakpad