#pragma once
#if ENABLE(DFG_JIT)
#include "DFGFlowIndexing.h"
#include "DFGGraph.h"
#include "DFGNode.h"
namespace JSC { namespace DFG {
template<typename T>
class FlowMap {
public:
FlowMap(Graph& graph)
: m_graph(graph)
{
resize();
}
void resize()
{
m_map.resize(m_graph.maxNodeCount());
if (m_graph.m_form == SSA)
m_shadowMap.resize(m_graph.maxNodeCount());
}
Graph& graph() const { return m_graph; }
ALWAYS_INLINE T& at(unsigned nodeIndex)
{
return m_map[nodeIndex];
}
ALWAYS_INLINE T& at(Node* node)
{
return at(node->index());
}
ALWAYS_INLINE T& atShadow(unsigned nodeIndex)
{
return m_shadowMap[nodeIndex];
}
ALWAYS_INLINE T& atShadow(Node* node)
{
return atShadow(node->index());
}
ALWAYS_INLINE T& at(unsigned nodeIndex, NodeFlowProjection::Kind kind)
{
switch (kind) {
case NodeFlowProjection::Primary:
return at(nodeIndex);
case NodeFlowProjection::Shadow:
return atShadow(nodeIndex);
}
RELEASE_ASSERT_NOT_REACHED();
return *bitwise_cast<T*>(nullptr);
}
ALWAYS_INLINE T& at(Node* node, NodeFlowProjection::Kind kind)
{
return at(node->index(), kind);
}
ALWAYS_INLINE T& at(NodeFlowProjection projection)
{
return at(projection.node(), projection.kind());
}
ALWAYS_INLINE const T& at(unsigned nodeIndex) const { return const_cast<FlowMap*>(this)->at(nodeIndex); }
ALWAYS_INLINE const T& at(Node* node) const { return const_cast<FlowMap*>(this)->at(node); }
ALWAYS_INLINE const T& atShadow(unsigned nodeIndex) const { return const_cast<FlowMap*>(this)->atShadow(nodeIndex); }
ALWAYS_INLINE const T& atShadow(Node* node) const { return const_cast<FlowMap*>(this)->atShadow(node); }
ALWAYS_INLINE const T& at(unsigned nodeIndex, NodeFlowProjection::Kind kind) const { return const_cast<FlowMap*>(this)->at(nodeIndex, kind); }
ALWAYS_INLINE const T& at(Node* node, NodeFlowProjection::Kind kind) const { return const_cast<FlowMap*>(this)->at(node, kind); }
ALWAYS_INLINE const T& at(NodeFlowProjection projection) const { return const_cast<FlowMap*>(this)->at(projection); }
private:
Graph& m_graph;
Vector<T, 0, UnsafeVectorOverflow> m_map;
Vector<T, 0, UnsafeVectorOverflow> m_shadowMap;
};
} }
namespace WTF {
template<typename T>
void printInternal(PrintStream& out, const JSC::DFG::FlowMap<T>& map)
{
CommaPrinter comma;
for (unsigned i = 0; i < map.graph().maxNodeCount(); ++i) {
if (JSC::DFG::Node* node = map.graph().nodeAt(i)) {
if (const T& value = map.at(node))
out.print(comma, node, "=>", value);
}
}
for (unsigned i = 0; i < map.graph().maxNodeCount(); ++i) {
if (JSC::DFG::Node* node = map.graph().nodeAt(i)) {
if (const T& value = map.atShadow(node))
out.print(comma, "shadow(", node, ")=>", value);
}
}
}
}
#endif // ENABLE(DFG_JIT)