quakeforge/libs/util/info.c

272 lines
5.4 KiB
C
Raw Normal View History

/*
info.c
Info strings.
Copyright (C) 1996-1997 Id Software, Inc.
This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License
as published by the Free Software Foundation; either version 2
of the License, or (at your option) any later version.
This program 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to:
Free Software Foundation, Inc.
59 Temple Place - Suite 330
Boston, MA 02111-1307, USA
*/
2001-09-28 06:26:31 +00:00
static const char rcsid[] =
"$Id$";
#ifdef HAVE_CONFIG_H
# include "config.h"
#endif
#ifdef HAVE_STRING_H
# include <string.h>
#endif
#ifdef HAVE_STRINGS_H
# include <strings.h>
#endif
#include <stdio.h>
#include <ctype.h>
#include "QF/hash.h"
#include "QF/info.h"
#include "QF/sys.h"
#include "QF/zone.h"
#include "compat.h"
/*
Info_FilterForKey
Searches for key in the "client-needed" info string list
*/
qboolean
Info_FilterForKey (const char *key, const char **filter_list)
{
const char **s;
for (s = filter_list; *s; s++) {
if (strequal (*s, key)) {
return true;
}
}
return false;
}
/*
Info_ValueForKey
Searches the string for the given
key and returns the associated value, or an empty string.
*/
2001-08-15 22:38:11 +00:00
const char *
Info_ValueForKey (info_t *info, const char *key)
{
info_key_t *k = Hash_Find (info->tab, key);
if (k)
return k->value;
return "";
}
void
Info_RemoveKey (info_t *info, const char *key)
{
info_key_t *k = Hash_Del (info->tab, key);
if (k) {
free ((char*)k->key);
free ((char*)k->value);
free (k);
}
}
void
Info_SetValueForStarKey (info_t *info, const char *key, const char *value, int flags)
{
info_key_t *k;
int cursize;
char *str;
if (strstr (key, "\\") || strstr (value, "\\")) {
Sys_Printf ("Can't use keys or values with a \\\n");
return;
}
if (strstr (key, "\"") || strstr (value, "\"")) {
Sys_Printf ("Can't use keys or values with a \"\n");
return;
}
if (strlen (key) > 63 || strlen (value) > 63) {
Sys_Printf ("Keys and values must be < 64 characters.\n");
return;
}
k = Hash_Find (info->tab, key);
cursize = info->cursize;
if (k) {
cursize -= strlen (k->key) + 1;
cursize -= strlen (k->value) + 1;
}
if (info->maxsize &&
cursize + strlen (key) + 1 + strlen (value) + 1 > info->maxsize) {
Sys_Printf ("Info string length exceeded\n");
return;
}
if (k) {
if (strequal (k->value, value))
return;
2001-11-04 08:18:54 +00:00
info->cursize -= strlen (k->value) + 1;
free ((char*)k->value);
} else {
if (!(k = malloc (sizeof (info_key_t))))
Sys_Error ("Info_SetValueForStarKey: out of memory\n");
if (!(k->key = strdup (key)))
Sys_Error ("Info_SetValueForStarKey: out of memory\n");
info->cursize += strlen (key) + 1;
Hash_Add (info->tab, k);
}
if (!(str = strdup (value)))
Sys_Error ("Info_SetValueForStarKey: out of memory\n");
if (flags & 1) {
byte *s, *d;
for (d = s = str; *s; s++)
if ((*s & 127) >= 32 && (*s & 127) <=127)
*d++ = *s & 127;
if (flags & 2)
for (d = s = str; *s; s++)
*d++ = tolower (*s);
} else {
byte *s, *d;
for (d = s = str; *s; s++)
if (*s >= 13)
*d++ = *s;
}
info->cursize += strlen (str) + 1;
k->value = str;
}
void
Info_SetValueForKey (info_t *info, const char *key, const char *value,
int flags)
{
if (key[0] == '*') {
Sys_Printf ("Can't set * keys\n");
return;
}
Info_SetValueForStarKey (info, key, value, flags);
}
void
Info_Print (info_t *info)
{
info_key_t **key_list;
info_key_t **key;
key_list = (info_key_t **)Hash_GetList (info->tab);
for (key = key_list; *key; key++) {
2001-11-04 20:48:12 +00:00
Sys_Printf ("%-15s %s\n", (*key)->key, (*key)->value);
}
free (key_list);
}
static const char *
info_get_key (void *k, void *unused)
{
return ((info_key_t *)k)->key;
}
static void
free_key (void *_k, void *unused)
{
info_key_t *k = (info_key_t *)_k;
free ((char*)k->key);
free ((char*)k->value);
free (k);
}
info_t *
Info_ParseString (const char *s, int maxsize)
{
info_t *info;
char *string = Hunk_TempAlloc (strlen (s) + 1);
char *key, *value, *end;
info = malloc (sizeof (info_t));
info->tab = Hash_NewTable (61, info_get_key, free_key, 0);
info->maxsize = maxsize;
info->cursize = 0;
strcpy (string, s);
key = string;
if (*key == '\\')
key++;
while (*key) {
value = key;
while (*value && *value != '\\')
value++;
if (*value) {
*value++ = 0;
for (end = value; *end && *end != '\\'; end++)
;
if (*end)
*end++ = 0;
} else {
value = end = "";
}
Info_SetValueForStarKey (info, key, value, 0);
key = end;
}
return info;
}
void
Info_Destroy (info_t *info)
{
Hash_DelTable (info->tab);
free (info);
}
char *
Info_MakeString (info_t *info, int (*filter)(const char *))
{
char *string;
const char *s;
char *d;
info_key_t **key_list;
info_key_t **key;
d = string = Hunk_TempAlloc (info->cursize + 1);
key_list = (info_key_t **)Hash_GetList (info->tab);
for (key = key_list; *key; key++) {
if (!*(*key)->value)
continue;
if (filter && filter ((*key)->key))
continue;
*d++ = '\\';
for (s = (*key)->key; *s; s++)
*d++ = *s;
*d++ = '\\';
for (s = (*key)->value; *s; s++)
*d++ = *s;
}
*d = 0;
free (key_list);
return string;
}