dfg/DFGMinifiedGraph.h

   1 /*
   2  * Copyright (C) 2012 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 #ifndef DFGMinifiedGraph_h
  27 #define DFGMinifiedGraph_h
  28
  29 #if ENABLE(DFG_JIT)
  30
  31 #include "DFGMinifiedNode.h"
  32 #include <algorithm>
  33 #include <wtf/StdLibExtras.h>
  34 #include <wtf/Vector.h>
  35
  36 namespace JSC { namespace DFG {
  37
  38 class MinifiedGraph {
  39 public:
  40     MinifiedGraph() { }
  41
  42     MinifiedNode* at(MinifiedID id)
  43     {
  44         return tryBinarySearch<MinifiedNode, MinifiedID>(
  45             m_list, m_list.size(), id, MinifiedNode::getID);
  46     }
  47
  48     void append(const MinifiedNode& node)
  49     {
  50         m_list.append(node);
  51     }
  52
  53     void prepareAndShrink()
  54     {
  55         std::sort(m_list.begin(), m_list.end(), MinifiedNode::compareByNodeIndex);
  56         m_list.shrinkToFit();
  57     }
  58
  59 private:
  60     Vector<MinifiedNode> m_list;
  61 };
  62
  63 } } // namespace JSC::DFG
  64
  65 #endif // ENABLE(DFG_JIT)
  66
  67 #endif // DFGMinifiedGraph_h
  68