[go: up one dir, main page]

Menu

[r456]: / tags / 0.6.4 / src / table.c  Maximize  Restore  History

Download this file

135 lines (103 with data), 2.9 kB

  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
/* $Id$
* -------------------------------------------------------
* Copyright (C) 2002-2005 Tommi Saviranta <wnd@iki.fi>
* (C) 1998-2002 Sebastian Kienzl <zap@riot.org>
* -------------------------------------------------------
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program 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 General Public License for more details.
*/
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif /* ifdef HAVE_CONFIG_H */
#include "etc.h"
#ifdef NEED_TABLE
#include "table.h"
#include "common.h"
#include <stdlib.h>
/* #define DEBUG */
void **
table_add_item(void **data, int elementsize, int *entries, int *indx)
{
int i;
int ind = -1;
for (i = 0; i < *entries; i++) {
if (data[i] == NULL) {
ind = i; /* xfree pointer found */
#ifdef DEBUG
printf("using empty pointer at index %d.\n", ind);
#endif /* ifdef DEBUG */
}
}
if (ind < 0) {
/* Allocate new pointer. */
++(*entries);
data = (void **) xrealloc(data, *entries * sizeof(void *));
ind = *entries - 1;
#ifdef DEBUG
printf("allocating new pointer. %d entries, index %d\n",
*entries, ind);
#endif /* ifdef DEBUG */
}
data[ind] = (void *) xmalloc(elementsize);
*indx = ind;
return data;
} /* void **table_add_item(void **data, int elementsize, int *entries,
int *indx) */
void **
table_compact(void **data, int *entries)
{
#ifdef DEBUG
int x = 0;
#endif /* ifdef DEBUG */
int i = *entries - 1;
while (i >= 0 && data[i] == NULL) { i--; }
i++;
if (*entries != 0 && i == 0) {
xfree(data);
data = NULL;
} else {
data = (void **) xrealloc(data, i * sizeof(void *));
}
*entries = i;
#ifdef DEBUG
printf("reduced %d (size %d)\n", x, *entries);
if (*entries == 0) {
printf("ignore: pointer-array is now empty\n");
}
#endif /* ifdef DEBUG */
return data;
} /* void **table_compact(void **data, int *entries) */
void **
table_rem_item(void **data, int number, int *entries)
{
if (number >= 0 && number < *entries) {
#ifdef DEBUG
printf("deleting entry %d, compacting table: ", number);
#endif /* ifdef DEBUG */
xfree(data[number]);
data[number] = NULL;
}
data = table_compact(data, entries);
return data;
} /* void **table_rem_item(void **data, int number, int *entries) */
void **
table_free(void **data, int *entries, int clear)
{
int i;
for (i = 0; i < *entries; i++) {
xfree(data[i]);
}
xfree(data);
if (clear == 1) {
*entries = 0;
}
return 0;
} /* void **table_free(void **data, int *entries, int clear) */
#endif /* ifdef NEED_TABLE */