1 /******************************************************************************/
2 /* postlicyd: a postfix policy daemon with a lot of features */
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 © 2007 Pierre Habouzit
36 #include <arpa/inet.h>
38 #include <netinet/in.h>
47 #define IPv4_PREFIX(ip) ((uint32_t)(ip) >> IPv4_BITS)
48 #define IPv4_SUFFIX(ip) ((uint32_t)(ip) & ((1 << IPv4_BITS) - 1))
49 #define NODE(db, i) ((db)->tree + (i))
65 static int get_o(const char *s, const char **out)
69 if (*s < '0' || *s > '9')
73 if (*s < '0' || *s > '9')
76 res = res * 10 + *s++ - '0';
77 if (*s < '0' || *s > '9')
80 res = res * 10 + *s++ - '0';
81 if (!(*s < '0' || *s > '9') || res < 100)
89 static int parse_ipv4(const char *s, const char **out, uint32_t *ip)
94 if ((o & ~0xff) || *s++ != '.')
99 if ((o & ~0xff) || *s++ != '.')
104 if ((o & ~0xff) || *s++ != '.')
117 rbldb_t *rbldb_create(const char *file)
120 const char *map, *p, *end;
124 fd = open(file, O_RDONLY, 0000);
130 if (fstat(fd, &st) < 0) {
136 p = map = mmap(NULL, st.st_size, PROT_READ, MAP_PRIVATE, fd, 0);
137 if (map == MAP_FAILED) {
144 end = map + st.st_size;
145 while (end > map && end[-1] != '\n') {
148 if (end != map + st.st_size) {
149 syslog(LOG_WARNING, "file %s miss a final \\n, ignoring last line",
153 db = p_new(rbldb_t, 1);
157 while (*p == ' ' || *p == '\t' || *p == '\r')
160 if (parse_ipv4(p, &p, &ip) < 0) {
161 p = (char *)memchr(p, '\n', end - p) + 1;
163 if (db->len >= db->size) {
164 db->size += 64 * 1024;
165 p_realloc(&db->ips, db->size);
167 db->ips[db->len++] = ip;
170 munmap((void*)map, st.st_size);
173 # define QSORT_TYPE uint32_t
174 # define QSORT_BASE db->ips
175 # define QSORT_NELT db->len
176 # define QSORT_LT(a,b) *a < *b
180 syslog(LOG_INFO, "rbl %s loaded, %d IPs", file, db->len);
184 void rbldb_delete(rbldb_t **db)
187 p_delete(&(*db)->ips);
192 uint32_t rbldb_stats(rbldb_t *rbl)
197 bool rbldb_ipv4_lookup(rbldb_t *db, uint32_t ip)
199 int l = 0, r = db->len;
204 if (db->ips[i] == ip)
207 if (ip < db->ips[i]) {