rrp                14 http/modules/ngx_http_upstream_ip_hash_module.c     ngx_http_upstream_rr_peer_data_t   rrp;
rrp               104 http/modules/ngx_http_upstream_ip_hash_module.c     r->upstream->peer.data = &iphp->rrp;
rrp               151 http/modules/ngx_http_upstream_ip_hash_module.c     if (iphp->tries > 20 || iphp->rrp.peers->single) {
rrp               152 http/modules/ngx_http_upstream_ip_hash_module.c         return iphp->get_rr_peer(pc, &iphp->rrp);
rrp               168 http/modules/ngx_http_upstream_ip_hash_module.c         p = hash % iphp->rrp.peers->number;
rrp               173 http/modules/ngx_http_upstream_ip_hash_module.c         if (!(iphp->rrp.tried[n] & m)) {
rrp               178 http/modules/ngx_http_upstream_ip_hash_module.c             peer = &iphp->rrp.peers->peer[p];
rrp               194 http/modules/ngx_http_upstream_ip_hash_module.c             iphp->rrp.tried[n] |= m;
rrp               202 http/modules/ngx_http_upstream_ip_hash_module.c             return iphp->get_rr_peer(pc, &iphp->rrp);
rrp               206 http/modules/ngx_http_upstream_ip_hash_module.c     iphp->rrp.current = p;
rrp               214 http/modules/ngx_http_upstream_ip_hash_module.c     iphp->rrp.tried[n] |= m;
rrp               206 http/ngx_http_upstream_round_robin.c     ngx_http_upstream_rr_peer_data_t  *rrp;
rrp               208 http/ngx_http_upstream_round_robin.c     rrp = r->upstream->peer.data;
rrp               210 http/ngx_http_upstream_round_robin.c     if (rrp == NULL) {
rrp               211 http/ngx_http_upstream_round_robin.c         rrp = ngx_palloc(r->pool, sizeof(ngx_http_upstream_rr_peer_data_t));
rrp               212 http/ngx_http_upstream_round_robin.c         if (rrp == NULL) {
rrp               216 http/ngx_http_upstream_round_robin.c         r->upstream->peer.data = rrp;
rrp               219 http/ngx_http_upstream_round_robin.c     rrp->peers = us->peer.data;
rrp               220 http/ngx_http_upstream_round_robin.c     rrp->current = 0;
rrp               222 http/ngx_http_upstream_round_robin.c     if (rrp->peers->number <= 8 * sizeof(uintptr_t)) {
rrp               223 http/ngx_http_upstream_round_robin.c         rrp->tried = &rrp->data;
rrp               224 http/ngx_http_upstream_round_robin.c         rrp->data = 0;
rrp               227 http/ngx_http_upstream_round_robin.c         n = (rrp->peers->number + (8 * sizeof(uintptr_t) - 1))
rrp               230 http/ngx_http_upstream_round_robin.c         rrp->tried = ngx_pcalloc(r->pool, n * sizeof(uintptr_t));
rrp               231 http/ngx_http_upstream_round_robin.c         if (rrp->tried == NULL) {
rrp               238 http/ngx_http_upstream_round_robin.c     r->upstream->peer.tries = rrp->peers->number;
rrp               259 http/ngx_http_upstream_round_robin.c     ngx_http_upstream_rr_peer_data_t  *rrp;
rrp               261 http/ngx_http_upstream_round_robin.c     rrp = r->upstream->peer.data;
rrp               263 http/ngx_http_upstream_round_robin.c     if (rrp == NULL) {
rrp               264 http/ngx_http_upstream_round_robin.c         rrp = ngx_palloc(r->pool, sizeof(ngx_http_upstream_rr_peer_data_t));
rrp               265 http/ngx_http_upstream_round_robin.c         if (rrp == NULL) {
rrp               269 http/ngx_http_upstream_round_robin.c         r->upstream->peer.data = rrp;
rrp               325 http/ngx_http_upstream_round_robin.c     rrp->peers = peers;
rrp               326 http/ngx_http_upstream_round_robin.c     rrp->current = 0;
rrp               328 http/ngx_http_upstream_round_robin.c     if (rrp->peers->number <= 8 * sizeof(uintptr_t)) {
rrp               329 http/ngx_http_upstream_round_robin.c         rrp->tried = &rrp->data;
rrp               330 http/ngx_http_upstream_round_robin.c         rrp->data = 0;
rrp               333 http/ngx_http_upstream_round_robin.c         n = (rrp->peers->number + (8 * sizeof(uintptr_t) - 1))
rrp               336 http/ngx_http_upstream_round_robin.c         rrp->tried = ngx_pcalloc(r->pool, n * sizeof(uintptr_t));
rrp               337 http/ngx_http_upstream_round_robin.c         if (rrp->tried == NULL) {
rrp               344 http/ngx_http_upstream_round_robin.c     r->upstream->peer.tries = rrp->peers->number;
rrp               359 http/ngx_http_upstream_round_robin.c     ngx_http_upstream_rr_peer_data_t  *rrp = data;
rrp               376 http/ngx_http_upstream_round_robin.c     if (rrp->peers->last_cached) {
rrp               380 http/ngx_http_upstream_round_robin.c         c = rrp->peers->cached[rrp->peers->last_cached];
rrp               381 http/ngx_http_upstream_round_robin.c         rrp->peers->last_cached--;
rrp               399 http/ngx_http_upstream_round_robin.c     if (rrp->peers->single) {
rrp               400 http/ngx_http_upstream_round_robin.c         peer = &rrp->peers->peer[0];
rrp               406 http/ngx_http_upstream_round_robin.c         if (pc->tries == rrp->peers->number) {
rrp               413 http/ngx_http_upstream_round_robin.c                 rrp->current = ngx_http_upstream_get_peer(rrp->peers);
rrp               417 http/ngx_http_upstream_round_robin.c                                rrp->current,
rrp               418 http/ngx_http_upstream_round_robin.c                                rrp->peers->peer[rrp->current].current_weight);
rrp               420 http/ngx_http_upstream_round_robin.c                 n = rrp->current / (8 * sizeof(uintptr_t));
rrp               421 http/ngx_http_upstream_round_robin.c                 m = (uintptr_t) 1 << rrp->current % (8 * sizeof(uintptr_t));
rrp               423 http/ngx_http_upstream_round_robin.c                 if (!(rrp->tried[n] & m)) {
rrp               424 http/ngx_http_upstream_round_robin.c                     peer = &rrp->peers->peer[rrp->current];
rrp               442 http/ngx_http_upstream_round_robin.c                         rrp->tried[n] |= m;
rrp               467 http/ngx_http_upstream_round_robin.c                 n = rrp->current / (8 * sizeof(uintptr_t));
rrp               468 http/ngx_http_upstream_round_robin.c                 m = (uintptr_t) 1 << rrp->current % (8 * sizeof(uintptr_t));
rrp               470 http/ngx_http_upstream_round_robin.c                 if (!(rrp->tried[n] & m)) {
rrp               472 http/ngx_http_upstream_round_robin.c                     peer = &rrp->peers->peer[rrp->current];
rrp               490 http/ngx_http_upstream_round_robin.c                         rrp->tried[n] |= m;
rrp               496 http/ngx_http_upstream_round_robin.c                 rrp->current++;
rrp               498 http/ngx_http_upstream_round_robin.c                 if (rrp->current >= rrp->peers->number) {
rrp               499 http/ngx_http_upstream_round_robin.c                     rrp->current = 0;
rrp               517 http/ngx_http_upstream_round_robin.c         rrp->tried[n] |= m;
rrp               526 http/ngx_http_upstream_round_robin.c     if (pc->tries == 1 && rrp->peers->next) {
rrp               527 http/ngx_http_upstream_round_robin.c         pc->tries += rrp->peers->next->number;
rrp               529 http/ngx_http_upstream_round_robin.c         n = rrp->peers->next->number / (8 * sizeof(uintptr_t)) + 1;
rrp               531 http/ngx_http_upstream_round_robin.c              rrp->tried[i] = 0;
rrp               539 http/ngx_http_upstream_round_robin.c     peers = rrp->peers;
rrp               547 http/ngx_http_upstream_round_robin.c         rrp->peers = peers->next;
rrp               548 http/ngx_http_upstream_round_robin.c         pc->tries = rrp->peers->number;
rrp               550 http/ngx_http_upstream_round_robin.c         n = rrp->peers->number / (8 * sizeof(uintptr_t)) + 1;
rrp               552 http/ngx_http_upstream_round_robin.c              rrp->tried[i] = 0;
rrp               555 http/ngx_http_upstream_round_robin.c         rc = ngx_http_upstream_get_round_robin_peer(pc, rrp);
rrp               631 http/ngx_http_upstream_round_robin.c     ngx_http_upstream_rr_peer_data_t  *rrp = data;
rrp               645 http/ngx_http_upstream_round_robin.c     if (rrp->peers->single) {
rrp               653 http/ngx_http_upstream_round_robin.c         peer = &rrp->peers->peer[rrp->current];
rrp               666 http/ngx_http_upstream_round_robin.c                        rrp->current, peer->current_weight);
rrp               675 http/ngx_http_upstream_round_robin.c     rrp->current++;
rrp               677 http/ngx_http_upstream_round_robin.c     if (rrp->current >= rrp->peers->number) {
rrp               678 http/ngx_http_upstream_round_robin.c         rrp->current = 0;
rrp               695 http/ngx_http_upstream_round_robin.c     ngx_http_upstream_rr_peer_data_t  *rrp = data;
rrp               701 http/ngx_http_upstream_round_robin.c     peer = &rrp->peers->peer[rrp->current];
rrp               724 http/ngx_http_upstream_round_robin.c     ngx_http_upstream_rr_peer_data_t  *rrp = data;
rrp               738 http/ngx_http_upstream_round_robin.c     peer = &rrp->peers->peer[rrp->current];