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
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
|
/* -*- Mode: C; tab-width: 8; indent-tabs-mode: t; c-basic-offset: 8 -*- */
/*
* hgarray.c
* Copyright (C) 2010 Akira TAGOH
*
* Authors:
* Akira TAGOH <akira@tagoh.org>
*
* 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 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; if not, write to the
* Free Software Foundation, Inc., 59 Temple Place - Suite 330,
* Boston, MA 02111-1307, USA.
*/
#ifdef HAVE_CONFIG_H
#include "config.h"
#endif
#include "hgarray.h"
#include "hgint.h"
#include "hgmem.h"
#include "hgnull.h"
#include "main.h"
hg_mem_t *mem = NULL;
hg_object_vtable_t *vtable = NULL;
/** common **/
void
setup(void)
{
hg_object_init();
HG_ARRAY_INIT;
mem = hg_mem_new(HG_MEM_TYPE_LOCAL, 100000);
vtable = hg_object_array_get_vtable();
}
void
teardown(void)
{
gchar *e = hieroglyph_test_pop_error();
if (e) {
g_print("E: %s\n", e);
g_free(e);
}
hg_object_tini();
hg_mem_destroy(mem);
}
/** test cases **/
TDEF (get_capsulated_size)
{
gsize size;
size = vtable->get_capsulated_size();
fail_unless(size == sizeof (hg_array_t), "Obtaining the different size: expect: %" G_GSIZE_FORMAT " actual: %" G_GSIZE_FORMAT, sizeof (hg_array_t), size);
} TEND
static gboolean
_gc_iter_func(hg_quark_t qdata,
gpointer data,
GError **error)
{
return TRUE;
}
static gboolean
_gc_func(hg_mem_t *mem,
hg_quark_t qkey,
hg_quark_t qval,
gpointer data,
GError **error)
{
hg_array_t *a = data;
if (data == NULL)
return TRUE;
return hg_object_gc_mark((hg_object_t *)a, _gc_iter_func, NULL, NULL);
}
TDEF (gc_mark)
{
hg_quark_t q;
hg_array_t *a;
gssize size = 0;
hg_mem_t *m = hg_mem_new(HG_MEM_TYPE_LOCAL, 256);
q = hg_array_new(m, 10, (gpointer *)&a);
fail_unless(hg_array_set(a, HG_QINT (1), 9, FALSE, NULL), "Unable to put a value into the array");
hg_mem_reserved_spool_set_garbage_collector(m, _gc_func, a);
size = hg_mem_collect_garbage(m);
fail_unless(size == 0, "missing something for marking: %ld bytes freed", size);
hg_mem_set_garbage_collector(m, NULL, NULL);
size = hg_mem_collect_garbage(m);
fail_unless(size == 0, "missing something for marking: %ld bytes freed", size);
size = hg_mem_collect_garbage(m);
fail_unless(size == 0, "missing something for marking: %ld bytes freed", size);
} TEND
TDEF (hg_array_new)
{
hg_quark_t q;
q = hg_array_new(mem, 65536, NULL);
fail_unless(q == Qnil, "Unexpected result to create too big array.");
g_free(hieroglyph_test_pop_error());
q = hg_array_new(mem, 0, NULL);
fail_unless(q != Qnil, "Unexpected result to create small array");
} TEND
TDEF (hg_array_set)
{
hg_quark_t q;
hg_array_t *a;
q = hg_array_new(mem, 5, (gpointer *)&a);
fail_unless(q != Qnil, "Unable to create an array object");
fail_unless(hg_array_length(a) == 0, "Unexpected result to obtain the size of the array.");
fail_unless(hg_array_maxlength(a) == 5, "Unexpected result to obtain the allocated size of the array.");
fail_unless(hg_array_set(a, HG_QINT (1), 0, FALSE, NULL), "Unable to put a value into the array.");
fail_unless(hg_array_length(a) == 1, "Unexpected result to obtain the size of the array after putting a value");
fail_unless(hg_array_get(a, 0, NULL) == HG_QINT (1), "Unexpected result to obtain the value in the array.");
q = hg_array_new(mem, 0, (gpointer *)&a);
fail_unless(q != Qnil, "Unable to create an array object");
fail_unless(hg_array_length(a) == 0, "Unexpected result to obtain the size of the 0-array.");
fail_unless(hg_array_maxlength(a) == 0, "Unexpected result to obtain the allocated size of the 0-array.");
fail_unless(!hg_array_set(a, HG_QINT (1), 0, FALSE, NULL), "Unexpected result to put a value into the 0-array.");
g_free(hieroglyph_test_pop_error());
fail_unless(hg_array_get(a, 0, NULL) == Qnil, "Unexpected result to obtain the value from the 0-array.");
g_free(hieroglyph_test_pop_error());
} TEND
TDEF (hg_array_get)
{
/* should be done the above */
} TEND
static gboolean
_a2s(hg_mem_t *mem,
hg_quark_t q,
gpointer data,
GError **error)
{
GString *s = data;
if (q == Qnil)
g_string_append(s, "nil ");
else if (HG_IS_QNULL (q))
g_string_append(s, "null ");
else
g_string_append_printf(s, "%ld ", hg_quark_get_value(q));
return TRUE;
}
TDEF (hg_array_insert)
{
hg_quark_t q, t;
hg_array_t *a;
GError *err = NULL;
GString *str = g_string_new(NULL);
q = hg_array_new(mem, 8, (gpointer *)&a);
fail_unless(q != Qnil, "Unable to create an array object");
fail_unless(hg_array_insert(a, HG_QINT(2), 0, NULL), "Unable to insert a value into the array"); /* [2] */
fail_unless(hg_array_length(a) == 1, "Unexpected result to obtain the current size of the array.");
fail_unless(hg_array_insert(a, HG_QINT(3), 0, NULL), "Unable to insert a value into the array [take 2]"); /* [3 2] */
fail_unless(hg_array_length(a) == 2, "Unexpected result to obtain the current size of the array. [take 2]");
fail_unless(hg_array_get(a, 1, NULL) == HG_QINT(2), "Unexpected result on shifting the content of the array after inserting.");
fail_unless(hg_array_insert(a, HG_QINT(4), 3, NULL), "Unable to insert a value into the array [take 3]"); /* [3 2 nil 4] */
fail_unless(hg_array_length(a) == 4, "Unexpected result to obtain the current size of the array. [take 3]");
fail_unless(hg_array_insert(a, HG_QINT(5), 1, NULL), "Unable to insert a value into the array [take 4]"); /* [3 5 2 nil 4] */
t = hg_array_get(a, 2, NULL);
fail_unless(t == HG_QINT(2), "Unexpected result on shifting the content of the array after inserting [take 4]: actual: %ld", hg_quark_get_value(t));
t = hg_array_get(a, 3, &err);
fail_unless(HG_IS_QNULL (t) && err == NULL, "Unexpected result to obtain 3rd element in the array.");
hg_array_foreach(a, _a2s, str, NULL);
fail_unless(strcmp(str->str, "3 5 2 null 4 ") == 0, "Unexpected result on converting the array to the string: actual: %s", str->str);
fail_unless(!hg_array_remove(a, 5), "Unexpected result to remove an element outside of the array.");
g_free(hieroglyph_test_pop_error());
fail_unless(hg_array_remove(a, 1), "Unable to remove an element from the array."); /* [3 2 nil 4] */
fail_unless(hg_array_length(a) == 4, "Unexpected result to obtain the current size of the array after removing.");
fail_unless(hg_array_get(a, 1, NULL) == HG_QINT (2), "Unexpected result on the value after removing.");
} TEND
TDEF (hg_array_remove)
{
/* should be done the above */
} TEND
TDEF (hg_array_length)
{
/* should be done the above */
} TEND
TDEF (hg_array_maxlength)
{
/* should be done the above */
} TEND
TDEF (hg_array_foreach)
{
/* should be done the above */
} TEND
/****/
Suite *
hieroglyph_suite(void)
{
Suite *s = suite_create("hgarray.h");
TCase *tc = tcase_create("Generic Functionalities");
tcase_add_checked_fixture(tc, setup, teardown);
T (get_capsulated_size);
T (gc_mark);
T (hg_array_new);
T (hg_array_set);
T (hg_array_get);
T (hg_array_insert);
T (hg_array_remove);
T (hg_array_length);
T (hg_array_maxlength);
T (hg_array_foreach);
suite_add_tcase(s, tc);
return s;
}
|
