#ifdef _MSC_VER # include #else # include #endif #include #include #if __has_include() # include #else # include "tracy_pdqsort.h" # define MY_LIBCPP_SUCKS #endif #include "../common/TracyProtocol.hpp" #include "../common/TracySystem.hpp" #include "TracyFileRead.hpp" #include "TracyFileWrite.hpp" #include "TracyWorker.hpp" #include "tracy_flat_hash_map.hpp" namespace tracy { static constexpr int FileVersion( uint8_t h5, uint8_t h6, uint8_t h7 ) { return ( h5 << 16 ) | ( h6 << 8 ) | h7; } static const uint8_t FileHeader[8] { 't', 'r', 'a', 'c', 'y', 0, 3, 2 }; enum { FileHeaderMagic = 5 }; static const int CurrentVersion = FileVersion( FileHeader[FileHeaderMagic], FileHeader[FileHeaderMagic+1], FileHeader[FileHeaderMagic+2] ); static void UpdateLockCountLockable( LockMap& lockmap, size_t pos ) { auto& timeline = lockmap.timeline; uint8_t lockingThread; uint8_t lockCount; uint64_t waitList; if( pos == 0 ) { lockingThread = 0; lockCount = 0; waitList = 0; } else { const auto tl = timeline[pos-1]; lockingThread = tl->lockingThread; lockCount = tl->lockCount; waitList = tl->waitList; } const auto end = timeline.size(); while( pos != end ) { const auto tl = timeline[pos]; const auto tbit = uint64_t( 1 ) << tl->thread; switch( (LockEvent::Type)tl->type ) { case LockEvent::Type::Wait: waitList |= tbit; break; case LockEvent::Type::Obtain: assert( lockCount < std::numeric_limits::max() ); assert( ( waitList & tbit ) != 0 ); waitList &= ~tbit; lockingThread = tl->thread; lockCount++; break; case LockEvent::Type::Release: assert( lockCount > 0 ); lockCount--; break; default: break; } tl->lockingThread = lockingThread; tl->waitList = waitList; tl->lockCount = lockCount; pos++; } } static void UpdateLockCountSharedLockable( LockMap& lockmap, size_t pos ) { auto& timeline = lockmap.timeline; uint8_t lockingThread; uint8_t lockCount; uint64_t waitShared; uint64_t waitList; uint64_t sharedList; if( pos == 0 ) { lockingThread = 0; lockCount = 0; waitShared = 0; waitList = 0; sharedList = 0; } else { const auto tl = (LockEventShared*)timeline[pos-1]; lockingThread = tl->lockingThread; lockCount = tl->lockCount; waitShared = tl->waitShared; waitList = tl->waitList; sharedList = tl->sharedList; } const auto end = timeline.size(); // ObtainShared and ReleaseShared should assert on lockCount == 0, but // due to the async retrieval of data from threads that not possible. while( pos != end ) { const auto tl = (LockEventShared*)timeline[pos]; const auto tbit = uint64_t( 1 ) << tl->thread; switch( (LockEvent::Type)tl->type ) { case LockEvent::Type::Wait: waitList |= tbit; break; case LockEvent::Type::WaitShared: waitShared |= tbit; break; case LockEvent::Type::Obtain: assert( lockCount < std::numeric_limits::max() ); assert( ( waitList & tbit ) != 0 ); waitList &= ~tbit; lockingThread = tl->thread; lockCount++; break; case LockEvent::Type::Release: assert( lockCount > 0 ); lockCount--; break; case LockEvent::Type::ObtainShared: assert( ( waitShared & tbit ) != 0 ); assert( ( sharedList & tbit ) == 0 ); waitShared &= ~tbit; sharedList |= tbit; break; case LockEvent::Type::ReleaseShared: assert( ( sharedList & tbit ) != 0 ); sharedList &= ~tbit; break; default: break; } tl->lockingThread = lockingThread; tl->waitShared = waitShared; tl->waitList = waitList; tl->sharedList = sharedList; tl->lockCount = lockCount; pos++; } } static inline void UpdateLockCount( LockMap& lockmap, size_t pos ) { if( lockmap.type == LockType::Lockable ) { UpdateLockCountLockable( lockmap, pos ); } else { UpdateLockCountSharedLockable( lockmap, pos ); } } Worker::Worker( const char* addr ) : m_addr( addr ) , m_connected( false ) , m_hasData( false ) , m_shutdown( false ) , m_terminate( false ) , m_stream( LZ4_createStreamDecode() ) , m_buffer( new char[TargetFrameSize*3 + 1] ) , m_bufferOffset( 0 ) , m_pendingStrings( 0 ) , m_pendingThreads( 0 ) , m_pendingSourceLocation( 0 ) { m_data.sourceLocationExpand.push_back( 0 ); #ifndef TRACY_NO_STATISTICS m_data.sourceLocationZonesReady = true; #endif m_thread = std::thread( [this] { Exec(); } ); SetThreadName( m_thread, "Tracy Worker" ); } Worker::Worker( FileRead& f, EventType::Type eventMask ) : m_connected( false ) , m_hasData( true ) , m_shutdown( false ) , m_terminate( false ) , m_stream( nullptr ) , m_buffer( nullptr ) { int fileVer = 0; uint8_t hdr[8]; f.Read( hdr, sizeof( hdr ) ); if( memcmp( FileHeader, hdr, FileHeaderMagic ) == 0 ) { fileVer = FileVersion( hdr[FileHeaderMagic], hdr[FileHeaderMagic+1], hdr[FileHeaderMagic+2] ); if( fileVer > CurrentVersion ) { throw UnsupportedVersion( fileVer ); } f.Read( m_delay ); } else { static_assert( sizeof( m_delay ) == sizeof( hdr ), "Size mismatch" ); memcpy( &m_delay, hdr, sizeof( m_delay ) ); } f.Read( m_resolution ); f.Read( m_timerMul ); f.Read( m_data.lastTime ); uint64_t sz; { f.Read( sz ); assert( sz < 1024 ); char tmp[1024]; f.Read( tmp, sz ); m_captureName = std::string( tmp, tmp+sz ); } f.Read( sz ); m_data.frames.reserve_and_use( sz ); f.Read( m_data.frames.data(), sizeof( uint64_t ) * sz ); flat_hash_map> pointerMap; f.Read( sz ); for( uint64_t i=0; i( ssz+1 ); f.Read( dst, ssz ); dst[ssz] = '\0'; m_data.stringData.push_back( dst ); pointerMap.emplace( ptr, dst ); } f.Read( sz ); for( uint64_t i=0; isecond ); } f.Read( sz ); for( uint64_t i=0; isecond ); } f.Read( sz ); for( uint64_t i=0; i(); f.Read( srcloc, sizeof( *srcloc ) ); m_data.sourceLocationPayload.push_back_no_space_check( srcloc ); m_data.sourceLocationPayloadMap.emplace( srcloc, uint32_t( i ) ); } #ifndef TRACY_NO_STATISTICS m_data.sourceLocationZonesReady = false; m_data.sourceLocationZones.reserve( sle + sz ); for( uint64_t i=1; i= FileVersion( 0, 3, 0 ) ) { if( lockmap.type == LockType::Lockable ) { for( uint64_t i=0; i(); f.Read( lev, sizeof( LockEvent::time ) + sizeof( LockEvent::srcloc ) + sizeof( LockEvent::thread ) + sizeof( LockEvent::type ) ); *ptr++ = lev; } } else { for( uint64_t i=0; i(); f.Read( lev, sizeof( LockEventShared::time ) + sizeof( LockEventShared::srcloc ) + sizeof( LockEventShared::thread ) + sizeof( LockEventShared::type ) ); *ptr++ = lev; } } } else { if( lockmap.type == LockType::Lockable ) { for( uint64_t i=0; i(); f.Read( lev, sizeof( LockEvent::time ) + sizeof( LockEvent::srcloc ) + sizeof( LockEvent::thread ) ); f.Skip( sizeof( uint8_t ) ); f.Read( lev->type ); f.Skip( sizeof( uint8_t ) + sizeof( uint64_t ) ); *ptr++ = lev; } } else { for( uint64_t i=0; i(); f.Read( lev, sizeof( LockEventShared::time ) + sizeof( LockEventShared::srcloc ) + sizeof( LockEventShared::thread ) ); f.Skip( sizeof( uint8_t ) ); f.Read( lev->type ); f.Skip( sizeof( uint8_t ) + sizeof( uint64_t ) * 3 ); *ptr++ = lev; } } } UpdateLockCount( lockmap, 0 ); m_data.lockMap.emplace( id, std::move( lockmap ) ); } } else { for( uint64_t i=0; i= FileVersion( 0, 3, 0 ) ) { f.Skip( tsz * ( sizeof( LockEvent::time ) + sizeof( LockEvent::type ) + sizeof( LockEvent::srcloc ) + sizeof( LockEvent::thread ) ) ); } else { f.Skip( tsz * ( type == LockType::Lockable ? sizeof( LockEvent ) : sizeof( LockEventShared ) ) ); } } } flat_hash_map> msgMap; f.Read( sz ); if( eventMask & EventType::Messages ) { m_data.messages.reserve( sz ); for( uint64_t i=0; i(); f.Read( msgdata, sizeof( MessageData::time ) + sizeof( MessageData::ref ) ); if( fileVer <= FileVersion( 0, 3, 0 ) ) f.Skip( 7 ); m_data.messages.push_back_no_space_check( msgdata ); msgMap.emplace( ptr, msgdata ); } } else { // Prior to 0.3.1 MessageData was saved with padding. if( fileVer <= FileVersion( 0, 3, 0 ) ) { f.Skip( sz * ( sizeof( uint64_t ) + 24 ) ); } else { f.Skip( sz * ( sizeof( uint64_t ) + sizeof( MessageData::time ) + sizeof( MessageData::ref ) ) ); } } f.Read( sz ); m_data.threads.reserve( sz ); for( uint64_t i=0; i(); uint64_t tid; f.Read( tid ); td->id = tid; f.Read( td->count ); ReadTimeline( f, td->timeline, CompressThread( tid ) ); uint64_t msz; f.Read( msz ); if( eventMask & EventType::Messages ) { td->messages.reserve( msz ); for( uint64_t j=0; jmessages.push_back_no_space_check( md ); md->thread = tid; } } else { f.Skip( msz * sizeof( uint64_t ) ); } m_data.threads.push_back_no_space_check( td ); } #ifndef TRACY_NO_STATISTICS m_threadZones = std::thread( [this] { for( auto& v : m_data.sourceLocationZones ) { auto& zones = v.second.zones; #ifdef MY_LIBCPP_SUCKS pdqsort_branchless( zones.begin(), zones.end(), []( const auto& lhs, const auto& rhs ) { return lhs.zone->start < rhs.zone->start; } ); #else std::sort( std::execution::par_unseq, zones.begin(), zones.end(), []( const auto& lhs, const auto& rhs ) { return lhs.zone->start < rhs.zone->start; } ); #endif } std::lock_guard lock( m_data.lock ); m_data.sourceLocationZonesReady = true; } ); #endif f.Read( sz ); m_data.gpuData.reserve( sz ); for( uint64_t i=0; i(); f.Read( ctx->thread ); f.Read( ctx->accuracyBits ); f.Read( ctx->count ); if( fileVer <= FileVersion( 0, 3, 1 ) ) { ctx->period = 1.f; } else { f.Read( ctx->period ); } ReadTimeline( f, ctx->timeline ); m_data.gpuData.push_back_no_space_check( ctx ); } f.Read( sz ); if( eventMask & EventType::Plots ) { m_data.plots.reserve( sz ); for( uint64_t i=0; i(); pd->type = PlotType::User; f.Read( pd->name ); f.Read( pd->min ); f.Read( pd->max ); uint64_t psz; f.Read( psz ); pd->data.reserve_and_use( psz ); f.Read( pd->data.data(), psz * sizeof( PlotItem ) ); m_data.plots.push_back_no_space_check( pd ); } } else { for( uint64_t i=0; ithreadAlloc = CompressThread( t0 ); if( t0 == t1 ) { mem->threadFree = mem->threadAlloc; } else { mem->threadFree = CompressThread( t1 ); } if( mem->timeFree < 0 ) { m_data.memory.active.emplace( mem->ptr, i ); } else { m_data.memory.frees.push_back( i ); } mem++; } f.Read( m_data.memory.high ); f.Read( m_data.memory.low ); f.Read( m_data.memory.usage ); if( sz != 0 ) { m_threadMemory = std::thread( [this] { ReconstructMemAllocPlot(); } ); } } else { f.Skip( sz * ( sizeof( MemEvent::ptr ) + sizeof( MemEvent::size ) + sizeof( MemEvent::timeAlloc ) + sizeof( MemEvent::timeFree ) + sizeof( uint64_t ) + sizeof( uint64_t ) ) ); f.Skip( sizeof( MemData::high ) + sizeof( MemData::low ) + sizeof( MemData::usage ) ); } } template static inline void ZoneCleanup( Vector& vec ) { for( auto& v : vec ) { ZoneCleanup( v->child ); } vec.~Vector(); } Worker::~Worker() { Shutdown(); if( m_thread.joinable() ) m_thread.join(); if( m_threadMemory.joinable() ) m_threadMemory.join(); if( m_threadZones.joinable() ) m_threadZones.join(); delete[] m_buffer; LZ4_freeStreamDecode( m_stream ); for( auto& v : m_data.threads ) { ZoneCleanup( v->timeline ); v->messages.~Vector(); } for( auto& v : m_data.gpuData ) { ZoneCleanup( v->timeline ); } for( auto& v : m_data.plots ) { v->~PlotData(); } } int64_t Worker::GetFrameTime( size_t idx ) const { if( idx < m_data.frames.size() - 1 ) { return m_data.frames[idx+1] - m_data.frames[idx]; } else { return m_data.lastTime == 0 ? 0 : m_data.lastTime - m_data.frames.back(); } } int64_t Worker::GetFrameBegin( size_t idx ) const { assert( idx < m_data.frames.size() ); return m_data.frames[idx]; } int64_t Worker::GetFrameEnd( size_t idx ) const { if( idx < m_data.frames.size() - 1 ) { return m_data.frames[idx+1]; } else { return m_data.lastTime; } } std::pair Worker::GetFrameRange( int64_t from, int64_t to ) { const auto zitbegin = std::lower_bound( m_data.frames.begin(), m_data.frames.end(), from ); if( zitbegin == m_data.frames.end() ) return std::make_pair( -1, -1 ); const auto zitend = std::lower_bound( zitbegin, m_data.frames.end(), to ); int zbegin = std::distance( m_data.frames.begin(), zitbegin ); if( zbegin > 0 && *zitbegin != from) --zbegin; const int zend = std::distance( m_data.frames.begin(), zitend ); return std::make_pair( zbegin, zend ); } int64_t Worker::GetZoneEnd( const ZoneEvent& ev ) { auto ptr = &ev; for(;;) { if( ptr->end >= 0 ) return ptr->end; if( ptr->child.empty() ) return ptr->start; ptr = ptr->child.back(); } } int64_t Worker::GetZoneEnd( const GpuEvent& ev ) { auto ptr = &ev; for(;;) { if( ptr->gpuEnd >= 0 ) return ptr->gpuEnd; if( ptr->child.empty() ) return ptr->gpuStart; ptr = ptr->child.back(); } } const char* Worker::GetString( uint64_t ptr ) const { const auto it = m_data.strings.find( ptr ); if( it == m_data.strings.end() || it->second == nullptr ) { return "???"; } else { return it->second; } } const char* Worker::GetString( const StringRef& ref ) const { if( ref.isidx ) { assert( ref.active ); return m_data.stringData[ref.str]; } else { if( ref.active ) { return GetString( ref.str ); } else { return "???"; } } } const char* Worker::GetString( const StringIdx& idx ) const { assert( idx.active ); return m_data.stringData[idx.idx]; } const char* Worker::GetThreadString( uint64_t id ) const { const auto it = m_data.threadNames.find( id ); if( it == m_data.threadNames.end() ) { return "???"; } else { return it->second; } } const SourceLocation& Worker::GetSourceLocation( int32_t srcloc ) const { if( srcloc < 0 ) { return *m_data.sourceLocationPayload[-srcloc-1]; } else { const auto it = m_data.sourceLocation.find( m_data.sourceLocationExpand[srcloc] ); assert( it != m_data.sourceLocation.end() ); return it->second; } } std::vector Worker::GetMatchingSourceLocation( const char* query ) const { std::vector match; const auto sz = m_data.sourceLocationExpand.size(); for( size_t i=1; isecond; const auto str = GetString( srcloc.name.active ? srcloc.name : srcloc.function ); if( strstr( str, query ) != nullptr ) { match.push_back( (int32_t)i ); } } for( auto& srcloc : m_data.sourceLocationPayload ) { const auto str = GetString( srcloc->name.active ? srcloc->name : srcloc->function ); if( strstr( str, query ) != nullptr ) { auto it = m_data.sourceLocationPayloadMap.find( srcloc ); assert( it != m_data.sourceLocationPayloadMap.end() ); match.push_back( -int32_t( it->second + 1 ) ); } } return match; } #ifndef TRACY_NO_STATISTICS const Worker::SourceLocationZones& Worker::GetZonesForSourceLocation( int32_t srcloc ) const { static const SourceLocationZones empty; auto it = m_data.sourceLocationZones.find( srcloc ); return it != m_data.sourceLocationZones.end() ? it->second : empty; } #endif uint16_t Worker::CompressThreadReal( uint64_t thread ) { auto it = m_data.threadMap.find( thread ); if( it != m_data.threadMap.end() ) { m_data.threadLast.first = thread; m_data.threadLast.second = it->second; return it->second; } else { return CompressThreadNew( thread ); } } uint16_t Worker::CompressThreadNew( uint64_t thread ) { auto sz = m_data.threadExpand.size(); m_data.threadExpand.push_back( thread ); m_data.threadMap.emplace( thread, sz ); m_data.threadLast.first = thread; m_data.threadLast.second = sz; return sz; } void Worker::Exec() { timeval tv; tv.tv_sec = 0; tv.tv_usec = 10000; auto ShouldExit = [this] { return m_shutdown.load( std::memory_order_relaxed ); }; for(;;) { if( m_shutdown.load( std::memory_order_relaxed ) ) return; if( !m_sock.Connect( m_addr.c_str(), "8086" ) ) continue; std::chrono::time_point t0; uint64_t bytes = 0; uint64_t decBytes = 0; { WelcomeMessage welcome; if( !m_sock.Read( &welcome, sizeof( welcome ), &tv, ShouldExit ) ) goto close; m_timerMul = welcome.timerMul; m_data.frames.push_back( TscTime( welcome.initBegin ) ); m_data.frames.push_back( TscTime( welcome.initEnd ) ); m_data.lastTime = m_data.frames.back(); m_delay = TscTime( welcome.delay ); m_resolution = TscTime( welcome.resolution ); char dtmp[64]; time_t date = welcome.epoch; auto lt = localtime( &date ); strftime( dtmp, 64, "%F %T", lt ); char tmp[1024]; sprintf( tmp, "%s @ %s", welcome.programName, dtmp ); m_captureName = tmp; } m_hasData.store( true, std::memory_order_release ); LZ4_setStreamDecode( m_stream, nullptr, 0 ); m_connected.store( true, std::memory_order_relaxed ); t0 = std::chrono::high_resolution_clock::now(); for(;;) { if( m_shutdown.load( std::memory_order_relaxed ) ) return; auto buf = m_buffer + m_bufferOffset; char lz4buf[LZ4Size]; lz4sz_t lz4sz; if( !m_sock.Read( &lz4sz, sizeof( lz4sz ), &tv, ShouldExit ) ) goto close; if( !m_sock.Read( lz4buf, lz4sz, &tv, ShouldExit ) ) goto close; bytes += sizeof( lz4sz ) + lz4sz; auto sz = LZ4_decompress_safe_continue( m_stream, lz4buf, buf, lz4sz, TargetFrameSize ); assert( sz >= 0 ); decBytes += sz; char* ptr = buf; const char* end = buf + sz; { std::lock_guard lock( m_data.lock ); while( ptr < end ) { auto ev = (const QueueItem*)ptr; DispatchProcess( *ev, ptr ); } m_bufferOffset += sz; if( m_bufferOffset > TargetFrameSize * 2 ) m_bufferOffset = 0; HandlePostponedPlots(); } auto t1 = std::chrono::high_resolution_clock::now(); auto td = std::chrono::duration_cast( t1 - t0 ).count(); enum { MbpsUpdateTime = 200 }; if( td > MbpsUpdateTime ) { std::lock_guard lock( m_mbpsData.lock ); m_mbpsData.mbps.erase( m_mbpsData.mbps.begin() ); m_mbpsData.mbps.emplace_back( bytes / ( td * 125.f ) ); m_mbpsData.compRatio = float( bytes ) / decBytes; t0 = t1; bytes = 0; decBytes = 0; } if( m_terminate ) { if( m_pendingStrings != 0 || m_pendingThreads != 0 || m_pendingSourceLocation != 0 || !m_pendingCustomStrings.empty() || !m_pendingPlots.empty() ) { continue; } bool done = true; for( auto& v : m_data.threads ) { if( !v->stack.empty() ) { done = false; break; } } if( !done ) continue; ServerQuery( ServerQueryTerminate, 0 ); break; } } close: m_sock.Close(); m_connected.store( false, std::memory_order_relaxed ); } } void Worker::ServerQuery( uint8_t type, uint64_t data ) { enum { DataSize = sizeof( type ) + sizeof( data ) }; char tmp[DataSize]; memcpy( tmp, &type, sizeof( type ) ); memcpy( tmp + sizeof( type ), &data, sizeof( data ) ); m_sock.Send( tmp, DataSize ); } void Worker::DispatchProcess( const QueueItem& ev, char*& ptr ) { if( ev.hdr.type == QueueType::CustomStringData || ev.hdr.type == QueueType::StringData || ev.hdr.type == QueueType::ThreadName || ev.hdr.type == QueueType::PlotName || ev.hdr.type == QueueType::SourceLocationPayload ) { ptr += sizeof( QueueHeader ) + sizeof( QueueStringTransfer ); uint16_t sz; memcpy( &sz, ptr, sizeof( sz ) ); ptr += sizeof( sz ); switch( ev.hdr.type ) { case QueueType::CustomStringData: AddCustomString( ev.stringTransfer.ptr, ptr, sz ); break; case QueueType::StringData: AddString( ev.stringTransfer.ptr, ptr, sz ); break; case QueueType::ThreadName: AddThreadString( ev.stringTransfer.ptr, ptr, sz ); break; case QueueType::PlotName: HandlePlotName( ev.stringTransfer.ptr, ptr, sz ); break; case QueueType::SourceLocationPayload: AddSourceLocationPayload( ev.stringTransfer.ptr, ptr, sz ); break; default: assert( false ); break; } ptr += sz; } else { ptr += QueueDataSize[ev.hdr.idx]; Process( ev ); } } void Worker::CheckSourceLocation( uint64_t ptr ) { if( m_data.sourceLocation.find( ptr ) == m_data.sourceLocation.end() ) { NewSourceLocation( ptr ); } } void Worker::NewSourceLocation( uint64_t ptr ) { static const SourceLocation emptySourceLocation = {}; m_data.sourceLocation.emplace( ptr, emptySourceLocation ); m_pendingSourceLocation++; m_sourceLocationQueue.push_back( ptr ); ServerQuery( ServerQuerySourceLocation, ptr ); } uint32_t Worker::ShrinkSourceLocation( uint64_t srcloc ) { auto it = m_sourceLocationShrink.find( srcloc ); if( it != m_sourceLocationShrink.end() ) { return it->second; } else { return NewShrinkedSourceLocation( srcloc ); } } uint32_t Worker::NewShrinkedSourceLocation( uint64_t srcloc ) { const auto sz = m_data.sourceLocationExpand.size(); m_data.sourceLocationExpand.push_back( srcloc ); #ifndef TRACY_NO_STATISTICS m_data.sourceLocationZones.emplace( sz, SourceLocationZones() ); #endif m_sourceLocationShrink.emplace( srcloc, sz ); return sz; } void Worker::InsertMessageData( MessageData* msg, uint64_t thread ) { if( m_data.messages.empty() ) { m_data.messages.push_back( msg ); } else if( m_data.messages.back()->time < msg->time ) { m_data.messages.push_back_non_empty( msg ); } else { auto mit = std::lower_bound( m_data.messages.begin(), m_data.messages.end(), msg->time, [] ( const auto& lhs, const auto& rhs ) { return lhs->time < rhs; } ); m_data.messages.insert( mit, msg ); } auto vec = &NoticeThread( thread )->messages; if( vec->empty() ) { vec->push_back( msg ); } else if( vec->back()->time < msg->time ) { vec->push_back_non_empty( msg ); } else { auto tmit = std::lower_bound( vec->begin(), vec->end(), msg->time, [] ( const auto& lhs, const auto& rhs ) { return lhs->time < rhs; } ); vec->insert( tmit, msg ); } } ThreadData* Worker::NoticeThread( uint64_t thread ) { auto it = m_threadMap.find( thread ); if( it != m_threadMap.end() ) { return it->second; } else { return NewThread( thread ); } } ThreadData* Worker::NewThread( uint64_t thread ) { CheckThreadString( thread ); auto td = m_slab.AllocInit(); td->id = thread; td->count = 0; m_data.threads.push_back( td ); m_threadMap.emplace( thread, td ); return td; } void Worker::NewZone( ZoneEvent* zone, uint64_t thread ) { m_data.zonesCnt++; #ifndef TRACY_NO_STATISTICS auto it = m_data.sourceLocationZones.find( zone->srcloc ); assert( it != m_data.sourceLocationZones.end() ); it->second.zones.push_back( ZoneThreadData { zone, CompressThread( thread ) } ); #endif auto td = NoticeThread( thread ); td->count++; if( td->stack.empty() ) { td->stack.push_back( zone ); td->timeline.push_back( zone ); } else { td->stack.back()->child.push_back( zone ); td->stack.push_back_non_empty( zone ); } } void Worker::InsertLockEvent( LockMap& lockmap, LockEvent* lev, uint64_t thread ) { m_data.lastTime = std::max( m_data.lastTime, lev->time ); NoticeThread( thread ); auto it = lockmap.threadMap.find( thread ); if( it == lockmap.threadMap.end() ) { assert( lockmap.threadList.size() < MaxLockThreads ); it = lockmap.threadMap.emplace( thread, lockmap.threadList.size() ).first; lockmap.threadList.emplace_back( thread ); } lev->thread = it->second; assert( lev->thread == it->second ); auto& timeline = lockmap.timeline; if( timeline.empty() ) { timeline.push_back( lev ); UpdateLockCount( lockmap, timeline.size() - 1 ); } else if( timeline.back()->time < lev->time ) { timeline.push_back_non_empty( lev ); UpdateLockCount( lockmap, timeline.size() - 1 ); } else { auto it = std::lower_bound( timeline.begin(), timeline.end(), lev->time, [] ( const auto& lhs, const auto& rhs ) { return lhs->time < rhs; } ); it = timeline.insert( it, lev ); UpdateLockCount( lockmap, std::distance( timeline.begin(), it ) ); } } void Worker::CheckString( uint64_t ptr ) { if( ptr == 0 ) return; if( m_data.strings.find( ptr ) != m_data.strings.end() ) return; m_data.strings.emplace( ptr, "???" ); m_pendingStrings++; ServerQuery( ServerQueryString, ptr ); } void Worker::CheckThreadString( uint64_t id ) { if( m_data.threadNames.find( id ) != m_data.threadNames.end() ) return; m_data.threadNames.emplace( id, "???" ); m_pendingThreads++; ServerQuery( ServerQueryThreadString, id ); } void Worker::AddSourceLocation( const QueueSourceLocation& srcloc ) { assert( m_pendingSourceLocation > 0 ); m_pendingSourceLocation--; const auto ptr = m_sourceLocationQueue.front(); m_sourceLocationQueue.erase( m_sourceLocationQueue.begin() ); auto it = m_data.sourceLocation.find( ptr ); assert( it != m_data.sourceLocation.end() ); CheckString( srcloc.name ); CheckString( srcloc.file ); CheckString( srcloc.function ); uint32_t color = ( srcloc.r << 16 ) | ( srcloc.g << 8 ) | srcloc.b; it->second = SourceLocation { srcloc.name == 0 ? StringRef() : StringRef( StringRef::Ptr, srcloc.name ), StringRef( StringRef::Ptr, srcloc.function ), StringRef( StringRef::Ptr, srcloc.file ), srcloc.line, color }; } void Worker::AddSourceLocationPayload( uint64_t ptr, char* data, size_t sz ) { const auto start = data; assert( m_pendingSourceLocationPayload.find( ptr ) == m_pendingSourceLocationPayload.end() ); uint32_t color, line; memcpy( &color, data, 4 ); memcpy( &line, data + 4, 4 ); data += 8; auto end = data; while( *end ) end++; const auto func = StoreString( data, end - data ); end++; data = end; while( *end ) end++; const auto source = StoreString( data, end - data ); end++; const auto nsz = sz - ( end - start ); color = ( ( color & 0x00FF0000 ) >> 16 ) | ( ( color & 0x0000FF00 ) ) | ( ( color & 0x000000FF ) << 16 ); SourceLocation srcloc { nsz == 0 ? StringRef() : StringRef( StringRef::Idx, StoreString( end, nsz ).idx ), StringRef( StringRef::Idx, func.idx ), StringRef( StringRef::Idx, source.idx ), line, color }; auto it = m_data.sourceLocationPayloadMap.find( &srcloc ); if( it == m_data.sourceLocationPayloadMap.end() ) { auto slptr = m_slab.Alloc(); memcpy( slptr, &srcloc, sizeof( srcloc ) ); uint32_t idx = m_data.sourceLocationPayload.size(); m_data.sourceLocationPayloadMap.emplace( slptr, idx ); m_pendingSourceLocationPayload.emplace( ptr, -int32_t( idx + 1 ) ); m_data.sourceLocationPayload.push_back( slptr ); #ifndef TRACY_NO_STATISTICS m_data.sourceLocationZones.emplace( -int32_t( idx + 1 ), SourceLocationZones() ); #endif } else { m_pendingSourceLocationPayload.emplace( ptr, -int32_t( it->second + 1 ) ); } } void Worker::AddString( uint64_t ptr, char* str, size_t sz ) { assert( m_pendingStrings > 0 ); m_pendingStrings--; auto it = m_data.strings.find( ptr ); assert( it != m_data.strings.end() && strcmp( it->second, "???" ) == 0 ); const auto sl = StoreString( str, sz ); it->second = sl.ptr; } void Worker::AddThreadString( uint64_t id, char* str, size_t sz ) { assert( m_pendingThreads > 0 ); m_pendingThreads--; auto it = m_data.threadNames.find( id ); assert( it != m_data.threadNames.end() && strcmp( it->second, "???" ) == 0 ); const auto sl = StoreString( str, sz ); it->second = sl.ptr; } void Worker::AddCustomString( uint64_t ptr, char* str, size_t sz ) { assert( m_pendingCustomStrings.find( ptr ) == m_pendingCustomStrings.end() ); m_pendingCustomStrings.emplace( ptr, StoreString( str, sz ) ); } void Worker::InsertPlot( PlotData* plot, int64_t time, double val ) { if( plot->data.empty() ) { plot->min = val; plot->max = val; plot->data.push_back( { time, val } ); } else if( plot->data.back().time < time ) { if( plot->min > val ) plot->min = val; else if( plot->max < val ) plot->max = val; plot->data.push_back_non_empty( { time, val } ); } else { if( plot->min > val ) plot->min = val; else if( plot->max < val ) plot->max = val; if( plot->postpone.empty() ) { plot->postponeTime = std::chrono::duration_cast( std::chrono::high_resolution_clock::now().time_since_epoch() ).count(); plot->postpone.push_back( { time, val } ); } else { plot->postpone.push_back_non_empty( { time, val } ); } } } void Worker::HandlePlotName( uint64_t name, char* str, size_t sz ) { auto pit = m_pendingPlots.find( name ); assert( pit != m_pendingPlots.end() ); const auto sl = StoreString( str, sz ); auto it = m_plotRev.find( sl.ptr ); if( it == m_plotRev.end() ) { m_plotMap.emplace( name, pit->second ); m_plotRev.emplace( sl.ptr, pit->second ); m_data.plots.push_back( pit->second ); m_data.strings.emplace( name, sl.ptr ); } else { auto plot = it->second; m_plotMap.emplace( name, plot ); const auto& pp = pit->second->data; for( auto& v : pp ) { InsertPlot( plot, v.time, v.val ); } // TODO what happens with the source data here? } m_pendingPlots.erase( pit ); } void Worker::HandlePostponedPlots() { for( auto& plot : m_data.plots ) { auto& src = plot->postpone; if( src.empty() ) continue; if( std::chrono::duration_cast( std::chrono::high_resolution_clock::now().time_since_epoch() ).count() - plot->postponeTime < 100 ) continue; auto& dst = plot->data; #ifdef MY_LIBCPP_SUCKS pdqsort_branchless( src.begin(), src.end(), [] ( const auto& l, const auto& r ) { return l.time < r.time; } ); #else std::sort( std::execution::par_unseq, src.begin(), src.end(), [] ( const auto& l, const auto& r ) { return l.time < r.time; } ); #endif const auto ds = std::lower_bound( dst.begin(), dst.end(), src.front().time, [] ( const auto& l, const auto& r ) { return l.time < r; } ); const auto dsd = std::distance( dst.begin(), ds ) ; const auto de = std::lower_bound( ds, dst.end(), src.back().time, [] ( const auto& l, const auto& r ) { return l.time < r; } ); const auto ded = std::distance( dst.begin(), de ); dst.insert( de, src.begin(), src.end() ); std::inplace_merge( dst.begin() + dsd, dst.begin() + ded, dst.begin() + ded + src.size(), [] ( const auto& l, const auto& r ) { return l.time < r.time; } ); src.clear(); } } StringLocation Worker::StoreString( char* str, size_t sz ) { StringLocation ret; const char backup = str[sz]; str[sz] = '\0'; auto sit = m_data.stringMap.find( str ); if( sit == m_data.stringMap.end() ) { auto ptr = m_slab.Alloc( sz+1 ); memcpy( ptr, str, sz ); ptr[sz] = '\0'; ret.ptr = ptr; ret.idx = m_data.stringData.size(); m_data.stringMap.emplace( ptr, m_data.stringData.size() ); m_data.stringData.push_back( ptr ); } else { ret.ptr = sit->first; ret.idx = sit->second; } str[sz] = backup; return ret; } void Worker::Process( const QueueItem& ev ) { switch( ev.hdr.type ) { case QueueType::ZoneBegin: ProcessZoneBegin( ev.zoneBegin ); break; case QueueType::ZoneBeginAllocSrcLoc: ProcessZoneBeginAllocSrcLoc( ev.zoneBegin ); break; case QueueType::ZoneEnd: ProcessZoneEnd( ev.zoneEnd ); break; case QueueType::FrameMarkMsg: ProcessFrameMark( ev.frameMark ); break; case QueueType::SourceLocation: AddSourceLocation( ev.srcloc ); break; case QueueType::ZoneText: ProcessZoneText( ev.zoneText ); break; case QueueType::LockAnnounce: ProcessLockAnnounce( ev.lockAnnounce ); break; case QueueType::LockWait: ProcessLockWait( ev.lockWait ); break; case QueueType::LockObtain: ProcessLockObtain( ev.lockObtain ); break; case QueueType::LockRelease: ProcessLockRelease( ev.lockRelease ); break; case QueueType::LockSharedWait: ProcessLockSharedWait( ev.lockWait ); break; case QueueType::LockSharedObtain: ProcessLockSharedObtain( ev.lockObtain ); break; case QueueType::LockSharedRelease: ProcessLockSharedRelease( ev.lockRelease ); break; case QueueType::LockMark: ProcessLockMark( ev.lockMark ); break; case QueueType::PlotData: ProcessPlotData( ev.plotData ); break; case QueueType::Message: ProcessMessage( ev.message ); break; case QueueType::MessageLiteral: ProcessMessageLiteral( ev.message ); break; case QueueType::GpuNewContext: ProcessGpuNewContext( ev.gpuNewContext ); break; case QueueType::GpuZoneBegin: ProcessGpuZoneBegin( ev.gpuZoneBegin ); break; case QueueType::GpuZoneEnd: ProcessGpuZoneEnd( ev.gpuZoneEnd ); break; case QueueType::GpuTime: ProcessGpuTime( ev.gpuTime ); break; case QueueType::GpuResync: ProcessGpuResync( ev.gpuResync ); break; case QueueType::MemAlloc: ProcessMemAlloc( ev.memAlloc ); break; case QueueType::MemFree: ProcessMemFree( ev.memFree ); break; case QueueType::Terminate: m_terminate = true; break; default: assert( false ); break; } } void Worker::ProcessZoneBegin( const QueueZoneBegin& ev ) { auto zone = m_slab.AllocInit(); CheckSourceLocation( ev.srcloc ); zone->start = TscTime( ev.time ); zone->end = -1; zone->srcloc = ShrinkSourceLocation( ev.srcloc ); assert( ev.cpu == 0xFFFFFFFF || ev.cpu <= std::numeric_limits::max() ); zone->cpu_start = ev.cpu == 0xFFFFFFFF ? -1 : (int8_t)ev.cpu; m_data.lastTime = std::max( m_data.lastTime, zone->start ); NewZone( zone, ev.thread ); } void Worker::ProcessZoneBeginAllocSrcLoc( const QueueZoneBegin& ev ) { auto it = m_pendingSourceLocationPayload.find( ev.srcloc ); assert( it != m_pendingSourceLocationPayload.end() ); auto zone = m_slab.AllocInit(); zone->start = TscTime( ev.time ); zone->end = -1; zone->srcloc = it->second; assert( ev.cpu == 0xFFFFFFFF || ev.cpu <= std::numeric_limits::max() ); zone->cpu_start = ev.cpu == 0xFFFFFFFF ? -1 : (int8_t)ev.cpu; m_data.lastTime = std::max( m_data.lastTime, zone->start ); NewZone( zone, ev.thread ); m_pendingSourceLocationPayload.erase( it ); } void Worker::ProcessZoneEnd( const QueueZoneEnd& ev ) { auto tit = m_threadMap.find( ev.thread ); assert( tit != m_threadMap.end() ); auto td = tit->second; auto& stack = td->stack; assert( !stack.empty() ); auto zone = stack.back_and_pop(); assert( zone->end == -1 ); zone->end = TscTime( ev.time ); assert( ev.cpu == 0xFFFFFFFF || ev.cpu <= std::numeric_limits::max() ); zone->cpu_end = ev.cpu == 0xFFFFFFFF ? -1 : (int8_t)ev.cpu; assert( zone->end >= zone->start ); m_data.lastTime = std::max( m_data.lastTime, zone->end ); #ifndef TRACY_NO_STATISTICS auto timeSpan = zone->end - zone->start; if( timeSpan > 0 ) { auto it = m_data.sourceLocationZones.find( zone->srcloc ); assert( it != m_data.sourceLocationZones.end() ); it->second.min = std::min( it->second.min, timeSpan ); it->second.max = std::max( it->second.max, timeSpan ); it->second.total += timeSpan; for( auto& v : zone->child ) { const auto childSpan = std::max( int64_t( 0 ), v->end - v->start ); timeSpan -= childSpan; } it->second.selfTotal += timeSpan; } #endif } void Worker::ProcessFrameMark( const QueueFrameMark& ev ) { assert( !m_data.frames.empty() ); const auto lastframe = m_data.frames.back(); const auto time = TscTime( ev.time ); assert( lastframe < time ); m_data.frames.push_back_non_empty( time ); m_data.lastTime = std::max( m_data.lastTime, time ); } void Worker::ProcessZoneText( const QueueZoneText& ev ) { auto tit = m_threadMap.find( ev.thread ); assert( tit != m_threadMap.end() ); auto td = tit->second; auto& stack = td->stack; assert( !stack.empty() ); auto zone = stack.back(); auto it = m_pendingCustomStrings.find( ev.text ); assert( it != m_pendingCustomStrings.end() ); zone->text = StringIdx( it->second.idx ); m_pendingCustomStrings.erase( it ); } void Worker::ProcessLockAnnounce( const QueueLockAnnounce& ev ) { auto it = m_data.lockMap.find( ev.id ); if( it == m_data.lockMap.end() ) { LockMap lm; lm.srcloc = ShrinkSourceLocation( ev.lckloc ); lm.type = ev.type; lm.valid = true; m_data.lockMap.emplace( ev.id, std::move( lm ) ); } else { it->second.srcloc = ShrinkSourceLocation( ev.lckloc ); assert( it->second.type == ev.type ); it->second.valid = true; } CheckSourceLocation( ev.lckloc ); } void Worker::ProcessLockWait( const QueueLockWait& ev ) { auto it = m_data.lockMap.find( ev.id ); if( it == m_data.lockMap.end() ) { LockMap lm; lm.valid = false; lm.type = ev.type; it = m_data.lockMap.emplace( ev.id, std::move( lm ) ).first; } auto lev = ev.type == LockType::Lockable ? m_slab.Alloc() : m_slab.Alloc(); lev->time = TscTime( ev.time ); lev->type = LockEvent::Type::Wait; lev->srcloc = 0; InsertLockEvent( it->second, lev, ev.thread ); } void Worker::ProcessLockObtain( const QueueLockObtain& ev ) { assert( m_data.lockMap.find( ev.id ) != m_data.lockMap.end() ); auto& lock = m_data.lockMap[ev.id]; auto lev = lock.type == LockType::Lockable ? m_slab.Alloc() : m_slab.Alloc(); lev->time = TscTime( ev.time ); lev->type = LockEvent::Type::Obtain; lev->srcloc = 0; InsertLockEvent( lock, lev, ev.thread ); } void Worker::ProcessLockRelease( const QueueLockRelease& ev ) { assert( m_data.lockMap.find( ev.id ) != m_data.lockMap.end() ); auto& lock = m_data.lockMap[ev.id]; auto lev = lock.type == LockType::Lockable ? m_slab.Alloc() : m_slab.Alloc(); lev->time = TscTime( ev.time ); lev->type = LockEvent::Type::Release; lev->srcloc = 0; InsertLockEvent( lock, lev, ev.thread ); } void Worker::ProcessLockSharedWait( const QueueLockWait& ev ) { auto it = m_data.lockMap.find( ev.id ); if( it == m_data.lockMap.end() ) { LockMap lm; lm.valid = false; lm.type = ev.type; it = m_data.lockMap.emplace( ev.id, std::move( lm ) ).first; } assert( ev.type == LockType::SharedLockable ); auto lev = m_slab.Alloc(); lev->time = TscTime( ev.time ); lev->type = LockEvent::Type::WaitShared; lev->srcloc = 0; InsertLockEvent( it->second, lev, ev.thread ); } void Worker::ProcessLockSharedObtain( const QueueLockObtain& ev ) { assert( m_data.lockMap.find( ev.id ) != m_data.lockMap.end() ); auto& lock = m_data.lockMap[ev.id]; assert( lock.type == LockType::SharedLockable ); auto lev = m_slab.Alloc(); lev->time = TscTime( ev.time ); lev->type = LockEvent::Type::ObtainShared; lev->srcloc = 0; InsertLockEvent( lock, lev, ev.thread ); } void Worker::ProcessLockSharedRelease( const QueueLockRelease& ev ) { assert( m_data.lockMap.find( ev.id ) != m_data.lockMap.end() ); auto& lock = m_data.lockMap[ev.id]; assert( lock.type == LockType::SharedLockable ); auto lev = m_slab.Alloc(); lev->time = TscTime( ev.time ); lev->type = LockEvent::Type::ReleaseShared; lev->srcloc = 0; InsertLockEvent( lock, lev, ev.thread ); } void Worker::ProcessLockMark( const QueueLockMark& ev ) { CheckSourceLocation( ev.srcloc ); auto lit = m_data.lockMap.find( ev.id ); assert( lit != m_data.lockMap.end() ); auto& lockmap = lit->second; auto tid = lockmap.threadMap.find( ev.thread ); assert( tid != lockmap.threadMap.end() ); const auto thread = tid->second; auto it = lockmap.timeline.end(); for(;;) { --it; if( (*it)->thread == thread ) { switch( (*it)->type ) { case LockEvent::Type::Obtain: case LockEvent::Type::ObtainShared: case LockEvent::Type::Wait: case LockEvent::Type::WaitShared: (*it)->srcloc = ShrinkSourceLocation( ev.srcloc ); return; default: break; } } } } void Worker::ProcessPlotData( const QueuePlotData& ev ) { PlotData* plot; auto it = m_plotMap.find( ev.name ); if( it == m_plotMap.end() ) { auto pit = m_pendingPlots.find( ev.name ); if( pit == m_pendingPlots.end() ) { plot = m_slab.AllocInit(); plot->name = ev.name; plot->type = PlotType::User; m_pendingPlots.emplace( ev.name, plot ); ServerQuery( ServerQueryPlotName, ev.name ); } else { plot = pit->second; } } else { plot = it->second; } const auto time = TscTime( ev.time ); m_data.lastTime = std::max( m_data.lastTime, time ); switch( ev.type ) { case PlotDataType::Double: InsertPlot( plot, time, ev.data.d ); break; case PlotDataType::Float: InsertPlot( plot, time, (double)ev.data.f ); break; case PlotDataType::Int: InsertPlot( plot, time, (double)ev.data.i ); break; default: assert( false ); break; } } void Worker::ProcessMessage( const QueueMessage& ev ) { auto it = m_pendingCustomStrings.find( ev.text ); assert( it != m_pendingCustomStrings.end() ); auto msg = m_slab.Alloc(); msg->time = TscTime( ev.time ); msg->ref = StringRef( StringRef::Type::Idx, it->second.idx ); msg->thread = ev.thread; m_data.lastTime = std::max( m_data.lastTime, msg->time ); InsertMessageData( msg, ev.thread ); m_pendingCustomStrings.erase( it ); } void Worker::ProcessMessageLiteral( const QueueMessage& ev ) { CheckString( ev.text ); auto msg = m_slab.Alloc(); msg->time = TscTime( ev.time ); msg->ref = StringRef( StringRef::Type::Ptr, ev.text ); msg->thread = ev.thread; m_data.lastTime = std::max( m_data.lastTime, msg->time ); InsertMessageData( msg, ev.thread ); } void Worker::ProcessGpuNewContext( const QueueGpuNewContext& ev ) { assert( m_gpuCtxMap.find( ev.context ) == m_gpuCtxMap.end() ); auto gpu = m_slab.AllocInit(); gpu->timeDiff = TscTime( ev.cpuTime ) - ev.gpuTime; gpu->thread = ev.thread; gpu->accuracyBits = ev.accuracyBits; gpu->period = ev.period; gpu->count = 0; m_data.gpuData.push_back( gpu ); m_gpuCtxMap.emplace( ev.context, gpu ); } void Worker::ProcessGpuZoneBegin( const QueueGpuZoneBegin& ev ) { auto it = m_gpuCtxMap.find( ev.context ); assert( it != m_gpuCtxMap.end() ); auto ctx = it->second; CheckSourceLocation( ev.srcloc ); auto zone = m_slab.AllocInit(); zone->cpuStart = TscTime( ev.cpuTime ); zone->cpuEnd = -1; zone->gpuStart = std::numeric_limits::max(); zone->gpuEnd = -1; zone->srcloc = ShrinkSourceLocation( ev.srcloc ); m_data.lastTime = std::max( m_data.lastTime, zone->cpuStart ); auto timeline = &ctx->timeline; if( !ctx->stack.empty() ) { timeline = &ctx->stack.back()->child; } timeline->push_back( zone ); ctx->stack.push_back( zone ); ctx->queue.push_back( zone ); } void Worker::ProcessGpuZoneEnd( const QueueGpuZoneEnd& ev ) { auto it = m_gpuCtxMap.find( ev.context ); assert( it != m_gpuCtxMap.end() ); auto ctx = it->second; assert( !ctx->stack.empty() ); auto zone = ctx->stack.back_and_pop(); ctx->queue.push_back( zone ); zone->cpuEnd = TscTime( ev.cpuTime ); m_data.lastTime = std::max( m_data.lastTime, zone->cpuEnd ); } void Worker::ProcessGpuTime( const QueueGpuTime& ev ) { auto it = m_gpuCtxMap.find( ev.context ); assert( it != m_gpuCtxMap.end() ); auto ctx = it->second; auto zone = ctx->queue.front(); if( zone->gpuStart == std::numeric_limits::max() ) { zone->gpuStart = ctx->timeDiff + ev.gpuTime; m_data.lastTime = std::max( m_data.lastTime, zone->gpuStart ); ctx->count++; } else { zone->gpuEnd = ctx->timeDiff + ev.gpuTime; m_data.lastTime = std::max( m_data.lastTime, zone->gpuEnd ); } ctx->queue.erase( ctx->queue.begin() ); if( !ctx->resync.empty() ) { auto& resync = ctx->resync.front(); assert( resync.events > 0 ); resync.events--; if( resync.events == 0 ) { ctx->timeDiff = resync.timeDiff; ctx->resync.erase( ctx->resync.begin() ); } } } void Worker::ProcessGpuResync( const QueueGpuResync& ev ) { auto it = m_gpuCtxMap.find( ev.context ); assert( it != m_gpuCtxMap.end() ); auto ctx = it->second; const auto timeDiff = TscTime( ev.cpuTime ) - ev.gpuTime; if( ctx->queue.empty() ) { assert( ctx->resync.empty() ); ctx->timeDiff = timeDiff; } else { if( ctx->resync.empty() ) { ctx->resync.push_back( { timeDiff, uint16_t( ctx->queue.size() ) } ); } else { const auto last = ctx->resync.back().events; ctx->resync.push_back( { timeDiff, uint16_t( ctx->queue.size() - last ) } ); } } } void Worker::ProcessMemAlloc( const QueueMemAlloc& ev ) { const auto time = TscTime( ev.time ); assert( m_data.memory.active.find( ev.ptr ) == m_data.memory.active.end() ); assert( m_data.memory.data.empty() || m_data.memory.data.back().timeAlloc <= time ); m_data.memory.active.emplace( ev.ptr, m_data.memory.data.size() ); const auto ptr = ev.ptr; uint32_t lo; uint16_t hi; memcpy( &lo, ev.size, 4 ); memcpy( &hi, ev.size+4, 2 ); const uint64_t size = lo | ( uint64_t( hi ) << 32 ); auto& mem = m_data.memory.data.push_next(); mem.ptr = ptr; mem.size = size; mem.timeAlloc = time; mem.threadAlloc = CompressThread( ev.thread ); mem.timeFree = -1; mem.threadFree = 0; const auto low = m_data.memory.low; const auto high = m_data.memory.high; const auto ptrend = ptr + size; m_data.memory.low = std::min( low, ptr ); m_data.memory.high = std::max( high, ptrend ); m_data.memory.usage += size; MemAllocChanged( time ); } void Worker::ProcessMemFree( const QueueMemFree& ev ) { const auto time = TscTime( ev.time ); auto it = m_data.memory.active.find( ev.ptr ); assert( it != m_data.memory.active.end() ); m_data.memory.frees.push_back( it->second ); auto& mem = m_data.memory.data[it->second]; mem.timeFree = time; mem.threadFree = CompressThread( ev.thread ); m_data.memory.usage -= mem.size; m_data.memory.active.erase( it ); MemAllocChanged( time ); } void Worker::MemAllocChanged( int64_t time ) { const auto val = (double)m_data.memory.usage; if( !m_data.memory.plot ) { CreateMemAllocPlot(); m_data.memory.plot->min = val; m_data.memory.plot->max = val; m_data.memory.plot->data.push_back( { time, val } ); } else { assert( !m_data.memory.plot->data.empty() ); assert( m_data.memory.plot->data.back().time <= time ); if( m_data.memory.plot->min > val ) m_data.memory.plot->min = val; else if( m_data.memory.plot->max < val ) m_data.memory.plot->max = val; m_data.memory.plot->data.push_back_non_empty( { time, val } ); } } void Worker::CreateMemAllocPlot() { assert( !m_data.memory.plot ); m_data.memory.plot = m_slab.AllocInit(); m_data.memory.plot->name = 0; m_data.memory.plot->type = PlotType::Memory; m_data.memory.plot->data.push_back( { GetFrameBegin( 0 ), 0. } ); m_data.plots.push_back( m_data.memory.plot ); } void Worker::ReconstructMemAllocPlot() { auto& mem = m_data.memory; #ifdef MY_LIBCPP_SUCKS pdqsort_branchless( mem.frees.begin(), mem.frees.end(), [&mem] ( const auto& lhs, const auto& rhs ) { return mem.data[lhs].timeFree < mem.data[rhs].timeFree; } ); #else std::sort( std::execution::par_unseq, mem.frees.begin(), mem.frees.end(), [&mem] ( const auto& lhs, const auto& rhs ) { return mem.data[lhs].timeFree < mem.data[rhs].timeFree; } ); #endif const auto psz = mem.data.size() + mem.frees.size() + 1; PlotData* plot; { std::lock_guard lock( m_data.lock ); plot = m_slab.AllocInit(); } plot->name = 0; plot->type = PlotType::Memory; plot->data.reserve_and_use( psz ); auto aptr = mem.data.begin(); auto aend = mem.data.end(); auto fptr = mem.frees.begin(); auto fend = mem.frees.end(); double max = 0; double usage = 0; auto ptr = plot->data.data(); ptr->time = GetFrameBegin( 0 ); ptr->val = 0; ptr++; if( aptr != aend && fptr != fend ) { auto atime = aptr->timeAlloc; auto ftime = mem.data[*fptr].timeFree; for(;;) { if( atime < ftime ) { usage += int64_t( aptr->size ); assert( usage >= 0 ); if( max < usage ) max = usage; ptr->time = atime; ptr->val = usage; ptr++; aptr++; if( aptr == aend ) break; atime = aptr->timeAlloc; } else { usage -= int64_t( mem.data[*fptr].size ); assert( usage >= 0 ); if( max < usage ) max = usage; ptr->time = ftime; ptr->val = usage; ptr++; fptr++; if( fptr == fend ) break; ftime = mem.data[*fptr].timeFree; } } } while( aptr != aend ) { assert( aptr->timeFree < 0 ); int64_t time = aptr->timeAlloc; usage += int64_t( aptr->size ); assert( usage >= 0 ); if( max < usage ) max = usage; ptr->time = time; ptr->val = usage; ptr++; aptr++; } while( fptr != fend ) { int64_t time = mem.data[*fptr].timeFree; usage -= int64_t( mem.data[*fptr].size ); assert( usage >= 0 ); assert( max >= usage ); ptr->time = time; ptr->val = usage; ptr++; fptr++; } plot->min = 0; plot->max = max; std::lock_guard lock( m_data.lock ); m_data.plots.insert( m_data.plots.begin(), plot ); m_data.memory.plot = plot; } void Worker::ReadTimeline( FileRead& f, Vector& vec, uint16_t thread ) { uint64_t sz; f.Read( sz ); if( sz != 0 ) { ReadTimeline( f, vec, thread, sz ); } } void Worker::ReadTimeline( FileRead& f, Vector& vec ) { uint64_t sz; f.Read( sz ); if( sz != 0 ) { ReadTimeline( f, vec, sz ); } } void Worker::ReadTimeline( FileRead& f, Vector& vec, uint16_t thread, uint64_t size ) { assert( size != 0 ); vec.reserve_non_zero( size ); m_data.zonesCnt += size; for( uint64_t i=0; i(); vec.push_back_no_space_check( zone ); new( &zone->child ) decltype( zone->child ); f.Read( zone, sizeof( ZoneEvent ) - sizeof( ZoneEvent::child ) ); ReadTimeline( f, zone->child, thread ); #ifndef TRACY_NO_STATISTICS auto it = m_data.sourceLocationZones.find( zone->srcloc ); assert( it != m_data.sourceLocationZones.end() ); auto& ztd = it->second.zones.push_next(); ztd.zone = zone; ztd.thread = thread; if( zone->end >= 0 ) { auto timeSpan = zone->end - zone->start; if( timeSpan > 0 ) { it->second.min = std::min( it->second.min, timeSpan ); it->second.max = std::max( it->second.max, timeSpan ); it->second.total += timeSpan; for( auto& v : zone->child ) { const auto childSpan = std::max( int64_t( 0 ), v->end - v->start ); timeSpan -= childSpan; } it->second.selfTotal += timeSpan; } } #endif } } void Worker::ReadTimeline( FileRead& f, Vector& vec, uint64_t size ) { assert( size != 0 ); vec.reserve_non_zero( size ); for( uint64_t i=0; i(); vec.push_back_no_space_check( zone ); f.Read( zone, sizeof( GpuEvent ) - sizeof( GpuEvent::child ) ); ReadTimeline( f, zone->child ); } } void Worker::Write( FileWrite& f ) { f.Write( FileHeader, sizeof( FileHeader ) ); f.Write( &m_delay, sizeof( m_delay ) ); f.Write( &m_resolution, sizeof( m_resolution ) ); f.Write( &m_timerMul, sizeof( m_timerMul ) ); f.Write( &m_data.lastTime, sizeof( m_data.lastTime ) ); uint64_t sz = m_captureName.size(); f.Write( &sz, sizeof( sz ) ); f.Write( m_captureName.c_str(), sz ); sz = m_data.frames.size(); f.Write( &sz, sizeof( sz ) ); f.Write( m_data.frames.data(), sizeof( uint64_t ) * sz ); sz = m_data.stringData.size(); f.Write( &sz, sizeof( sz ) ); for( auto& v : m_data.stringData ) { uint64_t ptr = (uint64_t)v; f.Write( &ptr, sizeof( ptr ) ); sz = strlen( v ); f.Write( &sz, sizeof( sz ) ); f.Write( v, sz ); } sz = m_data.strings.size(); f.Write( &sz, sizeof( sz ) ); for( auto& v : m_data.strings ) { f.Write( &v.first, sizeof( v.first ) ); uint64_t ptr = (uint64_t)v.second; f.Write( &ptr, sizeof( ptr ) ); } sz = m_data.threadNames.size(); f.Write( &sz, sizeof( sz ) ); for( auto& v : m_data.threadNames ) { f.Write( &v.first, sizeof( v.first ) ); uint64_t ptr = (uint64_t)v.second; f.Write( &ptr, sizeof( ptr ) ); } sz = m_data.sourceLocation.size(); f.Write( &sz, sizeof( sz ) ); for( auto& v : m_data.sourceLocation ) { f.Write( &v.first, sizeof( v.first ) ); f.Write( &v.second, sizeof( v.second ) ); } sz = m_data.sourceLocationExpand.size(); f.Write( &sz, sizeof( sz ) ); for( auto& v : m_data.sourceLocationExpand ) { f.Write( &v, sizeof( v ) ); } sz = m_data.sourceLocationPayload.size(); f.Write( &sz, sizeof( sz ) ); for( auto& v : m_data.sourceLocationPayload ) { f.Write( v, sizeof( *v ) ); } sz = m_data.lockMap.size(); f.Write( &sz, sizeof( sz ) ); for( auto& v : m_data.lockMap ) { f.Write( &v.first, sizeof( v.first ) ); f.Write( &v.second.srcloc, sizeof( v.second.srcloc ) ); f.Write( &v.second.type, sizeof( v.second.type ) ); f.Write( &v.second.valid, sizeof( v.second.valid ) ); sz = v.second.threadList.size(); f.Write( &sz, sizeof( sz ) ); for( auto& t : v.second.threadList ) { f.Write( &t, sizeof( t ) ); } sz = v.second.timeline.size(); f.Write( &sz, sizeof( sz ) ); for( auto& lev : v.second.timeline ) { f.Write( lev, sizeof( LockEvent::time ) + sizeof( LockEvent::srcloc ) + sizeof( LockEvent::thread ) + sizeof( LockEvent::type ) ); } } sz = m_data.messages.size(); f.Write( &sz, sizeof( sz ) ); for( auto& v : m_data.messages ) { const auto ptr = (uint64_t)v; f.Write( &ptr, sizeof( ptr ) ); f.Write( v, sizeof( MessageData::time ) + sizeof( MessageData::ref ) ); } sz = m_data.threads.size(); f.Write( &sz, sizeof( sz ) ); for( auto& thread : m_data.threads ) { f.Write( &thread->id, sizeof( thread->id ) ); f.Write( &thread->count, sizeof( thread->count ) ); WriteTimeline( f, thread->timeline ); sz = thread->messages.size(); f.Write( &sz, sizeof( sz ) ); for( auto& v : thread->messages ) { auto ptr = uint64_t( v ); f.Write( &ptr, sizeof( ptr ) ); } } sz = m_data.gpuData.size(); f.Write( &sz, sizeof( sz ) ); for( auto& ctx : m_data.gpuData ) { f.Write( &ctx->thread, sizeof( ctx->thread ) ); f.Write( &ctx->accuracyBits, sizeof( ctx->accuracyBits ) ); f.Write( &ctx->count, sizeof( ctx->count ) ); f.Write( &ctx->period, sizeof( ctx->period ) ); WriteTimeline( f, ctx->timeline ); } sz = m_data.plots.size(); for( auto& plot : m_data.plots ) { if( plot->type != PlotType::User ) sz--; } f.Write( &sz, sizeof( sz ) ); for( auto& plot : m_data.plots ) { if( plot->type != PlotType::User ) continue; f.Write( &plot->name, sizeof( plot->name ) ); f.Write( &plot->min, sizeof( plot->min ) ); f.Write( &plot->max, sizeof( plot->max ) ); sz = plot->data.size(); f.Write( &sz, sizeof( sz ) ); f.Write( plot->data.data(), sizeof( PlotItem ) * sz ); } sz = m_data.memory.data.size(); f.Write( &sz, sizeof( sz ) ); for( auto& mem : m_data.memory.data ) { f.Write( &mem, sizeof( MemEvent::ptr ) + sizeof( MemEvent::size ) + sizeof( MemEvent::timeAlloc ) + sizeof( MemEvent::timeFree ) ); uint64_t t[2]; t[0] = DecompressThread( mem.threadAlloc ); t[1] = DecompressThread( mem.threadFree ); f.Write( &t, sizeof( t ) ); } f.Write( &m_data.memory.high, sizeof( m_data.memory.high ) ); f.Write( &m_data.memory.low, sizeof( m_data.memory.low ) ); f.Write( &m_data.memory.usage, sizeof( m_data.memory.usage ) ); } void Worker::WriteTimeline( FileWrite& f, const Vector& vec ) { uint64_t sz = vec.size(); f.Write( &sz, sizeof( sz ) ); for( auto& v : vec ) { f.Write( v, sizeof( ZoneEvent ) - sizeof( ZoneEvent::child ) ); WriteTimeline( f, v->child ); } } void Worker::WriteTimeline( FileWrite& f, const Vector& vec ) { uint64_t sz = vec.size(); f.Write( &sz, sizeof( sz ) ); for( auto& v : vec ) { f.Write( v, sizeof( GpuEvent ) - sizeof( GpuEvent::child ) ); WriteTimeline( f, v->child ); } } }