dfg/DFGInsertOSRHintsForUpdate.cpp

   1 /*
   2  * Copyright (C) 2014 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 "DFGInsertOSRHintsForUpdate.h"
  28
  29 #if ENABLE(DFG_JIT)
  30
  31 #include "JSCInlines.h"
  32
  33 namespace JSC { namespace DFG {
  34
  35 void insertOSRHintsForUpdate(
  36     InsertionSet& insertionSet, unsigned nodeIndex, NodeOrigin origin,
  37     AvailabilityMap& availability, Node* originalNode, Node* newNode)
  38 {
  39     for (unsigned i = availability.m_locals.size(); i--;) {
  40         int operand = availability.m_locals.operandForIndex(i);
  41
  42         if (availability.m_locals[i].hasNode() && availability.m_locals[i].node() == originalNode) {
  43             insertionSet.insertNode(
  44                 nodeIndex, SpecNone, MovHint, origin, OpInfo(operand),
  45                 newNode->defaultEdge());
  46         }
  47     }
  48
  49     for (auto pair : availability.m_heap) {
  50         if (pair.value.hasNode() && pair.value.node() == originalNode) {
  51             insertionSet.insert(
  52                 nodeIndex, pair.key.createHint(insertionSet.graph(), origin, newNode));
  53         }
  54     }
  55 }
  56
  57 } } // namespace JSC::DFG
  58
  59 #endif // ENABLE(DFG_JIT)
  60