| /** |
| * Licensed to the Apache Software Foundation (ASF) under one |
| * or more contributor license agreements. See the NOTICE file |
| * distributed with this work for additional information |
| * regarding copyright ownership. The ASF licenses this file |
| * to you under the Apache License, Version 2.0 (the |
| * "License"); you may not use this file except in compliance |
| * with the License. You may obtain a copy of the License at |
| * |
| * http://www.apache.org/licenses/LICENSE-2.0 |
| * |
| * Unless required by applicable law or agreed to in writing, |
| * software distributed under the License is distributed on an |
| * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY |
| * KIND, either express or implied. See the License for the |
| * specific language governing permissions and limitations |
| * under the License. |
| */ |
| #pragma once |
| |
| #if ENABLE(DFG_JIT) |
| |
| #include "DFGGraph.h" |
| #include <wtf/Insertion.h> |
| #include <wtf/Vector.h> |
| |
| namespace JSC { namespace DFG { |
| |
| typedef WTF::Insertion<Node*> Insertion; |
| |
| class InsertionSet { |
| public: |
| InsertionSet(Graph& graph) |
| : m_graph(graph) |
| { |
| } |
| |
| Graph& graph() { return m_graph; } |
| |
| // Adds another code insertion. It's expected that you'll usually insert things in order. If |
| // you don't, this function will perform a linear search to find the largest insertion point |
| // at which insertion order would be preserved. This is essentially equivalent to if you did |
| // a stable sort on the insertions. |
| Node* insert(const Insertion& insertion) |
| { |
| if (LIKELY(!m_insertions.size() || m_insertions.last().index() <= insertion.index())) |
| m_insertions.append(insertion); |
| else |
| insertSlow(insertion); |
| return insertion.element(); |
| } |
| |
| Node* insert(size_t index, Node* element) |
| { |
| return insert(Insertion(index, element)); |
| } |
| |
| template<typename... Params> |
| Node* insertNode(size_t index, SpeculatedType type, Params... params) |
| { |
| return insert(index, m_graph.addNode(type, params...)); |
| } |
| |
| Node* insertConstant( |
| size_t index, NodeOrigin origin, FrozenValue* value, |
| NodeType op = JSConstant) |
| { |
| return insertNode( |
| index, speculationFromValue(value->value()), op, origin, OpInfo(value)); |
| } |
| |
| Edge insertConstantForUse( |
| size_t index, NodeOrigin origin, FrozenValue* value, UseKind useKind) |
| { |
| NodeType op; |
| if (isDouble(useKind)) |
| op = DoubleConstant; |
| else if (useKind == Int52RepUse) |
| op = Int52Constant; |
| else |
| op = JSConstant; |
| return Edge(insertConstant(index, origin, value, op), useKind); |
| } |
| |
| Node* insertConstant(size_t index, NodeOrigin origin, JSValue value, NodeType op = JSConstant) |
| { |
| return insertConstant(index, origin, m_graph.freeze(value), op); |
| } |
| |
| Edge insertConstantForUse(size_t index, NodeOrigin origin, JSValue value, UseKind useKind) |
| { |
| return insertConstantForUse(index, origin, m_graph.freeze(value), useKind); |
| } |
| |
| Edge insertBottomConstantForUse(size_t index, NodeOrigin origin, UseKind useKind) |
| { |
| if (isDouble(useKind)) |
| return insertConstantForUse(index, origin, jsNumber(PNaN), useKind); |
| if (useKind == Int52RepUse) |
| return insertConstantForUse(index, origin, jsNumber(0), useKind); |
| return insertConstantForUse(index, origin, jsUndefined(), useKind); |
| } |
| |
| Node* insertCheck(size_t index, NodeOrigin origin, AdjacencyList children) |
| { |
| children = children.justChecks(); |
| if (children.isEmpty()) |
| return nullptr; |
| return insertNode(index, SpecNone, Check, origin, children); |
| } |
| |
| Node* insertCheck(size_t index, Node* node) |
| { |
| return insertCheck(index, node->origin, node->children); |
| } |
| |
| Node* insertCheck(size_t index, NodeOrigin origin, Edge edge) |
| { |
| if (edge.willHaveCheck()) |
| return insertNode(index, SpecNone, Check, origin, edge); |
| return nullptr; |
| } |
| |
| size_t execute(BasicBlock* block); |
| |
| private: |
| void insertSlow(const Insertion&); |
| |
| Graph& m_graph; |
| Vector<Insertion, 8> m_insertions; |
| }; |
| |
| } } // namespace JSC::DFG |
| |
| #endif // ENABLE(DFG_JIT) |