1/*
2 * Copyright (C) 2012, 2013 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 "DFGGraph.h"
34#include <wtf/Vector.h>
35
36namespace JSC { namespace DFG {
37
38class Insertion {
39public:
40    Insertion() { }
41
42    Insertion(size_t index, Node* element)
43        : m_index(index)
44        , m_element(element)
45    {
46    }
47
48    size_t index() const { return m_index; }
49    Node* element() const { return m_element; }
50private:
51    size_t m_index;
52    Node* m_element;
53};
54
55class InsertionSet {
56public:
57    InsertionSet(Graph& graph)
58        : m_graph(graph)
59    {
60    }
61
62    Node* insert(const Insertion& insertion)
63    {
64        ASSERT(!m_insertions.size() || m_insertions.last().index() <= insertion.index());
65        m_insertions.append(insertion);
66        return insertion.element();
67    }
68
69    Node* insert(size_t index, Node* element)
70    {
71        return insert(Insertion(index, element));
72    }
73
74#define DFG_DEFINE_INSERT_NODE(templatePre, templatePost, typeParams, valueParamsComma, valueParams, valueArgs) \
75    templatePre typeParams templatePost Node* insertNode(size_t index, SpeculatedType type valueParamsComma valueParams) \
76    { \
77        return insert(index, m_graph.addNode(type valueParamsComma valueArgs)); \
78    }
79    DFG_VARIADIC_TEMPLATE_FUNCTION(DFG_DEFINE_INSERT_NODE)
80#undef DFG_DEFINE_INSERT_NODE
81
82    void execute(BasicBlock* block)
83    {
84        if (!m_insertions.size())
85            return;
86        block->grow(block->size() + m_insertions.size());
87        size_t lastIndex = block->size();
88        for (size_t indexInInsertions = m_insertions.size(); indexInInsertions--;) {
89            Insertion& insertion = m_insertions[indexInInsertions];
90            size_t firstIndex = insertion.index() + indexInInsertions;
91            size_t indexOffset = indexInInsertions + 1;
92            for (size_t i = lastIndex; --i > firstIndex;)
93                block->at(i) = block->at(i - indexOffset);
94            block->at(firstIndex) = insertion.element();
95            lastIndex = firstIndex;
96        }
97        m_insertions.resize(0);
98    }
99private:
100    Graph& m_graph;
101    Vector<Insertion, 8> m_insertions;
102};
103
104} } // namespace JSC::DFG
105
106#endif // ENABLE(DFG_JIT)
107
108#endif // DFGInsertionSet_h
109
110