Files

122 lines
2.5 KiB
C
Raw Permalink Normal View History

2018-12-18 21:13:35 +09: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 16:00:46 -04:00
#include <stdarg.h>
2011-06-01 16:08:14 -04:00
#include <stdlib.h>
2005-04-16 15:20:36 -07:00
#include <string.h>
#include <hash.h>
#include <hashtable.h>
#include <xalloc.h>
2005-04-16 15:20:36 -07:00
#include "lkc.h"
/* hash table of all parsed Kconfig files */
static HASHTABLE_DEFINE(file_hashtable, 1U << 11);
struct file {
struct hlist_node node;
struct {
const char *name;
int lineno;
} parent;
char name[];
};
static void die_duplicated_include(struct file *file,
const char *parent, int lineno)
2005-04-16 15:20:36 -07:00
{
fprintf(stderr,
"%s:%d: error: repeated inclusion of %s\n"
"%s:%d: note: location of first inclusion of %s\n",
parent, lineno, file->name,
file->parent.name, file->parent.lineno, file->name);
exit(1);
}
/* file already present in list? If not add it */
const char *file_lookup(const char *name,
const char *parent_name, int parent_lineno)
{
const char *parent = NULL;
2005-04-16 15:20:36 -07:00
struct file *file;
size_t len;
int hash = hash_str(name);
2005-04-16 15:20:36 -07:00
if (parent_name)
parent = file_lookup(parent_name, NULL, 0);
hash_for_each_possible(file_hashtable, file, node, hash)
if (!strcmp(name, file->name)) {
if (!parent_name)
return file->name;
die_duplicated_include(file, parent, parent_lineno);
}
2005-04-16 15:20:36 -07:00
len = strlen(name);
file = xmalloc(sizeof(*file) + len + 1);
2005-04-16 15:20:36 -07:00
memset(file, 0, sizeof(*file));
memcpy(file->name, name, len);
file->name[len] = '\0';
file->parent.name = parent;
file->parent.lineno = parent_lineno;
hash_add(file_hashtable, &file->node, hash);
str_printf(&autoconf_cmd, "\t%s \\\n", name);
return file->name;
2005-04-16 15:20:36 -07:00
}
2010-02-19 12:43:44 +01:00
/* Allocate initial growable string */
2005-04-16 15:20:36 -07:00
struct gstr str_new(void)
{
struct gstr gs;
2012-11-06 14:32:08 +00:00
gs.s = xmalloc(sizeof(char) * 64);
gs.len = 64;
2009-12-20 00:29:49 -08: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)
{
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 21:23:09 +02:00
size_t l;
if (s) {
l = strlen(gs->s) + strlen(s) + 1;
if (l > gs->len) {
2018-02-09 01:19:07 +09:00
gs->s = xrealloc(gs->s, l);
2007-09-19 21:23:09 +02: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 13:27:11 +01:00
/* Retrieve value of growable string */
char *str_get(const struct gstr *gs)
2005-04-16 15:20:36 -07:00
{
return gs->s;
}