/*
 * Copyright (c) 2020 YuQing <384681@qq.com>
 *
 * This program is free software: you can use, redistribute, and/or modify
 * it under the terms of the GNU Affero General Public License, version 3
 * or later ("AGPL"), as published by the Free Software Foundation.
 *
 * This program is distributed in the hope that it will be useful, but WITHOUT
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
 * FITNESS FOR A PARTICULAR PURPOSE.
 *
 * You should have received a copy of the GNU Affero General Public License
 * along with this program. If not, see <https://www.gnu.org/licenses/>.
 */

#include "shared_func.h"
#include "array_allocator.h"

int array_allocator_init_ex(ArrayAllocatorContext *ctx,
        const char *name_prefix, const int element_size,
        const int min_bits, const int max_bits,
        const bool need_lock)
{
    const int obj_size = 0;
    const int reclaim_interval = 0;
    char name[32];
    struct fast_region_info regions[32];
    struct fast_region_info *region;
    int bit;
    int start;
    int end;
    int alloc_elements_once;
    int step;

    ctx->element_size = element_size;
    ctx->min_count = (1 << min_bits);
    start = 0;
    alloc_elements_once = (1 << (max_bits - min_bits + 2));
    for (bit=min_bits, region=regions;
            bit<=max_bits; bit++, region++)
    {
        end = sizeof(VoidArray) + (1 << bit) * ctx->element_size;
        step = end - start;
        FAST_ALLOCATOR_INIT_REGION(*region, start,
                end, step, alloc_elements_once);
        alloc_elements_once /= 2;
        start = end;
    }

    fc_combine_two_string(name_prefix, "array", '-', name);
    return fast_allocator_init_ex(&ctx->allocator, name,
            obj_size, NULL, regions, region - regions, 0,
            0.9999, reclaim_interval, need_lock);
}

VoidArray *array_allocator_alloc(ArrayAllocatorContext *ctx,
        const int target_count)
{
    int alloc;
    int bytes;
    VoidArray *array;

    if (target_count <= ctx->min_count) {
        alloc = ctx->min_count;
    } else if (is_power2(target_count)) {
        alloc = target_count;
    } else {
        alloc = ctx->min_count;
        while (alloc < target_count) {
            alloc *= 2;
        }
    }

    bytes = sizeof(VoidArray) + alloc * ctx->element_size;
    if ((array=fast_allocator_alloc(&ctx->allocator, bytes)) != NULL) {
        array->alloc = alloc;
        array->count = 0;
    }
    return array;
}

VoidArray *array_allocator_realloc(ArrayAllocatorContext *ctx,
        VoidArray *old_array, const int target_count)
{
    VoidArray *new_array;

    if (old_array == NULL) {
        return array_allocator_alloc(ctx, target_count);
    }

    if (old_array->alloc >= target_count) {
        return old_array;
    }

    if ((new_array=array_allocator_alloc(ctx, target_count)) != NULL) {
        if (old_array->count > 0) {
            memcpy(new_array->elts, old_array->elts, ctx->
                    element_size * old_array->count);
        }
        new_array->count = old_array->count;
    }

    array_allocator_free(ctx, old_array);
    return new_array;
}

int array_compare_element_int64(const int64_t *n1, const int64_t *n2)
{
    int64_t sub;
    sub = *n1 - *n2;
    if (sub < 0) {
        return -1;
    } else if (sub > 0) {
        return 1;
    } else {
        return 0;
    }
}

int array_compare_element_int32(const int32_t *n1, const int32_t *n2)
{
    return *n1 - *n2;
}

int array_compare_element_id_name(const id_name_pair_t *pair1,
        const id_name_pair_t *pair2)
{
    return fc_compare_int64(pair1->id, pair2->id);
}