Nginx Source Learning Notes (11)--Basic container--ngx_list

ngx_list. The {C|H} structure is very simple, and if you have seen the previous array introduction, this section can be used around:

[CPP] View plaincopyprint?

2. typedef struct ngx_list_part_s ngx_list_part_t;
4. struct ngx_list_part_s {
6. void *elts; //Data area pointer
8. ngx_uint_t Nelts; //Data actual number
10. ngx_list_part_t *next; //Next data pointer
12. };
14. typedef struct {
16. ngx_list_part_t *last;
18. ngx_list_part_t part; //Data section
20. size_t size; //Single Data size
22. ngx_uint_t Nalloc; //Preset number of data
24. ngx_pool_t *pool; //memory pool to which it belongs
26. } ngx_list_t;

Operation of List:

[CPP] View plaincopyprint?

2. //Create List
4. ngx_list_t *
6. Ngx_list_create (ngx_pool_t *pool, ngx_uint_t N, size_t size)
8. {
10. ngx_list_t *list;
12. List = Ngx_palloc (pool, sizeof(ngx_list_t)); //Allocate list memory space
14. if (list = = NULL) {
16. return NULL;
18. }
20. List->part.elts = Ngx_palloc (pool, n * size); //Allocate partial memory space for list data
22. if (List->part.elts = = NULL) {
24. return NULL;
26. }
28. list->part.nelts = 0; ///Actual data number is 0
30. List->part.next = NULL; //No next node
32. List->last = &list->part; //The last one is the data itself
34. list->size = size; //Initialize the size of each data
36. List->nalloc = n; //Preset data volume
38. List->pool = pool; //memory pool to which it belongs
40. return list; //Return address
42. //Here if you find it similar to creating an array, then you're getting started.
44. }
46. //Add data you can see and add an array basically the same, but also return the address to add the data, and then take action
48. void *
50. Ngx_list_push (ngx_list_t *l)
52. {
54. void *elt;
56. ngx_list_part_t *last;
58. Last = l->last;
60. if (Last->nelts = = L->nalloc) {
62. / * The last part was full, allocate a new list part * /
64. Last = Ngx_palloc (l->pool, sizeof(ngx_list_part_t));
66. if (last = = NULL) {
68. return NULL;
70. }
72. Last->elts = Ngx_palloc (L->pool, L->nalloc * l->size);
74. if (Last->elts = = NULL) {
76. return NULL;
78. }
80. last->nelts = 0;
82. Last->next = NULL;
84. L->last->next = Last;
86. L->last = Last;
88. }
90. ELT = (char *) Last->elts + l->size * last->nelts;
92. last->nelts++;
94. return ELT;
96. }

[CPP] View plaincopyprint?

1. //How to Traverse list
2. Part = &list.part;
3. data = part->elts;
5. for (i = 0;; i++) {
7. if (i >= part->nelts) {
8. if (Part->next = = NULL) {
9. Break ;
10. }
12. Part = part->next;
13. data = part->elts;
14. i = 0;
15. }
17. ... data[i] ...
19. }

The above describes the Nginx source learning notes (11)-The basic container--ngx_list, including the content, I hope the PHP tutorial interested in a friend helpful.

