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#pragma once
27
28#if ENABLE(DFG_JIT)
29
30#include "DFGNode.h"
31#include <wtf/HashSet.h>
32#include <wtf/Vector.h>
33
34namespace JSC { namespace DFG {
35
36class Graph;
37
38class PhiChildren {
39 WTF_MAKE_FAST_ALLOCATED;
40public:
41 typedef Vector<Node*, 3> List;
42
43 PhiChildren();
44 PhiChildren(Graph&);
45 ~PhiChildren();
46
47 // The list of Upsilons that point to the children of the Phi.
48 const List& upsilonsOf(Node*) const;
49
50 template<typename Functor>
51 void forAllIncomingValues(Node* node, const Functor& functor)
52 {
53 for (Node* upsilon : upsilonsOf(node))
54 functor(upsilon->child1().node());
55 }
56
57 // This walks the Phi graph.
58 template<typename Functor>
59 void forAllTransitiveIncomingValues(Node* node, const Functor& functor)
60 {
61 if (node->op() != Phi) {
62 functor(node);
63 return;
64 }
65 HashSet<Node*> seen;
66 Vector<Node*> worklist;
67 seen.add(node);
68 worklist.append(node);
69 while (!worklist.isEmpty()) {
70 Node* currentNode = worklist.takeLast();
71 forAllIncomingValues(
72 currentNode,
73 [&] (Node* incomingNode) {
74 if (incomingNode->op() == Phi) {
75 if (seen.add(incomingNode).isNewEntry)
76 worklist.append(incomingNode);
77 } else
78 functor(incomingNode);
79 });
80 }
81 }
82
83private:
84 HashMap<Node*, List> m_children;
85};
86
87} } // namespace JSC::DFG
88
89#endif // ENABLE(DFG_JIT)
90