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

Add some likely / unlikely to some tests.

Browse Source 
Probably useless.
This commit is contained in:
Patrick Pelissier committed 2017-03-27 23:06:02 +02:00
1 parent c6babc8856
commit ff2c6d51e6
2 files changed
+7 -7
Download Patch File Download Diff File Expand all files Collapse all files

No files matched your search

m-dict.h
+2 -2
View File
@@ -288,7 +288,7 @@
M_C3(dict_pair_,name,_init_set2)(*M_C3(list_dict_pair_,name,_push_raw)(*list_ptr), \ M_C3(dict_pair_,name,_init_set2)(*M_C3(list_dict_pair_,name,_push_raw)(*list_ptr), \
key M_IF(isSet)(, M_DEFERRED_COMMA value)); \ key M_IF(isSet)(, M_DEFERRED_COMMA value)); \
map->used ++; \ map->used ++; \
if (map->used > map->upper_limit) \ if (M_UNLIKELY (map->used > map->upper_limit) ) \
M_C3(dicti_,name,_resize_up)(map); \ M_C3(dicti_,name,_resize_up)(map); \
} \ } \
\ \
@@ -312,7 +312,7 @@
break; \ break; \
} \ } \
} \ } \
if (map->used < map->lower_limit) \ if (M_UNLIKELY (map->used < map->lower_limit) ) \
M_C3(dicti_, name, _resize_down)(map); \ M_C3(dicti_, name, _resize_down)(map); \
} \ } \
\ \
m-rbtree.h
+5 -5
View File
@@ -212,7 +212,7 @@ typedef enum {
/* If nothing, create new node */ \ /* If nothing, create new node */ \
if (n == NULL) { \ if (n == NULL) { \
n = M_GET_NEW oplist(node_t); \ n = M_GET_NEW oplist(node_t); \
if (n == NULL) { \ if (M_UNLIKELY (n == NULL)) { \
M_MEMORY_FULL(sizeof (node_t)); \ M_MEMORY_FULL(sizeof (node_t)); \
return; \ return; \
} \ } \
@@ -251,7 +251,7 @@ typedef enum {
} \ } \
/* Create new */ \ /* Create new */ \
n = M_GET_NEW oplist(node_t); \ n = M_GET_NEW oplist(node_t); \
if (n == NULL) { \ if (M_UNLIKELY (n == NULL) ) { \
M_MEMORY_FULL (sizeof (node_t)); \ M_MEMORY_FULL (sizeof (node_t)); \
return; \ return; \
} \ } \
@@ -511,7 +511,7 @@ typedef enum {
{ \ { \
RBTREEI_CONTRACT (tree); \ RBTREEI_CONTRACT (tree); \
node_t *n = tree->node; \ node_t *n = tree->node; \
if (n == NULL) return NULL; \ if (M_UNLIKELY (n == NULL) ) return NULL; \
while (n->child[0] != NULL) { \ while (n->child[0] != NULL) { \
RBTREEI_CONTRACT_NODE (n); \ RBTREEI_CONTRACT_NODE (n); \
n = n->child[0]; \ n = n->child[0]; \
@@ -524,7 +524,7 @@ typedef enum {
{ \ { \
RBTREEI_CONTRACT (tree); \ RBTREEI_CONTRACT (tree); \
node_t *n = tree->node; \ node_t *n = tree->node; \
if (n == NULL) return NULL; \ if (M_UNLIKELY (n == NULL) ) return NULL; \
while (n->child[1] != NULL) { \ while (n->child[1] != NULL) { \
RBTREEI_CONTRACT_NODE (n); \ RBTREEI_CONTRACT_NODE (n); \
n = n->child[1]; \ n = n->child[1]; \
@@ -575,7 +575,7 @@ typedef enum {
{ \ { \
if (o == NULL) return NULL; \ if (o == NULL) return NULL; \
node_t *n = M_GET_NEW oplist(node_t); \ node_t *n = M_GET_NEW oplist(node_t); \
if (n == NULL) { \ if (M_UNLIKELY (n == NULL) ) { \
M_MEMORY_FULL (sizeof (node_t)); \ M_MEMORY_FULL (sizeof (node_t)); \
return NULL; \ return NULL; \
} \ } \