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
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
|
/*
* Copyright (C) 2016 Apple Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. 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.
*
* THIS SOFTWARE IS PROVIDED BY APPLE INC. ``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 APPLE INC. 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 "config.h"
#include "AirCustom.h"
#if ENABLE(B3_JIT)
#include "AirInstInlines.h"
#include "B3CCallValue.h"
#include "B3ValueInlines.h"
namespace JSC { namespace B3 { namespace Air {
bool PatchCustom::isValidForm(Inst& inst)
{
if (inst.args.size() < 1)
return false;
if (!inst.args[0].isSpecial())
return false;
if (!inst.args[0].special()->isValid(inst))
return false;
RegisterSet clobberedEarly = inst.extraEarlyClobberedRegs();
RegisterSet clobberedLate = inst.extraClobberedRegs();
bool ok = true;
inst.forEachTmp(
[&] (Tmp& tmp, Arg::Role role, Arg::Type, Arg::Width) {
if (!tmp.isReg())
return;
if (Arg::isLateDef(role) || Arg::isLateUse(role))
ok &= !clobberedLate.get(tmp.reg());
else
ok &= !clobberedEarly.get(tmp.reg());
});
return ok;
}
bool CCallCustom::isValidForm(Inst& inst)
{
CCallValue* value = inst.origin->as<CCallValue>();
if (!value)
return false;
if (inst.args.size() != (value->type() == Void ? 0 : 1) + value->numChildren())
return false;
// The arguments can only refer to the stack, tmps, or immediates.
for (Arg& arg : inst.args) {
if (!arg.isTmp() && !arg.isStackMemory() && !arg.isSomeImm())
return false;
}
unsigned offset = 0;
if (!inst.args[0].isGP())
return false;
// If there is a result then it cannot be an immediate.
if (value->type() != Void) {
if (inst.args[1].isSomeImm())
return false;
if (!inst.args[1].canRepresent(value))
return false;
offset++;
}
for (unsigned i = value->numChildren(); i-- > 1;) {
Value* child = value->child(i);
Arg arg = inst.args[offset + i];
if (!arg.canRepresent(child))
return false;
}
return true;
}
CCallHelpers::Jump CCallCustom::generate(Inst& inst, CCallHelpers&, GenerationContext&)
{
dataLog("FATAL: Unlowered C call: ", inst, "\n");
UNREACHABLE_FOR_PLATFORM();
return CCallHelpers::Jump();
}
bool ShuffleCustom::isValidForm(Inst& inst)
{
if (inst.args.size() % 3)
return false;
// A destination may only appear once. This requirement allows us to avoid the undefined behavior
// of having a destination that is supposed to get multiple inputs simultaneously. It also
// imposes some interesting constraints on the "shape" of the shuffle. If we treat a shuffle pair
// as an edge and the Args as nodes, then the single-destination requirement means that the
// shuffle graph consists of two kinds of subgraphs:
//
// - Spanning trees. We call these shifts. They can be executed as a sequence of Move
// instructions and don't usually require scratch registers.
//
// - Closed loops. These loops consist of nodes that have one successor and one predecessor, so
// there is no way to "get into" the loop from outside of it. These can be executed using swaps
// or by saving one of the Args to a scratch register and executing it as a shift.
HashSet<Arg> dsts;
for (unsigned i = 0; i < inst.args.size(); ++i) {
Arg arg = inst.args[i];
unsigned mode = i % 3;
if (mode == 2) {
// It's the width.
if (!arg.isWidthArg())
return false;
continue;
}
// The source can be an immediate.
if (!mode) {
if (arg.isSomeImm())
continue;
if (!arg.isCompatibleType(inst.args[i + 1]))
return false;
} else {
ASSERT(mode == 1);
if (!dsts.add(arg).isNewEntry)
return false;
}
if (arg.isTmp() || arg.isMemory())
continue;
return false;
}
// No destination register may appear in any address expressions. The lowering can't handle it
// and it's not useful for the way we end up using Shuffles. Normally, Shuffles only used for
// stack addresses and non-stack registers.
for (Arg& arg : inst.args) {
if (!arg.isMemory())
continue;
bool ok = true;
arg.forEachTmpFast(
[&] (Tmp tmp) {
if (dsts.contains(tmp))
ok = false;
});
if (!ok)
return false;
}
return true;
}
CCallHelpers::Jump ShuffleCustom::generate(Inst& inst, CCallHelpers&, GenerationContext&)
{
dataLog("FATAL: Unlowered shuffle: ", inst, "\n");
UNREACHABLE_FOR_PLATFORM();
return CCallHelpers::Jump();
}
} } } // namespace JSC::B3::Air
#endif // ENABLE(B3_JIT)
|
