| 1 | /*
|
|---|
| 2 | * Copyright (C) 2014, 2015 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 "DFGCleanUpPhase.h"
|
|---|
| 28 |
|
|---|
| 29 | #if ENABLE(DFG_JIT)
|
|---|
| 30 |
|
|---|
| 31 | #include "DFGGraph.h"
|
|---|
| 32 | #include "DFGPhase.h"
|
|---|
| 33 | #include "JSCJSValueInlines.h"
|
|---|
| 34 |
|
|---|
| 35 | namespace JSC { namespace DFG {
|
|---|
| 36 |
|
|---|
| 37 | class CleanUpPhase : public Phase {
|
|---|
| 38 | public:
|
|---|
| 39 | CleanUpPhase(Graph& graph)
|
|---|
| 40 | : Phase(graph, "clean up")
|
|---|
| 41 | {
|
|---|
| 42 | }
|
|---|
| 43 |
|
|---|
| 44 | bool run()
|
|---|
| 45 | {
|
|---|
| 46 | bool changed = false;
|
|---|
| 47 |
|
|---|
| 48 | for (BasicBlock* block : m_graph.blocksInNaturalOrder()) {
|
|---|
| 49 | unsigned sourceIndex = 0;
|
|---|
| 50 | unsigned targetIndex = 0;
|
|---|
| 51 | while (sourceIndex < block->size()) {
|
|---|
| 52 | Node* node = block->at(sourceIndex++);
|
|---|
| 53 | bool kill = false;
|
|---|
| 54 |
|
|---|
| 55 | if (node->op() == Check)
|
|---|
| 56 | node->children = node->children.justChecks();
|
|---|
| 57 |
|
|---|
| 58 | switch (node->op()) {
|
|---|
| 59 | case Phantom:
|
|---|
| 60 | case Check:
|
|---|
| 61 | if (node->children.isEmpty())
|
|---|
| 62 | kill = true;
|
|---|
| 63 | break;
|
|---|
| 64 | case CheckVarargs:
|
|---|
| 65 | kill = true;
|
|---|
| 66 | m_graph.doToChildren(node, [&] (Edge edge) {
|
|---|
| 67 | kill &= !edge;
|
|---|
| 68 | });
|
|---|
| 69 | break;
|
|---|
| 70 | default:
|
|---|
| 71 | break;
|
|---|
| 72 | }
|
|---|
| 73 |
|
|---|
| 74 | if (kill)
|
|---|
| 75 | m_graph.deleteNode(node);
|
|---|
| 76 | else
|
|---|
| 77 | block->at(targetIndex++) = node;
|
|---|
| 78 | }
|
|---|
| 79 | block->resize(targetIndex);
|
|---|
| 80 | }
|
|---|
| 81 |
|
|---|
| 82 | return changed;
|
|---|
| 83 | }
|
|---|
| 84 | };
|
|---|
| 85 |
|
|---|
| 86 | bool performCleanUp(Graph& graph)
|
|---|
| 87 | {
|
|---|
| 88 | return runPhase<CleanUpPhase>(graph);
|
|---|
| 89 | }
|
|---|
| 90 |
|
|---|
| 91 | } } // namespace JSC::DFG
|
|---|
| 92 |
|
|---|
| 93 | #endif // ENABLE(DFG_JIT)
|
|---|
| 94 |
|
|---|
