ucx: ucx/stack.c@998bf7c643b4 (annotated)

ucx/stack.c@998bf7c643b4 (annotated)

ucx/stack.c

Mon, 14 Jul 2014 16:54:10 +0200

author: Mike Becker <universe@uap-core.de>
date: Mon, 14 Jul 2014 16:54:10 +0200
changeset 182: 998bf7c643b4
parent 177: ucx/mempool.c@11ad03783baf
child 185: a48428642b4e
permissions: -rw-r--r--

merged sstrcat function

 /*
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER.
  *
  * Copyright 2014 Olaf Wintermann. All rights reserved.
  *
  * Redistribution and use in source and binary forms, with or without
  * modification, are permitted provided that the following conditions are met:
  *
  *   1. Redistributions of source code must retain the above copyright
  *      notice, this list of conditions and the following disclaimer.
  *
  *   2. Redistributions in binary form must reproduce the above copyright
  *      notice, this list of conditions and the following disclaimer in the
  *      documentation and/or other materials provided with the distribution.
  *
  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
  * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
  * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
  * POSSIBILITY OF SUCH DAMAGE.
  */
 #include "stack.h"
 #include <string.h>
 UcxStack ucx_stack_new(char* space, size_t size) {
     UcxStack stack;
     stack.size = size;
     stack.space = stack.top = space;
     UcxAllocator alloc;
     alloc.pool = &stack;
     alloc.malloc = (ucx_allocator_malloc) ucx_stack_malloc;
     alloc.calloc = (ucx_allocator_calloc) ucx_stack_calloc;
     alloc.realloc = (ucx_allocator_realloc) ucx_stack_realloc;
     alloc.free = (ucx_allocator_free) ucx_stack_free;
     stack.allocator = alloc;
     return stack;
 }
 void *ucx_stack_malloc(UcxStack *stack, size_t n) {
     n += n % sizeof(void*);
     if (stack->top + n + sizeof(size_t) > stack->space + stack->size) {
         return NULL;
     } else {
         void *ptr = stack->top;
         *((size_t*) (stack->top + n)) = n;
         stack->top += n + sizeof(size_t);
         return ptr;
     }
 }
 void *ucx_stack_calloc(UcxStack *stack, size_t nelem, size_t elsize) {
     void *mem = ucx_stack_malloc(stack, nelem*elsize);
     memset(mem, 0, nelem*elsize);
     return mem;
 }
 void *ucx_stack_realloc(UcxStack *stack, void *ptr, size_t n) {
     if (ptr == stack->top - sizeof(size_t) - *((size_t*) stack->top - 1)) {
         stack->top = (char*)ptr + n;
         *((size_t*)stack->top) = n;
         stack->top += sizeof(size_t);
         return ptr;
     } else {
         size_t* sptr = (size_t*) (((char*) ptr)-sizeof(size_t));
         if (*sptr < n) {
             void *nptr = ucx_stack_malloc(stack, n);
             if (nptr) {
                 memcpy(nptr, ptr, *sptr);
                 ucx_stack_free(stack, ptr);
                 return nptr;
             } else {
                 return NULL;
             }
         } else {
             *sptr = n;
             return ptr;
         }
     }
 }
 void ucx_stack_free(UcxStack *stack, void *ptr) {
     if (ptr == stack->top+sizeof(size_t)) {
     } else {
     }
 }
 void ucx_stack_pop(UcxStack *stack, void *dest) {
 }
 void ucx_stack_popn(UcxStack *stack, void *dest, size_t n) {
 }

Mercurial > hg > ucx / annotate

ucx/stack.c@998bf7c643b4 (annotated)

ucx/stack.c