blob: d6ce94aed2468ea25112f63f7bc7c15d38c7db3d [file] [log] [blame]
/* ELF string table handling.
Copyright (C) 2000, 2001, 2002, 2005 Red Hat, Inc.
This file is part of Red Hat elfutils.
Written by Ulrich Drepper <>, 2000.
Red Hat elfutils 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; version 2 of the License.
Red Hat elfutils is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of
General Public License for more details.
You should have received a copy of the GNU General Public License along
with Red Hat elfutils; if not, write to the Free Software Foundation,
Inc., 51 Franklin Street, Fifth Floor, Boston MA 02110-1301 USA.
In addition, as a special exception, Red Hat, Inc. gives You the
additional right to link the code of Red Hat elfutils with code licensed
under any Open Source Initiative certified open source license
( which requires the
distribution of source code with any binary distribution and to
distribute linked combinations of the two. Non-GPL Code permitted under
this exception must only link to the code of Red Hat elfutils through
those well defined interfaces identified in the file named EXCEPTION
found in the source code files (the "Approved Interfaces"). The files
of Non-GPL Code may instantiate templates or use macros or inline
functions from the Approved Interfaces without causing the resulting
work to be covered by the GNU General Public License. Only Red Hat,
Inc. may make changes or additions to the list of Approved Interfaces.
Red Hat's grant of this exception is conditioned upon your not adding
any new exceptions. If you wish to add a new Approved Interface or
exception, please contact Red Hat. You must obey the GNU General Public
License in all respects for all of the Red Hat elfutils code and other
code used in conjunction with Red Hat elfutils except the Non-GPL Code
covered by this exception. If you modify this file, you may extend this
exception to your version of the file, but you are not obligated to do
so. If you do not wish to provide this exception without modification,
you must delete this exception statement from your version and license
this file solely under the GPL without exception.
Red Hat elfutils is an included package of the Open Invention Network.
An included package of the Open Invention Network is a package for which
Open Invention Network licensees cross-license their patents. No patent
license is granted, either expressly or impliedly, by designation as an
included package. Should you wish to participate in the Open Invention
Network licensing program, please visit
<>. */
# include <config.h>
#include <assert.h>
#include <inttypes.h>
#include <libelf.h>
#include <stddef.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include <sys/param.h>
#include "libebl.h"
#include <system.h>
#ifndef MIN
# define MIN(a, b) ((a) < (b) ? (a) : (b))
struct Ebl_Strent
const char *string;
size_t len;
struct Ebl_Strent *next;
struct Ebl_Strent *left;
struct Ebl_Strent *right;
size_t offset;
char reverse[0];
struct memoryblock
struct memoryblock *next;
char memory[0];
struct Ebl_Strtab
struct Ebl_Strent *root;
struct memoryblock *memory;
char *backp;
size_t left;
size_t total;
bool nullstr;
struct Ebl_Strent null;
/* Cache for the pagesize. We correct this value a bit so that `malloc'
is not allocating more than a page. */
static size_t ps;
struct Ebl_Strtab *
ebl_strtabinit (bool nullstr)
if (ps == 0)
ps = sysconf (_SC_PAGESIZE) - 2 * sizeof (void *);
assert (sizeof (struct memoryblock) < ps);
struct Ebl_Strtab *ret
= (struct Ebl_Strtab *) calloc (1, sizeof (struct Ebl_Strtab));
if (ret != NULL)
ret->nullstr = nullstr;
if (nullstr)
ret->null.len = 1;
ret->null.string = "";
return ret;
static int
morememory (struct Ebl_Strtab *st, size_t len)
if (len < ps)
len = ps;
struct memoryblock *newmem = (struct memoryblock *) malloc (len);
if (newmem == NULL)
return 1;
newmem->next = st->memory;
st->memory = newmem;
st->backp = newmem->memory;
st->left = len - offsetof (struct memoryblock, memory);
return 0;
ebl_strtabfree (struct Ebl_Strtab *st)
struct memoryblock *mb = st->memory;
while (mb != NULL)
void *old = mb;
mb = mb->next;
free (old);
free (st);
static struct Ebl_Strent *
newstring (struct Ebl_Strtab *st, const char *str, size_t len)
/* Compute the amount of padding needed to make the structure aligned. */
size_t align = ((__alignof__ (struct Ebl_Strent)
- (((uintptr_t) st->backp)
& (__alignof__ (struct Ebl_Strent) - 1)))
& (__alignof__ (struct Ebl_Strent) - 1));
/* Make sure there is enough room in the memory block. */
if (st->left < align + sizeof (struct Ebl_Strent) + len)
if (morememory (st, sizeof (struct Ebl_Strent) + len))
return NULL;
align = 0;
/* Create the reserved string. */
struct Ebl_Strent *newstr = (struct Ebl_Strent *) (st->backp + align);
newstr->string = str;
newstr->len = len;
newstr->next = NULL;
newstr->left = NULL;
newstr->right = NULL;
newstr->offset = 0;
for (int i = len - 2; i >= 0; --i)
newstr->reverse[i] = str[len - 2 - i];
newstr->reverse[len - 1] = '\0';
st->backp += align + sizeof (struct Ebl_Strent) + len;
st->left -= align + sizeof (struct Ebl_Strent) + len;
return newstr;
/* XXX This function should definitely be rewritten to use a balancing
tree algorith (AVL, red-black trees). For now a simple, correct
implementation is enough. */
static struct Ebl_Strent **
searchstring (struct Ebl_Strent **sep, struct Ebl_Strent *newstr)
/* More strings? */
if (*sep == NULL)
*sep = newstr;
return sep;
/* Compare the strings. */
int cmpres = memcmp ((*sep)->reverse, newstr->reverse,
MIN ((*sep)->len, newstr->len) - 1);
if (cmpres == 0)
/* We found a matching string. */
return sep;
else if (cmpres > 0)
return searchstring (&(*sep)->left, newstr);
return searchstring (&(*sep)->right, newstr);
/* Add new string. The actual string is assumed to be permanent. */
struct Ebl_Strent *
ebl_strtabadd (struct Ebl_Strtab *st, const char *str, size_t len)
/* Compute the string length if the caller doesn't know it. */
if (len == 0)
len = strlen (str) + 1;
/* Make sure all "" strings get offset 0 but only if the table was
created with a special null entry in mind. */
if (len == 1 && st->null.string != NULL)
return &st->null;
/* Allocate memory for the new string and its associated information. */
struct Ebl_Strent *newstr = newstring (st, str, len);
if (newstr == NULL)
return NULL;
/* Search in the array for the place to insert the string. If there
is no string with matching prefix and no string with matching
leading substring, create a new entry. */
struct Ebl_Strent **sep = searchstring (&st->root, newstr);
if (*sep != newstr)
/* This is not the same entry. This means we have a prefix match. */
if ((*sep)->len > newstr->len)
/* Check whether we already know this string. */
for (struct Ebl_Strent *subs = (*sep)->next; subs != NULL;
subs = subs->next)
if (subs->len == newstr->len)
/* We have an exact match with a substring. Free the memory
we allocated. */
st->left += st->backp - (char *) newstr;
st->backp = (char *) newstr;
return subs;
/* We have a new substring. This means we don't need the reverse
string of this entry anymore. */
st->backp -= newstr->len;
st->left += newstr->len;
newstr->next = (*sep)->next;
(*sep)->next = newstr;
else if ((*sep)->len != newstr->len)
/* When we get here it means that the string we are about to
add has a common prefix with a string we already have but
it is longer. In this case we have to put it first. */
st->total += newstr->len - (*sep)->len;
newstr->next = *sep;
newstr->left = (*sep)->left;
newstr->right = (*sep)->right;
*sep = newstr;
/* We have an exact match. Free the memory we allocated. */
st->left += st->backp - (char *) newstr;
st->backp = (char *) newstr;
newstr = *sep;
st->total += newstr->len;
return newstr;
static void
copystrings (struct Ebl_Strent *nodep, char **freep, size_t *offsetp)
if (nodep->left != NULL)
copystrings (nodep->left, freep, offsetp);
/* Process the current node. */
nodep->offset = *offsetp;
*freep = (char *) mempcpy (*freep, nodep->string, nodep->len);
*offsetp += nodep->len;
for (struct Ebl_Strent *subs = nodep->next; subs != NULL; subs = subs->next)
assert (subs->len < nodep->len);
subs->offset = nodep->offset + nodep->len - subs->len;
assert (subs->offset != 0 || subs->string[0] == '\0');
if (nodep->right != NULL)
copystrings (nodep->right, freep, offsetp);
ebl_strtabfinalize (struct Ebl_Strtab *st, Elf_Data *data)
size_t nulllen = st->nullstr ? 1 : 0;
/* Fill in the information. */
data->d_buf = malloc (st->total + nulllen);
if (data->d_buf == NULL)
abort ();
/* The first byte must always be zero if we created the table with a
null string. */
if (st->nullstr)
*((char *) data->d_buf) = '\0';
data->d_type = ELF_T_BYTE;
data->d_size = st->total + nulllen;
data->d_off = 0;
data->d_align = 1;
data->d_version = EV_CURRENT;
/* Now run through the tree and add all the string while also updating
the offset members of the elfstrent records. */
char *endp = (char *) data->d_buf + nulllen;
size_t copylen = nulllen;
copystrings (st->root, &endp, &copylen);
assert (copylen == st->total + nulllen);
ebl_strtaboffset (struct Ebl_Strent *se)
return se->offset;
const char *
ebl_string (struct Ebl_Strent *se)
assert (se->string != NULL);
return se->string;