2018-12-18 05:13:35 -07:00
|
|
|
// SPDX-License-Identifier: GPL-2.0
|
2005-04-16 15:20:36 -07:00
|
|
|
/*
|
|
|
|
* Copyright (C) 2002-2005 Roman Zippel <zippel@linux-m68k.org>
|
|
|
|
* Copyright (C) 2002-2005 Sam Ravnborg <sam@ravnborg.org>
|
|
|
|
*/
|
|
|
|
|
2011-06-01 13:00:46 -07:00
|
|
|
#include <stdarg.h>
|
2011-06-01 13:08:14 -07:00
|
|
|
#include <stdlib.h>
|
2005-04-16 15:20:36 -07:00
|
|
|
#include <string.h>
|
2024-02-02 08:58:23 -07:00
|
|
|
|
2024-09-08 05:43:16 -07:00
|
|
|
#include <hash.h>
|
2024-07-20 00:27:38 -07:00
|
|
|
#include <hashtable.h>
|
2024-08-12 05:48:50 -07:00
|
|
|
#include <xalloc.h>
|
2005-04-16 15:20:36 -07:00
|
|
|
#include "lkc.h"
|
|
|
|
|
2024-02-02 08:58:23 -07:00
|
|
|
/* hash table of all parsed Kconfig files */
|
|
|
|
static HASHTABLE_DEFINE(file_hashtable, 1U << 11);
|
|
|
|
|
2024-02-02 08:58:16 -07:00
|
|
|
struct file {
|
2024-02-02 08:58:23 -07:00
|
|
|
struct hlist_node node;
|
2024-02-02 08:58:16 -07:00
|
|
|
char name[];
|
|
|
|
};
|
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
/* file already present in list? If not add it */
|
2024-02-02 08:58:16 -07:00
|
|
|
const char *file_lookup(const char *name)
|
2005-04-16 15:20:36 -07:00
|
|
|
{
|
|
|
|
struct file *file;
|
2024-02-02 08:58:15 -07:00
|
|
|
size_t len;
|
2024-09-08 05:43:16 -07:00
|
|
|
int hash = hash_str(name);
|
2005-04-16 15:20:36 -07:00
|
|
|
|
2024-02-02 08:58:23 -07:00
|
|
|
hash_for_each_possible(file_hashtable, file, node, hash)
|
|
|
|
if (!strcmp(name, file->name))
|
2024-02-02 08:58:16 -07:00
|
|
|
return file->name;
|
2005-04-16 15:20:36 -07:00
|
|
|
|
2024-02-02 08:58:15 -07:00
|
|
|
len = strlen(name);
|
|
|
|
file = xmalloc(sizeof(*file) + len + 1);
|
2005-04-16 15:20:36 -07:00
|
|
|
memset(file, 0, sizeof(*file));
|
2024-02-02 08:58:15 -07:00
|
|
|
memcpy(file->name, name, len);
|
|
|
|
file->name[len] = '\0';
|
2024-02-02 08:58:23 -07:00
|
|
|
|
|
|
|
hash_add(file_hashtable, &file->node, hash);
|
2024-02-02 08:58:04 -07:00
|
|
|
|
|
|
|
str_printf(&autoconf_cmd, "\t%s \\\n", name);
|
|
|
|
|
2024-02-02 08:58:16 -07:00
|
|
|
return file->name;
|
2005-04-16 15:20:36 -07:00
|
|
|
}
|
|
|
|
|
2010-02-19 04:43:44 -07:00
|
|
|
/* Allocate initial growable string */
|
2005-04-16 15:20:36 -07:00
|
|
|
struct gstr str_new(void)
|
|
|
|
{
|
|
|
|
struct gstr gs;
|
2012-11-06 07:32:08 -07:00
|
|
|
gs.s = xmalloc(sizeof(char) * 64);
|
2008-05-18 14:10:24 -07:00
|
|
|
gs.len = 64;
|
2009-12-20 01:29:49 -07:00
|
|
|
gs.max_width = 0;
|
2005-04-16 15:20:36 -07:00
|
|
|
strcpy(gs.s, "\0");
|
|
|
|
return gs;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Free storage for growable string */
|
|
|
|
void str_free(struct gstr *gs)
|
|
|
|
{
|
2023-12-03 03:25:28 -07:00
|
|
|
free(gs->s);
|
2005-04-16 15:20:36 -07:00
|
|
|
gs->s = NULL;
|
|
|
|
gs->len = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Append to growable string */
|
|
|
|
void str_append(struct gstr *gs, const char *s)
|
|
|
|
{
|
2007-09-19 12:23:09 -07:00
|
|
|
size_t l;
|
|
|
|
if (s) {
|
|
|
|
l = strlen(gs->s) + strlen(s) + 1;
|
|
|
|
if (l > gs->len) {
|
2018-02-08 09:19:07 -07:00
|
|
|
gs->s = xrealloc(gs->s, l);
|
2007-09-19 12:23:09 -07:00
|
|
|
gs->len = l;
|
|
|
|
}
|
|
|
|
strcat(gs->s, s);
|
2005-04-16 15:20:36 -07:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Append printf formatted string to growable string */
|
|
|
|
void str_printf(struct gstr *gs, const char *fmt, ...)
|
|
|
|
{
|
|
|
|
va_list ap;
|
|
|
|
char s[10000]; /* big enough... */
|
|
|
|
va_start(ap, fmt);
|
|
|
|
vsnprintf(s, sizeof(s), fmt, ap);
|
|
|
|
str_append(gs, s);
|
|
|
|
va_end(ap);
|
|
|
|
}
|
|
|
|
|
2006-01-03 05:27:11 -07:00
|
|
|
/* Retrieve value of growable string */
|
2024-07-07 08:38:05 -07:00
|
|
|
char *str_get(const struct gstr *gs)
|
2005-04-16 15:20:36 -07:00
|
|
|
{
|
|
|
|
return gs->s;
|
|
|
|
}
|