2 * Copyright (C) 2015-2016 Apple Inc. All rights reserved.
4 * Redistribution and use in source and binary forms, with or without
5 * modification, are permitted provided that the following conditions
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.
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.
30 #include "DFGBlockMap.h"
33 namespace JSC { namespace DFG {
35 // Returns the set of nodes live at tail, both due to due DFG and due to bytecode (i.e. OSR exit).
36 NodeSet liveNodesAtHead(Graph&, BasicBlock*);
38 // WARNING: This currently does not reason about the liveness of shadow values. The execution
39 // semantics of DFG SSA are that an Upsilon stores to the shadow value of a Phi, and the Phi loads
40 // from that shadow value. Hence, the shadow values are like variables, and have liveness. The normal
41 // liveness analysis will tell you about the liveness of shadow values. It's OK to ignore shadow
42 // values if you treat Upsilon as an opaque escape, and all of the clients of CombinedLiveness do so.
43 struct CombinedLiveness {
44 CombinedLiveness() { }
46 CombinedLiveness(Graph&);
48 BlockMap<NodeSet> liveAtHead;
49 BlockMap<NodeSet> liveAtTail;
52 } } // namespace JSC::DFG
54 #endif // ENABLE(DFG_JIT)