for ( ;; ) {
-#if (NGX_HAVE_NONALIGNED)
-
/*
* allow non-aligned memory blocks for small allocations (1, 2,
* or 3 bytes) and for odd length strings (struct's have aligned
if (size < sizeof(int) || (size & 1)) {
m = p->last;
- } else
-#endif
-
- {
+ } else {
m = ngx_align_ptr(p->last, NGX_ALIGNMENT);
}
}
+void *
+ngx_palloc_aligned(ngx_pool_t *pool, size_t size)
+{
+ if (size & 1) {
+ size++;
+ }
+
+ return ngx_palloc(pool, size);
+}
+
+
ngx_int_t
ngx_pfree(ngx_pool_t *pool, void *p)
{
void ngx_destroy_pool(ngx_pool_t *pool);
void *ngx_palloc(ngx_pool_t *pool, size_t size);
+void *ngx_palloc_aligned(ngx_pool_t *pool, size_t size);
void *ngx_pcalloc(ngx_pool_t *pool, size_t size);
ngx_int_t ngx_pfree(ngx_pool_t *pool, void *p);
#endif
if (pool) {
- return ngx_palloc(pool, size);
+ return ngx_palloc_aligned(pool, size);
}
return NULL;
lq = (ngx_http_location_queue_t *) q;
len = lq->name->len - prefix;
- node = ngx_pcalloc(cf->pool,
- offsetof(ngx_http_location_tree_node_t, name) + len);
+ node = ngx_palloc_aligned(cf->pool,
+ offsetof(ngx_http_location_tree_node_t, name) + len);
if (node == NULL) {
return NULL;
}
+ node->left = NULL;
+ node->right = NULL;
+ node->tree = NULL;
node->exact = lq->exact;
node->inclusive = lq->inclusive;