Lines Matching refs:range
192 // First we collect Ranges. If operations within the range have enough redundancy,
193 // we hoist. And then we remove additions and checks that fall within the max range.
203 Range& range = m_map[data.m_key];
205 dataLog(" Range: ", range, "\n");
206 if (range.m_count) {
207 if (data.m_addend > range.m_maxBound) {
208 range.m_maxBound = data.m_addend;
209 range.m_maxOrigin = node->origin.semantic;
210 } else if (data.m_addend < range.m_minBound) {
211 range.m_minBound = data.m_addend;
212 range.m_minOrigin = node->origin.semantic;
215 range.m_maxBound = data.m_addend;
216 range.m_minBound = data.m_addend;
217 range.m_minOrigin = node->origin.semantic;
218 range.m_maxOrigin = node->origin.semantic;
220 range.m_count++;
222 dataLog(" New range: ", range, "\n");
230 Range range = m_map[data.m_key];
231 if (!isValid(data.m_key, range))
235 if (!range.m_hoisted) {
238 if (range.m_minBound < 0) {
240 nodeIndex, NodeOrigin(range.m_minOrigin, node->origin.forExit),
241 data.m_key.m_source, range.m_minBound);
243 if (range.m_maxBound > 0) {
245 nodeIndex, NodeOrigin(range.m_maxOrigin, node->origin.forExit),
246 data.m_key.m_source, range.m_maxBound);
258 nodeIndex, range.m_maxOrigin, jsNumber(range.m_maxBound));
261 nodeIndex, NodeOrigin(range.m_minOrigin, node->origin.forExit),
262 data.m_key.m_source, range.m_minBound, Arith::Unchecked);
264 nodeIndex, NodeOrigin(range.m_maxOrigin, node->origin.forExit),
265 data.m_key.m_source, range.m_maxBound, Arith::Unchecked);
352 bool isValid(const RangeKey& key, const Range& range)
354 if (range.m_count < 2)
359 return (range.m_maxBound - range.m_minBound) >= 0;