node               35 core/ngx_open_file_cache.c     ngx_rbtree_node_t *node, ngx_rbtree_node_t *sentinel);
node               97 core/ngx_open_file_cache.c         ngx_rbtree_delete(&cache->rbtree, &file->node);
node              319 core/ngx_open_file_cache.c         ngx_rbtree_delete(&cache->rbtree, &file->node);
node              358 core/ngx_open_file_cache.c     file->node.key = hash;
node              360 core/ngx_open_file_cache.c     ngx_rbtree_insert(&cache->rbtree, &file->node);
node              430 core/ngx_open_file_cache.c         ngx_rbtree_delete(&cache->rbtree, &file->node);
node              754 core/ngx_open_file_cache.c         ngx_rbtree_delete(&cache->rbtree, &file->node);
node              775 core/ngx_open_file_cache.c     ngx_rbtree_node_t *node, ngx_rbtree_node_t *sentinel)
node              782 core/ngx_open_file_cache.c         if (node->key < temp->key) {
node              786 core/ngx_open_file_cache.c         } else if (node->key > temp->key) {
node              792 core/ngx_open_file_cache.c             file = (ngx_cached_open_file_t *) node;
node              806 core/ngx_open_file_cache.c     *p = node;
node              807 core/ngx_open_file_cache.c     node->parent = temp;
node              808 core/ngx_open_file_cache.c     node->left = sentinel;
node              809 core/ngx_open_file_cache.c     node->right = sentinel;
node              810 core/ngx_open_file_cache.c     ngx_rbt_red(node);
node              819 core/ngx_open_file_cache.c     ngx_rbtree_node_t       *node, *sentinel;
node              822 core/ngx_open_file_cache.c     node = cache->rbtree.root;
node              825 core/ngx_open_file_cache.c     while (node != sentinel) {
node              827 core/ngx_open_file_cache.c         if (hash < node->key) {
node              828 core/ngx_open_file_cache.c             node = node->left;
node              832 core/ngx_open_file_cache.c         if (hash > node->key) {
node              833 core/ngx_open_file_cache.c             node = node->right;
node              840 core/ngx_open_file_cache.c             file = (ngx_cached_open_file_t *) node;
node              848 core/ngx_open_file_cache.c             node = (rc < 0) ? node->left : node->right;
node              850 core/ngx_open_file_cache.c         } while (node != sentinel && hash == node->key);
node              870 core/ngx_open_file_cache.c     ngx_rbtree_delete(&fev->cache->rbtree, &file->node);
node               50 core/ngx_open_file_cache.h     ngx_rbtree_node_t        node;
node              112 core/ngx_radix_tree.c     ngx_radix_node_t  *node, *next;
node              116 core/ngx_radix_tree.c     node = tree->root;
node              121 core/ngx_radix_tree.c             next = node->right;
node              124 core/ngx_radix_tree.c             next = node->left;
node              132 core/ngx_radix_tree.c         node = next;
node              136 core/ngx_radix_tree.c         if (node->value != NGX_RADIX_NO_VALUE) {
node              140 core/ngx_radix_tree.c         node->value = value;
node              152 core/ngx_radix_tree.c         next->parent = node;
node              156 core/ngx_radix_tree.c             node->right = next;
node              159 core/ngx_radix_tree.c             node->left = next;
node              163 core/ngx_radix_tree.c         node = next;
node              166 core/ngx_radix_tree.c     node->value = value;
node              176 core/ngx_radix_tree.c     ngx_radix_node_t  *node;
node              179 core/ngx_radix_tree.c     node = tree->root;
node              181 core/ngx_radix_tree.c     while (node && (bit & mask)) {
node              183 core/ngx_radix_tree.c             node = node->right;
node              186 core/ngx_radix_tree.c             node = node->left;
node              192 core/ngx_radix_tree.c     if (node == NULL) {
node              196 core/ngx_radix_tree.c     if (node->right || node->left) {
node              197 core/ngx_radix_tree.c         if (node->value != NGX_RADIX_NO_VALUE) {
node              198 core/ngx_radix_tree.c             node->value = NGX_RADIX_NO_VALUE;
node              206 core/ngx_radix_tree.c         if (node->parent->right == node) {
node              207 core/ngx_radix_tree.c             node->parent->right = NULL;
node              210 core/ngx_radix_tree.c             node->parent->left = NULL;
node              213 core/ngx_radix_tree.c         node->right = tree->free;
node              214 core/ngx_radix_tree.c         tree->free = node;
node              216 core/ngx_radix_tree.c         node = node->parent;
node              218 core/ngx_radix_tree.c         if (node->right || node->left) {
node              222 core/ngx_radix_tree.c         if (node->value != NGX_RADIX_NO_VALUE) {
node              226 core/ngx_radix_tree.c         if (node->parent == NULL) {
node              240 core/ngx_radix_tree.c     ngx_radix_node_t  *node;
node              244 core/ngx_radix_tree.c     node = tree->root;
node              246 core/ngx_radix_tree.c     while (node) {
node              247 core/ngx_radix_tree.c         if (node->value != NGX_RADIX_NO_VALUE) {
node              248 core/ngx_radix_tree.c             value = node->value;
node              252 core/ngx_radix_tree.c             node = node->right;
node              255 core/ngx_radix_tree.c             node = node->left;
node               18 core/ngx_rbtree.c     ngx_rbtree_node_t *sentinel, ngx_rbtree_node_t *node);
node               20 core/ngx_rbtree.c     ngx_rbtree_node_t *sentinel, ngx_rbtree_node_t *node);
node               25 core/ngx_rbtree.c     ngx_rbtree_node_t *node)
node               35 core/ngx_rbtree.c         node->parent = NULL;
node               36 core/ngx_rbtree.c         node->left = sentinel;
node               37 core/ngx_rbtree.c         node->right = sentinel;
node               38 core/ngx_rbtree.c         ngx_rbt_black(node);
node               39 core/ngx_rbtree.c         *root = node;
node               44 core/ngx_rbtree.c     tree->insert(*root, node, sentinel);
node               48 core/ngx_rbtree.c     while (node != *root && ngx_rbt_is_red(node->parent)) {
node               50 core/ngx_rbtree.c         if (node->parent == node->parent->parent->left) {
node               51 core/ngx_rbtree.c             temp = node->parent->parent->right;
node               54 core/ngx_rbtree.c                 ngx_rbt_black(node->parent);
node               56 core/ngx_rbtree.c                 ngx_rbt_red(node->parent->parent);
node               57 core/ngx_rbtree.c                 node = node->parent->parent;
node               60 core/ngx_rbtree.c                 if (node == node->parent->right) {
node               61 core/ngx_rbtree.c                     node = node->parent;
node               62 core/ngx_rbtree.c                     ngx_rbtree_left_rotate(root, sentinel, node);
node               65 core/ngx_rbtree.c                 ngx_rbt_black(node->parent);
node               66 core/ngx_rbtree.c                 ngx_rbt_red(node->parent->parent);
node               67 core/ngx_rbtree.c                 ngx_rbtree_right_rotate(root, sentinel, node->parent->parent);
node               71 core/ngx_rbtree.c             temp = node->parent->parent->left;
node               74 core/ngx_rbtree.c                 ngx_rbt_black(node->parent);
node               76 core/ngx_rbtree.c                 ngx_rbt_red(node->parent->parent);
node               77 core/ngx_rbtree.c                 node = node->parent->parent;
node               80 core/ngx_rbtree.c                 if (node == node->parent->left) {
node               81 core/ngx_rbtree.c                     node = node->parent;
node               82 core/ngx_rbtree.c                     ngx_rbtree_right_rotate(root, sentinel, node);
node               85 core/ngx_rbtree.c                 ngx_rbt_black(node->parent);
node               86 core/ngx_rbtree.c                 ngx_rbt_red(node->parent->parent);
node               87 core/ngx_rbtree.c                 ngx_rbtree_left_rotate(root, sentinel, node->parent->parent);
node               97 core/ngx_rbtree.c ngx_rbtree_insert_value(ngx_rbtree_node_t *temp, ngx_rbtree_node_t *node,
node              104 core/ngx_rbtree.c         p = (node->key < temp->key) ? &temp->left : &temp->right;
node              113 core/ngx_rbtree.c     *p = node;
node              114 core/ngx_rbtree.c     node->parent = temp;
node              115 core/ngx_rbtree.c     node->left = sentinel;
node              116 core/ngx_rbtree.c     node->right = sentinel;
node              117 core/ngx_rbtree.c     ngx_rbt_red(node);
node              122 core/ngx_rbtree.c ngx_rbtree_insert_timer_value(ngx_rbtree_node_t *temp, ngx_rbtree_node_t *node,
node              138 core/ngx_rbtree.c         p = ((ngx_rbtree_key_int_t) node->key - (ngx_rbtree_key_int_t) temp->key
node              149 core/ngx_rbtree.c     *p = node;
node              150 core/ngx_rbtree.c     node->parent = temp;
node              151 core/ngx_rbtree.c     node->left = sentinel;
node              152 core/ngx_rbtree.c     node->right = sentinel;
node              153 core/ngx_rbtree.c     ngx_rbt_red(node);
node              159 core/ngx_rbtree.c     ngx_rbtree_node_t *node)
node              169 core/ngx_rbtree.c     if (node->left == sentinel) {
node              170 core/ngx_rbtree.c         temp = node->right;
node              171 core/ngx_rbtree.c         subst = node;
node              173 core/ngx_rbtree.c     } else if (node->right == sentinel) {
node              174 core/ngx_rbtree.c         temp = node->left;
node              175 core/ngx_rbtree.c         subst = node;
node              178 core/ngx_rbtree.c         subst = ngx_rbtree_min(node->right, sentinel);
node              192 core/ngx_rbtree.c         node->left = NULL;
node              193 core/ngx_rbtree.c         node->right = NULL;
node              194 core/ngx_rbtree.c         node->parent = NULL;
node              195 core/ngx_rbtree.c         node->key = 0;
node              209 core/ngx_rbtree.c     if (subst == node) {
node              215 core/ngx_rbtree.c         if (subst->parent == node) {
node              222 core/ngx_rbtree.c         subst->left = node->left;
node              223 core/ngx_rbtree.c         subst->right = node->right;
node              224 core/ngx_rbtree.c         subst->parent = node->parent;
node              225 core/ngx_rbtree.c         ngx_rbt_copy_color(subst, node);
node              227 core/ngx_rbtree.c         if (node == *root) {
node              231 core/ngx_rbtree.c             if (node == node->parent->left) {
node              232 core/ngx_rbtree.c                 node->parent->left = subst;
node              234 core/ngx_rbtree.c                 node->parent->right = subst;
node              248 core/ngx_rbtree.c     node->left = NULL;
node              249 core/ngx_rbtree.c     node->right = NULL;
node              250 core/ngx_rbtree.c     node->parent = NULL;
node              251 core/ngx_rbtree.c     node->key = 0;
node              327 core/ngx_rbtree.c     ngx_rbtree_node_t *node)
node              331 core/ngx_rbtree.c     temp = node->right;
node              332 core/ngx_rbtree.c     node->right = temp->left;
node              335 core/ngx_rbtree.c         temp->left->parent = node;
node              338 core/ngx_rbtree.c     temp->parent = node->parent;
node              340 core/ngx_rbtree.c     if (node == *root) {
node              343 core/ngx_rbtree.c     } else if (node == node->parent->left) {
node              344 core/ngx_rbtree.c         node->parent->left = temp;
node              347 core/ngx_rbtree.c         node->parent->right = temp;
node              350 core/ngx_rbtree.c     temp->left = node;
node              351 core/ngx_rbtree.c     node->parent = temp;
node              357 core/ngx_rbtree.c     ngx_rbtree_node_t *node)
node              361 core/ngx_rbtree.c     temp = node->left;
node              362 core/ngx_rbtree.c     node->left = temp->right;
node              365 core/ngx_rbtree.c         temp->right->parent = node;
node              368 core/ngx_rbtree.c     temp->parent = node->parent;
node              370 core/ngx_rbtree.c     if (node == *root) {
node              373 core/ngx_rbtree.c     } else if (node == node->parent->right) {
node              374 core/ngx_rbtree.c         node->parent->right = temp;
node              377 core/ngx_rbtree.c         node->parent->left = temp;
node              380 core/ngx_rbtree.c     temp->right = node;
node              381 core/ngx_rbtree.c     node->parent = temp;
node               34 core/ngx_rbtree.h     ngx_rbtree_node_t *node, ngx_rbtree_node_t *sentinel);
node               51 core/ngx_rbtree.h     ngx_rbtree_node_t *node);
node               53 core/ngx_rbtree.h     ngx_rbtree_node_t *node);
node               54 core/ngx_rbtree.h void ngx_rbtree_insert_value(ngx_rbtree_node_t *root, ngx_rbtree_node_t *node,
node               57 core/ngx_rbtree.h     ngx_rbtree_node_t *node, ngx_rbtree_node_t *sentinel);
node               60 core/ngx_rbtree.h #define ngx_rbt_red(node)               ((node)->color = 1)
node               61 core/ngx_rbtree.h #define ngx_rbt_black(node)             ((node)->color = 0)
node               62 core/ngx_rbtree.h #define ngx_rbt_is_red(node)            ((node)->color)
node               63 core/ngx_rbtree.h #define ngx_rbt_is_black(node)          (!ngx_rbt_is_red(node))
node               69 core/ngx_rbtree.h #define ngx_rbtree_sentinel_init(node)  ngx_rbt_black(node)
node               73 core/ngx_rbtree.h ngx_rbtree_min(ngx_rbtree_node_t *node, ngx_rbtree_node_t *sentinel)
node               75 core/ngx_rbtree.h     while (node->left != sentinel) {
node               76 core/ngx_rbtree.h         node = node->left;
node               79 core/ngx_rbtree.h     return node;
node               80 core/ngx_resolver.c     ngx_rbtree_node_t *node, ngx_rbtree_node_t *sentinel);
node              217 core/ngx_resolver.c         ngx_rbtree_delete(tree, &rn->node);
node              505 core/ngx_resolver.c         rn->node.key = hash;
node              509 core/ngx_resolver.c         ngx_rbtree_insert(&r->name_rbtree, &rn->node);
node              519 core/ngx_resolver.c         ngx_rbtree_delete(&r->name_rbtree, &rn->node);
node              568 core/ngx_resolver.c     ngx_rbtree_delete(&r->name_rbtree, &rn->node);
node              650 core/ngx_resolver.c         rn->node.key = ctx->addr;
node              653 core/ngx_resolver.c         ngx_rbtree_insert(&r->addr_rbtree, &rn->node);
node              700 core/ngx_resolver.c         ngx_rbtree_delete(&r->addr_rbtree, &rn->node);
node              816 core/ngx_resolver.c         ngx_rbtree_delete(tree, &rn->node);
node              935 core/ngx_resolver.c         ngx_rbtree_delete(tree, &rn->node);
node             1169 core/ngx_resolver.c         ngx_rbtree_delete(&r->name_rbtree, &rn->node);
node             1485 core/ngx_resolver.c         ngx_rbtree_delete(&r->addr_rbtree, &rn->node);
node             1607 core/ngx_resolver.c     ngx_rbtree_node_t    *node, *sentinel;
node             1610 core/ngx_resolver.c     node = r->name_rbtree.root;
node             1613 core/ngx_resolver.c     while (node != sentinel) {
node             1615 core/ngx_resolver.c         if (hash < node->key) {
node             1616 core/ngx_resolver.c             node = node->left;
node             1620 core/ngx_resolver.c         if (hash > node->key) {
node             1621 core/ngx_resolver.c             node = node->right;
node             1628 core/ngx_resolver.c             rn = (ngx_resolver_node_t *) node;
node             1636 core/ngx_resolver.c             node = (rc < 0) ? node->left : node->right;
node             1638 core/ngx_resolver.c         } while (node != sentinel && hash == node->key);
node             1652 core/ngx_resolver.c     ngx_rbtree_node_t  *node, *sentinel;
node             1654 core/ngx_resolver.c     node = r->addr_rbtree.root;
node             1657 core/ngx_resolver.c     while (node != sentinel) {
node             1659 core/ngx_resolver.c         if (addr < node->key) {
node             1660 core/ngx_resolver.c             node = node->left;
node             1664 core/ngx_resolver.c         if (addr > node->key) {
node             1665 core/ngx_resolver.c             node = node->right;
node             1671 core/ngx_resolver.c         return (ngx_resolver_node_t *) node;
node             1682 core/ngx_resolver.c     ngx_rbtree_node_t *node, ngx_rbtree_node_t *sentinel)
node             1689 core/ngx_resolver.c         if (node->key < temp->key) {
node             1693 core/ngx_resolver.c         } else if (node->key > temp->key) {
node             1699 core/ngx_resolver.c             rn = (ngx_resolver_node_t *) node;
node             1713 core/ngx_resolver.c     *p = node;
node             1714 core/ngx_resolver.c     node->parent = temp;
node             1715 core/ngx_resolver.c     node->left = sentinel;
node             1716 core/ngx_resolver.c     node->right = sentinel;
node             1717 core/ngx_resolver.c     ngx_rbt_red(node);
node               50 core/ngx_resolver.h     ngx_rbtree_node_t         node;
node             1680 core/ngx_string.c     ngx_rbtree_node_t *node, ngx_rbtree_node_t *sentinel)
node             1687 core/ngx_string.c         n = (ngx_str_node_t *) node;
node             1690 core/ngx_string.c         if (node->key != temp->key) {
node             1692 core/ngx_string.c             p = (node->key < temp->key) ? &temp->left : &temp->right;
node             1710 core/ngx_string.c     *p = node;
node             1711 core/ngx_string.c     node->parent = temp;
node             1712 core/ngx_string.c     node->left = sentinel;
node             1713 core/ngx_string.c     node->right = sentinel;
node             1714 core/ngx_string.c     ngx_rbt_red(node);
node             1723 core/ngx_string.c     ngx_rbtree_node_t  *node, *sentinel;
node             1725 core/ngx_string.c     node = rbtree->root;
node             1728 core/ngx_string.c     while (node != sentinel) {
node             1730 core/ngx_string.c         n = (ngx_str_node_t *) node;
node             1732 core/ngx_string.c         if (hash != node->key) {
node             1733 core/ngx_string.c             node = (hash < node->key) ? node->left : node->right;
node             1738 core/ngx_string.c             node = (val->len < n->str.len) ? node->left : node->right;
node             1745 core/ngx_string.c             node = node->left;
node             1750 core/ngx_string.c             node = node->right;
node              209 core/ngx_string.h     ngx_rbtree_node_t         node;
node              215 core/ngx_string.h     ngx_rbtree_node_t *node, ngx_rbtree_node_t *sentinel);
node               39 event/ngx_event_openssl.c     ngx_rbtree_node_t *node, ngx_rbtree_node_t *sentinel);
node             1643 event/ngx_event_openssl.c     sess_id->node.key = hash;
node             1644 event/ngx_event_openssl.c     sess_id->node.data = (u_char) sess->session_id_length;
node             1653 event/ngx_event_openssl.c     ngx_rbtree_insert(&cache->session_rbtree, &sess_id->node);
node             1691 event/ngx_event_openssl.c     ngx_rbtree_node_t        *node, *sentinel;
node             1716 event/ngx_event_openssl.c     node = cache->session_rbtree.root;
node             1719 event/ngx_event_openssl.c     while (node != sentinel) {
node             1721 event/ngx_event_openssl.c         if (hash < node->key) {
node             1722 event/ngx_event_openssl.c             node = node->left;
node             1726 event/ngx_event_openssl.c         if (hash > node->key) {
node             1727 event/ngx_event_openssl.c             node = node->right;
node             1734 event/ngx_event_openssl.c             sess_id = (ngx_ssl_sess_id_t *) node;
node             1737 event/ngx_event_openssl.c                               (size_t) len, (size_t) node->data);
node             1753 event/ngx_event_openssl.c                 ngx_rbtree_delete(&cache->session_rbtree, node);
node             1766 event/ngx_event_openssl.c             node = (rc < 0) ? node->left : node->right;
node             1768 event/ngx_event_openssl.c         } while (node != sentinel && hash == node->key);
node             1799 event/ngx_event_openssl.c     ngx_rbtree_node_t        *node, *sentinel;
node             1823 event/ngx_event_openssl.c     node = cache->session_rbtree.root;
node             1826 event/ngx_event_openssl.c     while (node != sentinel) {
node             1828 event/ngx_event_openssl.c         if (hash < node->key) {
node             1829 event/ngx_event_openssl.c             node = node->left;
node             1833 event/ngx_event_openssl.c         if (hash > node->key) {
node             1834 event/ngx_event_openssl.c             node = node->right;
node             1841 event/ngx_event_openssl.c             sess_id = (ngx_ssl_sess_id_t *) node;
node             1843 event/ngx_event_openssl.c             rc = ngx_memn2cmp(id, sess_id->id, len, (size_t) node->data);
node             1849 event/ngx_event_openssl.c                 ngx_rbtree_delete(&cache->session_rbtree, node);
node             1860 event/ngx_event_openssl.c             node = (rc < 0) ? node->left : node->right;
node             1862 event/ngx_event_openssl.c         } while (node != sentinel && hash == node->key);
node             1900 event/ngx_event_openssl.c                        "expire session: %08Xi", sess_id->node.key);
node             1902 event/ngx_event_openssl.c         ngx_rbtree_delete(&cache->session_rbtree, &sess_id->node);
node             1915 event/ngx_event_openssl.c     ngx_rbtree_node_t *node, ngx_rbtree_node_t *sentinel)
node             1922 event/ngx_event_openssl.c         if (node->key < temp->key) {
node             1926 event/ngx_event_openssl.c         } else if (node->key > temp->key) {
node             1932 event/ngx_event_openssl.c             sess_id = (ngx_ssl_sess_id_t *) node;
node             1936 event/ngx_event_openssl.c                               (size_t) node->data, (size_t) temp->data)
node             1947 event/ngx_event_openssl.c     *p = node;
node             1948 event/ngx_event_openssl.c     node->parent = temp;
node             1949 event/ngx_event_openssl.c     node->left = sentinel;
node             1950 event/ngx_event_openssl.c     node->right = sentinel;
node             1951 event/ngx_event_openssl.c     ngx_rbt_red(node);
node               63 event/ngx_event_openssl.h     ngx_rbtree_node_t           node;
node               54 event/ngx_event_timer.c     ngx_rbtree_node_t  *node, *root, *sentinel;
node               65 event/ngx_event_timer.c     node = ngx_rbtree_min(root, sentinel);
node               69 event/ngx_event_timer.c     timer = (ngx_msec_int_t) node->key - (ngx_msec_int_t) ngx_current_msec;
node               79 event/ngx_event_timer.c     ngx_rbtree_node_t  *node, *root, *sentinel;
node               93 event/ngx_event_timer.c         node = ngx_rbtree_min(root, sentinel);
node               97 event/ngx_event_timer.c         if ((ngx_msec_int_t) node->key - (ngx_msec_int_t) ngx_current_msec <= 0)
node               99 event/ngx_event_timer.c             ev = (ngx_event_t *) ((char *) node - offsetof(ngx_event_t, timer));
node               94 http/modules/ngx_http_geo_module.c     ngx_rbtree_node_t *node, ngx_rbtree_node_t *sentinel);
node             1011 http/modules/ngx_http_geo_module.c     gvvn->sn.node.key = hash;
node             1017 http/modules/ngx_http_geo_module.c     ngx_rbtree_insert(&ctx->rbtree, &gvvn->sn.node);
node             1391 http/modules/ngx_http_geo_module.c ngx_http_geo_copy_values(u_char *base, u_char *p, ngx_rbtree_node_t *node,
node             1397 http/modules/ngx_http_geo_module.c     if (node == sentinel) {
node             1401 http/modules/ngx_http_geo_module.c     gvvn = (ngx_http_geo_variable_value_node_t *) node;
node             1413 http/modules/ngx_http_geo_module.c     p = ngx_http_geo_copy_values(base, p, node->left, sentinel);
node             1415 http/modules/ngx_http_geo_module.c     return ngx_http_geo_copy_values(base, p, node->right, sentinel);
node              143 http/modules/ngx_http_limit_req_module.c     ngx_rbtree_node_t          *node;
node              200 http/modules/ngx_http_limit_req_module.c         node = ngx_slab_alloc_locked(ctx->shpool, n);
node              201 http/modules/ngx_http_limit_req_module.c         if (node == NULL) {
node              205 http/modules/ngx_http_limit_req_module.c             node = ngx_slab_alloc_locked(ctx->shpool, n);
node              206 http/modules/ngx_http_limit_req_module.c             if (node == NULL) {
node              212 http/modules/ngx_http_limit_req_module.c         lr = (ngx_http_limit_req_node_t *) &node->color;
node              214 http/modules/ngx_http_limit_req_module.c         node->key = hash;
node              223 http/modules/ngx_http_limit_req_module.c         ngx_rbtree_insert(&ctx->sh->rbtree, node);
node              304 http/modules/ngx_http_limit_req_module.c     ngx_rbtree_node_t *node, ngx_rbtree_node_t *sentinel)
node              311 http/modules/ngx_http_limit_req_module.c         if (node->key < temp->key) {
node              315 http/modules/ngx_http_limit_req_module.c         } else if (node->key > temp->key) {
node              321 http/modules/ngx_http_limit_req_module.c             lrn = (ngx_http_limit_req_node_t *) &node->color;
node              335 http/modules/ngx_http_limit_req_module.c     *p = node;
node              336 http/modules/ngx_http_limit_req_module.c     node->parent = temp;
node              337 http/modules/ngx_http_limit_req_module.c     node->left = sentinel;
node              338 http/modules/ngx_http_limit_req_module.c     node->right = sentinel;
node              339 http/modules/ngx_http_limit_req_module.c     ngx_rbt_red(node);
node              351 http/modules/ngx_http_limit_req_module.c     ngx_rbtree_node_t          *node, *sentinel;
node              357 http/modules/ngx_http_limit_req_module.c     node = ctx->sh->rbtree.root;
node              360 http/modules/ngx_http_limit_req_module.c     while (node != sentinel) {
node              362 http/modules/ngx_http_limit_req_module.c         if (hash < node->key) {
node              363 http/modules/ngx_http_limit_req_module.c             node = node->left;
node              367 http/modules/ngx_http_limit_req_module.c         if (hash > node->key) {
node              368 http/modules/ngx_http_limit_req_module.c             node = node->right;
node              375 http/modules/ngx_http_limit_req_module.c             lr = (ngx_http_limit_req_node_t *) &node->color;
node              410 http/modules/ngx_http_limit_req_module.c             node = (rc < 0) ? node->left : node->right;
node              412 http/modules/ngx_http_limit_req_module.c         } while (node != sentinel && hash == node->key);
node              431 http/modules/ngx_http_limit_req_module.c     ngx_rbtree_node_t          *node;
node              472 http/modules/ngx_http_limit_req_module.c         node = (ngx_rbtree_node_t *)
node              475 http/modules/ngx_http_limit_req_module.c         ngx_rbtree_delete(&ctx->sh->rbtree, node);
node              477 http/modules/ngx_http_limit_req_module.c         ngx_slab_free_locked(ctx->shpool, node);
node               22 http/modules/ngx_http_limit_zone_module.c     ngx_rbtree_node_t  *node;
node              126 http/modules/ngx_http_limit_zone_module.c     ngx_rbtree_node_t              *node, *sentinel;
node              179 http/modules/ngx_http_limit_zone_module.c     node = ctx->rbtree->root;
node              182 http/modules/ngx_http_limit_zone_module.c     while (node != sentinel) {
node              184 http/modules/ngx_http_limit_zone_module.c         if (hash < node->key) {
node              185 http/modules/ngx_http_limit_zone_module.c             node = node->left;
node              189 http/modules/ngx_http_limit_zone_module.c         if (hash > node->key) {
node              190 http/modules/ngx_http_limit_zone_module.c             node = node->right;
node              197 http/modules/ngx_http_limit_zone_module.c             lz = (ngx_http_limit_zone_node_t *) &node->color;
node              216 http/modules/ngx_http_limit_zone_module.c             node = (rc < 0) ? node->left : node->right;
node              218 http/modules/ngx_http_limit_zone_module.c         } while (node != sentinel && hash == node->key);
node              227 http/modules/ngx_http_limit_zone_module.c     node = ngx_slab_alloc_locked(shpool, n);
node              228 http/modules/ngx_http_limit_zone_module.c     if (node == NULL) {
node              233 http/modules/ngx_http_limit_zone_module.c     lz = (ngx_http_limit_zone_node_t *) &node->color;
node              235 http/modules/ngx_http_limit_zone_module.c     node->key = hash;
node              240 http/modules/ngx_http_limit_zone_module.c     ngx_rbtree_insert(ctx->rbtree, node);
node              245 http/modules/ngx_http_limit_zone_module.c                    "limit zone: %08XD %d", node->key, lz->conn);
node              253 http/modules/ngx_http_limit_zone_module.c     lzcln->node = node;
node              261 http/modules/ngx_http_limit_zone_module.c     ngx_rbtree_node_t *node, ngx_rbtree_node_t *sentinel)
node              268 http/modules/ngx_http_limit_zone_module.c         if (node->key < temp->key) {
node              272 http/modules/ngx_http_limit_zone_module.c         } else if (node->key > temp->key) {
node              278 http/modules/ngx_http_limit_zone_module.c             lzn = (ngx_http_limit_zone_node_t *) &node->color;
node              292 http/modules/ngx_http_limit_zone_module.c     *p = node;
node              293 http/modules/ngx_http_limit_zone_module.c     node->parent = temp;
node              294 http/modules/ngx_http_limit_zone_module.c     node->left = sentinel;
node              295 http/modules/ngx_http_limit_zone_module.c     node->right = sentinel;
node              296 http/modules/ngx_http_limit_zone_module.c     ngx_rbt_red(node);
node              306 http/modules/ngx_http_limit_zone_module.c     ngx_rbtree_node_t           *node;
node              312 http/modules/ngx_http_limit_zone_module.c     node = lzcln->node;
node              313 http/modules/ngx_http_limit_zone_module.c     lz = (ngx_http_limit_zone_node_t *) &node->color;
node              318 http/modules/ngx_http_limit_zone_module.c                    "limit zone cleanup: %08XD %d", node->key, lz->conn);
node              323 http/modules/ngx_http_limit_zone_module.c         ngx_rbtree_delete(ctx->rbtree, node);
node              324 http/modules/ngx_http_limit_zone_module.c         ngx_slab_free_locked(shpool, node);
node             1072 http/ngx_http.c     ngx_http_location_tree_node_t  *node;
node             1079 http/ngx_http.c     node = ngx_palloc(cf->pool,
node             1081 http/ngx_http.c     if (node == NULL) {
node             1085 http/ngx_http.c     node->left = NULL;
node             1086 http/ngx_http.c     node->right = NULL;
node             1087 http/ngx_http.c     node->tree = NULL;
node             1088 http/ngx_http.c     node->exact = lq->exact;
node             1089 http/ngx_http.c     node->inclusive = lq->inclusive;
node             1091 http/ngx_http.c     node->auto_redirect = (u_char) ((lq->exact && lq->exact->auto_redirect)
node             1094 http/ngx_http.c     node->len = (u_char) len;
node             1095 http/ngx_http.c     ngx_memcpy(node->name, &lq->name->data[prefix], len);
node             1107 http/ngx_http.c     node->left = ngx_http_create_locations_tree(cf, locations, prefix);
node             1108 http/ngx_http.c     if (node->left == NULL) {
node             1118 http/ngx_http.c     node->right = ngx_http_create_locations_tree(cf, &tail, prefix);
node             1119 http/ngx_http.c     if (node->right == NULL) {
node             1126 http/ngx_http.c         return node;
node             1129 http/ngx_http.c     node->tree = ngx_http_create_locations_tree(cf, &lq->list, prefix + len);
node             1130 http/ngx_http.c     if (node->tree == NULL) {
node             1134 http/ngx_http.c     return node;
node               34 http/ngx_http_cache.h     ngx_rbtree_node_t                node;
node               79 http/ngx_http_cache.h     ngx_http_file_cache_node_t      *node;
node               25 http/ngx_http_core_module.c     ngx_http_location_tree_node_t *node);
node             1555 http/ngx_http_core_module.c     ngx_http_location_tree_node_t *node)
node             1568 http/ngx_http_core_module.c         if (node == NULL) {
node             1573 http/ngx_http_core_module.c                        "test location: \"%*s\"", node->len, node->name);
node             1575 http/ngx_http_core_module.c         n = (len <= (size_t) node->len) ? len : node->len;
node             1577 http/ngx_http_core_module.c         rc = ngx_filename_cmp(uri, node->name, n);
node             1580 http/ngx_http_core_module.c             node = (rc < 0) ? node->left : node->right;
node             1585 http/ngx_http_core_module.c         if (len > (size_t) node->len) {
node             1587 http/ngx_http_core_module.c             if (node->inclusive) {
node             1589 http/ngx_http_core_module.c                 r->loc_conf = node->inclusive->loc_conf;
node             1592 http/ngx_http_core_module.c                 node = node->tree;
node             1601 http/ngx_http_core_module.c             node = node->right;
node             1606 http/ngx_http_core_module.c         if (len == (size_t) node->len) {
node             1608 http/ngx_http_core_module.c             if (node->exact) {
node             1609 http/ngx_http_core_module.c                 r->loc_conf = node->exact->loc_conf;
node             1613 http/ngx_http_core_module.c                 r->loc_conf = node->inclusive->loc_conf;
node             1620 http/ngx_http_core_module.c         if (len + 1 == (size_t) node->len && node->auto_redirect) {
node             1622 http/ngx_http_core_module.c             r->loc_conf = (node->exact) ? node->exact->loc_conf:
node             1623 http/ngx_http_core_module.c                                           node->inclusive->loc_conf;
node             1627 http/ngx_http_core_module.c         node = node->left;
node               27 http/ngx_http_file_cache.c     ngx_rbtree_node_t *node, ngx_rbtree_node_t *sentinel);
node              408 http/ngx_http_file_cache.c         if (!c->node->exists) {
node              409 http/ngx_http_file_cache.c             c->node->uses = 1;
node              410 http/ngx_http_file_cache.c             c->node->body_start = c->body_start;
node              411 http/ngx_http_file_cache.c             c->node->exists = 1;
node              412 http/ngx_http_file_cache.c             c->node->uniq = c->uniq;
node              426 http/ngx_http_file_cache.c         if (c->node->updating) {
node              430 http/ngx_http_file_cache.c             c->node->updating = 1;
node              575 http/ngx_http_file_cache.c     ngx_memcpy((u_char *) &fcn->node.key, c->key, sizeof(ngx_rbtree_key_t));
node              580 http/ngx_http_file_cache.c     ngx_rbtree_insert(&cache->sh->rbtree, &fcn->node);
node              607 http/ngx_http_file_cache.c     c->node = fcn;
node              653 http/ngx_http_file_cache.c     ngx_rbtree_node_t           *node, *sentinel;
node              658 http/ngx_http_file_cache.c     node = cache->sh->rbtree.root;
node              661 http/ngx_http_file_cache.c     while (node != sentinel) {
node              663 http/ngx_http_file_cache.c         if (node_key < node->key) {
node              664 http/ngx_http_file_cache.c             node = node->left;
node              668 http/ngx_http_file_cache.c         if (node_key > node->key) {
node              669 http/ngx_http_file_cache.c             node = node->right;
node              676 http/ngx_http_file_cache.c             fcn = (ngx_http_file_cache_node_t *) node;
node              685 http/ngx_http_file_cache.c             node = (rc < 0) ? node->left : node->right;
node              687 http/ngx_http_file_cache.c         } while (node != sentinel && node_key == node->key);
node              700 http/ngx_http_file_cache.c     ngx_rbtree_node_t *node, ngx_rbtree_node_t *sentinel)
node              707 http/ngx_http_file_cache.c         if (node->key < temp->key) {
node              711 http/ngx_http_file_cache.c         } else if (node->key > temp->key) {
node              717 http/ngx_http_file_cache.c             cn = (ngx_http_file_cache_node_t *) node;
node              733 http/ngx_http_file_cache.c     *p = node;
node              734 http/ngx_http_file_cache.c     node->parent = temp;
node              735 http/ngx_http_file_cache.c     node->left = sentinel;
node              736 http/ngx_http_file_cache.c     node->right = sentinel;
node              737 http/ngx_http_file_cache.c     ngx_rbt_red(node);
node              836 http/ngx_http_file_cache.c     c->node->count--;
node              837 http/ngx_http_file_cache.c     c->node->uniq = uniq;
node              838 http/ngx_http_file_cache.c     c->node->body_start = c->body_start;
node              840 http/ngx_http_file_cache.c     size = size - (c->node->length + cache->bsize - 1) / cache->bsize;
node              842 http/ngx_http_file_cache.c     c->node->length = length;
node              847 http/ngx_http_file_cache.c         c->node->exists = 1;
node              850 http/ngx_http_file_cache.c     c->node->updating = 0;
node              924 http/ngx_http_file_cache.c     fcn = c->node;
node              941 http/ngx_http_file_cache.c         ngx_rbtree_delete(&cache->sh->rbtree, &fcn->node);
node              943 http/ngx_http_file_cache.c         c->node = NULL;
node             1111 http/ngx_http_file_cache.c         p = ngx_hex_dump(key, (u_char *) &fcn->node.key,
node             1124 http/ngx_http_file_cache.c         ngx_rbtree_delete(&cache->sh->rbtree, &fcn->node);
node             1155 http/ngx_http_file_cache.c         p = ngx_hex_dump(p, (u_char *) &fcn->node.key,
node             1183 http/ngx_http_file_cache.c         ngx_rbtree_delete(&cache->sh->rbtree, &fcn->node);
node             1433 http/ngx_http_file_cache.c         ngx_memcpy((u_char *) &fcn->node.key, c->key, sizeof(ngx_rbtree_key_t));
node             1438 http/ngx_http_file_cache.c         ngx_rbtree_insert(&cache->sh->rbtree, &fcn->node);