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);
90 int main(int argc, char *argv[])
94 trie_t *trie = trie_new();
95 trie_insert(trie, "abcde123456789");
96 trie_insert(trie, "abcde123654789");
97 trie_insert(trie, "abcdefghi");
98 trie_insert(trie, "coucou");
99 trie_insert(trie, "coucou chez vous");
100 trie_insert(trie, "debout !");
101 trie_compile(trie, false);
102 trie_inspect(trie, true);
104 #define ASSERT_TRUE(str) \
105 if (!trie_lookup(trie, str)) { \
106 printf("\"%s\" not found in trie\n", str); \
109 #define ASSERT_FALSE(str) \
110 if (trie_lookup(trie, str)) { \
111 printf("\"%s\" found in trie\n", str); \
115 ASSERT_FALSE("coucou ");
116 ASSERT_FALSE("abcde123");
117 ASSERT_FALSE("abcde");
118 ASSERT_FALSE("coucou chez vous tous");
119 ASSERT_TRUE("abcde123456789");
120 ASSERT_TRUE("abcde123456789");
121 ASSERT_TRUE("abcde123654789");
122 ASSERT_TRUE("abcdefghi");
123 ASSERT_TRUE("coucou");
124 ASSERT_TRUE("coucou chez vous");
125 ASSERT_TRUE("debout !");
132 trie = create_trie_from_file(argv[1]);
133 trie_inspect(trie, false);
135 const uint32_t how_many = 8 * 1000 * 1000;
136 struct timeval start, end;
139 gettimeofday(&start, NULL);
140 for (uint32_t i = 0 ; i < how_many ; ++i) {
141 trie_lookup(trie, argv[2]);
143 gettimeofday(&end, NULL);
144 diff = (end.tv_sec - start.tv_sec) + (double)(end.tv_usec - start.tv_usec) / 10e6;
145 printf("%u lookups per second\n", (int)(how_many / diff));