Function compressLinearSearch

runtime/Perf.cc:364–405

}

double compressLinearSearch() {
    const int count = 1000000;
    uint64_t *buffer = static_cast<uint64_t*>(malloc(count*sizeof(uint64_t)));

    srand(0);
    for (int i = 0; i < count; i++) {
        buffer[i] = 1UL << (rand()%64);
    }

    int sumOfBytes = 0;
    uint64_t start = Cycles::rdtsc();
    for (int i = 0; i < count; ++i) {
        int numBytes;
        uint64_t val = buffer[i];

        if (val < (1UL << 8)) {
            numBytes = 1;
        } else if (val < (1UL << 16)) {
            numBytes = 2;
        } else if (val < (1UL << 24)) {
            numBytes = 3;
        } else if (val < (1UL << 32)) {
            numBytes = 4;
        } else if (val < (1UL << 40)) {
            numBytes = 5;
        } else if (val < (1UL << 48)) {
            numBytes = 6;
        } else if (val < (1UL << 56)) {
            numBytes = 7;
        } else {
            numBytes = 8;
        }

        sumOfBytes += numBytes;
    }
    uint64_t stop = Cycles::rdtsc();

    discard(&sumOfBytes);

    free(buffer);
    return Cycles::toSeconds(stop - start)/count;
}

double delayInBenchmark() {
    int count = 1000000;