Annotation of win32/gnome/gmime-x.x.x/memchunk.c, revision 1.1
1.1 ! paf 1: /* -*- Mode: C; tab-width: 8; indent-tabs-mode: t; c-basic-offset: 8 -*- */
! 2: /*
! 3: * Authors: Jeffrey Stedfast <fejj@ximian.com>
! 4: *
! 5: * Copyright 2001 Ximian, Inc. (www.ximian.com)
! 6: *
! 7: * This program is free software; you can redistribute it and/or modify
! 8: * it under the terms of the GNU General Public License as published by
! 9: * the Free Software Foundation; either version 2 of the License, or
! 10: * (at your option) any later version.
! 11: *
! 12: * This program is distributed in the hope that it will be useful,
! 13: * but WITHOUT ANY WARRANTY; without even the implied warranty of
! 14: * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
! 15: * GNU General Public License for more details.
! 16: *
! 17: * You should have received a copy of the GNU General Public License
! 18: * along with this program; if not, write to the Free Software
! 19: * Foundation, Inc., 59 Temple Street #330, Boston, MA 02111-1307, USA.
! 20: *
! 21: */
! 22:
! 23:
! 24: #ifdef HAVE_CONFIG_H
! 25: #include <config.h>
! 26: #endif
! 27:
! 28: #include <stdlib.h>
! 29: #include <string.h>
! 30:
! 31: #ifdef HAVE_ALLOCA_H
! 32: #include <alloca.h>
! 33: #endif
! 34:
! 35: #include "memchunk.h"
! 36:
! 37:
! 38: typedef struct _MemChunkFreeNode {
! 39: struct _MemChunkFreeNode *next;
! 40: unsigned int atoms;
! 41: } MemChunkFreeNode;
! 42:
! 43: typedef struct _MemChunkNodeInfo {
! 44: struct _MemChunkNodeInfo *next;
! 45: unsigned char *block;
! 46: size_t blocksize;
! 47: size_t atoms;
! 48: } MemChunkNodeInfo;
! 49:
! 50: struct _MemChunk {
! 51: size_t atomsize;
! 52: size_t atomcount;
! 53: size_t blocksize;
! 54: GPtrArray *blocks;
! 55: gboolean autoclean;
! 56: MemChunkFreeNode *free;
! 57: };
! 58:
! 59:
! 60: static int
! 61: tree_compare (MemChunkNodeInfo *a, MemChunkNodeInfo *b)
! 62: {
! 63: if (a->block > b->block)
! 64: return 1;
! 65: else if (a->block < b->block)
! 66: return -1;
! 67: else
! 68: return 0;
! 69: }
! 70:
! 71: static int
! 72: tree_search (MemChunkNodeInfo *info, unsigned char *mem)
! 73: {
! 74: if (info->block <= mem) {
! 75: if (mem < info->block + info->blocksize)
! 76: return 0;
! 77:
! 78: return 1;
! 79: }
! 80:
! 81: return -1;
! 82: }
! 83:
! 84: MemChunk *
! 85: memchunk_new (size_t atomsize, size_t atomcount, gboolean autoclean)
! 86: {
! 87: MemChunk *chunk;
! 88:
! 89: /* each atom has to be at least the size of a MemChunkFreeNode
! 90: for this to work */
! 91: atomsize = MAX (atomsize, sizeof (MemChunkFreeNode));
! 92:
! 93: chunk = g_malloc (sizeof (MemChunk));
! 94: chunk->atomsize = atomsize;
! 95: chunk->atomcount = atomcount;
! 96: chunk->blocksize = atomsize * atomcount;
! 97: chunk->autoclean = autoclean;
! 98: chunk->blocks = g_ptr_array_new ();
! 99: chunk->free = NULL;
! 100:
! 101: return chunk;
! 102: }
! 103:
! 104:
! 105: void *
! 106: memchunk_alloc (MemChunk *memchunk)
! 107: {
! 108: MemChunkFreeNode *node;
! 109: char *block;
! 110:
! 111: if (memchunk->free) {
! 112: node = memchunk->free;
! 113: node->atoms--;
! 114: if (node->atoms > 0)
! 115: return (char *) node + (node->atoms * memchunk->atomsize);
! 116:
! 117: memchunk->free = node->next;
! 118:
! 119: return (void *) node;
! 120: } else {
! 121: block = g_malloc (memchunk->blocksize);
! 122: g_ptr_array_add (memchunk->blocks, block);
! 123: node = (MemChunkFreeNode *) (block + memchunk->atomsize);
! 124: node->next = NULL;
! 125: node->atoms = memchunk->atomcount - 1;
! 126: memchunk->free = node;
! 127:
! 128: return (void *) block;
! 129: }
! 130: }
! 131:
! 132:
! 133: void *
! 134: memchunk_alloc0 (MemChunk *memchunk)
! 135: {
! 136: void *mem;
! 137:
! 138: mem = memchunk_alloc (memchunk);
! 139: memset (mem, 0, memchunk->atomsize);
! 140:
! 141: return mem;
! 142: }
! 143:
! 144:
! 145: void
! 146: memchunk_free (MemChunk *memchunk, void *mem)
! 147: {
! 148: MemChunkFreeNode *node;
! 149:
! 150: node = (MemChunkFreeNode *) mem;
! 151: node->next = memchunk->free;
! 152: node->atoms = 1;
! 153: memchunk->free = node;
! 154:
! 155: /* yuck, this'll be slow... */
! 156: if (memchunk->autoclean)
! 157: memchunk_clean (memchunk);
! 158: }
! 159:
! 160:
! 161: void
! 162: memchunk_reset (MemChunk *memchunk)
! 163: {
! 164: MemChunkFreeNode *node, *next = NULL;
! 165: int i;
! 166:
! 167: for (i = 0; i < memchunk->blocks->len; i++) {
! 168: node = memchunk->blocks->pdata[i];
! 169: node->atoms = memchunk->atomcount;
! 170: node->next = next;
! 171: next = node;
! 172: }
! 173:
! 174: memchunk->free = next;
! 175: }
! 176:
! 177: void
! 178: memchunk_clean (MemChunk *memchunk)
! 179: {
! 180: MemChunkNodeInfo *info, *next = NULL;
! 181: MemChunkFreeNode *node;
! 182: GTree *tree;
! 183: int i;
! 184:
! 185: node = memchunk->free;
! 186:
! 187: if (memchunk->blocks->len == 0 || node == NULL)
! 188: return;
! 189:
! 190: tree = g_tree_new ((GCompareFunc) tree_compare);
! 191: for (i = 0; i < memchunk->blocks->len; i++) {
! 192: info = alloca (sizeof (MemChunkNodeInfo));
! 193: info->next = next;
! 194: info->block = memchunk->blocks->pdata[i];
! 195: info->blocksize = memchunk->blocksize;
! 196: info->atoms = 0;
! 197:
! 198: next = info;
! 199:
! 200: g_tree_insert (tree, info, info);
! 201: }
! 202:
! 203: while (node) {
! 204: info = g_tree_search (tree, (GCompareFunc) tree_search, node);
! 205: if (info)
! 206: info->atoms += node->atoms;
! 207:
! 208: node = node->next;
! 209: }
! 210:
! 211: info = next;
! 212: while (info) {
! 213: if (info->atoms == memchunk->atomcount) {
! 214: MemChunkFreeNode *prev = NULL;
! 215:
! 216: node = memchunk->free;
! 217: while (node) {
! 218: if (tree_search (info, (void *) node) == 0) {
! 219: /* prune this node from our free-node list */
! 220: if (prev)
! 221: prev->next = node->next;
! 222: else
! 223: memchunk->free = node->next;
! 224: } else {
! 225: prev = node;
! 226: }
! 227:
! 228: node = node->next;
! 229: }
! 230:
! 231: /* free the block */
! 232: g_ptr_array_remove_fast (memchunk->blocks, info->block);
! 233: g_free (info->block);
! 234: }
! 235:
! 236: info = info->next;
! 237: }
! 238:
! 239: g_tree_destroy (tree);
! 240: }
! 241:
! 242: void
! 243: memchunk_destroy (MemChunk *memchunk)
! 244: {
! 245: int i;
! 246:
! 247: for (i = 0; i < memchunk->blocks->len; i++)
! 248: g_free (memchunk->blocks->pdata[i]);
! 249:
! 250: g_ptr_array_free (memchunk->blocks, TRUE);
! 251:
! 252: g_free (memchunk);
! 253: }
E-mail:
![[BACK]](/cvsweb/icons/back.gif){kind=icon}
Return to memchunk.c CVS log ![[TXT]](/cvsweb/icons/text.gif){kind=icon}
![[DIR]](/cvsweb/icons/dir.gif){kind=icon}
Up to [parser3project] / win32 / gnome / gmime-x.x.x