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
|
/*
* Copyright (C) 2016-2017 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 "AirLowerMacros.h"
#if ENABLE(B3_JIT)
#include "AirCCallingConvention.h"
#include "AirCode.h"
#include "AirEmitShuffle.h"
#include "AirInsertionSet.h"
#include "AirInstInlines.h"
#include "AirPhaseScope.h"
#include "B3CCallValue.h"
#include "B3ValueInlines.h"
namespace JSC { namespace B3 { namespace Air {
void lowerMacros(Code& code)
{
PhaseScope phaseScope(code, "Air::lowerMacros");
InsertionSet insertionSet(code);
for (BasicBlock* block : code) {
for (unsigned instIndex = 0; instIndex < block->size(); ++instIndex) {
Inst& inst = block->at(instIndex);
auto handleCall = [&] () {
CCallValue* value = inst.origin->as<CCallValue>();
Kind oldKind = inst.kind;
Vector<Arg> destinations = computeCCallingConvention(code, value);
unsigned offset = value->type() == Void ? 0 : 1;
Vector<ShufflePair, 16> shufflePairs;
bool hasRegisterSource = false;
for (unsigned i = 1; i < destinations.size(); ++i) {
Value* child = value->child(i);
ShufflePair pair(inst.args[offset + i], destinations[i], widthForType(child->type()));
shufflePairs.append(pair);
hasRegisterSource |= pair.src().isReg();
}
if (UNLIKELY(hasRegisterSource))
insertionSet.insertInst(instIndex, createShuffle(inst.origin, Vector<ShufflePair>(shufflePairs)));
else {
// If none of the inputs are registers, then we can efficiently lower this
// shuffle before register allocation. First we lower all of the moves to
// memory, in the hopes that this is the last use of the operands. This
// avoids creating interference between argument registers and arguments
// that don't go into argument registers.
for (ShufflePair& pair : shufflePairs) {
if (pair.dst().isMemory())
insertionSet.insertInsts(instIndex, pair.insts(code, inst.origin));
}
// Fill the argument registers by starting with the first one. This avoids
// creating interference between things passed to low-numbered argument
// registers and high-numbered argument registers. The assumption here is
// that lower-numbered argument registers are more likely to be
// incidentally clobbered.
for (ShufflePair& pair : shufflePairs) {
if (!pair.dst().isMemory())
insertionSet.insertInsts(instIndex, pair.insts(code, inst.origin));
}
}
// Indicate that we're using our original callee argument.
destinations[0] = inst.args[0];
// Save where the original instruction put its result.
Arg resultDst = value->type() == Void ? Arg() : inst.args[1];
inst = buildCCall(code, inst.origin, destinations);
if (oldKind.effects)
inst.kind.effects = true;
Tmp result = cCallResult(value->type());
switch (value->type()) {
case Void:
break;
case Float:
insertionSet.insert(instIndex + 1, MoveFloat, value, result, resultDst);
break;
case Double:
insertionSet.insert(instIndex + 1, MoveDouble, value, result, resultDst);
break;
case Int32:
insertionSet.insert(instIndex + 1, Move32, value, result, resultDst);
break;
case Int64:
insertionSet.insert(instIndex + 1, Move, value, result, resultDst);
break;
}
};
switch (inst.kind.opcode) {
case ColdCCall:
if (code.optLevel() < 2)
handleCall();
break;
case CCall:
handleCall();
break;
default:
break;
}
}
insertionSet.execute(block);
}
}
} } } // namespace JSC::B3::Air
#endif // ENABLE(B3_JIT)
|
