tree 818 core/ngx_file.c ngx_walk_tree(ngx_tree_ctx_t *ctx, ngx_str_t *tree) tree 831 core/ngx_file.c "walk tree \"%V\"", tree); tree 833 core/ngx_file.c if (ngx_open_dir(tree, &dir) == NGX_ERROR) { tree 835 core/ngx_file.c ngx_open_dir_n " \"%s\" failed", tree->data); tree 869 core/ngx_file.c ngx_read_dir_n " \"%s\" failed", tree->data); tree 890 core/ngx_file.c file.len = tree->len + 1 + len; tree 898 core/ngx_file.c buf.len = tree->len + 1 + len + NGX_DIR_MASK_LEN; tree 906 core/ngx_file.c p = ngx_cpymem(buf.data, tree->data, tree->len); tree 987 core/ngx_file.c ngx_close_dir_n " \"%s\" failed", tree->data); tree 135 core/ngx_file.h ngx_int_t ngx_walk_tree(ngx_tree_ctx_t *ctx, ngx_str_t *tree); tree 11 core/ngx_radix_tree.c static void *ngx_radix_alloc(ngx_radix_tree_t *tree); tree 18 core/ngx_radix_tree.c ngx_radix_tree_t *tree; tree 20 core/ngx_radix_tree.c tree = ngx_palloc(pool, sizeof(ngx_radix_tree_t)); tree 21 core/ngx_radix_tree.c if (tree == NULL) { tree 25 core/ngx_radix_tree.c tree->pool = pool; tree 26 core/ngx_radix_tree.c tree->free = NULL; tree 27 core/ngx_radix_tree.c tree->start = NULL; tree 28 core/ngx_radix_tree.c tree->size = 0; tree 30 core/ngx_radix_tree.c tree->root = ngx_radix_alloc(tree); tree 31 core/ngx_radix_tree.c if (tree->root == NULL) { tree 35 core/ngx_radix_tree.c tree->root->right = NULL; tree 36 core/ngx_radix_tree.c tree->root->left = NULL; tree 37 core/ngx_radix_tree.c tree->root->parent = NULL; tree 38 core/ngx_radix_tree.c tree->root->value = NGX_RADIX_NO_VALUE; tree 41 core/ngx_radix_tree.c return tree; tree 90 core/ngx_radix_tree.c if (ngx_radix32tree_insert(tree, key, mask, NGX_RADIX_NO_VALUE) tree 103 core/ngx_radix_tree.c return tree; tree 108 core/ngx_radix_tree.c ngx_radix32tree_insert(ngx_radix_tree_t *tree, uint32_t key, uint32_t mask, tree 116 core/ngx_radix_tree.c node = tree->root; tree 117 core/ngx_radix_tree.c next = tree->root; tree 145 core/ngx_radix_tree.c next = ngx_radix_alloc(tree); tree 173 core/ngx_radix_tree.c ngx_radix32tree_delete(ngx_radix_tree_t *tree, uint32_t key, uint32_t mask) tree 179 core/ngx_radix_tree.c node = tree->root; tree 213 core/ngx_radix_tree.c node->right = tree->free; tree 214 core/ngx_radix_tree.c tree->free = node; tree 236 core/ngx_radix_tree.c ngx_radix32tree_find(ngx_radix_tree_t *tree, uint32_t key) tree 244 core/ngx_radix_tree.c node = tree->root; tree 266 core/ngx_radix_tree.c ngx_radix_alloc(ngx_radix_tree_t *tree) tree 270 core/ngx_radix_tree.c if (tree->free) { tree 271 core/ngx_radix_tree.c p = (char *) tree->free; tree 272 core/ngx_radix_tree.c tree->free = tree->free->right; tree 276 core/ngx_radix_tree.c if (tree->size < sizeof(ngx_radix_node_t)) { tree 277 core/ngx_radix_tree.c tree->start = ngx_pmemalign(tree->pool, ngx_pagesize, ngx_pagesize); tree 278 core/ngx_radix_tree.c if (tree->start == NULL) { tree 282 core/ngx_radix_tree.c tree->size = ngx_pagesize; tree 285 core/ngx_radix_tree.c p = tree->start; tree 286 core/ngx_radix_tree.c tree->start += sizeof(ngx_radix_node_t); tree 287 core/ngx_radix_tree.c tree->size -= sizeof(ngx_radix_node_t); tree 38 core/ngx_radix_tree.h ngx_int_t ngx_radix32tree_insert(ngx_radix_tree_t *tree, tree 40 core/ngx_radix_tree.h ngx_int_t ngx_radix32tree_delete(ngx_radix_tree_t *tree, tree 42 core/ngx_radix_tree.h uintptr_t ngx_radix32tree_find(ngx_radix_tree_t *tree, uint32_t key); tree 24 core/ngx_rbtree.c ngx_rbtree_insert(ngx_thread_volatile ngx_rbtree_t *tree, tree 31 core/ngx_rbtree.c root = (ngx_rbtree_node_t **) &tree->root; tree 32 core/ngx_rbtree.c sentinel = tree->sentinel; tree 44 core/ngx_rbtree.c tree->insert(*root, node, sentinel); tree 158 core/ngx_rbtree.c ngx_rbtree_delete(ngx_thread_volatile ngx_rbtree_t *tree, tree 166 core/ngx_rbtree.c root = (ngx_rbtree_node_t **) &tree->root; tree 167 core/ngx_rbtree.c sentinel = tree->sentinel; tree 43 core/ngx_rbtree.h #define ngx_rbtree_init(tree, s, i) \ tree 45 core/ngx_rbtree.h (tree)->root = s; \ tree 46 core/ngx_rbtree.h (tree)->sentinel = s; \ tree 47 core/ngx_rbtree.h (tree)->insert = i tree 50 core/ngx_rbtree.h void ngx_rbtree_insert(ngx_thread_volatile ngx_rbtree_t *tree, tree 52 core/ngx_rbtree.h void ngx_rbtree_delete(ngx_thread_volatile ngx_rbtree_t *tree, tree 54 core/ngx_resolver.c static void ngx_resolver_cleanup_tree(ngx_resolver_t *r, ngx_rbtree_t *tree); tree 57 core/ngx_resolver.c static void ngx_resolver_expire(ngx_resolver_t *r, ngx_rbtree_t *tree, tree 66 core/ngx_resolver.c static time_t ngx_resolver_resend(ngx_resolver_t *r, ngx_rbtree_t *tree, tree 196 core/ngx_resolver.c ngx_resolver_cleanup_tree(ngx_resolver_t *r, ngx_rbtree_t *tree) tree 201 core/ngx_resolver.c while (tree->root != tree->sentinel) { tree 203 core/ngx_resolver.c rn = (ngx_resolver_node_t *) ngx_rbtree_min(tree->root, tree->sentinel); tree 217 core/ngx_resolver.c ngx_rbtree_delete(tree, &rn->node); tree 787 core/ngx_resolver.c ngx_resolver_expire(ngx_resolver_t *r, ngx_rbtree_t *tree, ngx_queue_t *queue) tree 816 core/ngx_resolver.c ngx_rbtree_delete(tree, &rn->node); tree 896 core/ngx_resolver.c ngx_resolver_resend(ngx_resolver_t *r, ngx_rbtree_t *tree, ngx_queue_t *queue) tree 935 core/ngx_resolver.c ngx_rbtree_delete(tree, &rn->node); tree 385 http/modules/ngx_http_dav_module.c ngx_tree_ctx_t tree; tree 389 http/modules/ngx_http_dav_module.c tree.init_handler = NULL; tree 390 http/modules/ngx_http_dav_module.c tree.file_handler = ngx_http_dav_delete_file; tree 391 http/modules/ngx_http_dav_module.c tree.pre_tree_handler = ngx_http_dav_noop; tree 392 http/modules/ngx_http_dav_module.c tree.post_tree_handler = ngx_http_dav_delete_dir; tree 393 http/modules/ngx_http_dav_module.c tree.spec_handler = ngx_http_dav_delete_file; tree 394 http/modules/ngx_http_dav_module.c tree.data = NULL; tree 395 http/modules/ngx_http_dav_module.c tree.alloc = 0; tree 396 http/modules/ngx_http_dav_module.c tree.log = r->connection->log; tree 400 http/modules/ngx_http_dav_module.c if (ngx_walk_tree(&tree, path) != NGX_OK) { tree 518 http/modules/ngx_http_dav_module.c ngx_tree_ctx_t tree; tree 771 http/modules/ngx_http_dav_module.c tree.init_handler = NULL; tree 772 http/modules/ngx_http_dav_module.c tree.file_handler = ngx_http_dav_copy_tree_file; tree 773 http/modules/ngx_http_dav_module.c tree.pre_tree_handler = ngx_http_dav_copy_dir; tree 774 http/modules/ngx_http_dav_module.c tree.post_tree_handler = ngx_http_dav_copy_dir_time; tree 775 http/modules/ngx_http_dav_module.c tree.spec_handler = ngx_http_dav_noop; tree 776 http/modules/ngx_http_dav_module.c tree.data = © tree 777 http/modules/ngx_http_dav_module.c tree.alloc = 0; tree 778 http/modules/ngx_http_dav_module.c tree.log = r->connection->log; tree 780 http/modules/ngx_http_dav_module.c if (ngx_walk_tree(&tree, &path) == NGX_OK) { tree 36 http/modules/ngx_http_geo_module.c ngx_radix_tree_t *tree; tree 58 http/modules/ngx_http_geo_module.c ngx_radix_tree_t *tree; tree 166 http/modules/ngx_http_geo_module.c ngx_radix32tree_find(ctx->u.tree, ngx_http_geo_addr(r, ctx)); tree 411 http/modules/ngx_http_geo_module.c if (ctx.tree == NULL) { tree 412 http/modules/ngx_http_geo_module.c ctx.tree = ngx_radix_tree_create(cf->pool, -1); tree 413 http/modules/ngx_http_geo_module.c if (ctx.tree == NULL) { tree 418 http/modules/ngx_http_geo_module.c geo->u.tree = ctx.tree; tree 426 http/modules/ngx_http_geo_module.c if (ngx_radix32tree_find(ctx.tree, 0) != NGX_RADIX_NO_VALUE) { tree 430 http/modules/ngx_http_geo_module.c if (ngx_radix32tree_insert(ctx.tree, 0, 0, tree 458 http/modules/ngx_http_geo_module.c if (ctx->tree) { tree 896 http/modules/ngx_http_geo_module.c if (ctx->tree == NULL) { tree 897 http/modules/ngx_http_geo_module.c ctx->tree = ngx_radix_tree_create(ctx->pool, -1); tree 898 http/modules/ngx_http_geo_module.c if (ctx->tree == NULL) { tree 923 http/modules/ngx_http_geo_module.c if (ngx_radix32tree_delete(ctx->tree, cidr.u.in.addr, tree 942 http/modules/ngx_http_geo_module.c rc = ngx_radix32tree_insert(ctx->tree, cidr.u.in.addr, cidr.u.in.mask, tree 955 http/modules/ngx_http_geo_module.c ngx_radix32tree_find(ctx->tree, cidr.u.in.addr & cidr.u.in.mask); tree 961 http/modules/ngx_http_geo_module.c rc = ngx_radix32tree_delete(ctx->tree, cidr.u.in.addr, cidr.u.in.mask); tree 1087 http/ngx_http.c node->tree = NULL; tree 1129 http/ngx_http.c node->tree = ngx_http_create_locations_tree(cf, &lq->list, prefix + len); tree 1130 http/ngx_http.c if (node->tree == NULL) { tree 1592 http/ngx_http_core_module.c node = node->tree; tree 431 http/ngx_http_core_module.h ngx_http_location_tree_node_t *tree; tree 1234 http/ngx_http_file_cache.c ngx_tree_ctx_t tree; tree 1247 http/ngx_http_file_cache.c tree.init_handler = NULL; tree 1248 http/ngx_http_file_cache.c tree.file_handler = ngx_http_file_cache_manage_file; tree 1249 http/ngx_http_file_cache.c tree.pre_tree_handler = ngx_http_file_cache_noop; tree 1250 http/ngx_http_file_cache.c tree.post_tree_handler = ngx_http_file_cache_noop; tree 1251 http/ngx_http_file_cache.c tree.spec_handler = ngx_http_file_cache_delete_file; tree 1252 http/ngx_http_file_cache.c tree.data = cache; tree 1253 http/ngx_http_file_cache.c tree.alloc = 0; tree 1254 http/ngx_http_file_cache.c tree.log = ngx_cycle->log; tree 1259 http/ngx_http_file_cache.c if (ngx_walk_tree(&tree, &cache->path->name) == NGX_ABORT) {