[DFG][FTL] Support MapSet / SetAdd intrinsics
[WebKit-https.git] / Source / JavaScriptCore / dfg / DFGFixupPhase.cpp
1 /*
2  * Copyright (C) 2012-2017 Apple Inc. All rights reserved.
3  *
4  * Redistribution and use in source and binary forms, with or without
5  * modification, are permitted provided that the following conditions
6  * are met:
7  * 1. Redistributions of source code must retain the above copyright
8  *    notice, this list of conditions and the following disclaimer.
9  * 2. Redistributions in binary form must reproduce the above copyright
10  *    notice, this list of conditions and the following disclaimer in the
11  *    documentation and/or other materials provided with the distribution.
12  *
13  * THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY
14  * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
15  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
16  * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL APPLE INC. OR
17  * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
18  * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
19  * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
20  * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
21  * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
22  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
23  * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 
24  */
25
26 #include "config.h"
27 #include "DFGFixupPhase.h"
28
29 #if ENABLE(DFG_JIT)
30
31 #include "ArrayPrototype.h"
32 #include "DFGGraph.h"
33 #include "DFGInferredTypeCheck.h"
34 #include "DFGInsertionSet.h"
35 #include "DFGPhase.h"
36 #include "DFGPredictionPropagationPhase.h"
37 #include "DFGVariableAccessDataDump.h"
38 #include "JSCInlines.h"
39 #include "TypeLocation.h"
40
41 namespace JSC { namespace DFG {
42
43 class FixupPhase : public Phase {
44 public:
45     FixupPhase(Graph& graph)
46         : Phase(graph, "fixup")
47         , m_insertionSet(graph)
48     {
49     }
50     
51     bool run()
52     {
53         ASSERT(m_graph.m_fixpointState == BeforeFixpoint);
54         ASSERT(m_graph.m_form == ThreadedCPS);
55         
56         m_profitabilityChanged = false;
57         for (BlockIndex blockIndex = 0; blockIndex < m_graph.numBlocks(); ++blockIndex)
58             fixupBlock(m_graph.block(blockIndex));
59         
60         while (m_profitabilityChanged) {
61             m_profitabilityChanged = false;
62             
63             for (unsigned i = m_graph.m_argumentPositions.size(); i--;)
64                 m_graph.m_argumentPositions[i].mergeArgumentUnboxingAwareness();
65             
66             for (BlockIndex blockIndex = 0; blockIndex < m_graph.numBlocks(); ++blockIndex)
67                 fixupGetAndSetLocalsInBlock(m_graph.block(blockIndex));
68         }
69         
70         for (BlockIndex blockIndex = 0; blockIndex < m_graph.numBlocks(); ++blockIndex)
71             fixupChecksInBlock(m_graph.block(blockIndex));
72
73         m_graph.m_planStage = PlanStage::AfterFixup;
74
75         return true;
76     }
77
78 private:
79     void fixupBlock(BasicBlock* block)
80     {
81         if (!block)
82             return;
83         ASSERT(block->isReachable);
84         m_block = block;
85         for (m_indexInBlock = 0; m_indexInBlock < block->size(); ++m_indexInBlock) {
86             m_currentNode = block->at(m_indexInBlock);
87             fixupNode(m_currentNode);
88         }
89         m_insertionSet.execute(block);
90     }
91     
92     void fixupNode(Node* node)
93     {
94         NodeType op = node->op();
95
96         switch (op) {
97         case SetLocal: {
98             // This gets handled by fixupGetAndSetLocalsInBlock().
99             return;
100         }
101             
102         case BitAnd:
103         case BitOr:
104         case BitXor:
105         case BitRShift:
106         case BitLShift:
107         case BitURShift: {
108             if (Node::shouldSpeculateUntypedForBitOps(node->child1().node(), node->child2().node())) {
109                 fixEdge<UntypedUse>(node->child1());
110                 fixEdge<UntypedUse>(node->child2());
111                 break;
112             }
113             fixIntConvertingEdge(node->child1());
114             fixIntConvertingEdge(node->child2());
115             break;
116         }
117
118         case ArithIMul: {
119             fixIntConvertingEdge(node->child1());
120             fixIntConvertingEdge(node->child2());
121             node->setOp(ArithMul);
122             node->setArithMode(Arith::Unchecked);
123             node->child1().setUseKind(Int32Use);
124             node->child2().setUseKind(Int32Use);
125             break;
126         }
127
128         case ArithClz32: {
129             if (node->child1()->shouldSpeculateNotCell()) {
130                 fixIntConvertingEdge(node->child1());
131                 node->clearFlags(NodeMustGenerate);
132             } else
133                 fixEdge<UntypedUse>(node->child1());
134             break;
135         }
136             
137         case UInt32ToNumber: {
138             fixIntConvertingEdge(node->child1());
139             if (bytecodeCanTruncateInteger(node->arithNodeFlags()))
140                 node->convertToIdentity();
141             else if (node->canSpeculateInt32(FixupPass))
142                 node->setArithMode(Arith::CheckOverflow);
143             else {
144                 node->setArithMode(Arith::DoOverflow);
145                 node->setResult(enableInt52() ? NodeResultInt52 : NodeResultDouble);
146             }
147             break;
148         }
149             
150         case ValueAdd: {
151             if (attemptToMakeIntegerAdd(node)) {
152                 node->setOp(ArithAdd);
153                 break;
154             }
155             if (Node::shouldSpeculateNumberOrBooleanExpectingDefined(node->child1().node(), node->child2().node())) {
156                 fixDoubleOrBooleanEdge(node->child1());
157                 fixDoubleOrBooleanEdge(node->child2());
158                 node->setOp(ArithAdd);
159                 node->setResult(NodeResultDouble);
160                 break;
161             }
162             
163             if (attemptToMakeFastStringAdd(node))
164                 break;
165
166             Edge& child1 = node->child1();
167             Edge& child2 = node->child2();
168             if (child1->shouldSpeculateString() || child2->shouldSpeculateString()) {
169                 if (child1->shouldSpeculateInt32() || child2->shouldSpeculateInt32()) {
170                     auto convertString = [&](Node* node, Edge& edge) {
171                         if (edge->shouldSpeculateInt32())
172                             convertStringAddUse<Int32Use>(node, edge);
173                         else {
174                             ASSERT(edge->shouldSpeculateString());
175                             convertStringAddUse<StringUse>(node, edge);
176                         }
177                     };
178                     convertString(node, child1);
179                     convertString(node, child2);
180                     convertToMakeRope(node);
181                     break;
182                 }
183             }
184
185             fixEdge<UntypedUse>(child1);
186             fixEdge<UntypedUse>(child2);
187             node->setResult(NodeResultJS);
188             break;
189         }
190
191         case StrCat: {
192             if (attemptToMakeFastStringAdd(node))
193                 break;
194
195             // FIXME: Remove empty string arguments and possibly turn this into a ToString operation. That
196             // would require a form of ToString that takes a KnownPrimitiveUse. This is necessary because
197             // the implementation of StrCat doesn't dynamically optimize for empty strings.
198             // https://bugs.webkit.org/show_bug.cgi?id=148540
199             m_graph.doToChildren(
200                 node,
201                 [&] (Edge& edge) {
202                     fixEdge<KnownPrimitiveUse>(edge);
203                     // StrCat automatically coerces the values into strings before concatenating them.
204                     // The ECMA spec says that we're not allowed to automatically coerce a Symbol into
205                     // a string. If a Symbol is encountered, a TypeError will be thrown. As a result,
206                     // our runtime functions for this slow path expect that they will never be passed
207                     // Symbols.
208                     m_insertionSet.insertNode(
209                         m_indexInBlock, SpecNone, Check, node->origin,
210                         Edge(edge.node(), NotSymbolUse));
211                 });
212             break;
213         }
214             
215         case MakeRope: {
216             fixupMakeRope(node);
217             break;
218         }
219             
220         case ArithAdd:
221         case ArithSub: {
222             if (op == ArithSub
223                 && Node::shouldSpeculateUntypedForArithmetic(node->child1().node(), node->child2().node())) {
224                 fixEdge<UntypedUse>(node->child1());
225                 fixEdge<UntypedUse>(node->child2());
226                 node->setResult(NodeResultJS);
227                 break;
228             }
229             if (attemptToMakeIntegerAdd(node))
230                 break;
231             fixDoubleOrBooleanEdge(node->child1());
232             fixDoubleOrBooleanEdge(node->child2());
233             node->setResult(NodeResultDouble);
234             break;
235         }
236             
237         case ArithNegate: {
238             if (node->child1()->shouldSpeculateInt32OrBoolean() && node->canSpeculateInt32(FixupPass)) {
239                 fixIntOrBooleanEdge(node->child1());
240                 if (bytecodeCanTruncateInteger(node->arithNodeFlags()))
241                     node->setArithMode(Arith::Unchecked);
242                 else if (bytecodeCanIgnoreNegativeZero(node->arithNodeFlags()))
243                     node->setArithMode(Arith::CheckOverflow);
244                 else
245                     node->setArithMode(Arith::CheckOverflowAndNegativeZero);
246                 node->setResult(NodeResultInt32);
247                 node->clearFlags(NodeMustGenerate);
248                 break;
249             }
250             if (m_graph.unaryArithShouldSpeculateAnyInt(node, FixupPass)) {
251                 fixEdge<Int52RepUse>(node->child1());
252                 if (bytecodeCanIgnoreNegativeZero(node->arithNodeFlags()))
253                     node->setArithMode(Arith::CheckOverflow);
254                 else
255                     node->setArithMode(Arith::CheckOverflowAndNegativeZero);
256                 node->setResult(NodeResultInt52);
257                 node->clearFlags(NodeMustGenerate);
258                 break;
259             }
260             if (node->child1()->shouldSpeculateNotCell()) {
261                 fixDoubleOrBooleanEdge(node->child1());
262                 node->setResult(NodeResultDouble);
263                 node->clearFlags(NodeMustGenerate);
264             } else
265                 fixEdge<UntypedUse>(node->child1());
266             break;
267         }
268             
269         case ArithMul: {
270             Edge& leftChild = node->child1();
271             Edge& rightChild = node->child2();
272             if (Node::shouldSpeculateUntypedForArithmetic(leftChild.node(), rightChild.node())) {
273                 fixEdge<UntypedUse>(leftChild);
274                 fixEdge<UntypedUse>(rightChild);
275                 node->setResult(NodeResultJS);
276                 break;
277             }
278             if (m_graph.binaryArithShouldSpeculateInt32(node, FixupPass)) {
279                 fixIntOrBooleanEdge(leftChild);
280                 fixIntOrBooleanEdge(rightChild);
281                 if (bytecodeCanTruncateInteger(node->arithNodeFlags()))
282                     node->setArithMode(Arith::Unchecked);
283                 else if (bytecodeCanIgnoreNegativeZero(node->arithNodeFlags())
284                     || leftChild.node() == rightChild.node())
285                     node->setArithMode(Arith::CheckOverflow);
286                 else
287                     node->setArithMode(Arith::CheckOverflowAndNegativeZero);
288                 break;
289             }
290             if (m_graph.binaryArithShouldSpeculateAnyInt(node, FixupPass)) {
291                 fixEdge<Int52RepUse>(leftChild);
292                 fixEdge<Int52RepUse>(rightChild);
293                 if (bytecodeCanIgnoreNegativeZero(node->arithNodeFlags())
294                     || leftChild.node() == rightChild.node())
295                     node->setArithMode(Arith::CheckOverflow);
296                 else
297                     node->setArithMode(Arith::CheckOverflowAndNegativeZero);
298                 node->setResult(NodeResultInt52);
299                 break;
300             }
301             fixDoubleOrBooleanEdge(leftChild);
302             fixDoubleOrBooleanEdge(rightChild);
303             node->setResult(NodeResultDouble);
304             break;
305         }
306
307         case ArithDiv:
308         case ArithMod: {
309             Edge& leftChild = node->child1();
310             Edge& rightChild = node->child2();
311             if (op == ArithDiv
312                 && Node::shouldSpeculateUntypedForArithmetic(leftChild.node(), rightChild.node())
313                 && m_graph.hasExitSite(node->origin.semantic, BadType)) {
314                 fixEdge<UntypedUse>(leftChild);
315                 fixEdge<UntypedUse>(rightChild);
316                 node->setResult(NodeResultJS);
317                 break;
318             }
319             if (m_graph.binaryArithShouldSpeculateInt32(node, FixupPass)) {
320                 if (optimizeForX86() || optimizeForARM64() || optimizeForARMv7IDIVSupported()) {
321                     fixIntOrBooleanEdge(leftChild);
322                     fixIntOrBooleanEdge(rightChild);
323                     if (bytecodeCanTruncateInteger(node->arithNodeFlags()))
324                         node->setArithMode(Arith::Unchecked);
325                     else if (bytecodeCanIgnoreNegativeZero(node->arithNodeFlags()))
326                         node->setArithMode(Arith::CheckOverflow);
327                     else
328                         node->setArithMode(Arith::CheckOverflowAndNegativeZero);
329                     break;
330                 }
331                 
332                 // This will cause conversion nodes to be inserted later.
333                 fixDoubleOrBooleanEdge(leftChild);
334                 fixDoubleOrBooleanEdge(rightChild);
335                 
336                 // We don't need to do ref'ing on the children because we're stealing them from
337                 // the original division.
338                 Node* newDivision = m_insertionSet.insertNode(
339                     m_indexInBlock, SpecBytecodeDouble, *node);
340                 newDivision->setResult(NodeResultDouble);
341                 
342                 node->setOp(DoubleAsInt32);
343                 node->children.initialize(Edge(newDivision, DoubleRepUse), Edge(), Edge());
344                 if (bytecodeCanIgnoreNegativeZero(node->arithNodeFlags()))
345                     node->setArithMode(Arith::CheckOverflow);
346                 else
347                     node->setArithMode(Arith::CheckOverflowAndNegativeZero);
348                 break;
349             }
350             fixDoubleOrBooleanEdge(leftChild);
351             fixDoubleOrBooleanEdge(rightChild);
352             node->setResult(NodeResultDouble);
353             break;
354         }
355             
356         case ArithMin:
357         case ArithMax: {
358             if (m_graph.binaryArithShouldSpeculateInt32(node, FixupPass)) {
359                 fixIntOrBooleanEdge(node->child1());
360                 fixIntOrBooleanEdge(node->child2());
361                 break;
362             }
363             fixDoubleOrBooleanEdge(node->child1());
364             fixDoubleOrBooleanEdge(node->child2());
365             node->setResult(NodeResultDouble);
366             break;
367         }
368             
369         case ArithAbs: {
370             if (node->child1()->shouldSpeculateInt32OrBoolean()
371                 && node->canSpeculateInt32(FixupPass)) {
372                 fixIntOrBooleanEdge(node->child1());
373                 if (bytecodeCanTruncateInteger(node->arithNodeFlags()))
374                     node->setArithMode(Arith::Unchecked);
375                 else
376                     node->setArithMode(Arith::CheckOverflow);
377                 node->clearFlags(NodeMustGenerate);
378                 node->setResult(NodeResultInt32);
379                 break;
380             }
381
382             if (node->child1()->shouldSpeculateNotCell()) {
383                 fixDoubleOrBooleanEdge(node->child1());
384                 node->clearFlags(NodeMustGenerate);
385             } else
386                 fixEdge<UntypedUse>(node->child1());
387             node->setResult(NodeResultDouble);
388             break;
389         }
390
391         case ArithPow: {
392             if (node->child2()->shouldSpeculateInt32OrBooleanForArithmetic()) {
393                 fixDoubleOrBooleanEdge(node->child1());
394                 fixIntOrBooleanEdge(node->child2());
395                 break;
396             }
397
398             fixDoubleOrBooleanEdge(node->child1());
399             fixDoubleOrBooleanEdge(node->child2());
400             break;
401         }
402
403         case ArithRandom: {
404             node->setResult(NodeResultDouble);
405             break;
406         }
407
408         case ArithRound:
409         case ArithFloor:
410         case ArithCeil:
411         case ArithTrunc: {
412             if (node->child1()->shouldSpeculateInt32OrBoolean() && m_graph.roundShouldSpeculateInt32(node, FixupPass)) {
413                 fixIntOrBooleanEdge(node->child1());
414                 insertCheck<Int32Use>(node->child1().node());
415                 node->convertToIdentity();
416                 break;
417             }
418             if (node->child1()->shouldSpeculateNotCell()) {
419                 fixDoubleOrBooleanEdge(node->child1());
420
421                 if (isInt32OrBooleanSpeculation(node->getHeapPrediction()) && m_graph.roundShouldSpeculateInt32(node, FixupPass)) {
422                     node->setResult(NodeResultInt32);
423                     if (bytecodeCanIgnoreNegativeZero(node->arithNodeFlags()))
424                         node->setArithRoundingMode(Arith::RoundingMode::Int32);
425                     else
426                         node->setArithRoundingMode(Arith::RoundingMode::Int32WithNegativeZeroCheck);
427                 } else {
428                     node->setResult(NodeResultDouble);
429                     node->setArithRoundingMode(Arith::RoundingMode::Double);
430                 }
431                 node->clearFlags(NodeMustGenerate);
432             } else
433                 fixEdge<UntypedUse>(node->child1());
434             break;
435         }
436
437         case ArithFRound:
438         case ArithSqrt:
439         case ArithUnary: {
440             Edge& child1 = node->child1();
441             if (child1->shouldSpeculateNotCell()) {
442                 fixDoubleOrBooleanEdge(child1);
443                 node->clearFlags(NodeMustGenerate);
444             } else
445                 fixEdge<UntypedUse>(child1);
446             break;
447         }
448             
449         case LogicalNot: {
450             if (node->child1()->shouldSpeculateBoolean()) {
451                 if (node->child1()->result() == NodeResultBoolean) {
452                     // This is necessary in case we have a bytecode instruction implemented by:
453                     //
454                     // a: CompareEq(...)
455                     // b: LogicalNot(@a)
456                     //
457                     // In that case, CompareEq might have a side-effect. Then, we need to make
458                     // sure that we know that Branch does not exit.
459                     fixEdge<KnownBooleanUse>(node->child1());
460                 } else
461                     fixEdge<BooleanUse>(node->child1());
462             } else if (node->child1()->shouldSpeculateObjectOrOther())
463                 fixEdge<ObjectOrOtherUse>(node->child1());
464             else if (node->child1()->shouldSpeculateInt32OrBoolean())
465                 fixIntOrBooleanEdge(node->child1());
466             else if (node->child1()->shouldSpeculateNumber())
467                 fixEdge<DoubleRepUse>(node->child1());
468             else if (node->child1()->shouldSpeculateString())
469                 fixEdge<StringUse>(node->child1());
470             else if (node->child1()->shouldSpeculateStringOrOther())
471                 fixEdge<StringOrOtherUse>(node->child1());
472             else {
473                 WatchpointSet* masqueradesAsUndefinedWatchpoint = m_graph.globalObjectFor(node->origin.semantic)->masqueradesAsUndefinedWatchpoint();
474                 if (masqueradesAsUndefinedWatchpoint->isStillValid())
475                     m_graph.watchpoints().addLazily(masqueradesAsUndefinedWatchpoint);
476             }
477             break;
478         }
479
480         case CompareEq:
481         case CompareLess:
482         case CompareLessEq:
483         case CompareGreater:
484         case CompareGreaterEq: {
485             if (node->op() == CompareEq
486                 && Node::shouldSpeculateBoolean(node->child1().node(), node->child2().node())) {
487                 fixEdge<BooleanUse>(node->child1());
488                 fixEdge<BooleanUse>(node->child2());
489                 node->clearFlags(NodeMustGenerate);
490                 break;
491             }
492             if (Node::shouldSpeculateInt32OrBoolean(node->child1().node(), node->child2().node())) {
493                 fixIntOrBooleanEdge(node->child1());
494                 fixIntOrBooleanEdge(node->child2());
495                 node->clearFlags(NodeMustGenerate);
496                 break;
497             }
498             if (enableInt52()
499                 && Node::shouldSpeculateAnyInt(node->child1().node(), node->child2().node())) {
500                 fixEdge<Int52RepUse>(node->child1());
501                 fixEdge<Int52RepUse>(node->child2());
502                 node->clearFlags(NodeMustGenerate);
503                 break;
504             }
505             if (Node::shouldSpeculateNumberOrBoolean(node->child1().node(), node->child2().node())) {
506                 fixDoubleOrBooleanEdge(node->child1());
507                 fixDoubleOrBooleanEdge(node->child2());
508             }
509             if (node->op() != CompareEq
510                 && node->child1()->shouldSpeculateNotCell()
511                 && node->child2()->shouldSpeculateNotCell()) {
512                 if (node->child1()->shouldSpeculateNumberOrBoolean())
513                     fixDoubleOrBooleanEdge(node->child1());
514                 else
515                     fixEdge<DoubleRepUse>(node->child1());
516                 if (node->child2()->shouldSpeculateNumberOrBoolean())
517                     fixDoubleOrBooleanEdge(node->child2());
518                 else
519                     fixEdge<DoubleRepUse>(node->child2());
520                 node->clearFlags(NodeMustGenerate);
521                 break;
522             }
523             if (node->child1()->shouldSpeculateStringIdent() && node->child2()->shouldSpeculateStringIdent()) {
524                 fixEdge<StringIdentUse>(node->child1());
525                 fixEdge<StringIdentUse>(node->child2());
526                 node->clearFlags(NodeMustGenerate);
527                 break;
528             }
529             if (node->child1()->shouldSpeculateString() && node->child2()->shouldSpeculateString() && GPRInfo::numberOfRegisters >= 7) {
530                 fixEdge<StringUse>(node->child1());
531                 fixEdge<StringUse>(node->child2());
532                 node->clearFlags(NodeMustGenerate);
533                 break;
534             }
535
536             if (node->op() != CompareEq)
537                 break;
538             if (Node::shouldSpeculateSymbol(node->child1().node(), node->child2().node())) {
539                 fixEdge<SymbolUse>(node->child1());
540                 fixEdge<SymbolUse>(node->child2());
541                 node->clearFlags(NodeMustGenerate);
542                 break;
543             }
544             if (node->child1()->shouldSpeculateObject() && node->child2()->shouldSpeculateObject()) {
545                 fixEdge<ObjectUse>(node->child1());
546                 fixEdge<ObjectUse>(node->child2());
547                 node->clearFlags(NodeMustGenerate);
548                 break;
549             }
550
551             // If either child can be proved to be Null or Undefined, comparing them is greatly simplified.
552             bool oneArgumentIsUsedAsSpecOther = false;
553             if (node->child1()->isUndefinedOrNullConstant()) {
554                 fixEdge<OtherUse>(node->child1());
555                 oneArgumentIsUsedAsSpecOther = true;
556             } else if (node->child1()->shouldSpeculateOther()) {
557                 m_insertionSet.insertNode(m_indexInBlock, SpecNone, Check, node->origin,
558                     Edge(node->child1().node(), OtherUse));
559                 fixEdge<OtherUse>(node->child1());
560                 oneArgumentIsUsedAsSpecOther = true;
561             }
562             if (node->child2()->isUndefinedOrNullConstant()) {
563                 fixEdge<OtherUse>(node->child2());
564                 oneArgumentIsUsedAsSpecOther = true;
565             } else if (node->child2()->shouldSpeculateOther()) {
566                 m_insertionSet.insertNode(m_indexInBlock, SpecNone, Check, node->origin,
567                     Edge(node->child2().node(), OtherUse));
568                 fixEdge<OtherUse>(node->child2());
569                 oneArgumentIsUsedAsSpecOther = true;
570             }
571             if (oneArgumentIsUsedAsSpecOther) {
572                 node->clearFlags(NodeMustGenerate);
573                 break;
574             }
575
576             if (node->child1()->shouldSpeculateObject() && node->child2()->shouldSpeculateObjectOrOther()) {
577                 fixEdge<ObjectUse>(node->child1());
578                 fixEdge<ObjectOrOtherUse>(node->child2());
579                 node->clearFlags(NodeMustGenerate);
580                 break;
581             }
582             if (node->child1()->shouldSpeculateObjectOrOther() && node->child2()->shouldSpeculateObject()) {
583                 fixEdge<ObjectOrOtherUse>(node->child1());
584                 fixEdge<ObjectUse>(node->child2());
585                 node->clearFlags(NodeMustGenerate);
586                 break;
587             }
588
589             break;
590         }
591             
592         case CompareStrictEq: {
593             if (Node::shouldSpeculateBoolean(node->child1().node(), node->child2().node())) {
594                 fixEdge<BooleanUse>(node->child1());
595                 fixEdge<BooleanUse>(node->child2());
596                 break;
597             }
598             if (Node::shouldSpeculateInt32(node->child1().node(), node->child2().node())) {
599                 fixEdge<Int32Use>(node->child1());
600                 fixEdge<Int32Use>(node->child2());
601                 break;
602             }
603             if (enableInt52()
604                 && Node::shouldSpeculateAnyInt(node->child1().node(), node->child2().node())) {
605                 fixEdge<Int52RepUse>(node->child1());
606                 fixEdge<Int52RepUse>(node->child2());
607                 break;
608             }
609             if (Node::shouldSpeculateNumber(node->child1().node(), node->child2().node())) {
610                 fixEdge<DoubleRepUse>(node->child1());
611                 fixEdge<DoubleRepUse>(node->child2());
612                 break;
613             }
614             if (Node::shouldSpeculateSymbol(node->child1().node(), node->child2().node())) {
615                 fixEdge<SymbolUse>(node->child1());
616                 fixEdge<SymbolUse>(node->child2());
617                 break;
618             }
619             if (node->child1()->shouldSpeculateStringIdent() && node->child2()->shouldSpeculateStringIdent()) {
620                 fixEdge<StringIdentUse>(node->child1());
621                 fixEdge<StringIdentUse>(node->child2());
622                 break;
623             }
624             if (node->child1()->shouldSpeculateString() && node->child2()->shouldSpeculateString() && ((GPRInfo::numberOfRegisters >= 7) || isFTL(m_graph.m_plan.mode))) {
625                 fixEdge<StringUse>(node->child1());
626                 fixEdge<StringUse>(node->child2());
627                 break;
628             }
629             WatchpointSet* masqueradesAsUndefinedWatchpoint = m_graph.globalObjectFor(node->origin.semantic)->masqueradesAsUndefinedWatchpoint();
630             if (masqueradesAsUndefinedWatchpoint->isStillValid()) {
631                 
632                 if (node->child1()->shouldSpeculateObject()) {
633                     m_graph.watchpoints().addLazily(masqueradesAsUndefinedWatchpoint);
634                     fixEdge<ObjectUse>(node->child1());
635                     break;
636                 }
637                 if (node->child2()->shouldSpeculateObject()) {
638                     m_graph.watchpoints().addLazily(masqueradesAsUndefinedWatchpoint);
639                     fixEdge<ObjectUse>(node->child2());
640                     break;
641                 }
642                 
643             } else if (node->child1()->shouldSpeculateObject() && node->child2()->shouldSpeculateObject()) {
644                 fixEdge<ObjectUse>(node->child1());
645                 fixEdge<ObjectUse>(node->child2());
646                 break;
647             }
648             if (node->child1()->shouldSpeculateSymbol()) {
649                 fixEdge<SymbolUse>(node->child1());
650                 break;
651             }
652             if (node->child2()->shouldSpeculateSymbol()) {
653                 fixEdge<SymbolUse>(node->child2());
654                 break;
655             }
656             if (node->child1()->shouldSpeculateMisc()) {
657                 fixEdge<MiscUse>(node->child1());
658                 break;
659             }
660             if (node->child2()->shouldSpeculateMisc()) {
661                 fixEdge<MiscUse>(node->child2());
662                 break;
663             }
664             if (node->child1()->shouldSpeculateStringIdent()
665                 && node->child2()->shouldSpeculateNotStringVar()) {
666                 fixEdge<StringIdentUse>(node->child1());
667                 fixEdge<NotStringVarUse>(node->child2());
668                 break;
669             }
670             if (node->child2()->shouldSpeculateStringIdent()
671                 && node->child1()->shouldSpeculateNotStringVar()) {
672                 fixEdge<StringIdentUse>(node->child2());
673                 fixEdge<NotStringVarUse>(node->child1());
674                 break;
675             }
676             if (node->child1()->shouldSpeculateString() && ((GPRInfo::numberOfRegisters >= 8) || isFTL(m_graph.m_plan.mode))) {
677                 fixEdge<StringUse>(node->child1());
678                 break;
679             }
680             if (node->child2()->shouldSpeculateString() && ((GPRInfo::numberOfRegisters >= 8) || isFTL(m_graph.m_plan.mode))) {
681                 fixEdge<StringUse>(node->child2());
682                 break;
683             }
684             break;
685         }
686             
687         case StringFromCharCode:
688             if (node->child1()->shouldSpeculateInt32())
689                 fixEdge<Int32Use>(node->child1());
690             else
691                 fixEdge<UntypedUse>(node->child1());
692             break;
693
694         case StringCharAt:
695         case StringCharCodeAt: {
696             // Currently we have no good way of refining these.
697             ASSERT(node->arrayMode() == ArrayMode(Array::String));
698             blessArrayOperation(node->child1(), node->child2(), node->child3());
699             fixEdge<KnownCellUse>(node->child1());
700             fixEdge<Int32Use>(node->child2());
701             break;
702         }
703
704         case GetByVal: {
705             if (!node->prediction()) {
706                 m_insertionSet.insertNode(
707                     m_indexInBlock, SpecNone, ForceOSRExit, node->origin);
708             }
709             
710             node->setArrayMode(
711                 node->arrayMode().refine(
712                     m_graph, node,
713                     node->child1()->prediction(),
714                     node->child2()->prediction(),
715                     SpecNone));
716             
717             blessArrayOperation(node->child1(), node->child2(), node->child3());
718             
719             ArrayMode arrayMode = node->arrayMode();
720             switch (arrayMode.type()) {
721             case Array::Contiguous:
722             case Array::Double:
723                 if (arrayMode.arrayClass() == Array::OriginalArray
724                     && arrayMode.speculation() == Array::InBounds) {
725                     JSGlobalObject* globalObject = m_graph.globalObjectFor(node->origin.semantic);
726                     if (globalObject->arrayPrototypeChainIsSane()) {
727                         // Check if SaneChain will work on a per-type basis. Note that:
728                         //
729                         // 1) We don't want double arrays to sometimes return undefined, since
730                         // that would require a change to the return type and it would pessimise
731                         // things a lot. So, we'd only want to do that if we actually had
732                         // evidence that we could read from a hole. That's pretty annoying.
733                         // Likely the best way to handle that case is with an equivalent of
734                         // SaneChain for OutOfBounds. For now we just detect when Undefined and
735                         // NaN are indistinguishable according to backwards propagation, and just
736                         // use SaneChain in that case. This happens to catch a lot of cases.
737                         //
738                         // 2) We don't want int32 array loads to have to do a hole check just to
739                         // coerce to Undefined, since that would mean twice the checks.
740                         //
741                         // This has two implications. First, we have to do more checks than we'd
742                         // like. It's unfortunate that we have to do the hole check. Second,
743                         // some accesses that hit a hole will now need to take the full-blown
744                         // out-of-bounds slow path. We can fix that with:
745                         // https://bugs.webkit.org/show_bug.cgi?id=144668
746                         
747                         bool canDoSaneChain = false;
748                         switch (arrayMode.type()) {
749                         case Array::Contiguous:
750                             // This is happens to be entirely natural. We already would have
751                             // returned any JSValue, and now we'll return Undefined. We still do
752                             // the check but it doesn't require taking any kind of slow path.
753                             canDoSaneChain = true;
754                             break;
755                             
756                         case Array::Double:
757                             if (!(node->flags() & NodeBytecodeUsesAsOther)) {
758                                 // Holes look like NaN already, so if the user doesn't care
759                                 // about the difference between Undefined and NaN then we can
760                                 // do this.
761                                 canDoSaneChain = true;
762                             }
763                             break;
764                             
765                         default:
766                             break;
767                         }
768                         
769                         if (canDoSaneChain) {
770                             m_graph.registerAndWatchStructureTransition(globalObject->arrayPrototype()->structure());
771                             m_graph.registerAndWatchStructureTransition(globalObject->objectPrototype()->structure());
772                             if (globalObject->arrayPrototypeChainIsSane())
773                                 node->setArrayMode(arrayMode.withSpeculation(Array::SaneChain));
774                         }
775                     }
776                 }
777                 break;
778                 
779             case Array::String:
780                 if ((node->prediction() & ~SpecString)
781                     || m_graph.hasExitSite(node->origin.semantic, OutOfBounds))
782                     node->setArrayMode(arrayMode.withSpeculation(Array::OutOfBounds));
783                 break;
784                 
785             default:
786                 break;
787             }
788             
789             arrayMode = node->arrayMode();
790             switch (arrayMode.type()) {
791             case Array::SelectUsingPredictions:
792             case Array::Unprofiled:
793                 RELEASE_ASSERT_NOT_REACHED();
794                 break;
795             case Array::Generic:
796                 if (node->child1()->shouldSpeculateObject()) {
797                     if (node->child2()->shouldSpeculateString()) {
798                         fixEdge<ObjectUse>(node->child1());
799                         fixEdge<StringUse>(node->child2());
800                         break;
801                     }
802
803                     if (node->child2()->shouldSpeculateSymbol()) {
804                         fixEdge<ObjectUse>(node->child1());
805                         fixEdge<SymbolUse>(node->child2());
806                         break;
807                     }
808                 }
809 #if USE(JSVALUE32_64)
810                 fixEdge<CellUse>(node->child1()); // Speculating cell due to register pressure on 32-bit.
811 #endif
812                 break;
813             case Array::ForceExit:
814                 break;
815             default:
816                 fixEdge<KnownCellUse>(node->child1());
817                 fixEdge<Int32Use>(node->child2());
818                 break;
819             }
820             
821             switch (arrayMode.type()) {
822             case Array::Double:
823                 if (!arrayMode.isOutOfBounds())
824                     node->setResult(NodeResultDouble);
825                 break;
826                 
827             case Array::Float32Array:
828             case Array::Float64Array:
829                 node->setResult(NodeResultDouble);
830                 break;
831                 
832             case Array::Uint32Array:
833                 if (node->shouldSpeculateInt32())
834                     break;
835                 if (node->shouldSpeculateAnyInt() && enableInt52())
836                     node->setResult(NodeResultInt52);
837                 else
838                     node->setResult(NodeResultDouble);
839                 break;
840                 
841             default:
842                 break;
843             }
844             
845             break;
846         }
847
848         case PutByValDirect:
849         case PutByVal:
850         case PutByValAlias: {
851             Edge& child1 = m_graph.varArgChild(node, 0);
852             Edge& child2 = m_graph.varArgChild(node, 1);
853             Edge& child3 = m_graph.varArgChild(node, 2);
854
855             node->setArrayMode(
856                 node->arrayMode().refine(
857                     m_graph, node,
858                     child1->prediction(),
859                     child2->prediction(),
860                     child3->prediction()));
861             
862             blessArrayOperation(child1, child2, m_graph.varArgChild(node, 3));
863             
864             switch (node->arrayMode().modeForPut().type()) {
865             case Array::SelectUsingPredictions:
866             case Array::SelectUsingArguments:
867             case Array::Unprofiled:
868             case Array::Undecided:
869                 RELEASE_ASSERT_NOT_REACHED();
870                 break;
871             case Array::ForceExit:
872             case Array::Generic:
873                 if (child1->shouldSpeculateCell()) {
874                     if (child2->shouldSpeculateString()) {
875                         fixEdge<CellUse>(child1);
876                         fixEdge<StringUse>(child2);
877                         break;
878                     }
879
880                     if (child2->shouldSpeculateSymbol()) {
881                         fixEdge<CellUse>(child1);
882                         fixEdge<SymbolUse>(child2);
883                         break;
884                     }
885                 }
886 #if USE(JSVALUE32_64)
887                 // Due to register pressure on 32-bit, we speculate cell and
888                 // ignore the base-is-not-cell case entirely by letting the
889                 // baseline JIT handle it.
890                 fixEdge<CellUse>(child1);
891 #endif
892                 break;
893             case Array::Int32:
894                 fixEdge<KnownCellUse>(child1);
895                 fixEdge<Int32Use>(child2);
896                 fixEdge<Int32Use>(child3);
897                 break;
898             case Array::Double:
899                 fixEdge<KnownCellUse>(child1);
900                 fixEdge<Int32Use>(child2);
901                 fixEdge<DoubleRepRealUse>(child3);
902                 break;
903             case Array::Int8Array:
904             case Array::Int16Array:
905             case Array::Int32Array:
906             case Array::Uint8Array:
907             case Array::Uint8ClampedArray:
908             case Array::Uint16Array:
909             case Array::Uint32Array:
910                 fixEdge<KnownCellUse>(child1);
911                 fixEdge<Int32Use>(child2);
912                 if (child3->shouldSpeculateInt32())
913                     fixIntOrBooleanEdge(child3);
914                 else if (child3->shouldSpeculateAnyInt())
915                     fixEdge<Int52RepUse>(child3);
916                 else
917                     fixDoubleOrBooleanEdge(child3);
918                 break;
919             case Array::Float32Array:
920             case Array::Float64Array:
921                 fixEdge<KnownCellUse>(child1);
922                 fixEdge<Int32Use>(child2);
923                 fixDoubleOrBooleanEdge(child3);
924                 break;
925             case Array::Contiguous:
926             case Array::ArrayStorage:
927             case Array::SlowPutArrayStorage:
928                 fixEdge<KnownCellUse>(child1);
929                 fixEdge<Int32Use>(child2);
930                 speculateForBarrier(child3);
931                 break;
932             default:
933                 fixEdge<KnownCellUse>(child1);
934                 fixEdge<Int32Use>(child2);
935                 break;
936             }
937             break;
938         }
939             
940         case AtomicsAdd:
941         case AtomicsAnd:
942         case AtomicsCompareExchange:
943         case AtomicsExchange:
944         case AtomicsLoad:
945         case AtomicsOr:
946         case AtomicsStore:
947         case AtomicsSub:
948         case AtomicsXor: {
949             Edge& base = m_graph.child(node, 0);
950             Edge& index = m_graph.child(node, 1);
951             
952             bool badNews = false;
953             for (unsigned i = numExtraAtomicsArgs(node->op()); i--;) {
954                 Edge& child = m_graph.child(node, 2 + i);
955                 // NOTE: DFG is not smart enough to handle double->int conversions in atomics. So, we
956                 // just call the function when that happens. But the FTL is totally cool with those
957                 // conversions.
958                 if (!child->shouldSpeculateInt32()
959                     && !child->shouldSpeculateAnyInt()
960                     && !(child->shouldSpeculateNumberOrBoolean() && isFTL(m_graph.m_plan.mode)))
961                     badNews = true;
962             }
963             
964             if (badNews) {
965                 node->setArrayMode(ArrayMode(Array::Generic));
966                 break;
967             }
968             
969             node->setArrayMode(
970                 node->arrayMode().refine(
971                     m_graph, node, base->prediction(), index->prediction()));
972             
973             if (node->arrayMode().type() == Array::Generic)
974                 break;
975             
976             for (unsigned i = numExtraAtomicsArgs(node->op()); i--;) {
977                 Edge& child = m_graph.child(node, 2 + i);
978                 if (child->shouldSpeculateInt32())
979                     fixIntOrBooleanEdge(child);
980                 else if (child->shouldSpeculateAnyInt())
981                     fixEdge<Int52RepUse>(child);
982                 else {
983                     RELEASE_ASSERT(child->shouldSpeculateNumberOrBoolean() && isFTL(m_graph.m_plan.mode));
984                     fixDoubleOrBooleanEdge(child);
985                 }
986             }
987             
988             blessArrayOperation(base, index, m_graph.child(node, 2 + numExtraAtomicsArgs(node->op())));
989             fixEdge<CellUse>(base);
990             fixEdge<Int32Use>(index);
991             
992             if (node->arrayMode().type() == Array::Uint32Array) {
993                 // NOTE: This means basically always doing Int52.
994                 if (node->shouldSpeculateAnyInt() && enableInt52())
995                     node->setResult(NodeResultInt52);
996                 else
997                     node->setResult(NodeResultDouble);
998             }
999             break;
1000         }
1001             
1002         case AtomicsIsLockFree:
1003             if (node->child1()->shouldSpeculateInt32())
1004                 fixIntOrBooleanEdge(node->child1());
1005             break;
1006             
1007         case ArrayPush: {
1008             // May need to refine the array mode in case the value prediction contravenes
1009             // the array prediction. For example, we may have evidence showing that the
1010             // array is in Int32 mode, but the value we're storing is likely to be a double.
1011             // Then we should turn this into a conversion to Double array followed by the
1012             // push. On the other hand, we absolutely don't want to refine based on the
1013             // base prediction. If it has non-cell garbage in it, then we want that to be
1014             // ignored. That's because ArrayPush can't handle any array modes that aren't
1015             // array-related - so if refine() turned this into a "Generic" ArrayPush then
1016             // that would break things.
1017             Edge& storageEdge = m_graph.varArgChild(node, 0);
1018             Edge& arrayEdge = m_graph.varArgChild(node, 1);
1019             unsigned elementOffset = 2;
1020             unsigned elementCount = node->numChildren() - elementOffset;
1021             for (unsigned i = 0; i < elementCount; ++i) {
1022                 Edge& element = m_graph.varArgChild(node, i + elementOffset);
1023                 node->setArrayMode(
1024                     node->arrayMode().refine(
1025                         m_graph, node,
1026                         arrayEdge->prediction() & SpecCell,
1027                         SpecInt32Only,
1028                         element->prediction()));
1029             }
1030             blessArrayOperation(arrayEdge, Edge(), storageEdge);
1031             fixEdge<KnownCellUse>(arrayEdge);
1032
1033             // Convert `array.push()` to GetArrayLength.
1034             if (!elementCount && node->arrayMode().supportsSelfLength()) {
1035                 node->setOpAndDefaultFlags(GetArrayLength);
1036                 node->child1() = arrayEdge;
1037                 node->child2() = storageEdge;
1038                 fixEdge<KnownCellUse>(node->child1());
1039                 break;
1040             }
1041
1042             // We do not want to perform osr exit and retry for ArrayPush. We insert Check with appropriate type,
1043             // and ArrayPush uses the edge as known typed edge. Therefore, ArrayPush do not need to perform type checks.
1044             for (unsigned i = 0; i < elementCount; ++i) {
1045                 Edge& element = m_graph.varArgChild(node, i + elementOffset);
1046                 switch (node->arrayMode().type()) {
1047                 case Array::Int32:
1048                     insertCheck<Int32Use>(element.node());
1049                     fixEdge<KnownInt32Use>(element);
1050                     break;
1051                 case Array::Double:
1052                     insertCheck<DoubleRepRealUse>(element.node());
1053                     fixEdge<DoubleRepUse>(element);
1054                     break;
1055                 case Array::Contiguous:
1056                 case Array::ArrayStorage:
1057                     speculateForBarrier(element);
1058                     break;
1059                 default:
1060                     break;
1061                 }
1062                 ASSERT(shouldNotHaveTypeCheck(element.useKind()));
1063             }
1064             break;
1065         }
1066             
1067         case ArrayPop: {
1068             blessArrayOperation(node->child1(), Edge(), node->child2());
1069             fixEdge<KnownCellUse>(node->child1());
1070             break;
1071         }
1072
1073         case ArraySlice: {
1074             fixEdge<KnownCellUse>(m_graph.varArgChild(node, 0));
1075             fixEdge<Int32Use>(m_graph.varArgChild(node, 1));
1076             if (node->numChildren() == 4)
1077                 fixEdge<Int32Use>(m_graph.varArgChild(node, 2));
1078             break;
1079         }
1080
1081         case ArrayIndexOf:
1082             fixupArrayIndexOf(node);
1083             break;
1084             
1085         case RegExpExec:
1086         case RegExpTest: {
1087             fixEdge<KnownCellUse>(node->child1());
1088             
1089             if (node->child2()->shouldSpeculateRegExpObject()) {
1090                 fixEdge<RegExpObjectUse>(node->child2());
1091
1092                 if (node->child3()->shouldSpeculateString())
1093                     fixEdge<StringUse>(node->child3());
1094             }
1095             break;
1096         }
1097
1098         case StringReplace:
1099         case StringReplaceRegExp: {
1100             if (node->child2()->shouldSpeculateString()) {
1101                 m_insertionSet.insertNode(
1102                     m_indexInBlock, SpecNone, Check, node->origin,
1103                     Edge(node->child2().node(), StringUse));
1104                 fixEdge<StringUse>(node->child2());
1105             } else if (op == StringReplace) {
1106                 if (node->child2()->shouldSpeculateRegExpObject())
1107                     addStringReplacePrimordialChecks(node->child2().node());
1108                 else 
1109                     m_insertionSet.insertNode(
1110                         m_indexInBlock, SpecNone, ForceOSRExit, node->origin);
1111             }
1112
1113             if (node->child1()->shouldSpeculateString()
1114                 && node->child2()->shouldSpeculateRegExpObject()
1115                 && node->child3()->shouldSpeculateString()) {
1116
1117                 fixEdge<StringUse>(node->child1());
1118                 fixEdge<RegExpObjectUse>(node->child2());
1119                 fixEdge<StringUse>(node->child3());
1120                 break;
1121             }
1122             break;
1123         }
1124             
1125         case Branch: {
1126             if (node->child1()->shouldSpeculateBoolean()) {
1127                 if (node->child1()->result() == NodeResultBoolean) {
1128                     // This is necessary in case we have a bytecode instruction implemented by:
1129                     //
1130                     // a: CompareEq(...)
1131                     // b: Branch(@a)
1132                     //
1133                     // In that case, CompareEq might have a side-effect. Then, we need to make
1134                     // sure that we know that Branch does not exit.
1135                     fixEdge<KnownBooleanUse>(node->child1());
1136                 } else
1137                     fixEdge<BooleanUse>(node->child1());
1138             } else if (node->child1()->shouldSpeculateObjectOrOther())
1139                 fixEdge<ObjectOrOtherUse>(node->child1());
1140             else if (node->child1()->shouldSpeculateInt32OrBoolean())
1141                 fixIntOrBooleanEdge(node->child1());
1142             else if (node->child1()->shouldSpeculateNumber())
1143                 fixEdge<DoubleRepUse>(node->child1());
1144             else if (node->child1()->shouldSpeculateString())
1145                 fixEdge<StringUse>(node->child1());
1146             else if (node->child1()->shouldSpeculateStringOrOther())
1147                 fixEdge<StringOrOtherUse>(node->child1());
1148             else {
1149                 WatchpointSet* masqueradesAsUndefinedWatchpoint = m_graph.globalObjectFor(node->origin.semantic)->masqueradesAsUndefinedWatchpoint();
1150                 if (masqueradesAsUndefinedWatchpoint->isStillValid())
1151                     m_graph.watchpoints().addLazily(masqueradesAsUndefinedWatchpoint);
1152             }
1153             break;
1154         }
1155             
1156         case Switch: {
1157             SwitchData* data = node->switchData();
1158             switch (data->kind) {
1159             case SwitchImm:
1160                 if (node->child1()->shouldSpeculateInt32())
1161                     fixEdge<Int32Use>(node->child1());
1162                 break;
1163             case SwitchChar:
1164                 if (node->child1()->shouldSpeculateString())
1165                     fixEdge<StringUse>(node->child1());
1166                 break;
1167             case SwitchString:
1168                 if (node->child1()->shouldSpeculateStringIdent())
1169                     fixEdge<StringIdentUse>(node->child1());
1170                 else if (node->child1()->shouldSpeculateString())
1171                     fixEdge<StringUse>(node->child1());
1172                 break;
1173             case SwitchCell:
1174                 if (node->child1()->shouldSpeculateCell())
1175                     fixEdge<CellUse>(node->child1());
1176                 // else it's fine for this to have UntypedUse; we will handle this by just making
1177                 // non-cells take the default case.
1178                 break;
1179             }
1180             break;
1181         }
1182             
1183         case ToPrimitive: {
1184             fixupToPrimitive(node);
1185             break;
1186         }
1187
1188         case ToNumber: {
1189             fixupToNumber(node);
1190             break;
1191         }
1192             
1193         case ToString:
1194         case CallStringConstructor: {
1195             fixupToStringOrCallStringConstructor(node);
1196             break;
1197         }
1198             
1199         case NewStringObject: {
1200             fixEdge<KnownStringUse>(node->child1());
1201             break;
1202         }
1203
1204         case NewArrayWithSpread: {
1205             watchHavingABadTime(node);
1206             
1207             BitVector* bitVector = node->bitVector();
1208             for (unsigned i = node->numChildren(); i--;) {
1209                 if (bitVector->get(i))
1210                     fixEdge<KnownCellUse>(m_graph.m_varArgChildren[node->firstChild() + i]);
1211                 else
1212                     fixEdge<UntypedUse>(m_graph.m_varArgChildren[node->firstChild() + i]);
1213             }
1214
1215             break;
1216         }
1217
1218         case Spread: {
1219             // Note: We care about performing the protocol on our child's global object, not necessarily ours.
1220             
1221             watchHavingABadTime(node->child1().node());
1222
1223             JSGlobalObject* globalObject = m_graph.globalObjectFor(node->child1()->origin.semantic);
1224             // When we go down the fast path, we don't consult the prototype chain, so we must prove
1225             // that it doesn't contain any indexed properties, and that any holes will result in
1226             // jsUndefined().
1227             Structure* arrayPrototypeStructure = globalObject->arrayPrototype()->structure();
1228             Structure* objectPrototypeStructure = globalObject->objectPrototype()->structure();
1229             if (node->child1()->shouldSpeculateArray()
1230                 && arrayPrototypeStructure->transitionWatchpointSetIsStillValid()
1231                 && objectPrototypeStructure->transitionWatchpointSetIsStillValid()
1232                 && globalObject->arrayPrototypeChainIsSane()
1233                 && m_graph.isWatchingArrayIteratorProtocolWatchpoint(node->child1().node())
1234                 && m_graph.isWatchingHavingABadTimeWatchpoint(node->child1().node())) {
1235                 m_graph.registerAndWatchStructureTransition(objectPrototypeStructure);
1236                 m_graph.registerAndWatchStructureTransition(arrayPrototypeStructure);
1237                 fixEdge<ArrayUse>(node->child1());
1238             } else
1239                 fixEdge<CellUse>(node->child1());
1240             break;
1241         }
1242             
1243         case NewArray: {
1244             watchHavingABadTime(node);
1245             
1246             for (unsigned i = m_graph.varArgNumChildren(node); i--;) {
1247                 node->setIndexingType(
1248                     leastUpperBoundOfIndexingTypeAndType(
1249                         node->indexingType(), m_graph.varArgChild(node, i)->prediction()));
1250             }
1251             switch (node->indexingType()) {
1252             case ALL_BLANK_INDEXING_TYPES:
1253                 CRASH();
1254                 break;
1255             case ALL_UNDECIDED_INDEXING_TYPES:
1256                 if (node->numChildren()) {
1257                     // This will only happen if the children have no type predictions. We
1258                     // would have already exited by now, but insert a forced exit just to
1259                     // be safe.
1260                     m_insertionSet.insertNode(
1261                         m_indexInBlock, SpecNone, ForceOSRExit, node->origin);
1262                 }
1263                 break;
1264             case ALL_INT32_INDEXING_TYPES:
1265                 for (unsigned operandIndex = 0; operandIndex < node->numChildren(); ++operandIndex)
1266                     fixEdge<Int32Use>(m_graph.m_varArgChildren[node->firstChild() + operandIndex]);
1267                 break;
1268             case ALL_DOUBLE_INDEXING_TYPES:
1269                 for (unsigned operandIndex = 0; operandIndex < node->numChildren(); ++operandIndex)
1270                     fixEdge<DoubleRepRealUse>(m_graph.m_varArgChildren[node->firstChild() + operandIndex]);
1271                 break;
1272             case ALL_CONTIGUOUS_INDEXING_TYPES:
1273             case ALL_ARRAY_STORAGE_INDEXING_TYPES:
1274                 break;
1275             default:
1276                 CRASH();
1277                 break;
1278             }
1279             break;
1280         }
1281             
1282         case NewTypedArray: {
1283             watchHavingABadTime(node);
1284             
1285             if (node->child1()->shouldSpeculateInt32()) {
1286                 fixEdge<Int32Use>(node->child1());
1287                 node->clearFlags(NodeMustGenerate);
1288                 break;
1289             }
1290             break;
1291         }
1292             
1293         case NewArrayWithSize: {
1294             watchHavingABadTime(node);
1295             fixEdge<Int32Use>(node->child1());
1296             break;
1297         }
1298
1299         case NewArrayBuffer: {
1300             watchHavingABadTime(node);
1301             break;
1302         }
1303
1304         case ToObject: {
1305             fixupToObject(node);
1306             break;
1307         }
1308
1309         case CallObjectConstructor: {
1310             fixupCallObjectConstructor(node);
1311             break;
1312         }
1313
1314         case ToThis: {
1315             fixupToThis(node);
1316             break;
1317         }
1318             
1319         case PutStructure: {
1320             fixEdge<KnownCellUse>(node->child1());
1321             break;
1322         }
1323             
1324         case GetClosureVar:
1325         case GetFromArguments: {
1326             fixEdge<KnownCellUse>(node->child1());
1327             break;
1328         }
1329
1330         case PutClosureVar:
1331         case PutToArguments: {
1332             fixEdge<KnownCellUse>(node->child1());
1333             speculateForBarrier(node->child2());
1334             break;
1335         }
1336
1337         case SkipScope:
1338         case GetScope:
1339         case GetGetter:
1340         case GetSetter:
1341         case GetGlobalObject: {
1342             fixEdge<KnownCellUse>(node->child1());
1343             break;
1344         }
1345             
1346         case AllocatePropertyStorage:
1347         case ReallocatePropertyStorage: {
1348             fixEdge<KnownCellUse>(node->child1());
1349             break;
1350         }
1351             
1352         case NukeStructureAndSetButterfly: {
1353             fixEdge<KnownCellUse>(node->child1());
1354             break;
1355         }
1356
1357         case TryGetById: {
1358             if (node->child1()->shouldSpeculateCell())
1359                 fixEdge<CellUse>(node->child1());
1360             break;
1361         }
1362
1363         case GetById:
1364         case GetByIdFlush: {
1365             // FIXME: This should be done in the ByteCodeParser based on reading the
1366             // PolymorphicAccess, which will surely tell us that this is a AccessCase::ArrayLength.
1367             // https://bugs.webkit.org/show_bug.cgi?id=154990
1368             auto uid = m_graph.identifiers()[node->identifierNumber()];
1369             if (node->child1()->shouldSpeculateCellOrOther()
1370                 && !m_graph.hasExitSite(node->origin.semantic, BadType)
1371                 && !m_graph.hasExitSite(node->origin.semantic, BadCache)
1372                 && !m_graph.hasExitSite(node->origin.semantic, BadIndexingType)
1373                 && !m_graph.hasExitSite(node->origin.semantic, ExoticObjectMode)) {
1374                 
1375                 if (uid == vm().propertyNames->length.impl()) {
1376                     attemptToMakeGetArrayLength(node);
1377                     break;
1378                 }
1379
1380                 if (uid == vm().propertyNames->lastIndex.impl()
1381                     && node->child1()->shouldSpeculateRegExpObject()) {
1382                     node->setOp(GetRegExpObjectLastIndex);
1383                     node->clearFlags(NodeMustGenerate);
1384                     fixEdge<RegExpObjectUse>(node->child1());
1385                     break;
1386                 }
1387             }
1388
1389             if (node->child1()->shouldSpeculateNumber()) {
1390                 if (uid == vm().propertyNames->toString.impl()) {
1391                     if (m_graph.isWatchingNumberToStringWatchpoint(node)) {
1392                         JSGlobalObject* globalObject = m_graph.globalObjectFor(node->origin.semantic);
1393                         if (node->child1()->shouldSpeculateInt32()) {
1394                             insertCheck<Int32Use>(node->child1().node());
1395                             m_graph.convertToConstant(node, m_graph.freeze(globalObject->numberProtoToStringFunction()));
1396                             break;
1397                         }
1398
1399                         if (enableInt52() && node->child1()->shouldSpeculateAnyInt()) {
1400                             insertCheck<Int52RepUse>(node->child1().node());
1401                             m_graph.convertToConstant(node, m_graph.freeze(globalObject->numberProtoToStringFunction()));
1402                             break;
1403                         }
1404
1405                         ASSERT(node->child1()->shouldSpeculateNumber());
1406                         insertCheck<DoubleRepUse>(node->child1().node());
1407                         m_graph.convertToConstant(node, m_graph.freeze(globalObject->numberProtoToStringFunction()));
1408                         break;
1409                     }
1410                 }
1411             }
1412
1413             if (node->child1()->shouldSpeculateCell())
1414                 fixEdge<CellUse>(node->child1());
1415             break;
1416         }
1417         
1418         case GetByIdWithThis: {
1419             if (node->child1()->shouldSpeculateCell() && node->child2()->shouldSpeculateCell()) {
1420                 fixEdge<CellUse>(node->child1());
1421                 fixEdge<CellUse>(node->child2());
1422             }
1423             break;
1424         }
1425
1426         case PutById:
1427         case PutByIdFlush:
1428         case PutByIdDirect: {
1429             if (node->child1()->shouldSpeculateCellOrOther()
1430                 && !m_graph.hasExitSite(node->origin.semantic, BadType)
1431                 && !m_graph.hasExitSite(node->origin.semantic, BadCache)
1432                 && !m_graph.hasExitSite(node->origin.semantic, BadIndexingType)
1433                 && !m_graph.hasExitSite(node->origin.semantic, ExoticObjectMode)) {
1434                 
1435                 auto uid = m_graph.identifiers()[node->identifierNumber()];
1436                 
1437                 if (uid == vm().propertyNames->lastIndex.impl()
1438                     && node->child1()->shouldSpeculateRegExpObject()) {
1439                     node->setOp(SetRegExpObjectLastIndex);
1440                     fixEdge<RegExpObjectUse>(node->child1());
1441                     speculateForBarrier(node->child2());
1442                     break;
1443                 }
1444             }
1445             
1446             fixEdge<CellUse>(node->child1());
1447             break;
1448         }
1449
1450         case PutGetterById:
1451         case PutSetterById: {
1452             fixEdge<KnownCellUse>(node->child1());
1453             fixEdge<KnownCellUse>(node->child2());
1454             break;
1455         }
1456
1457         case PutGetterSetterById: {
1458             fixEdge<KnownCellUse>(node->child1());
1459             break;
1460         }
1461
1462         case PutGetterByVal:
1463         case PutSetterByVal: {
1464             fixEdge<KnownCellUse>(node->child1());
1465             fixEdge<KnownCellUse>(node->child3());
1466             break;
1467         }
1468
1469         case GetExecutable: {
1470             fixEdge<FunctionUse>(node->child1());
1471             break;
1472         }
1473
1474         case OverridesHasInstance:
1475         case CheckStructure:
1476         case CheckCell:
1477         case CreateThis:
1478         case GetButterfly:
1479         case GetButterflyWithoutCaging: {
1480             fixEdge<CellUse>(node->child1());
1481             break;
1482         }
1483
1484         case CheckStringIdent: {
1485             fixEdge<StringIdentUse>(node->child1());
1486             break;
1487         }
1488             
1489         case Arrayify:
1490         case ArrayifyToStructure: {
1491             fixEdge<CellUse>(node->child1());
1492             if (node->child2())
1493                 fixEdge<Int32Use>(node->child2());
1494             break;
1495         }
1496             
1497         case GetByOffset:
1498         case GetGetterSetterByOffset: {
1499             if (!node->child1()->hasStorageResult())
1500                 fixEdge<KnownCellUse>(node->child1());
1501             fixEdge<KnownCellUse>(node->child2());
1502             break;
1503         }
1504             
1505         case MultiGetByOffset: {
1506             fixEdge<CellUse>(node->child1());
1507             break;
1508         }
1509             
1510         case PutByOffset: {
1511             if (!node->child1()->hasStorageResult())
1512                 fixEdge<KnownCellUse>(node->child1());
1513             fixEdge<KnownCellUse>(node->child2());
1514             unsigned index = indexForChecks();
1515             insertInferredTypeCheck(
1516                 m_insertionSet, index, originForCheck(index), node->child3().node(),
1517                 node->storageAccessData().inferredType);
1518             speculateForBarrier(node->child3());
1519             break;
1520         }
1521             
1522         case MultiPutByOffset: {
1523             fixEdge<CellUse>(node->child1());
1524             break;
1525         }
1526             
1527         case InstanceOf: {
1528             if (!(node->child1()->prediction() & ~SpecCell))
1529                 fixEdge<CellUse>(node->child1());
1530             fixEdge<CellUse>(node->child2());
1531             break;
1532         }
1533
1534         case InstanceOfCustom:
1535             fixEdge<CellUse>(node->child2());
1536             break;
1537
1538         case In: {
1539             if (node->child2()->shouldSpeculateInt32()) {
1540                 convertToHasIndexedProperty(node);
1541                 break;
1542             }
1543
1544             fixEdge<CellUse>(node->child1());
1545             break;
1546         }
1547
1548         case HasOwnProperty: {
1549             fixEdge<ObjectUse>(node->child1());
1550 #if (CPU(X86) || CPU(MIPS)) && USE(JSVALUE32_64)
1551             // We don't have enough registers to do anything interesting on x86 and mips.
1552             fixEdge<UntypedUse>(node->child2());
1553 #else
1554             if (node->child2()->shouldSpeculateString())
1555                 fixEdge<StringUse>(node->child2());
1556             else if (node->child2()->shouldSpeculateSymbol())
1557                 fixEdge<SymbolUse>(node->child2());
1558             else
1559                 fixEdge<UntypedUse>(node->child2());
1560 #endif
1561             break;
1562         }
1563
1564         case Check: {
1565             m_graph.doToChildren(
1566                 node,
1567                 [&] (Edge& edge) {
1568                     switch (edge.useKind()) {
1569                     case NumberUse:
1570                         if (edge->shouldSpeculateInt32ForArithmetic())
1571                             edge.setUseKind(Int32Use);
1572                         break;
1573                     default:
1574                         break;
1575                     }
1576                     observeUseKindOnEdge(edge);
1577                 });
1578             break;
1579         }
1580
1581         case Phantom:
1582             // Phantoms are meaningless past Fixup. We recreate them on-demand in the backend.
1583             node->remove();
1584             break;
1585
1586         case FiatInt52: {
1587             RELEASE_ASSERT(enableInt52());
1588             node->convertToIdentity();
1589             fixEdge<Int52RepUse>(node->child1());
1590             node->setResult(NodeResultInt52);
1591             break;
1592         }
1593
1594         case GetArrayLength: {
1595             fixEdge<KnownCellUse>(node->child1());
1596             break;
1597         }
1598
1599         case GetTypedArrayByteOffset: {
1600             fixEdge<KnownCellUse>(node->child1());
1601             break;
1602         }
1603
1604         case CompareBelow:
1605         case CompareBelowEq: {
1606             fixEdge<Int32Use>(node->child1());
1607             fixEdge<Int32Use>(node->child2());
1608             break;
1609         }
1610
1611         case GetPrototypeOf: {
1612             fixupGetPrototypeOf(node);
1613             break;
1614         }
1615
1616         case Phi:
1617         case Upsilon:
1618         case EntrySwitch:
1619         case GetIndexedPropertyStorage:
1620         case LastNodeType:
1621         case CheckTierUpInLoop:
1622         case CheckTierUpAtReturn:
1623         case CheckTierUpAndOSREnter:
1624         case InvalidationPoint:
1625         case CheckArray:
1626         case CheckInBounds:
1627         case ConstantStoragePointer:
1628         case DoubleAsInt32:
1629         case ValueToInt32:
1630         case DoubleRep:
1631         case ValueRep:
1632         case Int52Rep:
1633         case Int52Constant:
1634         case Identity: // This should have been cleaned up.
1635         case BooleanToNumber:
1636         case PhantomNewObject:
1637         case PhantomNewFunction:
1638         case PhantomNewGeneratorFunction:
1639         case PhantomNewAsyncGeneratorFunction:
1640         case PhantomNewAsyncFunction:
1641         case PhantomCreateActivation:
1642         case PhantomDirectArguments:
1643         case PhantomCreateRest:
1644         case PhantomSpread:
1645         case PhantomNewArrayWithSpread:
1646         case PhantomClonedArguments:
1647         case GetMyArgumentByVal:
1648         case GetMyArgumentByValOutOfBounds:
1649         case GetVectorLength:
1650         case PutHint:
1651         case CheckStructureImmediate:
1652         case CheckStructureOrEmpty:
1653         case MaterializeNewObject:
1654         case MaterializeCreateActivation:
1655         case PutStack:
1656         case KillStack:
1657         case GetStack:
1658         case StoreBarrier:
1659         case FencedStoreBarrier:
1660         case GetRegExpObjectLastIndex:
1661         case SetRegExpObjectLastIndex:
1662         case RecordRegExpCachedResult:
1663             // These are just nodes that we don't currently expect to see during fixup.
1664             // If we ever wanted to insert them prior to fixup, then we just have to create
1665             // fixup rules for them.
1666             DFG_CRASH(m_graph, node, "Unexpected node during fixup");
1667             break;
1668
1669         case PutGlobalVariable: {
1670             fixEdge<CellUse>(node->child1());
1671             speculateForBarrier(node->child2());
1672             break;
1673         }
1674
1675         case IsObject:
1676             if (node->child1()->shouldSpeculateObject()) {
1677                 m_insertionSet.insertNode(
1678                     m_indexInBlock, SpecNone, Check, node->origin,
1679                     Edge(node->child1().node(), ObjectUse));
1680                 m_graph.convertToConstant(node, jsBoolean(true));
1681                 observeUseKindOnNode<ObjectUse>(node);
1682             }
1683             break;
1684
1685         case IsCellWithType: {
1686             fixupIsCellWithType(node);
1687             break;
1688         }
1689
1690         case GetEnumerableLength: {
1691             fixEdge<CellUse>(node->child1());
1692             break;
1693         }
1694         case HasGenericProperty: {
1695             fixEdge<CellUse>(node->child2());
1696             break;
1697         }
1698         case HasStructureProperty: {
1699             fixEdge<StringUse>(node->child2());
1700             fixEdge<KnownCellUse>(node->child3());
1701             break;
1702         }
1703         case HasIndexedProperty: {
1704             node->setArrayMode(
1705                 node->arrayMode().refine(
1706                     m_graph, node,
1707                     node->child1()->prediction(),
1708                     node->child2()->prediction(),
1709                     SpecNone));
1710             
1711             blessArrayOperation(node->child1(), node->child2(), node->child3());
1712             fixEdge<CellUse>(node->child1());
1713             fixEdge<KnownInt32Use>(node->child2());
1714             break;
1715         }
1716         case GetDirectPname: {
1717             Edge& base = m_graph.varArgChild(node, 0);
1718             Edge& property = m_graph.varArgChild(node, 1);
1719             Edge& index = m_graph.varArgChild(node, 2);
1720             Edge& enumerator = m_graph.varArgChild(node, 3);
1721             fixEdge<CellUse>(base);
1722             fixEdge<KnownCellUse>(property);
1723             fixEdge<KnownInt32Use>(index);
1724             fixEdge<KnownCellUse>(enumerator);
1725             break;
1726         }
1727         case GetPropertyEnumerator: {
1728             fixEdge<CellUse>(node->child1());
1729             break;
1730         }
1731         case GetEnumeratorStructurePname: {
1732             fixEdge<KnownCellUse>(node->child1());
1733             fixEdge<KnownInt32Use>(node->child2());
1734             break;
1735         }
1736         case GetEnumeratorGenericPname: {
1737             fixEdge<KnownCellUse>(node->child1());
1738             fixEdge<KnownInt32Use>(node->child2());
1739             break;
1740         }
1741         case ToIndexString: {
1742             fixEdge<KnownInt32Use>(node->child1());
1743             break;
1744         }
1745         case ProfileType: {
1746             // We want to insert type checks based on the instructionTypeSet of the TypeLocation, not the globalTypeSet.
1747             // Because the instructionTypeSet is contained in globalTypeSet, if we produce a type check for
1748             // type T for the instructionTypeSet, the global type set must also have information for type T.
1749             // So if it the type check succeeds for type T in the instructionTypeSet, a type check for type T 
1750             // in the globalTypeSet would've also succeeded.
1751             // (The other direction does not hold in general).
1752
1753             RefPtr<TypeSet> typeSet = node->typeLocation()->m_instructionTypeSet;
1754             RuntimeTypeMask seenTypes = typeSet->seenTypes();
1755             if (typeSet->doesTypeConformTo(TypeAnyInt)) {
1756                 if (node->child1()->shouldSpeculateInt32()) {
1757                     fixEdge<Int32Use>(node->child1());
1758                     node->remove();
1759                     break;
1760                 }
1761
1762                 if (enableInt52()) {
1763                     fixEdge<AnyIntUse>(node->child1());
1764                     node->remove();
1765                     break;
1766                 }
1767
1768                 // Must not perform fixEdge<NumberUse> here since the type set only includes TypeAnyInt. Double values should be logged.
1769             }
1770
1771             if (typeSet->doesTypeConformTo(TypeNumber | TypeAnyInt)) {
1772                 fixEdge<NumberUse>(node->child1());
1773                 node->remove();
1774             } else if (typeSet->doesTypeConformTo(TypeString)) {
1775                 fixEdge<StringUse>(node->child1());
1776                 node->remove();
1777             } else if (typeSet->doesTypeConformTo(TypeBoolean)) {
1778                 fixEdge<BooleanUse>(node->child1());
1779                 node->remove();
1780             } else if (typeSet->doesTypeConformTo(TypeUndefined | TypeNull) && (seenTypes & TypeUndefined) && (seenTypes & TypeNull)) {
1781                 fixEdge<OtherUse>(node->child1());
1782                 node->remove();
1783             } else if (typeSet->doesTypeConformTo(TypeObject)) {
1784                 StructureSet set;
1785                 {
1786                     ConcurrentJSLocker locker(typeSet->m_lock);
1787                     set = typeSet->structureSet(locker);
1788                 }
1789                 if (!set.isEmpty()) {
1790                     fixEdge<CellUse>(node->child1());
1791                     node->convertToCheckStructure(m_graph.addStructureSet(set));
1792                 }
1793             }
1794
1795             break;
1796         }
1797
1798         case CreateClonedArguments: {
1799             watchHavingABadTime(node);
1800             break;
1801         }
1802
1803         case CreateScopedArguments:
1804         case CreateActivation:
1805         case NewFunction:
1806         case NewGeneratorFunction:
1807         case NewAsyncGeneratorFunction:
1808         case NewAsyncFunction: {
1809             // Child 1 is always the current scope, which is guaranteed to be an object
1810             // FIXME: should be KnownObjectUse once that exists (https://bugs.webkit.org/show_bug.cgi?id=175689)
1811             fixEdge<KnownCellUse>(node->child1());
1812             break;
1813         }
1814
1815         case PushWithScope: {
1816             // Child 1 is always the current scope, which is guaranteed to be an object
1817             // FIXME: should be KnownObjectUse once that exists (https://bugs.webkit.org/show_bug.cgi?id=175689)
1818             fixEdge<KnownCellUse>(node->child1());
1819             if (node->child2()->shouldSpeculateObject())
1820                 fixEdge<ObjectUse>(node->child2());
1821             break;
1822         }
1823
1824         case SetFunctionName: {
1825             // The first child is guaranteed to be a cell because op_set_function_name is only used
1826             // on a newly instantiated function object (the first child).
1827             fixEdge<KnownCellUse>(node->child1());
1828             fixEdge<UntypedUse>(node->child2());
1829             break;
1830         }
1831
1832         case CreateRest: {
1833             watchHavingABadTime(node);
1834             fixEdge<KnownInt32Use>(node->child1());
1835             break;
1836         }
1837
1838         case ResolveScopeForHoistingFuncDeclInEval: {
1839             fixEdge<KnownCellUse>(node->child1());
1840             break;
1841         }
1842         case ResolveScope:
1843         case GetDynamicVar:
1844         case PutDynamicVar: {
1845             fixEdge<KnownCellUse>(node->child1());
1846             break;
1847         }
1848
1849         case LogShadowChickenPrologue: {
1850             fixEdge<KnownCellUse>(node->child1());
1851             break;
1852         }
1853         case LogShadowChickenTail: {
1854             fixEdge<UntypedUse>(node->child1());
1855             fixEdge<KnownCellUse>(node->child2());
1856             break;
1857         }
1858
1859         case GetMapBucket:
1860             if (node->child1().useKind() == MapObjectUse)
1861                 fixEdge<MapObjectUse>(node->child1());
1862             else if (node->child1().useKind() == SetObjectUse)
1863                 fixEdge<SetObjectUse>(node->child1());
1864             else
1865                 RELEASE_ASSERT_NOT_REACHED();
1866
1867 #if USE(JSVALUE64)
1868             if (node->child2()->shouldSpeculateBoolean())
1869                 fixEdge<BooleanUse>(node->child2());
1870             else if (node->child2()->shouldSpeculateInt32())
1871                 fixEdge<Int32Use>(node->child2());
1872             else if (node->child2()->shouldSpeculateSymbol())
1873                 fixEdge<SymbolUse>(node->child2());
1874             else if (node->child2()->shouldSpeculateObject())
1875                 fixEdge<ObjectUse>(node->child2());
1876             else if (node->child2()->shouldSpeculateString())
1877                 fixEdge<StringUse>(node->child2());
1878             else if (node->child2()->shouldSpeculateCell())
1879                 fixEdge<CellUse>(node->child2());
1880             else
1881                 fixEdge<UntypedUse>(node->child2());
1882 #else
1883             fixEdge<UntypedUse>(node->child2());
1884 #endif // USE(JSVALUE64)
1885
1886             fixEdge<Int32Use>(node->child3());
1887             break;
1888
1889         case GetMapBucketHead:
1890             if (node->child1().useKind() == MapObjectUse)
1891                 fixEdge<MapObjectUse>(node->child1());
1892             else if (node->child1().useKind() == SetObjectUse)
1893                 fixEdge<SetObjectUse>(node->child1());
1894             else
1895                 RELEASE_ASSERT_NOT_REACHED();
1896             break;
1897
1898         case GetMapBucketNext:
1899         case LoadKeyFromMapBucket:
1900         case LoadValueFromMapBucket:
1901             fixEdge<CellUse>(node->child1());
1902             break;
1903
1904         case MapHash: {
1905 #if USE(JSVALUE64)
1906             if (node->child1()->shouldSpeculateBoolean()) {
1907                 fixEdge<BooleanUse>(node->child1());
1908                 break;
1909             }
1910
1911             if (node->child1()->shouldSpeculateInt32()) {
1912                 fixEdge<Int32Use>(node->child1());
1913                 break;
1914             }
1915
1916             if (node->child1()->shouldSpeculateSymbol()) {
1917                 fixEdge<SymbolUse>(node->child1());
1918                 break;
1919             }
1920
1921             if (node->child1()->shouldSpeculateObject()) {
1922                 fixEdge<ObjectUse>(node->child1());
1923                 break;
1924             }
1925
1926             if (node->child1()->shouldSpeculateString()) {
1927                 fixEdge<StringUse>(node->child1());
1928                 break;
1929             }
1930
1931             if (node->child1()->shouldSpeculateCell()) {
1932                 fixEdge<CellUse>(node->child1());
1933                 break;
1934             }
1935
1936             fixEdge<UntypedUse>(node->child1());
1937 #else
1938             fixEdge<UntypedUse>(node->child1());
1939 #endif // USE(JSVALUE64)
1940             break;
1941         }
1942
1943         case WeakMapGet: {
1944             fixEdge<WeakMapObjectUse>(node->child1());
1945             fixEdge<ObjectUse>(node->child2());
1946             fixEdge<Int32Use>(node->child3());
1947             break;
1948         }
1949
1950         case SetAdd: {
1951             fixEdge<SetObjectUse>(node->child1());
1952             fixEdge<Int32Use>(node->child3());
1953             break;
1954         }
1955
1956         case MapSet: {
1957             fixEdge<MapObjectUse>(m_graph.varArgChild(node, 0));
1958             fixEdge<Int32Use>(m_graph.varArgChild(node, 3));
1959             break;
1960         }
1961
1962         case DefineDataProperty: {
1963             fixEdge<CellUse>(m_graph.varArgChild(node, 0));
1964             Edge& propertyEdge = m_graph.varArgChild(node, 1);
1965             if (propertyEdge->shouldSpeculateSymbol())
1966                 fixEdge<SymbolUse>(propertyEdge);
1967             else if (propertyEdge->shouldSpeculateStringIdent())
1968                 fixEdge<StringIdentUse>(propertyEdge);
1969             else if (propertyEdge->shouldSpeculateString())
1970                 fixEdge<StringUse>(propertyEdge);
1971             else
1972                 fixEdge<UntypedUse>(propertyEdge);
1973             fixEdge<UntypedUse>(m_graph.varArgChild(node, 2));
1974             fixEdge<KnownInt32Use>(m_graph.varArgChild(node, 3));
1975             break;
1976         }
1977
1978         case StringSlice: {
1979             fixEdge<StringUse>(node->child1());
1980             fixEdge<Int32Use>(node->child2());
1981             if (node->child3())
1982                 fixEdge<Int32Use>(node->child3());
1983             break;
1984         }
1985
1986         case ToLowerCase: {
1987             // We currently only support StringUse since that will ensure that
1988             // ToLowerCase is a pure operation. If we decide to update this with
1989             // more types in the future, we need to ensure that the clobberize rules
1990             // are correct.
1991             fixEdge<StringUse>(node->child1());
1992             break;
1993         }
1994
1995         case NumberToStringWithRadix: {
1996             if (node->child1()->shouldSpeculateInt32())
1997                 fixEdge<Int32Use>(node->child1());
1998             else if (enableInt52() && node->child1()->shouldSpeculateAnyInt())
1999                 fixEdge<Int52RepUse>(node->child1());
2000             else
2001                 fixEdge<DoubleRepUse>(node->child1());
2002             fixEdge<Int32Use>(node->child2());
2003             break;
2004         }
2005
2006         case DefineAccessorProperty: {
2007             fixEdge<CellUse>(m_graph.varArgChild(node, 0));
2008             Edge& propertyEdge = m_graph.varArgChild(node, 1);
2009             if (propertyEdge->shouldSpeculateSymbol())
2010                 fixEdge<SymbolUse>(propertyEdge);
2011             else if (propertyEdge->shouldSpeculateStringIdent())
2012                 fixEdge<StringIdentUse>(propertyEdge);
2013             else if (propertyEdge->shouldSpeculateString())
2014                 fixEdge<StringUse>(propertyEdge);
2015             else
2016                 fixEdge<UntypedUse>(propertyEdge);
2017             fixEdge<CellUse>(m_graph.varArgChild(node, 2));
2018             fixEdge<CellUse>(m_graph.varArgChild(node, 3));
2019             fixEdge<KnownInt32Use>(m_graph.varArgChild(node, 4));
2020             break;
2021         }
2022
2023         case CheckSubClass: {
2024             fixupCheckSubClass(node);
2025             break;
2026         }
2027
2028         case CallDOMGetter: {
2029             DOMJIT::CallDOMGetterSnippet* snippet = node->callDOMGetterData()->snippet;
2030             fixEdge<CellUse>(node->child1()); // DOM.
2031             if (snippet && snippet->requireGlobalObject)
2032                 fixEdge<KnownCellUse>(node->child2()); // GlobalObject.
2033             break;
2034         }
2035
2036         case CallDOM: {
2037             fixupCallDOM(node);
2038             break;
2039         }
2040
2041         case Call: {
2042             attemptToMakeCallDOM(node);
2043             break;
2044         }
2045
2046         case ParseInt: {
2047             if (node->child1()->shouldSpeculateInt32() && !node->child2()) {
2048                 fixEdge<Int32Use>(node->child1());
2049                 node->convertToIdentity();
2050                 break;
2051             }
2052
2053             if (node->child1()->shouldSpeculateString()) {
2054                 fixEdge<StringUse>(node->child1());
2055                 node->clearFlags(NodeMustGenerate);
2056             }
2057
2058             if (node->child2())
2059                 fixEdge<Int32Use>(node->child2());
2060
2061             break;
2062         }
2063
2064         case IdentityWithProfile: {
2065             node->clearFlags(NodeMustGenerate);
2066             break;
2067         }
2068
2069         case ThrowStaticError:
2070             fixEdge<StringUse>(node->child1());
2071             break;
2072
2073 #if !ASSERT_DISABLED
2074         // Have these no-op cases here to ensure that nobody forgets to add handlers for new opcodes.
2075         case SetArgument:
2076         case JSConstant:
2077         case LazyJSConstant:
2078         case DoubleConstant:
2079         case GetLocal:
2080         case GetCallee:
2081         case GetArgumentCountIncludingThis:
2082         case GetRestLength:
2083         case GetArgument:
2084         case Flush:
2085         case PhantomLocal:
2086         case GetLocalUnlinked:
2087         case GetGlobalVar:
2088         case GetGlobalLexicalVariable:
2089         case NotifyWrite:
2090         case DirectCall:
2091         case CheckTypeInfoFlags:
2092         case TailCallInlinedCaller:
2093         case DirectTailCallInlinedCaller:
2094         case Construct:
2095         case DirectConstruct:
2096         case CallVarargs:
2097         case CallEval:
2098         case TailCallVarargsInlinedCaller:
2099         case ConstructVarargs:
2100         case CallForwardVarargs:
2101         case ConstructForwardVarargs:
2102         case TailCallForwardVarargs:
2103         case TailCallForwardVarargsInlinedCaller:
2104         case LoadVarargs:
2105         case ForwardVarargs:
2106         case ProfileControlFlow:
2107         case NewObject:
2108         case NewRegexp:
2109         case DeleteById:
2110         case DeleteByVal:
2111         case IsTypedArrayView:
2112         case IsEmpty:
2113         case IsUndefined:
2114         case IsBoolean:
2115         case IsNumber:
2116         case IsObjectOrNull:
2117         case IsFunction:
2118         case CreateDirectArguments:
2119         case Jump:
2120         case Return:
2121         case TailCall:
2122         case DirectTailCall:
2123         case TailCallVarargs:
2124         case Throw:
2125         case CountExecution:
2126         case SuperSamplerBegin:
2127         case SuperSamplerEnd:
2128         case ForceOSRExit:
2129         case CheckBadCell:
2130         case CheckNotEmpty:
2131         case CheckTraps:
2132         case Unreachable:
2133         case ExtractOSREntryLocal:
2134         case ExtractCatchLocal:
2135         case LoopHint:
2136         case MovHint:
2137         case InitializeEntrypointArguments:
2138         case ZombieHint:
2139         case ExitOK:
2140         case BottomValue:
2141         case TypeOf:
2142         case PutByIdWithThis:
2143         case PutByValWithThis:
2144         case GetByValWithThis:
2145         case CompareEqPtr:
2146         case NumberToStringWithValidRadixConstant:
2147         case GetGlobalThis:
2148         case CPUIntrinsic:
2149             break;
2150 #else
2151         default:
2152             break;
2153 #endif
2154         }
2155     }
2156
2157     void watchHavingABadTime(Node* node)
2158     {
2159         JSGlobalObject* globalObject = m_graph.globalObjectFor(node->origin.semantic);
2160
2161         // If this global object is not having a bad time, watch it. We go down this path anytime the code
2162         // does an array allocation. The types of array allocations may change if we start to have a bad
2163         // time. It's easier to reason about this if we know that whenever the types change after we start
2164         // optimizing, the code just gets thrown out. Doing this at FixupPhase is just early enough, since
2165         // prior to this point nobody should have been doing optimizations based on the indexing type of
2166         // the allocation.
2167         if (!globalObject->isHavingABadTime()) {
2168             m_graph.watchpoints().addLazily(globalObject->havingABadTimeWatchpoint());
2169             m_graph.freeze(globalObject);
2170         }
2171     }
2172     
2173     template<UseKind useKind>
2174     void createToString(Node* node, Edge& edge)
2175     {
2176         Node* toString = m_insertionSet.insertNode(
2177             m_indexInBlock, SpecString, ToString, node->origin,
2178             Edge(edge.node(), useKind));
2179         switch (useKind) {
2180         case Int32Use:
2181         case Int52RepUse:
2182         case DoubleRepUse:
2183         case NotCellUse:
2184             toString->clearFlags(NodeMustGenerate);
2185             break;
2186         default:
2187             break;
2188         }
2189         edge.setNode(toString);
2190     }
2191     
2192     template<UseKind useKind>
2193     void attemptToForceStringArrayModeByToStringConversion(ArrayMode& arrayMode, Node* node)
2194     {
2195         ASSERT(arrayMode == ArrayMode(Array::Generic));
2196         
2197         if (!m_graph.canOptimizeStringObjectAccess(node->origin.semantic))
2198             return;
2199         
2200         createToString<useKind>(node, node->child1());
2201         arrayMode = ArrayMode(Array::String);
2202     }
2203     
2204     template<UseKind useKind>
2205     bool isStringObjectUse()
2206     {
2207         switch (useKind) {
2208         case StringObjectUse:
2209         case StringOrStringObjectUse:
2210             return true;
2211         default:
2212             return false;
2213         }
2214     }
2215     
2216     template<UseKind useKind>
2217     void convertStringAddUse(Node* node, Edge& edge)
2218     {
2219         if (useKind == StringUse) {
2220             observeUseKindOnNode<StringUse>(edge.node());
2221             m_insertionSet.insertNode(
2222                 m_indexInBlock, SpecNone, Check, node->origin,
2223                 Edge(edge.node(), StringUse));
2224             edge.setUseKind(KnownStringUse);
2225             return;
2226         }
2227         
2228         observeUseKindOnNode<useKind>(edge.node());
2229         createToString<useKind>(node, edge);
2230     }
2231     
2232     void convertToMakeRope(Node* node)
2233     {
2234         node->setOpAndDefaultFlags(MakeRope);
2235         fixupMakeRope(node);
2236     }
2237     
2238     void fixupMakeRope(Node* node)
2239     {
2240         for (unsigned i = 0; i < AdjacencyList::Size; ++i) {
2241             Edge& edge = node->children.child(i);
2242             if (!edge)
2243                 break;
2244             edge.setUseKind(KnownStringUse);
2245             JSString* string = edge->dynamicCastConstant<JSString*>(vm());
2246             if (!string)
2247                 continue;
2248             if (string->length())
2249                 continue;
2250             
2251             // Don't allow the MakeRope to have zero children.
2252             if (!i && !node->child2())
2253                 break;
2254             
2255             node->children.removeEdge(i--);
2256         }
2257         
2258         if (!node->child2()) {
2259             ASSERT(!node->child3());
2260             node->convertToIdentity();
2261         }
2262     }
2263
2264     void fixupIsCellWithType(Node* node)
2265     {
2266         switch (node->speculatedTypeForQuery()) {
2267         case SpecString:
2268             if (node->child1()->shouldSpeculateString()) {
2269                 m_insertionSet.insertNode(
2270                     m_indexInBlock, SpecNone, Check, node->origin,
2271                     Edge(node->child1().node(), StringUse));
2272                 m_graph.convertToConstant(node, jsBoolean(true));
2273                 observeUseKindOnNode<StringUse>(node);
2274                 return;
2275             }
2276             break;
2277
2278         case SpecProxyObject:
2279             if (node->child1()->shouldSpeculateProxyObject()) {
2280                 m_insertionSet.insertNode(
2281                     m_indexInBlock, SpecNone, Check, node->origin,
2282                     Edge(node->child1().node(), ProxyObjectUse));
2283                 m_graph.convertToConstant(node, jsBoolean(true));
2284                 observeUseKindOnNode<ProxyObjectUse>(node);
2285                 return;
2286             }
2287             break;
2288
2289         case SpecRegExpObject:
2290             if (node->child1()->shouldSpeculateRegExpObject()) {
2291                 m_insertionSet.insertNode(
2292                     m_indexInBlock, SpecNone, Check, node->origin,
2293                     Edge(node->child1().node(), RegExpObjectUse));
2294                 m_graph.convertToConstant(node, jsBoolean(true));
2295                 observeUseKindOnNode<RegExpObjectUse>(node);
2296                 return;
2297             }
2298             break;
2299
2300         case SpecArray:
2301             if (node->child1()->shouldSpeculateArray()) {
2302                 m_insertionSet.insertNode(
2303                     m_indexInBlock, SpecNone, Check, node->origin,
2304                     Edge(node->child1().node(), ArrayUse));
2305                 m_graph.convertToConstant(node, jsBoolean(true));
2306                 observeUseKindOnNode<ArrayUse>(node);
2307                 return;
2308             }
2309             break;
2310
2311         case SpecDerivedArray:
2312             if (node->child1()->shouldSpeculateDerivedArray()) {
2313                 m_insertionSet.insertNode(
2314                     m_indexInBlock, SpecNone, Check, node->origin,
2315                     Edge(node->child1().node(), DerivedArrayUse));
2316                 m_graph.convertToConstant(node, jsBoolean(true));
2317                 observeUseKindOnNode<DerivedArrayUse>(node);
2318                 return;
2319             }
2320             break;
2321         }
2322
2323         if (node->child1()->shouldSpeculateCell()) {
2324             fixEdge<CellUse>(node->child1());
2325             return;
2326         }
2327
2328         if (node->child1()->shouldSpeculateNotCell()) {
2329             m_insertionSet.insertNode(
2330                 m_indexInBlock, SpecNone, Check, node->origin,
2331                 Edge(node->child1().node(), NotCellUse));
2332             m_graph.convertToConstant(node, jsBoolean(false));
2333             observeUseKindOnNode<NotCellUse>(node);
2334             return;
2335         }
2336     }
2337
2338     void fixupGetPrototypeOf(Node* node)
2339     {
2340         // Reflect.getPrototypeOf only accepts Objects. For Reflect.getPrototypeOf, ByteCodeParser attaches ObjectUse edge filter before fixup phase.
2341         if (node->child1().useKind() != ObjectUse) {
2342             if (node->child1()->shouldSpeculateString()) {
2343                 insertCheck<StringUse>(node->child1().node());
2344                 m_graph.convertToConstant(node, m_graph.freeze(m_graph.globalObjectFor(node->origin.semantic)->stringPrototype()));
2345                 return;
2346             }
2347             if (node->child1()->shouldSpeculateInt32()) {
2348                 insertCheck<Int32Use>(node->child1().node());
2349                 m_graph.convertToConstant(node, m_graph.freeze(m_graph.globalObjectFor(node->origin.semantic)->numberPrototype()));
2350                 return;
2351             }
2352             if (enableInt52() && node->child1()->shouldSpeculateAnyInt()) {
2353                 insertCheck<Int52RepUse>(node->child1().node());
2354                 m_graph.convertToConstant(node, m_graph.freeze(m_graph.globalObjectFor(node->origin.semantic)->numberPrototype()));
2355                 return;
2356             }
2357             if (node->child1()->shouldSpeculateNumber()) {
2358                 insertCheck<NumberUse>(node->child1().node());
2359                 m_graph.convertToConstant(node, m_graph.freeze(m_graph.globalObjectFor(node->origin.semantic)->numberPrototype()));
2360                 return;
2361             }
2362             if (node->child1()->shouldSpeculateSymbol()) {
2363                 insertCheck<SymbolUse>(node->child1().node());
2364                 m_graph.convertToConstant(node, m_graph.freeze(m_graph.globalObjectFor(node->origin.semantic)->symbolPrototype()));
2365                 return;
2366             }
2367             if (node->child1()->shouldSpeculateBoolean()) {
2368                 insertCheck<BooleanUse>(node->child1().node());
2369                 m_graph.convertToConstant(node, m_graph.freeze(m_graph.globalObjectFor(node->origin.semantic)->booleanPrototype()));
2370                 return;
2371             }
2372         }
2373
2374         if (node->child1()->shouldSpeculateFinalObject()) {
2375             fixEdge<FinalObjectUse>(node->child1());
2376             node->clearFlags(NodeMustGenerate);
2377             return;
2378         }
2379         if (node->child1()->shouldSpeculateArray()) {
2380             fixEdge<ArrayUse>(node->child1());
2381             node->clearFlags(NodeMustGenerate);
2382             return;
2383         }
2384         if (node->child1()->shouldSpeculateFunction()) {
2385             fixEdge<FunctionUse>(node->child1());
2386             node->clearFlags(NodeMustGenerate);
2387             return;
2388         }
2389     }
2390
2391     void fixupToThis(Node* node)
2392     {
2393         ECMAMode ecmaMode = m_graph.executableFor(node->origin.semantic)->isStrictMode() ? StrictMode : NotStrictMode;
2394
2395         if (ecmaMode == StrictMode) {
2396             if (node->child1()->shouldSpeculateBoolean()) {
2397                 fixEdge<BooleanUse>(node->child1());
2398                 node->convertToIdentity();
2399                 return;
2400             }
2401
2402             if (node->child1()->shouldSpeculateInt32()) {
2403                 fixEdge<Int32Use>(node->child1());
2404                 node->convertToIdentity();
2405                 return;
2406             }
2407
2408             if (enableInt52() && node->child1()->shouldSpeculateAnyInt()) {
2409                 fixEdge<Int52RepUse>(node->child1());
2410                 node->convertToIdentity();
2411                 node->setResult(NodeResultInt52);
2412                 return;
2413             }
2414
2415             if (node->child1()->shouldSpeculateNumber()) {
2416                 fixEdge<DoubleRepUse>(node->child1());
2417                 node->convertToIdentity();
2418                 node->setResult(NodeResultDouble);
2419                 return;
2420             }
2421
2422             if (node->child1()->shouldSpeculateSymbol()) {
2423                 fixEdge<SymbolUse>(node->child1());
2424                 node->convertToIdentity();
2425                 return;
2426             }
2427
2428             if (node->child1()->shouldSpeculateStringIdent()) {
2429                 fixEdge<StringIdentUse>(node->child1());
2430                 node->convertToIdentity();
2431                 return;
2432             }
2433
2434             if (node->child1()->shouldSpeculateString()) {
2435                 fixEdge<StringUse>(node->child1());
2436                 node->convertToIdentity();
2437                 return;
2438             }
2439         }
2440
2441         if (node->child1()->shouldSpeculateOther()) {
2442             if (ecmaMode == StrictMode) {
2443                 fixEdge<OtherUse>(node->child1());
2444                 node->convertToIdentity();
2445                 return;
2446             }
2447
2448             m_insertionSet.insertNode(
2449                 m_indexInBlock, SpecNone, Check, node->origin,
2450                 Edge(node->child1().node(), OtherUse));
2451             observeUseKindOnNode<OtherUse>(node->child1().node());
2452             m_graph.convertToConstant(
2453                 node, m_graph.globalThisObjectFor(node->origin.semantic));
2454             return;
2455         }
2456
2457         // FIXME: This should cover other use cases but we don't have use kinds for them. It's not critical,
2458         // however, since we cover all the missing cases in constant folding.
2459         // https://bugs.webkit.org/show_bug.cgi?id=157213
2460         if (node->child1()->shouldSpeculateStringObject()) {
2461             fixEdge<StringObjectUse>(node->child1());
2462             node->convertToIdentity();
2463             return;
2464         }
2465
2466         if (isFinalObjectSpeculation(node->child1()->prediction())) {
2467             fixEdge<FinalObjectUse>(node->child1());
2468             node->convertToIdentity();
2469             return;
2470         }
2471     }
2472     
2473     void fixupToPrimitive(Node* node)
2474     {
2475         if (node->child1()->shouldSpeculateInt32()) {
2476             fixEdge<Int32Use>(node->child1());
2477             node->convertToIdentity();
2478             return;
2479         }
2480         
2481         if (node->child1()->shouldSpeculateString()) {
2482             fixEdge<StringUse>(node->child1());
2483             node->convertToIdentity();
2484             return;
2485         }
2486         
2487         if (node->child1()->shouldSpeculateStringObject()
2488             && m_graph.canOptimizeStringObjectAccess(node->origin.semantic)) {
2489             fixEdge<StringObjectUse>(node->child1());
2490             node->convertToToString();
2491             return;
2492         }
2493         
2494         if (node->child1()->shouldSpeculateStringOrStringObject()
2495             && m_graph.canOptimizeStringObjectAccess(node->origin.semantic)) {
2496             fixEdge<StringOrStringObjectUse>(node->child1());
2497             node->convertToToString();
2498             return;
2499         }
2500     }
2501
2502     void fixupToNumber(Node* node)
2503     {
2504         // If the prediction of the child is Number, we attempt to convert ToNumber to Identity.
2505         if (node->child1()->shouldSpeculateNumber()) {
2506             if (isInt32Speculation(node->getHeapPrediction())) {
2507                 // If the both predictions of this node and the child is Int32, we just convert ToNumber to Identity, that's simple.
2508                 if (node->child1()->shouldSpeculateInt32()) {
2509                     fixEdge<Int32Use>(node->child1());
2510                     node->convertToIdentity();
2511                     return;
2512                 }
2513
2514                 // The another case is that the predicted type of the child is Int32, but the heap prediction tell the users that this will produce non Int32 values.
2515                 // In that case, let's receive the child value as a Double value and convert it to Int32. This case happens in misc-bugs-847389-jpeg2000.
2516                 fixEdge<DoubleRepUse>(node->child1());
2517                 node->setOp(DoubleAsInt32);
2518                 if (bytecodeCanIgnoreNegativeZero(node->arithNodeFlags()))
2519                     node->setArithMode(Arith::CheckOverflow);
2520                 else
2521                     node->setArithMode(Arith::CheckOverflowAndNegativeZero);
2522                 return;
2523             }
2524
2525             fixEdge<DoubleRepUse>(node->child1());
2526             node->convertToIdentity();
2527             node->setResult(NodeResultDouble);
2528             return;
2529         }
2530
2531         fixEdge<UntypedUse>(node->child1());
2532         node->setResult(NodeResultJS);
2533     }
2534
2535     void fixupToObject(Node* node)
2536     {
2537         if (node->child1()->shouldSpeculateObject()) {
2538             fixEdge<ObjectUse>(node->child1());
2539             node->convertToIdentity();
2540             return;
2541         }
2542
2543         // ToObject(Null/Undefined) can throw an error. We can emit filters to convert ToObject to CallObjectConstructor.
2544
2545         JSGlobalObject* globalObject = m_graph.globalObjectFor(node->origin.semantic);
2546
2547         if (node->child1()->shouldSpeculateString()) {
2548             insertCheck<StringUse>(node->child1().node());
2549             fixEdge<KnownStringUse>(node->child1());
2550             node->convertToNewStringObject(m_graph.registerStructure(globalObject->stringObjectStructure()));
2551             return;
2552         }
2553
2554         if (node->child1()->shouldSpeculateSymbol()) {
2555             insertCheck<SymbolUse>(node->child1().node());
2556             node->convertToCallObjectConstructor(m_graph.freeze(globalObject));
2557             return;
2558         }
2559
2560         if (node->child1()->shouldSpeculateNumber()) {
2561             insertCheck<NumberUse>(node->child1().node());
2562             node->convertToCallObjectConstructor(m_graph.freeze(globalObject));
2563             return;
2564         }
2565
2566         if (node->child1()->shouldSpeculateBoolean()) {
2567             insertCheck<BooleanUse>(node->child1().node());
2568             node->convertToCallObjectConstructor(m_graph.freeze(globalObject));
2569             return;
2570         }
2571
2572         fixEdge<UntypedUse>(node->child1());
2573     }
2574
2575     void fixupCallObjectConstructor(Node* node)
2576     {
2577         if (node->child1()->shouldSpeculateObject()) {
2578             fixEdge<ObjectUse>(node->child1());
2579             node->convertToIdentity();
2580             return;
2581         }
2582
2583         if (node->child1()->shouldSpeculateString()) {
2584             auto* globalObject = jsCast<JSGlobalObject*>(node->cellOperand()->cell());
2585             insertCheck<StringUse>(node->child1().node());
2586             fixEdge<KnownStringUse>(node->child1());
2587             node->convertToNewStringObject(m_graph.registerStructure(globalObject->stringObjectStructure()));
2588             return;
2589         }
2590
2591         // While ToObject(Null/Undefined) throws an error, CallObjectConstructor(Null/Undefined) generates a new empty object.
2592         if (node->child1()->shouldSpeculateOther()) {
2593             insertCheck<OtherUse>(node->child1().node());
2594             node->convertToNewObject(m_graph.registerStructure(jsCast<JSGlobalObject*>(node->cellOperand()->cell())->objectStructureForObjectConstructor()));
2595             return;
2596         }
2597
2598         fixEdge<UntypedUse>(node->child1());
2599     }
2600     
2601     void fixupToStringOrCallStringConstructor(Node* node)
2602     {
2603         if (node->child1()->shouldSpeculateString()) {
2604             fixEdge<StringUse>(node->child1());
2605             node->convertToIdentity();
2606             return;
2607         }
2608         
2609         if (node->child1()->shouldSpeculateStringObject()
2610             && m_graph.canOptimizeStringObjectAccess(node->origin.semantic)) {
2611             fixEdge<StringObjectUse>(node->child1());
2612             return;
2613         }
2614         
2615         if (node->child1()->shouldSpeculateStringOrStringObject()
2616             && m_graph.canOptimizeStringObjectAccess(node->origin.semantic)) {
2617             fixEdge<StringOrStringObjectUse>(node->child1());
2618             return;
2619         }
2620         
2621         if (node->child1()->shouldSpeculateCell()) {
2622             fixEdge<CellUse>(node->child1());
2623             return;
2624         }
2625
2626         if (node->child1()->shouldSpeculateInt32()) {
2627             fixEdge<Int32Use>(node->child1());
2628             node->clearFlags(NodeMustGenerate);
2629             return;
2630         }
2631
2632         if (enableInt52() && node->child1()->shouldSpeculateAnyInt()) {
2633             fixEdge<Int52RepUse>(node->child1());
2634             node->clearFlags(NodeMustGenerate);
2635             return;
2636         }
2637
2638         if (node->child1()->shouldSpeculateNumber()) {
2639             fixEdge<DoubleRepUse>(node->child1());
2640             node->clearFlags(NodeMustGenerate);
2641             return;
2642         }
2643
2644         // ToString(Symbol) throws an error. So if the child1 can include Symbols,
2645         // we need to care about it in the clobberize. In the following case,
2646         // since NotCellUse edge filter is used and this edge filters Symbols,
2647         // we can say that ToString never throws an error!
2648         if (node->child1()->shouldSpeculateNotCell()) {
2649             fixEdge<NotCellUse>(node->child1());
2650             node->clearFlags(NodeMustGenerate);
2651             return;
2652         }
2653     }
2654
2655     bool attemptToMakeFastStringAdd(Node* node)
2656     {
2657         bool goodToGo = true;
2658         m_graph.doToChildren(
2659             node,
2660             [&] (Edge& edge) {
2661                 if (edge->shouldSpeculateString())
2662                     return;
2663                 if (m_graph.canOptimizeStringObjectAccess(node->origin.semantic)) {
2664                     if (edge->shouldSpeculateStringObject())
2665                         return;
2666                     if (edge->shouldSpeculateStringOrStringObject())
2667                         return;
2668                 }
2669                 goodToGo = false;
2670             });
2671         if (!goodToGo)
2672             return false;
2673
2674         m_graph.doToChildren(
2675             node,
2676             [&] (Edge& edge) {
2677                 if (edge->shouldSpeculateString()) {
2678                     convertStringAddUse<StringUse>(node, edge);
2679                     return;
2680                 }
2681                 ASSERT(m_graph.canOptimizeStringObjectAccess(node->origin.semantic));
2682                 if (edge->shouldSpeculateStringObject()) {
2683                     convertStringAddUse<StringObjectUse>(node, edge);
2684                     return;
2685                 }
2686                 if (edge->shouldSpeculateStringOrStringObject()) {
2687                     convertStringAddUse<StringOrStringObjectUse>(node, edge);
2688                     return;
2689                 }
2690                 RELEASE_ASSERT_NOT_REACHED();
2691             });
2692         
2693         convertToMakeRope(node);
2694         return true;
2695     }
2696
2697     void fixupGetAndSetLocalsInBlock(BasicBlock* block)
2698     {
2699         if (!block)
2700             return;
2701         ASSERT(block->isReachable);
2702         m_block = block;
2703         for (m_indexInBlock = 0; m_indexInBlock < block->size(); ++m_indexInBlock) {
2704             Node* node = m_currentNode = block->at(m_indexInBlock);
2705             if (node->op() != SetLocal && node->op() != GetLocal)
2706                 continue;
2707             
2708             VariableAccessData* variable = node->variableAccessData();
2709             switch (node->op()) {
2710             case GetLocal:
2711                 switch (variable->flushFormat()) {
2712                 case FlushedDouble:
2713                     node->setResult(NodeResultDouble);
2714                     break;
2715                 case FlushedInt52:
2716                     node->setResult(NodeResultInt52);
2717                     break;
2718                 default:
2719                     break;
2720                 }
2721                 break;
2722                 
2723             case SetLocal:
2724                 // NOTE: Any type checks we put here may get hoisted by fixupChecksInBlock(). So, if we
2725                 // add new type checking use kind for SetLocals, we need to modify that code as well.
2726                 
2727                 switch (variable->flushFormat()) {
2728                 case FlushedJSValue:
2729                     break;
2730                 case FlushedDouble:
2731                     fixEdge<DoubleRepUse>(node->child1());
2732                     break;
2733                 case FlushedInt32:
2734                     fixEdge<Int32Use>(node->child1());
2735                     break;
2736                 case FlushedInt52:
2737                     fixEdge<Int52RepUse>(node->child1());
2738                     break;
2739                 case FlushedCell:
2740                     fixEdge<CellUse>(node->child1());
2741                     break;
2742                 case FlushedBoolean:
2743                     fixEdge<BooleanUse>(node->child1());
2744                     break;
2745                 default:
2746                     RELEASE_ASSERT_NOT_REACHED();
2747                     break;
2748                 }
2749                 break;
2750                 
2751             default:
2752                 RELEASE_ASSERT_NOT_REACHED();
2753                 break;
2754             }
2755         }
2756         m_insertionSet.execute(block);
2757     }
2758     
2759     void addStringReplacePrimordialChecks(Node* searchRegExp)
2760     {
2761         Node* node = m_currentNode;
2762
2763         // Check that structure of searchRegExp is RegExp object
2764         m_insertionSet.insertNode(
2765             m_indexInBlock, SpecNone, Check, node->origin,
2766             Edge(searchRegExp, RegExpObjectUse));
2767
2768         auto emitPrimordialCheckFor = [&] (JSValue primordialProperty, UniquedStringImpl* propertyUID) {
2769             unsigned index = m_graph.identifiers().ensure(propertyUID);
2770
2771             Node* actualProperty = m_insertionSet.insertNode(
2772                 m_indexInBlock, SpecNone, TryGetById, node->origin,
2773                 OpInfo(index), OpInfo(SpecFunction), Edge(searchRegExp, CellUse));
2774
2775             m_insertionSet.insertNode(
2776                 m_indexInBlock, SpecNone, CheckCell, node->origin,
2777                 OpInfo(m_graph.freeze(primordialProperty)), Edge(actualProperty, CellUse));
2778         };
2779
2780         JSGlobalObject* globalObject = m_graph.globalObjectFor(node->origin.semantic);
2781
2782         // Check that searchRegExp.exec is the primordial RegExp.prototype.exec
2783         emitPrimordialCheckFor(globalObject->regExpProtoExecFunction(), vm().propertyNames->exec.impl());
2784         // Check that searchRegExp.global is the primordial RegExp.prototype.global
2785         emitPrimordialCheckFor(globalObject->regExpProtoGlobalGetter(), vm().propertyNames->global.impl());
2786         // Check that searchRegExp.unicode is the primordial RegExp.prototype.unicode
2787         emitPrimordialCheckFor(globalObject->regExpProtoUnicodeGetter(), vm().propertyNames->unicode.impl());
2788         // Check that searchRegExp[Symbol.match] is the primordial RegExp.prototype[Symbol.replace]
2789         emitPrimordialCheckFor(globalObject->regExpProtoSymbolReplaceFunction(), vm().propertyNames->replaceSymbol.impl());
2790     }
2791
2792     Node* checkArray(ArrayMode arrayMode, const NodeOrigin& origin, Node* array, Node* index, bool (*storageCheck)(const ArrayMode&) = canCSEStorage)
2793     {
2794         ASSERT(arrayMode.isSpecific());
2795         
2796         if (arrayMode.type() == Array::String) {
2797             m_insertionSet.insertNode(
2798                 m_indexInBlock, SpecNone, Check, origin, Edge(array, StringUse));
2799         } else {
2800             // Note that we only need to be using a structure check if we opt for SaneChain, since
2801             // that needs to protect against JSArray's __proto__ being changed.
2802             Structure* structure = arrayMode.originalArrayStructure(m_graph, origin.semantic);
2803         
2804             Edge indexEdge = index ? Edge(index, Int32Use) : Edge();
2805             
2806             if (arrayMode.doesConversion()) {
2807                 if (structure) {
2808                     m_insertionSet.insertNode(
2809                         m_indexInBlock, SpecNone, ArrayifyToStructure, origin,
2810                         OpInfo(m_graph.registerStructure(structure)), OpInfo(arrayMode.asWord()), Edge(array, CellUse), indexEdge);
2811                 } else {
2812                     m_insertionSet.insertNode(
2813                         m_indexInBlock, SpecNone, Arrayify, origin,
2814                         OpInfo(arrayMode.asWord()), Edge(array, CellUse), indexEdge);
2815                 }
2816             } else {
2817                 if (structure) {
2818                     m_insertionSet.insertNode(
2819                         m_indexInBlock, SpecNone, CheckStructure, origin,
2820                         OpInfo(m_graph.addStructureSet(structure)), Edge(array, CellUse));
2821                 } else {
2822                     m_insertionSet.insertNode(
2823                         m_indexInBlock, SpecNone, CheckArray, origin,
2824                         OpInfo(arrayMode.asWord()), Edge(array, CellUse));
2825                 }
2826             }
2827         }
2828         
2829         if (!storageCheck(arrayMode))
2830             return nullptr;
2831         
2832         if (arrayMode.usesButterfly()) {
2833             return m_insertionSet.insertNode(
2834                 m_indexInBlock, SpecNone, GetButterfly, origin, Edge(array, CellUse));
2835         }
2836         
2837         return m_insertionSet.insertNode(
2838             m_indexInBlock, SpecNone, GetIndexedPropertyStorage, origin,
2839             OpInfo(arrayMode.asWord()), Edge(array, KnownCellUse));
2840     }
2841     
2842     void blessArrayOperation(Edge base, Edge index, Edge& storageChild)
2843     {
2844         Node* node = m_currentNode;
2845         
2846         switch (node->arrayMode().type()) {
2847         case Array::ForceExit: {
2848             m_insertionSet.insertNode(
2849                 m_indexInBlock, SpecNone, ForceOSRExit, node->origin);
2850             return;
2851         }
2852             
2853         case Array::SelectUsingPredictions:
2854         case Array::Unprofiled:
2855             RELEASE_ASSERT_NOT_REACHED();
2856             return;
2857             
2858         case Array::Generic:
2859             return;
2860             
2861         default: {
2862             Node* storage = checkArray(node->arrayMode(), node->origin, base.node(), index.node());
2863             if (!storage)
2864                 return;
2865             
2866             storageChild = Edge(storage);
2867             return;
2868         } }
2869     }
2870     
2871     bool alwaysUnboxSimplePrimitives()
2872     {
2873 #if USE(JSVALUE64)
2874         return false;
2875 #else
2876         // Any boolean, int, or cell value is profitable to unbox on 32-bit because it
2877         // reduces traffic.
2878         return true;
2879 #endif
2880     }
2881
2882     template<UseKind useKind>
2883     void observeUseKindOnNode(Node* node)
2884     {
2885         if (useKind == UntypedUse)
2886             return;
2887         observeUseKindOnNode(node, useKind);
2888     }
2889
2890     void observeUseKindOnEdge(Edge edge)
2891     {
2892         observeUseKindOnNode(edge.node(), edge.useKind());
2893     }
2894
2895     void observeUseKindOnNode(Node* node, UseKind useKind)
2896     {
2897         if (node->op() != GetLocal)
2898             return;
2899         
2900         // FIXME: The way this uses alwaysUnboxSimplePrimitives() is suspicious.
2901         // https://bugs.webkit.org/show_bug.cgi?id=121518
2902         
2903         VariableAccessData* variable = node->variableAccessData();
2904         switch (useKind) {
2905         case Int32Use:
2906         case KnownInt32Use:
2907             if (alwaysUnboxSimplePrimitives()
2908                 || isInt32Speculation(variable->prediction()))
2909                 m_profitabilityChanged |= variable->mergeIsProfitableToUnbox(true);
2910             break;
2911         case NumberUse:
2912         case RealNumberUse:
2913         case DoubleRepUse:
2914         case DoubleRepRealUse:
2915             if (variable->doubleFormatState() == UsingDoubleFormat)
2916                 m_profitabilityChanged |= variable->mergeIsProfitableToUnbox(true);
2917             break;
2918         case BooleanUse:
2919         case KnownBooleanUse:
2920             if (alwaysUnboxSimplePrimitives()
2921                 || isBooleanSpeculation(variable->prediction()))
2922                 m_profitabilityChanged |= variable->mergeIsProfitableToUnbox(true);
2923             break;
2924         case Int52RepUse:
2925             if (isAnyIntSpeculation(variable->prediction()))
2926                 m_profitabilityChanged |= variable->mergeIsProfitableToUnbox(true);
2927             break;
2928         case CellUse:
2929         case KnownCellUse:
2930         case ObjectUse:
2931         case FunctionUse:
2932         case StringUse:
2933         case KnownStringUse:
2934         case SymbolUse:
2935         case StringObjectUse:
2936         case StringOrStringObjectUse:
2937             if (alwaysUnboxSimplePrimitives()
2938                 || isCellSpeculation(variable->prediction()))
2939                 m_profitabilityChanged |= variable->mergeIsProfitableToUnbox(true);
2940             break;
2941         default:
2942             break;
2943         }
2944     }
2945     
2946     template<UseKind useKind>
2947     void fixEdge(Edge& edge)
2948     {
2949         observeUseKindOnNode<useKind>(edge.node());
2950         edge.setUseKind(useKind);
2951     }
2952     
2953     unsigned indexForChecks()
2954     {
2955         unsigned index = m_indexInBlock;
2956         while (!m_block->at(index)->origin.exitOK)
2957             index--;
2958         return index;
2959     }
2960     
2961     NodeOrigin originForCheck(unsigned index)
2962     {
2963         return m_block->at(index)->origin.withSemantic(m_currentNode->origin.semantic);
2964     }
2965     
2966     void speculateForBarrier(Edge value)
2967     {
2968         // Currently, the DFG won't take advantage of this speculation. But, we want to do it in
2969         // the DFG anyway because if such a speculation would be wrong, we want to know before
2970         // we do an expensive compile.
2971         
2972         if (value->shouldSpeculateInt32()) {
2973             insertCheck<Int32Use>(value.node());
2974             return;
2975         }
2976             
2977         if (value->shouldSpeculateBoolean()) {
2978             insertCheck<BooleanUse>(value.node());
2979             return;
2980         }
2981             
2982         if (value->shouldSpeculateOther()) {
2983             insertCheck<OtherUse>(value.node());
2984             return;
2985         }
2986             
2987         if (value->shouldSpeculateNumber()) {
2988             insertCheck<NumberUse>(value.node());
2989             return;
2990         }
2991             
2992         if (value->shouldSpeculateNotCell()) {
2993             insertCheck<NotCellUse>(value.node());
2994             return;
2995         }
2996     }
2997     
2998     template<UseKind useKind>
2999     void insertCheck(Node* node)
3000     {
3001         observeUseKindOnNode<useKind>(node);
3002         unsigned index = indexForChecks();
3003         m_insertionSet.insertNode(index, SpecNone, Check, originForCheck(index), Edge(node, useKind));
3004     }
3005
3006     void fixIntConvertingEdge(Edge& edge)
3007     {
3008         Node* node = edge.node();
3009         if (node->shouldSpeculateInt32OrBoolean()) {
3010             fixIntOrBooleanEdge(edge);
3011             return;
3012         }
3013         
3014         UseKind useKind;
3015         if (node->shouldSpeculateAnyInt())
3016             useKind = Int52RepUse;
3017         else if (node->shouldSpeculateNumber())
3018             useKind = DoubleRepUse;
3019         else
3020             useKind = NotCellUse;
3021         Node* newNode = m_insertionSet.insertNode(
3022             m_indexInBlock, SpecInt32Only, ValueToInt32, m_currentNode->origin,
3023             Edge(node, useKind));
3024         observeUseKindOnNode(node, useKind);
3025         
3026         edge = Edge(newNode, KnownInt32Use);
3027     }
3028     
3029     void fixIntOrBooleanEdge(Edge& edge)
3030     {
3031         Node* node = edge.node();
3032         if (!node->sawBooleans()) {
3033             fixEdge<Int32Use>(edge);
3034             return;
3035         }
3036         
3037         UseKind useKind;
3038         if (node->shouldSpeculateBoolean())
3039             useKind = BooleanUse;
3040         else
3041             useKind = UntypedUse;
3042         Node* newNode = m_insertionSet.insertNode(
3043             m_indexInBlock, SpecInt32Only, BooleanToNumber, m_currentNode->origin,
3044             Edge(node, useKind));
3045         observeUseKindOnNode(node, useKind);
3046         
3047         edge = Edge(newNode, Int32Use);
3048     }
3049     
3050     void fixDoubleOrBooleanEdge(Edge& edge)
3051     {
3052         Node* node = edge.node();
3053         if (!node->sawBooleans()) {
3054             fixEdge<DoubleRepUse>(edge);
3055             return;
3056         }
3057         
3058         UseKind useKind;
3059         if (node->shouldSpeculateBoolean())
3060             useKind = BooleanUse;
3061         else
3062             useKind = UntypedUse;
3063         Node* newNode = m_insertionSet.insertNode(
3064             m_indexInBlock, SpecInt32Only, BooleanToNumber, m_currentNode->origin,
3065             Edge(node, useKind));
3066         observeUseKindOnNode(node, useKind);
3067         
3068         edge = Edge(newNode, DoubleRepUse);
3069     }
3070     
3071     void truncateConstantToInt32(Edge& edge)
3072   &nb