summaryrefslogtreecommitdiff
path: root/src/base/idManager.c
blob: dea2e955f9eb956ce01c7787ea6c6aa17c56c338 (plain)
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
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
#include <stdlib.h>
#include <stdio.h>
#include <assert.h>

#include "main.h"
#include "list.h"
#include "idManager.h"

static list_t *listID;
static int lastID;

typedef struct id_item_struct {
	int id;
	int count;
} id_item_t;

static id_item_t *newIdItem(int id, int count)
{
	id_item_t *new;

	new = malloc(sizeof(id_item_t));
	new->id = id;
	new->count = count;

	return new;
}

static void destroyIdItem(id_item_t *p)
{
	assert(p != NULL);

	free(p);
}

void id_init_list()
{
	DEBUG_MSG(_("[Debug] Initializing ID manager\n"));

	listID = list_new();
	lastID = 0;

}

int id_is_register(int id)
{
	int i;

	assert(listID != NULL);

	for (i = 0; i < listID->count; i++) {
		id_item_t *this;

		this = listID->list[i];

		if (this->id == id) {
			return i;
		}
	}

	return -1;
}

static int findNewID()
{
	int ret;

	assert(listID != NULL);

	if (listID->count >= MAX_ID - 1) {
		assert(!_("[Error] There is no free ID left"));
	}

	do {
		/*ret  = (random() % (listID->count + 8 )) + 1;*/
		ret = random() % MAX_ID + 1;
	} while (id_is_register(ret) != -1);

	/*printf("new ID %d\n", ret);*/

	return ret;
}

int id_get_newcount(int count)
{
	int id;

	id = findNewID();

	list_add(listID, newIdItem(id, count));

	return id;
}

int id_get_new()
{
	return id_get_newcount(1);
}

void id_inc(int id)
{
	id_item_t *this;
	int index;

	assert(listID != NULL);

	index = id_is_register(id);

	if (index == -1) {
		fprintf(stderr, _("[Error] Trying to increment counter of never registered ID [%d]"), id);
		assert(0);
		return;		/* ha ha ha */
	}

	this = listID->list[index];

	this->count++;

	/*printf("inc ID %d %d\n", this->id, this->count);*/
	return;
}

void id_del(int id)
{
	id_item_t *this;
	int index;

	assert(listID != NULL);

	index = id_is_register(id);

	if (index == -1) {
		fprintf(stderr, _("[Error] Trying to delete never registered ID [%d]"), id);
		assert(0);
		return;		/* ha ha ha */
	}

	this = listID->list[index];

	this->count--;
	/*printf("dec ID %d %d\n", this->id, this->count);*/

	if (this->count <= 0) {
		list_del_item(listID, index, free);
		/*printf("listID->count = %d\n", listID->count);*/
	}

	return;
}

void id_replace(int old_id, int new_id)
{
	int index_old_id;
	int index_new_id;
	id_item_t *this;

	if (old_id == new_id) {
		return;
	}

	index_old_id = id_is_register(old_id);
	assert(index_old_id != -1);

	index_new_id = id_is_register(new_id);
	assert(index_new_id == -1);

	this = listID->list[index_old_id];
	this->id = new_id;
}

void infoID(int id)
{
	id_item_t *this;
	int index;

	assert(listID != NULL);

	index = id_is_register(id);

	if (index == -1) {
		DEBUG_MSG(_("[Debug] Getting information of nonexistent ID [%d]\n"), id);

		return;
	}

	this = listID->list[index];

	DEBUG_MSG(_("[Debug] ID information [%d]: used %d times\n"), this->id, this->count);

	return;
}

void id_quit_list()
{
	DEBUG_MSG(_("[Debug] Shutting down ID manager\n"));

	assert(listID != NULL);
	list_destroy_item(listID, destroyIdItem);
}