mirror of
https://gitlab.gnome.org/GNOME/glib.git
synced 2024-11-10 11:26:16 +01:00
c9bd7542e1
Wed Jul 26 12:59:31 2000 Tim Janik <timj@gtk.org> * *.[hc]: applied patch from Andreas Persenius <ndap@swipnet.se> that updates the license headers to the GNU Lesser General Public License, as well as updating the copyright year to 2000.
576 lines
11 KiB
C
576 lines
11 KiB
C
/* GLIB - Library of useful routines for C programming
|
|
* Copyright (C) 1995-1997 Peter Mattis, Spencer Kimball and Josh MacDonald
|
|
*
|
|
* 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 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.
|
|
*/
|
|
|
|
/*
|
|
* Modified by the GLib Team and others 1997-2000. See the AUTHORS
|
|
* file for a list of people on the GLib Team. See the ChangeLog
|
|
* files for a list of changes. These files are distributed with
|
|
* GLib at ftp://ftp.gtk.org/pub/gtk/.
|
|
*/
|
|
|
|
/*
|
|
* MT safe
|
|
*/
|
|
|
|
#ifdef HAVE_CONFIG_H
|
|
#include <config.h>
|
|
#endif
|
|
|
|
#ifdef HAVE_UNISTD_H
|
|
#include <unistd.h>
|
|
#endif
|
|
#include <stdarg.h>
|
|
#include <stdlib.h>
|
|
#include <stdio.h>
|
|
#include <string.h>
|
|
#include <ctype.h>
|
|
#include "glib.h"
|
|
|
|
typedef struct _GRealStringChunk GRealStringChunk;
|
|
typedef struct _GRealString GRealString;
|
|
|
|
struct _GRealStringChunk
|
|
{
|
|
GHashTable *const_table;
|
|
GSList *storage_list;
|
|
gint storage_next;
|
|
gint this_size;
|
|
gint default_size;
|
|
};
|
|
|
|
struct _GRealString
|
|
{
|
|
gchar *str;
|
|
gint len;
|
|
gint alloc;
|
|
};
|
|
|
|
G_LOCK_DEFINE_STATIC (string_mem_chunk);
|
|
static GMemChunk *string_mem_chunk = NULL;
|
|
|
|
/* Hash Functions.
|
|
*/
|
|
|
|
gboolean
|
|
g_str_equal (gconstpointer v1,
|
|
gconstpointer v2)
|
|
{
|
|
const gchar *string1 = v1;
|
|
const gchar *string2 = v2;
|
|
|
|
return strcmp (string1, string2) == 0;
|
|
}
|
|
|
|
/* 31 bit hash function */
|
|
guint
|
|
g_str_hash (gconstpointer key)
|
|
{
|
|
const char *p = key;
|
|
guint h = *p;
|
|
|
|
if (h)
|
|
for (p += 1; *p != '\0'; p++)
|
|
h = (h << 5) - h + *p;
|
|
|
|
return h;
|
|
}
|
|
|
|
|
|
/* String Chunks.
|
|
*/
|
|
|
|
GStringChunk*
|
|
g_string_chunk_new (gint default_size)
|
|
{
|
|
GRealStringChunk *new_chunk = g_new (GRealStringChunk, 1);
|
|
gint size = 1;
|
|
|
|
while (size < default_size)
|
|
size <<= 1;
|
|
|
|
new_chunk->const_table = NULL;
|
|
new_chunk->storage_list = NULL;
|
|
new_chunk->storage_next = size;
|
|
new_chunk->default_size = size;
|
|
new_chunk->this_size = size;
|
|
|
|
return (GStringChunk*) new_chunk;
|
|
}
|
|
|
|
void
|
|
g_string_chunk_free (GStringChunk *fchunk)
|
|
{
|
|
GRealStringChunk *chunk = (GRealStringChunk*) fchunk;
|
|
GSList *tmp_list;
|
|
|
|
g_return_if_fail (chunk != NULL);
|
|
|
|
if (chunk->storage_list)
|
|
{
|
|
for (tmp_list = chunk->storage_list; tmp_list; tmp_list = tmp_list->next)
|
|
g_free (tmp_list->data);
|
|
|
|
g_slist_free (chunk->storage_list);
|
|
}
|
|
|
|
if (chunk->const_table)
|
|
g_hash_table_destroy (chunk->const_table);
|
|
|
|
g_free (chunk);
|
|
}
|
|
|
|
gchar*
|
|
g_string_chunk_insert (GStringChunk *fchunk,
|
|
const gchar *string)
|
|
{
|
|
GRealStringChunk *chunk = (GRealStringChunk*) fchunk;
|
|
gint len = strlen (string);
|
|
char* pos;
|
|
|
|
g_return_val_if_fail (chunk != NULL, NULL);
|
|
|
|
if ((chunk->storage_next + len + 1) > chunk->this_size)
|
|
{
|
|
gint new_size = chunk->default_size;
|
|
|
|
while (new_size < len+1)
|
|
new_size <<= 1;
|
|
|
|
chunk->storage_list = g_slist_prepend (chunk->storage_list,
|
|
g_new (char, new_size));
|
|
|
|
chunk->this_size = new_size;
|
|
chunk->storage_next = 0;
|
|
}
|
|
|
|
pos = ((char *) chunk->storage_list->data) + chunk->storage_next;
|
|
|
|
strcpy (pos, string);
|
|
|
|
chunk->storage_next += len + 1;
|
|
|
|
return pos;
|
|
}
|
|
|
|
gchar*
|
|
g_string_chunk_insert_const (GStringChunk *fchunk,
|
|
const gchar *string)
|
|
{
|
|
GRealStringChunk *chunk = (GRealStringChunk*) fchunk;
|
|
char* lookup;
|
|
|
|
g_return_val_if_fail (chunk != NULL, NULL);
|
|
|
|
if (!chunk->const_table)
|
|
chunk->const_table = g_hash_table_new (g_str_hash, g_str_equal);
|
|
|
|
lookup = (char*) g_hash_table_lookup (chunk->const_table, (gchar *)string);
|
|
|
|
if (!lookup)
|
|
{
|
|
lookup = g_string_chunk_insert (fchunk, string);
|
|
g_hash_table_insert (chunk->const_table, lookup, lookup);
|
|
}
|
|
|
|
return lookup;
|
|
}
|
|
|
|
/* Strings.
|
|
*/
|
|
static inline gint
|
|
nearest_power (gint num)
|
|
{
|
|
gint n = 1;
|
|
|
|
while (n < num)
|
|
n <<= 1;
|
|
|
|
return n;
|
|
}
|
|
|
|
static void
|
|
g_string_maybe_expand (GRealString* string, gint len)
|
|
{
|
|
if (string->len + len >= string->alloc)
|
|
{
|
|
string->alloc = nearest_power (string->len + len + 1);
|
|
string->str = g_realloc (string->str, string->alloc);
|
|
}
|
|
}
|
|
|
|
GString*
|
|
g_string_sized_new (guint dfl_size)
|
|
{
|
|
GRealString *string;
|
|
|
|
G_LOCK (string_mem_chunk);
|
|
if (!string_mem_chunk)
|
|
string_mem_chunk = g_mem_chunk_new ("string mem chunk",
|
|
sizeof (GRealString),
|
|
1024, G_ALLOC_AND_FREE);
|
|
|
|
string = g_chunk_new (GRealString, string_mem_chunk);
|
|
G_UNLOCK (string_mem_chunk);
|
|
|
|
string->alloc = 0;
|
|
string->len = 0;
|
|
string->str = NULL;
|
|
|
|
g_string_maybe_expand (string, MAX (dfl_size, 2));
|
|
string->str[0] = 0;
|
|
|
|
return (GString*) string;
|
|
}
|
|
|
|
GString*
|
|
g_string_new (const gchar *init)
|
|
{
|
|
GString *string;
|
|
|
|
string = g_string_sized_new (2);
|
|
|
|
if (init)
|
|
g_string_append (string, init);
|
|
|
|
return string;
|
|
}
|
|
|
|
void
|
|
g_string_free (GString *string,
|
|
gboolean free_segment)
|
|
{
|
|
g_return_if_fail (string != NULL);
|
|
|
|
if (free_segment)
|
|
g_free (string->str);
|
|
|
|
G_LOCK (string_mem_chunk);
|
|
g_mem_chunk_free (string_mem_chunk, string);
|
|
G_UNLOCK (string_mem_chunk);
|
|
}
|
|
|
|
gboolean
|
|
g_string_equal (const GString *v,
|
|
const GString *v2)
|
|
{
|
|
gchar *p, *q;
|
|
GRealString *string1 = (GRealString *) v;
|
|
GRealString *string2 = (GRealString *) v2;
|
|
gint i = string1->len;
|
|
|
|
if (i != string2->len)
|
|
return FALSE;
|
|
|
|
p = string1->str;
|
|
q = string2->str;
|
|
while (i)
|
|
{
|
|
if (*p != *q)
|
|
return FALSE;
|
|
p++;
|
|
q++;
|
|
i--;
|
|
}
|
|
return TRUE;
|
|
}
|
|
|
|
/* 31 bit hash function */
|
|
guint
|
|
g_string_hash (const GString *str)
|
|
{
|
|
const gchar *p = str->str;
|
|
gint n = str->len;
|
|
guint h = 0;
|
|
|
|
while (n--)
|
|
{
|
|
h = (h << 5) - h + *p;
|
|
p++;
|
|
}
|
|
|
|
return h;
|
|
}
|
|
|
|
GString*
|
|
g_string_assign (GString *string,
|
|
const gchar *rval)
|
|
{
|
|
g_return_val_if_fail (string != NULL, NULL);
|
|
g_return_val_if_fail (rval != NULL, string);
|
|
|
|
g_string_truncate (string, 0);
|
|
g_string_append (string, rval);
|
|
|
|
return string;
|
|
}
|
|
|
|
GString*
|
|
g_string_truncate (GString *fstring,
|
|
guint len)
|
|
{
|
|
GRealString *string = (GRealString *) fstring;
|
|
|
|
g_return_val_if_fail (string != NULL, NULL);
|
|
|
|
string->len = MIN (len, string->len);
|
|
|
|
string->str[string->len] = 0;
|
|
|
|
return fstring;
|
|
}
|
|
|
|
GString*
|
|
g_string_insert_len (GString *fstring,
|
|
gint pos,
|
|
const gchar *val,
|
|
gint len)
|
|
{
|
|
GRealString *string = (GRealString *) fstring;
|
|
|
|
g_return_val_if_fail (string != NULL, NULL);
|
|
g_return_val_if_fail (val != NULL, fstring);
|
|
g_return_val_if_fail (pos <= string->len, fstring);
|
|
|
|
if (len < 0)
|
|
len = strlen (val);
|
|
|
|
if (pos < 0)
|
|
pos = string->len;
|
|
|
|
g_string_maybe_expand (string, len);
|
|
|
|
/* If we aren't appending at the end, move a hunk
|
|
* of the old string to the end, opening up space
|
|
*/
|
|
if (pos < string->len)
|
|
g_memmove (string->str + pos + len, string->str + pos, string->len - pos);
|
|
|
|
/* insert the new string */
|
|
g_memmove (string->str + pos, val, len);
|
|
|
|
string->len += len;
|
|
|
|
string->str[string->len] = 0;
|
|
|
|
return fstring;
|
|
}
|
|
|
|
GString*
|
|
g_string_append (GString *fstring,
|
|
const gchar *val)
|
|
{
|
|
g_return_val_if_fail (fstring != NULL, NULL);
|
|
g_return_val_if_fail (val != NULL, fstring);
|
|
|
|
return g_string_insert_len (fstring, -1, val, -1);
|
|
}
|
|
|
|
GString*
|
|
g_string_append_len (GString *string,
|
|
const gchar *val,
|
|
gint len)
|
|
{
|
|
g_return_val_if_fail (string != NULL, NULL);
|
|
g_return_val_if_fail (val != NULL, string);
|
|
|
|
return g_string_insert_len (string, -1, val, len);
|
|
}
|
|
|
|
GString*
|
|
g_string_append_c (GString *fstring,
|
|
gchar c)
|
|
{
|
|
g_return_val_if_fail (fstring != NULL, NULL);
|
|
|
|
return g_string_insert_c (fstring, -1, c);
|
|
}
|
|
|
|
GString*
|
|
g_string_prepend (GString *fstring,
|
|
const gchar *val)
|
|
{
|
|
g_return_val_if_fail (fstring != NULL, NULL);
|
|
g_return_val_if_fail (val != NULL, fstring);
|
|
|
|
return g_string_insert_len (fstring, 0, val, -1);
|
|
}
|
|
|
|
GString*
|
|
g_string_prepend_len (GString *string,
|
|
const gchar *val,
|
|
gint len)
|
|
{
|
|
g_return_val_if_fail (string != NULL, NULL);
|
|
g_return_val_if_fail (val != NULL, string);
|
|
|
|
return g_string_insert_len (string, 0, val, len);
|
|
}
|
|
|
|
GString*
|
|
g_string_prepend_c (GString *fstring,
|
|
gchar c)
|
|
{
|
|
g_return_val_if_fail (fstring != NULL, NULL);
|
|
|
|
return g_string_insert_c (fstring, 0, c);
|
|
}
|
|
|
|
GString*
|
|
g_string_insert (GString *fstring,
|
|
gint pos,
|
|
const gchar *val)
|
|
{
|
|
g_return_val_if_fail (fstring != NULL, NULL);
|
|
g_return_val_if_fail (val != NULL, fstring);
|
|
g_return_val_if_fail (pos <= fstring->len, fstring);
|
|
|
|
return g_string_insert_len (fstring, pos, val, -1);
|
|
}
|
|
|
|
GString*
|
|
g_string_insert_c (GString *fstring,
|
|
gint pos,
|
|
gchar c)
|
|
{
|
|
GRealString *string = (GRealString *) fstring;
|
|
|
|
g_return_val_if_fail (string != NULL, NULL);
|
|
g_return_val_if_fail (pos <= string->len, fstring);
|
|
|
|
g_string_maybe_expand (string, 1);
|
|
|
|
if (pos < 0)
|
|
pos = string->len;
|
|
|
|
/* If not just an append, move the old stuff */
|
|
if (pos < string->len)
|
|
g_memmove (string->str + pos + 1, string->str + pos, string->len - pos);
|
|
|
|
string->str[pos] = c;
|
|
|
|
string->len += 1;
|
|
|
|
string->str[string->len] = 0;
|
|
|
|
return fstring;
|
|
}
|
|
|
|
GString*
|
|
g_string_erase (GString *fstring,
|
|
gint pos,
|
|
gint len)
|
|
{
|
|
GRealString *string = (GRealString*)fstring;
|
|
|
|
g_return_val_if_fail (string != NULL, NULL);
|
|
g_return_val_if_fail (len >= 0, fstring);
|
|
g_return_val_if_fail (pos >= 0, fstring);
|
|
g_return_val_if_fail (pos <= string->len, fstring);
|
|
g_return_val_if_fail (pos + len <= string->len, fstring);
|
|
|
|
if (pos + len < string->len)
|
|
g_memmove (string->str + pos, string->str + pos + len, string->len - (pos + len));
|
|
|
|
string->len -= len;
|
|
|
|
string->str[string->len] = 0;
|
|
|
|
return fstring;
|
|
}
|
|
|
|
GString*
|
|
g_string_down (GString *fstring)
|
|
{
|
|
GRealString *string = (GRealString *) fstring;
|
|
guchar *s;
|
|
gint n = string->len;
|
|
|
|
g_return_val_if_fail (string != NULL, NULL);
|
|
|
|
s = string->str;
|
|
|
|
while (n)
|
|
{
|
|
*s = tolower (*s);
|
|
s++;
|
|
n--;
|
|
}
|
|
|
|
return fstring;
|
|
}
|
|
|
|
GString*
|
|
g_string_up (GString *fstring)
|
|
{
|
|
GRealString *string = (GRealString *) fstring;
|
|
guchar *s;
|
|
gint n = string->len;
|
|
|
|
g_return_val_if_fail (string != NULL, NULL);
|
|
|
|
s = string->str;
|
|
|
|
while (n)
|
|
{
|
|
*s = toupper (*s);
|
|
s++;
|
|
n--;
|
|
}
|
|
|
|
return fstring;
|
|
}
|
|
|
|
static void
|
|
g_string_sprintfa_int (GString *string,
|
|
const gchar *fmt,
|
|
va_list args)
|
|
{
|
|
gchar *buffer;
|
|
|
|
buffer = g_strdup_vprintf (fmt, args);
|
|
g_string_append (string, buffer);
|
|
g_free (buffer);
|
|
}
|
|
|
|
void
|
|
g_string_sprintf (GString *string,
|
|
const gchar *fmt,
|
|
...)
|
|
{
|
|
va_list args;
|
|
|
|
g_string_truncate (string, 0);
|
|
|
|
va_start (args, fmt);
|
|
g_string_sprintfa_int (string, fmt, args);
|
|
va_end (args);
|
|
}
|
|
|
|
void
|
|
g_string_sprintfa (GString *string,
|
|
const gchar *fmt,
|
|
...)
|
|
{
|
|
va_list args;
|
|
|
|
va_start (args, fmt);
|
|
g_string_sprintfa_int (string, fmt, args);
|
|
va_end (args);
|
|
}
|