blob: 61acf834ce7c5e82dd6204fb3035f4941622121a (
plain)
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
|
/* -*- Mode: C++; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*-
* vim: set ts=8 sts=4 et sw=4 tw=99:
*/
/* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/. */
#include "jit/RegisterSets.h"
#include "jsapi-tests/tests.h"
using namespace js;
using namespace js::jit;
static bool
CoPrime(size_t a, size_t b)
{
if (b <= 1)
return a == 1 || b == 1;
return CoPrime(b, a % b);
}
// This macros are use to iterave over all registers in a large number of
// non-looping sequences, which does not rely on the getFirst / getLast
// functions.
#define BEGIN_INDEX_WALK(RegTotal) \
static const size_t Total = RegTotal; \
for (size_t walk = 1; walk < RegTotal; walk += 2) { \
if (!CoPrime(RegTotal, walk)) \
continue; \
for (size_t start = 0; start < RegTotal; start++) { \
size_t index = start;
#define END_INDEX_WALK \
} \
}
#define FOR_ALL_REGISTERS(Register, reg) \
do { \
Register reg = Register::FromCode(index);
#define END_FOR_ALL_REGISTERS \
index = (index + walk) % Total; \
} while(index != start)
BEGIN_TEST(testJitRegisterSet_GPR)
{
BEGIN_INDEX_WALK(Registers::Total)
LiveGeneralRegisterSet liveRegs;
AllocatableGeneralRegisterSet pool(GeneralRegisterSet::All());
CHECK(liveRegs.empty());
CHECK(pool.set() == GeneralRegisterSet::All());
FOR_ALL_REGISTERS(Register, reg) {
CHECK(!pool.has(reg) || !liveRegs.has(reg));
if (pool.has(reg)) {
CHECK(!liveRegs.has(reg));
pool.take(reg);
liveRegs.add(reg);
CHECK(liveRegs.has(reg));
CHECK(!pool.has(reg));
}
CHECK(!pool.has(reg) || !liveRegs.has(reg));
} END_FOR_ALL_REGISTERS;
CHECK(pool.empty());
FOR_ALL_REGISTERS(Register, reg) {
CHECK(!pool.has(reg) || !liveRegs.has(reg));
if (liveRegs.has(reg)) {
CHECK(!pool.has(reg));
liveRegs.take(reg);
pool.add(reg);
CHECK(pool.has(reg));
CHECK(!liveRegs.has(reg));
}
CHECK(!pool.has(reg) || !liveRegs.has(reg));
} END_FOR_ALL_REGISTERS;
CHECK(liveRegs.empty());
CHECK(pool.set() == GeneralRegisterSet::All());
END_INDEX_WALK
return true;
}
END_TEST(testJitRegisterSet_GPR)
BEGIN_TEST(testJitRegisterSet_FPU)
{
BEGIN_INDEX_WALK(FloatRegisters::Total)
LiveFloatRegisterSet liveRegs;
AllocatableFloatRegisterSet pool(FloatRegisterSet::All());
CHECK(liveRegs.empty());
CHECK(pool.set() == FloatRegisterSet::All());
FOR_ALL_REGISTERS(FloatRegister, reg) {
CHECK(!pool.has(reg) || !liveRegs.has(reg));
if (pool.has(reg)) {
CHECK(!liveRegs.has(reg));
pool.take(reg);
liveRegs.add(reg);
CHECK(liveRegs.has(reg));
CHECK(!pool.has(reg));
}
CHECK(!pool.has(reg) || !liveRegs.has(reg));
} END_FOR_ALL_REGISTERS;
CHECK(pool.empty());
FOR_ALL_REGISTERS(FloatRegister, reg) {
CHECK(!pool.has(reg) || !liveRegs.has(reg));
if (liveRegs.has(reg)) {
CHECK(!pool.has(reg));
liveRegs.take(reg);
pool.add(reg);
CHECK(pool.has(reg));
CHECK(!liveRegs.has(reg));
}
CHECK(!pool.has(reg) || !liveRegs.has(reg));
} END_FOR_ALL_REGISTERS;
CHECK(liveRegs.empty());
CHECK(pool.set() == FloatRegisterSet::All());
END_INDEX_WALK
return true;
}
END_TEST(testJitRegisterSet_FPU)
|
