Mercurial > hg > nginx

comparison src/http/ngx_http_upstream_round_robin.c @ 1389:ab553c23bd3a

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
fix long loop
author Igor Sysoev <igor@sysoev.ru>
date Tue, 14 Aug 2007 13:35:52 +0000
parents cc8ac1936aa4
children 79f033a89dd4
comparison
equal deleted inserted replaced
1388:92bc89c5ff0f 1389:ab553c23bd3a
406 406
407 if (pc->tries == 1 && rrp->peers->next) { 407 if (pc->tries == 1 && rrp->peers->next) {
408 pc->tries += rrp->peers->next->number; 408 pc->tries += rrp->peers->next->number;
409 409
410 n = rrp->peers->next->number / (8 * sizeof(uintptr_t)) + 1; 410 n = rrp->peers->next->number / (8 * sizeof(uintptr_t)) + 1;
411 for (i = 0; i < n; n++) { 411 for (i = 0; i < n; i++) {
412 rrp->tried[i] = 0; 412 rrp->tried[i] = 0;
413 } 413 }
414 } 414 }
415 415
416 return NGX_OK; 416 return NGX_OK;
427 427
428 rrp->peers = peers->next; 428 rrp->peers = peers->next;
429 pc->tries = rrp->peers->number; 429 pc->tries = rrp->peers->number;
430 430
431 n = rrp->peers->number / (8 * sizeof(uintptr_t)) + 1; 431 n = rrp->peers->number / (8 * sizeof(uintptr_t)) + 1;
432 for (i = 0; i < n; n++) { 432 for (i = 0; i < n; i++) {
433 rrp->tried[i] = 0; 433 rrp->tried[i] = 0;
434 } 434 }
435 435
436 rc = ngx_http_upstream_get_round_robin_peer(pc, rrp); 436 rc = ngx_http_upstream_get_round_robin_peer(pc, rrp);
437 437