#include "config.h"
#include "DFGClobberSet.h"
#if ENABLE(DFG_JIT)
#include "DFGClobberize.h"
#include "JSCInlines.h"
#include <wtf/ListDump.h>
namespace JSC { namespace DFG {
ClobberSet::ClobberSet() { }
ClobberSet::~ClobberSet() { }
void ClobberSet::add(AbstractHeap heap)
{
HashMap<AbstractHeap, bool>::AddResult result = m_clobbers.add(heap, true);
if (!result.isNewEntry) {
if (result.iterator->value)
return;
result.iterator->value = true;
}
while (heap.kind() != World) {
heap = heap.supertype();
if (!m_clobbers.add(heap, false).isNewEntry)
return;
}
}
void ClobberSet::addAll(const ClobberSet& other)
{
if (this == &other)
return;
HashMap<AbstractHeap, bool>::const_iterator iter = other.m_clobbers.begin();
HashMap<AbstractHeap, bool>::const_iterator end = other.m_clobbers.end();
for (; iter != end; ++iter)
m_clobbers.add(iter->key, iter->value).iterator->value |= iter->value;
}
bool ClobberSet::contains(AbstractHeap heap) const
{
HashMap<AbstractHeap, bool>::const_iterator iter = m_clobbers.find(heap);
if (iter == m_clobbers.end())
return false;
return iter->value;
}
bool ClobberSet::overlaps(AbstractHeap heap) const
{
if (m_clobbers.find(heap) != m_clobbers.end())
return true;
while (heap.kind() != World) {
heap = heap.supertype();
if (contains(heap))
return true;
}
return false;
}
void ClobberSet::clear()
{
m_clobbers.clear();
}
HashSet<AbstractHeap> ClobberSet::direct() const
{
return setOf(true);
}
HashSet<AbstractHeap> ClobberSet::super() const
{
return setOf(false);
}
void ClobberSet::dump(PrintStream& out) const
{
out.print("(Direct:[", sortedListDump(direct()), "], Super:[", sortedListDump(super()), "])");
}
HashSet<AbstractHeap> ClobberSet::setOf(bool direct) const
{
HashSet<AbstractHeap> result;
for (HashMap<AbstractHeap, bool>::const_iterator iter = m_clobbers.begin(); iter != m_clobbers.end(); ++iter) {
if (iter->value == direct)
result.add(iter->key);
}
return result;
}
void addReads(Graph& graph, Node* node, ClobberSet& readSet)
{
ClobberSetAdd addRead(readSet);
NoOpClobberize noOp;
clobberize(graph, node, addRead, noOp, noOp);
}
void addWrites(Graph& graph, Node* node, ClobberSet& writeSet)
{
NoOpClobberize noOp;
ClobberSetAdd addWrite(writeSet);
clobberize(graph, node, noOp, addWrite, noOp);
}
void addReadsAndWrites(Graph& graph, Node* node, ClobberSet& readSet, ClobberSet& writeSet)
{
ClobberSetAdd addRead(readSet);
ClobberSetAdd addWrite(writeSet);
NoOpClobberize noOp;
clobberize(graph, node, addRead, addWrite, noOp);
}
bool readsOverlap(Graph& graph, Node* node, ClobberSet& readSet)
{
ClobberSetOverlaps addRead(readSet);
NoOpClobberize noOp;
clobberize(graph, node, addRead, noOp, noOp);
return addRead.result();
}
bool writesOverlap(Graph& graph, Node* node, ClobberSet& writeSet)
{
NoOpClobberize noOp;
ClobberSetOverlaps addWrite(writeSet);
clobberize(graph, node, noOp, addWrite, noOp);
return addWrite.result();
}
} }
#endif // ENABLE(DFG_JIT)