dfg/DFGClobberize.cpp

   1 /*
   2  * Copyright (C) 2013-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 "DFGClobberize.h"
  28
  29 #if ENABLE(DFG_JIT)
  30
  31 #include "JSCInlines.h"
  32
  33 namespace JSC { namespace DFG {
  34
  35 bool doesWrites(Graph& graph, Node* node)
  36 {
  37     NoOpClobberize noOp;
  38     CheckClobberize addWrite;
  39     clobberize(graph, node, noOp, addWrite, noOp);
  40     return addWrite.result();
  41 }
  42
  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
  51 bool writesOverlap(Graph& graph, Node* node, AbstractHeap heap)
  52 {
  53     NoOpClobberize noOp;
  54     AbstractHeapOverlaps addWrite(heap);
  55     clobberize(graph, node, noOp, addWrite, noOp);
  56     return addWrite.result();
  57 }
  58
  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
  78 } } // namespace JSC::DFG
  79
  80 #endif // ENABLE(DFG_JIT)
  81