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
|
/*
* $Id: hash.c,v 1.4 2006/03/13 12:29:46 bogdan_iancu Exp $
*
* Hash functions for cached domain table
*
* Copyright (C) 2002-2003 Juha Heinanen
*
* This file is part of openser, a free SIP server.
*
* openser 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; either version 2 of the License, or
* (at your option) any later version
*
* openser 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, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
#include "domain_mod.h"
#include "../../dprint.h"
#include "../../mem/shm_mem.h"
#include "../../ut.h"
#include "../../hash_func.h"
#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include <ctype.h>
#define dom_hash(_s) core_case_hash( _s, 0, DOM_HASH_SIZE)
/* Add domain to hash table */
int hash_table_install (struct domain_list **hash_table, char *domain)
{
struct domain_list *np;
unsigned int hash_val;
np = (struct domain_list *) shm_malloc(sizeof(*np));
if (np == NULL) {
LOG(L_CRIT, "hash_install(): Cannot allocate memory for table entry\n");
return -1;
}
np->domain.len = strlen(domain);
np->domain.s = (char *) shm_malloc(np->domain.len);
if (np->domain.s == NULL) {
LOG(L_CRIT, "hash_install(): Cannot allocate memory for domain string\n");
return -1;
}
(void) strncpy(np->domain.s, domain, np->domain.len);
hash_val = dom_hash(&np->domain);
np->next = hash_table[hash_val];
hash_table[hash_val] = np;
return 1;
}
/* Check if domain exists in hash table */
int hash_table_lookup (str *domain)
{
struct domain_list *np;
for (np = (*hash_table)[dom_hash(domain)]; np != NULL; np = np->next) {
if ((np->domain.len == domain->len) &&
(strncasecmp(np->domain.s, domain->s, domain->len) == 0)) {
return 1;
}
}
return -1;
}
/* Print domains stored in hash table */
void hash_table_print (struct domain_list **hash_table, FILE *reply_file)
{
int i;
struct domain_list *np;
for (i = 0; i < DOM_HASH_SIZE; i++) {
np = hash_table[i];
while (np) {
fprintf(reply_file, "%4d %.*s\n", i, np->domain.len, ZSW(np->domain.s));
np = np->next;
}
}
}
/* Free contents of hash table */
void hash_table_free (struct domain_list **hash_table)
{
int i;
struct domain_list *np, *next;
for (i = 0; i < DOM_HASH_SIZE; i++) {
np = hash_table[i];
while (np) {
shm_free(np->domain.s);
next = np->next;
shm_free(np);
np = next;
}
hash_table[i] = NULL;
}
}
|
