/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-â
âvi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8                                :viâ
ââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââ
â                                                                              â
â  tre-mem.c - TRE memory allocator                                            â
â                                                                              â
â  Copyright (c) 2001-2009 Ville Laurikari <vl@iki.fi>                         â
â  All rights reserved.                                                        â
â                                                                              â
â  Redistribution and use in source and binary forms, with or without          â
â  modification, are permitted provided that the following conditions          â
â  are met:                                                                    â
â                                                                              â
â    1. Redistributions of source code must retain the above copyright         â
â       notice, this list of conditions and the following disclaimer.          â
â                                                                              â
â    2. Redistributions in binary form must reproduce the above copyright      â
â       notice, this list of conditions and the following disclaimer in        â
â       the documentation and/or other materials provided with the             â
â       distribution.                                                          â
â                                                                              â
â  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER AND CONTRIBUTORS          â
â  ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT         â
â  LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR       â
â  A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT       â
â  HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,      â
â  SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT            â
â  LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,       â
â  DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY       â
â  THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT         â
â  (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE       â
â  OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.        â
â                                                                              â
ââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââ
â                                                                              â
â  Musl Libc                                                                   â
â  Copyright Â© 2005-2014 Rich Felker, et al.                                   â
â                                                                              â
â  Permission is hereby granted, free of charge, to any person obtaining       â
â  a copy of this software and associated documentation files (the             â
â  "Software"), to deal in the Software without restriction, including         â
â  without limitation the rights to use, copy, modify, merge, publish,         â
â  distribute, sublicense, and/or sell copies of the Software, and to          â
â  permit persons to whom the Software is furnished to do so, subject to       â
â  the following conditions:                                                   â
â                                                                              â
â  The above copyright notice and this permission notice shall be              â
â  included in all copies or substantial portions of the Software.             â
â                                                                              â
â  THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,             â
â  EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF          â
â  MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.      â
â  IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY        â
â  CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,        â
â  TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE           â
â  SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.                      â
â                                                                              â
ââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââ*/
#include "third_party/regex/tre.inc"

/*
  This memory allocator is for allocating small memory blocks efficiently
  in terms of memory overhead and execution speed.  The allocated blocks
  cannot be freed individually, only all at once.  There can be multiple
  allocators, though.
*/

/*
  This memory allocator is for allocating small memory blocks efficiently
  in terms of memory overhead and execution speed.  The allocated blocks
  cannot be freed individually, only all at once.  There can be multiple
  allocators, though.
*/

/* Returns a new memory allocator or NULL if out of memory. */
tre_mem_t tre_mem_new_impl(int provided, void *provided_block) {
  tre_mem_t mem;
  if (provided) {
    mem = provided_block;
    bzero(mem, sizeof(*mem));
  } else
    mem = calloc(1, sizeof(*mem));
  if (mem == NULL) return NULL;
  return mem;
}

/* Frees the memory allocator and all memory allocated with it. */
void tre_mem_destroy(tre_mem_t mem) {
  tre_list_t *tmp, *l = mem->blocks;
  while (l != NULL) {
    free(l->data), l->data = NULL;
    tmp = l->next;
    free(l), l = tmp;
  }
  free(mem), mem = NULL;
}

/* Allocates a block of `size' bytes from `mem'.  Returns a pointer to the
   allocated block or NULL if an underlying malloc() failed. */
void *tre_mem_alloc_impl(tre_mem_t mem, int provided, void *provided_block,
                         int zero, size_t size) {
  void *ptr;
  if (mem->failed) {
    return NULL;
  }
  if (mem->n < size) {
    /* We need more memory than is available in the current block.
       Allocate a new block. */
    tre_list_t *l;
    if (provided) {
      if (provided_block == NULL) {
        mem->failed = 1;
        return NULL;
      }
      mem->ptr = provided_block;
      mem->n = TRE_MEM_BLOCK_SIZE;
    } else {
      int block_size;
      if (size * 8 > TRE_MEM_BLOCK_SIZE)
        block_size = size * 8;
      else
        block_size = TRE_MEM_BLOCK_SIZE;
      l = malloc(sizeof(*l));
      if (l == NULL) {
        mem->failed = 1;
        return NULL;
      }
      l->data = malloc(block_size);
      if (l->data == NULL) {
        free(l), l = NULL;
        mem->failed = 1;
        return NULL;
      }
      l->next = NULL;
      if (mem->current != NULL) mem->current->next = l;
      if (mem->blocks == NULL) mem->blocks = l;
      mem->current = l;
      mem->ptr = l->data;
      mem->n = block_size;
    }
  }
  /* Make sure the next pointer will be aligned. */
  size += ALIGN(mem->ptr + size, long);
  /* Allocate from current block. */
  ptr = mem->ptr;
  mem->ptr += size;
  mem->n -= size;
  /* Set to zero if needed. */
  if (zero) bzero(ptr, size);
  return ptr;
}
