13124c3e0SJohn Polstra /*- 2e6209940SPedro F. Giffuni * SPDX-License-Identifier: BSD-2-Clause-FreeBSD 3e6209940SPedro F. Giffuni * 43124c3e0SJohn Polstra * Copyright 1996-1998 John D. Polstra. 53124c3e0SJohn Polstra * All rights reserved. 63124c3e0SJohn Polstra * 73124c3e0SJohn Polstra * Redistribution and use in source and binary forms, with or without 83124c3e0SJohn Polstra * modification, are permitted provided that the following conditions 93124c3e0SJohn Polstra * are met: 103124c3e0SJohn Polstra * 1. Redistributions of source code must retain the above copyright 113124c3e0SJohn Polstra * notice, this list of conditions and the following disclaimer. 123124c3e0SJohn Polstra * 2. Redistributions in binary form must reproduce the above copyright 133124c3e0SJohn Polstra * notice, this list of conditions and the following disclaimer in the 143124c3e0SJohn Polstra * documentation and/or other materials provided with the distribution. 153124c3e0SJohn Polstra * 163124c3e0SJohn Polstra * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 173124c3e0SJohn Polstra * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 183124c3e0SJohn Polstra * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 193124c3e0SJohn Polstra * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, 203124c3e0SJohn Polstra * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 213124c3e0SJohn Polstra * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 223124c3e0SJohn Polstra * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 233124c3e0SJohn Polstra * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 243124c3e0SJohn Polstra * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 253124c3e0SJohn Polstra * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 263124c3e0SJohn Polstra * 277f3dea24SPeter Wemm * $FreeBSD$ 283124c3e0SJohn Polstra */ 293124c3e0SJohn Polstra 303124c3e0SJohn Polstra #include <stddef.h> 313124c3e0SJohn Polstra #include <stdlib.h> 323124c3e0SJohn Polstra #include <string.h> 330e9a2605SKonstantin Belousov #include <unistd.h> 340e9a2605SKonstantin Belousov #include "rtld.h" 350e9a2605SKonstantin Belousov #include "rtld_printf.h" 36*1a3b2ebfSKonstantin Belousov #include "rtld_malloc.h" 373124c3e0SJohn Polstra 383124c3e0SJohn Polstra void * 39758ffbfaSKonstantin Belousov xcalloc(size_t number, size_t size) 403124c3e0SJohn Polstra { 41758ffbfaSKonstantin Belousov void *p; 42758ffbfaSKonstantin Belousov 43*1a3b2ebfSKonstantin Belousov p = __crt_calloc(number, size); 44758ffbfaSKonstantin Belousov if (p == NULL) { 45758ffbfaSKonstantin Belousov rtld_fdputstr(STDERR_FILENO, "Out of memory\n"); 46758ffbfaSKonstantin Belousov _exit(1); 47758ffbfaSKonstantin Belousov } 48758ffbfaSKonstantin Belousov return (p); 493124c3e0SJohn Polstra } 503124c3e0SJohn Polstra 513124c3e0SJohn Polstra void * 523124c3e0SJohn Polstra xmalloc(size_t size) 533124c3e0SJohn Polstra { 54*1a3b2ebfSKonstantin Belousov 55*1a3b2ebfSKonstantin Belousov void *p; 56*1a3b2ebfSKonstantin Belousov 57*1a3b2ebfSKonstantin Belousov p = __crt_malloc(size); 580e9a2605SKonstantin Belousov if (p == NULL) { 590e9a2605SKonstantin Belousov rtld_fdputstr(STDERR_FILENO, "Out of memory\n"); 600e9a2605SKonstantin Belousov _exit(1); 610e9a2605SKonstantin Belousov } 62*1a3b2ebfSKonstantin Belousov return (p); 633124c3e0SJohn Polstra } 643124c3e0SJohn Polstra 653124c3e0SJohn Polstra char * 66f7b34303SKonstantin Belousov xstrdup(const char *str) 673124c3e0SJohn Polstra { 68f7b34303SKonstantin Belousov char *copy; 69f7b34303SKonstantin Belousov size_t len; 70f7b34303SKonstantin Belousov 71f7b34303SKonstantin Belousov len = strlen(str) + 1; 72f7b34303SKonstantin Belousov copy = xmalloc(len); 73f7b34303SKonstantin Belousov memcpy(copy, str, len); 74f7b34303SKonstantin Belousov return (copy); 753124c3e0SJohn Polstra } 76dfe296c4SKonstantin Belousov 77dfe296c4SKonstantin Belousov void * 78dfe296c4SKonstantin Belousov malloc_aligned(size_t size, size_t align) 79dfe296c4SKonstantin Belousov { 80dfe296c4SKonstantin Belousov void *mem, *res; 81dfe296c4SKonstantin Belousov 82eab68f79SDavid Xu if (align < sizeof(void *)) 83eab68f79SDavid Xu align = sizeof(void *); 84209782e0SDavid Xu 85209782e0SDavid Xu mem = xmalloc(size + sizeof(void *) + align - 1); 86209782e0SDavid Xu res = (void *)round((uintptr_t)mem + sizeof(void *), align); 87dfe296c4SKonstantin Belousov *(void **)((uintptr_t)res - sizeof(void *)) = mem; 88dfe296c4SKonstantin Belousov return (res); 89dfe296c4SKonstantin Belousov } 90dfe296c4SKonstantin Belousov 91dfe296c4SKonstantin Belousov void 92dfe296c4SKonstantin Belousov free_aligned(void *ptr) 93dfe296c4SKonstantin Belousov { 94dfe296c4SKonstantin Belousov void *mem; 95dfe296c4SKonstantin Belousov uintptr_t x; 96dfe296c4SKonstantin Belousov 97dfe296c4SKonstantin Belousov if (ptr == NULL) 98dfe296c4SKonstantin Belousov return; 99dfe296c4SKonstantin Belousov x = (uintptr_t)ptr; 100dfe296c4SKonstantin Belousov x -= sizeof(void *); 101dfe296c4SKonstantin Belousov mem = *(void **)x; 102dfe296c4SKonstantin Belousov free(mem); 103dfe296c4SKonstantin Belousov } 104