ks_string.c

Go to the documentation of this file.

/*
 * libkarmaclient - A C Library to the Karmasphere Reputation Server
 * Copyright (C) 2006 Karmasphere <http://www.karmasphere.com/>
 *  - Shevek <shevek@karmasphere.com>
 *  - Dave Stewart <dave.stewart@karmasphere.com>
 *
 * This library is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Lesser General Public
 * License as published by the Free Software Foundation; either
 * version 2.1 of the License, or (at your option) any later version.
 *
 * This library is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public
 * License along with this library; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307  USA
 */

#include "ks_config.h"
#include "ks_string.h"

#ifdef HAVE_STRING_H
#include <string.h>
#endif

#ifdef HAVE_STDIO_H
#include <stdio.h>
#endif

static void
ks_string_bappend(ks_string_t *r, ks_base_t *b)
{
        ks_string_t     *u = KS_CAST(ks_string, b);
        char             buf[64];
        snprintf(buf, 63, "%d", ks_string_length(u));
        buf[63] = '\0';
        ks_string_append(r, buf, strlen(buf));
        ks_string_append(r, ":", 1);
        ks_string_append(r, ks_string_get(u), ks_string_length(u));
}

static ks_type_t ks_type_string = {
        "ks_string",                                    
        (ks_destroy_t)ks_string_free,   
        (ks_bappend_t)ks_string_bappend 
};

ks_type_t *
ks_string_type(void)
{
        return &ks_type_string;
}

ks_string_t *
ks_string_new(const char *data, int len)
{
        ks_string_t     *r = (ks_string_t *)ks_malloc(sizeof(ks_string_t));
        r->base.type = &ks_type_string;
        r->length = 0;
        r->size = -1;   /* Watch carefully. */
        r->data = NULL;
        ks_string_append(r, data, len);
        return r;
}

void
ks_string_free(ks_string_t *r)
{
        ks_free(r->data);
        ks_free(r);
}

int
ks_string_length(ks_string_t *r)
{
        return r->length;
}

void
ks_string_append(ks_string_t *r, const char *data, int len)
{
        if (r->length + len > r->size) {
                /* If this is changed, the -1 in ks_string_new will be wrong. */
                r->size = r->size + r->size;
                if (r->length + len > r->size)
                        r->size = r->length + len;
                r->data = (char *) ks_realloc(r->data, r->size + 1);
        }
        memcpy(&(r->data[r->length]), data, len);
        r->length += len;
        r->data[r->length] = '\0';
}

void
ks_string_set(ks_string_t *r, const char *data, int len)
{
        r->length = 0;
        ks_string_append(r, data, len);
}

const char *
ks_string_get(ks_string_t *r)
{
        return r->data;
}

int
ks_string_equals(ks_string_t *r, ks_string_t *s)
{
        int     len = ks_string_length(r);
        if (ks_string_length(s) != len)
                return 0;
        if (strcmp(ks_string_get(r), ks_string_get(s)) != 0)
                return 0;
        return 1;
}

---