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
132
133
134
135
136
137
138
139
140
141
142
143
144
|
/* Copyright (C) 2018 Wildfire Games.
*
* 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.
*/
#ifndef INCLUDED_X86_X64_CACHE
#define INCLUDED_X86_X64_CACHE
namespace x86_x64 {
struct Cache // POD (may be used before static constructors)
{
enum Type
{
// (values match the CPUID.4 definition)
kNull,
kData,
kInstruction,
kUnified
// note: further values are "reserved"
};
static const size_t maxLevels = 4;
static const size_t fullyAssociative = 0xFF; // (CPUID.4 definition)
/**
* 1..maxLevels
**/
size_t m_Level;
/**
* never kNull
**/
Type m_Type;
/**
* if 0, the cache is disabled and all other values are zero
**/
size_t m_NumEntries;
/**
* NB: cache entries are lines, TLB entries are pages
**/
size_t m_EntrySize;
/**
* = fullyAssociative or the actual ways of m_Associativity
**/
size_t m_Associativity;
/**
* how many logical processors share this cache?
**/
size_t m_SharedBy;
void Initialize(size_t level, Type type)
{
m_Level = level;
m_Type = type;
m_NumEntries = 0;
m_EntrySize = 0;
m_Associativity = 0;
m_SharedBy = 0;
ENSURE(Validate());
}
bool Validate() const
{
if(!(1 <= m_Level && m_Level <= maxLevels))
return false;
if(m_Type == kNull)
return false;
if(m_NumEntries == 0) // disabled
{
if(m_EntrySize != 0)
return false;
if(m_Associativity != 0)
return false;
if(m_SharedBy != 0)
return false;
}
else
{
if(m_EntrySize == 0)
return false;
if(m_Associativity == 0 || m_Associativity > fullyAssociative)
return false;
if(m_SharedBy == 0)
return false;
}
return true;
}
u64 TotalSize() const
{
return u64(m_NumEntries)*m_EntrySize;
}
};
enum IdxCache
{
// (AddCache relies upon this order)
L1D = 1,
L2D,
L3D,
L4D,
L1I,
L2I,
L3I,
L4I,
TLB
};
/**
* @return 0 if idxCache >= TLB+numTLBs, otherwise a valid pointer to
* a Cache whose m_NumEntries is 0 if disabled / not present.
**/
LIB_API const Cache* Caches(size_t idxCache);
} // namespace x86_x64
#endif // #ifndef INCLUDED_X86_X64_CACHE
|
