/*
 * Dynomite - A thin, distributed replication layer for multi non-distributed
 * storages. Copyright (C) 2014 Netflix, Inc.
 */

/*
 * twemproxy - A fast and lightweight proxy for memcached protocol.
 * Copyright (C) 2011 Twitter, Inc.
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 * http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

#include "dyn_array.h"

#include <stdlib.h>

#include "dyn_core.h"
#include "dyn_util.h"

struct array *array_create(uint32_t n, size_t size) {
  struct array *a;

  ASSERT(n != 0 && size != 0);

  a = dn_alloc(sizeof(*a));
  if (a == NULL) {
    return NULL;
  }

  a->elem = dn_alloc(n * size);
  if (a->elem == NULL) {
    dn_free(a);
    return NULL;
  }

  a->nelem = 0;
  a->size = size;
  a->nalloc = n;

  return a;
}

void array_destroy(struct array *a) {
  array_deinit(a);
  dn_free(a);
}

rstatus_t array_init(struct array *a, uint32_t n, size_t size) {
  ASSERT(n != 0 && size != 0);

  a->elem = dn_alloc(n * size);
  if (a->elem == NULL) {
    return DN_ENOMEM;
  }

  a->nelem = 0;
  a->size = size;
  a->nalloc = n;

  return DN_OK;
}

void array_deinit(struct array *a) {
  // ASSERT(a->nelem == 0);

  if (a->elem != NULL) {
    dn_free(a->elem);
  }
}

uint32_t array_idx(struct array *a, void *elem) {
  uint8_t *p, *q;
  uint32_t off, idx;

  ASSERT(elem >= a->elem);

  p = a->elem;
  q = elem;
  off = (uint32_t)(q - p);

  ASSERT(off % (uint32_t)a->size == 0);

  idx = off / (uint32_t)a->size;

  return idx;
}

void *array_push(struct array *a) {
  void *elem, *new;
  size_t size;

  if (a->nelem == a->nalloc) {
    /* the array is full; allocate new array */
    size = a->size * a->nalloc;
    new = dn_realloc(a->elem, 2 * size);
    if (new == NULL) {
      return NULL;
    }

    a->elem = new;
    a->nalloc *= 2;
  }

  elem = (uint8_t *)a->elem + a->size * a->nelem;
  a->nelem++;

  return elem;
}

void *array_pop(struct array *a) {
  void *elem;

  ASSERT(a->nelem != 0);

  a->nelem--;
  elem = (uint8_t *)a->elem + a->size * a->nelem;

  return elem;
}

void *array_get(struct array *a, uint32_t idx) {
  void *elem;

  ASSERT(a->nelem != 0);
  ASSERT(idx < a->nelem);

  elem = (uint8_t *)a->elem + (a->size * idx);

  return elem;
}

void *array_top(struct array *a) {
  ASSERT(a->nelem != 0);

  return array_get(a, a->nelem - 1);
}

void array_swap(struct array *a, struct array *b) {
  struct array tmp;

  tmp = *a;
  *a = *b;
  *b = tmp;
}

/*
 * Sort nelem elements of the array in ascending order based on the
 * compare comparator.
 */
void array_sort(struct array *a, array_compare_t compare) {
  ASSERT(a->nelem != 0);

  qsort(a->elem, a->nelem, a->size, compare);
}

/*
 * Calls the func once for each element in the array as long as func returns
 * success. On failure short-circuits and returns the error status.
 */
rstatus_t array_each(struct array *a, array_each_t func) {
  uint32_t i, nelem;

  ASSERT(func != NULL);

  for (i = 0, nelem = array_n(a); i < nelem; i++) {
    void *elem = array_get(a, i);
    rstatus_t status;

    status = func(elem);
    if (status != DN_OK) {
      return status;
    }
  }

  return DN_OK;
}

rstatus_t array_each_2(struct array *a, array_each_2_t func, void *data1,
                       void *data2) {
  uint32_t i, nelem;

  ASSERT(func != NULL);

  for (i = 0, nelem = array_n(a); i < nelem; i++) {
    void *elem = array_get(a, i);
    rstatus_t status;

    status = func(elem, data1, data2);
    if (status != DN_OK) {
      return status;
    }
  }

  return DN_OK;
}
