void TypeProfilerLog::visit(SlotVisitor& visitor)
{
for (LogEntry* entry = m_logStartPtr; entry != m_currentLogEntryPtr; ++entry) {
visitor.appendUnbarriered(entry->value);
if (StructureID id = entry->structureID) {
Structure* structure = visitor.heap()->structureIDTable().get(id);
visitor.appendUnbarriered(structure);
}
}
}
void Worklist::visitChildren(SlotVisitor& visitor, CodeBlockSet& codeBlocks)
{
VM* vm = visitor.heap()->vm();
for (PlanMap::iterator iter = m_plans.begin(); iter != m_plans.end(); ++iter) {
Plan* plan = iter->value.get();
if (&plan->vm != vm)
continue;
iter->key.visitChildren(codeBlocks);
iter->value->visitChildren(visitor, codeBlocks);
}
for (unsigned i = m_threads.size(); i--;) {
ThreadData* data = m_threads[i].get();
Safepoint* safepoint = data->m_safepoint;
if (safepoint && &safepoint->vm() == vm)
safepoint->visitChildren(visitor);
}
}
void Worklist::visitWeakReferences(SlotVisitor& visitor)
{
VM* vm = visitor.heap()->vm();
{
LockHolder locker(m_lock);
for (PlanMap::iterator iter = m_plans.begin(); iter != m_plans.end(); ++iter) {
Plan* plan = iter->value.get();
if (&plan->vm != vm)
continue;
plan->checkLivenessAndVisitChildren(visitor);
}
}
// This loop doesn't need locking because:
// (1) no new threads can be added to m_threads. Hence, it is immutable and needs no locks.
// (2) ThreadData::m_safepoint is protected by that thread's m_rightToRun which we must be
// holding here because of a prior call to suspendAllThreads().
for (unsigned i = m_threads.size(); i--;) {
ThreadData* data = m_threads[i].get();
Safepoint* safepoint = data->m_safepoint;
if (safepoint && &safepoint->vm() == vm)
safepoint->checkLivenessAndVisitChildren(visitor);
}
}
