mirror/nginx
1
0
Fork 0
mirror of https://github.com/nginx/nginx.git synced 2025-06-18 10:16:27 +08:00
Code Issues Actions Packages Projects Releases Wiki Activity

nginx-0.0.3-2004-05-26-19:30:12 import

Browse Source
This commit is contained in:
Igor Sysoev 2004-05-26 15:30:12 +00:00
parent 822834e227
commit a20b6e64c1
2 changed files with 30 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

32
src/core/ngx_radix_tree.c
View File

@ -21,6 +21,7 @@ ngx_radix_tree_t *ngx_radix_tree_create(ngx_pool_t *pool)
tree->root = NULL; tree->root = NULL;
tree->pool = pool; tree->pool = pool;
tree->free = NULL; tree->free = NULL;
tree->start = NULL;
tree->size = 0; tree->size = 0;
return tree; return tree;
@ -62,6 +63,8 @@ ngx_int_t ngx_radix32tree_insert(ngx_radix_tree_t *tree,
} }
new->value = value; new->value = value;
new->right = NULL;
new->left = NULL;
if (key & bit) { if (key & bit) {
node->right = new; node->right = new;
@ -81,16 +84,19 @@ ngx_int_t ngx_radix32tree_insert(ngx_radix_tree_t *tree,
void ngx_radix32tree_delete(ngx_radix_tree_t *tree, uint32_t key, uint32_t mask) void ngx_radix32tree_delete(ngx_radix_tree_t *tree, uint32_t key, uint32_t mask)
{ {
uint32_t bit; uint32_t bit;
ngx_radix_node_t *node; ngx_radix_node_t *node, **prev;
bit = 0x80000000; bit = 0x80000000;
node = tree->root; node = tree->root;
prev = NULL;
while (node && (bit & mask)) { while (node && (bit & mask)) {
if (key & bit) { if (key & bit) {
prev = &node->right;;
node = node->right; node = node->right;
} else { } else {
prev = &node->left;;
node = node->left; node = node->left;
} }
@ -98,8 +104,18 @@ void ngx_radix32tree_delete(ngx_radix_tree_t *tree, uint32_t key, uint32_t mask)
} }
if (node) { if (node) {
/* the leaf nodes are moved to the free list only */
if (node->right == NULL && node->left == NULL) {
*prev = NULL;
node->right = tree->free;
tree->free = node;
} else {
node->value = (uintptr_t) 0; node->value = (uintptr_t) 0;
} }
}
} }
@ -110,7 +126,7 @@ uintptr_t ngx_radix32tree_find(ngx_radix_tree_t *tree, uint32_t key)
ngx_radix_node_t *node; ngx_radix_node_t *node;
bit = 0x80000000; bit = 0x80000000;
value = NULL; value = (uintptr_t) 0;
node = tree->root; node = tree->root;
while (node) { while (node) {
@ -136,16 +152,22 @@ static void *ngx_radix_alloc(ngx_radix_tree_t *tree, size_t size)
{ {
char *p; char *p;
if (tree->free) {
p = (char *) tree->free;
tree->free = tree->free->right;
return p;
}
if (tree->size < size) { if (tree->size < size) {
if (!(tree->free = ngx_palloc(tree->pool, NGX_RADIX_TREE_POOL_SIZE))) { if (!(tree->start = ngx_palloc(tree->pool, NGX_RADIX_TREE_POOL_SIZE))) {
return NULL; return NULL;
} }
tree->size = NGX_RADIX_TREE_POOL_SIZE; tree->size = NGX_RADIX_TREE_POOL_SIZE;
} }
p = tree->free; p = tree->start;
tree->free += size; tree->start += size;
tree->size -= size; tree->size -= size;
return p; return p;

3
src/core/ngx_radix_tree.h
View File

@ -18,7 +18,8 @@ struct ngx_radix_node_s {
typedef struct { typedef struct {
ngx_radix_node_t *root; ngx_radix_node_t *root;
ngx_pool_t *pool; ngx_pool_t *pool;
char *free; ngx_radix_node_t *free;
char *start;
size_t size; size_t size;
} ngx_radix_tree_t; } ngx_radix_tree_t;