diff options
| author | Yann Ylavic <ylavic@apache.org> | 2019-04-03 13:54:46 +0000 |
|---|---|---|
| committer | Yann Ylavic <ylavic@apache.org> | 2019-04-03 13:54:46 +0000 |
| commit | 66e41846004d40fd6d12811fd0acf08920a3d1cd (patch) | |
| tree | 35ec053ade05ffaf25bc760749289510953cec3d /memory | |
| parent | d9bb27b19ef53e2873e2dbb00750bb55396e6e6a (diff) | |
| download | apr-66e41846004d40fd6d12811fd0acf08920a3d1cd.tar.gz | |
Address some warnings raised by MSVC-32/64.
git-svn-id: https://svn.apache.org/repos/asf/apr/apr/trunk@1856873 13f79535-47bb-0310-9956-ffa450edef68
Diffstat (limited to 'memory')
| -rw-r--r-- | memory/unix/apr_pools.c | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/memory/unix/apr_pools.c b/memory/unix/apr_pools.c index 5fa7da1b5..0ca715efa 100644 --- a/memory/unix/apr_pools.c +++ b/memory/unix/apr_pools.c @@ -407,7 +407,7 @@ apr_memnode_t *allocator_alloc(apr_allocator_t *allocator, apr_size_t in_size) return NULL; } #endif - node->index = index; + node->index = (apr_uint32_t)index; node->endp = (char *)node + size; have_node: @@ -877,7 +877,7 @@ APR_DECLARE(void *) apr_palloc(apr_pool_t *pool, apr_size_t in_size) free_index = (APR_ALIGN(active->endp - active->first_avail + 1, BOUNDARY_SIZE) - BOUNDARY_SIZE) >> BOUNDARY_INDEX; - active->free_index = free_index; + active->free_index = (apr_uint32_t)free_index; node = active->next; if (free_index >= node->free_index) goto have_mem; @@ -1289,7 +1289,7 @@ static int psprintf_flush(apr_vformatter_buff_t *vbuff) free_index = (APR_ALIGN(active->endp - active->first_avail + 1, BOUNDARY_SIZE) - BOUNDARY_SIZE) >> BOUNDARY_INDEX; - active->free_index = free_index; + active->free_index = (apr_uint32_t)free_index; node = active->next; if (free_index < node->free_index) { do { @@ -1445,7 +1445,7 @@ APR_DECLARE(char *) apr_pvsprintf(apr_pool_t *pool, const char *fmt, va_list ap) free_index = (APR_ALIGN(active->endp - active->first_avail + 1, BOUNDARY_SIZE) - BOUNDARY_SIZE) >> BOUNDARY_INDEX; - active->free_index = free_index; + active->free_index = (apr_uint32_t)free_index; node = active->next; if (free_index >= node->free_index) { |