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
|
/*
* Copyright 2015 Vincent Sanders <vince@netsurf-browser.org>
* Copyright 2006 Rob Kendrick <rjek@netsurf-browser.org>
*
* This file is part of NetSurf, http://www.netsurf-browser.org/
*
* NetSurf 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; version 2 of the License.
*
* NetSurf 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.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
/**
* \file
* Test hash table operations.
*
* Implementation taken from original test rig in bloom filter code
*/
#include <assert.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <check.h>
#include "utils/hashtable.h"
/* Tests */
/**
* Test hash table creation
*
* Create a hash table, add a single entry and test for value retival
* from key.
*
*/
START_TEST(hashtable_create_test)
{
struct hash_table *ht;
ht = hash_create(42);
ck_assert(ht != NULL);
hash_destroy(ht);
}
END_TEST
/**
* Test hash table simple operation
*
* Create a hash table, add a single entry and test for failed retival
* from not present key.
*
*/
START_TEST(hashtable_negative_test)
{
struct hash_table *ht;
bool added;
const char *res;
/* create hash */
ht = hash_create(42);
ck_assert(ht != NULL);
/* add entry */
added = hash_add(ht, "cow", "moo");
ck_assert(added == true);
res = hash_get(ht, "sheep");
ck_assert(res == NULL);
hash_destroy(ht);
}
END_TEST
/**
* Test hash table simple operation
*
* Create a hash table, add a single entry and test for sucessful
* retrival of key.
*
*/
START_TEST(hashtable_positive_test)
{
struct hash_table *ht;
bool added;
const char *res;
/* create hash */
ht = hash_create(42);
ck_assert(ht != NULL);
/* add entry */
added = hash_add(ht, "cow", "moo");
ck_assert(added == true);
res = hash_get(ht, "cow");
ck_assert(res != NULL);
ck_assert_str_eq(res, "moo");
hash_destroy(ht);
}
END_TEST
/* Suite */
Suite *hashtable_suite(void)
{
Suite *s;
TCase *tc_create;
s = suite_create("hash table filter");
/* Core API */
tc_create = tcase_create("Core");
tcase_add_test(tc_create, hashtable_create_test);
tcase_add_test(tc_create, hashtable_negative_test);
tcase_add_test(tc_create, hashtable_positive_test);
suite_add_tcase(s, tc_create);
return s;
}
int main(int argc, char **argv)
{
int number_failed;
Suite *s;
SRunner *sr;
s = hashtable_suite();
sr = srunner_create(s);
srunner_run_all(sr, CK_ENV);
number_failed = srunner_ntests_failed(sr);
srunner_free(sr);
return (number_failed == 0) ? EXIT_SUCCESS : EXIT_FAILURE;
}
|
