]>
Commit | Line | Data |
---|---|---|
b37bf2e1 | 1 | /* |
ed1e77d3 | 2 | * Copyright (C) 2013-2015 Apple Inc. All rights reserved. |
b37bf2e1 A |
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 | * | |
9dae56ea | 13 | * THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY |
b37bf2e1 A |
14 | * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
15 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR | |
9dae56ea | 16 | * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR |
b37bf2e1 A |
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 | |
6fe7ccc8 | 23 | * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
b37bf2e1 A |
24 | */ |
25 | ||
81345200 A |
26 | #include "config.h" |
27 | #include "DFGClobberize.h" | |
6fe7ccc8 | 28 | |
81345200 | 29 | #if ENABLE(DFG_JIT) |
b37bf2e1 | 30 | |
81345200 | 31 | #include "JSCInlines.h" |
b37bf2e1 | 32 | |
81345200 | 33 | namespace JSC { namespace DFG { |
b37bf2e1 | 34 | |
81345200 A |
35 | bool doesWrites(Graph& graph, Node* node) |
36 | { | |
ed1e77d3 | 37 | NoOpClobberize noOp; |
81345200 | 38 | CheckClobberize addWrite; |
ed1e77d3 | 39 | clobberize(graph, node, noOp, addWrite, noOp); |
81345200 A |
40 | return addWrite.result(); |
41 | } | |
9dae56ea | 42 | |
ed1e77d3 A |
43 | bool accessesOverlap(Graph& graph, Node* node, AbstractHeap heap) |
44 | { | |
45 | NoOpClobberize noOp; | |
46 | AbstractHeapOverlaps addAccess(heap); | |
47 | clobberize(graph, node, addAccess, addAccess, noOp); | |
48 | return addAccess.result(); | |
49 | } | |
50 | ||
81345200 A |
51 | bool writesOverlap(Graph& graph, Node* node, AbstractHeap heap) |
52 | { | |
ed1e77d3 | 53 | NoOpClobberize noOp; |
81345200 | 54 | AbstractHeapOverlaps addWrite(heap); |
ed1e77d3 | 55 | clobberize(graph, node, noOp, addWrite, noOp); |
81345200 A |
56 | return addWrite.result(); |
57 | } | |
58 | ||
ed1e77d3 A |
59 | bool clobbersHeap(Graph& graph, Node* node) |
60 | { | |
61 | bool result = false; | |
62 | clobberize( | |
63 | graph, node, NoOpClobberize(), | |
64 | [&] (AbstractHeap heap) { | |
65 | switch (heap.kind()) { | |
66 | case World: | |
67 | case Heap: | |
68 | result = true; | |
69 | break; | |
70 | default: | |
71 | break; | |
72 | } | |
73 | }, | |
74 | NoOpClobberize()); | |
75 | return result; | |
76 | } | |
77 | ||
81345200 A |
78 | } } // namespace JSC::DFG |
79 | ||
80 | #endif // ENABLE(DFG_JIT) | |
6fe7ccc8 | 81 |