0
|
1
|
|
2 /*
|
|
3 * Copyright (C) Igor Sysoev
|
|
4 */
|
|
5
|
|
6
|
|
7
|
|
8 #include <ngx_config.h>
|
|
9 #include <ngx_core.h>
|
|
10
|
|
11
|
10
|
12 /*
|
|
13 * ngx_sock_ntop() and ngx_inet_ntop() may be implemented as
|
|
14 * "ngx_sprintf(text, "%ud.%ud.%ud.%ud", p[0], p[1], p[2], p[3])",
|
|
15 * however, they were implemented long before the ngx_sprintf() appeared
|
|
16 * and they are faster by 1.5-2.5 times, so it is worth to keep them.
|
|
17 *
|
|
18 * By the way, the implementation using ngx_sprintf() is faster by 2.5-3 times
|
|
19 * than using FreeBSD libc's snrpintf().
|
|
20 */
|
|
21
|
|
22
|
0
|
23 ngx_inline static size_t ngx_sprint_uchar(u_char *text, u_char c, size_t len)
|
|
24 {
|
|
25 size_t n;
|
|
26 ngx_uint_t c1, c2;
|
|
27
|
|
28 n = 0;
|
|
29
|
|
30 if (len == n) {
|
|
31 return n;
|
|
32 }
|
|
33
|
|
34 c1 = c / 100;
|
|
35
|
|
36 if (c1) {
|
|
37 *text++ = (u_char) (c1 + '0');
|
|
38 n++;
|
|
39
|
|
40 if (len == n) {
|
|
41 return n;
|
|
42 }
|
|
43 }
|
|
44
|
|
45 c2 = (c % 100) / 10;
|
|
46
|
|
47 if (c1 || c2) {
|
|
48 *text++ = (u_char) (c2 + '0');
|
|
49 n++;
|
|
50
|
|
51 if (len == n) {
|
|
52 return n;
|
|
53 }
|
|
54 }
|
|
55
|
|
56 c2 = c % 10;
|
|
57
|
|
58 *text++ = (u_char) (c2 + '0');
|
|
59 n++;
|
|
60
|
|
61 return n;
|
|
62 }
|
|
63
|
|
64
|
|
65 /* AF_INET only */
|
|
66
|
|
67 size_t ngx_sock_ntop(int family, struct sockaddr *addr, u_char *text,
|
|
68 size_t len)
|
|
69 {
|
|
70 u_char *p;
|
|
71 size_t n;
|
|
72 ngx_uint_t i;
|
|
73 struct sockaddr_in *addr_in;
|
|
74
|
|
75 if (len == 0) {
|
|
76 return 0;
|
|
77 }
|
|
78
|
|
79 if (family != AF_INET) {
|
|
80 return 0;
|
|
81 }
|
|
82
|
|
83 addr_in = (struct sockaddr_in *) addr;
|
|
84 p = (u_char *) &addr_in->sin_addr;
|
|
85
|
|
86 if (len > INET_ADDRSTRLEN) {
|
|
87 len = INET_ADDRSTRLEN;
|
|
88 }
|
|
89
|
|
90 n = ngx_sprint_uchar(text, p[0], len);
|
|
91
|
|
92 i = 1;
|
|
93
|
|
94 do {
|
|
95 if (len == n) {
|
|
96 text[n - 1] = '\0';
|
|
97 return n;
|
|
98 }
|
|
99
|
|
100 text[n++] = '.';
|
|
101
|
|
102 if (len == n) {
|
|
103 text[n - 1] = '\0';
|
|
104 return n;
|
|
105 }
|
|
106
|
|
107 n += ngx_sprint_uchar(&text[n], p[i++], len - n);
|
|
108
|
|
109 } while (i < 4);
|
|
110
|
|
111 if (len == n) {
|
|
112 text[n] = '\0';
|
|
113 return n;
|
|
114 }
|
|
115
|
|
116 text[n] = '\0';
|
|
117
|
|
118 return n;
|
|
119 }
|
|
120
|
|
121 size_t ngx_inet_ntop(int family, void *addr, u_char *text, size_t len)
|
|
122 {
|
|
123 u_char *p;
|
|
124 size_t n;
|
|
125 ngx_uint_t i;
|
|
126
|
|
127 if (len == 0) {
|
|
128 return 0;
|
|
129 }
|
|
130
|
|
131 if (family != AF_INET) {
|
|
132 return 0;
|
|
133 }
|
|
134
|
|
135 p = (u_char *) addr;
|
|
136
|
|
137 if (len > INET_ADDRSTRLEN) {
|
|
138 len = INET_ADDRSTRLEN;
|
|
139 }
|
|
140
|
|
141 n = ngx_sprint_uchar(text, p[0], len);
|
|
142
|
|
143 i = 1;
|
|
144
|
|
145 do {
|
|
146 if (len == n) {
|
|
147 text[n - 1] = '\0';
|
|
148 return n;
|
|
149 }
|
|
150
|
|
151 text[n++] = '.';
|
|
152
|
|
153 if (len == n) {
|
|
154 text[n - 1] = '\0';
|
|
155 return n;
|
|
156 }
|
|
157
|
|
158 n += ngx_sprint_uchar(&text[n], p[i++], len - n);
|
|
159
|
|
160 } while (i < 4);
|
|
161
|
|
162 if (len == n) {
|
|
163 text[n] = '\0';
|
|
164 return n;
|
|
165 }
|
|
166
|
|
167 text[n] = '\0';
|
|
168
|
|
169 return n;
|
|
170 }
|
|
171
|
|
172
|
|
173 /* AF_INET only */
|
|
174
|
|
175 ngx_int_t ngx_ptocidr(ngx_str_t *text, void *cidr)
|
|
176 {
|
|
177 ngx_int_t m;
|
|
178 ngx_uint_t i;
|
|
179 ngx_inet_cidr_t *in_cidr;
|
|
180
|
|
181 in_cidr = cidr;
|
|
182
|
|
183 for (i = 0; i < text->len; i++) {
|
|
184 if (text->data[i] == '/') {
|
|
185 break;
|
|
186 }
|
|
187 }
|
|
188
|
|
189 if (i == text->len) {
|
|
190 return NGX_ERROR;
|
|
191 }
|
|
192
|
|
193 text->data[i] = '\0';
|
|
194 in_cidr->addr = inet_addr((char *) text->data);
|
|
195 text->data[i] = '/';
|
|
196 if (in_cidr->addr == INADDR_NONE) {
|
|
197 return NGX_ERROR;
|
|
198 }
|
|
199
|
|
200 m = ngx_atoi(&text->data[i + 1], text->len - (i + 1));
|
|
201 if (m == NGX_ERROR) {
|
|
202 return NGX_ERROR;
|
|
203 }
|
|
204
|
|
205 if (m == 0) {
|
|
206
|
|
207 /* the x86 compilers use the shl instruction that shifts by modulo 32 */
|
|
208
|
|
209 in_cidr->mask = 0;
|
|
210 return NGX_OK;
|
|
211 }
|
|
212
|
|
213 in_cidr->mask = htonl((ngx_uint_t) (0 - (1 << (32 - m))));
|
|
214
|
|
215 return NGX_OK;
|
|
216 }
|
|
217
|
|
218
|
|
219 #if 0
|
|
220
|
|
221 ngx_int_t ngx_inet_addr_port(ngx_conf_t *cf, ngx_command_t *cmd,
|
|
222 ngx_str_t *addr_port)
|
|
223 {
|
|
224 u_char *host;
|
|
225 ngx_int_t port;
|
|
226 ngx_uint_t p;
|
|
227 struct hostent *h;
|
|
228
|
|
229 for (p = 0; p < addr_port->len; p++) {
|
|
230 if (addr_port->data[p] == ':') {
|
|
231 break;
|
|
232 }
|
|
233 }
|
|
234
|
|
235 in_addr->host.len = p;
|
|
236 if (!(in_addr->host.data = ngx_palloc(pool, p + 1))) {
|
|
237 return NGX_ERROR;
|
|
238 }
|
|
239
|
|
240 ngx_cpystrn(in_addr->host.data, addr_port->data, p + 1);
|
|
241
|
|
242 if (p == addr_port->len) {
|
|
243 p = 0;
|
|
244 }
|
|
245
|
|
246 port = ngx_atoi(&addr[p], args[1].len - p);
|
|
247 if (port == NGX_ERROR && p == 0) {
|
|
248
|
|
249 /* default port */
|
|
250 iap->port = 0;
|
|
251
|
|
252 } else if ((port == NGX_ERROR && p != 0) /* "listen host:NONNUMBER" */
|
|
253 || (port < 1 || port > 65536)) { /* "listen 99999" */
|
|
254
|
|
255 ngx_conf_log_error(NGX_LOG_EMERG, cf, 0,
|
|
256 "invalid port \"%s\" in \"%s\" directive, "
|
|
257 "it must be a number between 1 and 65535",
|
|
258 &addr[p], cmd->name.data);
|
|
259
|
|
260 return NGX_CONF_ERROR;
|
|
261
|
|
262 } else if (p == 0) {
|
|
263 ls->addr = INADDR_ANY;
|
|
264 ls->port = (in_port_t) port;
|
|
265 return NGX_CONF_OK;
|
|
266 }
|
|
267
|
|
268 return NGX_OK;
|
|
269 }
|
|
270
|
|
271 #endif
|