1 /******************************************************************************/
2 /* pfixtools: a collection of postfix related tools */
4 /* ________________________________________________________________________ */
6 /* Redistribution and use in source and binary forms, with or without */
7 /* modification, are permitted provided that the following conditions */
10 /* 1. Redistributions of source code must retain the above copyright */
11 /* notice, this list of conditions and the following disclaimer. */
12 /* 2. Redistributions in binary form must reproduce the above copyright */
13 /* notice, this list of conditions and the following disclaimer in the */
14 /* documentation and/or other materials provided with the distribution. */
15 /* 3. The names of its contributors may not be used to endorse or promote */
16 /* products derived from this software without specific prior written */
19 /* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND */
20 /* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE */
21 /* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR */
22 /* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS */
23 /* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR */
24 /* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF */
25 /* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS */
26 /* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN */
27 /* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) */
28 /* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF */
29 /* THE POSSIBILITY OF SUCH DAMAGE. */
30 /******************************************************************************/
33 * Copyright © 2008 Florent Bruneau
43 static trie_t *create_trie_from_file(const char *file)
50 if (!file_map_open(&map, file, false)) {
55 while (end > p && end[-1] != '\n') {
59 warn("file %s miss a final \\n, ignoring last line", file);
63 while (p < end && p != NULL) {
64 const char *eol = (char *)memchr(p, '\n', end - p);
68 if (eol - p > BUFSIZ) {
73 for (const char *s = eol - 1 ; s >= p ; --s) {
74 line[i++] = ascii_tolower(*s);
77 memcpy(line, p, eol - p);
81 trie_insert(db, line);
85 trie_compile(db, false);
91 static void check_trie_with_file(const trie_t *db, const char *file)
97 if (!file_map_open(&map, file, false)) {
102 while (end > p && end[-1] != '\n') {
105 if (end != map.end) {
106 warn("file %s miss a final \\n, ignoring last line", file);
109 while (p < end && p != NULL) {
110 const char *eol = (char *)memchr(p, '\n', end - p);
114 if (eol - p > BUFSIZ) {
119 for (const char *s = eol - 1 ; s >= p ; --s) {
120 line[i++] = ascii_tolower(*s);
123 memcpy(line, p, eol - p);
127 if (!trie_lookup(db, line)) {
128 warn("'%s' not found in the trie", line);
132 file_map_close(&map);
136 static bool test_linear(const uint8_t *start, uint32_t len, uint8_t data) {
137 const uint8_t *end = start + len;
138 while (start < end) {
139 const uint8_t val = *start;
142 } else if (val > data) {
150 static bool test_dicho(const uint8_t *start, uint32_t len, uint8_t data) {
151 const uint8_t *end = start + len;
153 while (start < end) {
154 const uint8_t *mid = start + ((end - start) >> 1);
155 const uint8_t val = *mid;
159 } else if (data < val) {
168 __attribute__((used))
169 static void test_lookup(void) {
173 printf("size,dicho,linear\n");
174 for (int i = 1 ; i < 64 ; ++i) {
177 memset(set, 1, 64 * sizeof(bool));
178 while (selected > i) {
179 int val = rand() % 64;
187 memset(set, 0, 64 * sizeof(bool));
188 while (selected < i) {
189 int val = rand() % 64;
197 for (int j = 0 ; j < 64 ; ++j) {
204 struct timeval start, end;
205 double diff_dicho, diff_linear;
206 const int iterations = 50000000;
208 gettimeofday(&start, NULL);
209 for (int k = 0 ; k < iterations ; ++k) {
210 for (int j = 0 ; j < 64 ; ++j) {
211 test_dicho(data, i, j);
214 gettimeofday(&end, NULL);
215 diff_dicho = ((end.tv_sec - start.tv_sec) * 10.0)
216 + (double)(end.tv_usec - start.tv_usec) / 10e5;
218 gettimeofday(&start, NULL);
219 for (int k = 0 ; k < iterations ; ++k) {
220 for (int j = 0 ; j < 64 ; ++j) {
221 test_linear(data, i, j);
224 gettimeofday(&end, NULL);
225 diff_linear = ((end.tv_sec - start.tv_sec) * 10.0)
226 + (double)(end.tv_usec - start.tv_usec) / 10e5;
227 printf("%d,%d,%d\n", i, (int)diff_dicho, (int)diff_linear);
232 int main(int argc, char *argv[])
238 trie_t *trie = trie_new();
239 trie_insert(trie, "abcde123456789");
240 trie_insert(trie, "abcde123654789");
241 trie_insert(trie, "abcdefghi");
242 trie_insert(trie, "coucou");
243 trie_insert(trie, "coucou chez vous");
244 trie_insert(trie, "debout !");
245 trie_compile(trie, false);
246 trie_inspect(trie, true);
248 #define ASSERT_TRUE(str) \
249 if (!trie_lookup(trie, str)) { \
250 printf("\"%s\" not found in trie\n", str); \
253 #define ASSERT_FALSE(str) \
254 if (trie_lookup(trie, str)) { \
255 printf("\"%s\" found in trie\n", str); \
259 ASSERT_FALSE("coucou ");
260 ASSERT_FALSE("abcde123");
261 ASSERT_FALSE("abcde");
262 ASSERT_FALSE("coucou chez vous tous");
263 ASSERT_TRUE("abcde123456789");
264 ASSERT_TRUE("abcde123456789");
265 ASSERT_TRUE("abcde123654789");
266 ASSERT_TRUE("abcdefghi");
267 ASSERT_TRUE("coucou");
268 ASSERT_TRUE("coucou chez vous");
269 ASSERT_TRUE("debout !");
276 trie = create_trie_from_file(argv[1]);
277 trie_inspect(trie, false);
278 check_trie_with_file(trie, argv[1]);
280 const uint32_t how_many = 8 * 1000 * 1000;
281 struct timeval start, end;
284 gettimeofday(&start, NULL);
285 for (uint32_t i = 0 ; i < how_many ; ++i) {
286 trie_lookup(trie, argv[2]);
288 gettimeofday(&end, NULL);
289 diff = (end.tv_sec - start.tv_sec) + (double)(end.tv_usec - start.tv_usec) / 10e6;
290 printf("%u lookups per second\n", (int)(how_many / diff));