dwarves/strings.c

/*
  SPDX-License-Identifier: GPL-2.0-only

  Copyright (C) 2008 Arnaldo Carvalho de Melo <acme@redhat.com>
*/

#include "strings.h"
#include "gobuffer.h"

#include <search.h>
#include <stdint.h>
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <zlib.h>

#include "dutil.h"

struct strings *strings__new(void)
{
	struct strings *strs = malloc(sizeof(*strs));

	if (strs != NULL) {
		strs->tree = NULL;
		gobuffer__init(&strs->gb);
	}

	return strs;

}

static void do_nothing(void *ptr __unused)
{
}

void strings__delete(struct strings *strs)
{
	if (strs == NULL)
		return;
	tdestroy(strs->tree, do_nothing);
	__gobuffer__delete(&strs->gb);
	free(strs);
}

static strings_t strings__insert(struct strings *strs, const char *s)
{
	return gobuffer__add(&strs->gb, s, strlen(s) + 1);
}

struct search_key {
	struct strings *strs;
	const char *str;
};

static int strings__compare(const void *a, const void *b)
{
	const struct search_key *key = a;

	return strcmp(key->str, key->strs->gb.entries + (unsigned long)b);
}

strings_t strings__add(struct strings *strs, const char *str)
{
	unsigned long *s;
	strings_t index;
	struct search_key key = {
		.strs = strs,
		.str = str,
	};

	if (str == NULL)
		return 0;

	s = tsearch(&key, &strs->tree, strings__compare);
	if (s != NULL) {
		if (*(struct search_key **)s == (void *)&key) { /* Not found, replace with the right key */
			index = strings__insert(strs, str);
			if (index != 0)
				*s = (unsigned long)index;
			else {
				tdelete(&key, &strs->tree, strings__compare);
				return 0;
			}
		} else /* Found! */
			index = *s;
	} else
		return 0;

	return index;
}

strings_t strings__find(struct strings *strs, const char *str)
{
	strings_t *s;
	struct search_key key = {
		.strs = strs,
		.str = str,
	};

	if (str == NULL)
		return 0;

	s = tfind(&key, &strs->tree, strings__compare);
	return s ? *s : 0;
}

int strings__cmp(const struct strings *strs, strings_t a, strings_t b)
{
	return a == b ? 0 : strcmp(strings__ptr(strs, a),
				   strings__ptr(strs, b));
}