mirror of
https://github.com/amadvance/snapraid.git
synced 2026-10-26 10:51:54 -04:00
79 lines
2.2 KiB
C
79 lines
2.2 KiB
C
/*
|
|
* Copyright (C) 2013 Andrea Mazzoleni
|
|
*
|
|
* This program is free software: you can redistribute it and/or modify
|
|
* it under the terms of the GNU General Public License as published by
|
|
* the Free Software Foundation, either version 2 of the License, or
|
|
* (at your option) any later version.
|
|
*
|
|
* This program is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
* GNU General Public License for more details.
|
|
*/
|
|
|
|
#ifndef __RAID_MEMORY_H
|
|
#define __RAID_MEMORY_H
|
|
|
|
/**
|
|
* Memory alignment provided by raid_malloc_align().
|
|
*
|
|
* It should guarantee good cache performance everywhere.
|
|
*/
|
|
#define RAID_MALLOC_ALIGN 256
|
|
|
|
/**
|
|
* Memory displacement to avoid cache collisions on contiguous blocks,
|
|
* used by raid_malloc_vector().
|
|
*
|
|
* When allocating a sequence of blocks with a size of power of 2,
|
|
* there is the risk that the start of each block is mapped into the same
|
|
* cache line, resulting in cache collisions if you access all the blocks
|
|
* in parallel, from the start to the end.
|
|
*
|
|
* The selected value was choosen empirically with some speed tests
|
|
* with 8/12/16/20/24 data buffers of 256 KB.
|
|
*
|
|
* With displacement:
|
|
* (8 buffers of 256 KB, icore5, 32 bits):
|
|
*
|
|
* sse2
|
|
* par1 21936 [MB/s]
|
|
* par2 11902 [MB/s]
|
|
* parz 5838 [MB/s]
|
|
*
|
|
* Without displacement:
|
|
*
|
|
* sse2
|
|
* par1 15368 [MB/s]
|
|
* par2 6814 [MB/s]
|
|
* parz 3033 [MB/s]
|
|
*/
|
|
#define RAID_MALLOC_DISPLACEMENT (7*256)
|
|
|
|
/**
|
|
* Aligned malloc.
|
|
*/
|
|
void *raid_malloc_align(size_t size, void **freeptr);
|
|
|
|
/**
|
|
* Aligned vector allocation.
|
|
* Returns a vector of "count" pointers, each one pointing to a block of the
|
|
* specified "size".
|
|
* The first "reverse" pointers are put in reverse memory offset order.
|
|
*/
|
|
void **raid_malloc_vector(size_t reverse, size_t count, size_t size, void **freeptr);
|
|
|
|
/**
|
|
* Tests the memory vector for RAM problems.
|
|
* If a problem is found, it crashes.
|
|
*/
|
|
int raid_mtest_vector(void **vv, size_t count, size_t size);
|
|
|
|
/**
|
|
* Fills the memory vector with random data.
|
|
*/
|
|
void raid_mrand_vector(void **vv, size_t count, size_t size);
|
|
|
|
#endif
|
|
|