-
Notifications
You must be signed in to change notification settings - Fork 751
/
Copy pathRuntimeAssumptionTable.hpp
140 lines (123 loc) · 6.21 KB
/
RuntimeAssumptionTable.hpp
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
/*******************************************************************************
* Copyright IBM Corp. and others 2000
*
* This program and the accompanying materials are made available under
* the terms of the Eclipse Public License 2.0 which accompanies this
* distribution and is available at https://www.eclipse.org/legal/epl-2.0/
* or the Apache License, Version 2.0 which accompanies this distribution and
* is available at https://www.apache.org/licenses/LICENSE-2.0.
*
* This Source Code may also be made available under the following
* Secondary Licenses when the conditions for such availability set
* forth in the Eclipse Public License, v. 2.0 are satisfied: GNU
* General Public License, version 2 with the GNU Classpath
* Exception [1] and GNU General Public License, version 2 with the
* OpenJDK Assembly Exception [2].
*
* [1] https://www.gnu.org/software/classpath/license.html
* [2] https://openjdk.org/legal/assembly-exception.html
*
* SPDX-License-Identifier: EPL-2.0 OR Apache-2.0 OR GPL-2.0-only WITH Classpath-exception-2.0 OR GPL-2.0-only WITH OpenJDK-assembly-exception-1.0
*******************************************************************************/
#ifndef RUNTIMEASSUMPTIONTABLE_HPP
#define RUNTIMEASSUMPTIONTABLE_HPP
#include <stddef.h>
#include <stdint.h>
#include "env/jittypes.h"
class TR_FrontEnd;
class TR_OpaqueClassBlock;
namespace OMR { class RuntimeAssumption; }
// Note !!!: routine findAssumptionHashTable() assumes that the types of
// of assumptions start at 0 and end up with LastAssumptionKind.
// No holes are allowed !
enum TR_RuntimeAssumptionKind
{
RuntimeAssumptionOnClassUnload = 0,
RuntimeAssumptionOnClassPreInitialize,
RuntimeAssumptionOnClassExtend,
RuntimeAssumptionOnMethodOverride,
RuntimeAssumptionOnRegisterNative,
RuntimeAssumptionOnClassRedefinitionPIC,
RuntimeAssumptionOnClassRedefinitionUPIC,
RuntimeAssumptionOnClassRedefinitionNOP,
RuntimeAssumptionOnStaticFinalFieldModification,
RuntimeAssumptionOnMutableCallSiteChange,
RuntimeAssumptionOnMethodBreakPoint,
LastAssumptionKind,
// If you add another kind, add its name to the runtimeAssumptionKindNames array
RuntimeAssumptionSentinel // This is special as there is no hashtable associated with it and we only create one of them
};
char const * const runtimeAssumptionKindNames[LastAssumptionKind] =
{
"ClassUnload",
"ClassPreInitialize",
"ClassExtend",
"MethodOverride",
"RegisterNative",
"ClassRedefinitionPIC",
"ClassRedefinitionUPIC",
"ClassRedefinitionNOP",
"StaticFinalFieldModification",
"MutableCallSiteChange",
"OnMethodBreakpoint",
};
struct TR_RatHT
{
OMR::RuntimeAssumption ** _htSpineArray;
uint32_t * _markedforDetachCount;
size_t _spineArraySize;
};
/// prime number
//#define ASSUMPTIONTABLE_SIZE 251
//#define CLASS_EXTEND_ASSUMPTIONTABLE_SIZE 1543 // other choices: 3079 6151
class TR_RuntimeAssumptionTable
{
public:
TR_RuntimeAssumptionTable() {} // constructor of TR_RuntimeAssumptionTable
bool init(); // Must call this during bootstrap on a single thread because it is not MT safe
static uintptr_t hashCode(uintptr_t key)
{return (key >> 2) * 2654435761u; } // 2654435761u is the golden ratio of 2^32
TR_RatHT* findAssumptionHashTable(TR_RuntimeAssumptionKind kind) { return (kind >= 0 && kind < LastAssumptionKind) ? _tables + kind : NULL; }
OMR::RuntimeAssumption **getBucketPtr(TR_RuntimeAssumptionKind kind, uintptr_t hashIndex);
OMR::RuntimeAssumption *getBucket(TR_RuntimeAssumptionKind kind, uintptr_t key)
{
return *getBucketPtr(kind, hashCode(key));
}
void purgeRATTable(TR_FrontEnd *fe);
void purgeRATArray(TR_FrontEnd *fe, OMR::RuntimeAssumption **array, uint32_t size);
void purgeAssumptionListHead(OMR::RuntimeAssumption *&assumptionList, TR_FrontEnd *fe);
void reclaimAssumptions(OMR::RuntimeAssumption **sentinel, void * metaData, bool reclaimPrePrologueAssumptions = false);
void reclaimAssumptions(void *reclaimedMetaData, bool reclaimPrePrologueAssumptions = false);
void notifyClassUnloadEvent(TR_FrontEnd *vm, bool isSMP,
TR_OpaqueClassBlock *classOwningAssumption,
TR_OpaqueClassBlock *picKey);
void notifyIllegalStaticFinalFieldModificationEvent(TR_FrontEnd *vm, void *key);
void notifyClassRedefinitionEvent(TR_FrontEnd *vm, bool isSMP, void *oldKey, void *newKey);
void notifyMutableCallSiteChangeEvent(TR_FrontEnd *vm, uintptr_t cookie);
void notifyMethodBreakpointed(TR_FrontEnd *fe, TR_OpaqueMethodBlock *method);
int32_t getAssumptionCount(int32_t tableId) const { return assumptionCount[tableId]; }
int32_t getReclaimedAssumptionCount(int32_t tableId) const { return reclaimedAssumptionCount[tableId]; }
void incReclaimedAssumptionCount(int32_t tableId) { reclaimedAssumptionCount[tableId]++; }
void markForDetachFromRAT(OMR::RuntimeAssumption *assumption);
void markAssumptionsAndDetach(void *reclaimedMetaData, bool reclaimPrePrologueAssumptions = false);
/**
* Walk the table removing entries that have been marked as detached.
*
* If a clean-up count is specified at most that number of entries will be
* removed from the table - this is used to rate limit clean-up activity
* and amortize the cost over time.
*/
void reclaimMarkedAssumptionsFromRAT(int32_t cleanupCount = -1);
int32_t countRatAssumptions();
private:
friend class OMR::RuntimeAssumption;
void addAssumption(OMR::RuntimeAssumption *a, TR_RuntimeAssumptionKind kind, TR_FrontEnd *fe, OMR::RuntimeAssumption **sentinel);
int32_t reclaimAssumptions(void *md, OMR::RuntimeAssumption **hashTable, OMR::RuntimeAssumption **possiblyRelevantHashTable);
// My table of hash tables; init() allocate memory and populate it
TR_RatHT _tables[LastAssumptionKind];
bool _detachPending[LastAssumptionKind]; // Marks tables that have assumptions waiting to be removed
uint32_t _marked; // Counts the number of assumptions waiting to be removed
int32_t assumptionCount[LastAssumptionKind]; // this never gets decremented
int32_t reclaimedAssumptionCount[LastAssumptionKind];
};
#endif // RUNTIMEASSUMPTIONTABLE_HPP