|
350
|
1
|
|
|
2 /*
|
|
|
3 * Copyright (C) Igor Sysoev
|
|
|
4 */
|
|
|
5
|
|
|
6
|
|
|
7 #include <ngx_config.h>
|
|
|
8 #include <ngx_core.h>
|
|
|
9 #include <ngx_event.h>
|
|
|
10
|
|
|
11
|
|
|
12 #define NGX_RESOLVER_UDP_SIZE 4096
|
|
|
13
|
|
|
14
|
|
|
15 typedef struct {
|
|
|
16 u_char ident_hi;
|
|
|
17 u_char ident_lo;
|
|
|
18 u_char flags_hi;
|
|
|
19 u_char flags_lo;
|
|
|
20 u_char nqs_hi;
|
|
|
21 u_char nqs_lo;
|
|
|
22 u_char nan_hi;
|
|
|
23 u_char nan_lo;
|
|
|
24 u_char nns_hi;
|
|
|
25 u_char nns_lo;
|
|
|
26 u_char nar_hi;
|
|
|
27 u_char nar_lo;
|
|
|
28 } ngx_resolver_query_t;
|
|
|
29
|
|
|
30
|
|
|
31 typedef struct {
|
|
|
32 u_char type_hi;
|
|
|
33 u_char type_lo;
|
|
|
34 u_char class_hi;
|
|
|
35 u_char class_lo;
|
|
|
36 } ngx_resolver_qs_t;
|
|
|
37
|
|
|
38
|
|
|
39 typedef struct {
|
|
|
40 u_char type_hi;
|
|
|
41 u_char type_lo;
|
|
|
42 u_char class_hi;
|
|
|
43 u_char class_lo;
|
|
|
44 u_char ttl[4];
|
|
|
45 u_char len_hi;
|
|
|
46 u_char len_lo;
|
|
|
47 } ngx_resolver_an_t;
|
|
|
48
|
|
|
49
|
|
|
50 ngx_int_t ngx_udp_connect(ngx_udp_connection_t *uc);
|
|
|
51
|
|
|
52
|
|
|
53 static ngx_int_t ngx_resolve_name_locked(ngx_resolver_t *r,
|
|
|
54 ngx_resolver_ctx_t *ctx);
|
|
|
55 static void ngx_resolver_expire(ngx_resolver_t *r, ngx_rbtree_t *tree,
|
|
|
56 ngx_queue_t *queue);
|
|
|
57 static ngx_int_t ngx_resolver_send_query(ngx_resolver_t *r,
|
|
|
58 ngx_resolver_node_t *rn);
|
|
|
59 static ngx_int_t ngx_resolver_create_name_query(ngx_resolver_node_t *rn,
|
|
|
60 ngx_resolver_ctx_t *ctx);
|
|
|
61 static ngx_int_t ngx_resolver_create_addr_query(ngx_resolver_node_t *rn,
|
|
|
62 ngx_resolver_ctx_t *ctx);
|
|
|
63 static void ngx_resolver_resend_handler(ngx_event_t *ev);
|
|
|
64 static time_t ngx_resolver_resend(ngx_resolver_t *r, ngx_rbtree_t *tree,
|
|
|
65 ngx_queue_t *queue);
|
|
|
66 static void ngx_resolver_read_response(ngx_event_t *rev);
|
|
|
67 static void ngx_resolver_process_response(ngx_resolver_t *r, u_char *buf,
|
|
|
68 size_t n);
|
|
|
69 static void ngx_resolver_process_a(ngx_resolver_t *r, u_char *buf, size_t n,
|
|
356
|
70 ngx_uint_t ident, ngx_uint_t code, ngx_uint_t nan, ngx_uint_t ans);
|
|
350
|
71 static void ngx_resolver_process_ptr(ngx_resolver_t *r, u_char *buf, size_t n,
|
|
356
|
72 ngx_uint_t ident, ngx_uint_t code, ngx_uint_t nan);
|
|
350
|
73 static ngx_resolver_node_t *ngx_resolver_lookup_name(ngx_resolver_t *r,
|
|
|
74 ngx_str_t *name, uint32_t hash);
|
|
|
75 static ngx_resolver_node_t *ngx_resolver_lookup_addr(ngx_resolver_t *r,
|
|
|
76 in_addr_t addr);
|
|
|
77 static void ngx_resolver_rbtree_insert_value(ngx_rbtree_node_t *temp,
|
|
|
78 ngx_rbtree_node_t *node, ngx_rbtree_node_t *sentinel);
|
|
|
79 static ngx_int_t ngx_resolver_copy(ngx_resolver_t *r, ngx_str_t *name,
|
|
|
80 u_char *buf, u_char *src, u_char *last);
|
|
|
81 static void ngx_resolver_timeout_handler(ngx_event_t *ev);
|
|
|
82 static void ngx_resolver_free_node(ngx_resolver_t *r, ngx_resolver_node_t *rn);
|
|
|
83 static void *ngx_resolver_alloc(ngx_resolver_t *r, size_t size);
|
|
|
84 static void ngx_resolver_free(ngx_resolver_t *r, void *p);
|
|
|
85 static void ngx_resolver_free_locked(ngx_resolver_t *r, void *p);
|
|
|
86 static void *ngx_resolver_dup(ngx_resolver_t *r, void *src, size_t size);
|
|
|
87
|
|
|
88
|
|
|
89 /* STUB: ngx_peer_addr_t * */
|
|
|
90
|
|
|
91 ngx_resolver_t *
|
|
|
92 ngx_resolver_create(ngx_peer_addr_t *addr, ngx_log_t *log)
|
|
|
93 {
|
|
|
94 ngx_resolver_t *r;
|
|
|
95 ngx_udp_connection_t *uc;
|
|
|
96
|
|
|
97 r = ngx_calloc(sizeof(ngx_resolver_t), log);
|
|
|
98 if (r == NULL) {
|
|
|
99 return NULL;
|
|
|
100 }
|
|
|
101
|
|
|
102 r->event = ngx_calloc(sizeof(ngx_event_t), log);
|
|
|
103 if (r->event == NULL) {
|
|
|
104 return NULL;
|
|
|
105 }
|
|
|
106
|
|
354
|
107 ngx_rbtree_init(&r->name_rbtree, &r->name_sentinel,
|
|
|
108 ngx_resolver_rbtree_insert_value);
|
|
|
109
|
|
|
110 ngx_rbtree_init(&r->addr_rbtree, &r->addr_sentinel,
|
|
|
111 ngx_rbtree_insert_value);
|
|
|
112
|
|
|
113 ngx_queue_init(&r->name_resend_queue);
|
|
|
114 ngx_queue_init(&r->addr_resend_queue);
|
|
|
115
|
|
|
116 ngx_queue_init(&r->name_expire_queue);
|
|
|
117 ngx_queue_init(&r->addr_expire_queue);
|
|
350
|
118
|
|
|
119 r->event->handler = ngx_resolver_resend_handler;
|
|
|
120 r->event->data = r;
|
|
|
121 r->event->log = log;
|
|
|
122 r->ident = -1;
|
|
|
123
|
|
|
124 r->resend_timeout = 5;
|
|
|
125 r->expire = 30;
|
|
|
126 r->valid = 300;
|
|
|
127
|
|
|
128 r->log = log;
|
|
|
129 r->log_level = NGX_LOG_ALERT;
|
|
|
130
|
|
354
|
131 if (addr) {
|
|
|
132 uc = ngx_calloc(sizeof(ngx_udp_connection_t), log);
|
|
|
133 if (uc == NULL) {
|
|
|
134 return NULL;
|
|
|
135 }
|
|
|
136
|
|
|
137 r->udp_connection = uc;
|
|
|
138
|
|
|
139 uc->sockaddr = addr->sockaddr;
|
|
|
140 uc->socklen = addr->socklen;
|
|
|
141 uc->server = addr->name;
|
|
|
142 uc->log = log;
|
|
|
143 }
|
|
350
|
144
|
|
|
145 return r;
|
|
|
146 }
|
|
|
147
|
|
|
148
|
|
|
149 ngx_resolver_ctx_t *
|
|
|
150 ngx_resolve_start(ngx_resolver_t *r, ngx_resolver_ctx_t *temp)
|
|
|
151 {
|
|
|
152 in_addr_t addr;
|
|
|
153 ngx_resolver_ctx_t *ctx;
|
|
|
154
|
|
|
155 if (temp) {
|
|
|
156 addr = ngx_inet_addr(temp->name.data, temp->name.len);
|
|
|
157
|
|
|
158 if (addr != INADDR_NONE) {
|
|
|
159 temp->resolver = r;
|
|
|
160 temp->state = NGX_OK;
|
|
|
161 temp->naddrs = 1;
|
|
|
162 temp->addrs = &temp->addr;
|
|
|
163 temp->addr = addr;
|
|
|
164 temp->quick = 1;
|
|
|
165
|
|
|
166 return temp;
|
|
|
167 }
|
|
|
168 }
|
|
|
169
|
|
354
|
170 if (r->udp_connection == NULL) {
|
|
|
171 return NGX_NO_RESOLVER;
|
|
|
172 }
|
|
|
173
|
|
350
|
174 ctx = ngx_resolver_calloc(r, sizeof(ngx_resolver_ctx_t));
|
|
|
175
|
|
|
176 if (ctx) {
|
|
|
177 ctx->resolver = r;
|
|
|
178 }
|
|
|
179
|
|
|
180 return ctx;
|
|
|
181 }
|
|
|
182
|
|
|
183
|
|
|
184 ngx_int_t
|
|
|
185 ngx_resolve_name(ngx_resolver_ctx_t *ctx)
|
|
|
186 {
|
|
|
187 ngx_int_t rc;
|
|
|
188 ngx_resolver_t *r;
|
|
|
189
|
|
|
190 r = ctx->resolver;
|
|
|
191
|
|
|
192 ngx_log_debug1(NGX_LOG_DEBUG_CORE, r->log, 0,
|
|
|
193 "resolve: \"%V\"", &ctx->name);
|
|
|
194
|
|
|
195 if (ctx->quick) {
|
|
|
196 ctx->handler(ctx);
|
|
|
197 return NGX_OK;
|
|
|
198 }
|
|
|
199
|
|
|
200 /* lock name mutex */
|
|
|
201
|
|
|
202 rc = ngx_resolve_name_locked(r, ctx);
|
|
|
203
|
|
|
204 if (rc == NGX_OK) {
|
|
|
205 return NGX_OK;
|
|
|
206 }
|
|
|
207
|
|
|
208 /* unlock name mutex */
|
|
|
209
|
|
|
210 if (rc == NGX_AGAIN) {
|
|
|
211 return NGX_OK;
|
|
|
212 }
|
|
|
213
|
|
|
214 /* lock alloc mutex */
|
|
|
215
|
|
|
216 if (ctx->event) {
|
|
|
217 ngx_resolver_free_locked(r, ctx->event);
|
|
|
218 }
|
|
|
219
|
|
|
220 ngx_resolver_free_locked(r, ctx);
|
|
|
221
|
|
|
222 /* unlock alloc mutex */
|
|
|
223
|
|
|
224 return NGX_ERROR;
|
|
|
225 }
|
|
|
226
|
|
|
227
|
|
|
228 void
|
|
|
229 ngx_resolve_name_done(ngx_resolver_ctx_t *ctx)
|
|
|
230 {
|
|
|
231 uint32_t hash;
|
|
|
232 ngx_resolver_t *r;
|
|
|
233 ngx_resolver_ctx_t *w, **p;
|
|
|
234 ngx_resolver_node_t *rn;
|
|
|
235
|
|
|
236 r = ctx->resolver;
|
|
|
237
|
|
|
238 ngx_log_debug1(NGX_LOG_DEBUG_CORE, r->log, 0,
|
|
|
239 "resolve name done: %i", ctx->state);
|
|
|
240
|
|
|
241 if (ctx->quick) {
|
|
|
242 return;
|
|
|
243 }
|
|
|
244
|
|
|
245 if (ctx->event && ctx->event->timer_set) {
|
|
|
246 ngx_del_timer(ctx->event);
|
|
|
247 }
|
|
|
248
|
|
|
249 /* lock name mutex */
|
|
|
250
|
|
|
251 if (ctx->state == NGX_AGAIN || ctx->state == NGX_RESOLVE_TIMEDOUT) {
|
|
|
252
|
|
|
253 hash = ngx_crc32_short(ctx->name.data, ctx->name.len);
|
|
|
254
|
|
|
255 rn = ngx_resolver_lookup_name(r, &ctx->name, hash);
|
|
|
256
|
|
|
257 if (rn) {
|
|
|
258 p = &rn->waiting;
|
|
|
259 w = rn->waiting;
|
|
|
260
|
|
|
261 while (w) {
|
|
|
262 if (w == ctx) {
|
|
|
263 *p = w->next;
|
|
|
264
|
|
|
265 goto done;
|
|
|
266 }
|
|
|
267
|
|
|
268 p = &w->next;
|
|
|
269 w = w->next;
|
|
|
270 }
|
|
|
271 }
|
|
|
272
|
|
|
273 ngx_log_error(NGX_LOG_ALERT, r->log, 0,
|
|
|
274 "could not cancel %V resolving", &ctx->name);
|
|
|
275 }
|
|
|
276
|
|
|
277 done:
|
|
|
278
|
|
|
279 ngx_resolver_expire(r, &r->name_rbtree, &r->name_expire_queue);
|
|
|
280
|
|
|
281 /* unlock name mutex */
|
|
|
282
|
|
|
283 ngx_resolver_free(r, ctx);
|
|
|
284 }
|
|
|
285
|
|
|
286
|
|
|
287 /* NGX_RESOLVE_A only */
|
|
|
288
|
|
|
289 static ngx_int_t
|
|
|
290 ngx_resolve_name_locked(ngx_resolver_t *r, ngx_resolver_ctx_t *ctx)
|
|
|
291 {
|
|
|
292 uint32_t hash;
|
|
|
293 in_addr_t addr, *addrs;
|
|
|
294 ngx_uint_t naddrs;
|
|
|
295 ngx_resolver_ctx_t *next;
|
|
|
296 ngx_resolver_node_t *rn;
|
|
|
297
|
|
|
298 hash = ngx_crc32_short(ctx->name.data, ctx->name.len);
|
|
|
299
|
|
|
300 rn = ngx_resolver_lookup_name(r, &ctx->name, hash);
|
|
|
301
|
|
|
302 if (rn) {
|
|
|
303
|
|
|
304 if (rn->valid >= ngx_time()) {
|
|
|
305
|
|
|
306 ngx_log_debug0(NGX_LOG_DEBUG_CORE, r->log, 0, "resolve cached");
|
|
|
307
|
|
|
308 ngx_queue_remove(&rn->queue);
|
|
|
309
|
|
|
310 rn->expire = ngx_time() + r->expire;
|
|
|
311
|
|
|
312 ngx_queue_insert_head(&r->name_expire_queue, &rn->queue);
|
|
|
313
|
|
|
314 naddrs = rn->naddrs;
|
|
|
315
|
|
|
316 if (naddrs) {
|
|
|
317
|
|
|
318 /* NGX_RESOLVE_A answer */
|
|
|
319
|
|
|
320 if (naddrs != 1) {
|
|
|
321 addr = 0;
|
|
|
322 addrs = ngx_resolver_dup(r, rn->u.addrs,
|
|
|
323 naddrs * sizeof(in_addr_t));
|
|
|
324 if (addrs == NULL) {
|
|
|
325 return NGX_ERROR;
|
|
|
326 }
|
|
|
327
|
|
|
328 } else {
|
|
|
329 addr = rn->u.addr;
|
|
|
330 addrs = NULL;
|
|
|
331 }
|
|
|
332
|
|
|
333 ctx->next = rn->waiting;
|
|
|
334 rn->waiting = NULL;
|
|
|
335
|
|
|
336 /* unlock name mutex */
|
|
|
337
|
|
|
338 do {
|
|
|
339 ctx->state = NGX_OK;
|
|
|
340 ctx->naddrs = naddrs;
|
|
|
341 ctx->addrs = (naddrs == 1) ? &ctx->addr : addrs;
|
|
|
342 ctx->addr = addr;
|
|
|
343 next = ctx->next;
|
|
|
344
|
|
|
345 ctx->handler(ctx);
|
|
|
346
|
|
|
347 ctx = next;
|
|
|
348 } while (ctx);
|
|
|
349
|
|
|
350 if (addrs) {
|
|
|
351 ngx_resolver_free(r, addrs);
|
|
|
352 }
|
|
|
353
|
|
|
354 return NGX_OK;
|
|
|
355 }
|
|
|
356
|
|
|
357 /* NGX_RESOLVE_CNAME */
|
|
|
358
|
|
|
359 ctx->name.len = rn->cnlen;
|
|
|
360 ctx->name.data = rn->u.cname;
|
|
|
361
|
|
|
362 return ngx_resolve_name_locked(r, ctx);
|
|
|
363 }
|
|
|
364
|
|
|
365 if (rn->waiting) {
|
|
|
366
|
|
|
367 ctx->next = rn->waiting;
|
|
|
368 rn->waiting = ctx;
|
|
|
369
|
|
|
370 return NGX_AGAIN;
|
|
|
371 }
|
|
|
372
|
|
|
373 ngx_queue_remove(&rn->queue);
|
|
|
374
|
|
|
375 /* lock alloc mutex */
|
|
|
376
|
|
|
377 ngx_resolver_free_locked(r, rn->query);
|
|
|
378
|
|
|
379 if (rn->cnlen) {
|
|
|
380 ngx_resolver_free_locked(r, rn->u.cname);
|
|
|
381 }
|
|
|
382
|
|
|
383 if (rn->naddrs > 1) {
|
|
|
384 ngx_resolver_free_locked(r, rn->u.addrs);
|
|
|
385 }
|
|
|
386
|
|
|
387 /* unlock alloc mutex */
|
|
|
388
|
|
|
389 } else {
|
|
|
390
|
|
|
391 rn = ngx_resolver_alloc(r, sizeof(ngx_resolver_node_t));
|
|
|
392 if (rn == NULL) {
|
|
|
393 return NGX_ERROR;
|
|
|
394 }
|
|
|
395
|
|
|
396 rn->name = ngx_resolver_dup(r, ctx->name.data, ctx->name.len);
|
|
|
397 if (rn->name == NULL) {
|
|
|
398 ngx_resolver_free(r, rn);
|
|
|
399 return NGX_ERROR;
|
|
|
400 }
|
|
|
401
|
|
|
402 rn->node.key = hash;
|
|
|
403 rn->nlen = (u_short) ctx->name.len;
|
|
|
404
|
|
|
405 ngx_rbtree_insert(&r->name_rbtree, &rn->node);
|
|
|
406 }
|
|
|
407
|
|
|
408 if (ngx_resolver_create_name_query(rn, ctx) != NGX_OK) {
|
|
|
409 goto failed;
|
|
|
410 }
|
|
|
411
|
|
|
412 if (ngx_resolver_send_query(r, rn) != NGX_OK) {
|
|
|
413 goto failed;
|
|
|
414 }
|
|
|
415
|
|
|
416 if (ctx->event == NULL) {
|
|
|
417 ctx->event = ngx_resolver_calloc(r, sizeof(ngx_event_t));
|
|
|
418 if (ctx->event == NULL) {
|
|
|
419 goto failed;
|
|
|
420 }
|
|
|
421
|
|
|
422 ctx->event->handler = ngx_resolver_timeout_handler;
|
|
|
423 ctx->event->data = ctx;
|
|
|
424 ctx->event->log = r->log;
|
|
|
425 ctx->ident = -1;
|
|
|
426
|
|
|
427 ngx_add_timer(ctx->event, ctx->timeout);
|
|
|
428 }
|
|
|
429
|
|
|
430 if (ngx_queue_empty(&r->name_resend_queue)) {
|
|
|
431 ngx_add_timer(r->event, (ngx_msec_t) (r->resend_timeout * 1000));
|
|
|
432 }
|
|
|
433
|
|
|
434 rn->expire = ngx_time() + r->resend_timeout;
|
|
|
435
|
|
|
436 ngx_queue_insert_head(&r->name_resend_queue, &rn->queue);
|
|
|
437
|
|
|
438 rn->cnlen = 0;
|
|
|
439 rn->naddrs = 0;
|
|
|
440 rn->valid = 0;
|
|
|
441 rn->waiting = ctx;
|
|
|
442
|
|
|
443 ctx->state = NGX_AGAIN;
|
|
|
444
|
|
|
445 return NGX_AGAIN;
|
|
|
446
|
|
|
447 failed:
|
|
|
448
|
|
|
449 ngx_rbtree_delete(&r->name_rbtree, &rn->node);
|
|
|
450
|
|
|
451 ngx_resolver_free(r, rn->name);
|
|
|
452
|
|
|
453 ngx_resolver_free(r, rn);
|
|
|
454
|
|
|
455 return NGX_ERROR;
|
|
|
456 }
|
|
|
457
|
|
|
458
|
|
|
459 ngx_int_t
|
|
|
460 ngx_resolve_addr(ngx_resolver_ctx_t *ctx)
|
|
|
461 {
|
|
|
462 ngx_resolver_t *r;
|
|
|
463 ngx_resolver_node_t *rn;
|
|
|
464
|
|
|
465 r = ctx->resolver;
|
|
|
466
|
|
|
467 ctx->addr = ntohl(ctx->addr);
|
|
|
468
|
|
|
469 /* lock addr mutex */
|
|
|
470
|
|
|
471 rn = ngx_resolver_lookup_addr(r, ctx->addr);
|
|
|
472
|
|
|
473 if (rn) {
|
|
|
474
|
|
|
475 if (rn->valid >= ngx_time()) {
|
|
|
476
|
|
|
477 ngx_log_debug0(NGX_LOG_DEBUG_CORE, r->log, 0, "resolve cached");
|
|
|
478
|
|
|
479 ngx_queue_remove(&rn->queue);
|
|
|
480
|
|
|
481 rn->expire = ngx_time() + r->expire;
|
|
|
482
|
|
|
483 ngx_queue_insert_head(&r->addr_expire_queue, &rn->queue);
|
|
|
484
|
|
|
485 ctx->name.len = rn->nlen;
|
|
|
486 ctx->name.data = ngx_resolver_dup(r, rn->name, rn->nlen);
|
|
|
487 if (ctx->name.data == NULL) {
|
|
|
488 goto failed;
|
|
|
489 }
|
|
|
490
|
|
|
491 /* unlock addr mutex */
|
|
|
492
|
|
|
493 ctx->state = NGX_OK;
|
|
|
494
|
|
|
495 ctx->handler(ctx);
|
|
|
496
|
|
|
497 ngx_resolver_free(r, ctx->name.data);
|
|
|
498
|
|
|
499 return NGX_OK;
|
|
|
500 }
|
|
|
501
|
|
|
502 if (rn->waiting) {
|
|
|
503
|
|
|
504 ctx->next = rn->waiting;
|
|
|
505 rn->waiting = ctx;
|
|
|
506
|
|
|
507 return NGX_AGAIN;
|
|
|
508 }
|
|
|
509
|
|
|
510 ngx_queue_remove(&rn->queue);
|
|
|
511
|
|
|
512 ngx_resolver_free(r, rn->query);
|
|
|
513
|
|
|
514 } else {
|
|
|
515 rn = ngx_resolver_alloc(r, sizeof(ngx_resolver_node_t));
|
|
|
516 if (rn == NULL) {
|
|
|
517 goto failed;
|
|
|
518 }
|
|
|
519
|
|
|
520 rn->node.key = ctx->addr;
|
|
|
521
|
|
|
522 ngx_rbtree_insert(&r->addr_rbtree, &rn->node);
|
|
|
523 }
|
|
|
524
|
|
|
525 if (ngx_resolver_create_addr_query(rn, ctx) != NGX_OK) {
|
|
|
526 goto failed;
|
|
|
527 }
|
|
|
528
|
|
|
529 if (ngx_resolver_send_query(r, rn) != NGX_OK) {
|
|
|
530 goto failed;
|
|
|
531 }
|
|
|
532
|
|
|
533 ctx->event = ngx_resolver_calloc(r, sizeof(ngx_event_t));
|
|
|
534 if (ctx->event == NULL) {
|
|
|
535 goto failed;
|
|
|
536 }
|
|
|
537
|
|
|
538 ctx->event->handler = ngx_resolver_timeout_handler;
|
|
|
539 ctx->event->data = ctx;
|
|
|
540 ctx->event->log = r->log;
|
|
|
541 ctx->ident = -1;
|
|
|
542
|
|
|
543 ngx_add_timer(ctx->event, ctx->timeout);
|
|
|
544
|
|
|
545 if (ngx_queue_empty(&r->addr_resend_queue)) {
|
|
|
546 ngx_add_timer(r->event, (ngx_msec_t) (r->resend_timeout * 1000));
|
|
|
547 }
|
|
|
548
|
|
|
549 rn->expire = ngx_time() + r->resend_timeout;
|
|
|
550
|
|
|
551 ngx_queue_insert_head(&r->addr_resend_queue, &rn->queue);
|
|
|
552
|
|
|
553 rn->cnlen = 0;
|
|
|
554 rn->naddrs = 0;
|
|
|
555 rn->name = NULL;
|
|
|
556 rn->nlen = 0;
|
|
|
557 rn->valid = 0;
|
|
|
558 rn->waiting = ctx;
|
|
|
559
|
|
|
560 /* unlock addr mutex */
|
|
|
561
|
|
|
562 ctx->state = NGX_AGAIN;
|
|
|
563
|
|
|
564 return NGX_OK;
|
|
|
565
|
|
|
566 failed:
|
|
|
567
|
|
|
568 if (rn) {
|
|
|
569 ngx_rbtree_delete(&r->addr_rbtree, &rn->node);
|
|
|
570
|
|
|
571 ngx_resolver_free(r, rn);
|
|
|
572 }
|
|
|
573
|
|
|
574 /* unlock addr mutex */
|
|
|
575
|
|
|
576 /* lock alloc mutex */
|
|
|
577
|
|
|
578 if (ctx->event) {
|
|
|
579 ngx_resolver_free_locked(r, ctx->event);
|
|
|
580 }
|
|
|
581
|
|
|
582 ngx_resolver_free_locked(r, ctx);
|
|
|
583
|
|
|
584 /* unlock alloc mutex */
|
|
|
585
|
|
|
586 return NGX_ERROR;
|
|
|
587 }
|
|
|
588
|
|
|
589
|
|
|
590 void
|
|
|
591 ngx_resolve_addr_done(ngx_resolver_ctx_t *ctx)
|
|
|
592 {
|
|
|
593 in_addr_t addr;
|
|
|
594 ngx_resolver_t *r;
|
|
|
595 ngx_resolver_ctx_t *w, **p;
|
|
|
596 ngx_resolver_node_t *rn;
|
|
|
597
|
|
|
598 r = ctx->resolver;
|
|
|
599
|
|
|
600 ngx_log_debug1(NGX_LOG_DEBUG_CORE, r->log, 0,
|
|
|
601 "resolve addr done: %i", ctx->state);
|
|
|
602
|
|
|
603 if (ctx->event && ctx->event->timer_set) {
|
|
|
604 ngx_del_timer(ctx->event);
|
|
|
605 }
|
|
|
606
|
|
|
607 /* lock addr mutex */
|
|
|
608
|
|
|
609 if (ctx->state == NGX_AGAIN || ctx->state == NGX_RESOLVE_TIMEDOUT) {
|
|
|
610
|
|
|
611 rn = ngx_resolver_lookup_addr(r, ctx->addr);
|
|
|
612
|
|
|
613 if (rn) {
|
|
|
614 p = &rn->waiting;
|
|
|
615 w = rn->waiting;
|
|
|
616
|
|
|
617 while (w) {
|
|
|
618 if (w == ctx) {
|
|
|
619 *p = w->next;
|
|
|
620
|
|
|
621 goto done;
|
|
|
622 }
|
|
|
623
|
|
|
624 p = &w->next;
|
|
|
625 w = w->next;
|
|
|
626 }
|
|
|
627 }
|
|
|
628
|
|
|
629 addr = ntohl(ctx->addr);
|
|
|
630
|
|
|
631 ngx_log_error(NGX_LOG_ALERT, r->log, 0,
|
|
|
632 "could not cancel %ud.%ud.%ud.%ud resolving",
|
|
|
633 (addr >> 24) & 0xff, (addr >> 16) & 0xff,
|
|
|
634 (addr >> 8) & 0xff, addr & 0xff);
|
|
|
635 }
|
|
|
636
|
|
|
637 done:
|
|
|
638
|
|
|
639 ngx_resolver_expire(r, &r->addr_rbtree, &r->addr_expire_queue);
|
|
|
640
|
|
|
641 /* unlock addr mutex */
|
|
|
642
|
|
|
643 ngx_resolver_free(r, ctx);
|
|
|
644 }
|
|
|
645
|
|
|
646
|
|
|
647 static void
|
|
|
648 ngx_resolver_expire(ngx_resolver_t *r, ngx_rbtree_t *tree, ngx_queue_t *queue)
|
|
|
649 {
|
|
|
650 time_t now;
|
|
|
651 ngx_uint_t i;
|
|
|
652 ngx_queue_t *q;
|
|
|
653 ngx_resolver_node_t *rn;
|
|
|
654
|
|
|
655 ngx_log_debug0(NGX_LOG_DEBUG_CORE, r->log, 0, "resolver expire");
|
|
|
656
|
|
|
657 now = ngx_time();
|
|
|
658
|
|
|
659 for (i = 0; i < 2; i++) {
|
|
|
660 if (ngx_queue_empty(queue)) {
|
|
|
661 return;
|
|
|
662 }
|
|
|
663
|
|
|
664 q = ngx_queue_last(queue);
|
|
|
665
|
|
|
666 rn = ngx_queue_data(q, ngx_resolver_node_t, queue);
|
|
|
667
|
|
|
668 if (now <= rn->expire) {
|
|
|
669 return;
|
|
|
670 }
|
|
|
671
|
|
|
672 #if (NGX_DEBUG)
|
|
|
673 {
|
|
|
674 ngx_str_t s;
|
|
|
675
|
|
|
676 s.len = rn->nlen;
|
|
|
677 s.data = rn->name;
|
|
|
678
|
|
|
679 ngx_log_debug1(NGX_LOG_DEBUG_CORE, r->log, 0,
|
|
|
680 "resolver expire \"%V\"", &s);
|
|
|
681 }
|
|
|
682 #endif
|
|
|
683
|
|
|
684 ngx_queue_remove(q);
|
|
|
685
|
|
|
686 ngx_rbtree_delete(tree, &rn->node);
|
|
|
687
|
|
|
688 ngx_resolver_free_node(r, rn);
|
|
|
689 }
|
|
|
690 }
|
|
|
691
|
|
|
692
|
|
|
693 static ngx_int_t
|
|
|
694 ngx_resolver_send_query(ngx_resolver_t *r, ngx_resolver_node_t *rn)
|
|
|
695 {
|
|
|
696 ssize_t n;
|
|
|
697 ngx_udp_connection_t *uc;
|
|
|
698
|
|
|
699 uc = r->udp_connection;
|
|
|
700
|
|
|
701 if (uc->connection == NULL) {
|
|
|
702 if (ngx_udp_connect(uc) != NGX_OK) {
|
|
|
703 return NGX_ERROR;
|
|
|
704 }
|
|
|
705
|
|
|
706 uc->connection->data = r;
|
|
|
707 uc->connection->read->handler = ngx_resolver_read_response;
|
|
|
708 }
|
|
|
709
|
|
|
710 n = ngx_send(uc->connection, rn->query, rn->qlen);
|
|
|
711
|
|
|
712 if (n == -1) {
|
|
|
713 return NGX_ERROR;
|
|
|
714 }
|
|
|
715
|
|
|
716 if ((size_t) n != (size_t) rn->qlen) {
|
|
|
717 ngx_log_error(NGX_LOG_CRIT, uc->log, 0, "send() incomplete");
|
|
|
718 return NGX_ERROR;
|
|
|
719 }
|
|
|
720
|
|
|
721 return NGX_OK;
|
|
|
722 }
|
|
|
723
|
|
|
724
|
|
|
725 static void
|
|
|
726 ngx_resolver_resend_handler(ngx_event_t *ev)
|
|
|
727 {
|
|
|
728 time_t timer, atimer, ntimer;
|
|
|
729 ngx_resolver_t *r;
|
|
|
730
|
|
|
731 r = ev->data;
|
|
|
732
|
|
|
733 ngx_log_debug0(NGX_LOG_DEBUG_CORE, r->log, 0,
|
|
|
734 "resolver resend handler");
|
|
|
735
|
|
|
736 /* lock name mutex */
|
|
|
737
|
|
|
738 ntimer = ngx_resolver_resend(r, &r->name_rbtree, &r->name_resend_queue);
|
|
|
739
|
|
|
740 /* unlock name mutex */
|
|
|
741
|
|
|
742 /* lock addr mutex */
|
|
|
743
|
|
|
744 atimer = ngx_resolver_resend(r, &r->addr_rbtree, &r->addr_resend_queue);
|
|
354
|
745
|
|
350
|
746 /* unlock addr mutex */
|
|
|
747
|
|
|
748 if (ntimer == 0) {
|
|
|
749 timer = atimer;
|
|
|
750
|
|
|
751 } else if (atimer == 0) {
|
|
|
752 timer = ntimer;
|
|
|
753
|
|
|
754 } else {
|
|
|
755 timer = (atimer < ntimer) ? atimer : ntimer;
|
|
|
756 }
|
|
|
757
|
|
|
758 if (timer) {
|
|
|
759 ngx_add_timer(r->event, (ngx_msec_t) (timer * 1000));
|
|
|
760 }
|
|
|
761 }
|
|
|
762
|
|
|
763
|
|
|
764 static time_t
|
|
|
765 ngx_resolver_resend(ngx_resolver_t *r, ngx_rbtree_t *tree, ngx_queue_t *queue)
|
|
|
766 {
|
|
|
767 time_t now;
|
|
|
768 ngx_queue_t *q;
|
|
|
769 ngx_resolver_node_t *rn;
|
|
|
770
|
|
|
771 now = ngx_time();
|
|
|
772
|
|
|
773 for ( ;; ) {
|
|
|
774 if (ngx_queue_empty(queue)) {
|
|
|
775 return 0;
|
|
|
776 }
|
|
|
777
|
|
|
778 q = ngx_queue_last(queue);
|
|
|
779
|
|
|
780 rn = ngx_queue_data(q, ngx_resolver_node_t, queue);
|
|
|
781
|
|
|
782 if (now < rn->expire) {
|
|
|
783 return rn->expire - now;
|
|
|
784 }
|
|
|
785
|
|
|
786 #if (NGX_DEBUG)
|
|
|
787 {
|
|
|
788 ngx_str_t s;
|
|
|
789
|
|
|
790 s.len = rn->nlen;
|
|
|
791 s.data = rn->name;
|
|
|
792
|
|
|
793 ngx_log_debug2(NGX_LOG_DEBUG_CORE, r->log, 0,
|
|
|
794 "resolver resend \"%V\" %p", &s, rn->waiting);
|
|
|
795 }
|
|
|
796 #endif
|
|
|
797
|
|
|
798 ngx_queue_remove(q);
|
|
|
799
|
|
|
800 if (rn->waiting) {
|
|
|
801
|
|
|
802 if (ngx_resolver_send_query(r, rn) == NGX_OK) {
|
|
|
803
|
|
|
804 rn->expire = now + r->resend_timeout;
|
|
|
805
|
|
|
806 ngx_queue_insert_head(queue, &rn->queue);
|
|
|
807
|
|
|
808 continue;
|
|
|
809 }
|
|
|
810 }
|
|
|
811
|
|
|
812 ngx_rbtree_delete(tree, &rn->node);
|
|
|
813
|
|
|
814 ngx_resolver_free_node(r, rn);
|
|
|
815 }
|
|
|
816 }
|
|
|
817
|
|
|
818
|
|
|
819 static void
|
|
|
820 ngx_resolver_read_response(ngx_event_t *rev)
|
|
|
821 {
|
|
|
822 ssize_t n;
|
|
|
823 ngx_connection_t *c;
|
|
|
824 u_char buf[NGX_RESOLVER_UDP_SIZE];
|
|
|
825
|
|
|
826 c = rev->data;
|
|
|
827
|
|
|
828 do {
|
|
354
|
829 n = ngx_udp_recv(c, buf, NGX_RESOLVER_UDP_SIZE);
|
|
|
830
|
|
|
831 if (n < 0) {
|
|
350
|
832 return;
|
|
|
833 }
|
|
|
834
|
|
|
835 ngx_resolver_process_response(c->data, buf, n);
|
|
|
836
|
|
|
837 } while (rev->ready);
|
|
|
838 }
|
|
|
839
|
|
|
840
|
|
|
841 static void
|
|
|
842 ngx_resolver_process_response(ngx_resolver_t *r, u_char *buf, size_t n)
|
|
|
843 {
|
|
|
844 char *err;
|
|
|
845 size_t len;
|
|
|
846 ngx_uint_t i, ident, flags, code, nqs, nan, qtype, qclass;
|
|
|
847 ngx_resolver_qs_t *qs;
|
|
|
848 ngx_resolver_query_t *query;
|
|
|
849
|
|
|
850 if ((size_t) n < sizeof(ngx_resolver_query_t) + 1) {
|
|
|
851 goto short_response;
|
|
|
852 }
|
|
|
853
|
|
|
854 query = (ngx_resolver_query_t *) buf;
|
|
|
855
|
|
|
856 ident = (query->ident_hi << 8) + query->ident_lo;
|
|
|
857 flags = (query->flags_hi << 8) + query->flags_lo;
|
|
|
858 nqs = (query->nqs_hi << 8) + query->nqs_lo;
|
|
|
859 nan = (query->nan_hi << 8) + query->nan_lo;
|
|
|
860
|
|
|
861 ngx_log_debug6(NGX_LOG_DEBUG_CORE, r->log, 0,
|
|
|
862 "resolver DNS response %d fl:%04Xud %d/%d/%d/%d",
|
|
|
863 ident, flags, nqs, nan,
|
|
|
864 (query->nns_hi << 8) + query->nns_lo,
|
|
|
865 (query->nar_hi << 8) + query->nar_lo);
|
|
|
866
|
|
|
867 if (!(flags & 0x8000)) {
|
|
|
868 ngx_log_error(r->log_level, r->log, 0,
|
|
|
869 "invalid DNS response %d fl:%04Xud", ident, flags);
|
|
|
870 return;
|
|
|
871 }
|
|
|
872
|
|
|
873 code = flags & 0x7f;
|
|
|
874
|
|
|
875 if (code == NGX_RESOLVE_FORMERR || code > NGX_RESOLVE_REFUSED) {
|
|
|
876 ngx_log_error(r->log_level, r->log, 0,
|
|
|
877 "DNS error (%d: %s), query id:%d",
|
|
|
878 code, ngx_resolver_strerror(code), ident);
|
|
|
879 return;
|
|
|
880 }
|
|
|
881
|
|
|
882 if (nqs != 1) {
|
|
|
883 err = "invalid number of questions in DNS response";
|
|
|
884 goto done;
|
|
|
885 }
|
|
|
886
|
|
|
887 i = sizeof(ngx_resolver_query_t);
|
|
|
888
|
|
|
889 while (i < (ngx_uint_t) n) {
|
|
|
890 if (buf[i] == '\0') {
|
|
|
891 goto found;
|
|
|
892 }
|
|
|
893
|
|
|
894 len = buf[i];
|
|
|
895 i += 1 + len;
|
|
|
896 }
|
|
|
897
|
|
|
898 goto short_response;
|
|
|
899
|
|
|
900 found:
|
|
|
901
|
|
|
902 if (i++ == 0) {
|
|
|
903 err = "zero-length domain name in DNS response";
|
|
|
904 goto done;
|
|
|
905 }
|
|
|
906
|
|
|
907 if (i + sizeof(ngx_resolver_qs_t) + nan * (2 + sizeof(ngx_resolver_an_t))
|
|
|
908 > (ngx_uint_t) n)
|
|
|
909 {
|
|
|
910 goto short_response;
|
|
|
911 }
|
|
|
912
|
|
|
913 qs = (ngx_resolver_qs_t *) &buf[i];
|
|
|
914
|
|
|
915 qtype = (qs->type_hi << 8) + qs->type_lo;
|
|
|
916 qclass = (qs->class_hi << 8) + qs->class_lo;
|
|
|
917
|
|
|
918 ngx_log_debug2(NGX_LOG_DEBUG_CORE, r->log, 0,
|
|
|
919 "resolver DNS response qt:%d cl:%d", qtype, qclass);
|
|
|
920
|
|
|
921 if (qclass != 1) {
|
|
|
922 ngx_log_error(r->log_level, r->log, 0,
|
|
|
923 "unknown query class %d in DNS response", qclass);
|
|
|
924 return;
|
|
|
925 }
|
|
|
926
|
|
|
927 switch (qtype) {
|
|
|
928
|
|
|
929 case NGX_RESOLVE_A:
|
|
|
930
|
|
|
931 ngx_resolver_process_a(r, buf, n, ident, code, nan,
|
|
356
|
932 i + sizeof(ngx_resolver_qs_t));
|
|
350
|
933
|
|
|
934 break;
|
|
|
935
|
|
|
936 case NGX_RESOLVE_PTR:
|
|
|
937
|
|
356
|
938 ngx_resolver_process_ptr(r, buf, n, ident, code, nan);
|
|
350
|
939
|
|
|
940 break;
|
|
|
941
|
|
|
942 default:
|
|
|
943 ngx_log_error(r->log_level, r->log, 0,
|
|
|
944 "unknown query type %d in DNS response", qtype);
|
|
|
945 return;
|
|
|
946 }
|
|
|
947
|
|
|
948 return;
|
|
|
949
|
|
|
950 short_response:
|
|
|
951
|
|
|
952 err = "short dns response";
|
|
|
953
|
|
|
954 done:
|
|
|
955
|
|
|
956 ngx_log_error(r->log_level, r->log, 0, err);
|
|
|
957
|
|
|
958 return;
|
|
|
959 }
|
|
|
960
|
|
|
961
|
|
|
962 static void
|
|
|
963 ngx_resolver_process_a(ngx_resolver_t *r, u_char *buf, size_t last,
|
|
|
964 ngx_uint_t ident, ngx_uint_t code, ngx_uint_t nan, ngx_uint_t ans)
|
|
|
965 {
|
|
|
966 char *err;
|
|
|
967 u_char *cname;
|
|
|
968 size_t len;
|
|
|
969 uint32_t hash;
|
|
|
970 in_addr_t addr, *addrs;
|
|
|
971 ngx_str_t name;
|
|
|
972 ngx_uint_t qtype, qident, naddrs, a, i, n, start;
|
|
|
973 ngx_resolver_an_t *an;
|
|
|
974 ngx_resolver_ctx_t *ctx, *next;
|
|
|
975 ngx_resolver_node_t *rn;
|
|
|
976
|
|
|
977 if (ngx_resolver_copy(r, &name, buf, &buf[12], &buf[last]) != NGX_OK) {
|
|
|
978 return;
|
|
|
979 }
|
|
|
980
|
|
|
981 ngx_log_debug1(NGX_LOG_DEBUG_CORE, r->log, 0, "resolver qs:%V", &name);
|
|
|
982
|
|
|
983 hash = ngx_crc32_short(name.data, name.len);
|
|
|
984
|
|
|
985 /* lock name mutex */
|
|
|
986
|
|
|
987 rn = ngx_resolver_lookup_name(r, &name, hash);
|
|
|
988
|
|
|
989 if (rn == NULL || rn->query == NULL) {
|
|
|
990 ngx_log_error(r->log_level, r->log, 0,
|
|
|
991 "unexpected response for %V", &name);
|
|
|
992 goto failed;
|
|
|
993 }
|
|
|
994
|
|
|
995 qident = (rn->query[0] << 8) + rn->query[1];
|
|
|
996
|
|
|
997 if (ident != qident) {
|
|
|
998 ngx_log_error(r->log_level, r->log, 0,
|
|
|
999 "wrong ident %d response for %V, expect %d",
|
|
|
1000 ident, &name, qident);
|
|
|
1001 goto failed;
|
|
|
1002 }
|
|
|
1003
|
|
356
|
1004 if (code == 0 && nan == 0) {
|
|
|
1005 code = 3; /* NXDOMAIN */
|
|
|
1006 }
|
|
|
1007
|
|
350
|
1008 if (code) {
|
|
|
1009 next = rn->waiting;
|
|
|
1010 rn->waiting = NULL;
|
|
|
1011
|
|
|
1012 ngx_queue_remove(&rn->queue);
|
|
|
1013
|
|
|
1014 ngx_rbtree_delete(&r->name_rbtree, &rn->node);
|
|
|
1015
|
|
|
1016 ngx_resolver_free_node(r, rn);
|
|
|
1017
|
|
|
1018 /* unlock name mutex */
|
|
|
1019
|
|
|
1020 while (next) {
|
|
|
1021 ctx = next;
|
|
|
1022 ctx->state = code;
|
|
|
1023 next = ctx->next;
|
|
|
1024
|
|
|
1025 ctx->handler(ctx);
|
|
|
1026 }
|
|
|
1027
|
|
|
1028 return;
|
|
|
1029 }
|
|
|
1030
|
|
|
1031 i = ans;
|
|
|
1032 naddrs = 0;
|
|
|
1033 addr = 0;
|
|
|
1034 addrs = NULL;
|
|
|
1035 cname = NULL;
|
|
|
1036 qtype = 0;
|
|
|
1037
|
|
|
1038 for (a = 0; a < nan; a++) {
|
|
|
1039
|
|
|
1040 start = i;
|
|
|
1041
|
|
|
1042 while (i < last) {
|
|
|
1043
|
|
|
1044 if (buf[i] & 0xc0) {
|
|
|
1045 i += 2;
|
|
|
1046 goto found;
|
|
|
1047 }
|
|
|
1048
|
|
|
1049 if (buf[i] == 0) {
|
|
|
1050 i++;
|
|
|
1051 goto test_length;
|
|
|
1052 }
|
|
|
1053
|
|
|
1054 i += 1 + buf[i];
|
|
|
1055 }
|
|
|
1056
|
|
|
1057 goto short_response;
|
|
|
1058
|
|
|
1059 test_length:
|
|
|
1060
|
|
|
1061 if (i - start < 2) {
|
|
|
1062 err = "invalid name in dns response";
|
|
|
1063 goto invalid;
|
|
|
1064 }
|
|
|
1065
|
|
|
1066 found:
|
|
|
1067
|
|
|
1068 if (i + sizeof(ngx_resolver_an_t) >= last) {
|
|
|
1069 goto short_response;
|
|
|
1070 }
|
|
|
1071
|
|
|
1072 an = (ngx_resolver_an_t *) &buf[i];
|
|
|
1073
|
|
|
1074 qtype = (an->type_hi << 8) + an->type_lo;
|
|
|
1075 len = (an->len_hi << 8) + an->len_lo;
|
|
|
1076
|
|
|
1077 if (qtype == NGX_RESOLVE_A) {
|
|
|
1078
|
|
|
1079 i += sizeof(ngx_resolver_an_t);
|
|
|
1080
|
|
|
1081 if (i + len > last) {
|
|
|
1082 goto short_response;
|
|
|
1083 }
|
|
|
1084
|
|
|
1085 addr = htonl((buf[i] << 24) + (buf[i + 1] << 16)
|
|
|
1086 + (buf[i + 2] << 8) + (buf[i + 3]));
|
|
|
1087
|
|
|
1088 naddrs++;
|
|
|
1089
|
|
|
1090 i += len;
|
|
|
1091
|
|
|
1092 } else if (qtype == NGX_RESOLVE_CNAME) {
|
|
|
1093 cname = &buf[i] + sizeof(ngx_resolver_an_t);
|
|
|
1094 i += sizeof(ngx_resolver_an_t) + len;
|
|
|
1095 }
|
|
|
1096 }
|
|
|
1097
|
|
|
1098 ngx_log_debug2(NGX_LOG_DEBUG_CORE, r->log, 0,
|
|
|
1099 "resolver naddrs:%ui cname:%p", naddrs, cname);
|
|
|
1100
|
|
|
1101 if (naddrs) {
|
|
|
1102
|
|
|
1103 if (naddrs == 1) {
|
|
|
1104 rn->u.addr = addr;
|
|
|
1105
|
|
|
1106 } else {
|
|
|
1107
|
|
|
1108 addrs = ngx_resolver_alloc(r, naddrs * sizeof(in_addr_t));
|
|
|
1109 if (addrs == NULL) {
|
|
|
1110 return;
|
|
|
1111 }
|
|
|
1112
|
|
|
1113 n = 0;
|
|
|
1114 i = ans;
|
|
|
1115
|
|
|
1116 for (a = 0; a < nan; a++) {
|
|
|
1117
|
|
|
1118 for ( ;; ) {
|
|
|
1119
|
|
|
1120 if (buf[i] & 0xc0) {
|
|
|
1121 i += 2;
|
|
|
1122 goto ok;
|
|
|
1123 }
|
|
|
1124
|
|
|
1125 if (buf[i] == 0) {
|
|
|
1126 i++;
|
|
|
1127 goto ok;
|
|
|
1128 }
|
|
|
1129
|
|
|
1130 i += 1 + buf[i];
|
|
|
1131 }
|
|
|
1132
|
|
|
1133 ok:
|
|
|
1134
|
|
|
1135 an = (ngx_resolver_an_t *) &buf[i];
|
|
|
1136
|
|
|
1137 qtype = (an->type_hi << 8) + an->type_lo;
|
|
|
1138 len = (an->len_hi << 8) + an->len_lo;
|
|
|
1139
|
|
|
1140 i += sizeof(ngx_resolver_an_t);
|
|
|
1141
|
|
|
1142 if (qtype == NGX_RESOLVE_A) {
|
|
|
1143
|
|
|
1144 addrs[n++] = htonl((buf[i] << 24) + (buf[i + 1] << 16)
|
|
|
1145 + (buf[i + 2] << 8) + (buf[i + 3]));
|
|
|
1146
|
|
|
1147 if (n == naddrs) {
|
|
|
1148 break;
|
|
|
1149 }
|
|
|
1150 }
|
|
|
1151
|
|
|
1152 i += len;
|
|
|
1153 }
|
|
|
1154
|
|
|
1155 rn->u.addrs = addrs;
|
|
|
1156
|
|
|
1157 addrs = ngx_resolver_dup(r, rn->u.addrs,
|
|
|
1158 naddrs * sizeof(in_addr_t));
|
|
|
1159 if (addrs == NULL) {
|
|
|
1160 return;
|
|
|
1161 }
|
|
|
1162 }
|
|
|
1163
|
|
|
1164 rn->naddrs = (u_short) naddrs;
|
|
|
1165
|
|
|
1166 ngx_queue_remove(&rn->queue);
|
|
|
1167
|
|
|
1168 rn->valid = ngx_time() + r->valid;
|
|
|
1169 rn->expire = ngx_time() + r->expire;
|
|
|
1170
|
|
|
1171 ngx_queue_insert_head(&r->name_expire_queue, &rn->queue);
|
|
|
1172
|
|
|
1173 next = rn->waiting;
|
|
|
1174 rn->waiting = NULL;
|
|
|
1175
|
|
|
1176 /* unlock name mutex */
|
|
|
1177
|
|
|
1178 while (next) {
|
|
|
1179 ctx = next;
|
|
|
1180 ctx->state = NGX_OK;
|
|
|
1181 ctx->naddrs = naddrs;
|
|
|
1182 ctx->addrs = (naddrs == 1) ? &ctx->addr : addrs;
|
|
|
1183 ctx->addr = addr;
|
|
|
1184 next = ctx->next;
|
|
|
1185
|
|
|
1186 ctx->handler(ctx);
|
|
|
1187 }
|
|
|
1188
|
|
|
1189 if (naddrs) {
|
|
|
1190 ngx_resolver_free(r, addrs);
|
|
|
1191 }
|
|
|
1192
|
|
|
1193 return;
|
|
|
1194
|
|
|
1195 } else if (cname) {
|
|
|
1196
|
|
|
1197 /* CNAME only */
|
|
|
1198
|
|
|
1199 if (ngx_resolver_copy(r, &name, buf, cname, &buf[last]) != NGX_OK) {
|
|
|
1200 return;
|
|
|
1201 }
|
|
|
1202
|
|
|
1203 ngx_log_debug1(NGX_LOG_DEBUG_CORE, r->log, 0,
|
|
|
1204 "resolver cname:\"%V\"", &name);
|
|
|
1205
|
|
356
|
1206 ngx_queue_remove(&rn->queue);
|
|
|
1207
|
|
350
|
1208 rn->cnlen = (u_short) name.len;
|
|
|
1209 rn->u.cname = name.data;
|
|
|
1210 rn->valid = ngx_time() + r->valid;
|
|
|
1211 rn->expire = ngx_time() + r->expire;
|
|
|
1212
|
|
|
1213 ngx_queue_insert_head(&r->name_expire_queue, &rn->queue);
|
|
|
1214
|
|
|
1215 ctx = rn->waiting;
|
|
|
1216 rn->waiting = NULL;
|
|
|
1217
|
|
|
1218 if (ctx) {
|
|
|
1219 ctx->name = name;
|
|
|
1220
|
|
|
1221 (void) ngx_resolve_name_locked(r, ctx);
|
|
|
1222 }
|
|
|
1223
|
|
|
1224 return;
|
|
|
1225 }
|
|
|
1226
|
|
|
1227 ngx_log_error(r->log_level, r->log, 0,
|
|
|
1228 "no A or CNAME types in DNS responses, unknown query type: %d",
|
|
|
1229 qtype);
|
|
|
1230 return;
|
|
|
1231
|
|
|
1232 short_response:
|
|
|
1233
|
|
|
1234 err = "short dns response";
|
|
|
1235
|
|
|
1236 invalid:
|
|
|
1237
|
|
|
1238 /* unlock name mutex */
|
|
|
1239
|
|
|
1240 ngx_log_error(r->log_level, r->log, 0, err);
|
|
|
1241
|
|
|
1242 return;
|
|
|
1243
|
|
|
1244 failed:
|
|
|
1245
|
|
|
1246 /* unlock name mutex */
|
|
|
1247
|
|
|
1248 return;
|
|
|
1249 }
|
|
|
1250
|
|
|
1251
|
|
|
1252 static void
|
|
|
1253 ngx_resolver_process_ptr(ngx_resolver_t *r, u_char *buf, size_t n,
|
|
356
|
1254 ngx_uint_t ident, ngx_uint_t code, ngx_uint_t nan)
|
|
350
|
1255 {
|
|
|
1256 char *err;
|
|
|
1257 size_t len;
|
|
|
1258 in_addr_t addr;
|
|
|
1259 ngx_int_t digit;
|
|
|
1260 ngx_str_t name;
|
|
|
1261 ngx_uint_t i, mask, qtype, qclass, qident;
|
|
|
1262 ngx_resolver_an_t *an;
|
|
|
1263 ngx_resolver_ctx_t *ctx, *next;
|
|
|
1264 ngx_resolver_node_t *rn;
|
|
|
1265
|
|
|
1266 if (ngx_resolver_copy(r, NULL, buf, &buf[12], &buf[n]) != NGX_OK) {
|
|
|
1267 goto invalid_in_addr_arpa;
|
|
|
1268 }
|
|
|
1269
|
|
|
1270 addr = 0;
|
|
|
1271 i = 12;
|
|
|
1272
|
|
|
1273 for (mask = 0; mask < 32; mask += 8) {
|
|
|
1274 len = buf[i++];
|
|
|
1275
|
|
|
1276 digit = ngx_atoi(&buf[i], len);
|
|
|
1277 if (digit == NGX_ERROR || digit > 255) {
|
|
|
1278 goto invalid_in_addr_arpa;
|
|
|
1279 }
|
|
|
1280
|
|
|
1281 addr += digit << mask;
|
|
|
1282 i += len;
|
|
|
1283 }
|
|
|
1284
|
|
|
1285 if (ngx_strcmp(&buf[i], "\7in-addr\4arpa") != 0) {
|
|
|
1286 goto invalid_in_addr_arpa;
|
|
|
1287 }
|
|
|
1288
|
|
|
1289 /* lock addr mutex */
|
|
|
1290
|
|
|
1291 rn = ngx_resolver_lookup_addr(r, addr);
|
|
|
1292
|
|
|
1293 if (rn == NULL || rn->query == NULL) {
|
|
|
1294 ngx_log_error(r->log_level, r->log, 0,
|
|
|
1295 "unexpected response for %ud.%ud.%ud.%ud",
|
|
|
1296 (addr >> 24) & 0xff, (addr >> 16) & 0xff,
|
|
|
1297 (addr >> 8) & 0xff, addr & 0xff);
|
|
|
1298 goto failed;
|
|
|
1299 }
|
|
|
1300
|
|
|
1301 qident = (rn->query[0] << 8) + rn->query[1];
|
|
|
1302
|
|
|
1303 if (ident != qident) {
|
|
|
1304 ngx_log_error(r->log_level, r->log, 0,
|
|
|
1305 "wrong ident %d response for %ud.%ud.%ud.%ud, expect %d",
|
|
|
1306 ident, (addr >> 24) & 0xff, (addr >> 16) & 0xff,
|
|
|
1307 (addr >> 8) & 0xff, addr & 0xff, qident);
|
|
|
1308 goto failed;
|
|
|
1309 }
|
|
|
1310
|
|
356
|
1311 if (code == 0 && nan == 0) {
|
|
|
1312 code = 3; /* NXDOMAIN */
|
|
|
1313 }
|
|
|
1314
|
|
350
|
1315 if (code) {
|
|
|
1316 next = rn->waiting;
|
|
|
1317 rn->waiting = NULL;
|
|
|
1318
|
|
|
1319 ngx_queue_remove(&rn->queue);
|
|
|
1320
|
|
|
1321 ngx_rbtree_delete(&r->addr_rbtree, &rn->node);
|
|
|
1322
|
|
|
1323 ngx_resolver_free_node(r, rn);
|
|
|
1324
|
|
|
1325 /* unlock addr mutex */
|
|
|
1326
|
|
|
1327 while (next) {
|
|
|
1328 ctx = next;
|
|
|
1329 ctx->state = code;
|
|
|
1330 next = ctx->next;
|
|
|
1331
|
|
|
1332 ctx->handler(ctx);
|
|
|
1333 }
|
|
|
1334
|
|
|
1335 return;
|
|
|
1336 }
|
|
|
1337
|
|
|
1338 i += sizeof("\7in-addr\4arpa") + sizeof(ngx_resolver_qs_t);
|
|
|
1339
|
|
|
1340 if (i + 2 + sizeof(ngx_resolver_an_t) > (ngx_uint_t) n) {
|
|
|
1341 goto short_response;
|
|
|
1342 }
|
|
|
1343
|
|
|
1344 /* compression pointer to "XX.XX.XX.XX.in-addr.arpa */
|
|
|
1345
|
|
|
1346 if (buf[i] != 0xc0 || buf[i + 1] != 0x0c) {
|
|
|
1347 err = "invalid in-addr.arpa name in DNS response";
|
|
|
1348 goto invalid;
|
|
|
1349 }
|
|
|
1350
|
|
|
1351 an = (ngx_resolver_an_t *) &buf[i + 2];
|
|
|
1352
|
|
|
1353 qtype = (an->type_hi << 8) + an->type_lo;
|
|
|
1354 qclass = (an->class_hi << 8) + an->class_lo;
|
|
|
1355 len = (an->len_hi << 8) + an->len_lo;
|
|
|
1356
|
|
|
1357 ngx_log_debug3(NGX_LOG_DEBUG_CORE, r->log, 0,
|
|
|
1358 "resolver qt:%d cl:%d len:%uz", qtype, qclass, len);
|
|
|
1359
|
|
|
1360 i += 2 + sizeof(ngx_resolver_an_t);
|
|
|
1361
|
|
|
1362 if (i + len > (ngx_uint_t) n) {
|
|
|
1363 goto short_response;
|
|
|
1364 }
|
|
|
1365
|
|
|
1366 len -= 2;
|
|
|
1367
|
|
|
1368 if (ngx_resolver_copy(r, &name, buf, &buf[i], &buf[n]) != NGX_OK) {
|
|
|
1369 return;
|
|
|
1370 }
|
|
|
1371
|
|
|
1372 ngx_log_debug1(NGX_LOG_DEBUG_CORE, r->log, 0, "resolver an:%V", &name);
|
|
|
1373
|
|
|
1374 if (len != (size_t) rn->nlen || ngx_strncmp(name.data, rn->name, len) != 0)
|
|
|
1375 {
|
|
|
1376 ngx_resolver_free(r, rn->name);
|
|
|
1377 rn->name = name.data;
|
|
|
1378
|
|
|
1379 name.data = ngx_resolver_dup(r, rn->name, len);
|
|
|
1380 if (name.data == NULL) {
|
|
|
1381 goto failed;
|
|
|
1382 }
|
|
|
1383 }
|
|
|
1384
|
|
|
1385 ngx_queue_remove(&rn->queue);
|
|
|
1386
|
|
|
1387 rn->valid = ngx_time() + r->valid;
|
|
|
1388 rn->expire = ngx_time() + r->expire;
|
|
|
1389
|
|
|
1390 ngx_queue_insert_head(&r->addr_expire_queue, &rn->queue);
|
|
|
1391
|
|
|
1392 next = rn->waiting;
|
|
|
1393 rn->waiting = NULL;
|
|
|
1394
|
|
|
1395 /* unlock addr mutex */
|
|
|
1396
|
|
|
1397 while (next) {
|
|
|
1398 ctx = next;
|
|
|
1399 ctx->state = NGX_OK;
|
|
|
1400 ctx->name = name;
|
|
|
1401 next = ctx->next;
|
|
|
1402
|
|
|
1403 ctx->handler(ctx);
|
|
|
1404 }
|
|
|
1405
|
|
|
1406 ngx_resolver_free(r, name.data);
|
|
|
1407
|
|
|
1408 return;
|
|
|
1409
|
|
|
1410 invalid_in_addr_arpa:
|
|
|
1411
|
|
|
1412 ngx_log_error(r->log_level, r->log, 0,
|
|
|
1413 "invalid in-addr.arpa name in DNS response");
|
|
|
1414 return;
|
|
|
1415
|
|
|
1416 short_response:
|
|
|
1417
|
|
|
1418 err = "short DNS response";
|
|
|
1419
|
|
|
1420 invalid:
|
|
|
1421
|
|
|
1422 /* unlock addr mutex */
|
|
|
1423
|
|
|
1424 ngx_log_error(r->log_level, r->log, 0, err);
|
|
|
1425
|
|
|
1426 return;
|
|
|
1427
|
|
|
1428 failed:
|
|
|
1429
|
|
|
1430 /* unlock addr mutex */
|
|
|
1431
|
|
|
1432 return;
|
|
|
1433 }
|
|
|
1434
|
|
|
1435
|
|
|
1436 static ngx_resolver_node_t *
|
|
|
1437 ngx_resolver_lookup_name(ngx_resolver_t *r, ngx_str_t *name, uint32_t hash)
|
|
|
1438 {
|
|
|
1439 ngx_int_t rc;
|
|
|
1440 size_t len;
|
|
|
1441 ngx_rbtree_node_t *node, *sentinel;
|
|
|
1442 ngx_resolver_node_t *rn;
|
|
|
1443
|
|
|
1444 node = r->name_rbtree.root;
|
|
|
1445 sentinel = r->name_rbtree.sentinel;
|
|
|
1446
|
|
|
1447 while (node != sentinel) {
|
|
|
1448
|
|
|
1449 if (hash < node->key) {
|
|
|
1450 node = node->left;
|
|
|
1451 continue;
|
|
|
1452 }
|
|
|
1453
|
|
|
1454 if (hash > node->key) {
|
|
|
1455 node = node->right;
|
|
|
1456 continue;
|
|
|
1457 }
|
|
|
1458
|
|
|
1459 /* hash == node->key */
|
|
|
1460
|
|
|
1461 do {
|
|
|
1462 rn = (ngx_resolver_node_t *) node;
|
|
|
1463
|
|
|
1464 len = (name->len > (size_t) rn->nlen) ? rn->nlen : name->len;
|
|
|
1465
|
|
|
1466 rc = ngx_strncmp(name->data, rn->name, len);
|
|
|
1467
|
|
|
1468 if (rc == 0) {
|
|
|
1469 return rn;
|
|
|
1470 }
|
|
|
1471
|
|
|
1472 node = (rc < 0) ? node->left : node->right;
|
|
|
1473
|
|
|
1474 } while (node != sentinel && hash == node->key);
|
|
|
1475
|
|
|
1476 break;
|
|
|
1477 }
|
|
|
1478
|
|
|
1479 /* not found */
|
|
|
1480
|
|
|
1481 return NULL;
|
|
|
1482 }
|
|
|
1483
|
|
|
1484
|
|
|
1485 static ngx_resolver_node_t *
|
|
|
1486 ngx_resolver_lookup_addr(ngx_resolver_t *r, in_addr_t addr)
|
|
|
1487 {
|
|
|
1488 ngx_rbtree_node_t *node, *sentinel;
|
|
|
1489
|
|
|
1490 node = r->addr_rbtree.root;
|
|
|
1491 sentinel = r->addr_rbtree.sentinel;
|
|
|
1492
|
|
|
1493 while (node != sentinel) {
|
|
|
1494
|
|
|
1495 if (addr < node->key) {
|
|
|
1496 node = node->left;
|
|
|
1497 continue;
|
|
|
1498 }
|
|
|
1499
|
|
|
1500 if (addr > node->key) {
|
|
|
1501 node = node->right;
|
|
|
1502 continue;
|
|
|
1503 }
|
|
|
1504
|
|
|
1505 /* addr == node->key */
|
|
|
1506
|
|
|
1507 return (ngx_resolver_node_t *) node;
|
|
|
1508 }
|
|
|
1509
|
|
|
1510 /* not found */
|
|
|
1511
|
|
|
1512 return NULL;
|
|
|
1513 }
|
|
|
1514
|
|
|
1515
|
|
|
1516 static void
|
|
|
1517 ngx_resolver_rbtree_insert_value(ngx_rbtree_node_t *temp,
|
|
|
1518 ngx_rbtree_node_t *node, ngx_rbtree_node_t *sentinel)
|
|
|
1519 {
|
|
|
1520 size_t len;
|
|
|
1521 ngx_rbtree_node_t **p;
|
|
|
1522 ngx_resolver_node_t *rn, *rn_temp;
|
|
|
1523
|
|
|
1524 for ( ;; ) {
|
|
|
1525
|
|
|
1526 if (node->key < temp->key) {
|
|
|
1527
|
|
|
1528 p = &temp->left;
|
|
|
1529
|
|
|
1530 } else if (node->key > temp->key) {
|
|
|
1531
|
|
|
1532 p = &temp->right;
|
|
|
1533
|
|
|
1534 } else { /* node->key == temp->key */
|
|
|
1535
|
|
|
1536 rn = (ngx_resolver_node_t *) node;
|
|
|
1537 rn_temp = (ngx_resolver_node_t *) temp;
|
|
|
1538
|
|
|
1539 len = (rn->nlen > rn_temp->nlen) ? rn_temp->nlen : rn->nlen;
|
|
|
1540
|
|
|
1541 p = (ngx_strncmp(rn->name, rn_temp->name, len) < 0)
|
|
|
1542 ? &temp->left : &temp->right;
|
|
|
1543 }
|
|
|
1544
|
|
|
1545 if (*p == sentinel) {
|
|
|
1546 break;
|
|
|
1547 }
|
|
|
1548
|
|
|
1549 temp = *p;
|
|
|
1550 }
|
|
|
1551
|
|
|
1552 *p = node;
|
|
|
1553 node->parent = temp;
|
|
|
1554 node->left = sentinel;
|
|
|
1555 node->right = sentinel;
|
|
|
1556 ngx_rbt_red(node);
|
|
|
1557 }
|
|
|
1558
|
|
|
1559
|
|
|
1560 static ngx_int_t
|
|
|
1561 ngx_resolver_create_name_query(ngx_resolver_node_t *rn, ngx_resolver_ctx_t *ctx)
|
|
|
1562 {
|
|
|
1563 u_char *p, *s;
|
|
|
1564 size_t len;
|
|
|
1565 ngx_uint_t ident;
|
|
|
1566 ngx_resolver_qs_t *qs;
|
|
|
1567 ngx_resolver_query_t *query;
|
|
|
1568
|
|
|
1569 len = sizeof(ngx_resolver_query_t)
|
|
|
1570 + 1 + ctx->name.len + 1 + sizeof(ngx_resolver_qs_t);
|
|
|
1571
|
|
|
1572 p = ngx_resolver_calloc(ctx->resolver, len);
|
|
|
1573 if (p == NULL) {
|
|
|
1574 return NGX_ERROR;
|
|
|
1575 }
|
|
|
1576
|
|
|
1577 rn->qlen = (u_short) len;
|
|
|
1578 rn->query = p;
|
|
|
1579
|
|
|
1580 query = (ngx_resolver_query_t *) p;
|
|
|
1581
|
|
|
1582 ident = ngx_random();
|
|
|
1583
|
|
|
1584 ngx_log_debug2(NGX_LOG_DEBUG_CORE, ctx->resolver->log, 0,
|
|
|
1585 "resolve: \"%V\" %i", &ctx->name, ident & 0xffff);
|
|
|
1586
|
|
|
1587 query->ident_hi = (u_char) ((ident >> 8) & 0xff);
|
|
|
1588 query->ident_lo = (u_char) (ident & 0xff);
|
|
|
1589
|
|
|
1590 /* recursion query */
|
|
|
1591 query->flags_hi = 1; query->flags_lo = 0;
|
|
|
1592
|
|
|
1593 /* one question */
|
|
|
1594 query->nqs_hi = 0; query->nqs_lo = 1;
|
|
|
1595 query->nan_hi = 0; query->nan_lo = 0;
|
|
|
1596 query->nns_hi = 0; query->nns_lo = 0;
|
|
|
1597 query->nar_hi = 0; query->nar_lo = 0;
|
|
|
1598
|
|
|
1599 p += sizeof(ngx_resolver_query_t) + 1 + ctx->name.len + 1;
|
|
|
1600
|
|
|
1601 qs = (ngx_resolver_qs_t *) p;
|
|
|
1602
|
|
|
1603 /* query type */
|
|
|
1604 qs->type_hi = 0; qs->type_lo = (u_char) ctx->type;
|
|
|
1605
|
|
|
1606 /* IP query class */
|
|
|
1607 qs->class_hi = 0; qs->class_lo = 1;
|
|
|
1608
|
|
|
1609 /* convert "www.example.com" to "\3www\7example\3com\0" */
|
|
|
1610
|
|
|
1611 len = 0;
|
|
|
1612 p--;
|
|
|
1613 *p-- = '\0';
|
|
|
1614
|
|
|
1615 for (s = ctx->name.data + ctx->name.len - 1; s >= ctx->name.data; s--) {
|
|
|
1616 if (*s != '.') {
|
|
|
1617 *p = *s;
|
|
|
1618 len++;
|
|
|
1619
|
|
|
1620 } else {
|
|
|
1621 *p = (u_char) len;
|
|
|
1622 len = 0;
|
|
|
1623 }
|
|
|
1624
|
|
|
1625 p--;
|
|
|
1626 }
|
|
|
1627
|
|
|
1628 *p = (u_char) len;
|
|
|
1629
|
|
|
1630 return NGX_OK;
|
|
|
1631 }
|
|
|
1632
|
|
|
1633
|
|
|
1634 /* AF_INET only */
|
|
|
1635
|
|
|
1636 static ngx_int_t
|
|
|
1637 ngx_resolver_create_addr_query(ngx_resolver_node_t *rn, ngx_resolver_ctx_t *ctx)
|
|
|
1638 {
|
|
|
1639 u_char *p, *d;
|
|
|
1640 size_t len;
|
|
|
1641 ngx_int_t n;
|
|
|
1642 ngx_uint_t ident;
|
|
|
1643 ngx_resolver_query_t *query;
|
|
|
1644
|
|
|
1645 len = sizeof(ngx_resolver_query_t)
|
|
|
1646 + sizeof(".255.255.255.255.in-addr.arpa.") - 1
|
|
|
1647 + sizeof(ngx_resolver_qs_t);
|
|
|
1648
|
|
|
1649 p = ngx_resolver_calloc(ctx->resolver, len);
|
|
|
1650 if (p == NULL) {
|
|
|
1651 return NGX_ERROR;
|
|
|
1652 }
|
|
|
1653
|
|
|
1654 rn->query = p;
|
|
|
1655 query = (ngx_resolver_query_t *) p;
|
|
|
1656
|
|
|
1657 ident = ngx_random();
|
|
|
1658
|
|
|
1659 query->ident_hi = (u_char) ((ident >> 8) & 0xff);
|
|
|
1660 query->ident_lo = (u_char) (ident & 0xff);
|
|
|
1661
|
|
|
1662 /* recursion query */
|
|
|
1663 query->flags_hi = 1; query->flags_lo = 0;
|
|
|
1664
|
|
|
1665 /* one question */
|
|
|
1666 query->nqs_hi = 0; query->nqs_lo = 1;
|
|
|
1667 query->nan_hi = 0; query->nan_lo = 0;
|
|
|
1668 query->nns_hi = 0; query->nns_lo = 0;
|
|
|
1669 query->nar_hi = 0; query->nar_lo = 0;
|
|
|
1670
|
|
|
1671 p += sizeof(ngx_resolver_query_t);
|
|
|
1672
|
|
|
1673 for (n = 0; n < 32; n += 8){
|
|
|
1674 d = ngx_sprintf(&p[1], "%ud", (ctx->addr >> n) & 0xff);
|
|
|
1675 *p = (u_char) (d - &p[1]);
|
|
|
1676 p = d;
|
|
|
1677 }
|
|
|
1678
|
|
|
1679 /* query type "PTR", IP query class */
|
|
|
1680 ngx_memcpy(p, "\7in-addr\4arpa\0\0\14\0\1", 18);
|
|
|
1681
|
|
|
1682 rn->qlen = (u_short)
|
|
|
1683 (p + sizeof("\7in-addr\4arpa") + sizeof(ngx_resolver_qs_t)
|
|
|
1684 - rn->query);
|
|
|
1685
|
|
|
1686 return NGX_OK;
|
|
|
1687 }
|
|
|
1688
|
|
|
1689
|
|
|
1690 static ngx_int_t
|
|
|
1691 ngx_resolver_copy(ngx_resolver_t *r, ngx_str_t *name, u_char *buf, u_char *src,
|
|
|
1692 u_char *last)
|
|
|
1693 {
|
|
|
1694 char *err;
|
|
|
1695 u_char *p, *dst;
|
|
|
1696 ssize_t len;
|
|
|
1697 ngx_uint_t i, n;
|
|
|
1698
|
|
|
1699 p = src;
|
|
|
1700 len = -1;
|
|
|
1701
|
|
|
1702 /*
|
|
|
1703 * compression pointers allow to create endless loop, so we set limit;
|
|
|
1704 * 128 pointers should be enough to store 255-byte name
|
|
|
1705 */
|
|
|
1706
|
|
|
1707 for (i = 0; i < 128; i++) {
|
|
|
1708 n = *p++;
|
|
|
1709
|
|
|
1710 if (n == 0) {
|
|
|
1711 goto done;
|
|
|
1712 }
|
|
|
1713
|
|
|
1714 if (n & 0xc0) {
|
|
|
1715 n = (n & 0x3f << 8) + *p;
|
|
|
1716 p = &buf[n];
|
|
|
1717
|
|
|
1718 } else {
|
|
|
1719 len += 1 + n;
|
|
|
1720 p = &p[n];
|
|
|
1721 }
|
|
|
1722
|
|
|
1723 if (p >= last) {
|
|
|
1724 err = "name is out of response";
|
|
|
1725 goto invalid;
|
|
|
1726 }
|
|
|
1727 }
|
|
|
1728
|
|
|
1729 err = "compression pointers loop";
|
|
|
1730
|
|
|
1731 invalid:
|
|
|
1732
|
|
|
1733 ngx_log_error(r->log_level, r->log, 0, err);
|
|
|
1734
|
|
|
1735 return NGX_ERROR;
|
|
|
1736
|
|
|
1737 done:
|
|
|
1738
|
|
|
1739 if (name == NULL) {
|
|
|
1740 return NGX_OK;
|
|
|
1741 }
|
|
|
1742
|
|
|
1743 dst = ngx_resolver_alloc(r, len);
|
|
|
1744 if (dst == NULL) {
|
|
|
1745 return NGX_ERROR;
|
|
|
1746 }
|
|
|
1747
|
|
|
1748 name->data = dst;
|
|
|
1749
|
|
|
1750 n = *src++;
|
|
|
1751
|
|
|
1752 for ( ;; ) {
|
|
|
1753 if (n != 0xc0) {
|
|
|
1754 ngx_memcpy(dst, src, n);
|
|
|
1755 dst += n;
|
|
|
1756 src += n;
|
|
|
1757
|
|
|
1758 n = *src++;
|
|
|
1759
|
|
|
1760 if (n != 0) {
|
|
|
1761 *dst++ = '.';
|
|
|
1762 }
|
|
|
1763
|
|
|
1764 } else {
|
|
|
1765 n = (n & 0x3f << 8) + *src;
|
|
|
1766 src = &buf[n];
|
|
|
1767
|
|
|
1768 n = *src++;
|
|
|
1769 }
|
|
|
1770
|
|
|
1771 if (n == 0) {
|
|
|
1772 name->len = dst - name->data;
|
|
|
1773 return NGX_OK;
|
|
|
1774 }
|
|
|
1775 }
|
|
|
1776 }
|
|
|
1777
|
|
|
1778
|
|
|
1779 static void
|
|
|
1780 ngx_resolver_timeout_handler(ngx_event_t *ev)
|
|
|
1781 {
|
|
|
1782 ngx_resolver_ctx_t *ctx;
|
|
|
1783
|
|
|
1784 ctx = ev->data;
|
|
|
1785
|
|
|
1786 ctx->state = NGX_RESOLVE_TIMEDOUT;
|
|
|
1787
|
|
|
1788 ctx->handler(ctx);
|
|
|
1789 }
|
|
|
1790
|
|
|
1791
|
|
|
1792 static void
|
|
|
1793 ngx_resolver_free_node(ngx_resolver_t *r, ngx_resolver_node_t *rn)
|
|
|
1794 {
|
|
|
1795 /* lock alloc mutex */
|
|
|
1796
|
|
|
1797 if (rn->query) {
|
|
|
1798 ngx_resolver_free_locked(r, rn->query);
|
|
|
1799 }
|
|
|
1800
|
|
|
1801 if (rn->name) {
|
|
|
1802 ngx_resolver_free_locked(r, rn->name);
|
|
|
1803 }
|
|
|
1804
|
|
|
1805 if (rn->cnlen) {
|
|
|
1806 ngx_resolver_free_locked(r, rn->u.cname);
|
|
|
1807 }
|
|
|
1808
|
|
|
1809 if (rn->naddrs > 1) {
|
|
|
1810 ngx_resolver_free_locked(r, rn->u.addrs);
|
|
|
1811 }
|
|
|
1812
|
|
|
1813 ngx_resolver_free_locked(r, rn);
|
|
|
1814
|
|
|
1815 /* unlock alloc mutex */
|
|
|
1816 }
|
|
|
1817
|
|
|
1818
|
|
|
1819 static void *
|
|
|
1820 ngx_resolver_alloc(ngx_resolver_t *r, size_t size)
|
|
|
1821 {
|
|
|
1822 u_char *p;
|
|
|
1823
|
|
|
1824 /* lock alloc mutex */
|
|
|
1825
|
|
|
1826 p = ngx_alloc(size, r->log);
|
|
|
1827
|
|
|
1828 /* unlock alloc mutex */
|
|
|
1829
|
|
|
1830 return p;
|
|
|
1831 }
|
|
|
1832
|
|
|
1833
|
|
|
1834 void *
|
|
|
1835 ngx_resolver_calloc(ngx_resolver_t *r, size_t size)
|
|
|
1836 {
|
|
|
1837 u_char *p;
|
|
|
1838
|
|
|
1839 p = ngx_resolver_alloc(r, size);
|
|
|
1840
|
|
|
1841 if (p) {
|
|
|
1842 ngx_memzero(p, size);
|
|
|
1843 }
|
|
|
1844
|
|
|
1845 return p;
|
|
|
1846 }
|
|
|
1847
|
|
|
1848
|
|
|
1849 static void
|
|
|
1850 ngx_resolver_free(ngx_resolver_t *r, void *p)
|
|
|
1851 {
|
|
|
1852 /* lock alloc mutex */
|
|
|
1853
|
|
|
1854 ngx_free(p);
|
|
|
1855
|
|
|
1856 /* unlock alloc mutex */
|
|
|
1857 }
|
|
|
1858
|
|
|
1859
|
|
|
1860 static void
|
|
|
1861 ngx_resolver_free_locked(ngx_resolver_t *r, void *p)
|
|
|
1862 {
|
|
|
1863 ngx_free(p);
|
|
|
1864 }
|
|
|
1865
|
|
|
1866
|
|
|
1867 static void *
|
|
|
1868 ngx_resolver_dup(ngx_resolver_t *r, void *src, size_t size)
|
|
|
1869 {
|
|
|
1870 void *dst;
|
|
|
1871
|
|
|
1872 dst = ngx_resolver_alloc(r, size);
|
|
|
1873
|
|
|
1874 if (dst == NULL) {
|
|
|
1875 return dst;
|
|
|
1876 }
|
|
|
1877
|
|
|
1878 ngx_memcpy(dst, src, size);
|
|
|
1879
|
|
|
1880 return dst;
|
|
|
1881 }
|
|
|
1882
|
|
|
1883
|
|
|
1884 char *
|
|
|
1885 ngx_resolver_strerror(ngx_int_t err)
|
|
|
1886 {
|
|
|
1887 static char *errors[] = {
|
|
|
1888 "Format error", /* FORMERR */
|
|
|
1889 "Server failure", /* SERVFAIL */
|
|
|
1890 "Host not found", /* NXDOMAIN */
|
|
|
1891 "Unimplemented", /* NOTIMP */
|
|
|
1892 "Operation refused" /* REFUSED */
|
|
|
1893 };
|
|
|
1894
|
|
|
1895 if (err > 0 && err < 6) {
|
|
|
1896 return errors[err - 1];
|
|
|
1897 }
|
|
|
1898
|
|
|
1899 if (err == NGX_RESOLVE_TIMEDOUT) {
|
|
|
1900 return "Operation timed out";
|
|
|
1901 }
|
|
|
1902
|
|
|
1903 return "Unknown error";
|
|
|
1904 }
|
|
|
1905
|
|
|
1906
|
|
|
1907 ngx_int_t
|
|
|
1908 ngx_udp_connect(ngx_udp_connection_t *uc)
|
|
|
1909 {
|
|
|
1910 int rc;
|
|
|
1911 ngx_int_t event;
|
|
|
1912 ngx_event_t *rev, *wev;
|
|
|
1913 ngx_socket_t s;
|
|
|
1914 ngx_connection_t *c;
|
|
|
1915
|
|
|
1916 s = ngx_socket(AF_INET, SOCK_DGRAM, 0);
|
|
|
1917
|
|
|
1918 ngx_log_debug1(NGX_LOG_DEBUG_EVENT, uc->log, 0, "UDP socket %d", s);
|
|
|
1919
|
|
|
1920 if (s == -1) {
|
|
|
1921 ngx_log_error(NGX_LOG_ALERT, uc->log, ngx_socket_errno,
|
|
|
1922 ngx_socket_n " failed");
|
|
|
1923 return NGX_ERROR;
|
|
|
1924 }
|
|
|
1925
|
|
|
1926 c = ngx_get_connection(s, uc->log);
|
|
|
1927
|
|
|
1928 if (c == NULL) {
|
|
|
1929 if (ngx_close_socket(s) == -1) {
|
|
|
1930 ngx_log_error(NGX_LOG_ALERT, uc->log, ngx_socket_errno,
|
|
|
1931 ngx_close_socket_n "failed");
|
|
|
1932 }
|
|
|
1933
|
|
|
1934 return NGX_ERROR;
|
|
|
1935 }
|
|
|
1936
|
|
|
1937 if (ngx_nonblocking(s) == -1) {
|
|
|
1938 ngx_log_error(NGX_LOG_ALERT, uc->log, ngx_socket_errno,
|
|
|
1939 ngx_nonblocking_n " failed");
|
|
|
1940
|
|
|
1941 ngx_free_connection(c);
|
|
|
1942
|
|
|
1943 if (ngx_close_socket(s) == -1) {
|
|
|
1944 ngx_log_error(NGX_LOG_ALERT, uc->log, ngx_socket_errno,
|
|
|
1945 ngx_close_socket_n " failed");
|
|
|
1946 }
|
|
|
1947
|
|
|
1948 return NGX_ERROR;
|
|
|
1949 }
|
|
|
1950
|
|
|
1951 rev = c->read;
|
|
|
1952 wev = c->write;
|
|
|
1953
|
|
|
1954 rev->log = uc->log;
|
|
|
1955 wev->log = uc->log;
|
|
|
1956
|
|
|
1957 uc->connection = c;
|
|
|
1958
|
|
|
1959 c->number = ngx_atomic_fetch_add(ngx_connection_counter, 1);
|
|
|
1960
|
|
|
1961 #if (NGX_THREADS)
|
|
|
1962
|
|
|
1963 /* TODO: lock event when call completion handler */
|
|
|
1964
|
|
|
1965 rev->lock = &c->lock;
|
|
|
1966 wev->lock = &c->lock;
|
|
|
1967 rev->own_lock = &c->lock;
|
|
|
1968 wev->own_lock = &c->lock;
|
|
|
1969
|
|
|
1970 #endif
|
|
|
1971
|
|
|
1972 ngx_log_debug3(NGX_LOG_DEBUG_EVENT, uc->log, 0,
|
|
|
1973 "connect to %V, fd:%d #%d", &uc->server, s, c->number);
|
|
|
1974
|
|
|
1975 rc = connect(s, uc->sockaddr, uc->socklen);
|
|
|
1976
|
|
|
1977 /* TODO: aio, iocp */
|
|
|
1978
|
|
|
1979 if (rc == -1) {
|
|
|
1980 ngx_log_error(NGX_LOG_CRIT, uc->log, ngx_socket_errno,
|
|
|
1981 "connect() to %V failed", &uc->server);
|
|
|
1982
|
|
|
1983 return NGX_ERROR;
|
|
|
1984 }
|
|
|
1985
|
|
|
1986 /* UDP sockets are always ready to write */
|
|
|
1987 wev->ready = 1;
|
|
|
1988
|
|
|
1989 if (ngx_add_event) {
|
|
|
1990
|
|
|
1991 event = (ngx_event_flags & NGX_USE_CLEAR_EVENT) ?
|
|
|
1992 /* kqueue, epoll */ NGX_CLEAR_EVENT:
|
|
|
1993 /* select, poll, /dev/poll */ NGX_LEVEL_EVENT;
|
|
|
1994 /* eventport event type has no meaning: oneshot only */
|
|
|
1995
|
|
|
1996 if (ngx_add_event(rev, NGX_READ_EVENT, event) != NGX_OK) {
|
|
|
1997 return NGX_ERROR;
|
|
|
1998 }
|
|
|
1999
|
|
|
2000 } else {
|
|
|
2001 /* rtsig */
|
|
|
2002
|
|
|
2003 if (ngx_add_conn(c) == NGX_ERROR) {
|
|
|
2004 return NGX_ERROR;
|
|
|
2005 }
|
|
|
2006 }
|
|
|
2007
|
|
|
2008 return NGX_OK;
|
|
|
2009 }
|
