mirror of
https://github.com/openharmony/third_party_elfutils.git
synced 2026-07-16 07:44:26 -04:00
Mark Wielaard
de2ed97f33
* Change name from "Red Hat elfutils" to "elfutils". * Update license of standalone tools and test from GPLv2 to GPLv3+. * Change license of libraries from GPLv2+exception to GPLv2/LGPLv3+. * Add Developer Certificate of Origin based contributor policy. top-level: - COPYING: Upgraded from GPLv2 to GPLv3. - CONTRIBUTING, COPYING-GPLv2, COPYING-LGPLv3: New files. - NEWS: Added note about new contribution and license policy. - Makefile.am: Updated to GPLv3, added new files to EXTRA_DIST. - configure.ac: Update to GPLv3, changed AC_INIT name to 'elfutils'. backends, lib, libasm, libcpu, libdw, libdwfl, libebl, libelf: - All files updated to GPLv2/LGPLv3+. Except some very small files (<5 lines) which didn't have any headers at all before, the linker .maps files and the libcpu/defs files which only contain data and libelf/elf.h which comes from glibc and is under LGPLv2+. config: - elfutils.spec.in: Add new License: headers and new %doc files. - Update all license headers to GPLv2/LGPLv3+ for files used by libs. src, tests: - All files updated to GPLv3+. Except for the test bz2 data files, the linker maps and script files and some very small files (<5 lines) that don't have any headers. Signed-off-by: Richard Fontana <rfontana@redhat.com> Signed-off-by: Mark Wielaard <mjw@redhat.com>
128 lines
3.5 KiB
C
128 lines
3.5 KiB
C
/* Copyright (C) 2000-2010 Red Hat, Inc.
|
|
This file is part of elfutils.
|
|
Written by Ulrich Drepper <drepper@redhat.com>, 2000.
|
|
|
|
This file is free software; you can redistribute it and/or modify
|
|
it under the terms of either
|
|
|
|
* the GNU Lesser General Public License as published by the Free
|
|
Software Foundation; either version 3 of the License, or (at
|
|
your option) any later version
|
|
|
|
or
|
|
|
|
* 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
|
|
|
|
or both in parallel, as here.
|
|
|
|
elfutils 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 copies of the GNU General Public License and
|
|
the GNU Lesser General Public License along with this program. If
|
|
not, see <http://www.gnu.org/licenses/>. */
|
|
|
|
#include <stddef.h>
|
|
|
|
/* Before including this file the following macros must be defined:
|
|
|
|
NAME name of the hash table structure.
|
|
TYPE data type of the hash table entries
|
|
|
|
The following macros if present select features:
|
|
|
|
ITERATE iterating over the table entries is possible
|
|
HASHTYPE integer type for hash values, default unsigned long int
|
|
*/
|
|
|
|
|
|
/* Optionally include an entry pointing to the first used entry. */
|
|
#ifdef ITERATE
|
|
# define FIRST(name) name##_ent *first;
|
|
# define NEXT(name) struct name##_ent *next;
|
|
#else
|
|
# define FIRST(name)
|
|
# define NEXT(name)
|
|
#endif
|
|
|
|
#ifndef HASHTYPE
|
|
# define HASHTYPE unsigned long int
|
|
#endif
|
|
|
|
|
|
/* Defined separately. */
|
|
extern size_t next_prime (size_t seed);
|
|
|
|
|
|
/* Table entry type. */
|
|
#define _DYNHASHENTTYPE(name) \
|
|
typedef struct name##_ent \
|
|
{ \
|
|
HASHTYPE hashval; \
|
|
TYPE data; \
|
|
NEXT (name) \
|
|
} name##_ent
|
|
#define DYNHASHENTTYPE(name) _DYNHASHENTTYPE (name)
|
|
DYNHASHENTTYPE (NAME);
|
|
|
|
|
|
/* Type of the dynamic hash table data structure. */
|
|
#define _DYNHASHTYPE(name) \
|
|
typedef struct \
|
|
{ \
|
|
size_t size; \
|
|
size_t filled; \
|
|
name##_ent *table; \
|
|
FIRST (name) \
|
|
} name
|
|
#define DYNHASHTYPE(name) _DYNHASHTYPE (name)
|
|
DYNHASHTYPE (NAME);
|
|
|
|
|
|
|
|
#define _FUNCTIONS(name) \
|
|
/* Initialize the hash table. */ \
|
|
extern int name##_init (name *htab, size_t init_size); \
|
|
\
|
|
/* Free resources allocated for hash table. */ \
|
|
extern int name##_free (name *htab); \
|
|
\
|
|
/* Insert new entry. */ \
|
|
extern int name##_insert (name *htab, HASHTYPE hval, TYPE data); \
|
|
\
|
|
/* Insert new entry, possibly overwrite old entry. */ \
|
|
extern int name##_overwrite (name *htab, HASHTYPE hval, TYPE data); \
|
|
\
|
|
/* Find entry in hash table. */ \
|
|
extern TYPE name##_find (name *htab, HASHTYPE hval, TYPE val);
|
|
#define FUNCTIONS(name) _FUNCTIONS (name)
|
|
FUNCTIONS (NAME)
|
|
|
|
|
|
#ifdef ITERATE
|
|
# define _XFUNCTIONS(name) \
|
|
/* Get next element in table. */ \
|
|
extern TYPE name##_iterate (name *htab, void **ptr);
|
|
# define XFUNCTIONS(name) _XFUNCTIONS (name)
|
|
XFUNCTIONS (NAME)
|
|
#endif
|
|
|
|
#ifndef NO_UNDEF
|
|
# undef DYNHASHENTTYPE
|
|
# undef DYNHASHTYPE
|
|
# undef FUNCTIONS
|
|
# undef _FUNCTIONS
|
|
# undef XFUNCTIONS
|
|
# undef _XFUNCTIONS
|
|
# undef NAME
|
|
# undef TYPE
|
|
# undef ITERATE
|
|
# undef COMPARE
|
|
# undef FIRST
|
|
# undef NEXT
|
|
#endif
|