dfg/DFGInsertionSet.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 DFGInsertionSet_h
  27 #define DFGInsectionSet_h
  28
  29 #include <wtf/Platform.h>
  30
  31 #if ENABLE(DFG_JIT)
  32
  33 #include <wtf/Vector.h>
  34
  35 namespace JSC { namespace DFG {
  36
  37 template<typename ElementType>
  38 class Insertion {
  39 public:
  40     Insertion() { }
  41
  42     Insertion(size_t index, const ElementType& element)
  43         : m_index(index)
  44         , m_element(element)
  45     {
  46     }
  47
  48     size_t index() const { return m_index; }
  49     const ElementType& element() const { return m_element; }
  50 private:
  51     size_t m_index;
  52     ElementType m_element;
  53 };
  54
  55 template<typename ElementType>
  56 class InsertionSet {
  57 public:
  58     InsertionSet() { }
  59
  60     void append(const Insertion<ElementType>& insertion)
  61     {
  62         ASSERT(!m_insertions.size() || m_insertions.last().index() <= insertion.index());
  63         m_insertions.append(insertion);
  64     }
  65
  66     void append(size_t index, const ElementType& element)
  67     {
  68         append(Insertion<ElementType>(index, element));
  69     }
  70
  71     template<typename CollectionType>
  72     void execute(CollectionType& collection)
  73     {
  74         if (!m_insertions.size())
  75             return;
  76         collection.grow(collection.size() + m_insertions.size());
  77         size_t lastIndex = collection.size();
  78         for (size_t indexInInsertions = m_insertions.size(); indexInInsertions--;) {
  79             Insertion<ElementType>& insertion = m_insertions[indexInInsertions];
  80             size_t firstIndex = insertion.index() + indexInInsertions;
  81             size_t indexOffset = indexInInsertions + 1;
  82             for (size_t i = lastIndex; i-- > firstIndex;)
  83                 collection[i] = collection[i - indexOffset];
  84             collection[firstIndex] = insertion.element();
  85             lastIndex = firstIndex;
  86         }
  87         m_insertions.resize(0);
  88     }
  89 private:
  90     Vector<Insertion<ElementType>, 8> m_insertions;
  91 };
  92
  93 } } // namespace JSC::DFG
  94
  95 #endif // ENABLE(DFG_JIT)
  96
  97 #endif // DFGInsertionSet_h
  98