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
185
186
187
188
|
""" Code to feed information from the optimizer via the resume code into the
optimizer of the bridge attached to a guard. """
from rpython.jit.metainterp import resumecode
# adds the following sections at the end of the resume code:
#
# ---- known classes
# <bitfield> size is the number of reference boxes in the liveboxes
# 1 klass known
# 0 klass unknown
# (the class is found by actually looking at the runtime value)
# the bits are bunched in bunches of 7
#
# ---- heap knowledge
# <length>
# (<box1> <descr> <box2>) length times, if getfield(box1, descr) == box2
# both boxes should be in the liveboxes
# (or constants)
#
# <length>
# (<box1> <index> <descr> <box2>) length times, if getarrayitem_gc(box1, index, descr) == box2
# both boxes should be in the liveboxes
# (or constants)
#
# ---- call_loopinvariant knowledge
# <length>
# (<const> <box2>) length times, if call_loopinvariant(const) == box2
# box2 should be in liveboxes
# ----
# maybe should be delegated to the optimization classes?
def tag_box(box, liveboxes_from_env, memo):
from rpython.jit.metainterp.history import Const
if isinstance(box, Const):
return memo.getconst(box)
else:
return liveboxes_from_env[box] # has to exist
def decode_box(resumestorage, tagged, liveboxes, cpu):
from rpython.jit.metainterp.resume import untag, TAGCONST, TAGINT, TAGBOX
from rpython.jit.metainterp.resume import NULLREF, TAG_CONST_OFFSET, tagged_eq
from rpython.jit.metainterp.history import ConstInt
num, tag = untag(tagged)
# NB: the TAGVIRTUAL case can't happen here, because this code runs after
# virtuals are already forced again
if tag == TAGCONST:
if tagged_eq(tagged, NULLREF):
box = cpu.ts.CONST_NULL
else:
box = resumestorage.rd_consts[num - TAG_CONST_OFFSET]
elif tag == TAGINT:
box = ConstInt(num)
elif tag == TAGBOX:
box = liveboxes[num]
else:
raise AssertionError("unreachable")
return box
def serialize_optimizer_knowledge(optimizer, numb_state, liveboxes, liveboxes_from_env, memo):
from rpython.jit.metainterp.history import ConstInt
available_boxes = {}
for box in liveboxes:
if box is not None and box in liveboxes_from_env:
available_boxes[box] = None
# class knowledge is stored as bits, true meaning the class is known, false
# means unknown. on deserializing we look at the bits, and read the runtime
# class for the known classes (which has to be the same in the bridge) and
# mark that as known. this works for guard_class too: the class is only
# known *after* the guard
bitfield = 0
shifts = 0
for box in liveboxes:
if box is None or box.type != "r":
continue
info = optimizer.getptrinfo(box)
known_class = info is not None and info.get_known_class(optimizer.cpu) is not None
bitfield <<= 1
bitfield |= known_class
shifts += 1
if shifts == 6:
numb_state.append_int(bitfield)
bitfield = shifts = 0
if shifts:
numb_state.append_int(bitfield << (6 - shifts))
# heap knowledge: we store triples of known heap fields in non-virtual
# structs
if optimizer.optheap:
triples_struct, triples_array = optimizer.optheap.serialize_optheap(available_boxes)
# can only encode descrs that have a known index into
# metainterp_sd.all_descrs
triples_struct = [triple for triple in triples_struct if triple[1].descr_index != -1]
numb_state.append_int(len(triples_struct))
for box1, descr, box2 in triples_struct:
descr_index = descr.descr_index
numb_state.append_short(tag_box(box1, liveboxes_from_env, memo))
numb_state.append_int(descr_index)
numb_state.append_short(tag_box(box2, liveboxes_from_env, memo))
numb_state.append_int(len(triples_array))
for box1, index, descr, box2 in triples_array:
descr_index = descr.descr_index
numb_state.append_short(tag_box(box1, liveboxes_from_env, memo))
numb_state.append_int(index)
numb_state.append_int(descr_index)
numb_state.append_short(tag_box(box2, liveboxes_from_env, memo))
else:
numb_state.append_int(0)
numb_state.append_int(0)
if optimizer.optrewrite:
tuples_loopinvariant = optimizer.optrewrite.serialize_optrewrite(
available_boxes)
numb_state.append_int(len(tuples_loopinvariant))
for constarg0, box in tuples_loopinvariant:
numb_state.append_short(
tag_box(ConstInt(constarg0), liveboxes_from_env, memo))
numb_state.append_short(tag_box(box, liveboxes_from_env, memo))
else:
numb_state.append_int(0)
def deserialize_optimizer_knowledge(optimizer, resumestorage, frontend_boxes, liveboxes):
from rpython.jit.metainterp.history import ConstInt
reader = resumecode.Reader(resumestorage.rd_numb)
assert len(frontend_boxes) == len(liveboxes)
metainterp_sd = optimizer.metainterp_sd
# skip resume section
startcount = reader.next_item()
reader.jump(startcount - 1)
# class knowledge
bitfield = 0
mask = 0
for i, box in enumerate(liveboxes):
if box.type != "r":
continue
if not mask:
bitfield = reader.next_item()
mask = 0b100000
class_known = bitfield & mask
mask >>= 1
if class_known:
cls = optimizer.cpu.ts.cls_of_box(frontend_boxes[i])
optimizer.make_constant_class(box, cls)
# heap knowledge
length = reader.next_item()
result_struct = []
for i in range(length):
tagged = reader.next_item()
box1 = decode_box(resumestorage, tagged, liveboxes, metainterp_sd.cpu)
descr_index = reader.next_item()
descr = metainterp_sd.all_descrs[descr_index]
tagged = reader.next_item()
box2 = decode_box(resumestorage, tagged, liveboxes, metainterp_sd.cpu)
result_struct.append((box1, descr, box2))
length = reader.next_item()
result_array = []
for i in range(length):
tagged = reader.next_item()
box1 = decode_box(resumestorage, tagged, liveboxes, metainterp_sd.cpu)
index = reader.next_item()
descr_index = reader.next_item()
descr = metainterp_sd.all_descrs[descr_index]
tagged = reader.next_item()
box2 = decode_box(resumestorage, tagged, liveboxes, metainterp_sd.cpu)
result_array.append((box1, index, descr, box2))
if optimizer.optheap:
optimizer.optheap.deserialize_optheap(result_struct, result_array)
# call_loopinvariant knowledge
length = reader.next_item()
result_loopinvariant = []
for i in range(length):
tagged1 = reader.next_item()
const = decode_box(resumestorage, tagged1, liveboxes, metainterp_sd.cpu)
assert isinstance(const, ConstInt)
i = const.getint()
tagged2 = reader.next_item()
box = decode_box(resumestorage, tagged2, liveboxes, metainterp_sd.cpu)
result_loopinvariant.append((i, box))
if optimizer.optrewrite:
optimizer.optrewrite.deserialize_optrewrite(result_loopinvariant)
|
