1/*
2 * Copyright (C) 2015-2017 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 "B3InsertionSet.h"
28
29#if ENABLE(B3_JIT)
30
31#include "B3BasicBlock.h"
32#include "B3ProcedureInlines.h"
33#include "B3ValueInlines.h"
34#include <wtf/BubbleSort.h>
35
36namespace JSC { namespace B3 {
37
38Value* InsertionSet::insertIntConstant(size_t index, Origin origin, Type type, int64_t value)
39{
40 return insertValue(index, m_procedure.addIntConstant(origin, type, value));
41}
42
43Value* InsertionSet::insertIntConstant(size_t index, Value* likeValue, int64_t value)
44{
45 return insertIntConstant(index, likeValue->origin(), likeValue->type(), value);
46}
47
48Value* InsertionSet::insertBottom(size_t index, Origin origin, Type type)
49{
50 Value*& bottom = m_bottomForType[type];
51 if (!bottom)
52 bottom = insertValue(index, m_procedure.addBottom(origin, type));
53 return bottom;
54}
55
56Value* InsertionSet::insertBottom(size_t index, Value* likeValue)
57{
58 return insertBottom(index, likeValue->origin(), likeValue->type());
59}
60
61Value* InsertionSet::insertClone(size_t index, Value* value)
62{
63 return insertValue(index, m_procedure.clone(value));
64}
65
66void InsertionSet::execute(BasicBlock* block)
67{
68 for (Insertion& insertion : m_insertions)
69 insertion.element()->owner = block;
70 bubbleSort(m_insertions.begin(), m_insertions.end());
71 executeInsertions(block->m_values, m_insertions);
72 m_bottomForType = TypeMap<Value*>();
73}
74
75} } // namespace JSC::B3
76
77#endif // ENABLE(B3_JIT)
78
79