nginx链表代码分析[ngx_list.c]

代码路径

\nginx-1.4.4\src\core\ngx_list.c

数据结构

typedef struct ngx_list_part_s  ngx_list_part_t;

struct ngx_list_part_s {
    void             *elts;	//实际内存块地址
    ngx_uint_t        nelts;    //已经分配的个数
    ngx_list_part_t  *next;	//下一个list_part
};


typedef struct {
    ngx_list_part_t  *last;	//指向当前可开辟的list_part块
    ngx_list_part_t   part;
    size_t            size;	//小块大小
    ngx_uint_t        nalloc;   //小块个数
    ngx_pool_t       *pool;
} ngx_list_t;

主要接口

ngx_list_t *ngx_list_create(ngx_pool_t *pool, ngx_uint_t n, size_t size);
void *ngx_list_push(ngx_list_t *list);

函数分析

list创建

ngx_list_t *
ngx_list_create(ngx_pool_t *pool, ngx_uint_t n, size_t size)
{
    ngx_list_t  *list;

    list = ngx_palloc(pool, sizeof(ngx_list_t));
    if (list == NULL) {
        return NULL;
    }

    list->part.elts = ngx_palloc(pool, n * size);
    if (list->part.elts == NULL) {
        return NULL;
    }

    list->part.nelts = 0;
    list->part.next = NULL;
    list->last = &list->part;
    list->size = size;
    list->nalloc = n;
    list->pool = pool;

    return list;
}

list创建后，只有一个n * size大小的空白内存块。

list插入

void *
ngx_list_push(ngx_list_t *l)
{
    void             *elt;
    ngx_list_part_t  *last;

    last = l->last;

    if (last->nelts == l->nalloc) {

        /* the last part is full, allocate a new list part */

        last = ngx_palloc(l->pool, sizeof(ngx_list_part_t));
        if (last == NULL) {
            return NULL;
        }

        last->elts = ngx_palloc(l->pool, l->nalloc * l->size);
        if (last->elts == NULL) {
            return NULL;
        }

        last->nelts = 0;
        last->next = NULL;

        l->last->next = last;
        l->last = last;
    }

    elt = (char *) last->elts + l->size * last->nelts;
    last->nelts++;

    return elt;
}

1）当当前块的数量还能满足条件时，从当前块中分出一个size大小出来

2）当当前块无法满足条件时，从需要重新开辟一块ngx_list_part_t管理的n * size大小的内存块

多次调用之后的内存布局如下所示：