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
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
|
/*
ctrlproxy: A modular IRC proxy
(c) 2002-2008 Jelmer Vernooij <jelmer@nl.linux.org>
g_mkdir_with_parents() imported from libglib and
(C) Red Hat.
This program 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 3 of the License, or
(at your option) any later version.
This program 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., 675 Mass Ave, Cambridge, MA 02139, USA.
*/
#include "internals.h"
#include <errno.h>
#include <ctype.h>
#include <fcntl.h>
#include <glib/gstdio.h>
#ifndef HAVE_DAEMON
#include <sys/types.h>
#include <sys/stat.h>
#include <fcntl.h>
#include <unistd.h>
#endif
static inline int str_cmphelper(const char *a, const char *b, char sh, char sl, char eh, char el)
{
int i;
char h,l;
for (i = 0; a[i] && b[i]; i++) {
if (a[i] == b[i]) continue;
l = (a[i]>b[i]?b[i]:a[i]);
h = (a[i]>b[i]?a[i]:b[i]);
if (h < sh || h > eh || l < sl || l > el)
break;
if (h-sh != l-sl)
break;
}
return a[i]-b[i];
}
int str_asciicmp(const char *a, const char *b)
{
g_assert(a != NULL);
g_assert(b != NULL);
return str_cmphelper(a, b, 97, 65, 122, 90);
}
int str_strictrfc1459cmp(const char *a, const char *b)
{
g_assert(a != NULL);
g_assert(b != NULL);
return str_cmphelper(a, b, 97, 65, 125, 93);
}
int str_rfc1459cmp(const char *a, const char *b)
{
g_assert(a != NULL);
g_assert(b != NULL);
return str_cmphelper(a, b, 97, 65, 126, 94);
}
char *g_io_channel_ip_get_description(GIOChannel *ch)
{
socklen_t len = sizeof(struct sockaddr_storage);
struct sockaddr_storage sa;
char hostname[NI_MAXHOST];
char service[NI_MAXSERV];
char *description = NULL;
int fd = g_io_channel_unix_get_fd(ch);
if (getpeername (fd, (struct sockaddr *)&sa, &len) < 0) {
log_global(LOG_WARNING, "Unable to obtain remote IP address: %s",
strerror(errno));
return NULL;
}
if (sa.ss_family != AF_INET && sa.ss_family != AF_INET6)
return NULL;
if (getnameinfo((struct sockaddr *)&sa, len, hostname, sizeof(hostname),
service, sizeof(service), NI_NOFQDN | NI_NUMERICSERV) == 0) {
description = g_strdup_printf("%s:%s", hostname, service);
}
return description;
}
char *list_make_string(GList *list)
{
size_t len = 20;
char *ret;
GList *gl;
/* First, calculate the length */
for(gl = list; gl; gl = gl->next) len+=strlen(gl->data)+1;
ret = g_new(char,len);
ret[0] = '\0';
for(gl = list; gl; gl = gl->next)
{
strncat(ret, gl->data, len);
if (gl->next) strncat(ret, " ", len);
}
return ret;
}
const char *g_io_channel_unix_get_sock_error(GIOChannel *ioc)
{
int valopt;
socklen_t valoptlen = sizeof(valopt);
int fd = g_io_channel_unix_get_fd(ioc);
getsockopt(fd, SOL_SOCKET, SO_ERROR, &valopt, &valoptlen);
return strerror(valopt);
}
gsize i_convert(const char *str, gsize len, GIConv cd, GString *out)
{
gsize ret;
char *outbuf;
gsize outbytes_left;
char *inbuf = (char *)str;
gsize inbytes_left = len;
int done = 0;
do {
outbytes_left = MAX(inbytes_left, out->allocated_len - out->len - 1);
/* ensure there is available space for at least one character */
outbytes_left = MAX(outbytes_left, 10);
g_string_set_size(out, out->len + outbytes_left);
outbuf = out->str + out->len - outbytes_left;
ret = g_iconv(cd, &inbuf, &inbytes_left, &outbuf, &outbytes_left);
g_string_truncate(out, out->len - outbytes_left);
done = 1;
if (ret == (gsize)-1) {
if (errno == E2BIG)
done = 0;
}
} while (!done);
return len - inbytes_left;
}
#ifndef HAVE_DAEMON
#ifdef HAVE_FORK
int daemon(int nochdir, int noclose)
{
int fd, i;
switch (fork()) {
case 0:
break;
case -1:
return -1;
default:
_exit(0);
}
if (!nochdir) {
chdir("/");
}
if (setsid() < 0) {
return -1;
}
if (!noclose) {
if ((fd = open("/dev/null", O_RDWR)) >= 0) {
for (i = 0; i < 3; i++) {
dup2(fd, i);
}
if (fd > 2) {
close(fd);
}
}
}
return 0;
}
#endif
#endif
|