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

Rewrite inner loop. should be a little bit faster.

Browse Source
This commit is contained in:
Patrick Pelissier committed 2018-05-11 22:41:00 +02:00
1 parent a5ac43e5f3
commit 4b1ed25ef3
1 file changed
+5 -4
Download Patch File Download Diff File Expand all files Collapse all files
m-bptree.h
+5 -4
View File
@@ -403,10 +403,11 @@
assert (num <= N); \ assert (num <= N); \
for(i = 0; i < num; i++) { \ for(i = 0; i < num; i++) { \
int cmp = M_GET_CMP key_oplist (key, n->key[i]); \ int cmp = M_GET_CMP key_oplist (key, n->key[i]); \
if (M_UNLIKELY (cmp == 0)) { \ if (cmp <= 0) { \
M_IF(isMap)(M_GET_SET value_oplist (n->kind.value[i], value);,) \ if (M_UNLIKELY (cmp == 0)) { \
return -1; \ M_IF(isMap)(M_GET_SET value_oplist (n->kind.value[i], value);,) \
} else if (cmp < 0) { \ return -1; \
} \
/* Move tables to make space for insertion */ \ /* Move tables to make space for insertion */ \
memmove(&n->key[i+1], &n->key[i], sizeof(key_t)*(num-i)); \ memmove(&n->key[i+1], &n->key[i], sizeof(key_t)*(num-i)); \
M_IF(isMap)(memmove(&n->kind.value[i+1], &n->kind.value[i], sizeof(value_t)*(num-i));,) \ M_IF(isMap)(memmove(&n->kind.value[i+1], &n->kind.value[i], sizeof(value_t)*(num-i));,) \