From 51b170b470ed587f99a7c2a773e4464687f0d07a Mon Sep 17 00:00:00 2001 From: crueter Date: Mon, 4 Aug 2025 04:50:14 +0200 Subject: [cmake] refactor: Use CPM over submodules (#143) Transfers the majority of submodules and large externals to CPM, using source archives rather than full Git clones. Not only does this save massive amounts of clone and configure time, but dependencies are grabbed on-demand rather than being required by default. Additionally, CPM will (generally) automatically search for system dependencies, though certain dependencies have options to control this. Testing shows gains ranging from 5x to 10x in terms of overall clone/configure time. Reviewed-on: https://git.eden-emu.dev/eden-emu/eden/pulls/143 Reviewed-by: CamilleLaVey --- .../breakpad/src/processor/basic_code_modules.cc | 155 --------------------- 1 file changed, 155 deletions(-) delete mode 100644 externals/breakpad/src/processor/basic_code_modules.cc (limited to 'externals/breakpad/src/processor/basic_code_modules.cc') diff --git a/externals/breakpad/src/processor/basic_code_modules.cc b/externals/breakpad/src/processor/basic_code_modules.cc deleted file mode 100644 index bdfc8f3de9..0000000000 --- a/externals/breakpad/src/processor/basic_code_modules.cc +++ /dev/null @@ -1,155 +0,0 @@ -// Copyright 2006 Google LLC -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// * Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// * Redistributions in binary form must reproduce the above -// copyright notice, this list of conditions and the following disclaimer -// in the documentation and/or other materials provided with the -// distribution. -// * Neither the name of Google LLC nor the names of its -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS -// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT -// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR -// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT -// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, -// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT -// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, -// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY -// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT -// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE -// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. - -// basic_code_modules.cc: Contains all of the CodeModule objects that -// were loaded into a single process. -// -// See basic_code_modules.h for documentation. -// -// Author: Mark Mentovai - -#ifdef HAVE_CONFIG_H -#include // Must come first -#endif - -#include "processor/basic_code_modules.h" - -#include - -#include - -#include "google_breakpad/processor/code_module.h" -#include "processor/linked_ptr.h" -#include "processor/logging.h" -#include "processor/range_map-inl.h" - -namespace google_breakpad { - -using std::vector; - -BasicCodeModules::BasicCodeModules(const CodeModules* that, - MergeRangeStrategy strategy) - : main_address_(0), map_() { - BPLOG_IF(ERROR, !that) << "BasicCodeModules::BasicCodeModules requires " - "|that|"; - assert(that); - - map_.SetMergeStrategy(strategy); - - const CodeModule *main_module = that->GetMainModule(); - if (main_module) - main_address_ = main_module->base_address(); - - unsigned int count = that->module_count(); - for (unsigned int i = 0; i < count; ++i) { - // Make a copy of the module and insert it into the map. Use - // GetModuleAtIndex because ordering is unimportant when slurping the - // entire list, and GetModuleAtIndex may be faster than - // GetModuleAtSequence. - linked_ptr module(that->GetModuleAtIndex(i)->Copy()); - if (!map_.StoreRange(module->base_address(), module->size(), module)) { - BPLOG(ERROR) << "Module " << module->code_file() - << " could not be stored"; - } - } - - // Report modules with shrunk ranges. - for (unsigned int i = 0; i < count; ++i) { - linked_ptr module(that->GetModuleAtIndex(i)->Copy()); - uint64_t delta = 0; - if (map_.RetrieveRange(module->base_address() + module->size() - 1, - &module, NULL /* base */, &delta, NULL /* size */) && - delta > 0) { - BPLOG(INFO) << "The range for module " << module->code_file() - << " was shrunk down by " << HexString(delta) << " bytes."; - linked_ptr shrunk_range_module(module->Copy()); - shrunk_range_module->SetShrinkDownDelta(delta); - shrunk_range_modules_.push_back(shrunk_range_module); - } - } - - // TODO(ivanpe): Report modules with conflicting ranges. The list of such - // modules should be copied from |that|. -} - -BasicCodeModules::BasicCodeModules() : main_address_(0), map_() { } - -BasicCodeModules::~BasicCodeModules() { -} - -unsigned int BasicCodeModules::module_count() const { - return map_.GetCount(); -} - -const CodeModule* BasicCodeModules::GetModuleForAddress( - uint64_t address) const { - linked_ptr module; - if (!map_.RetrieveRange(address, &module, NULL /* base */, NULL /* delta */, - NULL /* size */)) { - BPLOG(INFO) << "No module at " << HexString(address); - return NULL; - } - - return module.get(); -} - -const CodeModule* BasicCodeModules::GetMainModule() const { - return GetModuleForAddress(main_address_); -} - -const CodeModule* BasicCodeModules::GetModuleAtSequence( - unsigned int sequence) const { - linked_ptr module; - if (!map_.RetrieveRangeAtIndex(sequence, &module, NULL /* base */, - NULL /* delta */, NULL /* size */)) { - BPLOG(ERROR) << "RetrieveRangeAtIndex failed for sequence " << sequence; - return NULL; - } - - return module.get(); -} - -const CodeModule* BasicCodeModules::GetModuleAtIndex( - unsigned int index) const { - // This class stores everything in a RangeMap, without any more-efficient - // way to walk the list of CodeModule objects. Implement GetModuleAtIndex - // using GetModuleAtSequence, which meets all of the requirements, and - // in addition, guarantees ordering. - return GetModuleAtSequence(index); -} - -const CodeModules* BasicCodeModules::Copy() const { - return new BasicCodeModules(this, map_.GetMergeStrategy()); -} - -vector > -BasicCodeModules::GetShrunkRangeModules() const { - return shrunk_range_modules_; -} - -} // namespace google_breakpad -- cgit v1.2.3