base/libs/qdecoder/qObstack.c

Go to the documentation of this file.

/*
 * Copyright 2008 The qDecoder Project. 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 QDECODER PROJECT ``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 QDECODER PROJECT 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.
 */

#ifndef DISABLE_DATASTRUCTURE

#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <stdarg.h>
#include <string.h>
#include "qDecoder.h"

Q_OBSTACK *qObstackInit(void) {
    Q_OBSTACK *obstack;

    obstack = (Q_OBSTACK *)malloc(sizeof(Q_OBSTACK));
    if(obstack == NULL) return NULL;

    memset((void *)obstack, 0, sizeof(Q_OBSTACK));
    obstack->stack = qEntryInit();
    if(obstack->stack == NULL) {
        free(obstack);
        return NULL;
    }

    return obstack;
}

bool qObstackGrow(Q_OBSTACK *obstack, const void *object, size_t size) {
    if(obstack == NULL || object == NULL || size <= 0) return false;
    return qEntryPut(obstack->stack, "", object, size, false);
}

bool qObstackGrowStr(Q_OBSTACK *obstack, const char *str) {
    return qObstackGrow(obstack, (void *)str, strlen(str));
}

bool qObstackGrowStrf(Q_OBSTACK *obstack, const char *format, ...) {
    if(obstack == NULL) return false;

    char str[1024];
    va_list arglist;

    va_start(arglist, format);
    vsnprintf(str, sizeof(str), format, arglist);
    va_end(arglist);

    return qObstackGrow(obstack, (void *)str, strlen(str));
}

void *qObstackFinish(Q_OBSTACK *obstack) {
    if(obstack == NULL) return NULL;

    void *dp;
    if(obstack->final != NULL) free(obstack->final);
    obstack->final = dp = (void *)malloc(obstack->stack->size + 1);
    if(obstack->final == NULL) return NULL;

    const Q_NLOBJ *obj;
    for(obj = qEntryFirst(obstack->stack); obj; obj = qEntryNext(obstack->stack)) {
        memcpy(dp, obj->object, obj->size);
        dp += obj->size;
    }
    *((char *)dp) = '\0';

    return obstack->final;
}

void *qObstackGetFinal(Q_OBSTACK *obstack) {
    if(obstack == NULL) return NULL;
    if(obstack->final == NULL) qObstackFinish(obstack);
    return obstack->final;
}

size_t qObstackGetSize(Q_OBSTACK *obstack) {
    if(obstack == NULL) return 0;
    return obstack->stack->size;
}

int qObstackGetNum(Q_OBSTACK *obstack) {
    if(obstack == NULL) return 0;
    return obstack->stack->num;
}

bool qObstackFree(Q_OBSTACK *obstack) {
    if(obstack == NULL) return false;
    qEntryFree(obstack->stack);
    if(obstack->final != NULL) free(obstack->final);
    free(obstack);
    return true;
}

#endif /* DISABLE_DATASTRUCTURE */

---