restructure libomnitrace + tasking and omnitrace-causal updates (#237)
* restructured libomnitrace - this is necessary to incorporate some of the binary analysis capabilities into omnitrace exe - created libomnitrace-core (static) - created libomnitrace-binary (static) - created libomnitrace (static) - omnitrace-avail links to libomnitrace.a - omnitrace-critical-trace links to libomnitrace.a - tweaked the testing - reduced verbosity on some of MPI tests - excluded trace-time-window from tests on Ubuntu 18.04 - reduced causal e2e iterations - minor tweak to tasking - manually create `PTL::UserTaskQueue` instance instead of relying on `PTL::ThreadPool` to create it * Update formatting workflow - source formatting uses ubuntu-22.04 - check-includes doesn't generate false positive for 'include "timemory.hpp"' * omnitrace-causal --generate-configs - fix config generation in omnitrace causal - add test for omnitrace-causal + generating configs * Fix omnitrace-object-library build - accidentally included rocm sources in non-rocm builds * Fix rocm compilation w/o rocprofiler * update timemory submodule with mpi_get warning messages * sampling offload file updates - more verbose messages - disable offload before stopping * testing updates - increase causal e2e iterations to 12 - increase lock_environment verbose to 2 (for sampling offload messages) - fix return for omnitrace_add_validation_test
Tá an tiomantas seo le fáil i:
Jonathan R. Madsen
tiomanta ag
GitHub
GitHub
tuismitheoir
8feb6bf8b6
tiomantas
e7d3125459
@@ -0,0 +1,7 @@
|
||||
#
|
||||
set(binary_sources ${CMAKE_CURRENT_LIST_DIR}/address_range.cpp)
|
||||
|
||||
set(binary_headers ${CMAKE_CURRENT_LIST_DIR}/address_range.hpp
|
||||
${CMAKE_CURRENT_LIST_DIR}/fwd.hpp)
|
||||
|
||||
target_sources(omnitrace-core-library PRIVATE ${binary_sources} ${binary_headers})
|
||||
@@ -0,0 +1,190 @@
|
||||
// MIT License
|
||||
//
|
||||
// Copyright (c) 2022 Advanced Micro Devices, Inc. All Rights Reserved.
|
||||
//
|
||||
// Permission is hereby granted, free of charge, to any person obtaining a copy
|
||||
// of this software and associated documentation files (the "Software"), to deal
|
||||
// in the Software without restriction, including without limitation the rights
|
||||
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
||||
// copies of the Software, and to permit persons to whom the Software is
|
||||
// furnished to do so, subject to the following conditions:
|
||||
//
|
||||
// The above copyright notice and this permission notice shall be included in all
|
||||
// copies or substantial portions of the Software.
|
||||
//
|
||||
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
||||
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
||||
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
||||
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
||||
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
||||
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
|
||||
// SOFTWARE.
|
||||
|
||||
#include "binary/address_range.hpp"
|
||||
#include "debug.hpp"
|
||||
|
||||
namespace omnitrace
|
||||
{
|
||||
namespace binary
|
||||
{
|
||||
address_range::address_range(uintptr_t _v)
|
||||
: low{ _v }
|
||||
, high{ _v }
|
||||
{}
|
||||
|
||||
address_range::address_range(uintptr_t _low, uintptr_t _high)
|
||||
: low{ _low }
|
||||
, high{ _high }
|
||||
{
|
||||
TIMEMORY_REQUIRE(high >= low)
|
||||
<< "Error! address_range high must be >= low. low=" << as_hex(low)
|
||||
<< ", high=" << as_hex(high) << "\n";
|
||||
}
|
||||
|
||||
bool
|
||||
address_range::is_range() const
|
||||
{
|
||||
return (low < high);
|
||||
}
|
||||
|
||||
std::string
|
||||
address_range::as_string(int _depth) const
|
||||
{
|
||||
std::stringstream _ss{};
|
||||
_ss << std::hex;
|
||||
_ss << std::setw(2 * _depth) << "";
|
||||
_ss.fill('0');
|
||||
_ss << "0x" << std::setw(16) << low << "-"
|
||||
<< "0x" << std::setw(16) << high;
|
||||
return _ss.str();
|
||||
}
|
||||
|
||||
uintptr_t
|
||||
address_range::size() const
|
||||
{
|
||||
return (low == high) ? 1 : (high > low) ? (high - low + 1) : (low - high + 1);
|
||||
}
|
||||
|
||||
bool
|
||||
address_range::is_valid() const
|
||||
{
|
||||
return (low <= high && (low + 1) > 1);
|
||||
}
|
||||
|
||||
bool
|
||||
address_range::contains(uintptr_t _v) const
|
||||
{
|
||||
return (is_range()) ? (low <= _v && high > _v) : (_v == low);
|
||||
}
|
||||
|
||||
bool
|
||||
address_range::contains(address_range _v) const
|
||||
{
|
||||
return (*this == _v) || (contains(_v.low) && contains(_v.high));
|
||||
}
|
||||
|
||||
bool
|
||||
address_range::overlaps(address_range _v) const
|
||||
{
|
||||
if(contains(_v)) return false;
|
||||
int64_t _lhs_diff = (high - low);
|
||||
int64_t _rhs_diff = (_v.high - _v.low);
|
||||
int64_t _diff = (std::max(high, _v.high) - std::min(low, _v.low));
|
||||
return (_diff < (_lhs_diff + _rhs_diff));
|
||||
}
|
||||
|
||||
bool
|
||||
address_range::contiguous_with(address_range _v) const
|
||||
{
|
||||
return (_v.low == high || low == _v.high);
|
||||
}
|
||||
|
||||
bool
|
||||
address_range::operator==(address_range _v) const
|
||||
{
|
||||
// if arg is range and this is not range, call this function with arg
|
||||
// if(_v.is_range() && !is_range()) return false;
|
||||
// check if arg is in range
|
||||
// if(is_range() && !_v.is_range()) return false;
|
||||
// both are ranges or both are just address
|
||||
return std::tie(low, high) == std::tie(_v.low, _v.high);
|
||||
}
|
||||
|
||||
bool
|
||||
address_range::operator<(address_range _v) const
|
||||
{
|
||||
if(is_range() && !_v.is_range())
|
||||
{
|
||||
return (low == _v.low) ? true : (low < _v.low);
|
||||
}
|
||||
else if(!is_range() && _v.is_range())
|
||||
{
|
||||
return (low == _v.low) ? false : (low < _v.low);
|
||||
}
|
||||
else if(!is_range() && !_v.is_range())
|
||||
{
|
||||
return (low < _v.low);
|
||||
}
|
||||
return std::tie(low, high) < std::tie(_v.low, _v.high);
|
||||
// if(_v.low == _v.high && _v.low >= low && _v.low < high) return false;
|
||||
// return (low == _v.low) ? (high > _v.high) : (low < _v.low);
|
||||
}
|
||||
|
||||
bool
|
||||
address_range::operator>(address_range _v) const
|
||||
{
|
||||
return !(*this < _v) && !(*this == _v);
|
||||
}
|
||||
|
||||
address_range&
|
||||
address_range::operator+=(uintptr_t _v)
|
||||
{
|
||||
if(is_valid())
|
||||
{
|
||||
low += _v;
|
||||
high += _v;
|
||||
}
|
||||
else
|
||||
{
|
||||
low = _v;
|
||||
high = _v;
|
||||
}
|
||||
return *this;
|
||||
}
|
||||
|
||||
address_range&
|
||||
address_range::operator-=(uintptr_t _v)
|
||||
{
|
||||
if(is_valid())
|
||||
{
|
||||
low -= _v;
|
||||
high -= _v;
|
||||
}
|
||||
else
|
||||
{
|
||||
low = _v;
|
||||
high = _v;
|
||||
}
|
||||
return *this;
|
||||
}
|
||||
|
||||
address_range&
|
||||
address_range::operator+=(address_range _v)
|
||||
{
|
||||
if(!contiguous_with(_v))
|
||||
throw exception<std::runtime_error>(
|
||||
"attempting to add two address ranges that are not contiguous");
|
||||
|
||||
low = std::min(low, _v.low);
|
||||
high = std::max(high, _v.high);
|
||||
return *this;
|
||||
}
|
||||
|
||||
hash_value_t
|
||||
address_range::hash() const
|
||||
{
|
||||
return (is_range()) ? tim::get_combined_hash_id(hash_value_t{ low }, high)
|
||||
: hash_value_t{ low };
|
||||
}
|
||||
} // namespace binary
|
||||
} // namespace omnitrace
|
||||
@@ -0,0 +1,104 @@
|
||||
// MIT License
|
||||
//
|
||||
// Copyright (c) 2022 Advanced Micro Devices, Inc. All Rights Reserved.
|
||||
//
|
||||
// Permission is hereby granted, free of charge, to any person obtaining a copy
|
||||
// of this software and associated documentation files (the "Software"), to deal
|
||||
// in the Software without restriction, including without limitation the rights
|
||||
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
||||
// copies of the Software, and to permit persons to whom the Software is
|
||||
// furnished to do so, subject to the following conditions:
|
||||
//
|
||||
// The above copyright notice and this permission notice shall be included in all
|
||||
// copies or substantial portions of the Software.
|
||||
//
|
||||
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
||||
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
||||
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
||||
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
||||
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
||||
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
|
||||
// SOFTWARE.
|
||||
|
||||
#pragma once
|
||||
|
||||
#include "core/binary/fwd.hpp"
|
||||
#include "core/common.hpp"
|
||||
#include "core/timemory.hpp"
|
||||
|
||||
#include <timemory/hash/types.hpp>
|
||||
#include <timemory/utility/macros.hpp>
|
||||
|
||||
#include <cstdint>
|
||||
#include <limits>
|
||||
|
||||
namespace omnitrace
|
||||
{
|
||||
namespace binary
|
||||
{
|
||||
struct address_range
|
||||
{
|
||||
// set to low to max and high to min to support std::min(...)
|
||||
// and std::max(...) assignment
|
||||
uintptr_t low = std::numeric_limits<uintptr_t>::max();
|
||||
uintptr_t high = std::numeric_limits<uintptr_t>::min();
|
||||
|
||||
OMNITRACE_DEFAULT_OBJECT(address_range)
|
||||
|
||||
explicit address_range(uintptr_t _v);
|
||||
address_range(uintptr_t _low, uintptr_t _high);
|
||||
|
||||
bool contains(uintptr_t) const;
|
||||
bool contains(address_range) const;
|
||||
bool overlaps(address_range) const;
|
||||
bool contiguous_with(address_range) const;
|
||||
|
||||
bool operator==(address_range _v) const;
|
||||
bool operator!=(address_range _v) const { return !(*this == _v); }
|
||||
bool operator<(address_range _v) const;
|
||||
bool operator>(address_range _v) const;
|
||||
|
||||
address_range& operator+=(uintptr_t);
|
||||
address_range& operator-=(uintptr_t);
|
||||
address_range& operator+=(address_range);
|
||||
|
||||
bool is_range() const;
|
||||
hash_value_t hash() const;
|
||||
std::string as_string(int _depth = 0) const;
|
||||
bool is_valid() const;
|
||||
uintptr_t size() const;
|
||||
explicit operator bool() const { return is_valid(); }
|
||||
|
||||
template <typename ArchiveT>
|
||||
void serialize(ArchiveT& ar, const unsigned)
|
||||
{
|
||||
ar(cereal::make_nvp("low", low));
|
||||
ar(cereal::make_nvp("high", high));
|
||||
}
|
||||
};
|
||||
} // namespace binary
|
||||
|
||||
inline binary::address_range
|
||||
operator+(binary::address_range _lhs, uintptr_t _v)
|
||||
{
|
||||
return (_lhs += _v);
|
||||
}
|
||||
|
||||
inline binary::address_range
|
||||
operator+(uintptr_t _v, binary::address_range _lhs)
|
||||
{
|
||||
return (_lhs += _v);
|
||||
}
|
||||
} // namespace omnitrace
|
||||
|
||||
namespace std
|
||||
{
|
||||
template <>
|
||||
struct hash<::omnitrace::binary::address_range>
|
||||
{
|
||||
using address_range_t = ::omnitrace::binary::address_range;
|
||||
|
||||
auto operator()(const address_range_t& _v) const { return _v.hash(); }
|
||||
auto operator()(address_range_t&& _v) const { return _v.hash(); }
|
||||
};
|
||||
} // namespace std
|
||||
@@ -0,0 +1,62 @@
|
||||
// MIT License
|
||||
//
|
||||
// Copyright (c) 2022 Advanced Micro Devices, Inc. All Rights Reserved.
|
||||
//
|
||||
// Permission is hereby granted, free of charge, to any person obtaining a copy
|
||||
// of this software and associated documentation files (the "Software"), to deal
|
||||
// in the Software without restriction, including without limitation the rights
|
||||
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
||||
// copies of the Software, and to permit persons to whom the Software is
|
||||
// furnished to do so, subject to the following conditions:
|
||||
//
|
||||
// The above copyright notice and this permission notice shall be included in all
|
||||
// copies or substantial portions of the Software.
|
||||
//
|
||||
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
||||
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
||||
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
||||
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
||||
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
||||
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
|
||||
// SOFTWARE.
|
||||
|
||||
#pragma once
|
||||
|
||||
#include "common/defines.h"
|
||||
#include "core/common.hpp"
|
||||
#include "core/defines.hpp"
|
||||
#include "core/exception.hpp"
|
||||
|
||||
#include <timemory/hash/types.hpp>
|
||||
#include <timemory/mpl/concepts.hpp>
|
||||
#include <timemory/tpls/cereal/cereal/cereal.hpp>
|
||||
#include <timemory/unwind/bfd.hpp>
|
||||
#include <timemory/unwind/types.hpp>
|
||||
#include <timemory/utility/procfs/maps.hpp>
|
||||
|
||||
#include <cstdint>
|
||||
#include <deque>
|
||||
#include <map>
|
||||
#include <memory>
|
||||
#include <regex>
|
||||
#include <string>
|
||||
#include <tuple>
|
||||
#include <variant>
|
||||
|
||||
namespace omnitrace
|
||||
{
|
||||
namespace binary
|
||||
{
|
||||
namespace procfs = ::tim::procfs; // NOLINT
|
||||
|
||||
using bfd_file = ::tim::unwind::bfd_file;
|
||||
using hash_value_t = ::tim::hash_value_t;
|
||||
|
||||
struct address_range;
|
||||
struct address_multirange;
|
||||
struct scope_filter;
|
||||
struct symbol;
|
||||
struct dwarf_entry;
|
||||
struct binary_info;
|
||||
} // namespace binary
|
||||
} // namespace omnitrace
|
||||
Tagairt in Eagrán Nua
Cuir bac ar úsáideoir