VisitedLinkProvider.cpp [plain text]
#include "config.h"
#include "VisitedLinkProvider.h"
#include "SharedMemory.h"
#include "VisitedLinkTable.h"
#include "WebContext.h"
#include "WebProcessMessages.h"
using namespace WebCore;
namespace WebKit {
static const int VisitedLinkTableMaxLoad = 2;
VisitedLinkProvider::VisitedLinkProvider(WebContext* context)
: m_context(context)
, m_visitedLinksPopulated(false)
, m_webProcessHasVisitedLinkState(false)
, m_keyCount(0)
, m_tableSize(0)
, m_pendingVisitedLinksTimer(RunLoop::main(), this, &VisitedLinkProvider::pendingVisitedLinksTimerFired)
{
}
void VisitedLinkProvider::processDidFinishLaunching()
{
m_webProcessHasVisitedLinkState = false;
if (m_keyCount)
m_pendingVisitedLinksTimer.startOneShot(0);
if (m_visitedLinksPopulated)
return;
m_context->populateVisitedLinks();
m_visitedLinksPopulated = true;
}
void VisitedLinkProvider::addVisitedLink(LinkHash linkHash)
{
m_pendingVisitedLinks.add(linkHash);
if (!m_pendingVisitedLinksTimer.isActive())
m_pendingVisitedLinksTimer.startOneShot(0);
}
void VisitedLinkProvider::processDidClose()
{
m_pendingVisitedLinksTimer.stop();
}
static unsigned nextPowerOf2(unsigned v)
{
v--;
v |= v >> 1;
v |= v >> 2;
v |= v >> 4;
v |= v >> 8;
v |= v >> 16;
v++;
return v;
}
static unsigned tableSizeForKeyCount(unsigned keyCount)
{
unsigned tableSize = nextPowerOf2(keyCount * VisitedLinkTableMaxLoad);
size_t minimumTableSize = SharedMemory::systemPageSize() / sizeof(LinkHash);
if (tableSize < minimumTableSize)
return minimumTableSize;
return tableSize;
}
void VisitedLinkProvider::pendingVisitedLinksTimerFired()
{
Vector<WebCore::LinkHash> pendingVisitedLinks;
copyToVector(m_pendingVisitedLinks, pendingVisitedLinks);
m_pendingVisitedLinks.clear();
unsigned currentTableSize = m_tableSize;
unsigned newTableSize = tableSizeForKeyCount(m_keyCount + pendingVisitedLinks.size());
Vector<WebCore::LinkHash> addedVisitedLinks;
if (currentTableSize != newTableSize) {
RefPtr<SharedMemory> newTableMemory = SharedMemory::create(newTableSize * sizeof(LinkHash));
if (!newTableMemory)
return;
memset(newTableMemory->data(), 0, newTableMemory->size());
RefPtr<SharedMemory> currentTableMemory = m_table.sharedMemory();
m_table.setSharedMemory(newTableMemory);
m_tableSize = newTableSize;
if (currentTableMemory) {
ASSERT(currentTableMemory->size() == currentTableSize * sizeof(LinkHash));
const LinkHash* currentLinkHashes = static_cast<const LinkHash*>(currentTableMemory->data());
for (unsigned i = 0; i < currentTableSize; ++i) {
LinkHash linkHash = currentLinkHashes[i];
if (!linkHash)
continue;
if (!m_table.addLinkHash(linkHash))
ASSERT_NOT_REACHED();
}
}
}
for (size_t i = 0; i < pendingVisitedLinks.size(); ++i) {
if (m_table.addLinkHash(pendingVisitedLinks[i]))
addedVisitedLinks.append(pendingVisitedLinks[i]);
}
m_keyCount += pendingVisitedLinks.size();
if (!m_webProcessHasVisitedLinkState || currentTableSize != newTableSize) {
SharedMemory::Handle handle;
if (!m_table.sharedMemory()->createHandle(handle, SharedMemory::ReadOnly))
return;
m_context->sendToAllProcesses(Messages::WebProcess::SetVisitedLinkTable(handle));
}
if (m_webProcessHasVisitedLinkState && addedVisitedLinks.size() <= 20) {
m_context->sendToAllProcesses(Messages::WebProcess::VisitedLinkStateChanged(addedVisitedLinks));
return;
}
m_context->sendToAllProcesses(Messages::WebProcess::AllVisitedLinkStateChanged());
m_webProcessHasVisitedLinkState = true;
}
}