/*
 * This library is free software; you can redistribute it and/or modify
 * it under the terms of the GNU Lesser General Public License as
 * published by the Free Software Foundation; either version 2.1 of
 * the License.
 *
 * This library 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.
 * See the GNU Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public
 * License along with this library; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
 *
 * (c) Copyright 2006,2007,2008 MString Core Team <http://mstring.jarios.org>
 * (c) Copyright 2009 Dan Kruchinin <dan.kruchinin@gmail.com>
 * (c) Copyright 2009 Alexander Vdolainen <avdolainen@zoho.com> (libc adaptation)
 * (c) Copyright 2009 Dmitry Gromada <gromada@jarios.org> (locking added)
 * (c) Copyright 2013 Alexander Vdolainen <vdo@askele.com> (verios changes to make it run on linux)
 *
 *
 * Index allocator
 *
 */

#include <string.h>
#include <stddef.h>
#include <stdlib.h>
#include <stdio.h>
#include <assert.h>
#include <errno.h>
#include <sys/types.h>
#include <tdata/bitwise.h>
#include <tdata/idx_allocator.h>

/*
 * Main idea of index allocator is quite simple:
 * There is a group of tasks that requires dynamic allocation
 * of unique non-negative integer identifiers. Where a set of such
 * integers is relatively big (thousands of numbers), index allocator
 * becomes a nifty solution.
 * The core of allocator is two bitmaps. One of them called "indices bitmap"
 * or "second level bitmap". Each bit of that bitmap corresponds to particular unique
 * index. Since second-level bitmap is a large portion of continuous memory, searching
 * of set/zero bit in it becomes relatively slow. For speeding-up search process we invented
 * a first-level bitmap. Second-level array is splitted on groups each of them contains BYTES_PER_ITEM bytes.
 * First-level(or main) bitmap establishes corresponding between particular group and its
 * state(group may have free indices or not).
 * So index allocation assumes at first searching of group index in a the first-level bitmap and only
 * then searching an index in the second level bitmap starting from a group index.
 */

#define MIN_IDA_SIZE (WORDS_PER_ITEM * sizeof(ulong_t))

/* there macros defined only on new glibc (from 12-jul-2013), let's use our own */
#ifndef is_powerof2
#define is_powerof2(num) (((num) & ~((num) - 1)) == (num))
#endif
#ifndef round_up_pow2
#define round_up_pow2(x) (!is_powerof2(x) ? (1 << (bit_find_msf(x) + 1)) : (x) )
#endif

static inline size_t __get_main_bmap_size(idx_allocator_t *ida)
{
  if (ida->ids_bmap != NULL)
    return (round_up_pow2((ida->size * sizeof(ulong_t)) / BYTES_PER_ITEM));

  return ida->size;
}

ulong_t idx_allocate(idx_allocator_t *ida)
{
  ulong_t id = IDX_INVAL;
  long fnfi = 0;
  size_t i = 0, main_offs = 0, main_sz;

  main_sz = __get_main_bmap_size(ida) / sizeof(ulong_t);

  if (ida->ids_bmap != NULL) {
    for (;;) {
      while (i < main_sz) {
        fnfi = zero_bit_find_lsf(ida->main_bmap[i]);
        if (fnfi >= 0) {
          fnfi = (fnfi * WORDS_PER_ITEM) + i * WORDS_PER_ITEM * BITS_PER_LONG;
          main_offs = i;
          break;
        }

        i++;
      }
      if ((fnfi >= 0) && (fnfi < ida->size)) {
        int res_id, j, total_sz;

        total_sz = fnfi + WORDS_PER_ITEM;
        j = fnfi;
        while (j < total_sz) {
          res_id = zero_bit_find_lsf(ida->ids_bmap[j]);
          if (res_id < 0) {
            j++;
            continue;
          }

          bit_set(ida->ids_bmap + j, res_id);

          id = res_id + j * BITS_PER_LONG;
          if (id >= ida->max_id) {
            bit_clear(ida->ids_bmap + j, res_id);
            printf("%s:%d IDXINVAL\n", __FILE__, __LINE__);
            id = IDX_INVAL;
          }

          goto out;
        }

        bit_set(ida->main_bmap + main_offs,
                (fnfi - (main_offs * WORDS_PER_ITEM * BITS_PER_LONG)) /
                WORDS_PER_ITEM);
        if ((ida->main_bmap[i] & ~0UL) == ~0UL)          i++;
      }
      else        break;
    }
  } else {

    while (i < main_sz)  {
      fnfi = zero_bit_find_lsf(ida->main_bmap[i]);
      if (fnfi >= 0) {
        bit_set(ida->main_bmap + i, fnfi);
        id = fnfi + i * BITS_PER_LONG;
        if (id >= ida->max_id) {
          bit_clear(ida->main_bmap + i, fnfi);
          id = IDX_INVAL;
        }

        break;
      }

      i++;
    }
  }

  out:

  return id;
}

void idx_reserve(idx_allocator_t *ida, ulong_t idx)
{
  int start_id, bitno;
  ulong_t *ptr;

  start_id = idx / BITS_PER_LONG;
  bitno = idx - start_id * BITS_PER_LONG;
  if (ida->ids_bmap != NULL)
    ptr = ida->ids_bmap + start_id;
  else
    ptr = ida->main_bmap + start_id;

  if (bit_test_and_set(ptr, bitno)) {
    printf("[libc warning] Detected an attempt to reserve already busy index %ld "
           "[function: %s]!\n", idx, __FUNCTION__);
  }
}

void idx_free(idx_allocator_t *ida, ulong_t idx)
{
  int start_id, bitno, main_id, main_bitno;
  ulong_t *ptr;

  start_id = idx / BITS_PER_LONG;
  bitno = idx - start_id * BITS_PER_LONG;
  if (ida->ids_bmap != NULL) {
    ptr = ida->ids_bmap + start_id;
    main_id = start_id / WORDS_PER_ITEM;
    main_bitno = start_id - main_id * WORDS_PER_ITEM;
    bit_clear(ida->main_bmap + main_id, main_bitno);
  }
  else
    ptr = ida->main_bmap + start_id;

  if (!bit_test_and_clear(ptr, bitno)) {
    printf("[libc warning] Detected an attempt to free already fried index %ld "
           "[function: %s]!\n", idx, __FUNCTION__);
  }
}

int idx_allocator_init(idx_allocator_t *ida, ulong_t idx_max, int lockable)
{
  size_t bmap_sz;
  int err = -ENOMEM;

  bmap_sz = (round_up_pow2(idx_max) >> 3);
  memset(ida, 0, sizeof(*ida));
  ida->size = bmap_sz / sizeof(ulong_t);
  if (ida->size >= MIN_IDA_SIZE) {
    ida->ids_bmap = malloc(bmap_sz);
    if (!ida->ids_bmap) {
      goto error;
    }

    memset(ida->ids_bmap, 0, bmap_sz);
  }
  else
    ida->size = (ida->size > 0) ? (ida->size * sizeof(ulong_t)) : sizeof(ulong_t);

  ida->main_bmap = malloc(__get_main_bmap_size(ida));
  if (!ida->main_bmap) {
    goto error;
  }

  memset(ida->main_bmap, 0, __get_main_bmap_size(ida));
  ida->max_id = idx_max;
  return 0;

  error:
  if (ida->ids_bmap) {
    free(ida->ids_bmap);
  }
  if (ida->main_bmap) {
    free(ida->main_bmap);
  }

  return err;
}

void idx_allocator_destroy(idx_allocator_t *ida)
{
  if (ida->ids_bmap != NULL)
    free(ida->ids_bmap);

  free(ida->main_bmap);

  return;
}