diff options
author | Cedric Bail <cedric.bail@samsung.com> | 2013-11-29 15:30:32 +0900 |
---|---|---|
committer | Cedric Bail <cedric.bail@samsung.com> | 2013-11-29 15:33:51 +0900 |
commit | aefd608453c47ff03d60d1a34f0aba73ad290016 (patch) | |
tree | f6b8fe531bacf260d27c58216910a32ea8d4310d | |
parent | 50e74f02d47aa70e346d6300c5adc637243bd0eb (diff) | |
download | efl-aefd608453c47ff03d60d1a34f0aba73ad290016.tar.gz |
eina: fix rounding logic to avoid making the array to short.
I have no idea how the previous formula was supposed to work at all, but
this one is the same as our alignof code to make sure we do allocate to
the really nearest size and don't do over allocation. Additionnaly it works.
-rw-r--r-- | src/lib/eina/eina_array.c | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/src/lib/eina/eina_array.c b/src/lib/eina/eina_array.c index ab853a01ea..dddcf732bb 100644 --- a/src/lib/eina/eina_array.c +++ b/src/lib/eina/eina_array.c @@ -363,7 +363,7 @@ eina_array_remove(Eina_Array *array, Eina_Bool (*keep)(void *data, else { // realloc back down - rounding up to the nearest step size - size = (array->count + array->step - 1) % array->step; + size = ((array->count / array->step) + (array->count % array->step ? 1 : 0)) * array->step; tmp = realloc(array->data, sizeof(void *) * size); if (!tmp) return EINA_FALSE; array->total = size; |