1 files changed, 0 insertions, 200 deletions
diff --git a/librabbitmq/amqp_mem.c b/librabbitmq/amqp_mem.c
deleted file mode 100644
index 3ad8c3e..0000000
--- a/librabbitmq/amqp_mem.c
+++ /dev/null
@@ -1,200 +0,0 @@
-/*
- * ***** BEGIN LICENSE BLOCK *****
- * Version: MPL 1.1/GPL 2.0
- *
- * The contents of this file are subject to the Mozilla Public License
- * Version 1.1 (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.mozilla.org/MPL/
- *
- * Software distributed under the License is distributed on an "AS IS"
- * basis, WITHOUT WARRANTY OF ANY KIND, either express or implied. See
- * the License for the specific language governing rights and
- * limitations under the License.
- *
- * The Original Code is librabbitmq.
- *
- * The Initial Developers of the Original Code are LShift Ltd, Cohesive
- * Financial Technologies LLC, and Rabbit Technologies Ltd.  Portions
- * created before 22-Nov-2008 00:00:00 GMT by LShift Ltd, Cohesive
- * Financial Technologies LLC, or Rabbit Technologies Ltd are Copyright
- * (C) 2007-2008 LShift Ltd, Cohesive Financial Technologies LLC, and
- * Rabbit Technologies Ltd.
- *
- * Portions created by LShift Ltd are Copyright (C) 2007-2009 LShift
- * Ltd. Portions created by Cohesive Financial Technologies LLC are
- * Copyright (C) 2007-2009 Cohesive Financial Technologies
- * LLC. Portions created by Rabbit Technologies Ltd are Copyright (C)
- * 2007-2009 Rabbit Technologies Ltd.
- *
- * Portions created by Tony Garnock-Jones are Copyright (C) 2009-2010
- * LShift Ltd and Tony Garnock-Jones.
- *
- * All Rights Reserved.
- *
- * Contributor(s): ______________________________________.
- *
- * Alternatively, the contents of this file may be used under the terms
- * of the GNU General Public License Version 2 or later (the "GPL"), in
- * which case the provisions of the GPL are applicable instead of those
- * above. If you wish to allow use of your version of this file only
- * under the terms of the GPL, and not to allow others to use your
- * version of this file under the terms of the MPL, indicate your
- * decision by deleting the provisions above and replace them with the
- * notice and other provisions required by the GPL. If you do not
- * delete the provisions above, a recipient may use your version of
- * this file under the terms of any one of the MPL or the GPL.
- *
- * ***** END LICENSE BLOCK *****
- */
-
-#include <stdlib.h>
-#include <stdio.h>
-#include <string.h>
-#include <stdint.h>
-#include <sys/types.h>
-#include <assert.h>
-
-#include "amqp.h"
-#include "config.h"
-
-char const *amqp_version(void) {
-  return VERSION; /* defined in config.h */
-}
-
-void init_amqp_pool(amqp_pool_t *pool, size_t pagesize) {
-  pool->pagesize = pagesize ? pagesize : 4096;
-
-  pool->pages.num_blocks = 0;
-  pool->pages.blocklist = NULL;
-
-  pool->large_blocks.num_blocks = 0;
-  pool->large_blocks.blocklist = NULL;
-
-  pool->next_page = 0;
-  pool->alloc_block = NULL;
-  pool->alloc_used = 0;
-}
-
-static void empty_blocklist(amqp_pool_blocklist_t *x) {
-  int i;
-
-  for (i = 0; i < x->num_blocks; i++) {
-    free(x->blocklist[i]);
-  }
-  if (x->blocklist != NULL) {
-    free(x->blocklist);
-  }
-  x->num_blocks = 0;
-  x->blocklist = NULL;
-}
-
-void recycle_amqp_pool(amqp_pool_t *pool) {
-  empty_blocklist(&pool->large_blocks);
-  pool->next_page = 0;
-  pool->alloc_block = NULL;
-  pool->alloc_used = 0;
-}
-
-void empty_amqp_pool(amqp_pool_t *pool) {
-  recycle_amqp_pool(pool);
-  empty_blocklist(&pool->pages);
-}
-
-/* Returns 1 on success, 0 on failure */
-static int record_pool_block(amqp_pool_blocklist_t *x, void *block) {
-  size_t blocklistlength = sizeof(void *) * (x->num_blocks + 1);
-
-  if (x->blocklist == NULL) {
-    x->blocklist = malloc(blocklistlength);
-    if (x->blocklist == NULL)
-      return 0;
-  } else {
-    void *newbl = realloc(x->blocklist, blocklistlength);
-    if (newbl == NULL)
-      return 0;
-    x->blocklist = newbl;
-  }
-
-  x->blocklist[x->num_blocks] = block;
-  x->num_blocks++;
-  return 1;
-}
-
-void *amqp_pool_alloc(amqp_pool_t *pool, size_t amount) {
-  if (amount == 0) {
-    return NULL;
-  }
-
-  amount = (amount + 7) & (~7); /* round up to nearest 8-byte boundary */
-
-  if (amount > pool->pagesize) {
-    void *result = calloc(1, amount);
-    if (result == NULL) {
-      return NULL;
-    }
-    if (!record_pool_block(&pool->large_blocks, result))
-      return NULL;
-    return result;
-  }
-
-  if (pool->alloc_block != NULL) {
-    assert(pool->alloc_used <= pool->pagesize);
-
-    if (pool->alloc_used + amount <= pool->pagesize) {
-      void *result = pool->alloc_block + pool->alloc_used;
-      pool->alloc_used += amount;
-      return result;
-    }
-  }
-
-  if (pool->next_page >= pool->pages.num_blocks) {
-    pool->alloc_block = calloc(1, pool->pagesize);
-    if (pool->alloc_block == NULL) {
-      return NULL;
-    }
-    if (!record_pool_block(&pool->pages, pool->alloc_block))
-      return NULL;
-    pool->next_page = pool->pages.num_blocks;
-  } else {
-    pool->alloc_block = pool->pages.blocklist[pool->next_page];
-    pool->next_page++;
-  }
-
-  pool->alloc_used = amount;
-
-  return pool->alloc_block;
-}
-
-void amqp_pool_alloc_bytes(amqp_pool_t *pool, size_t amount, amqp_bytes_t *output) {
-  output->len = amount;
-  output->bytes = amqp_pool_alloc(pool, amount);
-}
-
-amqp_bytes_t amqp_cstring_bytes(char const *cstr) {
-  amqp_bytes_t result;
-  result.len = strlen(cstr);
-  result.bytes = (void *) cstr;
-  return result;
-}
-
-amqp_bytes_t amqp_bytes_malloc_dup(amqp_bytes_t src) {
-  amqp_bytes_t result;
-  result.len = src.len;
-  result.bytes = malloc(src.len);
-  if (result.bytes != NULL) {
-    memcpy(result.bytes, src.bytes, src.len);
-  }
-  return result;
-}
-
-amqp_bytes_t amqp_bytes_malloc(size_t amount) {
-  amqp_bytes_t result;
-  result.len = amount;
-  result.bytes = malloc(amount); /* will return NULL if it fails */
-  return result;
-}
-
-void amqp_bytes_free(amqp_bytes_t bytes) {
-  free(bytes.bytes);
-}