admin/mlib
1
0 Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Replace TAB by SPACE

Browse Source
This commit is contained in:
Patrick Pelissier committed 2020-07-25 19:17:25 +02:00
1 parent efef35c1e1
commit 5f9feb833c
2 files changed
+10 -4
Download Patch File Download Diff File Expand all files Collapse all files

No files matched your search

m-buffer.h
+5 -2
View File
@@ -158,9 +158,11 @@ M_C(name, _init)(buffer_t v, size_t size) \
m_mutex_init(v->mutexPop); \ m_mutex_init(v->mutexPop); \
m_cond_init(v->there_is_data); \ m_cond_init(v->there_is_data); \
m_cond_init(v->there_is_room_for_data); \ m_cond_init(v->there_is_room_for_data); \
} else \ } else { \
assert(BUFFERI_POLICY_P((policy), BUFFER_UNBLOCKING)); \ assert(BUFFERI_POLICY_P((policy), BUFFER_UNBLOCKING)); \
BUFFERI_IF_CTE_SIZE(m_size)( , \ } \
\
BUFFERI_IF_CTE_SIZE(m_size)( /* Statically allocated */ , \
v->data = M_CALL_REALLOC(oplist, type, NULL, BUFFERI_SIZE(m_size)); \ v->data = M_CALL_REALLOC(oplist, type, NULL, BUFFERI_SIZE(m_size)); \
if (v->data == NULL) { \ if (v->data == NULL) { \
M_MEMORY_FULL (BUFFERI_SIZE(m_size)*sizeof(type)); \ M_MEMORY_FULL (BUFFERI_SIZE(m_size)*sizeof(type)); \
@@ -621,6 +623,7 @@ M_C(name, _init)(buffer_t v, size_t size) \
} while (0) } while (0)
#endif #endif
#define QUEUEI_MPMC_DEF_P3(name, type, policy, oplist, buffer_t) \ #define QUEUEI_MPMC_DEF_P3(name, type, policy, oplist, buffer_t) \
\ \
/* The sequence number of an element will be equal to either \ /* The sequence number of an element will be equal to either \
m-dict.h
+5 -2
View File
@@ -1132,7 +1132,8 @@ typedef enum {
#define DICTI_OA_CONTRACT(dict) do { \ #define DICTI_OA_CONTRACT(dict) do { \
assert ( (dict) != NULL); \ assert ( (dict) != NULL); \
assert( (dict)->lower_limit <= (dict)->count && (dict)->count <= (dict)->upper_limit ); \ assert( (dict)->lower_limit <= (dict)->count); \
assert( (dict)->count <= (dict)->upper_limit ); \
assert( (dict)->data != NULL); \ assert( (dict)->data != NULL); \
assert( M_POWEROF2_P((dict)->mask+1)); \ assert( M_POWEROF2_P((dict)->mask+1)); \
assert( (dict)->mask+1 >= DICTI_INITIAL_SIZE); \ assert( (dict)->mask+1 >= DICTI_INITIAL_SIZE); \
@@ -1855,7 +1856,9 @@ typedef enum {
{ \ { \
DICTI_OA_CONTRACT(dict); \ DICTI_OA_CONTRACT(dict); \
size_t size; \ size_t size; \
/* Get the size which will allow to fit this capacity */ \ /* Get the size which will allow to fit this capacity \
NOTE: Stricly speaking we need to perform a round up to ensure \
that no reallocation of the hash map occurs up to capacity */ \
size = (size_t) m_core_roundpow2 ((uint64_t) ((double) capacity * (1.0 / coeff_up))); \ size = (size_t) m_core_roundpow2 ((uint64_t) ((double) capacity * (1.0 / coeff_up))); \
/* Test for overflow of the computation */ \ /* Test for overflow of the computation */ \
if (M_UNLIKELY (size < capacity)) { \ if (M_UNLIKELY (size < capacity)) { \