1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
|
#ifndef __TRACYSTRINGDISCOVERY_HPP__
#define __TRACYSTRINGDISCOVERY_HPP__
#include "../common/TracyForceInline.hpp"
#include "tracy_flat_hash_map.hpp"
#include "TracyCharUtil.hpp"
#include "TracyVector.hpp"
namespace tracy
{
template<typename T>
class StringDiscovery
{
public:
tracy_force_inline Vector<T>& Data() { return m_data; }
tracy_force_inline const Vector<T>& Data() const { return m_data; }
tracy_force_inline bool IsPending() const { return !m_pending.empty(); }
// Merge( destination, postponed )
template<typename U>
tracy_force_inline void StringDiscovered( uint64_t name, const StringLocation& sl, U& stringMap, std::function<void(T,T)> Merge )
{
auto pit = m_pending.find( name );
assert( pit != m_pending.end() );
auto it = m_rev.find( sl.ptr );
if( it == m_rev.end() )
{
m_map.emplace( name, pit->second );
m_rev.emplace( sl.ptr, pit->second );
m_data.push_back( pit->second );
stringMap.emplace( name, sl.ptr );
}
else
{
auto item = it->second;
m_map.emplace( name, item );
Merge( item, pit->second );
}
m_pending.erase( pit );
}
tracy_force_inline T Retrieve( uint64_t name, std::function<T(uint64_t)> Create, std::function<void(uint64_t)> Query )
{
auto it = m_map.find( name );
if( it == m_map.end() )
{
auto pit = m_pending.find( name );
if( pit == m_pending.end() )
{
T item = Create( name );
m_pending.emplace( name, item );
Query( name );
return item;
}
else
{
return pit->second;
}
}
else
{
return it->second;
}
}
private:
Vector<T> m_data;
flat_hash_map<uint64_t, T, nohash<uint64_t>> m_pending;
flat_hash_map<uint64_t, T, nohash<uint64_t>> m_map;
flat_hash_map<const char*, T, charutil::HasherPOT, charutil::Comparator> m_rev;
};
}
#endif
|
