dfg/DFGAtTailAbstractState.cpp

   1 /*
   2  * Copyright (C) 2013 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 "DFGAtTailAbstractState.h"
  28
  29 #if ENABLE(DFG_JIT)
  30
  31 #include "JSCInlines.h"
  32
  33 namespace JSC { namespace DFG {
  34
  35 AtTailAbstractState::AtTailAbstractState(Graph& graph)
  36     : m_graph(graph)
  37     , m_block(0)
  38 {
  39 }
  40
  41 AtTailAbstractState::~AtTailAbstractState() { }
  42
  43 void AtTailAbstractState::createValueForNode(Node* node)
  44 {
  45     m_block->ssa->valuesAtTail.add(node, AbstractValue());
  46 }
  47
  48 AbstractValue& AtTailAbstractState::forNode(Node* node)
  49 {
  50     HashMap<Node*, AbstractValue>::iterator iter = m_block->ssa->valuesAtTail.find(node);
  51     DFG_ASSERT(m_graph, node, iter != m_block->ssa->valuesAtTail.end());
  52     return iter->value;
  53 }
  54
  55 } } // namespace JSC::DFG
  56
  57 #endif // ENABLE(DFG_JIT)
  58