| 1 | /*
|
|---|
| 2 | * Copyright (C) 2016 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 "DFGFlowIndexing.h"
|
|---|
| 28 |
|
|---|
| 29 | #if ENABLE(DFG_JIT)
|
|---|
| 30 |
|
|---|
| 31 | #include "JSCJSValueInlines.h"
|
|---|
| 32 |
|
|---|
| 33 | namespace JSC { namespace DFG {
|
|---|
| 34 |
|
|---|
| 35 | FlowIndexing::FlowIndexing(Graph& graph)
|
|---|
| 36 | : m_graph(graph)
|
|---|
| 37 | , m_numIndices(0)
|
|---|
| 38 | {
|
|---|
| 39 | recompute();
|
|---|
| 40 | }
|
|---|
| 41 |
|
|---|
| 42 | FlowIndexing::~FlowIndexing()
|
|---|
| 43 | {
|
|---|
| 44 | }
|
|---|
| 45 |
|
|---|
| 46 | void FlowIndexing::recompute()
|
|---|
| 47 | {
|
|---|
| 48 | unsigned numNodeIndices = m_graph.maxNodeCount();
|
|---|
| 49 |
|
|---|
| 50 | m_nodeIndexToShadowIndex.resize(numNodeIndices);
|
|---|
| 51 | m_nodeIndexToShadowIndex.fill(UINT_MAX);
|
|---|
| 52 |
|
|---|
| 53 | m_shadowIndexToNodeIndex.shrink(0);
|
|---|
| 54 |
|
|---|
| 55 | m_numIndices = numNodeIndices;
|
|---|
| 56 |
|
|---|
| 57 | for (BasicBlock* block : m_graph.blocksInNaturalOrder()) {
|
|---|
| 58 | for (Node* node : *block) {
|
|---|
| 59 | if (node->op() != Phi)
|
|---|
| 60 | continue;
|
|---|
| 61 |
|
|---|
| 62 | unsigned nodeIndex = node->index();
|
|---|
| 63 | unsigned shadowIndex = m_numIndices++;
|
|---|
| 64 | m_nodeIndexToShadowIndex[nodeIndex] = shadowIndex;
|
|---|
| 65 | m_shadowIndexToNodeIndex.append(nodeIndex);
|
|---|
| 66 | DFG_ASSERT(m_graph, nullptr, m_shadowIndexToNodeIndex.size() + numNodeIndices == m_numIndices);
|
|---|
| 67 | DFG_ASSERT(m_graph, nullptr, m_shadowIndexToNodeIndex[shadowIndex - numNodeIndices] == nodeIndex);
|
|---|
| 68 | }
|
|---|
| 69 | }
|
|---|
| 70 | }
|
|---|
| 71 |
|
|---|
| 72 | } } // namespace JSC::DFG
|
|---|
| 73 |
|
|---|
| 74 | #endif // ENABLE(DFG_JIT)
|
|---|
| 75 |
|
|---|
