1 files changed, 108 insertions, 0 deletions
diff --git a/lib/fribidi/fribidi_mem.c b/lib/fribidi/fribidi_mem.c
new file mode 100644
index 0000000000..de90d941fa
--- /dev/null
+++ b/lib/fribidi/fribidi_mem.c
@@ -0,0 +1,108 @@
+/* FriBidi - Library of BiDi algorithm
+ * Copyright (C) 2001,2002 Behdad Esfahbod.
+ * 
+ * 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, or (at your option) any later version.
+ * 
+ * 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, in a file named COPYING; if not, write to the
+ * Free Software Foundation, Inc., 59 Temple Place, Suite 330,
+ * Boston, MA 02111-1307, USA
+ * 
+ * For licensing issues, contact <fwpg@sharif.edu>.
+ */
+
+#include "fribidi_mem.h"
+
+#include <stdlib.h>
+
+struct _FriBidiMemChunk
+{
+  const char *name;
+  int atom_size;
+  int area_size;
+  int type;
+
+  int empty_size;
+  void *chunk;
+};
+
+FriBidiList *
+fribidi_list_append (FriBidiList *list, void *data)
+{
+  FriBidiList *node, *last;
+
+  node = malloc (sizeof (FriBidiList));
+  node->data = data;
+  node->next = NULL;
+  node->prev = NULL;
+
+  if (!list)
+    return node;
+
+  for (last = list; !last->next; last = last->next);
+  node->prev = last;
+  last->next = node;
+  return list;
+}
+
+FriBidiMemChunk *
+fribidi_mem_chunk_new (const char *name,
+		       int atom_size, unsigned long area_size, int type)
+{
+  FriBidiMemChunk *m = (FriBidiMemChunk *) malloc (sizeof (FriBidiMemChunk));
+
+  m->name = name;
+  m->atom_size = atom_size;
+  m->area_size = area_size;
+  m->type = type;
+
+  m->empty_size = 0;
+  m->chunk = NULL;
+
+  return m;
+}
+
+void
+fribidi_mem_chunk_destroy (FriBidiMemChunk *mem_chunk)
+{
+  free (mem_chunk);
+  return;
+}
+
+void *
+fribidi_mem_chunk_alloc (FriBidiMemChunk *mem_chunk)
+{
+  void *m;
+
+  if (mem_chunk->type == FRIBIDI_ALLOC_ONLY)
+    {
+      if (mem_chunk->empty_size < mem_chunk->atom_size)
+	{
+	  mem_chunk->chunk = malloc (mem_chunk->area_size);
+	  mem_chunk->empty_size = mem_chunk->area_size;
+	}
+      m = mem_chunk->chunk;
+      mem_chunk->chunk = (void *)
+	((char *) mem_chunk->chunk + mem_chunk->atom_size);
+      mem_chunk->empty_size -= mem_chunk->atom_size;
+    }
+  else
+    m = (void *) malloc (mem_chunk->atom_size);
+  return m;
+}
+
+void
+fribidi_mem_chunk_free (FriBidiMemChunk *mem_chunk, void *mem)
+{
+  if (mem_chunk->type == FRIBIDI_ALLOC_AND_FREE)
+    free (mem);
+  return;
+}