-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtopology.cpp
131 lines (113 loc) · 5.06 KB
/
topology.cpp
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
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
/*
BSD 3-Clause License
Copyright (c) 2016-2020, Intel Corporation
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
* Neither the name of the copyright holder nor the names of its
contributors may be used to endorse or promote products derived from
this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "cpucounters.h"
#include "topology.h"
namespace pcm {
UncoreCounterState ServerUncore::uncoreCounterState( void ) const
{
UncoreCounterState ucs;
// Fill the ucs
PCM* pcm = PCM::getInstance();
pcm->readAndAggregateUncoreMCCounters( socketID(), ucs );
pcm->readAndAggregateEnergyCounters( socketID(), ucs );
pcm->readAndAggregatePackageCStateResidencies( refCore()->msrHandle(), ucs );
return ucs;
}
Socket::Socket( PCM* m, int32 apicID, int32 logicalID )
: pcm_(m), refCore_(nullptr), apicID_(apicID), logicalID_(logicalID)
{
if ( pcm_->isServerCPU() )
uncore_ = new ServerUncore( pcm_, logicalID );
else if ( pcm_->isClientCPU() )
uncore_ = new ClientUncore( pcm_, logicalID );
else
throw std::runtime_error( "ERROR: Neither a client nor a server part, please fix the code!" );
}
SocketCounterState Socket::socketCounterState( void ) const {
SocketCounterState scs;
// Fill the scs
// by iterating the cores
for( auto core : cores_ ) {
scs.BasicCounterState::operator += ( core->coreCounterState() );
}
// and the uncore
scs.UncoreCounterState::operator += ( uncore_->uncoreCounterState() );
PCM::getInstance()->readPackageThermalHeadroom( socketID(), scs );
return scs;
}
void Aggregator::dispatch( SystemRoot const& syp ) {
// std::cerr << "Aggregator::dispatch( SystemRoot )\n";
dispatchedAt_ = std::chrono::steady_clock::now();
// CoreCounterStates are fetched asynchronously here
for ( auto* socket : syp.sockets() )
socket->accept( *this );
// Dispatching offlined cores
for ( auto* htp : syp.offlinedThreadsAtStart() )
htp->accept( *this );
auto ccsFuturesIter = ccsFutures_.begin();
auto ccsIter = ccsVector_.begin();
// int i;
// i = 0;
for ( ; ccsFuturesIter != ccsFutures_.end() && ccsIter != ccsVector_.end(); ++ccsFuturesIter, ++ccsIter ) {
// std::cerr << "Works ccsFuture: " << ++i << "\n";
(*ccsIter) = (*ccsFuturesIter).get();
}
// Aggregate BasicCounterStates
for ( auto* socket : syp.sockets() ) {
for ( auto* core : socket->cores() )
for ( auto* thread : core->threads() )
socsVector_[ socket->socketID() ] += ( ccsVector_[ thread->osID() ] );
// UncoreCounterStates have not been filled here so it is ok to add
// the entire SocketCounterState here
sycs_ += socsVector_[ socket->socketID() ];
}
// Fetch and aggregate UncoreCounterStates
auto ucsFuturesIter = ucsFutures_.begin();
auto socsIter = socsVector_.begin();
// i = 0;
for ( ; ucsFuturesIter != ucsFutures_.end() && socsIter != socsVector_.end(); ++ucsFuturesIter, ++socsIter ) {
// std::cerr << "Works ucsFuture: " << ++i << "\n";
// Because we already aggregated the Basic/CoreCounterStates above, sycs_
// only needs the ucs added here. If we would add socs to sycs we would
// count all Basic/CoreCounterState counters double
UncoreCounterState ucs = (*ucsFuturesIter).get();
sycs_ += ucs;
(*socsIter) = std::move( ucs );
}
PCM* pcm = PCM::getInstance();
pcm->readQPICounters( sycs_ );
}
Aggregator::Aggregator()
{
PCM* const pcm = PCM::getInstance();
// Resize user provided vectors to the right size
ccsVector_.resize( pcm->getNumCores() );
socsVector_.resize( pcm->getNumSockets() );
// Internal use only, need to be the same size as the user provided vectors
ccsFutures_.resize( pcm->getNumCores() );
ucsFutures_.resize( pcm->getNumSockets() );
}
}// namespace pcm