-
Notifications
You must be signed in to change notification settings - Fork 392
/
OMRTreeTop_inlines.hpp
153 lines (131 loc) · 4.35 KB
/
OMRTreeTop_inlines.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
141
142
143
144
145
146
147
148
149
150
151
152
153
/*******************************************************************************
* Copyright (c) 2000, 2021 IBM Corp. and others
*
* 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 http://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] http://openjdk.java.net/legal/assembly-exception.html
*
* SPDX-License-Identifier: EPL-2.0 OR Apache-2.0 OR GPL-2.0 WITH Classpath-exception-2.0 OR LicenseRef-GPL-2.0 WITH Assembly-exception
*******************************************************************************/
#ifndef OMR_TREETOP_INLINES_INCL
#define OMR_TREETOP_INLINES_INCL
#include "il/ILOps.hpp"
#include "il/Node.hpp"
#include "il/TreeTop.hpp"
#include "infra/Assert.hpp"
namespace TR { class Block; }
/*
* Performance sensitive implementations are included here to
* support inlining.
*
* This file will be included by OMRTreeTop.cpp
*/
inline TR::TreeTop *
OMR::TreeTop::self()
{ return static_cast<TR::TreeTop*>(this); }
inline TR::TreeTop *
OMR::TreeTop::getNextTreeTop()
{ return _pNext; }
inline TR::TreeTop *
OMR::TreeTop::setNextTreeTop(TR::TreeTop *p)
{ return (_pNext = p); }
inline TR::TreeTop *
OMR::TreeTop::getPrevTreeTop()
{ return _pPrev; }
inline TR::TreeTop *
OMR::TreeTop::setPrevTreeTop(TR::TreeTop *p)
{ return (_pPrev = p); }
inline TR::Node *
OMR::TreeTop::getNode()
{ return _pNode; }
inline TR::Node *
OMR::TreeTop::setNode(TR::Node *p)
{ return (_pNode = p); }
inline void
OMR::TreeTop::unlink(bool decRefCountRecursively)
{
TR::TreeTop *prevTT = self()->getPrevTreeTop();
TR::TreeTop *nextTT = self()->getNextTreeTop();
prevTT->setNextTreeTop(nextTT);
nextTT->setPrevTreeTop(prevTT);
if (decRefCountRecursively)
self()->getNode()->recursivelyDecReferenceCount();
}
inline void
OMR::TreeTop::join(TR::TreeTop * p)
{
self()->setNextTreeTop(p);
if (p)
p->setPrevTreeTop(self());
}
inline TR::TreeTop *
OMR::TreeTop::insertAfter(TR::TreeTop *tt)
{
tt->join(self()->getNextTreeTop());
self()->join(tt);
return tt;
}
inline TR::TreeTop *
OMR::TreeTop::insertBefore(TR::TreeTop *tt)
{
self()->getPrevTreeTop()->join(tt);
tt->join(self());
return tt;
}
inline void
OMR::TreeTop::insertNewTreeTop(TR::TreeTop *beforeNewTreeTop, TR::TreeTop * afterNewTreeTop)
{
TR_ASSERT(beforeNewTreeTop->getNextTreeTop() == afterNewTreeTop && afterNewTreeTop->getPrevTreeTop() == beforeNewTreeTop, "beforeNewTreeTop and afterNewTreeTop must be consecutive");
beforeNewTreeTop->join(self());
self()->join(afterNewTreeTop);
}
inline TR::TreeTop *
OMR::TreeTop::getNextRealTreeTop()
{
TR::TreeTop *treeTop;
for (treeTop = self()->getNextTreeTop();
treeTop && treeTop->getNode() && treeTop->getNode()->getOpCode().isExceptionRangeFence();
treeTop = treeTop->getNextTreeTop())
{}
return treeTop;
}
inline TR::TreeTop *
OMR::TreeTop::getPrevRealTreeTop()
{
TR::TreeTop *treeTop;
for (treeTop = self()->getPrevTreeTop();
treeTop && treeTop->getNode()->getOpCode().isExceptionRangeFence();
treeTop = treeTop->getPrevTreeTop())
{}
return treeTop;
}
inline TR::Block *
OMR::TreeTop::getEnclosingBlock( bool forward)
{
TR::TreeTop * tt = self();
if (forward)
while (tt->getNode()->getOpCodeValue() != TR::BBEnd)
{
tt = tt->getNextTreeTop();
//TR_ASSERT(tt && tt->getNode(), "either tt or node on a tt null here, we will segfault");
}
else
while (tt->getNode()->getOpCodeValue() != TR::BBStart)
{
tt = tt->getPrevTreeTop();
//TR_ASSERT(tt && tt->getNode(), "either tt or node on a tt null here, we will segfault");
}
return tt->getNode()->getBlock();
}
#endif