9de3a6b0b4
* causal backtrace updates
- fix initial causal sampling period value
* causal delay updates
- tweak handling of sleep_for_overhead
* Fix experiment global scaling for prog pts
- results in drastically improved predictions
* pthread_mutex_gotcha updates
- disable all wrappers during causal profiling
* validate-causal-json.py updates
- support decimal stddev
- fix setting stddev from command-line
* causal perform_experiment_impl update
- handle start failing because finalizing
* deprecate causal::component::sample_rate
- appears to not help at all
* Rework sample info
* Increase causal unwind_depth
- use OMNITRACE_MAX_UNWIND_DEPTH
* validate-causal-json updates
- min experiments
- exclude reporting predictions with less than X experiments at a given speedup
- percent samples
- only print samples within X% of the peak (default: 95%)
* Update timemory submodule
- extensions to sampling for signals delivered via non-timer method
- e.g. via HW counter overflow
* dwarf_entry::operator< updates
- sort via file
* causal profiling docs updates
- info about backends
- info about installing/enabling perf
* config updates: causal backend
- CausalBackend enum
- OMNITRACE_CAUSAL_BACKEND: perf, timer, auto
- omnitrace-causal option: --backend
* debug update
- use spin_mutex instead of std::mutex
* address_range::contains update
- range from 0-100 contains range from 10-100 but was returning false because high was == 100 not < 100
* symbol::operator< update
- handle load address differences
* sampling updates (non-causal)
- update get_timer to get_trigger + dynamic_cast
* container::static_vector updates
- support construction from container::c_array
- update_size private member func for handling atomic m_size
* Move perf files
- moved library/causal/perf.{hpp,cpp} to library/perf.{hpp,cpp}
* causal example update
- created impl.hpp (forward decls)
- renamed {cpu,rng}_func_impl to {cpu,rng}_impl_func
- only create two threads which run N iterations instead of two threads each iteration
* Update timemory submodule
- updates to unwind::processed_entry
- updates to procfs::maps
* Updated causal documentation
- fixed line numbers changed by modifications to causal example
* omnitrace-causal exe updates
- set OMNITRACE_THREAD_POOL_SIZE to zero by default
* core/containers updates
- static_vector: provide data() member function
- c_array pop_front() and pop_back() member functions
* core: config and argparse updates + perf
- core/perf.{hpp,cpp}
- forward decl of enums
- config-related capabilities
- argparse: --sample-overflow
- renamed some config functions
- e.g. get_sampling_cpu_freq -> get_sampling_cputime_freq
- added config settings related to overflow sampling via perf
- added timer_sampling and overflow_sampling categories
* Update timemory submodule
- sampling allocator flushing
* binary updates
- lookup_ipaddr_entry
- use bfd_find_nearest_line instead of bfd_find_nearest_line_discriminator
- discriminators are not used
- explicit instantiations of inlined_symbol::serialize
* Bump VERSION to 1.10.0
* sampling and perf updates
- support overflow sampling via Linux Perf
- update perf namespace
- update perf::perf_event
- update record ctor: pointer instead of const ref
- update open member func: return optional string
- add m_batch_size member variable
- sampling updates
- support overflow sampling
- flush allocators
- increase buffer size from 1024 to 2048
- restructure post-processing in light of perf overflow supports
- improve offload memory usage only load buffers for thread
- load_offload_buffer(tid) uses thread-specific filepos
- component updates
- backtrace_metrics::operator-=
- backtrace_metrics::operator-
- backtrace::sample does not record for overflow signal
- callchain: perf overflow sample
* core updates
- component::sampling_percent does not report self + uses_percent_units
* causal updates
- tweak get_line_info
- overloads for set_current_selection (uint64_t, c_array, std::array)
- delay
- use sampling::pause/sampling::resume
- experiment
- experiment::sample derives from unwind::processed_entry
- experiment::samples is vector instead of set
- fixed samples
- overloads for is_selected (uint64_t, c_array, std::array)
- scaling factor defaults to 100 instead of 50
- serialize updates follow change to experiment::sample
- modify algorithm for increasing/decreasing experiment length
- sample_data
- use map<uintptr, uint64_t> instead of set<sample_data>
- get_samples returns vector<sample_data> instead of set<sample_data>
- sampling
- support overflow via Linux Perf
- update causal_offload_buffer
- flush sampling allocator
- backtrace
- overflow component
* libomnitrace-dl updates
- handle dl::InstrumentMode::PythonProfile
* testing updates (causal)
- causal line 155 -> causal line 100
- causal line 165 -> causal line 110
* formatting
* exit_gotcha updates
- exit_info for abort()
- message about non-zero exit code
* testing updates
- fail regex for causal tests
- validate-causal-json: >= min_experiments instead of > min_experiments
- handle OMNITRACE_DEBUG_SETTINGS in omnitrace_write_test_config
* causal sampling updates
- add new lines where appropriate
* causal data updates
- reorder diagnostic info when experiment fails to start
* binary updates
- symbol address range from address to address + symsize + 1
- add 1 based on debug info
* causal data updates
- sample_selection wait_ns defaults to 1,000 instead of 10,000
- sample_selection wait scaled by iteration number
- save_line_info_impl verbosity
- print latest_eligible_pc when experiment does not start
* causal sampling + component updates
- perf backend disables component::backtrace
- ensure get_sampling_(realtime|cputime|overflow)_signal do not malloc
* causal: remove period stats
* validate-causal-json update
- fix --help
* causal data updates
- improve eligible pc history reporting when experiment fails to start
* causal data updates
- fix compute_eligible_lines_impl
- eligible address ranges returning too many ranges
- occasionally, overwrite all *true* eligible address ranges
* causal data updates
- reduce scoped ranges to symbol ranges
- is_eligible_address() returns true contains (not just coarse)
- revert some sample_selection behavior
* binary address_multirange updates
- make coarse_range private
- fix operator+=(pair<coarse, uintptr_t>)
* causal example update
- fix nsync to default to once per iteration
* binary analysis updates
- tweak header file includes
* causal updates
- remove factoring in sleep_for_overhead
- invoke delay::process() even if experiment is not active
* causal data updates
- update latest_eligible_pc structure
* update omnitrace-install.py.in
- fix support for fedora
- /etc/os-release does not have ID_LIKE
- fallback to RHEL 8.7 if version not specified
* update omnitrace-install.py.in
- fix support for debian
- /etc/os-release does not have ID_LIKE
- version mapping
* Update documentation
- update docs on installation
* causal data and experiment updates
- data: reset_sample_selection
* causal set_current_selection debugging
- debug messages for failed e2e runs
* causal data and backtrace component updates
- data: set_current_selection returns the number of eligible addresses added
- backtrace: if cputime signal has selected zero IPs > 5x, then realtime signal starts contributing call-stacks
* core library updates
- move config::parse_numeric_range to utility namespace
- add core/utility.cpp
- support range:increment, e.g. 5-25:10 expands to '5 15 25' instead of '5 10 15 20 25'
* omnitrace-causal update
- end-to-end expands all speedups
- support range:increment in speedups
* causal backtrace updates
- remove select_ival (realtime signal always contributes when select_count == 0)
* containers: static_vector update
- explicit c_array constructor
- explicit std::array constructor
* causal data updates
- remove set_current_selection(uint64_t)
- remove set_current_selection(std::array)
- sample_selection increase default wait time
- report eligible PC candidates
- move reset_sample_selection to perform_experiment_impl
- decrease latest_eligible_pc array size
- set_current_selection does not guard for experiment::active
* core debug updates
- OMNITRACE_PRINT_COLOR macros
* causal data updates
- tweak to experiment never started message
* causal gotcha updates
- remove unused code
* critical trace updates
- remove unused code
* omnitrace-causal
- OMNITRACE_LAUNCHER
* causal data updates
- don't fail on end-to-end + omnitrace-causal
* causal backtrace updates
- reintroduce select_ival behavior
* causal data updates
- tweak verbose messages about number of PC candidates
* core mproc updates
- utilities for waiting on child PID and diagnosing status
- omnitrace::mproc::wait_pid
- omnitrace::mproc::diagnose_status
* omnitrace-run updates
- support --fork argument for executing via fork in current process + execvpe on child instead of execvpe in current process
* omnitrace-causal updates
- wait_pid and diagnose_status just call equivalent functions in omnitrace::mproc
* ubuntu-focal workflow update
- attempt to launch ubuntu-focal-codecov job with CAP_SYS_ADMIN and use perf backend
* tests reorg and updates
- remove binary-rewrite-sampling and runtime-instrument-sampling tests
- rename *-preload tests (which use omnitrace-sample exe) to *-sampling
- split tests/CMakeLists.txt into several tests/omnitrace-<category>-tests.cmake files
- tweak to causal-both-omni-func test
- add args: -n 2 -b timer
* update validate-causal-json.py
- better reasoning info for adjusting tolerance
- always apply tolerance adjustments in CI mode
* causal e2e tests update
- add label "causal-e2e" label
- tweak params
- old: 80 12 432525 500000000
- new: 80 50 432525 100000000
- disable processor affinity for slow-func/line-100 tests
- artificially inflates some speedups with perf
* unblocking_gotcha updates
- overload operator() according to gotcha function index
* blocking_gotcha updates
- overload operator() according to gotcha function index
- fix bug where potentially post block functors (e.g. pthread_mutex_trylock) throw error if lock is not acquired.
* parse_numeric_range update
- support unordered_set
* config update
- OMNITRACE_DEBUG_{TIDS,PIDS} use parse_numeric_range
762 строки
23 KiB
C++
762 строки
23 KiB
C++
// 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 "library/critical_trace.hpp"
|
|
#include "core/config.hpp"
|
|
#include "core/debug.hpp"
|
|
#include "core/defines.hpp"
|
|
#include "core/perfetto.hpp"
|
|
#include "library/ptl.hpp"
|
|
#include "library/runtime.hpp"
|
|
#include "library/thread_data.hpp"
|
|
#include "library/tracing.hpp"
|
|
#include "library/tracing/annotation.hpp"
|
|
|
|
#include <PTL/ThreadPool.hh>
|
|
#include <timemory/backends/dmp.hpp>
|
|
#include <timemory/backends/threading.hpp>
|
|
#include <timemory/hash/types.hpp>
|
|
#include <timemory/operations/types/file_output_message.hpp>
|
|
#include <timemory/tpls/cereal/cereal/archives/json.hpp>
|
|
#include <timemory/tpls/cereal/cereal/cereal.hpp>
|
|
#include <timemory/utility/macros.hpp>
|
|
#include <timemory/utility/types.hpp>
|
|
#include <timemory/utility/utility.hpp>
|
|
|
|
#include <cctype>
|
|
#include <cstdint>
|
|
#include <exception>
|
|
#include <iomanip>
|
|
#include <sstream>
|
|
#include <stdexcept>
|
|
#include <utility>
|
|
|
|
namespace omnitrace
|
|
{
|
|
namespace critical_trace
|
|
{
|
|
namespace
|
|
{
|
|
using call_graph_t = tim::graph<entry>;
|
|
using call_graph_itr_t = typename call_graph_t::iterator;
|
|
using call_graph_sibling_itr_t = typename call_graph_t::sibling_iterator;
|
|
using call_graph_preorder_itr_t = typename call_graph_t::pre_order_iterator;
|
|
|
|
hash_ids complete_hash_ids{};
|
|
call_chain complete_call_chain{};
|
|
std::mutex complete_call_mutex{};
|
|
std::mutex tasking_mutex{};
|
|
|
|
void
|
|
update_critical_path(call_chain _chain, int64_t _tid);
|
|
|
|
void
|
|
compute_critical_trace();
|
|
|
|
void
|
|
copy_hash_ids()
|
|
{
|
|
// make copy to avoid parallel iteration issues
|
|
auto _hash_ids = complete_hash_ids;
|
|
// ensure all hash ids exist
|
|
for(const auto& itr : _hash_ids)
|
|
tim::hash::add_hash_id(itr);
|
|
}
|
|
} // namespace
|
|
} // namespace critical_trace
|
|
|
|
namespace critical_trace
|
|
{
|
|
namespace
|
|
{
|
|
template <typename Arg0, typename Arg1, typename... Args>
|
|
size_t
|
|
get_combined_hash(Arg0&& _zero, Arg1&& _one, Args&&... _args)
|
|
{
|
|
size_t _hash = tim::hash::get_combined_hash_id(std::forward<Arg0>(_zero),
|
|
std::forward<Arg1>(_one));
|
|
if constexpr(sizeof...(_args) == 0)
|
|
{
|
|
return _hash;
|
|
}
|
|
else
|
|
{
|
|
return get_combined_hash(_hash, std::forward<Args>(_args)...);
|
|
}
|
|
}
|
|
} // namespace
|
|
|
|
//--------------------------------------------------------------------------------------//
|
|
//
|
|
// ENTRY
|
|
//
|
|
//--------------------------------------------------------------------------------------//
|
|
|
|
bool
|
|
entry::operator==(const entry& rhs) const
|
|
{
|
|
if(device != rhs.device) return false;
|
|
if(cpu_cid != rhs.cpu_cid) return false;
|
|
if(gpu_cid != rhs.gpu_cid) return false;
|
|
if(hash != rhs.hash) return false;
|
|
if(tid != rhs.tid) return false;
|
|
if(devid != rhs.devid) return false;
|
|
if(queue_id != rhs.queue_id) return false;
|
|
if(depth != rhs.depth) return false;
|
|
if(priority != rhs.priority) return false;
|
|
if(pid != rhs.pid) return false;
|
|
return true;
|
|
/*
|
|
return std::tie(device, depth, priority, devid, pid, tid, cpu_cid, gpu_cid, queue_id,
|
|
hash) == std::tie(rhs.device, rhs.depth, rhs.priority, rhs.devid,
|
|
rhs.pid, rhs.tid, rhs.cpu_cid, rhs.gpu_cid,
|
|
rhs.queue_id, rhs.hash);
|
|
*/
|
|
}
|
|
|
|
bool
|
|
entry::operator<(const entry& rhs) const
|
|
{
|
|
// sort by process ids
|
|
auto _pid_eq = (pid == rhs.pid);
|
|
if(!_pid_eq) return (pid < rhs.pid);
|
|
|
|
// sort by device ids
|
|
auto _devid_eq = (devid == rhs.devid);
|
|
if(!_devid_eq) return (devid < rhs.devid);
|
|
|
|
// sort by cpu ids
|
|
auto _cpu_eq = (cpu_cid == rhs.cpu_cid);
|
|
if(!_cpu_eq) return (cpu_cid < rhs.cpu_cid);
|
|
|
|
// sort by gpu ids
|
|
if(gpu_cid > 0 && rhs.gpu_cid > 0)
|
|
{
|
|
auto _gpu_eq = (gpu_cid == rhs.gpu_cid);
|
|
if(!_gpu_eq) return (gpu_cid < rhs.gpu_cid);
|
|
}
|
|
|
|
// sort by parent ids
|
|
auto _par_eq = (parent_cid == rhs.parent_cid);
|
|
if(!_par_eq) return (parent_cid < rhs.parent_cid);
|
|
|
|
// sort by queue ids
|
|
auto _queue_eq = (queue_id == rhs.queue_id);
|
|
if(!_queue_eq) return (queue_id < rhs.queue_id);
|
|
|
|
// sort by priority
|
|
auto _prio_eq = (priority == rhs.priority);
|
|
if(!_prio_eq) return (priority < rhs.priority);
|
|
|
|
// sort by timestamp (last resort)
|
|
return (begin_ns < rhs.begin_ns);
|
|
}
|
|
|
|
bool
|
|
entry::operator>(const entry& rhs) const
|
|
{
|
|
return (!(*this < rhs) && std::tie(begin_ns, cpu_cid, gpu_cid) !=
|
|
std::tie(rhs.begin_ns, rhs.cpu_cid, rhs.gpu_cid));
|
|
}
|
|
|
|
entry&
|
|
entry::operator+=(const entry& rhs)
|
|
{
|
|
if(phase == Phase::BEGIN && rhs.phase == Phase::END)
|
|
{
|
|
assert(rhs.end_ns >= begin_ns);
|
|
end_ns = rhs.end_ns;
|
|
phase = Phase::DELTA;
|
|
return *this;
|
|
}
|
|
else
|
|
{
|
|
OMNITRACE_VERBOSE(
|
|
2, "Warning! Incorrect phase. entry::operator+=(entry) is only valid for "
|
|
"Phase::BEGIN += Phase::END\n");
|
|
}
|
|
return *this;
|
|
}
|
|
|
|
size_t
|
|
entry::get_hash() const
|
|
{
|
|
return get_combined_hash(hash, static_cast<short>(device), static_cast<short>(phase),
|
|
devid, pid, tid, cpu_cid, gpu_cid, queue_id, priority);
|
|
}
|
|
|
|
int64_t
|
|
entry::get_timestamp() const
|
|
{
|
|
switch(phase)
|
|
{
|
|
case Phase::BEGIN: return begin_ns;
|
|
case Phase::END: return end_ns;
|
|
case Phase::DELTA: return (end_ns - begin_ns);
|
|
case Phase::NONE: break;
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
int64_t
|
|
entry::get_cost() const
|
|
{
|
|
switch(phase)
|
|
{
|
|
case Phase::DELTA: return (end_ns - begin_ns);
|
|
default: break;
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
void
|
|
entry::write(std::ostream& _os) const
|
|
{
|
|
if(device == Device::GPU)
|
|
_os << "[GPU][" << cpu_cid << "][" << gpu_cid << "]";
|
|
else
|
|
_os << "[CPU][" << cpu_cid << "]";
|
|
_os << " parent: " << static_cast<int64_t>(parent_cid);
|
|
_os << ", device: " << devid;
|
|
_os << ", pid: " << pid;
|
|
_os << ", tid: " << tid;
|
|
_os << ", depth: " << depth;
|
|
_os << ", queue: " << queue_id;
|
|
_os << ", priority: " << priority;
|
|
if(phase == Phase::DELTA)
|
|
{
|
|
std::stringstream _cost{};
|
|
_cost << std::setprecision(4) << std::scientific << (get_timestamp() / 1.0e9);
|
|
_os << ", cost: [" << std::setw(8) << _cost.str() << " sec]";
|
|
}
|
|
else
|
|
{
|
|
_os << ", phase: ";
|
|
if(phase == Phase::BEGIN)
|
|
_os << "begin ";
|
|
else if(phase == Phase::END)
|
|
_os << "end ";
|
|
_os << "[" << begin_ns << ":" << end_ns << "]";
|
|
}
|
|
_os << ", hash: " << hash << " :: " << tim::demangle(tim::get_hash_identifier(hash));
|
|
}
|
|
|
|
//--------------------------------------------------------------------------------------//
|
|
//
|
|
// CALL CHAIN
|
|
//
|
|
//--------------------------------------------------------------------------------------//
|
|
|
|
bool
|
|
call_chain::operator==(const call_chain& rhs) const
|
|
{
|
|
if(size() != rhs.size()) return false;
|
|
for(size_t i = 0; i < size(); ++i)
|
|
if(at(i) != rhs.at(i)) return false;
|
|
return true;
|
|
}
|
|
|
|
int64_t
|
|
call_chain::get_cost(int64_t _tid) const
|
|
{
|
|
int64_t _cost = 0;
|
|
if(_tid < 0)
|
|
{
|
|
for(const auto& itr : *this)
|
|
_cost += itr.get_cost();
|
|
}
|
|
else
|
|
{
|
|
for(const auto& itr : *this)
|
|
{
|
|
if(itr.tid == _tid) _cost += itr.get_cost();
|
|
}
|
|
}
|
|
return _cost;
|
|
}
|
|
|
|
template <Device DevT>
|
|
void
|
|
call_chain::generate_perfetto(::perfetto::Track _track, std::set<entry>& _used) const
|
|
{
|
|
OMNITRACE_SCOPED_THREAD_STATE(ThreadState::Internal);
|
|
|
|
static std::set<std::string> _static_strings{};
|
|
static std::mutex _static_mutex{};
|
|
|
|
for(const auto& itr : *this)
|
|
{
|
|
if(!_used.emplace(itr).second) continue;
|
|
|
|
auto&& _annotater = [&](::perfetto::EventContext ctx) {
|
|
if(config::get_perfetto_annotations())
|
|
{
|
|
tracing::add_perfetto_annotation(ctx, "begin_ns", itr.begin_ns);
|
|
tracing::add_perfetto_annotation(ctx, "end_ns", itr.end_ns);
|
|
}
|
|
};
|
|
|
|
if constexpr(DevT == Device::NONE)
|
|
{
|
|
if(itr.device == Device::CPU)
|
|
{
|
|
tracing::push_perfetto_track(category::host_critical_trace{}, "CPU",
|
|
_track, itr.begin_ns, std::move(_annotater));
|
|
tracing::pop_perfetto_track(category::host_critical_trace{}, "CPU",
|
|
_track, itr.end_ns);
|
|
}
|
|
else if(itr.device == Device::GPU)
|
|
{
|
|
tracing::push_perfetto_track(category::device_critical_trace{}, "GPU",
|
|
_track, itr.begin_ns, std::move(_annotater));
|
|
tracing::pop_perfetto_track(category::device_critical_trace{}, "GPU",
|
|
_track, itr.end_ns);
|
|
}
|
|
}
|
|
else
|
|
{
|
|
using category_t = std::conditional_t<
|
|
DevT == Device::ANY, omnitrace::category::critical_trace,
|
|
std::conditional_t<DevT == Device::CPU,
|
|
omnitrace::category::host_critical_trace,
|
|
omnitrace::category::device_critical_trace>>;
|
|
|
|
if constexpr(DevT != Device::ANY)
|
|
{
|
|
if(itr.device != DevT) continue;
|
|
}
|
|
|
|
std::string _name = tim::demangle(tim::get_hash_identifier(itr.hash));
|
|
_static_mutex.lock();
|
|
auto sitr = _static_strings.emplace(_name);
|
|
_static_mutex.unlock();
|
|
|
|
tracing::push_perfetto_track(category_t{}, sitr.first->c_str(), _track,
|
|
itr.begin_ns, std::move(_annotater));
|
|
tracing::pop_perfetto_track(category_t{}, sitr.first->c_str(), _track,
|
|
itr.end_ns);
|
|
}
|
|
}
|
|
}
|
|
|
|
// explicit instantiations
|
|
template void
|
|
call_chain::generate_perfetto<Device::NONE>(::perfetto::Track, std::set<entry>&) const;
|
|
|
|
template void
|
|
call_chain::generate_perfetto<Device::CPU>(::perfetto::Track, std::set<entry>&) const;
|
|
|
|
template void
|
|
call_chain::generate_perfetto<Device::GPU>(::perfetto::Track, std::set<entry>&) const;
|
|
|
|
template void
|
|
call_chain::generate_perfetto<Device::ANY>(::perfetto::Track, std::set<entry>&) const;
|
|
|
|
//--------------------------------------------------------------------------------------//
|
|
//
|
|
// FREE FUNCTIONS
|
|
//
|
|
//--------------------------------------------------------------------------------------//
|
|
|
|
uint64_t
|
|
get_update_frequency()
|
|
{
|
|
return get_critical_trace_update_freq();
|
|
}
|
|
|
|
unique_ptr_t<call_chain>&
|
|
get(int64_t _tid)
|
|
{
|
|
static auto& _v = thread_data<call_chain>::instances();
|
|
static thread_local auto _once = [_tid]() {
|
|
if(!_v.at(0)) _v.at(0) = unique_ptr_t<call_chain>{ new call_chain{} };
|
|
if(!_v.at(_tid)) _v.at(_tid) = unique_ptr_t<call_chain>{ new call_chain{} };
|
|
if(_tid > 0) *_v.at(_tid) = *_v.at(0);
|
|
return true;
|
|
}();
|
|
(void) _once;
|
|
return _v.at(_tid);
|
|
}
|
|
|
|
void
|
|
add_hash_id(const hash_ids& _labels)
|
|
{
|
|
OMNITRACE_SCOPED_THREAD_STATE(ThreadState::Internal);
|
|
if(!tasking::critical_trace::get_task_group().pool()) return;
|
|
std::unique_lock<std::mutex> _lk{ tasking_mutex };
|
|
tasking::critical_trace::get_task_group().exec([_labels]() {
|
|
static std::mutex _mtx{};
|
|
_mtx.lock();
|
|
for(auto itr : _labels)
|
|
complete_hash_ids.emplace(std::move(itr));
|
|
_mtx.unlock();
|
|
});
|
|
}
|
|
|
|
size_t
|
|
add_hash_id(const std::string& _label)
|
|
{
|
|
using critical_trace_hash_data =
|
|
thread_data<critical_trace::hash_ids, critical_trace::id>;
|
|
|
|
auto _hash = tim::hash::add_hash_id(_label);
|
|
if(get_use_critical_trace() || get_use_rocm_smi())
|
|
{
|
|
critical_trace_hash_data::construct();
|
|
critical_trace_hash_data::instance()->emplace(_label);
|
|
}
|
|
return _hash;
|
|
}
|
|
|
|
void
|
|
update(int64_t _tid)
|
|
{
|
|
if(!get_use_critical_trace() && !get_use_rocm_smi()) return;
|
|
OMNITRACE_SCOPED_THREAD_STATE(ThreadState::Internal);
|
|
if(!tasking::critical_trace::get_task_group().pool()) return;
|
|
std::unique_lock<std::mutex> _lk{ tasking_mutex };
|
|
call_chain _data{};
|
|
std::swap(_data, *critical_trace::get(_tid));
|
|
tasking::critical_trace::get_task_group().exec(update_critical_path, _data, _tid);
|
|
}
|
|
|
|
void
|
|
compute(int64_t _tid)
|
|
{
|
|
update(_tid);
|
|
OMNITRACE_SCOPED_THREAD_STATE(ThreadState::Internal);
|
|
if(!tasking::critical_trace::get_task_group().pool()) return;
|
|
std::unique_lock<std::mutex> _lk{ tasking_mutex };
|
|
tasking::critical_trace::get_task_group().exec(compute_critical_trace);
|
|
}
|
|
|
|
//--------------------------------------------------------------------------------------//
|
|
//
|
|
// HELPER FUNCTIONS
|
|
//
|
|
//--------------------------------------------------------------------------------------//
|
|
|
|
namespace
|
|
{
|
|
std::string
|
|
get_perf_name(std::string _func)
|
|
{
|
|
const auto _npos = std::string::npos;
|
|
auto _pos = std::string::npos;
|
|
while((_pos = _func.find('_')) != _npos)
|
|
_func = _func.replace(_pos, 1, " ");
|
|
if(_func.length() > 0) _func.at(0) = std::toupper(_func.at(0));
|
|
return _func;
|
|
}
|
|
|
|
void
|
|
save_call_chain_json(const std::string& _fname, const std::string& _label,
|
|
const call_chain& _call_chain, bool _msg = false,
|
|
std::string _func = {})
|
|
{
|
|
OMNITRACE_CT_DEBUG("[%s][%s] saving %zu call chain entries to '%s'\n", __FUNCTION__,
|
|
_label.c_str(), _call_chain.size(), _fname.c_str());
|
|
|
|
using perfstats_t =
|
|
tim::lightweight_tuple<comp::wall_clock, comp::peak_rss, comp::page_rss>;
|
|
perfstats_t _perf{ get_perf_name(__FUNCTION__) };
|
|
_perf.start();
|
|
|
|
auto _save = [&](std::ostream& _os) {
|
|
namespace cereal = tim::cereal;
|
|
auto ar = tim::policy::output_archive<cereal::MinimalJSONOutputArchive>::get(_os);
|
|
|
|
auto _hash_map = *tim::hash::get_hash_ids();
|
|
for(auto& itr : _hash_map)
|
|
itr.second = tim::demangle(itr.second);
|
|
ar->setNextName("omnitrace");
|
|
ar->startNode();
|
|
(*ar)(cereal::make_nvp("hash_map", _hash_map),
|
|
cereal::make_nvp(_label.c_str(), _call_chain));
|
|
ar->finishNode();
|
|
};
|
|
|
|
std::ofstream ofs{};
|
|
if(tim::filepath::open(ofs, _fname))
|
|
{
|
|
if(_msg)
|
|
{
|
|
if(_func.empty()) _func = __FUNCTION__;
|
|
if(get_verbose() >= 0)
|
|
operation::file_output_message<critical_trace::call_chain>{}(
|
|
_fname, std::string{ _func });
|
|
}
|
|
std::stringstream oss{};
|
|
if(_call_chain.size() > 100000)
|
|
{
|
|
_save(ofs);
|
|
}
|
|
else
|
|
{
|
|
_save(oss);
|
|
ofs << oss.str() << std::endl;
|
|
}
|
|
}
|
|
|
|
_perf.stop();
|
|
if(_msg)
|
|
{
|
|
OMNITRACE_CT_DEBUG("%s\n", JOIN("", _perf).c_str());
|
|
}
|
|
}
|
|
|
|
template <typename Tp, template <typename...> class ContainerT, typename... Args,
|
|
typename FuncT = bool (*)(const Tp&, const Tp&)>
|
|
inline auto
|
|
find(
|
|
const Tp& _v, ContainerT<Tp, Args...>& _vec,
|
|
FuncT&& _func = [](const Tp& _lhs, const Tp& _rhs) { return (_lhs == _rhs); })
|
|
{
|
|
for(auto itr = _vec.begin(); itr != _vec.end(); ++itr)
|
|
{
|
|
if(std::forward<FuncT>(_func)(_v, *itr))
|
|
{
|
|
return itr;
|
|
}
|
|
}
|
|
OMNITRACE_CT_DEBUG("[%s] no match found in %zu entries...\n", __FUNCTION__,
|
|
_vec.size());
|
|
return _vec.end();
|
|
}
|
|
|
|
template <typename FuncT = bool (*)(const entry&, const entry&)>
|
|
inline auto
|
|
find(
|
|
const entry& _v, call_chain& _vec,
|
|
FuncT&& _func = [](const entry& _lhs, const entry& _rhs) { return (_lhs == _rhs); })
|
|
{
|
|
return find(_v, reinterpret_cast<std::vector<entry>&>(_vec),
|
|
std::forward<FuncT>(_func));
|
|
}
|
|
|
|
void
|
|
squash_critical_path(call_chain& _targ)
|
|
{
|
|
OMNITRACE_CT_DEBUG("[%s]\n", __FUNCTION__);
|
|
static auto _strict_equal = [](const entry& _lhs, const entry& _rhs) {
|
|
auto _same_phase = (_lhs.phase == _rhs.phase);
|
|
bool _phase_check = true;
|
|
if(_same_phase) _phase_check = (_lhs.get_timestamp() == _rhs.get_timestamp());
|
|
return (_lhs == _rhs && _lhs.parent_cid == _rhs.parent_cid && _phase_check);
|
|
};
|
|
|
|
std::sort(_targ.begin(), _targ.end());
|
|
|
|
call_chain _squashed{};
|
|
for(auto& itr : _targ)
|
|
{
|
|
if(itr.phase == Phase::DELTA)
|
|
{
|
|
_squashed.emplace_back(itr);
|
|
}
|
|
else if(itr.phase == Phase::BEGIN)
|
|
{
|
|
if(find(itr, _squashed, _strict_equal) == _squashed.end())
|
|
_squashed.emplace_back(itr);
|
|
}
|
|
else
|
|
{
|
|
auto mitr = find(itr, _squashed);
|
|
if(mitr != _squashed.end())
|
|
*mitr += itr;
|
|
else
|
|
_squashed.emplace_back(itr);
|
|
}
|
|
}
|
|
|
|
std::swap(_targ, _squashed);
|
|
std::sort(_targ.begin(), _targ.end());
|
|
}
|
|
|
|
void
|
|
combine_critical_path(call_chain& _targ, call_chain _chain)
|
|
{
|
|
OMNITRACE_CT_DEBUG("[%s]\n", __FUNCTION__);
|
|
OMNITRACE_CT_DEBUG("[%s] adding %zu entries to existing call-chain of %zu...\n",
|
|
__FUNCTION__, _chain.size(), _targ.size());
|
|
|
|
// use a deque here because when combining _begin and _end, you end
|
|
// up erasing entries from the front of _begin. When _begin is large, it
|
|
// takes a lot of time to move all the elements each iteration
|
|
std::deque<entry> _begin{};
|
|
std::deque<entry> _end{};
|
|
|
|
call_chain _delta{};
|
|
_delta.reserve(_chain.size() / 2); // estimated total deltas
|
|
|
|
for(auto& itr : _chain)
|
|
{
|
|
if(itr.phase == Phase::DELTA)
|
|
_delta.emplace_back(itr);
|
|
else if(itr.phase == Phase::BEGIN)
|
|
_begin.emplace_back(itr);
|
|
else if(itr.phase == Phase::END)
|
|
_end.emplace_back(itr);
|
|
}
|
|
|
|
OMNITRACE_CT_DEBUG("[%s] sorting %zu begin and %zu end call-chain entries...\n",
|
|
__FUNCTION__, _begin.size(), _end.size());
|
|
|
|
std::sort(_begin.begin(), _begin.end());
|
|
std::sort(_end.begin(), _end.end());
|
|
|
|
std::deque<entry> _tmp{};
|
|
std::swap(_end, _tmp);
|
|
for(auto& eitr : _tmp)
|
|
{
|
|
auto mitr = find(eitr, _begin);
|
|
if(mitr == _begin.end())
|
|
_end.emplace_back(eitr);
|
|
else
|
|
{
|
|
*mitr += eitr;
|
|
_delta.emplace_back(*mitr);
|
|
_begin.erase(mitr);
|
|
}
|
|
}
|
|
_tmp.clear();
|
|
|
|
OMNITRACE_CT_DEBUG(
|
|
"[%s] %zu begin and %zu end call-chain entries were not matched...\n",
|
|
__FUNCTION__, _begin.size(), _end.size());
|
|
|
|
call_chain _combined{};
|
|
_combined.reserve(_delta.size() + _begin.size() + _end.size());
|
|
for(auto& itr : _delta)
|
|
_combined.emplace_back(itr);
|
|
for(auto& itr : _begin)
|
|
_combined.emplace_back(itr);
|
|
for(auto& itr : _end)
|
|
_combined.emplace_back(itr);
|
|
|
|
OMNITRACE_CT_DEBUG("[%s] sorting %zu combined call-chain entries...\n", __FUNCTION__,
|
|
_combined.size());
|
|
|
|
std::sort(_combined.begin(), _combined.end());
|
|
|
|
OMNITRACE_SCOPED_THREAD_STATE(ThreadState::Internal);
|
|
std::unique_lock<std::mutex> _lk{ complete_call_mutex };
|
|
for(auto& itr : _combined)
|
|
_targ.emplace_back(itr);
|
|
|
|
// squash_critical_path(_targ);
|
|
}
|
|
|
|
void
|
|
update_critical_path(call_chain _chain, int64_t)
|
|
{
|
|
OMNITRACE_CT_DEBUG("[%s] updating critical path with %zu entries...\n", __FUNCTION__,
|
|
_chain.size());
|
|
try
|
|
{
|
|
// remove any data not
|
|
// auto _diff_tid = [_tid](const entry& _v) { return _v.tid != _tid; };
|
|
//_chain.erase(std::remove_if(_chain.begin(), _chain.end(), _diff_tid),
|
|
// _chain.end());
|
|
combine_critical_path(complete_call_chain, std::move(_chain));
|
|
} catch(const std::exception& e)
|
|
{
|
|
std::cerr << "Thread exited with exception: " << e.what() << std::endl;
|
|
TIMEMORY_CONDITIONAL_DEMANGLED_BACKTRACE(true, 32);
|
|
}
|
|
}
|
|
|
|
void
|
|
compute_critical_trace()
|
|
{
|
|
OMNITRACE_SCOPED_THREAD_STATE(ThreadState::Internal);
|
|
|
|
static bool _computed = false;
|
|
std::unique_lock<std::mutex> _lk{ complete_call_mutex };
|
|
|
|
if(_computed) return;
|
|
|
|
OMNITRACE_CONDITIONAL_PRINT(get_critical_trace_debug() || get_verbose() >= 0,
|
|
"[%s] Generating critical trace...\n", __FUNCTION__);
|
|
|
|
// ensure all hash ids exist
|
|
copy_hash_ids();
|
|
|
|
using perfstats_t =
|
|
tim::lightweight_tuple<comp::wall_clock, comp::peak_rss, comp::page_rss>;
|
|
|
|
perfstats_t _ct_perf{};
|
|
_ct_perf.start();
|
|
|
|
try
|
|
{
|
|
OMNITRACE_VERBOSE_F(1, "[%s] initial call chain: %zu entries\n", __FUNCTION__,
|
|
complete_call_chain.size());
|
|
|
|
perfstats_t _perf{ get_perf_name(__FUNCTION__) };
|
|
_perf.start();
|
|
|
|
std::sort(complete_call_chain.begin(), complete_call_chain.end());
|
|
|
|
_perf.stop().rekey("Sorting critical trace");
|
|
OMNITRACE_VERBOSE_F(1, "%s\n", JOIN("", _perf).c_str());
|
|
|
|
_perf.reset().start();
|
|
save_call_chain_json(
|
|
tim::settings::compose_output_filename("call-chain", ".json"), "call_chain",
|
|
complete_call_chain, true, __FUNCTION__);
|
|
|
|
_perf.stop().rekey("Save call-chain");
|
|
OMNITRACE_VERBOSE_F(1, "%s\n", JOIN("", _perf).c_str());
|
|
|
|
} catch(std::exception& e)
|
|
{
|
|
OMNITRACE_PRINT_F("Thread exited '%s' with exception: %s\n", __FUNCTION__,
|
|
e.what());
|
|
TIMEMORY_CONDITIONAL_DEMANGLED_BACKTRACE(true, 32);
|
|
}
|
|
|
|
OMNITRACE_PRINT_F("%s\n", _ct_perf.stop().as_string<false, false>().c_str());
|
|
}
|
|
} // namespace
|
|
|
|
std::vector<std::pair<std::string, entry>>
|
|
get_entries(const std::function<bool(const entry&)>& _eval)
|
|
{
|
|
OMNITRACE_SCOPED_THREAD_STATE(ThreadState::Internal);
|
|
tasking::join();
|
|
copy_hash_ids();
|
|
squash_critical_path(complete_call_chain);
|
|
std::sort(complete_call_chain.begin(), complete_call_chain.end());
|
|
|
|
auto _v = std::vector<std::pair<std::string, entry>>{};
|
|
for(const auto& itr : complete_call_chain)
|
|
{
|
|
if(itr.phase != Phase::DELTA) continue;
|
|
if(_eval(itr)) _v.emplace_back(tim::get_hash_identifier(itr.hash), itr);
|
|
}
|
|
return _v;
|
|
}
|
|
|
|
} // namespace critical_trace
|
|
} // namespace omnitrace
|