| 90 | } |
| 91 | |
| 92 | void SampleProfilerEnd() |
| 93 | { |
| 94 | auto start = steady_clock::now(); |
| 95 | { |
| 96 | if (s_currentNode) |
| 97 | { |
| 98 | auto& data = s_currentNode->data; |
| 99 | data.time += duration_cast<microseconds>(steady_clock::now() - data.start); |
| 100 | data.maxTime = data.time > data.maxTime ? data.time : data.maxTime; |
| 101 | s_currentNode = s_currentNode->parent; |
| 102 | } |
| 103 | else |
| 104 | { |
| 105 | s_beginEndMismatch = true; |
| 106 | } |
| 107 | } |
| 108 | s_overhead += duration_cast<microseconds>(steady_clock::now() - start); |
| 109 | } |
| 110 | |
| 111 | struct SampleProfilerTreeIteratorImpl final : public SampleProfilerTreeIterator |
| 112 | { |
no outgoing calls
no test coverage detected