#include "CPUCount.h"
#include "list.h"
#include <stdlib.h>
#include <strings.h>
#include "mbmalloc.h"
namespace {
struct Node {
void* operator new(size_t size)
{
return mbmalloc(size);
}
void operator delete(void* p, size_t size)
{
mbfree(p, size);
}
Node(Node* next, size_t payloadSize)
: m_refCount(1)
, m_next(next)
, m_payload(static_cast<char*>(mbmalloc(payloadSize)))
, m_payloadSize(payloadSize)
{
if (m_next)
m_next->ref();
bzero(m_payload, payloadSize);
}
~Node()
{
if (m_next)
m_next->deref();
mbfree(m_payload, m_payloadSize);
}
void ref()
{
++m_refCount;
}
void deref()
{
if (m_refCount == 1)
delete this;
else
--m_refCount;
}
Node* takeNext()
{
Node* tmp = m_next;
m_next = 0;
return tmp;
}
bool validate()
{
if (m_payload[0])
return false;
return true;
}
unsigned m_refCount;
Node* m_next;
char* m_payload;
size_t m_payloadSize;
};
}
void benchmark_list_allocate(bool isParallel)
{
Node* head = 0;
size_t times = 70;
size_t nodes = 32 * 1024;
if (isParallel) {
nodes /= cpuCount();
times *= 2;
}
for (size_t time = 0; time < times; ++time) {
for (size_t node = 0; node < nodes; ++node) {
Node* oldHead = head;
head = new Node(oldHead, (nodes & (64 - 1)) | 1);
if (oldHead)
oldHead->deref();
}
while (head) {
Node* tmp = head->takeNext();
head->deref();
head = tmp;
}
}
}
void benchmark_list_traverse(bool isParallel)
{
Node* head = 0;
size_t times = 1 * 1024;
size_t nodes = 32 * 1024;
if (isParallel) {
nodes /= cpuCount();
times *= 4;
}
for (size_t node = 0; node < nodes; ++node) {
Node* oldHead = head;
head = new Node(oldHead, (nodes & (64 - 1)) | 1);
if (oldHead)
oldHead->deref();
}
for (size_t time = 0; time < times; ++time) {
for (Node* node = head; node; node = node->m_next) {
if (!node->validate())
abort();
}
}
while (head) {
Node* tmp = head->takeNext();
head->deref();
head = tmp;
}
}