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#pragma once
27
28#if ENABLE(DFG_JIT)
29
30#include "DFGGraph.h"
31
32namespace JSC { namespace DFG {
33
34class EdgeDominates {
35 static const bool verbose = false;
36
37public:
38 EdgeDominates(Graph& graph, BasicBlock* block)
39 : m_graph(graph)
40 , m_block(block)
41 , m_result(true)
42 {
43 ASSERT(graph.m_form == SSA);
44 }
45
46 void operator()(Node*, Edge edge)
47 {
48 bool result = m_graph.m_ssaDominators->dominates(edge.node()->owner, m_block);
49 if (verbose) {
50 dataLog(
51 "Checking if ", edge, " in ", *edge.node()->owner,
52 " dominates ", *m_block, ": ", result, "\n");
53 }
54 m_result &= result;
55 }
56
57 bool result() const { return m_result; }
58
59private:
60 Graph& m_graph;
61 BasicBlock* m_block;
62 bool m_result;
63};
64
65inline bool edgesDominate(Graph& graph, Node* node, BasicBlock* block)
66{
67 EdgeDominates edgeDominates(graph, block);
68 DFG_NODE_DO_TO_CHILDREN(graph, node, edgeDominates);
69 return edgeDominates.result();
70}
71
72} } // namespace JSC::DFG
73
74#endif // ENABLE(DFG_JIT)
75