-
Notifications
You must be signed in to change notification settings - Fork 746
/
Copy pathJ9GCStackAtlas.cpp
109 lines (95 loc) · 4.19 KB
/
J9GCStackAtlas.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
/*******************************************************************************
* 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
*******************************************************************************/
#if defined(J9ZOS390)
#pragma csect(CODE,"TRJ9GCStackAtlas#C")
#pragma csect(STATIC,"TRJ9GCStackAtlas#S")
#pragma csect(TEST,"TRJ9GCStackAtlas#T")
#endif
#include "codegen/GCStackAtlas.hpp"
#include "codegen/GCStackMap.hpp"
#include "compile/Compilation.hpp"
#include "codegen/CodeGenerator.hpp"
void
J9::GCStackAtlas::close(TR::CodeGenerator *cg)
{
// Dump the atlas before merging. The atlas after merging is given by the
// dump of the external atlas
//
TR::Compilation *comp = cg->comp();
if (comp->getOption(TR_TraceCG))
{
comp->getDebug()->print(comp->getOutFile(), self());
}
TR_GCStackMap * parameterMap = 0;
if (self()->getInternalPointerMap())
{
parameterMap = self()->getParameterMap();
}
if (comp->getOption(TR_DisableMergeStackMaps))
return;
// Merge adjacent similar maps
//
uint8_t *start = cg->getCodeStart();
ListElement<TR_GCStackMap> *mapEntry, *next;
TR_GCStackMap *map, *nextMap;
for (mapEntry = self()->getStackMapList().getListHead(); mapEntry; mapEntry = next)
{
next = mapEntry->getNextElement();
map = mapEntry->getData();
// See if the next map can be merged with this one.
// If they have the same contents, the ranges are merged and a single map
// represents both ranges.
//
if (!next)
{
continue;
}
nextMap = next->getData();
int32_t mapBytes = map->getMapSizeInBytes();
// TODO: We should be using mapsAreIdentical API here instead. Also it seems there is a similar comment in OMR,
// i.e. "Maps are the same". Do we need a common API here for map merging which can be extended?
if (nextMap != parameterMap &&
mapBytes == nextMap->getMapSizeInBytes() &&
map->getRegisterMap() == nextMap->getRegisterMap() &&
!memcmp(map->getMapBits(), nextMap->getMapBits(), mapBytes) &&
(comp->getOption(TR_DisableLiveMonitorMetadata) ||
((map->getLiveMonitorBits() != 0) == (nextMap->getLiveMonitorBits() != 0) &&
(map->getLiveMonitorBits() == 0 ||
!memcmp(map->getLiveMonitorBits(), nextMap->getLiveMonitorBits(), mapBytes)))) &&
((!nextMap->getInternalPointerMap() && !map->getInternalPointerMap()) ||
(nextMap->getInternalPointerMap() && map->getInternalPointerMap() &&
map->isInternalPointerMapIdenticalTo(nextMap))) &&
map->isByteCodeInfoIdenticalTo(nextMap))
{
// Maps are the same - can merge
//
if (comp->getOption(TR_TraceCG))
traceMsg(comp,
"Map with code offset range starting at [%08x] is identical to the previous map [%08x], merging and eliminating previous\n",
nextMap->getLowestCodeOffset(), map->getLowestCodeOffset());
map->setLowestCodeOffset(nextMap->getLowestCodeOffset());
self()->getStackMapList().removeNext(mapEntry);
self()->decNumberOfMaps();
next = mapEntry;
}
}
}