mirror/libowfat
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

explain a bit what we are trying to do here

Browse Source
This commit is contained in:
leitner 2021-11-03 12:28:12 +00:00
parent 0556994916
commit 46cd715bbf
1 changed files with 7 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
iarray.h
View File

@ -7,6 +7,13 @@
* - the elements are small (many fit on one page), * - the elements are small (many fit on one page),
* - the platform has an atomic compare-and-swap instruction * - the platform has an atomic compare-and-swap instruction
* - the compiler supports it via __sync_val_compare_and_swap * - the compiler supports it via __sync_val_compare_and_swap
*
* Implementation parameters:
* - once an element is allocated, it stays allocated and at the same place
* - there is no deleting elements or moving elements around
* - we are not coordinating access to elements, only providing pointers to them
* - new elements are allocated upwards, not arbitrarily (like file descriptors on Unix)
* - meant for long-running processes, destruction is provided only as an afterthought for completeness
*/ */
#include <libowfat/uint64.h> #include <libowfat/uint64.h>