ngx_palloc.c 4.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258
  1. /*
  2. * Copyright (C) Igor Sysoev
  3. * Copyright (C) Nginx, Inc.
  4. */
  5. #include "../inc/cs.h"
  6. #include "../inc/cs_os.h"
  7. #include "../inc/cs_str.h"
  8. #include "../inc/ngx_palloc.h"
  9. #include "../inc/ngx_alloc.h"
  10. static cs_inline void *ngx_palloc_small(
  11. ngx_pool_t *pool, size_t size, cs_uint_t align);
  12. static void *ngx_palloc_block(ngx_pool_t *pool, size_t size);
  13. static void *ngx_palloc_large(ngx_pool_t *pool, size_t size);
  14. CS_API ngx_pool_t *ngx_create_pool(size_t size) {
  15. ngx_pool_t *p;
  16. p = ngx_memalign(NGX_POOL_ALIGNMENT, size);
  17. if (p == NULL) {
  18. return (NULL);
  19. }
  20. p->d.last = (u_char *) p + sizeof(ngx_pool_t);
  21. p->d.end = (u_char *) p + size;
  22. p->d.next = NULL;
  23. p->d.failed = 0;
  24. size = size - sizeof(ngx_pool_t);
  25. p->max = (size < NGX_MAX_ALLOC_FROM_POOL) ? size : NGX_MAX_ALLOC_FROM_POOL;
  26. p->current = p;
  27. p->large = NULL;
  28. return (p);
  29. }
  30. CS_API void ngx_destroy_pool(ngx_pool_t *pool) {
  31. ngx_pool_t *p, *n;
  32. ngx_pool_large_t *l;
  33. #ifdef CS_DEBUG
  34. int count = 0;
  35. #endif
  36. for (l = pool->large; l; l = l->next) {
  37. if (l->alloc) {
  38. ngx_free(l->alloc);
  39. }
  40. #ifdef CS_DEBUG
  41. count++;
  42. #endif
  43. }
  44. #ifdef CS_DEBUG
  45. printf("large count: %d\n", count);
  46. count = 0;
  47. #endif
  48. for (p = pool, n = pool->d.next; /* void */; p = n, n = n->d.next) {
  49. #ifdef CS_DEBUG
  50. count++;
  51. #endif
  52. ngx_free(p);
  53. if (n == NULL) {
  54. break;
  55. }
  56. }
  57. #ifdef CS_DEBUG
  58. printf("pool count: %d\n", count);
  59. count = 0;
  60. #endif
  61. }
  62. CS_API void ngx_reset_pool(ngx_pool_t *pool) {
  63. ngx_pool_t *p;
  64. ngx_pool_large_t *l;
  65. for (l = pool->large; l; l = l->next) {
  66. if (l->alloc) {
  67. ngx_free(l->alloc);
  68. }
  69. }
  70. for (p = pool; p; p = p->d.next) {
  71. p->d.last = (u_char *) p + sizeof(ngx_pool_t);
  72. p->d.failed = 0;
  73. }
  74. pool->current = pool;
  75. pool->large = NULL;
  76. }
  77. CS_API void *ngx_palloc(ngx_pool_t *pool, size_t size) {
  78. #if !(NGX_DEBUG_PALLOC)
  79. if (size <= pool->max) {
  80. return ngx_palloc_small(pool, size, 1);
  81. }
  82. #endif
  83. return ngx_palloc_large(pool, size);
  84. }
  85. CS_API void *ngx_pnalloc(ngx_pool_t *pool, size_t size) {
  86. #if !(NGX_DEBUG_PALLOC)
  87. if (size <= pool->max) {
  88. return ngx_palloc_small(pool, size, 0);
  89. }
  90. #endif
  91. return ngx_palloc_large(pool, size);
  92. }
  93. static cs_inline void *ngx_palloc_small(
  94. ngx_pool_t *pool, size_t size, cs_uint_t align) {
  95. u_char *m;
  96. ngx_pool_t *p;
  97. p = pool->current;
  98. do {
  99. m = p->d.last;
  100. if (align) {
  101. m = cs_align_ptr(m, CS_ALIGNMENT);
  102. }
  103. if ((size_t) (p->d.end - m) >= size) {
  104. p->d.last = m + size;
  105. return m;
  106. }
  107. p = p->d.next;
  108. } while (p);
  109. return (ngx_palloc_block(pool, size));
  110. }
  111. static void *ngx_palloc_block(ngx_pool_t *pool, size_t size) {
  112. u_char *m;
  113. size_t psize;
  114. ngx_pool_t *p, *new;
  115. psize = (size_t) (pool->d.end - (u_char *) pool);
  116. m = ngx_memalign(NGX_POOL_ALIGNMENT, psize);
  117. if (m == NULL) {
  118. return (NULL);
  119. }
  120. new = (ngx_pool_t *) m;
  121. new->d.end = m + psize;
  122. new->d.next = NULL;
  123. new->d.failed = 0;
  124. m += sizeof(ngx_pool_data_t);
  125. m = cs_align_ptr(m, CS_ALIGNMENT);
  126. new->d.last = m + size;
  127. for (p = pool->current; p->d.next; p = p->d.next) {
  128. if (p->d.failed++ > 4) {
  129. pool->current = p->d.next;
  130. }
  131. }
  132. p->d.next = new;
  133. return (m);
  134. }
  135. static void *ngx_palloc_large(ngx_pool_t *pool, size_t size) {
  136. void *p;
  137. cs_uint_t n;
  138. ngx_pool_large_t *large;
  139. p = ngx_alloc(size);
  140. if (p == NULL) {
  141. return (NULL);
  142. }
  143. n = 0;
  144. for (large = pool->large; large; large = large->next) {
  145. if (large->alloc == NULL) {
  146. large->alloc = p;
  147. return p;
  148. }
  149. if (n++ > 3) {
  150. break;
  151. }
  152. }
  153. large = ngx_palloc_small(pool, sizeof(ngx_pool_large_t), 1);
  154. if (large == NULL) {
  155. ngx_free(p);
  156. return (NULL);
  157. }
  158. large->alloc = p;
  159. large->next = pool->large;
  160. pool->large = large;
  161. return (p);
  162. }
  163. CS_API void *ngx_pmemalign(ngx_pool_t *pool, size_t size, size_t alignment) {
  164. void *p;
  165. ngx_pool_large_t *large;
  166. p = ngx_memalign(alignment, size);
  167. if (p == NULL) {
  168. return (NULL);
  169. }
  170. large = ngx_palloc_small(pool, sizeof(ngx_pool_large_t), 1);
  171. if (large == NULL) {
  172. ngx_free(p);
  173. return (NULL);
  174. }
  175. large->alloc = p;
  176. large->next = pool->large;
  177. pool->large = large;
  178. return (p);
  179. }
  180. CS_API cs_int_t ngx_pfree(ngx_pool_t *pool, void *p) {
  181. ngx_pool_large_t *l;
  182. for (l = pool->large; l; l = l->next) {
  183. if (p == l->alloc) {
  184. ngx_free(l->alloc);
  185. l->alloc = NULL;
  186. return (CS_OK);
  187. }
  188. }
  189. return (CS_DECLINED);
  190. }
  191. CS_API void *ngx_pcalloc(ngx_pool_t *pool, size_t size) {
  192. void *p;
  193. p = ngx_palloc(pool, size);
  194. if (p) {
  195. cs_bzero(p, size);
  196. }
  197. return (p);
  198. }