Skip to content

L
libbacktrace
Commit 17f687d2 by Than McIntosh Committed by Ian Lance Taylor
Options

Update from gcc trunk version of libbacktrace at svn rev 256427. (#8)

Includes (among other things) support for compressed debug sections, a variety of bugfixes, and expanded test coverage.
parent 14d377e9
Showing with 5735 additions and 574 deletions
Makefile.am
# Makefile.am -- Backtrace Makefile.
# Copyright (C) 2012-2016 Free Software Foundation, Inc.
# Copyright (C) 2012-2018 Free Software Foundation, Inc.
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are
......@@ -29,11 +29,14 @@
# IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
# POSSIBILITY OF SUCH DAMAGE.
ACLOCAL_AMFLAGS = -I .. -I ../config
AM_CFLAGS = $(EXTRA_FLAGS) $(WARN_FLAGS) $(PIC_FLAG)
lib_LTLIBRARIES = libbacktrace.la
include_HEADERS = backtrace.h backtrace-supported.h
noinst_LTLIBRARIES = libbacktrace.la
libbacktrace_la_SOURCES = \
backtrace.h \
atomic.c \
......@@ -53,7 +56,8 @@ BACKTRACE_FILES = \
FORMAT_FILES = \
elf.c \
pecoff.c \
unknown.c
unknown.c \
xcoff.c
VIEW_FILES = \
read.c \
......@@ -85,7 +89,7 @@ TESTS = $(check_PROGRAMS)
if NATIVE
btest_SOURCES = btest.c
btest_SOURCES = btest.c testlib.c
btest_CFLAGS = $(AM_CFLAGS) -g -O
btest_LDADD = libbacktrace.la
......@@ -96,6 +100,64 @@ stest_LDADD = libbacktrace.la
check_PROGRAMS += stest
ztest_SOURCES = ztest.c testlib.c
ztest_CFLAGS = -DSRCDIR=\"$(srcdir)\"
ztest_LDADD = libbacktrace.la
if HAVE_ZLIB
ztest_LDADD += -lz
endif
ztest_LDADD += $(CLOCK_GETTIME_LINK)
check_PROGRAMS += ztest
edtest_SOURCES = edtest.c edtest2_build.c testlib.c
edtest_LDADD = libbacktrace.la
check_PROGRAMS += edtest
edtest2_build.c: gen_edtest2_build; @true
gen_edtest2_build: $(srcdir)/edtest2.c
cat $(srcdir)/edtest2.c > tmp-edtest2_build.c
$(SHELL) $(srcdir)/move-if-change tmp-edtest2_build.c edtest2_build.c
echo timestamp > $@
if HAVE_PTHREAD
check_PROGRAMS += ttest
ttest_SOURCES = ttest.c testlib.c
ttest_CFLAGS = $(AM_CFLAGS) -pthread
ttest_LDADD = libbacktrace.la
endif HAVE_PTHREAD
if HAVE_OBJCOPY_DEBUGLINK
TESTS += dtest
dtest: btest
$(OBJCOPY) --only-keep-debug btest btest.debug
$(OBJCOPY) --strip-debug --add-gnu-debuglink=btest.debug btest dtest
endif HAVE_OBJCOPY_DEBUGLINK
if HAVE_COMPRESSED_DEBUG
ctestg_SOURCES = btest.c testlib.c
ctestg_CFLAGS = $(AM_CFLAGS) -g
ctestg_LDFLAGS = -Wl,--compress-debug-sections=zlib-gnu
ctestg_LDADD = libbacktrace.la
ctesta_SOURCES = btest.c testlib.c
ctesta_CFLAGS = $(AM_CFLAGS) -g
ctesta_LDFLAGS = -Wl,--compress-debug-sections=zlib-gabi
ctesta_LDADD = libbacktrace.la
check_PROGRAMS += ctestg ctesta
endif
endif NATIVE
# We can't use automake's automatic dependency tracking, because it
......@@ -112,8 +174,8 @@ endif NATIVE
alloc.lo: config.h backtrace.h internal.h
backtrace.lo: config.h backtrace.h internal.h
btest.lo: backtrace.h backtrace-supported.h
dwarf.lo: config.h backtrace.h internal.h
btest.lo: backtrace.h backtrace-supported.h filenames.h
dwarf.lo: config.h filenames.h backtrace.h internal.h
elf.lo: config.h backtrace.h internal.h
fileline.lo: config.h backtrace.h internal.h
mmap.lo: config.h backtrace.h internal.h
......@@ -128,3 +190,5 @@ sort.lo: config.h backtrace.h internal.h
stest.lo: config.h backtrace.h internal.h
state.lo: config.h backtrace.h backtrace-supported.h internal.h
unknown.lo: config.h backtrace.h internal.h
xcoff.lo: config.h backtrace.h internal.h
Makefile.in
......@@ -16,7 +16,7 @@
@SET_MAKE@
# Makefile.am -- Backtrace Makefile.
# Copyright (C) 2012-2016 Free Software Foundation, Inc.
# Copyright (C) 2012-2018 Free Software Foundation, Inc.
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are
......@@ -84,8 +84,12 @@ POST_UNINSTALL = :
build_triplet = @build@
host_triplet = @host@
target_triplet = @target@
check_PROGRAMS = $(am__EXEEXT_1)
@NATIVE_TRUE@am__append_1 = btest stest
check_PROGRAMS = $(am__EXEEXT_1) $(am__EXEEXT_2) $(am__EXEEXT_3)
@NATIVE_TRUE@am__append_1 = btest stest ztest edtest
@HAVE_ZLIB_TRUE@@NATIVE_TRUE@am__append_2 = -lz
@HAVE_PTHREAD_TRUE@@NATIVE_TRUE@am__append_3 = ttest
@HAVE_OBJCOPY_DEBUGLINK_TRUE@@NATIVE_TRUE@am__append_4 = dtest
@HAVE_COMPRESSED_DEBUG_TRUE@@NATIVE_TRUE@am__append_5 = ctestg ctesta
subdir = .
DIST_COMMON = $(srcdir)/Makefile.in $(srcdir)/Makefile.am \
$(top_srcdir)/configure $(am__configure_deps) \
......@@ -102,49 +106,63 @@ mkinstalldirs = $(install_sh) -d
CONFIG_HEADER = config.h
CONFIG_CLEAN_FILES = backtrace-supported.h
CONFIG_CLEAN_VPATH_FILES =
am__vpath_adj_setup = srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`;
am__vpath_adj = case $$p in \
$(srcdir)/*) f=`echo "$$p" | sed "s|^$$srcdirstrip/||"`;; \
*) f=$$p;; \
esac;
am__strip_dir = f=`echo $$p | sed -e 's|^.*/||'`;
am__install_max = 40
am__nobase_strip_setup = \
srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*|]/\\\\&/g'`
am__nobase_strip = \
for p in $$list; do echo "$$p"; done | sed -e "s|$$srcdirstrip/||"
am__nobase_list = $(am__nobase_strip_setup); \
for p in $$list; do echo "$$p $$p"; done | \
sed "s| $$srcdirstrip/| |;"' / .*\//!s/ .*/ ./; s,\( .*\)/[^/]*$$,\1,' | \
$(AWK) 'BEGIN { files["."] = "" } { files[$$2] = files[$$2] " " $$1; \
if (++n[$$2] == $(am__install_max)) \
{ print $$2, files[$$2]; n[$$2] = 0; files[$$2] = "" } } \
END { for (dir in files) print dir, files[dir] }'
am__base_list = \
sed '$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;s/\n/ /g' | \
sed '$$!N;$$!N;$$!N;$$!N;s/\n/ /g'
am__uninstall_files_from_dir = { \
test -z "$$files" \
|| { test ! -d "$$dir" && test ! -f "$$dir" && test ! -r "$$dir"; } \
|| { echo " ( cd '$$dir' && rm -f" $$files ")"; \
$(am__cd) "$$dir" && rm -f $$files; }; \
}
am__installdirs = "$(DESTDIR)$(libdir)" "$(DESTDIR)$(includedir)"
LTLIBRARIES = $(lib_LTLIBRARIES)
LTLIBRARIES = $(noinst_LTLIBRARIES)
am__DEPENDENCIES_1 =
am_libbacktrace_la_OBJECTS = atomic.lo dwarf.lo fileline.lo posix.lo \
print.lo sort.lo state.lo
libbacktrace_la_OBJECTS = $(am_libbacktrace_la_OBJECTS)
@NATIVE_TRUE@am__EXEEXT_1 = btest$(EXEEXT) stest$(EXEEXT)
@NATIVE_TRUE@am_btest_OBJECTS = btest-btest.$(OBJEXT)
@NATIVE_TRUE@am__EXEEXT_1 = btest$(EXEEXT) stest$(EXEEXT) \
@NATIVE_TRUE@ ztest$(EXEEXT) edtest$(EXEEXT)
@HAVE_PTHREAD_TRUE@@NATIVE_TRUE@am__EXEEXT_2 = ttest$(EXEEXT)
@HAVE_COMPRESSED_DEBUG_TRUE@@NATIVE_TRUE@am__EXEEXT_3 = \
@HAVE_COMPRESSED_DEBUG_TRUE@@NATIVE_TRUE@ ctestg$(EXEEXT) \
@HAVE_COMPRESSED_DEBUG_TRUE@@NATIVE_TRUE@ ctesta$(EXEEXT)
@NATIVE_TRUE@am_btest_OBJECTS = btest-btest.$(OBJEXT) \
@NATIVE_TRUE@ btest-testlib.$(OBJEXT)
btest_OBJECTS = $(am_btest_OBJECTS)
@NATIVE_TRUE@btest_DEPENDENCIES = libbacktrace.la
btest_LINK = $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) \
--mode=link $(CCLD) $(btest_CFLAGS) $(CFLAGS) $(AM_LDFLAGS) \
$(LDFLAGS) -o $@
@HAVE_COMPRESSED_DEBUG_TRUE@@NATIVE_TRUE@am_ctesta_OBJECTS = ctesta-btest.$(OBJEXT) \
@HAVE_COMPRESSED_DEBUG_TRUE@@NATIVE_TRUE@ ctesta-testlib.$(OBJEXT)
ctesta_OBJECTS = $(am_ctesta_OBJECTS)
@HAVE_COMPRESSED_DEBUG_TRUE@@NATIVE_TRUE@ctesta_DEPENDENCIES = \
@HAVE_COMPRESSED_DEBUG_TRUE@@NATIVE_TRUE@ libbacktrace.la
ctesta_LINK = $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) \
--mode=link $(CCLD) $(ctesta_CFLAGS) $(CFLAGS) \
$(ctesta_LDFLAGS) $(LDFLAGS) -o $@
@HAVE_COMPRESSED_DEBUG_TRUE@@NATIVE_TRUE@am_ctestg_OBJECTS = ctestg-btest.$(OBJEXT) \
@HAVE_COMPRESSED_DEBUG_TRUE@@NATIVE_TRUE@ ctestg-testlib.$(OBJEXT)
ctestg_OBJECTS = $(am_ctestg_OBJECTS)
@HAVE_COMPRESSED_DEBUG_TRUE@@NATIVE_TRUE@ctestg_DEPENDENCIES = \
@HAVE_COMPRESSED_DEBUG_TRUE@@NATIVE_TRUE@ libbacktrace.la
ctestg_LINK = $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) \
--mode=link $(CCLD) $(ctestg_CFLAGS) $(CFLAGS) \
$(ctestg_LDFLAGS) $(LDFLAGS) -o $@
@NATIVE_TRUE@am_edtest_OBJECTS = edtest.$(OBJEXT) \
@NATIVE_TRUE@ edtest2_build.$(OBJEXT) testlib.$(OBJEXT)
edtest_OBJECTS = $(am_edtest_OBJECTS)
@NATIVE_TRUE@edtest_DEPENDENCIES = libbacktrace.la
@NATIVE_TRUE@am_stest_OBJECTS = stest.$(OBJEXT)
stest_OBJECTS = $(am_stest_OBJECTS)
@NATIVE_TRUE@stest_DEPENDENCIES = libbacktrace.la
@HAVE_PTHREAD_TRUE@@NATIVE_TRUE@am_ttest_OBJECTS = \
@HAVE_PTHREAD_TRUE@@NATIVE_TRUE@ ttest-ttest.$(OBJEXT) \
@HAVE_PTHREAD_TRUE@@NATIVE_TRUE@ ttest-testlib.$(OBJEXT)
ttest_OBJECTS = $(am_ttest_OBJECTS)
@HAVE_PTHREAD_TRUE@@NATIVE_TRUE@ttest_DEPENDENCIES = libbacktrace.la
ttest_LINK = $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) \
--mode=link $(CCLD) $(ttest_CFLAGS) $(CFLAGS) $(AM_LDFLAGS) \
$(LDFLAGS) -o $@
@NATIVE_TRUE@am_ztest_OBJECTS = ztest-ztest.$(OBJEXT) \
@NATIVE_TRUE@ ztest-testlib.$(OBJEXT)
ztest_OBJECTS = $(am_ztest_OBJECTS)
@NATIVE_TRUE@ztest_DEPENDENCIES = libbacktrace.la \
@NATIVE_TRUE@ $(am__DEPENDENCIES_1) $(am__DEPENDENCIES_1)
ztest_LINK = $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) \
--mode=link $(CCLD) $(ztest_CFLAGS) $(CFLAGS) $(AM_LDFLAGS) \
$(LDFLAGS) -o $@
DEFAULT_INCLUDES = -I.@am__isrc@
depcomp =
am__depfiles_maybe =
......@@ -158,7 +176,9 @@ LINK = $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) \
--mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) $(AM_LDFLAGS) \
$(LDFLAGS) -o $@
SOURCES = $(libbacktrace_la_SOURCES) $(EXTRA_libbacktrace_la_SOURCES) \
$(btest_SOURCES) $(stest_SOURCES)
$(btest_SOURCES) $(ctesta_SOURCES) $(ctestg_SOURCES) \
$(edtest_SOURCES) $(stest_SOURCES) $(ttest_SOURCES) \
$(ztest_SOURCES)
MULTISRCTOP =
MULTIBUILDTOP =
MULTIDIRS =
......@@ -170,6 +190,34 @@ am__can_run_installinfo = \
n|no|NO) false;; \
*) (install-info --version) >/dev/null 2>&1;; \
esac
am__vpath_adj_setup = srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`;
am__vpath_adj = case $$p in \
$(srcdir)/*) f=`echo "$$p" | sed "s|^$$srcdirstrip/||"`;; \
*) f=$$p;; \
esac;
am__strip_dir = f=`echo $$p | sed -e 's|^.*/||'`;
am__install_max = 40
am__nobase_strip_setup = \
srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*|]/\\\\&/g'`
am__nobase_strip = \
for p in $$list; do echo "$$p"; done | sed -e "s|$$srcdirstrip/||"
am__nobase_list = $(am__nobase_strip_setup); \
for p in $$list; do echo "$$p $$p"; done | \
sed "s| $$srcdirstrip/| |;"' / .*\//!s/ .*/ ./; s,\( .*\)/[^/]*$$,\1,' | \
$(AWK) 'BEGIN { files["."] = "" } { files[$$2] = files[$$2] " " $$1; \
if (++n[$$2] == $(am__install_max)) \
{ print $$2, files[$$2]; n[$$2] = 0; files[$$2] = "" } } \
END { for (dir in files) print dir, files[dir] }'
am__base_list = \
sed '$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;s/\n/ /g' | \
sed '$$!N;$$!N;$$!N;$$!N;s/\n/ /g'
am__uninstall_files_from_dir = { \
test -z "$$files" \
|| { test ! -d "$$dir" && test ! -f "$$dir" && test ! -r "$$dir"; } \
|| { echo " ( cd '$$dir' && rm -f" $$files ")"; \
$(am__cd) "$$dir" && rm -f $$files; }; \
}
am__installdirs = "$(DESTDIR)$(includedir)"
HEADERS = $(include_HEADERS)
ETAGS = etags
CTAGS = ctags
......@@ -190,6 +238,7 @@ BACKTRACE_SUPPORTS_THREADS = @BACKTRACE_SUPPORTS_THREADS@
BACKTRACE_USES_MALLOC = @BACKTRACE_USES_MALLOC@
CC = @CC@
CFLAGS = @CFLAGS@
CLOCK_GETTIME_LINK = @CLOCK_GETTIME_LINK@
CPP = @CPP@
CPPFLAGS = @CPPFLAGS@
CYGPATH_W = @CYGPATH_W@
......@@ -223,6 +272,8 @@ MAKEINFO = @MAKEINFO@
MKDIR_P = @MKDIR_P@
NM = @NM@
NMEDIT = @NMEDIT@
OBJCOPY = @OBJCOPY@
OBJDUMP = @OBJDUMP@
OBJEXT = @OBJEXT@
OTOOL = @OTOOL@
OTOOL64 = @OTOOL64@
......@@ -235,6 +286,7 @@ PACKAGE_URL = @PACKAGE_URL@
PACKAGE_VERSION = @PACKAGE_VERSION@
PATH_SEPARATOR = @PATH_SEPARATOR@
PIC_FLAG = @PIC_FLAG@
PTHREAD_CFLAGS = @PTHREAD_CFLAGS@
RANLIB = @RANLIB@
SED = @SED@
SET_MAKE = @SET_MAKE@
......@@ -278,7 +330,6 @@ libexecdir = @libexecdir@
libtool_VERSION = @libtool_VERSION@
localedir = @localedir@
localstatedir = @localstatedir@
lt_ECHO = @lt_ECHO@
mandir = @mandir@
mkdir_p = @mkdir_p@
multi_basedir = @multi_basedir@
......@@ -287,6 +338,7 @@ pdfdir = @pdfdir@
prefix = @prefix@
program_transform_name = @program_transform_name@
psdir = @psdir@
runstatedir = @runstatedir@
sbindir = @sbindir@
sharedstatedir = @sharedstatedir@
srcdir = @srcdir@
......@@ -299,9 +351,10 @@ target_vendor = @target_vendor@
top_build_prefix = @top_build_prefix@
top_builddir = @top_builddir@
top_srcdir = @top_srcdir@
ACLOCAL_AMFLAGS = -I .. -I ../config
AM_CFLAGS = $(EXTRA_FLAGS) $(WARN_FLAGS) $(PIC_FLAG)
lib_LTLIBRARIES = libbacktrace.la
include_HEADERS = backtrace.h backtrace-supported.h
noinst_LTLIBRARIES = libbacktrace.la
libbacktrace_la_SOURCES = \
backtrace.h \
atomic.c \
......@@ -321,7 +374,8 @@ BACKTRACE_FILES = \
FORMAT_FILES = \
elf.c \
pecoff.c \
unknown.c
unknown.c \
xcoff.c
VIEW_FILES = \
read.c \
......@@ -344,12 +398,29 @@ libbacktrace_la_LIBADD = \
$(ALLOC_FILE)
libbacktrace_la_DEPENDENCIES = $(libbacktrace_la_LIBADD)
TESTS = $(check_PROGRAMS)
@NATIVE_TRUE@btest_SOURCES = btest.c
TESTS = $(check_PROGRAMS) $(am__append_4)
@NATIVE_TRUE@btest_SOURCES = btest.c testlib.c
@NATIVE_TRUE@btest_CFLAGS = $(AM_CFLAGS) -g -O
@NATIVE_TRUE@btest_LDADD = libbacktrace.la
@NATIVE_TRUE@stest_SOURCES = stest.c
@NATIVE_TRUE@stest_LDADD = libbacktrace.la
@NATIVE_TRUE@ztest_SOURCES = ztest.c testlib.c
@NATIVE_TRUE@ztest_CFLAGS = -DSRCDIR=\"$(srcdir)\"
@NATIVE_TRUE@ztest_LDADD = libbacktrace.la $(am__append_2) \
@NATIVE_TRUE@ $(CLOCK_GETTIME_LINK)
@NATIVE_TRUE@edtest_SOURCES = edtest.c edtest2_build.c testlib.c
@NATIVE_TRUE@edtest_LDADD = libbacktrace.la
@HAVE_PTHREAD_TRUE@@NATIVE_TRUE@ttest_SOURCES = ttest.c testlib.c
@HAVE_PTHREAD_TRUE@@NATIVE_TRUE@ttest_CFLAGS = $(AM_CFLAGS) -pthread
@HAVE_PTHREAD_TRUE@@NATIVE_TRUE@ttest_LDADD = libbacktrace.la
@HAVE_COMPRESSED_DEBUG_TRUE@@NATIVE_TRUE@ctestg_SOURCES = btest.c testlib.c
@HAVE_COMPRESSED_DEBUG_TRUE@@NATIVE_TRUE@ctestg_CFLAGS = $(AM_CFLAGS) -g
@HAVE_COMPRESSED_DEBUG_TRUE@@NATIVE_TRUE@ctestg_LDFLAGS = -Wl,--compress-debug-sections=zlib-gnu
@HAVE_COMPRESSED_DEBUG_TRUE@@NATIVE_TRUE@ctestg_LDADD = libbacktrace.la
@HAVE_COMPRESSED_DEBUG_TRUE@@NATIVE_TRUE@ctesta_SOURCES = btest.c testlib.c
@HAVE_COMPRESSED_DEBUG_TRUE@@NATIVE_TRUE@ctesta_CFLAGS = $(AM_CFLAGS) -g
@HAVE_COMPRESSED_DEBUG_TRUE@@NATIVE_TRUE@ctesta_LDFLAGS = -Wl,--compress-debug-sections=zlib-gabi
@HAVE_COMPRESSED_DEBUG_TRUE@@NATIVE_TRUE@ctesta_LDADD = libbacktrace.la
all: config.h
$(MAKE) $(AM_MAKEFLAGS) all-am
......@@ -406,40 +477,17 @@ distclean-hdr:
-rm -f config.h stamp-h1
backtrace-supported.h: $(top_builddir)/config.status $(srcdir)/backtrace-supported.h.in
cd $(top_builddir) && $(SHELL) ./config.status $@
install-libLTLIBRARIES: $(lib_LTLIBRARIES)
@$(NORMAL_INSTALL)
@list='$(lib_LTLIBRARIES)'; test -n "$(libdir)" || list=; \
list2=; for p in $$list; do \
if test -f $$p; then \
list2="$$list2 $$p"; \
else :; fi; \
done; \
test -z "$$list2" || { \
echo " $(MKDIR_P) '$(DESTDIR)$(libdir)'"; \
$(MKDIR_P) "$(DESTDIR)$(libdir)" || exit 1; \
echo " $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 '$(DESTDIR)$(libdir)'"; \
$(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 "$(DESTDIR)$(libdir)"; \
}
uninstall-libLTLIBRARIES:
@$(NORMAL_UNINSTALL)
@list='$(lib_LTLIBRARIES)'; test -n "$(libdir)" || list=; \
for p in $$list; do \
$(am__strip_dir) \
echo " $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f '$(DESTDIR)$(libdir)/$$f'"; \
$(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f "$(DESTDIR)$(libdir)/$$f"; \
done
clean-libLTLIBRARIES:
-test -z "$(lib_LTLIBRARIES)" || rm -f $(lib_LTLIBRARIES)
@list='$(lib_LTLIBRARIES)'; for p in $$list; do \
clean-noinstLTLIBRARIES:
-test -z "$(noinst_LTLIBRARIES)" || rm -f $(noinst_LTLIBRARIES)
@list='$(noinst_LTLIBRARIES)'; for p in $$list; do \
dir="`echo $$p | sed -e 's|/[^/]*$$||'`"; \
test "$$dir" != "$$p" || dir=.; \
echo "rm -f \"$${dir}/so_locations\""; \
rm -f "$${dir}/so_locations"; \
done
libbacktrace.la: $(libbacktrace_la_OBJECTS) $(libbacktrace_la_DEPENDENCIES) $(EXTRA_libbacktrace_la_DEPENDENCIES)
$(LINK) -rpath $(libdir) $(libbacktrace_la_OBJECTS) $(libbacktrace_la_LIBADD) $(LIBS)
$(LINK) $(libbacktrace_la_OBJECTS) $(libbacktrace_la_LIBADD) $(LIBS)
clean-checkPROGRAMS:
@list='$(check_PROGRAMS)'; test -n "$$list" || exit 0; \
......@@ -452,9 +500,24 @@ clean-checkPROGRAMS:
btest$(EXEEXT): $(btest_OBJECTS) $(btest_DEPENDENCIES) $(EXTRA_btest_DEPENDENCIES)
@rm -f btest$(EXEEXT)
$(btest_LINK) $(btest_OBJECTS) $(btest_LDADD) $(LIBS)
ctesta$(EXEEXT): $(ctesta_OBJECTS) $(ctesta_DEPENDENCIES) $(EXTRA_ctesta_DEPENDENCIES)
@rm -f ctesta$(EXEEXT)
$(ctesta_LINK) $(ctesta_OBJECTS) $(ctesta_LDADD) $(LIBS)
ctestg$(EXEEXT): $(ctestg_OBJECTS) $(ctestg_DEPENDENCIES) $(EXTRA_ctestg_DEPENDENCIES)
@rm -f ctestg$(EXEEXT)
$(ctestg_LINK) $(ctestg_OBJECTS) $(ctestg_LDADD) $(LIBS)
edtest$(EXEEXT): $(edtest_OBJECTS) $(edtest_DEPENDENCIES) $(EXTRA_edtest_DEPENDENCIES)
@rm -f edtest$(EXEEXT)
$(LINK) $(edtest_OBJECTS) $(edtest_LDADD) $(LIBS)
stest$(EXEEXT): $(stest_OBJECTS) $(stest_DEPENDENCIES) $(EXTRA_stest_DEPENDENCIES)
@rm -f stest$(EXEEXT)
$(LINK) $(stest_OBJECTS) $(stest_LDADD) $(LIBS)
ttest$(EXEEXT): $(ttest_OBJECTS) $(ttest_DEPENDENCIES) $(EXTRA_ttest_DEPENDENCIES)
@rm -f ttest$(EXEEXT)
$(ttest_LINK) $(ttest_OBJECTS) $(ttest_LDADD) $(LIBS)
ztest$(EXEEXT): $(ztest_OBJECTS) $(ztest_DEPENDENCIES) $(EXTRA_ztest_DEPENDENCIES)
@rm -f ztest$(EXEEXT)
$(ztest_LINK) $(ztest_OBJECTS) $(ztest_LDADD) $(LIBS)
mostlyclean-compile:
-rm -f *.$(OBJEXT)
......@@ -477,6 +540,60 @@ btest-btest.o: btest.c
btest-btest.obj: btest.c
$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(btest_CFLAGS) $(CFLAGS) -c -o btest-btest.obj `if test -f 'btest.c'; then $(CYGPATH_W) 'btest.c'; else $(CYGPATH_W) '$(srcdir)/btest.c'; fi`
btest-testlib.o: testlib.c
$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(btest_CFLAGS) $(CFLAGS) -c -o btest-testlib.o `test -f 'testlib.c' || echo '$(srcdir)/'`testlib.c
btest-testlib.obj: testlib.c
$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(btest_CFLAGS) $(CFLAGS) -c -o btest-testlib.obj `if test -f 'testlib.c'; then $(CYGPATH_W) 'testlib.c'; else $(CYGPATH_W) '$(srcdir)/testlib.c'; fi`
ctesta-btest.o: btest.c
$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(ctesta_CFLAGS) $(CFLAGS) -c -o ctesta-btest.o `test -f 'btest.c' || echo '$(srcdir)/'`btest.c
ctesta-btest.obj: btest.c
$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(ctesta_CFLAGS) $(CFLAGS) -c -o ctesta-btest.obj `if test -f 'btest.c'; then $(CYGPATH_W) 'btest.c'; else $(CYGPATH_W) '$(srcdir)/btest.c'; fi`
ctesta-testlib.o: testlib.c
$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(ctesta_CFLAGS) $(CFLAGS) -c -o ctesta-testlib.o `test -f 'testlib.c' || echo '$(srcdir)/'`testlib.c
ctesta-testlib.obj: testlib.c
$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(ctesta_CFLAGS) $(CFLAGS) -c -o ctesta-testlib.obj `if test -f 'testlib.c'; then $(CYGPATH_W) 'testlib.c'; else $(CYGPATH_W) '$(srcdir)/testlib.c'; fi`
ctestg-btest.o: btest.c
$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(ctestg_CFLAGS) $(CFLAGS) -c -o ctestg-btest.o `test -f 'btest.c' || echo '$(srcdir)/'`btest.c
ctestg-btest.obj: btest.c
$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(ctestg_CFLAGS) $(CFLAGS) -c -o ctestg-btest.obj `if test -f 'btest.c'; then $(CYGPATH_W) 'btest.c'; else $(CYGPATH_W) '$(srcdir)/btest.c'; fi`
ctestg-testlib.o: testlib.c
$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(ctestg_CFLAGS) $(CFLAGS) -c -o ctestg-testlib.o `test -f 'testlib.c' || echo '$(srcdir)/'`testlib.c
ctestg-testlib.obj: testlib.c
$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(ctestg_CFLAGS) $(CFLAGS) -c -o ctestg-testlib.obj `if test -f 'testlib.c'; then $(CYGPATH_W) 'testlib.c'; else $(CYGPATH_W) '$(srcdir)/testlib.c'; fi`
ttest-ttest.o: ttest.c
$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(ttest_CFLAGS) $(CFLAGS) -c -o ttest-ttest.o `test -f 'ttest.c' || echo '$(srcdir)/'`ttest.c
ttest-ttest.obj: ttest.c
$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(ttest_CFLAGS) $(CFLAGS) -c -o ttest-ttest.obj `if test -f 'ttest.c'; then $(CYGPATH_W) 'ttest.c'; else $(CYGPATH_W) '$(srcdir)/ttest.c'; fi`
ttest-testlib.o: testlib.c
$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(ttest_CFLAGS) $(CFLAGS) -c -o ttest-testlib.o `test -f 'testlib.c' || echo '$(srcdir)/'`testlib.c
ttest-testlib.obj: testlib.c
$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(ttest_CFLAGS) $(CFLAGS) -c -o ttest-testlib.obj `if test -f 'testlib.c'; then $(CYGPATH_W) 'testlib.c'; else $(CYGPATH_W) '$(srcdir)/testlib.c'; fi`
ztest-ztest.o: ztest.c
$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(ztest_CFLAGS) $(CFLAGS) -c -o ztest-ztest.o `test -f 'ztest.c' || echo '$(srcdir)/'`ztest.c
ztest-ztest.obj: ztest.c
$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(ztest_CFLAGS) $(CFLAGS) -c -o ztest-ztest.obj `if test -f 'ztest.c'; then $(CYGPATH_W) 'ztest.c'; else $(CYGPATH_W) '$(srcdir)/ztest.c'; fi`
ztest-testlib.o: testlib.c
$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(ztest_CFLAGS) $(CFLAGS) -c -o ztest-testlib.o `test -f 'testlib.c' || echo '$(srcdir)/'`testlib.c
ztest-testlib.obj: testlib.c
$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(ztest_CFLAGS) $(CFLAGS) -c -o ztest-testlib.obj `if test -f 'testlib.c'; then $(CYGPATH_W) 'testlib.c'; else $(CYGPATH_W) '$(srcdir)/testlib.c'; fi`
mostlyclean-libtool:
-rm -f *.lo
......@@ -674,7 +791,7 @@ check-am: all-am
check: check-am
all-am: Makefile $(LTLIBRARIES) all-multi $(HEADERS) config.h
installdirs:
for dir in "$(DESTDIR)$(libdir)" "$(DESTDIR)$(includedir)"; do \
for dir in "$(DESTDIR)$(includedir)"; do \
test -z "$$dir" || $(MKDIR_P) "$$dir"; \
done
install: install-am
......@@ -709,8 +826,8 @@ maintainer-clean-generic:
@echo "it deletes files that may require special tools to rebuild."
clean: clean-am clean-multi
clean-am: clean-checkPROGRAMS clean-generic clean-libLTLIBRARIES \
clean-libtool mostlyclean-am
clean-am: clean-checkPROGRAMS clean-generic clean-libtool \
clean-noinstLTLIBRARIES mostlyclean-am
distclean: distclean-am distclean-multi
-rm -f $(am__CONFIG_DISTCLEAN_FILES)
......@@ -736,7 +853,7 @@ install-dvi: install-dvi-am
install-dvi-am:
install-exec-am: install-libLTLIBRARIES install-multi
install-exec-am: install-multi
install-html: install-html-am
......@@ -777,29 +894,39 @@ ps: ps-am
ps-am:
uninstall-am: uninstall-includeHEADERS uninstall-libLTLIBRARIES
uninstall-am: uninstall-includeHEADERS
.MAKE: all all-multi check-am clean-multi distclean-multi install-am \
install-multi install-strip maintainer-clean-multi \
mostlyclean-multi
.PHONY: CTAGS GTAGS all all-am all-multi am--refresh check check-TESTS \
check-am clean clean-checkPROGRAMS clean-generic \
clean-libLTLIBRARIES clean-libtool clean-multi ctags distclean \
check-am clean clean-checkPROGRAMS clean-generic clean-libtool \
clean-multi clean-noinstLTLIBRARIES ctags distclean \
distclean-compile distclean-generic distclean-hdr \
distclean-libtool distclean-multi distclean-tags dvi dvi-am \
html html-am info info-am install install-am install-data \
install-data-am install-dvi install-dvi-am install-exec \
install-exec-am install-html install-html-am \
install-includeHEADERS install-info install-info-am \
install-libLTLIBRARIES install-man install-multi install-pdf \
install-pdf-am install-ps install-ps-am install-strip \
installcheck installcheck-am installdirs maintainer-clean \
install-man install-multi install-pdf install-pdf-am \
install-ps install-ps-am install-strip installcheck \
installcheck-am installdirs maintainer-clean \
maintainer-clean-generic maintainer-clean-multi mostlyclean \
mostlyclean-compile mostlyclean-generic mostlyclean-libtool \
mostlyclean-multi pdf pdf-am ps ps-am tags uninstall \
uninstall-am uninstall-includeHEADERS uninstall-libLTLIBRARIES
uninstall-am uninstall-includeHEADERS
@NATIVE_TRUE@edtest2_build.c: gen_edtest2_build; @true
@NATIVE_TRUE@gen_edtest2_build: $(srcdir)/edtest2.c
@NATIVE_TRUE@ cat $(srcdir)/edtest2.c > tmp-edtest2_build.c
@NATIVE_TRUE@ $(SHELL) $(srcdir)/move-if-change tmp-edtest2_build.c edtest2_build.c
@NATIVE_TRUE@ echo timestamp > $@
@HAVE_OBJCOPY_DEBUGLINK_TRUE@@NATIVE_TRUE@dtest: btest
@HAVE_OBJCOPY_DEBUGLINK_TRUE@@NATIVE_TRUE@ $(OBJCOPY) --only-keep-debug btest btest.debug
@HAVE_OBJCOPY_DEBUGLINK_TRUE@@NATIVE_TRUE@ $(OBJCOPY) --strip-debug --add-gnu-debuglink=btest.debug btest dtest
# We can't use automake's automatic dependency tracking, because it
# breaks when using bootstrap-lean. Automatic dependency tracking
......@@ -815,8 +942,8 @@ uninstall-am: uninstall-includeHEADERS uninstall-libLTLIBRARIES
alloc.lo: config.h backtrace.h internal.h
backtrace.lo: config.h backtrace.h internal.h
btest.lo: backtrace.h backtrace-supported.h
dwarf.lo: config.h backtrace.h internal.h
btest.lo: backtrace.h backtrace-supported.h filenames.h
dwarf.lo: config.h filenames.h backtrace.h internal.h
elf.lo: config.h backtrace.h internal.h
fileline.lo: config.h backtrace.h internal.h
mmap.lo: config.h backtrace.h internal.h
......@@ -831,6 +958,7 @@ sort.lo: config.h backtrace.h internal.h
stest.lo: config.h backtrace.h internal.h
state.lo: config.h backtrace.h backtrace-supported.h internal.h
unknown.lo: config.h backtrace.h internal.h
xcoff.lo: config.h backtrace.h internal.h
# Tell versions [3.59,3.63) of GNU make to not export all variables.
# Otherwise a system limit (for SysV at least) may be exceeded.
......
acinclude.m4
......@@ -69,3 +69,4 @@ CFLAGS="$save_CFLAGS"
m4_popdef([acx_Var])dnl
AC_LANG_POP(C)
])# ACX_PROG_CC_WARNING_OPTS
aclocal.m4
This source diff could not be displayed because it is too large. You can view the blob instead.
alloc.c
/* alloc.c -- Memory allocation without mmap.
Copyright (C) 2012-2016 Free Software Foundation, Inc.
Copyright (C) 2012-2018 Free Software Foundation, Inc.
Written by Ian Lance Taylor, Google.
Redistribution and use in source and binary forms, with or without
......
atomic.c
/* atomic.c -- Support for atomic functions if not present.
Copyright (C) 2013-2016 Free Software Foundation, Inc.
Copyright (C) 2013-2018 Free Software Foundation, Inc.
Written by Ian Lance Taylor, Google.
Redistribution and use in source and binary forms, with or without
......
backtrace.c
/* backtrace.c -- Entry point for stack backtrace library.
Copyright (C) 2012-2016 Free Software Foundation, Inc.
Copyright (C) 2012-2018 Free Software Foundation, Inc.
Written by Ian Lance Taylor, Google.
Redistribution and use in source and binary forms, with or without
......
backtrace.h
/* backtrace.h -- Public header file for stack backtrace library.
Copyright (C) 2012-2016 Free Software Foundation, Inc.
Copyright (C) 2012-2018 Free Software Foundation, Inc.
Written by Ian Lance Taylor, Google.
Redistribution and use in source and binary forms, with or without
......
btest.c
/* btest.c -- Test for libbacktrace library
Copyright (C) 2012-2016 Free Software Foundation, Inc.
Copyright (C) 2012-2018 Free Software Foundation, Inc.
Written by Ian Lance Taylor, Google.
Redistribution and use in source and binary forms, with or without
......@@ -38,246 +38,12 @@ POSSIBILITY OF SUCH DAMAGE. */
#include <stdlib.h>
#include <string.h>
#include "filenames.h"
#include "backtrace.h"
#include "backtrace-supported.h"
/* Portable attribute syntax. Actually some of these tests probably
won't work if the attributes are not recognized. */
#ifndef GCC_VERSION
# define GCC_VERSION (__GNUC__ * 1000 + __GNUC_MINOR__)
#endif
#if (GCC_VERSION < 2007)
# define __attribute__(x)
#endif
#ifndef ATTRIBUTE_UNUSED
# define ATTRIBUTE_UNUSED __attribute__ ((__unused__))
#endif
#if defined(__MSDOS__) || defined(_WIN32) || defined(__OS2__) || defined (__CYGWIN__)
# define IS_DIR_SEPARATOR(c) ((c) == '/' || (c) == '\\')
#else
# define IS_DIR_SEPARATOR(c) ((c) == '/')
#endif
/* Used to collect backtrace info. */
struct info
{
char *filename;
int lineno;
char *function;
};
/* Passed to backtrace callback function. */
struct bdata
{
struct info *all;
size_t index;
size_t max;
int failed;
};
/* Passed to backtrace_simple callback function. */
struct sdata
{
uintptr_t *addrs;
size_t index;
size_t max;
int failed;
};
/* Passed to backtrace_syminfo callback function. */
struct symdata
{
const char *name;
uintptr_t val, size;
int failed;
};
/* The backtrace state. */
static void *state;
/* The number of failures. */
static int failures;
/* Return the base name in a path. */
static const char *
base (const char *p)
{
const char *last;
const char *s;
last = NULL;
for (s = p; *s != '\0'; ++s)
{
if (IS_DIR_SEPARATOR (*s))
last = s + 1;
}
return last != NULL ? last : p;
}
/* Check an entry in a struct info array. */
static void
check (const char *name, int index, const struct info *all, int want_lineno,
const char *want_function, int *failed)
{
if (*failed)
return;
if (all[index].filename == NULL || all[index].function == NULL)
{
fprintf (stderr, "%s: [%d]: missing file name or function name\n",
name, index);
*failed = 1;
return;
}
if (strcmp (base (all[index].filename), "btest.c") != 0)
{
fprintf (stderr, "%s: [%d]: got %s expected test.c\n", name, index,
all[index].filename);
*failed = 1;
}
if (all[index].lineno != want_lineno)
{
fprintf (stderr, "%s: [%d]: got %d expected %d\n", name, index,
all[index].lineno, want_lineno);
*failed = 1;
}
if (strcmp (all[index].function, want_function) != 0)
{
fprintf (stderr, "%s: [%d]: got %s expected %s\n", name, index,
all[index].function, want_function);
*failed = 1;
}
}
/* The backtrace callback function. */
static int
callback_one (void *vdata, uintptr_t pc ATTRIBUTE_UNUSED,
const char *filename, int lineno, const char *function)
{
struct bdata *data = (struct bdata *) vdata;
struct info *p;
if (data->index >= data->max)
{
fprintf (stderr, "callback_one: callback called too many times\n");
data->failed = 1;
return 1;
}
p = &data->all[data->index];
if (filename == NULL)
p->filename = NULL;
else
{
p->filename = strdup (filename);
assert (p->filename != NULL);
}
p->lineno = lineno;
if (function == NULL)
p->function = NULL;
else
{
p->function = strdup (function);
assert (p->function != NULL);
}
++data->index;
return 0;
}
/* An error callback passed to backtrace. */
static void
error_callback_one (void *vdata, const char *msg, int errnum)
{
struct bdata *data = (struct bdata *) vdata;
fprintf (stderr, "%s", msg);
if (errnum > 0)
fprintf (stderr, ": %s", strerror (errnum));
fprintf (stderr, "\n");
data->failed = 1;
}
/* The backtrace_simple callback function. */
static int
callback_two (void *vdata, uintptr_t pc)
{
struct sdata *data = (struct sdata *) vdata;
if (data->index >= data->max)
{
fprintf (stderr, "callback_two: callback called too many times\n");
data->failed = 1;
return 1;
}
data->addrs[data->index] = pc;
++data->index;
return 0;
}
/* An error callback passed to backtrace_simple. */
static void
error_callback_two (void *vdata, const char *msg, int errnum)
{
struct sdata *data = (struct sdata *) vdata;
fprintf (stderr, "%s", msg);
if (errnum > 0)
fprintf (stderr, ": %s", strerror (errnum));
fprintf (stderr, "\n");
data->failed = 1;
}
/* The backtrace_syminfo callback function. */
static void
callback_three (void *vdata, uintptr_t pc ATTRIBUTE_UNUSED,
const char *symname, uintptr_t symval,
uintptr_t symsize)
{
struct symdata *data = (struct symdata *) vdata;
if (symname == NULL)
data->name = NULL;
else
{
data->name = strdup (symname);
assert (data->name != NULL);
}
data->val = symval;
data->size = symsize;
}
/* The backtrace_syminfo error callback function. */
static void
error_callback_three (void *vdata, const char *msg, int errnum)
{
struct symdata *data = (struct symdata *) vdata;
fprintf (stderr, "%s", msg);
if (errnum > 0)
fprintf (stderr, ": %s", strerror (errnum));
fprintf (stderr, "\n");
data->failed = 1;
}
#include "testlib.h"
/* Test the backtrace function with non-inlined functions. */
......@@ -329,9 +95,9 @@ f3 (int f1line, int f2line)
data.failed = 1;
}
check ("test1", 0, all, f3line, "f3", &data.failed);
check ("test1", 1, all, f2line, "f2", &data.failed);
check ("test1", 2, all, f1line, "test1", &data.failed);
check ("test1", 0, all, f3line, "f3", "btest.c", &data.failed);
check ("test1", 1, all, f2line, "f2", "btest.c", &data.failed);
check ("test1", 2, all, f1line, "test1", "btest.c", &data.failed);
printf ("%s: backtrace_full noinline\n", data.failed ? "FAIL" : "PASS");
......@@ -381,9 +147,9 @@ f13 (int f1line, int f2line)
data.failed = 1;
}
check ("test2", 0, all, f3line, "f13", &data.failed);
check ("test2", 1, all, f2line, "f12", &data.failed);
check ("test2", 2, all, f1line, "test2", &data.failed);
check ("test2", 0, all, f3line, "f13", "btest.c", &data.failed);
check ("test2", 1, all, f2line, "f12", "btest.c", &data.failed);
check ("test2", 2, all, f1line, "test2", "btest.c", &data.failed);
printf ("%s: backtrace_full inline\n", data.failed ? "FAIL" : "PASS");
......@@ -466,9 +232,9 @@ f23 (int f1line, int f2line)
}
}
check ("test3", 0, all, f3line, "f23", &bdata.failed);
check ("test3", 1, all, f2line, "f22", &bdata.failed);
check ("test3", 2, all, f1line, "test3", &bdata.failed);
check ("test3", 0, all, f3line, "f23", "btest.c", &bdata.failed);
check ("test3", 1, all, f2line, "f22", "btest.c", &bdata.failed);
check ("test3", 2, all, f1line, "test3", "btest.c", &bdata.failed);
if (bdata.failed)
data.failed = 1;
......@@ -604,9 +370,9 @@ f33 (int f1line, int f2line)
bdata.failed = 1;
}
check ("test4", 0, all, f3line, "f33", &bdata.failed);
check ("test4", 1, all, f2line, "f32", &bdata.failed);
check ("test4", 2, all, f1line, "test4", &bdata.failed);
check ("test4", 0, all, f3line, "f33", "btest.c", &bdata.failed);
check ("test4", 1, all, f2line, "f32", "btest.c", &bdata.failed);
check ("test4", 2, all, f1line, "test4", "btest.c", &bdata.failed);
if (bdata.failed)
data.failed = 1;
......@@ -620,7 +386,7 @@ f33 (int f1line, int f2line)
return failures;
}
#if BACKTRACE_SUPPORTS_DATA
static int test5 (void) __attribute__ ((unused));
int global = 1;
......@@ -690,19 +456,6 @@ test5 (void)
return failures;
}
#endif /* BACKTRACE_SUPPORTS_DATA */
static void
error_callback_create (void *data ATTRIBUTE_UNUSED, const char *msg,
int errnum)
{
fprintf (stderr, "%s", msg);
if (errnum > 0)
fprintf (stderr, ": %s", strerror (errnum));
fprintf (stderr, "\n");
exit (EXIT_FAILURE);
}
/* Run all the tests. */
int
......
configure
This source diff could not be displayed because it is too large. You can view the blob instead.
configure.ac
# configure.ac -- Backtrace configure script.
# Copyright (C) 2012-2016 Free Software Foundation, Inc.
# Copyright (C) 2012-2018 Free Software Foundation, Inc.
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are
......@@ -83,6 +83,8 @@ esac
LT_INIT
AM_PROG_LIBTOOL
AC_SYS_LARGEFILE
backtrace_supported=yes
if test -n "${with_target_subdir}"; then
......@@ -232,6 +234,9 @@ elf*) FORMAT_FILE="elf.lo" ;;
pecoff) FORMAT_FILE="pecoff.lo"
backtrace_supports_data=no
;;
xcoff*) FORMAT_FILE="xcoff.lo"
backtrace_supports_data=no
;;
*) AC_MSG_WARN([could not determine output file type])
FORMAT_FILE="unknown.lo"
backtrace_supported=no
......@@ -248,6 +253,15 @@ elf64) elfsize=64 ;;
esac
AC_DEFINE_UNQUOTED([BACKTRACE_ELF_SIZE], [$elfsize], [ELF size: 32 or 64])
# XCOFF defines.
xcoffsize=
case "$libbacktrace_cv_sys_filetype" in
xcoff32) xcoffsize=32 ;;
xcoff64) xcoffsize=64 ;;
*) xcoffsize=unused
esac
AC_DEFINE_UNQUOTED([BACKTRACE_XCOFF_SIZE], [$xcoffsize], [XCOFF size: 32 or 64])
BACKTRACE_SUPPORTED=0
if test "$backtrace_supported" = "yes"; then
BACKTRACE_SUPPORTED=1
......@@ -324,6 +338,24 @@ if test "$have_dl_iterate_phdr" = "yes"; then
AC_DEFINE(HAVE_DL_ITERATE_PHDR, 1, [Define if dl_iterate_phdr is available.])
fi
# Check for loadquery.
AC_CHECK_HEADERS(sys/ldr.h)
if test "$ac_cv_header_sys_ldr_h" = "no"; then
have_loadquery=no
else
if test -n "${with_target_subdir}"; then
# When built as a GCC target library, we can't do a link test.
AC_EGREP_HEADER([loadquery], [sys/ldr.h], [have_loadquery=yes],
[have_loadquery=no])
else
AC_CHECK_FUNC([loadquery], [have_loadquery=yes],
[have_loadquery=no])
fi
fi
if test "$have_loadquery" = "yes"; then
AC_DEFINE(HAVE_LOADQUERY, 1, [Define if AIX loadquery is available.])
fi
# Check for the fcntl function.
if test -n "${with_target_subdir}"; then
case "${host}" in
......@@ -340,6 +372,7 @@ if test "$have_fcntl" = "yes"; then
fi
AC_CHECK_DECLS(strnlen)
AC_CHECK_FUNCS(lstat readlink)
# Check for getexecname function.
if test -n "${with_target_subdir}"; then
......@@ -354,6 +387,69 @@ if test "$have_getexecname" = "yes"; then
AC_DEFINE(HAVE_GETEXECNAME, 1, [Define if getexecname is available.])
fi
# Check for the clock_gettime function.
AC_CHECK_FUNCS(clock_gettime)
clock_gettime_link=
# At least for glibc, clock_gettime is in librt. But don't
# pull that in if it still doesn't give us the function we want. This
# test is copied from libgomp, and modified to not link in -lrt as
# we're using this for test timing only.
if test "$ac_cv_func_clock_gettime" = no; then
AC_CHECK_LIB(rt, clock_gettime,
[CLOCK_GETTIME_LINK=-lrt
AC_DEFINE(HAVE_CLOCK_GETTIME, 1,
[Define to 1 if you have the `clock_gettime' function.])])
fi
AC_SUBST(CLOCK_GETTIME_LINK)
dnl Test whether the compiler supports the -pthread option.
AC_CACHE_CHECK([whether -pthread is supported],
[libgo_cv_lib_pthread],
[CFLAGS_hold=$CFLAGS
CFLAGS="$CFLAGS -pthread"
AC_COMPILE_IFELSE([[int i;]],
[libgo_cv_lib_pthread=yes],
[libgo_cv_lib_pthread=no])
CFLAGS=$CFLAGS_hold])
PTHREAD_CFLAGS=
if test "$libgo_cv_lib_pthread" = yes; then
PTHREAD_CFLAGS=-pthread
fi
AC_SUBST(PTHREAD_CFLAGS)
AM_CONDITIONAL(HAVE_PTHREAD, test "$libgo_cv_lib_pthread" = yes)
AC_CHECK_LIB([z], [compress], [])
if test $ac_cv_lib_z_compress = "yes"; then
AC_DEFINE(HAVE_ZLIB, 1, [Define if -lz is available.])
fi
AM_CONDITIONAL(HAVE_ZLIB, test "$ac_cv_lib_z_compress" = yes)
dnl Test whether the linker supports the --compress_debug_sections option.
AC_CACHE_CHECK([whether --compress-debug-sections is supported],
[libgo_cv_ld_compress],
[LDFLAGS_hold=$LDFLAGS
LDFLAGS="$LDFLAGS -Wl,--compress-debug-sections=zlib-gnu"
AC_LINK_IFELSE([AC_LANG_PROGRAM(,)],
[libgo_cv_ld_compress=yes],
[libgo_cv_ld_compress=no])
LDFLAGS=$LDFLAGS_hold])
AM_CONDITIONAL(HAVE_COMPRESSED_DEBUG, test "$libgo_cv_ld_compress" = yes)
AC_ARG_VAR(OBJCOPY, [location of objcopy])
AC_CHECK_PROG(OBJCOPY, objcopy, objcopy,)
AC_CACHE_CHECK([whether objcopy supports debuglink],
[libbacktrace_cv_objcopy_debuglink],
[if test -n "${with_target_subdir}"; then
libbacktrace_cv_objcopy_debuglink=no
elif ${OBJCOPY} --add-gnu-debuglink=x /bin/ls /tmp/ls$$; then
rm -f /tmp/ls$$
libbacktrace_cv_objcopy_debuglink=yes
else
libbacktrace_cv_objcopy_debuglink=no
fi])
AM_CONDITIONAL(HAVE_OBJCOPY_DEBUGLINK, test "$libbacktrace_cv_objcopy_debuglink" = yes)
AC_CACHE_CHECK([whether tests can run],
[libbacktrace_cv_sys_native],
[AC_RUN_IFELSE([AC_LANG_PROGRAM([], [return 0;])],
......
dwarf.c
/* dwarf.c -- Get file/line information from DWARF for backtraces.
Copyright (C) 2012-2016 Free Software Foundation, Inc.
Copyright (C) 2012-2018 Free Software Foundation, Inc.
Written by Ian Lance Taylor, Google.
Redistribution and use in source and binary forms, with or without
......@@ -1648,16 +1648,15 @@ add_line (struct backtrace_state *state, struct dwarf_data *ddata,
return 1;
}
/* Free the line header information. If FREE_FILENAMES is true we
free the file names themselves, otherwise we leave them, as there
may be line structures pointing to them. */
/* Free the line header information. */
static void
free_line_header (struct backtrace_state *state, struct line_header *hdr,
backtrace_error_callback error_callback, void *data)
{
backtrace_free (state, hdr->dirs, hdr->dirs_count * sizeof (const char *),
error_callback, data);
if (hdr->dirs_count != 0)
backtrace_free (state, hdr->dirs, hdr->dirs_count * sizeof (const char *),
error_callback, data);
backtrace_free (state, hdr->filenames,
hdr->filenames_count * sizeof (char *),
error_callback, data);
......@@ -1718,12 +1717,16 @@ read_line_header (struct backtrace_state *state, struct unit *u,
++hdr->dirs_count;
}
hdr->dirs = ((const char **)
backtrace_alloc (state,
hdr->dirs_count * sizeof (const char *),
line_buf->error_callback, line_buf->data));
if (hdr->dirs == NULL)
return 0;
hdr->dirs = NULL;
if (hdr->dirs_count != 0)
{
hdr->dirs = ((const char **)
backtrace_alloc (state,
hdr->dirs_count * sizeof (const char *),
line_buf->error_callback, line_buf->data));
if (hdr->dirs == NULL)
return 0;
}
i = 0;
while (*hdr_buf.buf != '\0')
......
edtest.c 0 → 100644
/* edtest.c -- Test for libbacktrace storage allocation stress handling
Copyright (C) 2017-2018 Free Software Foundation, Inc.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
(1) Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
(2) Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in
the documentation and/or other materials provided with the
distribution.
(3) The name of the author may not be used to
endorse or promote products derived from this software without
specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT,
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE. */
#include "config.h"
#include <assert.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/types.h>
#include "backtrace.h"
#include "backtrace-supported.h"
#include "internal.h"
#include "testlib.h"
static int test1 (void) __attribute__ ((noinline, unused));
static int test1 (void) __attribute__ ((noinline, unused));
extern int f2 (int);
extern int f3 (int, int);
static int
test1 (void)
{
/* Returning a value here and elsewhere avoids a tailcall which
would mess up the backtrace. */
return f2 (__LINE__) + 1;
}
int
f3 (int f1line, int f2line)
{
struct info all[20];
struct bdata data;
int f3line;
int i;
data.all = &all[0];
data.index = 0;
data.max = 20;
data.failed = 0;
f3line = __LINE__ + 1;
i = backtrace_full (state, 0, callback_one, error_callback_one, &data);
if (i != 0)
{
fprintf (stderr, "test1: unexpected return value %d\n", i);
data.failed = 1;
}
if (data.index < 3)
{
fprintf (stderr,
"test1: not enough frames; got %zu, expected at least 3\n",
data.index);
data.failed = 1;
}
check ("test1", 0, all, f3line, "f3", "edtest.c", &data.failed);
check ("test1", 1, all, f2line, "f2", "edtest2_build.c", &data.failed);
check ("test1", 2, all, f1line, "test1", "edtest.c", &data.failed);
printf ("%s: backtrace_full alloc stress\n", data.failed ? "FAIL" : "PASS");
if (data.failed)
++failures;
return failures;
}
int
main (int argc ATTRIBUTE_UNUSED, char **argv ATTRIBUTE_UNUSED)
{
state = backtrace_create_state (argv[0], BACKTRACE_SUPPORTS_THREADS,
error_callback_create, NULL);
// Grab the storage allocation lock prior to doing anything interesting.
// The intent here is to insure that the backtrace_alloc code is forced
// to always call mmap() for new memory as opposed to reusing previously
// allocated memory from the free list. Doing things this way helps
// simulate what you might see in a multithreaded program in which there
// are racing calls to the allocator.
struct backtrace_state *state_internal =
(struct backtrace_state *) state;
state_internal->lock_alloc = 1;
// Kick off the test
test1();
exit (failures > 0 ? EXIT_FAILURE : EXIT_SUCCESS);
}
edtest2.c 0 → 100644
/* edtest2.c -- Test for libbacktrace storage allocation stress handling (p2)
Copyright (C) 2017-2018 Free Software Foundation, Inc.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
(1) Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
(2) Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in
the documentation and/or other materials provided with the
distribution.
(3) The name of the author may not be used to
endorse or promote products derived from this software without
specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT,
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE. */
/* This file intentionally written without any #include's
*/
extern int f3(int, int);
extern int f2(int);
int f2(int x)
{
/* Returning a value here and elsewhere avoids a tailcall which
would mess up the backtrace. */
return f3(x, __LINE__) + 3;
}
elf.c
/* elf.c -- Get debug data from an ELF file for backtraces.
Copyright (C) 2012-2016 Free Software Foundation, Inc.
Copyright (C) 2012-2018 Free Software Foundation, Inc.
Written by Ian Lance Taylor, Google.
Redistribution and use in source and binary forms, with or without
......@@ -32,9 +32,12 @@ POSSIBILITY OF SUCH DAMAGE. */
#include "config.h"
#include <errno.h>
#include <stdlib.h>
#include <string.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <unistd.h>
#ifdef HAVE_DL_ITERATE_PHDR
#include <link.h>
......@@ -43,6 +46,71 @@ POSSIBILITY OF SUCH DAMAGE. */
#include "backtrace.h"
#include "internal.h"
#ifndef S_ISLNK
#ifndef S_IFLNK
#define S_IFLNK 0120000
#endif
#ifndef S_IFMT
#define S_IFMT 0170000
#endif
#define S_ISLNK(m) (((m) & S_IFMT) == S_IFLNK)
#endif
#ifndef __GNUC__
#define __builtin_prefetch(p, r, l)
#define unlikely(x) (x)
#else
#define unlikely(x) __builtin_expect(!!(x), 0)
#endif
#if !defined(HAVE_DECL_STRNLEN) || !HAVE_DECL_STRNLEN
/* If strnlen is not declared, provide our own version. */
static size_t
xstrnlen (const char *s, size_t maxlen)
{
size_t i;
for (i = 0; i < maxlen; ++i)
if (s[i] == '\0')
break;
return i;
}
#define strnlen xstrnlen
#endif
#ifndef HAVE_LSTAT
/* Dummy version of lstat for systems that don't have it. */
static int
xlstat (const char *path ATTRIBUTE_UNUSED, struct stat *st ATTRIBUTE_UNUSED)
{
return -1;
}
#define lstat xlstat
#endif
#ifndef HAVE_READLINK
/* Dummy version of readlink for systems that don't have it. */
static ssize_t
xreadlink (const char *path ATTRIBUTE_UNUSED, char *buf ATTRIBUTE_UNUSED,
size_t bufsz ATTRIBUTE_UNUSED)
{
return -1;
}
#define readlink xreadlink
#endif
#ifndef HAVE_DL_ITERATE_PHDR
/* Dummy version of dl_iterate_phdr for systems that don't have it. */
......@@ -70,7 +138,7 @@ dl_iterate_phdr (int (*callback) (struct dl_phdr_info *,
ELF. We could make this code test and support either possibility,
but there is no point. This code only works for the currently
running executable, which means that we know the ELF mode at
configure mode. */
configure time. */
#if BACKTRACE_ELF_SIZE != 32 && BACKTRACE_ELF_SIZE != 64
#error "Unknown BACKTRACE_ELF_SIZE"
......@@ -103,8 +171,11 @@ dl_iterate_phdr (int (*callback) (struct dl_phdr_info *,
#undef SHT_SYMTAB
#undef SHT_STRTAB
#undef SHT_DYNSYM
#undef SHF_COMPRESSED
#undef STT_OBJECT
#undef STT_FUNC
#undef NT_GNU_BUILD_ID
#undef ELFCOMPRESS_ZLIB
/* Basic types. */
......@@ -195,6 +266,8 @@ typedef struct {
#define SHT_STRTAB 3
#define SHT_DYNSYM 11
#define SHF_COMPRESSED 0x800
#if BACKTRACE_ELF_SIZE == 32
typedef struct
......@@ -224,6 +297,39 @@ typedef struct
#define STT_OBJECT 1
#define STT_FUNC 2
typedef struct
{
uint32_t namesz;
uint32_t descsz;
uint32_t type;
char name[1];
} b_elf_note;
#define NT_GNU_BUILD_ID 3
#if BACKTRACE_ELF_SIZE == 32
typedef struct
{
b_elf_word ch_type; /* Compresstion algorithm */
b_elf_word ch_size; /* Uncompressed size */
b_elf_word ch_addralign; /* Alignment for uncompressed data */
} b_elf_chdr; /* Elf_Chdr */
#else /* BACKTRACE_ELF_SIZE != 32 */
typedef struct
{
b_elf_word ch_type; /* Compression algorithm */
b_elf_word ch_reserved; /* Reserved */
b_elf_xword ch_size; /* Uncompressed size */
b_elf_xword ch_addralign; /* Alignment for uncompressed data */
} b_elf_chdr; /* Elf_Chdr */
#endif /* BACKTRACE_ELF_SIZE != 32 */
#define ELFCOMPRESS_ZLIB 1
/* An index of ELF sections we care about. */
enum debug_section
......@@ -233,6 +339,15 @@ enum debug_section
DEBUG_ABBREV,
DEBUG_RANGES,
DEBUG_STR,
/* The old style compressed sections. This list must correspond to
the list of normal debug sections. */
ZDEBUG_INFO,
ZDEBUG_LINE,
ZDEBUG_ABBREV,
ZDEBUG_RANGES,
ZDEBUG_STR,
DEBUG_MAX
};
......@@ -244,7 +359,12 @@ static const char * const debug_section_names[DEBUG_MAX] =
".debug_line",
".debug_abbrev",
".debug_ranges",
".debug_str"
".debug_str",
".zdebug_info",
".zdebug_line",
".zdebug_abbrev",
".zdebug_ranges",
".zdebug_str"
};
/* Information we gather for the sections we care about. */
......@@ -257,6 +377,8 @@ struct debug_section_info
size_t size;
/* Section contents, after read from file. */
const unsigned char *data;
/* Whether the SHF_COMPRESSED flag is set for the section. */
int compressed;
};
/* Information we keep for an ELF symbol. */
......@@ -283,6 +405,102 @@ struct elf_syminfo_data
size_t count;
};
/* Compute the CRC-32 of BUF/LEN. This uses the CRC used for
.gnu_debuglink files. */
static uint32_t
elf_crc32 (uint32_t crc, const unsigned char *buf, size_t len)
{
static const uint32_t crc32_table[256] =
{
0x00000000, 0x77073096, 0xee0e612c, 0x990951ba, 0x076dc419,
0x706af48f, 0xe963a535, 0x9e6495a3, 0x0edb8832, 0x79dcb8a4,
0xe0d5e91e, 0x97d2d988, 0x09b64c2b, 0x7eb17cbd, 0xe7b82d07,
0x90bf1d91, 0x1db71064, 0x6ab020f2, 0xf3b97148, 0x84be41de,
0x1adad47d, 0x6ddde4eb, 0xf4d4b551, 0x83d385c7, 0x136c9856,
0x646ba8c0, 0xfd62f97a, 0x8a65c9ec, 0x14015c4f, 0x63066cd9,
0xfa0f3d63, 0x8d080df5, 0x3b6e20c8, 0x4c69105e, 0xd56041e4,
0xa2677172, 0x3c03e4d1, 0x4b04d447, 0xd20d85fd, 0xa50ab56b,
0x35b5a8fa, 0x42b2986c, 0xdbbbc9d6, 0xacbcf940, 0x32d86ce3,
0x45df5c75, 0xdcd60dcf, 0xabd13d59, 0x26d930ac, 0x51de003a,
0xc8d75180, 0xbfd06116, 0x21b4f4b5, 0x56b3c423, 0xcfba9599,
0xb8bda50f, 0x2802b89e, 0x5f058808, 0xc60cd9b2, 0xb10be924,
0x2f6f7c87, 0x58684c11, 0xc1611dab, 0xb6662d3d, 0x76dc4190,
0x01db7106, 0x98d220bc, 0xefd5102a, 0x71b18589, 0x06b6b51f,
0x9fbfe4a5, 0xe8b8d433, 0x7807c9a2, 0x0f00f934, 0x9609a88e,
0xe10e9818, 0x7f6a0dbb, 0x086d3d2d, 0x91646c97, 0xe6635c01,
0x6b6b51f4, 0x1c6c6162, 0x856530d8, 0xf262004e, 0x6c0695ed,
0x1b01a57b, 0x8208f4c1, 0xf50fc457, 0x65b0d9c6, 0x12b7e950,
0x8bbeb8ea, 0xfcb9887c, 0x62dd1ddf, 0x15da2d49, 0x8cd37cf3,
0xfbd44c65, 0x4db26158, 0x3ab551ce, 0xa3bc0074, 0xd4bb30e2,
0x4adfa541, 0x3dd895d7, 0xa4d1c46d, 0xd3d6f4fb, 0x4369e96a,
0x346ed9fc, 0xad678846, 0xda60b8d0, 0x44042d73, 0x33031de5,
0xaa0a4c5f, 0xdd0d7cc9, 0x5005713c, 0x270241aa, 0xbe0b1010,
0xc90c2086, 0x5768b525, 0x206f85b3, 0xb966d409, 0xce61e49f,
0x5edef90e, 0x29d9c998, 0xb0d09822, 0xc7d7a8b4, 0x59b33d17,
0x2eb40d81, 0xb7bd5c3b, 0xc0ba6cad, 0xedb88320, 0x9abfb3b6,
0x03b6e20c, 0x74b1d29a, 0xead54739, 0x9dd277af, 0x04db2615,
0x73dc1683, 0xe3630b12, 0x94643b84, 0x0d6d6a3e, 0x7a6a5aa8,
0xe40ecf0b, 0x9309ff9d, 0x0a00ae27, 0x7d079eb1, 0xf00f9344,
0x8708a3d2, 0x1e01f268, 0x6906c2fe, 0xf762575d, 0x806567cb,
0x196c3671, 0x6e6b06e7, 0xfed41b76, 0x89d32be0, 0x10da7a5a,
0x67dd4acc, 0xf9b9df6f, 0x8ebeeff9, 0x17b7be43, 0x60b08ed5,
0xd6d6a3e8, 0xa1d1937e, 0x38d8c2c4, 0x4fdff252, 0xd1bb67f1,
0xa6bc5767, 0x3fb506dd, 0x48b2364b, 0xd80d2bda, 0xaf0a1b4c,
0x36034af6, 0x41047a60, 0xdf60efc3, 0xa867df55, 0x316e8eef,
0x4669be79, 0xcb61b38c, 0xbc66831a, 0x256fd2a0, 0x5268e236,
0xcc0c7795, 0xbb0b4703, 0x220216b9, 0x5505262f, 0xc5ba3bbe,
0xb2bd0b28, 0x2bb45a92, 0x5cb36a04, 0xc2d7ffa7, 0xb5d0cf31,
0x2cd99e8b, 0x5bdeae1d, 0x9b64c2b0, 0xec63f226, 0x756aa39c,
0x026d930a, 0x9c0906a9, 0xeb0e363f, 0x72076785, 0x05005713,
0x95bf4a82, 0xe2b87a14, 0x7bb12bae, 0x0cb61b38, 0x92d28e9b,
0xe5d5be0d, 0x7cdcefb7, 0x0bdbdf21, 0x86d3d2d4, 0xf1d4e242,
0x68ddb3f8, 0x1fda836e, 0x81be16cd, 0xf6b9265b, 0x6fb077e1,
0x18b74777, 0x88085ae6, 0xff0f6a70, 0x66063bca, 0x11010b5c,
0x8f659eff, 0xf862ae69, 0x616bffd3, 0x166ccf45, 0xa00ae278,
0xd70dd2ee, 0x4e048354, 0x3903b3c2, 0xa7672661, 0xd06016f7,
0x4969474d, 0x3e6e77db, 0xaed16a4a, 0xd9d65adc, 0x40df0b66,
0x37d83bf0, 0xa9bcae53, 0xdebb9ec5, 0x47b2cf7f, 0x30b5ffe9,
0xbdbdf21c, 0xcabac28a, 0x53b39330, 0x24b4a3a6, 0xbad03605,
0xcdd70693, 0x54de5729, 0x23d967bf, 0xb3667a2e, 0xc4614ab8,
0x5d681b02, 0x2a6f2b94, 0xb40bbe37, 0xc30c8ea1, 0x5a05df1b,
0x2d02ef8d
};
const unsigned char *end;
crc = ~crc;
for (end = buf + len; buf < end; ++ buf)
crc = crc32_table[(crc ^ *buf) & 0xff] ^ (crc >> 8);
return ~crc;
}
/* Return the CRC-32 of the entire file open at DESCRIPTOR. */
static uint32_t
elf_crc32_file (struct backtrace_state *state, int descriptor,
backtrace_error_callback error_callback, void *data)
{
struct stat st;
struct backtrace_view file_view;
uint32_t ret;
if (fstat (descriptor, &st) < 0)
{
error_callback (data, "fstat", errno);
return 0;
}
if (!backtrace_get_view (state, descriptor, 0, st.st_size, error_callback,
data, &file_view))
return 0;
ret = elf_crc32 (0, (const unsigned char *) file_view.data, st.st_size);
backtrace_release_view (state, &file_view, error_callback, data);
return ret;
}
/* A dummy callback function used when we can't find any debug info. */
static int
......@@ -510,208 +728,2073 @@ elf_syminfo (struct backtrace_state *state, uintptr_t addr,
callback (data, addr, sym->name, sym->address, sym->size);
}
/* Add the backtrace data for one ELF file. Returns 1 on success,
0 on failure (in both cases descriptor is closed) or -1 if exe
is non-zero and the ELF file is ET_DYN, which tells the caller that
elf_add will need to be called on the descriptor again after
base_address is determined. */
/* Return whether FILENAME is a symlink. */
static int
elf_add (struct backtrace_state *state, int descriptor, uintptr_t base_address,
backtrace_error_callback error_callback, void *data,
fileline *fileline_fn, int *found_sym, int *found_dwarf, int exe)
elf_is_symlink (const char *filename)
{
struct backtrace_view ehdr_view;
b_elf_ehdr ehdr;
off_t shoff;
unsigned int shnum;
unsigned int shstrndx;
struct backtrace_view shdrs_view;
int shdrs_view_valid;
const b_elf_shdr *shdrs;
const b_elf_shdr *shstrhdr;
size_t shstr_size;
off_t shstr_off;
struct backtrace_view names_view;
int names_view_valid;
const char *names;
unsigned int symtab_shndx;
unsigned int dynsym_shndx;
unsigned int i;
struct debug_section_info sections[DEBUG_MAX];
struct backtrace_view symtab_view;
int symtab_view_valid;
struct backtrace_view strtab_view;
int strtab_view_valid;
off_t min_offset;
off_t max_offset;
struct backtrace_view debug_view;
int debug_view_valid;
*found_sym = 0;
*found_dwarf = 0;
shdrs_view_valid = 0;
names_view_valid = 0;
symtab_view_valid = 0;
strtab_view_valid = 0;
debug_view_valid = 0;
struct stat st;
if (!backtrace_get_view (state, descriptor, 0, sizeof ehdr, error_callback,
data, &ehdr_view))
goto fail;
if (lstat (filename, &st) < 0)
return 0;
return S_ISLNK (st.st_mode);
}
memcpy (&ehdr, ehdr_view.data, sizeof ehdr);
/* Return the results of reading the symlink FILENAME in a buffer
allocated by backtrace_alloc. Return the length of the buffer in
*LEN. */
backtrace_release_view (state, &ehdr_view, error_callback, data);
static char *
elf_readlink (struct backtrace_state *state, const char *filename,
backtrace_error_callback error_callback, void *data,
size_t *plen)
{
size_t len;
char *buf;
if (ehdr.e_ident[EI_MAG0] != ELFMAG0
|| ehdr.e_ident[EI_MAG1] != ELFMAG1
|| ehdr.e_ident[EI_MAG2] != ELFMAG2
|| ehdr.e_ident[EI_MAG3] != ELFMAG3)
{
error_callback (data, "executable file is not ELF", 0);
goto fail;
}
if (ehdr.e_ident[EI_VERSION] != EV_CURRENT)
len = 128;
while (1)
{
error_callback (data, "executable file is unrecognized ELF version", 0);
goto fail;
ssize_t rl;
buf = backtrace_alloc (state, len, error_callback, data);
if (buf == NULL)
return NULL;
rl = readlink (filename, buf, len);
if (rl < 0)
{
backtrace_free (state, buf, len, error_callback, data);
return NULL;
}
if ((size_t) rl < len - 1)
{
buf[rl] = '\0';
*plen = len;
return buf;
}
backtrace_free (state, buf, len, error_callback, data);
len *= 2;
}
}
#if BACKTRACE_ELF_SIZE == 32
#define BACKTRACE_ELFCLASS ELFCLASS32
#else
#define BACKTRACE_ELFCLASS ELFCLASS64
#endif
/* Open a separate debug info file, using the build ID to find it.
Returns an open file descriptor, or -1.
if (ehdr.e_ident[EI_CLASS] != BACKTRACE_ELFCLASS)
{
error_callback (data, "executable file is unexpected ELF class", 0);
goto fail;
}
The GDB manual says that the only place gdb looks for a debug file
when the build ID is known is in /usr/lib/debug/.build-id. */
if (ehdr.e_ident[EI_DATA] != ELFDATA2LSB
&& ehdr.e_ident[EI_DATA] != ELFDATA2MSB)
{
error_callback (data, "executable file has unknown endianness", 0);
goto fail;
}
static int
elf_open_debugfile_by_buildid (struct backtrace_state *state,
const char *buildid_data, size_t buildid_size,
backtrace_error_callback error_callback,
void *data)
{
const char * const prefix = "/usr/lib/debug/.build-id/";
const size_t prefix_len = strlen (prefix);
const char * const suffix = ".debug";
const size_t suffix_len = strlen (suffix);
size_t len;
char *bd_filename;
char *t;
size_t i;
int ret;
int does_not_exist;
/* If the executable is ET_DYN, it is either a PIE, or we are running
directly a shared library with .interp. We need to wait for
dl_iterate_phdr in that case to determine the actual base_address. */
if (exe && ehdr.e_type == ET_DYN)
len = prefix_len + buildid_size * 2 + suffix_len + 2;
bd_filename = backtrace_alloc (state, len, error_callback, data);
if (bd_filename == NULL)
return -1;
shoff = ehdr.e_shoff;
shnum = ehdr.e_shnum;
shstrndx = ehdr.e_shstrndx;
if ((shnum == 0 || shstrndx == SHN_XINDEX)
&& shoff != 0)
t = bd_filename;
memcpy (t, prefix, prefix_len);
t += prefix_len;
for (i = 0; i < buildid_size; i++)
{
struct backtrace_view shdr_view;
const b_elf_shdr *shdr;
if (!backtrace_get_view (state, descriptor, shoff, sizeof shdr,
error_callback, data, &shdr_view))
goto fail;
shdr = (const b_elf_shdr *) shdr_view.data;
unsigned char b;
unsigned char nib;
b = (unsigned char) buildid_data[i];
nib = (b & 0xf0) >> 4;
*t++ = nib < 10 ? '0' + nib : 'a' + nib - 10;
nib = b & 0x0f;
*t++ = nib < 10 ? '0' + nib : 'a' + nib - 10;
if (i == 0)
*t++ = '/';
}
memcpy (t, suffix, suffix_len);
t[suffix_len] = '\0';
if (shnum == 0)
shnum = shdr->sh_size;
ret = backtrace_open (bd_filename, error_callback, data, &does_not_exist);
if (shstrndx == SHN_XINDEX)
{
shstrndx = shdr->sh_link;
backtrace_free (state, bd_filename, len, error_callback, data);
/* Versions of the GNU binutils between 2.12 and 2.18 did
not handle objects with more than SHN_LORESERVE sections
correctly. All large section indexes were offset by
0x100. There is more information at
http://sourceware.org/bugzilla/show_bug.cgi?id-5900 .
Fortunately these object files are easy to detect, as the
GNU binutils always put the section header string table
near the end of the list of sections. Thus if the
section header string table index is larger than the
number of sections, then we know we have to subtract
0x100 to get the real section index. */
if (shstrndx >= shnum && shstrndx >= SHN_LORESERVE + 0x100)
shstrndx -= 0x100;
}
/* gdb checks that the debuginfo file has the same build ID note.
That seems kind of pointless to me--why would it have the right
name but not the right build ID?--so skipping the check. */
backtrace_release_view (state, &shdr_view, error_callback, data);
}
return ret;
}
/* To translate PC to file/line when using DWARF, we need to find
the .debug_info and .debug_line sections. */
/* Try to open a file whose name is PREFIX (length PREFIX_LEN)
concatenated with PREFIX2 (length PREFIX2_LEN) concatenated with
DEBUGLINK_NAME. Returns an open file descriptor, or -1. */
/* Read the section headers, skipping the first one. */
static int
elf_try_debugfile (struct backtrace_state *state, const char *prefix,
size_t prefix_len, const char *prefix2, size_t prefix2_len,
const char *debuglink_name,
backtrace_error_callback error_callback, void *data)
{
size_t debuglink_len;
size_t try_len;
char *try;
int does_not_exist;
int ret;
if (!backtrace_get_view (state, descriptor, shoff + sizeof (b_elf_shdr),
(shnum - 1) * sizeof (b_elf_shdr),
error_callback, data, &shdrs_view))
goto fail;
shdrs_view_valid = 1;
shdrs = (const b_elf_shdr *) shdrs_view.data;
debuglink_len = strlen (debuglink_name);
try_len = prefix_len + prefix2_len + debuglink_len + 1;
try = backtrace_alloc (state, try_len, error_callback, data);
if (try == NULL)
return -1;
/* Read the section names. */
memcpy (try, prefix, prefix_len);
memcpy (try + prefix_len, prefix2, prefix2_len);
memcpy (try + prefix_len + prefix2_len, debuglink_name, debuglink_len);
try[prefix_len + prefix2_len + debuglink_len] = '\0';
shstrhdr = &shdrs[shstrndx - 1];
shstr_size = shstrhdr->sh_size;
shstr_off = shstrhdr->sh_offset;
ret = backtrace_open (try, error_callback, data, &does_not_exist);
if (!backtrace_get_view (state, descriptor, shstr_off, shstr_size,
error_callback, data, &names_view))
goto fail;
names_view_valid = 1;
names = (const char *) names_view.data;
backtrace_free (state, try, try_len, error_callback, data);
symtab_shndx = 0;
dynsym_shndx = 0;
return ret;
}
memset (sections, 0, sizeof sections);
/* Find a separate debug info file, using the debuglink section data
to find it. Returns an open file descriptor, or -1. */
/* Look for the symbol table. */
for (i = 1; i < shnum; ++i)
static int
elf_find_debugfile_by_debuglink (struct backtrace_state *state,
const char *filename,
const char *debuglink_name,
backtrace_error_callback error_callback,
void *data)
{
int ret;
char *alc;
size_t alc_len;
const char *slash;
int ddescriptor;
const char *prefix;
size_t prefix_len;
/* Resolve symlinks in FILENAME. Since FILENAME is fairly likely to
be /proc/self/exe, symlinks are common. We don't try to resolve
the whole path name, just the base name. */
ret = -1;
alc = NULL;
alc_len = 0;
while (elf_is_symlink (filename))
{
const b_elf_shdr *shdr;
unsigned int sh_name;
const char *name;
int j;
shdr = &shdrs[i - 1];
if (shdr->sh_type == SHT_SYMTAB)
symtab_shndx = i;
else if (shdr->sh_type == SHT_DYNSYM)
dynsym_shndx = i;
sh_name = shdr->sh_name;
if (sh_name >= shstr_size)
{
error_callback (data, "ELF section name out of range", 0);
goto fail;
}
char *new_buf;
size_t new_len;
name = names + sh_name;
new_buf = elf_readlink (state, filename, error_callback, data, &new_len);
if (new_buf == NULL)
break;
for (j = 0; j < (int) DEBUG_MAX; ++j)
if (new_buf[0] == '/')
filename = new_buf;
else
{
if (strcmp (name, debug_section_names[j]) == 0)
slash = strrchr (filename, '/');
if (slash == NULL)
filename = new_buf;
else
{
sections[j].offset = shdr->sh_offset;
sections[j].size = shdr->sh_size;
break;
size_t clen;
char *c;
slash++;
clen = slash - filename + strlen (new_buf) + 1;
c = backtrace_alloc (state, clen, error_callback, data);
if (c == NULL)
goto done;
memcpy (c, filename, slash - filename);
memcpy (c + (slash - filename), new_buf, strlen (new_buf));
c[slash - filename + strlen (new_buf)] = '\0';
backtrace_free (state, new_buf, new_len, error_callback, data);
filename = c;
new_buf = c;
new_len = clen;
}
}
if (alc != NULL)
backtrace_free (state, alc, alc_len, error_callback, data);
alc = new_buf;
alc_len = new_len;
}
if (symtab_shndx == 0)
symtab_shndx = dynsym_shndx;
if (symtab_shndx != 0)
/* Look for DEBUGLINK_NAME in the same directory as FILENAME. */
slash = strrchr (filename, '/');
if (slash == NULL)
{
prefix = "";
prefix_len = 0;
}
else
{
slash++;
prefix = filename;
prefix_len = slash - filename;
}
ddescriptor = elf_try_debugfile (state, prefix, prefix_len, "", 0,
debuglink_name, error_callback, data);
if (ddescriptor >= 0)
{
ret = ddescriptor;
goto done;
}
/* Look for DEBUGLINK_NAME in a .debug subdirectory of FILENAME. */
ddescriptor = elf_try_debugfile (state, prefix, prefix_len, ".debug/",
strlen (".debug/"), debuglink_name,
error_callback, data);
if (ddescriptor >= 0)
{
ret = ddescriptor;
goto done;
}
/* Look for DEBUGLINK_NAME in /usr/lib/debug. */
ddescriptor = elf_try_debugfile (state, "/usr/lib/debug/",
strlen ("/usr/lib/debug/"), prefix,
prefix_len, debuglink_name,
error_callback, data);
if (ddescriptor >= 0)
ret = ddescriptor;
done:
if (alc != NULL && alc_len > 0)
backtrace_free (state, alc, alc_len, error_callback, data);
return ret;
}
/* Open a separate debug info file, using the debuglink section data
to find it. Returns an open file descriptor, or -1. */
static int
elf_open_debugfile_by_debuglink (struct backtrace_state *state,
const char *filename,
const char *debuglink_name,
uint32_t debuglink_crc,
backtrace_error_callback error_callback,
void *data)
{
int ddescriptor;
uint32_t got_crc;
ddescriptor = elf_find_debugfile_by_debuglink (state, filename,
debuglink_name,
error_callback, data);
if (ddescriptor < 0)
return -1;
got_crc = elf_crc32_file (state, ddescriptor, error_callback, data);
if (got_crc != debuglink_crc)
{
backtrace_close (ddescriptor, error_callback, data);
return -1;
}
return ddescriptor;
}
/* A function useful for setting a breakpoint for an inflation failure
when this code is compiled with -g. */
static void
elf_zlib_failed(void)
{
}
/* *PVAL is the current value being read from the stream, and *PBITS
is the number of valid bits. Ensure that *PVAL holds at least 15
bits by reading additional bits from *PPIN, up to PINEND, as
needed. Updates *PPIN, *PVAL and *PBITS. Returns 1 on success, 0
on error. */
static int
elf_zlib_fetch (const unsigned char **ppin, const unsigned char *pinend,
uint64_t *pval, unsigned int *pbits)
{
unsigned int bits;
const unsigned char *pin;
uint64_t val;
uint32_t next;
bits = *pbits;
if (bits >= 15)
return 1;
pin = *ppin;
val = *pval;
if (unlikely (pinend - pin < 4))
{
elf_zlib_failed ();
return 0;
}
/* We've ensured that PIN is aligned. */
next = *(const uint32_t *)pin;
#if __BYTE_ORDER == __ORDER_BIG_ENDIAN
next = __builtin_bswap32 (next);
#endif
val |= (uint64_t)next << bits;
bits += 32;
pin += 4;
/* We will need the next four bytes soon. */
__builtin_prefetch (pin, 0, 0);
*ppin = pin;
*pval = val;
*pbits = bits;
return 1;
}
/* Huffman code tables, like the rest of the zlib format, are defined
by RFC 1951. We store a Huffman code table as a series of tables
stored sequentially in memory. Each entry in a table is 16 bits.
The first, main, table has 256 entries. It is followed by a set of
secondary tables of length 2 to 128 entries. The maximum length of
a code sequence in the deflate format is 15 bits, so that is all we
need. Each secondary table has an index, which is the offset of
the table in the overall memory storage.
The deflate format says that all codes of a given bit length are
lexicographically consecutive. Perhaps we could have 130 values
that require a 15-bit code, perhaps requiring three secondary
tables of size 128. I don't know if this is actually possible, but
it suggests that the maximum size required for secondary tables is
3 * 128 + 3 * 64 ... == 768. The zlib enough program reports 660
as the maximum. We permit 768, since in addition to the 256 for
the primary table, with two bytes per entry, and with the two
tables we need, that gives us a page.
A single table entry needs to store a value or (for the main table
only) the index and size of a secondary table. Values range from 0
to 285, inclusive. Secondary table indexes, per above, range from
0 to 510. For a value we need to store the number of bits we need
to determine that value (one value may appear multiple times in the
table), which is 1 to 8. For a secondary table we need to store
the number of bits used to index into the table, which is 1 to 7.
And of course we need 1 bit to decide whether we have a value or a
secondary table index. So each entry needs 9 bits for value/table
index, 3 bits for size, 1 bit what it is. For simplicity we use 16
bits per entry. */
/* Number of entries we allocate to for one code table. We get a page
for the two code tables we need. */
#define HUFFMAN_TABLE_SIZE (1024)
/* Bit masks and shifts for the values in the table. */
#define HUFFMAN_VALUE_MASK 0x01ff
#define HUFFMAN_BITS_SHIFT 9
#define HUFFMAN_BITS_MASK 0x7
#define HUFFMAN_SECONDARY_SHIFT 12
/* For working memory while inflating we need two code tables, we need
an array of code lengths (max value 15, so we use unsigned char),
and an array of unsigned shorts used while building a table. The
latter two arrays must be large enough to hold the maximum number
of code lengths, which RFC 1951 defines as 286 + 30. */
#define ZDEBUG_TABLE_SIZE \
(2 * HUFFMAN_TABLE_SIZE * sizeof (uint16_t) \
+ (286 + 30) * sizeof (uint16_t) \
+ (286 + 30) * sizeof (unsigned char))
#define ZDEBUG_TABLE_CODELEN_OFFSET \
(2 * HUFFMAN_TABLE_SIZE * sizeof (uint16_t) \
+ (286 + 30) * sizeof (uint16_t))
#define ZDEBUG_TABLE_WORK_OFFSET \
(2 * HUFFMAN_TABLE_SIZE * sizeof (uint16_t))
#ifdef BACKTRACE_GENERATE_FIXED_HUFFMAN_TABLE
/* Used by the main function that generates the fixed table to learn
the table size. */
static size_t final_next_secondary;
#endif
/* Build a Huffman code table from an array of lengths in CODES of
length CODES_LEN. The table is stored into *TABLE. ZDEBUG_TABLE
is the same as for elf_zlib_inflate, used to find some work space.
Returns 1 on success, 0 on error. */
static int
elf_zlib_inflate_table (unsigned char *codes, size_t codes_len,
uint16_t *zdebug_table, uint16_t *table)
{
uint16_t count[16];
uint16_t start[16];
uint16_t prev[16];
uint16_t firstcode[7];
uint16_t *next;
size_t i;
size_t j;
unsigned int code;
size_t next_secondary;
/* Count the number of code of each length. Set NEXT[val] to be the
next value after VAL with the same bit length. */
next = (uint16_t *) (((unsigned char *) zdebug_table)
+ ZDEBUG_TABLE_WORK_OFFSET);
memset (&count[0], 0, 16 * sizeof (uint16_t));
for (i = 0; i < codes_len; ++i)
{
if (unlikely (codes[i] >= 16))
{
elf_zlib_failed ();
return 0;
}
if (count[codes[i]] == 0)
{
start[codes[i]] = i;
prev[codes[i]] = i;
}
else
{
next[prev[codes[i]]] = i;
prev[codes[i]] = i;
}
++count[codes[i]];
}
/* For each length, fill in the table for the codes of that
length. */
memset (table, 0, HUFFMAN_TABLE_SIZE * sizeof (uint16_t));
/* Handle the values that do not require a secondary table. */
code = 0;
for (j = 1; j <= 8; ++j)
{
unsigned int jcnt;
unsigned int val;
jcnt = count[j];
if (jcnt == 0)
continue;
if (unlikely (jcnt > (1U << j)))
{
elf_zlib_failed ();
return 0;
}
/* There are JCNT values that have this length, the values
starting from START[j] continuing through NEXT[VAL]. Those
values are assigned consecutive values starting at CODE. */
val = start[j];
for (i = 0; i < jcnt; ++i)
{
uint16_t tval;
size_t ind;
unsigned int incr;
/* In the compressed bit stream, the value VAL is encoded as
J bits with the value C. */
if (unlikely ((val & ~HUFFMAN_VALUE_MASK) != 0))
{
elf_zlib_failed ();
return 0;
}
tval = val | ((j - 1) << HUFFMAN_BITS_SHIFT);
/* The table lookup uses 8 bits. If J is less than 8, we
don't know what the other bits will be. We need to fill
in all possibilities in the table. Since the Huffman
code is unambiguous, those entries can't be used for any
other code. */
for (ind = code; ind < 0x100; ind += 1 << j)
{
if (unlikely (table[ind] != 0))
{
elf_zlib_failed ();
return 0;
}
table[ind] = tval;
}
/* Advance to the next value with this length. */
if (i + 1 < jcnt)
val = next[val];
/* The Huffman codes are stored in the bitstream with the
most significant bit first, as is required to make them
unambiguous. The effect is that when we read them from
the bitstream we see the bit sequence in reverse order:
the most significant bit of the Huffman code is the least
significant bit of the value we read from the bitstream.
That means that to make our table lookups work, we need
to reverse the bits of CODE. Since reversing bits is
tedious and in general requires using a table, we instead
increment CODE in reverse order. That is, if the number
of bits we are currently using, here named J, is 3, we
count as 000, 100, 010, 110, 001, 101, 011, 111, which is
to say the numbers from 0 to 7 but with the bits
reversed. Going to more bits, aka incrementing J,
effectively just adds more zero bits as the beginning,
and as such does not change the numeric value of CODE.
To increment CODE of length J in reverse order, find the
most significant zero bit and set it to one while
clearing all higher bits. In other words, add 1 modulo
2^J, only reversed. */
incr = 1U << (j - 1);
while ((code & incr) != 0)
incr >>= 1;
if (incr == 0)
code = 0;
else
{
code &= incr - 1;
code += incr;
}
}
}
/* Handle the values that require a secondary table. */
/* Set FIRSTCODE, the number at which the codes start, for each
length. */
for (j = 9; j < 16; j++)
{
unsigned int jcnt;
unsigned int k;
jcnt = count[j];
if (jcnt == 0)
continue;
/* There are JCNT values that have this length, the values
starting from START[j]. Those values are assigned
consecutive values starting at CODE. */
firstcode[j - 9] = code;
/* Reverse add JCNT to CODE modulo 2^J. */
for (k = 0; k < j; ++k)
{
if ((jcnt & (1U << k)) != 0)
{
unsigned int m;
unsigned int bit;
bit = 1U << (j - k - 1);
for (m = 0; m < j - k; ++m, bit >>= 1)
{
if ((code & bit) == 0)
{
code += bit;
break;
}
code &= ~bit;
}
jcnt &= ~(1U << k);
}
}
if (unlikely (jcnt != 0))
{
elf_zlib_failed ();
return 0;
}
}
/* For J from 9 to 15, inclusive, we store COUNT[J] consecutive
values starting at START[J] with consecutive codes starting at
FIRSTCODE[J - 9]. In the primary table we need to point to the
secondary table, and the secondary table will be indexed by J - 9
bits. We count down from 15 so that we install the larger
secondary tables first, as the smaller ones may be embedded in
the larger ones. */
next_secondary = 0; /* Index of next secondary table (after primary). */
for (j = 15; j >= 9; j--)
{
unsigned int jcnt;
unsigned int val;
size_t primary; /* Current primary index. */
size_t secondary; /* Offset to current secondary table. */
size_t secondary_bits; /* Bit size of current secondary table. */
jcnt = count[j];
if (jcnt == 0)
continue;
val = start[j];
code = firstcode[j - 9];
primary = 0x100;
secondary = 0;
secondary_bits = 0;
for (i = 0; i < jcnt; ++i)
{
uint16_t tval;
size_t ind;
unsigned int incr;
if ((code & 0xff) != primary)
{
uint16_t tprimary;
/* Fill in a new primary table entry. */
primary = code & 0xff;
tprimary = table[primary];
if (tprimary == 0)
{
/* Start a new secondary table. */
if (unlikely ((next_secondary & HUFFMAN_VALUE_MASK)
!= next_secondary))
{
elf_zlib_failed ();
return 0;
}
secondary = next_secondary;
secondary_bits = j - 8;
next_secondary += 1 << secondary_bits;
table[primary] = (secondary
+ ((j - 8) << HUFFMAN_BITS_SHIFT)
+ (1U << HUFFMAN_SECONDARY_SHIFT));
}
else
{
/* There is an existing entry. It had better be a
secondary table with enough bits. */
if (unlikely ((tprimary & (1U << HUFFMAN_SECONDARY_SHIFT))
== 0))
{
elf_zlib_failed ();
return 0;
}
secondary = tprimary & HUFFMAN_VALUE_MASK;
secondary_bits = ((tprimary >> HUFFMAN_BITS_SHIFT)
& HUFFMAN_BITS_MASK);
if (unlikely (secondary_bits < j - 8))
{
elf_zlib_failed ();
return 0;
}
}
}
/* Fill in secondary table entries. */
tval = val | ((j - 8) << HUFFMAN_BITS_SHIFT);
for (ind = code >> 8;
ind < (1U << secondary_bits);
ind += 1U << (j - 8))
{
if (unlikely (table[secondary + 0x100 + ind] != 0))
{
elf_zlib_failed ();
return 0;
}
table[secondary + 0x100 + ind] = tval;
}
if (i + 1 < jcnt)
val = next[val];
incr = 1U << (j - 1);
while ((code & incr) != 0)
incr >>= 1;
if (incr == 0)
code = 0;
else
{
code &= incr - 1;
code += incr;
}
}
}
#ifdef BACKTRACE_GENERATE_FIXED_HUFFMAN_TABLE
final_next_secondary = next_secondary;
#endif
return 1;
}
#ifdef BACKTRACE_GENERATE_FIXED_HUFFMAN_TABLE
/* Used to generate the fixed Huffman table for block type 1. */
#include <stdio.h>
static uint16_t table[ZDEBUG_TABLE_SIZE];
static unsigned char codes[287];
int
main ()
{
size_t i;
for (i = 0; i <= 143; ++i)
codes[i] = 8;
for (i = 144; i <= 255; ++i)
codes[i] = 9;
for (i = 256; i <= 279; ++i)
codes[i] = 7;
for (i = 280; i <= 287; ++i)
codes[i] = 8;
if (!elf_zlib_inflate_table (&codes[0], 287, &table[0], &table[0]))
{
fprintf (stderr, "elf_zlib_inflate_table failed\n");
exit (EXIT_FAILURE);
}
printf ("static const uint16_t elf_zlib_default_table[%#zx] =\n",
final_next_secondary + 0x100);
printf ("{\n");
for (i = 0; i < final_next_secondary + 0x100; i += 8)
{
size_t j;
printf (" ");
for (j = i; j < final_next_secondary + 0x100 && j < i + 8; ++j)
printf (" %#x,", table[j]);
printf ("\n");
}
printf ("};\n");
return 0;
}
#endif
/* The fixed table generated by the #ifdef'ed out main function
above. */
static const uint16_t elf_zlib_default_table[0x170] =
{
0xd00, 0xe50, 0xe10, 0xf18, 0xd10, 0xe70, 0xe30, 0x1232,
0xd08, 0xe60, 0xe20, 0x1212, 0xe00, 0xe80, 0xe40, 0x1252,
0xd04, 0xe58, 0xe18, 0x1202, 0xd14, 0xe78, 0xe38, 0x1242,
0xd0c, 0xe68, 0xe28, 0x1222, 0xe08, 0xe88, 0xe48, 0x1262,
0xd02, 0xe54, 0xe14, 0xf1c, 0xd12, 0xe74, 0xe34, 0x123a,
0xd0a, 0xe64, 0xe24, 0x121a, 0xe04, 0xe84, 0xe44, 0x125a,
0xd06, 0xe5c, 0xe1c, 0x120a, 0xd16, 0xe7c, 0xe3c, 0x124a,
0xd0e, 0xe6c, 0xe2c, 0x122a, 0xe0c, 0xe8c, 0xe4c, 0x126a,
0xd01, 0xe52, 0xe12, 0xf1a, 0xd11, 0xe72, 0xe32, 0x1236,
0xd09, 0xe62, 0xe22, 0x1216, 0xe02, 0xe82, 0xe42, 0x1256,
0xd05, 0xe5a, 0xe1a, 0x1206, 0xd15, 0xe7a, 0xe3a, 0x1246,
0xd0d, 0xe6a, 0xe2a, 0x1226, 0xe0a, 0xe8a, 0xe4a, 0x1266,
0xd03, 0xe56, 0xe16, 0xf1e, 0xd13, 0xe76, 0xe36, 0x123e,
0xd0b, 0xe66, 0xe26, 0x121e, 0xe06, 0xe86, 0xe46, 0x125e,
0xd07, 0xe5e, 0xe1e, 0x120e, 0xd17, 0xe7e, 0xe3e, 0x124e,
0xd0f, 0xe6e, 0xe2e, 0x122e, 0xe0e, 0xe8e, 0xe4e, 0x126e,
0xd00, 0xe51, 0xe11, 0xf19, 0xd10, 0xe71, 0xe31, 0x1234,
0xd08, 0xe61, 0xe21, 0x1214, 0xe01, 0xe81, 0xe41, 0x1254,
0xd04, 0xe59, 0xe19, 0x1204, 0xd14, 0xe79, 0xe39, 0x1244,
0xd0c, 0xe69, 0xe29, 0x1224, 0xe09, 0xe89, 0xe49, 0x1264,
0xd02, 0xe55, 0xe15, 0xf1d, 0xd12, 0xe75, 0xe35, 0x123c,
0xd0a, 0xe65, 0xe25, 0x121c, 0xe05, 0xe85, 0xe45, 0x125c,
0xd06, 0xe5d, 0xe1d, 0x120c, 0xd16, 0xe7d, 0xe3d, 0x124c,
0xd0e, 0xe6d, 0xe2d, 0x122c, 0xe0d, 0xe8d, 0xe4d, 0x126c,
0xd01, 0xe53, 0xe13, 0xf1b, 0xd11, 0xe73, 0xe33, 0x1238,
0xd09, 0xe63, 0xe23, 0x1218, 0xe03, 0xe83, 0xe43, 0x1258,
0xd05, 0xe5b, 0xe1b, 0x1208, 0xd15, 0xe7b, 0xe3b, 0x1248,
0xd0d, 0xe6b, 0xe2b, 0x1228, 0xe0b, 0xe8b, 0xe4b, 0x1268,
0xd03, 0xe57, 0xe17, 0x1200, 0xd13, 0xe77, 0xe37, 0x1240,
0xd0b, 0xe67, 0xe27, 0x1220, 0xe07, 0xe87, 0xe47, 0x1260,
0xd07, 0xe5f, 0xe1f, 0x1210, 0xd17, 0xe7f, 0xe3f, 0x1250,
0xd0f, 0xe6f, 0xe2f, 0x1230, 0xe0f, 0xe8f, 0xe4f, 0,
0x290, 0x291, 0x292, 0x293, 0x294, 0x295, 0x296, 0x297,
0x298, 0x299, 0x29a, 0x29b, 0x29c, 0x29d, 0x29e, 0x29f,
0x2a0, 0x2a1, 0x2a2, 0x2a3, 0x2a4, 0x2a5, 0x2a6, 0x2a7,
0x2a8, 0x2a9, 0x2aa, 0x2ab, 0x2ac, 0x2ad, 0x2ae, 0x2af,
0x2b0, 0x2b1, 0x2b2, 0x2b3, 0x2b4, 0x2b5, 0x2b6, 0x2b7,
0x2b8, 0x2b9, 0x2ba, 0x2bb, 0x2bc, 0x2bd, 0x2be, 0x2bf,
0x2c0, 0x2c1, 0x2c2, 0x2c3, 0x2c4, 0x2c5, 0x2c6, 0x2c7,
0x2c8, 0x2c9, 0x2ca, 0x2cb, 0x2cc, 0x2cd, 0x2ce, 0x2cf,
0x2d0, 0x2d1, 0x2d2, 0x2d3, 0x2d4, 0x2d5, 0x2d6, 0x2d7,
0x2d8, 0x2d9, 0x2da, 0x2db, 0x2dc, 0x2dd, 0x2de, 0x2df,
0x2e0, 0x2e1, 0x2e2, 0x2e3, 0x2e4, 0x2e5, 0x2e6, 0x2e7,
0x2e8, 0x2e9, 0x2ea, 0x2eb, 0x2ec, 0x2ed, 0x2ee, 0x2ef,
0x2f0, 0x2f1, 0x2f2, 0x2f3, 0x2f4, 0x2f5, 0x2f6, 0x2f7,
0x2f8, 0x2f9, 0x2fa, 0x2fb, 0x2fc, 0x2fd, 0x2fe, 0x2ff,
};
/* Inflate a zlib stream from PIN/SIN to POUT/SOUT. Return 1 on
success, 0 on some error parsing the stream. */
static int
elf_zlib_inflate (const unsigned char *pin, size_t sin, uint16_t *zdebug_table,
unsigned char *pout, size_t sout)
{
unsigned char *porigout;
const unsigned char *pinend;
unsigned char *poutend;
/* We can apparently see multiple zlib streams concatenated
together, so keep going as long as there is something to read.
The last 4 bytes are the checksum. */
porigout = pout;
pinend = pin + sin;
poutend = pout + sout;
while ((pinend - pin) > 4)
{
uint64_t val;
unsigned int bits;
int last;
/* Read the two byte zlib header. */
if (unlikely ((pin[0] & 0xf) != 8)) /* 8 is zlib encoding. */
{
/* Unknown compression method. */
elf_zlib_failed ();
return 0;
}
if (unlikely ((pin[0] >> 4) > 7))
{
/* Window size too large. Other than this check, we don't
care about the window size. */
elf_zlib_failed ();
return 0;
}
if (unlikely ((pin[1] & 0x20) != 0))
{
/* Stream expects a predefined dictionary, but we have no
dictionary. */
elf_zlib_failed ();
return 0;
}
val = (pin[0] << 8) | pin[1];
if (unlikely (val % 31 != 0))
{
/* Header check failure. */
elf_zlib_failed ();
return 0;
}
pin += 2;
/* Align PIN to a 32-bit boundary. */
val = 0;
bits = 0;
while ((((uintptr_t) pin) & 3) != 0)
{
val |= (uint64_t)*pin << bits;
bits += 8;
++pin;
}
/* Read blocks until one is marked last. */
last = 0;
while (!last)
{
unsigned int type;
const uint16_t *tlit;
const uint16_t *tdist;
if (!elf_zlib_fetch (&pin, pinend, &val, &bits))
return 0;
last = val & 1;
type = (val >> 1) & 3;
val >>= 3;
bits -= 3;
if (unlikely (type == 3))
{
/* Invalid block type. */
elf_zlib_failed ();
return 0;
}
if (type == 0)
{
uint16_t len;
uint16_t lenc;
/* An uncompressed block. */
/* If we've read ahead more than a byte, back up. */
while (bits > 8)
{
--pin;
bits -= 8;
}
val = 0;
bits = 0;
if (unlikely ((pinend - pin) < 4))
{
/* Missing length. */
elf_zlib_failed ();
return 0;
}
len = pin[0] | (pin[1] << 8);
lenc = pin[2] | (pin[3] << 8);
pin += 4;
lenc = ~lenc;
if (unlikely (len != lenc))
{
/* Corrupt data. */
elf_zlib_failed ();
return 0;
}
if (unlikely (len > (unsigned int) (pinend - pin)
|| len > (unsigned int) (poutend - pout)))
{
/* Not enough space in buffers. */
elf_zlib_failed ();
return 0;
}
memcpy (pout, pin, len);
pout += len;
pin += len;
/* Align PIN. */
while ((((uintptr_t) pin) & 3) != 0)
{
val |= (uint64_t)*pin << bits;
bits += 8;
++pin;
}
/* Go around to read the next block. */
continue;
}
if (type == 1)
{
tlit = elf_zlib_default_table;
tdist = elf_zlib_default_table;
}
else
{
unsigned int nlit;
unsigned int ndist;
unsigned int nclen;
unsigned char codebits[19];
unsigned char *plenbase;
unsigned char *plen;
unsigned char *plenend;
/* Read a Huffman encoding table. The various magic
numbers here are from RFC 1951. */
if (!elf_zlib_fetch (&pin, pinend, &val, &bits))
return 0;
nlit = (val & 0x1f) + 257;
val >>= 5;
ndist = (val & 0x1f) + 1;
val >>= 5;
nclen = (val & 0xf) + 4;
val >>= 4;
bits -= 14;
if (unlikely (nlit > 286 || ndist > 30))
{
/* Values out of range. */
elf_zlib_failed ();
return 0;
}
/* Read and build the table used to compress the
literal, length, and distance codes. */
memset(&codebits[0], 0, 19);
/* There are always at least 4 elements in the
table. */
if (!elf_zlib_fetch (&pin, pinend, &val, &bits))
return 0;
codebits[16] = val & 7;
codebits[17] = (val >> 3) & 7;
codebits[18] = (val >> 6) & 7;
codebits[0] = (val >> 9) & 7;
val >>= 12;
bits -= 12;
if (nclen == 4)
goto codebitsdone;
codebits[8] = val & 7;
val >>= 3;
bits -= 3;
if (nclen == 5)
goto codebitsdone;
if (!elf_zlib_fetch (&pin, pinend, &val, &bits))
return 0;
codebits[7] = val & 7;
val >>= 3;
bits -= 3;
if (nclen == 6)
goto codebitsdone;
codebits[9] = val & 7;
val >>= 3;
bits -= 3;
if (nclen == 7)
goto codebitsdone;
codebits[6] = val & 7;
val >>= 3;
bits -= 3;
if (nclen == 8)
goto codebitsdone;
codebits[10] = val & 7;
val >>= 3;
bits -= 3;
if (nclen == 9)
goto codebitsdone;
codebits[5] = val & 7;
val >>= 3;
bits -= 3;
if (nclen == 10)
goto codebitsdone;
if (!elf_zlib_fetch (&pin, pinend, &val, &bits))
return 0;
codebits[11] = val & 7;
val >>= 3;
bits -= 3;
if (nclen == 11)
goto codebitsdone;
codebits[4] = val & 7;
val >>= 3;
bits -= 3;
if (nclen == 12)
goto codebitsdone;
codebits[12] = val & 7;
val >>= 3;
bits -= 3;
if (nclen == 13)
goto codebitsdone;
codebits[3] = val & 7;
val >>= 3;
bits -= 3;
if (nclen == 14)
goto codebitsdone;
codebits[13] = val & 7;
val >>= 3;
bits -= 3;
if (nclen == 15)
goto codebitsdone;
if (!elf_zlib_fetch (&pin, pinend, &val, &bits))
return 0;
codebits[2] = val & 7;
val >>= 3;
bits -= 3;
if (nclen == 16)
goto codebitsdone;
codebits[14] = val & 7;
val >>= 3;
bits -= 3;
if (nclen == 17)
goto codebitsdone;
codebits[1] = val & 7;
val >>= 3;
bits -= 3;
if (nclen == 18)
goto codebitsdone;
codebits[15] = val & 7;
val >>= 3;
bits -= 3;
codebitsdone:
if (!elf_zlib_inflate_table (codebits, 19, zdebug_table,
zdebug_table))
return 0;
/* Read the compressed bit lengths of the literal,
length, and distance codes. We have allocated space
at the end of zdebug_table to hold them. */
plenbase = (((unsigned char *) zdebug_table)
+ ZDEBUG_TABLE_CODELEN_OFFSET);
plen = plenbase;
plenend = plen + nlit + ndist;
while (plen < plenend)
{
uint16_t t;
unsigned int b;
uint16_t v;
if (!elf_zlib_fetch (&pin, pinend, &val, &bits))
return 0;
t = zdebug_table[val & 0xff];
/* The compression here uses bit lengths up to 7, so
a secondary table is never necessary. */
if (unlikely ((t & (1U << HUFFMAN_SECONDARY_SHIFT)) != 0))
{
elf_zlib_failed ();
return 0;
}
b = (t >> HUFFMAN_BITS_SHIFT) & HUFFMAN_BITS_MASK;
val >>= b + 1;
bits -= b + 1;
v = t & HUFFMAN_VALUE_MASK;
if (v < 16)
*plen++ = v;
else if (v == 16)
{
unsigned int c;
unsigned int prev;
/* Copy previous entry 3 to 6 times. */
if (unlikely (plen == plenbase))
{
elf_zlib_failed ();
return 0;
}
/* We used up to 7 bits since the last
elf_zlib_fetch, so we have at least 8 bits
available here. */
c = 3 + (val & 0x3);
val >>= 2;
bits -= 2;
if (unlikely ((unsigned int) (plenend - plen) < c))
{
elf_zlib_failed ();
return 0;
}
prev = plen[-1];
switch (c)
{
case 6:
*plen++ = prev;
/* fallthrough */
case 5:
*plen++ = prev;
/* fallthrough */
case 4:
*plen++ = prev;
}
*plen++ = prev;
*plen++ = prev;
*plen++ = prev;
}
else if (v == 17)
{
unsigned int c;
/* Store zero 3 to 10 times. */
/* We used up to 7 bits since the last
elf_zlib_fetch, so we have at least 8 bits
available here. */
c = 3 + (val & 0x7);
val >>= 3;
bits -= 3;
if (unlikely ((unsigned int) (plenend - plen) < c))
{
elf_zlib_failed ();
return 0;
}
switch (c)
{
case 10:
*plen++ = 0;
/* fallthrough */
case 9:
*plen++ = 0;
/* fallthrough */
case 8:
*plen++ = 0;
/* fallthrough */
case 7:
*plen++ = 0;
/* fallthrough */
case 6:
*plen++ = 0;
/* fallthrough */
case 5:
*plen++ = 0;
/* fallthrough */
case 4:
*plen++ = 0;
}
*plen++ = 0;
*plen++ = 0;
*plen++ = 0;
}
else if (v == 18)
{
unsigned int c;
/* Store zero 11 to 138 times. */
/* We used up to 7 bits since the last
elf_zlib_fetch, so we have at least 8 bits
available here. */
c = 11 + (val & 0x7f);
val >>= 7;
bits -= 7;
if (unlikely ((unsigned int) (plenend - plen) < c))
{
elf_zlib_failed ();
return 0;
}
memset (plen, 0, c);
plen += c;
}
else
{
elf_zlib_failed ();
return 0;
}
}
/* Make sure that the stop code can appear. */
plen = plenbase;
if (unlikely (plen[256] == 0))
{
elf_zlib_failed ();
return 0;
}
/* Build the decompression tables. */
if (!elf_zlib_inflate_table (plen, nlit, zdebug_table,
zdebug_table))
return 0;
if (!elf_zlib_inflate_table (plen + nlit, ndist, zdebug_table,
zdebug_table + HUFFMAN_TABLE_SIZE))
return 0;
tlit = zdebug_table;
tdist = zdebug_table + HUFFMAN_TABLE_SIZE;
}
/* Inflate values until the end of the block. This is the
main loop of the inflation code. */
while (1)
{
uint16_t t;
unsigned int b;
uint16_t v;
unsigned int lit;
if (!elf_zlib_fetch (&pin, pinend, &val, &bits))
return 0;
t = tlit[val & 0xff];
b = (t >> HUFFMAN_BITS_SHIFT) & HUFFMAN_BITS_MASK;
v = t & HUFFMAN_VALUE_MASK;
if ((t & (1U << HUFFMAN_SECONDARY_SHIFT)) == 0)
{
lit = v;
val >>= b + 1;
bits -= b + 1;
}
else
{
t = tlit[v + 0x100 + ((val >> 8) & ((1U << b) - 1))];
b = (t >> HUFFMAN_BITS_SHIFT) & HUFFMAN_BITS_MASK;
lit = t & HUFFMAN_VALUE_MASK;
val >>= b + 8;
bits -= b + 8;
}
if (lit < 256)
{
if (unlikely (pout == poutend))
{
elf_zlib_failed ();
return 0;
}
*pout++ = lit;
/* We will need to write the next byte soon. We ask
for high temporal locality because we will write
to the whole cache line soon. */
__builtin_prefetch (pout, 1, 3);
}
else if (lit == 256)
{
/* The end of the block. */
break;
}
else
{
unsigned int dist;
unsigned int len;
/* Convert lit into a length. */
if (lit < 265)
len = lit - 257 + 3;
else if (lit == 285)
len = 258;
else if (unlikely (lit > 285))
{
elf_zlib_failed ();
return 0;
}
else
{
unsigned int extra;
if (!elf_zlib_fetch (&pin, pinend, &val, &bits))
return 0;
/* This is an expression for the table of length
codes in RFC 1951 3.2.5. */
lit -= 265;
extra = (lit >> 2) + 1;
len = (lit & 3) << extra;
len += 11;
len += ((1U << (extra - 1)) - 1) << 3;
len += val & ((1U << extra) - 1);
val >>= extra;
bits -= extra;
}
if (!elf_zlib_fetch (&pin, pinend, &val, &bits))
return 0;
t = tdist[val & 0xff];
b = (t >> HUFFMAN_BITS_SHIFT) & HUFFMAN_BITS_MASK;
v = t & HUFFMAN_VALUE_MASK;
if ((t & (1U << HUFFMAN_SECONDARY_SHIFT)) == 0)
{
dist = v;
val >>= b + 1;
bits -= b + 1;
}
else
{
t = tdist[v + 0x100 + ((val >> 8) & ((1U << b) - 1))];
b = (t >> HUFFMAN_BITS_SHIFT) & HUFFMAN_BITS_MASK;
dist = t & HUFFMAN_VALUE_MASK;
val >>= b + 8;
bits -= b + 8;
}
/* Convert dist to a distance. */
if (dist == 0)
{
/* A distance of 1. A common case, meaning
repeat the last character LEN times. */
if (unlikely (pout == porigout))
{
elf_zlib_failed ();
return 0;
}
if (unlikely ((unsigned int) (poutend - pout) < len))
{
elf_zlib_failed ();
return 0;
}
memset (pout, pout[-1], len);
pout += len;
}
else if (unlikely (dist > 29))
{
elf_zlib_failed ();
return 0;
}
else
{
if (dist < 4)
dist = dist + 1;
else
{
unsigned int extra;
if (!elf_zlib_fetch (&pin, pinend, &val, &bits))
return 0;
/* This is an expression for the table of
distance codes in RFC 1951 3.2.5. */
dist -= 4;
extra = (dist >> 1) + 1;
dist = (dist & 1) << extra;
dist += 5;
dist += ((1U << (extra - 1)) - 1) << 2;
dist += val & ((1U << extra) - 1);
val >>= extra;
bits -= extra;
}
/* Go back dist bytes, and copy len bytes from
there. */
if (unlikely ((unsigned int) (pout - porigout) < dist))
{
elf_zlib_failed ();
return 0;
}
if (unlikely ((unsigned int) (poutend - pout) < len))
{
elf_zlib_failed ();
return 0;
}
if (dist >= len)
{
memcpy (pout, pout - dist, len);
pout += len;
}
else
{
while (len > 0)
{
unsigned int copy;
copy = len < dist ? len : dist;
memcpy (pout, pout - dist, copy);
len -= copy;
pout += copy;
}
}
}
}
}
}
}
/* We should have filled the output buffer. */
if (unlikely (pout != poutend))
{
elf_zlib_failed ();
return 0;
}
return 1;
}
/* Verify the zlib checksum. The checksum is in the 4 bytes at
CHECKBYTES, and the uncompressed data is at UNCOMPRESSED /
UNCOMPRESSED_SIZE. Returns 1 on success, 0 on failure. */
static int
elf_zlib_verify_checksum (const unsigned char *checkbytes,
const unsigned char *uncompressed,
size_t uncompressed_size)
{
unsigned int i;
unsigned int cksum;
const unsigned char *p;
uint32_t s1;
uint32_t s2;
size_t hsz;
cksum = 0;
for (i = 0; i < 4; i++)
cksum = (cksum << 8) | checkbytes[i];
s1 = 1;
s2 = 0;
/* Minimize modulo operations. */
p = uncompressed;
hsz = uncompressed_size;
while (hsz >= 5552)
{
for (i = 0; i < 5552; i += 16)
{
/* Manually unroll loop 16 times. */
s1 = s1 + *p++;
s2 = s2 + s1;
s1 = s1 + *p++;
s2 = s2 + s1;
s1 = s1 + *p++;
s2 = s2 + s1;
s1 = s1 + *p++;
s2 = s2 + s1;
s1 = s1 + *p++;
s2 = s2 + s1;
s1 = s1 + *p++;
s2 = s2 + s1;
s1 = s1 + *p++;
s2 = s2 + s1;
s1 = s1 + *p++;
s2 = s2 + s1;
s1 = s1 + *p++;
s2 = s2 + s1;
s1 = s1 + *p++;
s2 = s2 + s1;
s1 = s1 + *p++;
s2 = s2 + s1;
s1 = s1 + *p++;
s2 = s2 + s1;
s1 = s1 + *p++;
s2 = s2 + s1;
s1 = s1 + *p++;
s2 = s2 + s1;
s1 = s1 + *p++;
s2 = s2 + s1;
s1 = s1 + *p++;
s2 = s2 + s1;
}
hsz -= 5552;
s1 %= 65521;
s2 %= 65521;
}
while (hsz >= 16)
{
/* Manually unroll loop 16 times. */
s1 = s1 + *p++;
s2 = s2 + s1;
s1 = s1 + *p++;
s2 = s2 + s1;
s1 = s1 + *p++;
s2 = s2 + s1;
s1 = s1 + *p++;
s2 = s2 + s1;
s1 = s1 + *p++;
s2 = s2 + s1;
s1 = s1 + *p++;
s2 = s2 + s1;
s1 = s1 + *p++;
s2 = s2 + s1;
s1 = s1 + *p++;
s2 = s2 + s1;
s1 = s1 + *p++;
s2 = s2 + s1;
s1 = s1 + *p++;
s2 = s2 + s1;
s1 = s1 + *p++;
s2 = s2 + s1;
s1 = s1 + *p++;
s2 = s2 + s1;
s1 = s1 + *p++;
s2 = s2 + s1;
s1 = s1 + *p++;
s2 = s2 + s1;
s1 = s1 + *p++;
s2 = s2 + s1;
s1 = s1 + *p++;
s2 = s2 + s1;
hsz -= 16;
}
for (i = 0; i < hsz; ++i)
{
s1 = s1 + *p++;
s2 = s2 + s1;
}
s1 %= 65521;
s2 %= 65521;
if (unlikely ((s2 << 16) + s1 != cksum))
{
elf_zlib_failed ();
return 0;
}
return 1;
}
/* Inflate a zlib stream from PIN/SIN to POUT/SOUT, and verify the
checksum. Return 1 on success, 0 on error. */
static int
elf_zlib_inflate_and_verify (const unsigned char *pin, size_t sin,
uint16_t *zdebug_table, unsigned char *pout,
size_t sout)
{
if (!elf_zlib_inflate (pin, sin, zdebug_table, pout, sout))
return 0;
if (!elf_zlib_verify_checksum (pin + sin - 4, pout, sout))
return 0;
return 1;
}
/* Uncompress the old compressed debug format, the one emitted by
--compress-debug-sections=zlib-gnu. The compressed data is in
COMPRESSED / COMPRESSED_SIZE, and the function writes to
*UNCOMPRESSED / *UNCOMPRESSED_SIZE. ZDEBUG_TABLE is work space to
hold Huffman tables. Returns 0 on error, 1 on successful
decompression or if something goes wrong. In general we try to
carry on, by returning 1, even if we can't decompress. */
static int
elf_uncompress_zdebug (struct backtrace_state *state,
const unsigned char *compressed, size_t compressed_size,
uint16_t *zdebug_table,
backtrace_error_callback error_callback, void *data,
unsigned char **uncompressed, size_t *uncompressed_size)
{
size_t sz;
size_t i;
unsigned char *po;
*uncompressed = NULL;
*uncompressed_size = 0;
/* The format starts with the four bytes ZLIB, followed by the 8
byte length of the uncompressed data in big-endian order,
followed by a zlib stream. */
if (compressed_size < 12 || memcmp (compressed, "ZLIB", 4) != 0)
return 1;
sz = 0;
for (i = 0; i < 8; i++)
sz = (sz << 8) | compressed[i + 4];
if (*uncompressed != NULL && *uncompressed_size >= sz)
po = *uncompressed;
else
{
po = (unsigned char *) backtrace_alloc (state, sz, error_callback, data);
if (po == NULL)
return 0;
}
if (!elf_zlib_inflate_and_verify (compressed + 12, compressed_size - 12,
zdebug_table, po, sz))
return 1;
*uncompressed = po;
*uncompressed_size = sz;
return 1;
}
/* Uncompress the new compressed debug format, the official standard
ELF approach emitted by --compress-debug-sections=zlib-gabi. The
compressed data is in COMPRESSED / COMPRESSED_SIZE, and the
function writes to *UNCOMPRESSED / *UNCOMPRESSED_SIZE.
ZDEBUG_TABLE is work space as for elf_uncompress_zdebug. Returns 0
on error, 1 on successful decompression or if something goes wrong.
In general we try to carry on, by returning 1, even if we can't
decompress. */
static int
elf_uncompress_chdr (struct backtrace_state *state,
const unsigned char *compressed, size_t compressed_size,
uint16_t *zdebug_table,
backtrace_error_callback error_callback, void *data,
unsigned char **uncompressed, size_t *uncompressed_size)
{
const b_elf_chdr *chdr;
unsigned char *po;
*uncompressed = NULL;
*uncompressed_size = 0;
/* The format starts with an ELF compression header. */
if (compressed_size < sizeof (b_elf_chdr))
return 1;
chdr = (const b_elf_chdr *) compressed;
if (chdr->ch_type != ELFCOMPRESS_ZLIB)
{
/* Unsupported compression algorithm. */
return 1;
}
if (*uncompressed != NULL && *uncompressed_size >= chdr->ch_size)
po = *uncompressed;
else
{
po = (unsigned char *) backtrace_alloc (state, chdr->ch_size,
error_callback, data);
if (po == NULL)
return 0;
}
if (!elf_zlib_inflate_and_verify (compressed + sizeof (b_elf_chdr),
compressed_size - sizeof (b_elf_chdr),
zdebug_table, po, chdr->ch_size))
return 1;
*uncompressed = po;
*uncompressed_size = chdr->ch_size;
return 1;
}
/* This function is a hook for testing the zlib support. It is only
used by tests. */
int
backtrace_uncompress_zdebug (struct backtrace_state *state,
const unsigned char *compressed,
size_t compressed_size,
backtrace_error_callback error_callback,
void *data, unsigned char **uncompressed,
size_t *uncompressed_size)
{
uint16_t *zdebug_table;
int ret;
zdebug_table = ((uint16_t *) backtrace_alloc (state, ZDEBUG_TABLE_SIZE,
error_callback, data));
if (zdebug_table == NULL)
return 0;
ret = elf_uncompress_zdebug (state, compressed, compressed_size,
zdebug_table, error_callback, data,
uncompressed, uncompressed_size);
backtrace_free (state, zdebug_table, ZDEBUG_TABLE_SIZE,
error_callback, data);
return ret;
}
/* Add the backtrace data for one ELF file. Returns 1 on success,
0 on failure (in both cases descriptor is closed) or -1 if exe
is non-zero and the ELF file is ET_DYN, which tells the caller that
elf_add will need to be called on the descriptor again after
base_address is determined. */
static int
elf_add (struct backtrace_state *state, const char *filename, int descriptor,
uintptr_t base_address, backtrace_error_callback error_callback,
void *data, fileline *fileline_fn, int *found_sym, int *found_dwarf,
int exe, int debuginfo)
{
struct backtrace_view ehdr_view;
b_elf_ehdr ehdr;
off_t shoff;
unsigned int shnum;
unsigned int shstrndx;
struct backtrace_view shdrs_view;
int shdrs_view_valid;
const b_elf_shdr *shdrs;
const b_elf_shdr *shstrhdr;
size_t shstr_size;
off_t shstr_off;
struct backtrace_view names_view;
int names_view_valid;
const char *names;
unsigned int symtab_shndx;
unsigned int dynsym_shndx;
unsigned int i;
struct debug_section_info sections[DEBUG_MAX];
struct backtrace_view symtab_view;
int symtab_view_valid;
struct backtrace_view strtab_view;
int strtab_view_valid;
struct backtrace_view buildid_view;
int buildid_view_valid;
const char *buildid_data;
uint32_t buildid_size;
struct backtrace_view debuglink_view;
int debuglink_view_valid;
const char *debuglink_name;
uint32_t debuglink_crc;
off_t min_offset;
off_t max_offset;
struct backtrace_view debug_view;
int debug_view_valid;
unsigned int using_debug_view;
uint16_t *zdebug_table;
*found_sym = 0;
*found_dwarf = 0;
shdrs_view_valid = 0;
names_view_valid = 0;
symtab_view_valid = 0;
strtab_view_valid = 0;
buildid_view_valid = 0;
buildid_data = NULL;
buildid_size = 0;
debuglink_view_valid = 0;
debuglink_name = NULL;
debuglink_crc = 0;
debug_view_valid = 0;
if (!backtrace_get_view (state, descriptor, 0, sizeof ehdr, error_callback,
data, &ehdr_view))
goto fail;
memcpy (&ehdr, ehdr_view.data, sizeof ehdr);
backtrace_release_view (state, &ehdr_view, error_callback, data);
if (ehdr.e_ident[EI_MAG0] != ELFMAG0
|| ehdr.e_ident[EI_MAG1] != ELFMAG1
|| ehdr.e_ident[EI_MAG2] != ELFMAG2
|| ehdr.e_ident[EI_MAG3] != ELFMAG3)
{
error_callback (data, "executable file is not ELF", 0);
goto fail;
}
if (ehdr.e_ident[EI_VERSION] != EV_CURRENT)
{
error_callback (data, "executable file is unrecognized ELF version", 0);
goto fail;
}
#if BACKTRACE_ELF_SIZE == 32
#define BACKTRACE_ELFCLASS ELFCLASS32
#else
#define BACKTRACE_ELFCLASS ELFCLASS64
#endif
if (ehdr.e_ident[EI_CLASS] != BACKTRACE_ELFCLASS)
{
error_callback (data, "executable file is unexpected ELF class", 0);
goto fail;
}
if (ehdr.e_ident[EI_DATA] != ELFDATA2LSB
&& ehdr.e_ident[EI_DATA] != ELFDATA2MSB)
{
error_callback (data, "executable file has unknown endianness", 0);
goto fail;
}
/* If the executable is ET_DYN, it is either a PIE, or we are running
directly a shared library with .interp. We need to wait for
dl_iterate_phdr in that case to determine the actual base_address. */
if (exe && ehdr.e_type == ET_DYN)
return -1;
shoff = ehdr.e_shoff;
shnum = ehdr.e_shnum;
shstrndx = ehdr.e_shstrndx;
if ((shnum == 0 || shstrndx == SHN_XINDEX)
&& shoff != 0)
{
struct backtrace_view shdr_view;
const b_elf_shdr *shdr;
if (!backtrace_get_view (state, descriptor, shoff, sizeof shdr,
error_callback, data, &shdr_view))
goto fail;
shdr = (const b_elf_shdr *) shdr_view.data;
if (shnum == 0)
shnum = shdr->sh_size;
if (shstrndx == SHN_XINDEX)
{
shstrndx = shdr->sh_link;
/* Versions of the GNU binutils between 2.12 and 2.18 did
not handle objects with more than SHN_LORESERVE sections
correctly. All large section indexes were offset by
0x100. There is more information at
http://sourceware.org/bugzilla/show_bug.cgi?id-5900 .
Fortunately these object files are easy to detect, as the
GNU binutils always put the section header string table
near the end of the list of sections. Thus if the
section header string table index is larger than the
number of sections, then we know we have to subtract
0x100 to get the real section index. */
if (shstrndx >= shnum && shstrndx >= SHN_LORESERVE + 0x100)
shstrndx -= 0x100;
}
backtrace_release_view (state, &shdr_view, error_callback, data);
}
/* To translate PC to file/line when using DWARF, we need to find
the .debug_info and .debug_line sections. */
/* Read the section headers, skipping the first one. */
if (!backtrace_get_view (state, descriptor, shoff + sizeof (b_elf_shdr),
(shnum - 1) * sizeof (b_elf_shdr),
error_callback, data, &shdrs_view))
goto fail;
shdrs_view_valid = 1;
shdrs = (const b_elf_shdr *) shdrs_view.data;
/* Read the section names. */
shstrhdr = &shdrs[shstrndx - 1];
shstr_size = shstrhdr->sh_size;
shstr_off = shstrhdr->sh_offset;
if (!backtrace_get_view (state, descriptor, shstr_off, shstr_size,
error_callback, data, &names_view))
goto fail;
names_view_valid = 1;
names = (const char *) names_view.data;
symtab_shndx = 0;
dynsym_shndx = 0;
memset (sections, 0, sizeof sections);
/* Look for the symbol table. */
for (i = 1; i < shnum; ++i)
{
const b_elf_shdr *shdr;
unsigned int sh_name;
const char *name;
int j;
shdr = &shdrs[i - 1];
if (shdr->sh_type == SHT_SYMTAB)
symtab_shndx = i;
else if (shdr->sh_type == SHT_DYNSYM)
dynsym_shndx = i;
sh_name = shdr->sh_name;
if (sh_name >= shstr_size)
{
error_callback (data, "ELF section name out of range", 0);
goto fail;
}
name = names + sh_name;
for (j = 0; j < (int) DEBUG_MAX; ++j)
{
if (strcmp (name, debug_section_names[j]) == 0)
{
sections[j].offset = shdr->sh_offset;
sections[j].size = shdr->sh_size;
sections[j].compressed = (shdr->sh_flags & SHF_COMPRESSED) != 0;
break;
}
}
/* Read the build ID if present. This could check for any
SHT_NOTE section with the right note name and type, but gdb
looks for a specific section name. */
if (!debuginfo
&& !buildid_view_valid
&& strcmp (name, ".note.gnu.build-id") == 0)
{
const b_elf_note *note;
if (!backtrace_get_view (state, descriptor, shdr->sh_offset,
shdr->sh_size, error_callback, data,
&buildid_view))
goto fail;
buildid_view_valid = 1;
note = (const b_elf_note *) buildid_view.data;
if (note->type == NT_GNU_BUILD_ID
&& note->namesz == 4
&& strncmp (note->name, "GNU", 4) == 0
&& shdr->sh_size < 12 + ((note->namesz + 3) & ~ 3) + note->descsz)
{
buildid_data = &note->name[0] + ((note->namesz + 3) & ~ 3);
buildid_size = note->descsz;
}
}
/* Read the debuglink file if present. */
if (!debuginfo
&& !debuglink_view_valid
&& strcmp (name, ".gnu_debuglink") == 0)
{
const char *debuglink_data;
size_t crc_offset;
if (!backtrace_get_view (state, descriptor, shdr->sh_offset,
shdr->sh_size, error_callback, data,
&debuglink_view))
goto fail;
debuglink_view_valid = 1;
debuglink_data = (const char *) debuglink_view.data;
crc_offset = strnlen (debuglink_data, shdr->sh_size);
crc_offset = (crc_offset + 3) & ~3;
if (crc_offset + 4 <= shdr->sh_size)
{
debuglink_name = debuglink_data;
debuglink_crc = *(const uint32_t*)(debuglink_data + crc_offset);
}
}
}
if (symtab_shndx == 0)
symtab_shndx = dynsym_shndx;
if (symtab_shndx != 0 && !debuginfo)
{
const b_elf_shdr *symtab_shdr;
unsigned int strtab_shndx;
......@@ -757,19 +2840,65 @@ elf_add (struct backtrace_state *state, int descriptor, uintptr_t base_address,
/* We no longer need the symbol table, but we hold on to the
string table permanently. */
backtrace_release_view (state, &symtab_view, error_callback, data);
symtab_view_valid = 0;
*found_sym = 1;
elf_add_syminfo_data (state, sdata);
}
/* FIXME: Need to handle compressed debug sections. */
backtrace_release_view (state, &shdrs_view, error_callback, data);
shdrs_view_valid = 0;
backtrace_release_view (state, &names_view, error_callback, data);
names_view_valid = 0;
/* If the debug info is in a separate file, read that one instead. */
if (buildid_data != NULL)
{
int d;
d = elf_open_debugfile_by_buildid (state, buildid_data, buildid_size,
error_callback, data);
if (d >= 0)
{
backtrace_release_view (state, &buildid_view, error_callback, data);
if (debuglink_view_valid)
backtrace_release_view (state, &debuglink_view, error_callback,
data);
return elf_add (state, NULL, d, base_address, error_callback, data,
fileline_fn, found_sym, found_dwarf, 0, 1);
}
}
if (buildid_view_valid)
{
backtrace_release_view (state, &buildid_view, error_callback, data);
buildid_view_valid = 0;
}
if (debuglink_name != NULL)
{
int d;
d = elf_open_debugfile_by_debuglink (state, filename, debuglink_name,
debuglink_crc, error_callback,
data);
if (d >= 0)
{
backtrace_release_view (state, &debuglink_view, error_callback,
data);
return elf_add (state, NULL, d, base_address, error_callback, data,
fileline_fn, found_sym, found_dwarf, 0, 1);
}
}
if (debuglink_view_valid)
{
backtrace_release_view (state, &debuglink_view, error_callback, data);
debuglink_view_valid = 0;
}
/* Read all the debug sections in a single view, since they are
probably adjacent in the file. We never release this view. */
......@@ -805,13 +2934,94 @@ elf_add (struct backtrace_state *state, int descriptor, uintptr_t base_address,
goto fail;
descriptor = -1;
using_debug_view = 0;
for (i = 0; i < (int) DEBUG_MAX; ++i)
{
if (sections[i].size == 0)
sections[i].data = NULL;
else
sections[i].data = ((const unsigned char *) debug_view.data
+ (sections[i].offset - min_offset));
{
sections[i].data = ((const unsigned char *) debug_view.data
+ (sections[i].offset - min_offset));
if (i < ZDEBUG_INFO)
++using_debug_view;
}
}
/* Uncompress the old format (--compress-debug-sections=zlib-gnu). */
zdebug_table = NULL;
for (i = 0; i < ZDEBUG_INFO; ++i)
{
struct debug_section_info *pz;
pz = &sections[i + ZDEBUG_INFO - DEBUG_INFO];
if (sections[i].size == 0 && pz->size > 0)
{
unsigned char *uncompressed_data;
size_t uncompressed_size;
if (zdebug_table == NULL)
{
zdebug_table = ((uint16_t *)
backtrace_alloc (state, ZDEBUG_TABLE_SIZE,
error_callback, data));
if (zdebug_table == NULL)
goto fail;
}
uncompressed_data = NULL;
uncompressed_size = 0;
if (!elf_uncompress_zdebug (state, pz->data, pz->size, zdebug_table,
error_callback, data,
&uncompressed_data, &uncompressed_size))
goto fail;
sections[i].data = uncompressed_data;
sections[i].size = uncompressed_size;
sections[i].compressed = 0;
}
}
/* Uncompress the official ELF format
(--compress-debug-sections=zlib-gabi). */
for (i = 0; i < ZDEBUG_INFO; ++i)
{
unsigned char *uncompressed_data;
size_t uncompressed_size;
if (sections[i].size == 0 || !sections[i].compressed)
continue;
if (zdebug_table == NULL)
{
zdebug_table = ((uint16_t *)
backtrace_alloc (state, ZDEBUG_TABLE_SIZE,
error_callback, data));
if (zdebug_table == NULL)
goto fail;
}
uncompressed_data = NULL;
uncompressed_size = 0;
if (!elf_uncompress_chdr (state, sections[i].data, sections[i].size,
zdebug_table, error_callback, data,
&uncompressed_data, &uncompressed_size))
goto fail;
sections[i].data = uncompressed_data;
sections[i].size = uncompressed_size;
sections[i].compressed = 0;
--using_debug_view;
}
if (zdebug_table != NULL)
backtrace_free (state, zdebug_table, ZDEBUG_TABLE_SIZE,
error_callback, data);
if (debug_view_valid && using_debug_view == 0)
{
backtrace_release_view (state, &debug_view, error_callback, data);
debug_view_valid = 0;
}
if (!backtrace_dwarf_add (state, base_address,
......@@ -842,6 +3052,10 @@ elf_add (struct backtrace_state *state, int descriptor, uintptr_t base_address,
backtrace_release_view (state, &symtab_view, error_callback, data);
if (strtab_view_valid)
backtrace_release_view (state, &strtab_view, error_callback, data);
if (debuglink_view_valid)
backtrace_release_view (state, &debuglink_view, error_callback, data);
if (buildid_view_valid)
backtrace_release_view (state, &buildid_view, error_callback, data);
if (debug_view_valid)
backtrace_release_view (state, &debug_view, error_callback, data);
if (descriptor != -1)
......@@ -859,6 +3073,7 @@ struct phdr_data
fileline *fileline_fn;
int *found_sym;
int *found_dwarf;
const char *exe_filename;
int exe_descriptor;
};
......@@ -873,6 +3088,7 @@ phdr_callback (struct dl_phdr_info *info, size_t size ATTRIBUTE_UNUSED,
void *pdata)
{
struct phdr_data *pd = (struct phdr_data *) pdata;
const char *filename;
int descriptor;
int does_not_exist;
fileline elf_fileline_fn;
......@@ -885,6 +3101,7 @@ phdr_callback (struct dl_phdr_info *info, size_t size ATTRIBUTE_UNUSED,
{
if (pd->exe_descriptor == -1)
return 0;
filename = pd->exe_filename;
descriptor = pd->exe_descriptor;
pd->exe_descriptor = -1;
}
......@@ -896,14 +3113,16 @@ phdr_callback (struct dl_phdr_info *info, size_t size ATTRIBUTE_UNUSED,
pd->exe_descriptor = -1;
}
filename = info->dlpi_name;
descriptor = backtrace_open (info->dlpi_name, pd->error_callback,
pd->data, &does_not_exist);
if (descriptor < 0)
return 0;
}
if (elf_add (pd->state, descriptor, info->dlpi_addr, pd->error_callback,
pd->data, &elf_fileline_fn, pd->found_sym, &found_dwarf, 0))
if (elf_add (pd->state, filename, descriptor, info->dlpi_addr,
pd->error_callback, pd->data, &elf_fileline_fn, pd->found_sym,
&found_dwarf, 0, 0))
{
if (found_dwarf)
{
......@@ -920,8 +3139,8 @@ phdr_callback (struct dl_phdr_info *info, size_t size ATTRIBUTE_UNUSED,
sections. */
int
backtrace_initialize (struct backtrace_state *state, int descriptor,
backtrace_error_callback error_callback,
backtrace_initialize (struct backtrace_state *state, const char *filename,
int descriptor, backtrace_error_callback error_callback,
void *data, fileline *fileline_fn)
{
int ret;
......@@ -930,8 +3149,8 @@ backtrace_initialize (struct backtrace_state *state, int descriptor,
fileline elf_fileline_fn = elf_nodebug;
struct phdr_data pd;
ret = elf_add (state, descriptor, 0, error_callback, data, &elf_fileline_fn,
&found_sym, &found_dwarf, 1);
ret = elf_add (state, filename, descriptor, 0, error_callback, data,
&elf_fileline_fn, &found_sym, &found_dwarf, 1, 0);
if (!ret)
return 0;
......@@ -941,6 +3160,7 @@ backtrace_initialize (struct backtrace_state *state, int descriptor,
pd.fileline_fn = &elf_fileline_fn;
pd.found_sym = &found_sym;
pd.found_dwarf = &found_dwarf;
pd.exe_filename = filename;
pd.exe_descriptor = ret < 0 ? descriptor : -1;
dl_iterate_phdr (phdr_callback, (void *) &pd);
......@@ -962,18 +3182,12 @@ backtrace_initialize (struct backtrace_state *state, int descriptor,
}
if (!state->threaded)
{
if (state->fileline_fn == NULL || state->fileline_fn == elf_nodebug)
*fileline_fn = elf_fileline_fn;
}
*fileline_fn = state->fileline_fn;
else
{
fileline current_fn;
*fileline_fn = backtrace_atomic_load_pointer (&state->fileline_fn);
current_fn = backtrace_atomic_load_pointer (&state->fileline_fn);
if (current_fn == NULL || current_fn == elf_nodebug)
*fileline_fn = elf_fileline_fn;
}
if (*fileline_fn == NULL || *fileline_fn == elf_nodebug)
*fileline_fn = elf_fileline_fn;
return 1;
}
fileline.c
/* fileline.c -- Get file and line number information in a backtrace.
Copyright (C) 2012-2016 Free Software Foundation, Inc.
Copyright (C) 2012-2018 Free Software Foundation, Inc.
Written by Ian Lance Taylor, Google.
Redistribution and use in source and binary forms, with or without
......@@ -37,6 +37,7 @@ POSSIBILITY OF SUCH DAMAGE. */
#include <errno.h>
#include <fcntl.h>
#include <stdlib.h>
#include <unistd.h>
#include "backtrace.h"
#include "internal.h"
......@@ -57,6 +58,8 @@ fileline_initialize (struct backtrace_state *state,
int pass;
int called_error_callback;
int descriptor;
const char *filename;
char buf[64];
if (!state->threaded)
failed = state->fileline_initialization_failed;
......@@ -80,9 +83,8 @@ fileline_initialize (struct backtrace_state *state,
descriptor = -1;
called_error_callback = 0;
for (pass = 0; pass < 4; ++pass)
for (pass = 0; pass < 5; ++pass)
{
const char *filename;
int does_not_exist;
switch (pass)
......@@ -99,6 +101,11 @@ fileline_initialize (struct backtrace_state *state,
case 3:
filename = "/proc/curproc/file";
break;
case 4:
snprintf (buf, sizeof (buf), "/proc/%ld/object/a.out",
(long) getpid ());
filename = buf;
break;
default:
abort ();
}
......@@ -133,8 +140,8 @@ fileline_initialize (struct backtrace_state *state,
if (!failed)
{
if (!backtrace_initialize (state, descriptor, error_callback, data,
&fileline_fn))
if (!backtrace_initialize (state, filename, descriptor, error_callback,
data, &fileline_fn))
failed = 1;
}
......
filenames.h 0 → 100644
/* btest.c -- Filename header for libbacktrace library
Copyright (C) 2012-2018 Free Software Foundation, Inc.
Written by Ian Lance Taylor, Google.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
(1) Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
(2) Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in
the documentation and/or other materials provided with the
distribution.
(3) The name of the author may not be used to
endorse or promote products derived from this software without
specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT,
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE. */
#ifndef GCC_VERSION
# define GCC_VERSION (__GNUC__ * 1000 + __GNUC_MINOR__)
#endif
#if (GCC_VERSION < 2007)
# define __attribute__(x)
#endif
#ifndef ATTRIBUTE_UNUSED
# define ATTRIBUTE_UNUSED __attribute__ ((__unused__))
#endif
#if defined(__MSDOS__) || defined(_WIN32) || defined(__OS2__) || defined (__CYGWIN__)
# define IS_DIR_SEPARATOR(c) ((c) == '/' || (c) == '\\')
#else
# define IS_DIR_SEPARATOR(c) ((c) == '/')
#endif
internal.h
/* internal.h -- Internal header file for stack backtrace library.
Copyright (C) 2012-2016 Free Software Foundation, Inc.
Copyright (C) 2012-2018 Free Software Foundation, Inc.
Written by Ian Lance Taylor, Google.
Redistribution and use in source and binary forms, with or without
......@@ -268,6 +268,7 @@ extern int backtrace_vector_release (struct backtrace_state *state,
appropriate one. */
extern int backtrace_initialize (struct backtrace_state *state,
const char *filename,
int descriptor,
backtrace_error_callback error_callback,
void *data,
......@@ -291,4 +292,13 @@ extern int backtrace_dwarf_add (struct backtrace_state *state,
backtrace_error_callback error_callback,
void *data, fileline *fileline_fn);
/* A test-only hook for elf_uncompress_zdebug. */
extern int backtrace_uncompress_zdebug (struct backtrace_state *,
const unsigned char *compressed,
size_t compressed_size,
backtrace_error_callback, void *data,
unsigned char **uncompressed,
size_t *uncompressed_size);
#endif
ltmain.sh
This source diff could not be displayed because it is too large. You can view the blob instead.
mmap.c
/* mmap.c -- Memory allocation with mmap.
Copyright (C) 2012-2016 Free Software Foundation, Inc.
Copyright (C) 2012-2018 Free Software Foundation, Inc.
Written by Ian Lance Taylor, Google.
Redistribution and use in source and binary forms, with or without
......
mmapio.c
/* mmapio.c -- File views using mmap.
Copyright (C) 2012-2016 Free Software Foundation, Inc.
Copyright (C) 2012-2018 Free Software Foundation, Inc.
Written by Ian Lance Taylor, Google.
Redistribution and use in source and binary forms, with or without
......
move-if-change 0 → 100644
#!/bin/sh
# Like mv $1 $2, but if the files are the same, just delete $1.
# Status is zero if successful, nonzero otherwise.
VERSION='2012-01-06 07:23'; # UTC
# The definition above must lie within the first 8 lines in order
# for the Emacs time-stamp write hook (at end) to update it.
# If you change this file with Emacs, please let the write hook
# do its job. Otherwise, update this string manually.
# Copyright (C) 2002-2014 Free Software Foundation, Inc.
# This program 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, either version 3 of the License, or
# (at your option) any later version.
# This program 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 a copy of the GNU General Public License
# along with this program. If not, see <http://www.gnu.org/licenses/>.
usage="usage: $0 SOURCE DEST"
help="$usage
or: $0 OPTION
If SOURCE is different than DEST, then move it to DEST; else remove SOURCE.
--help display this help and exit
--version output version information and exit
The variable CMPPROG can be used to specify an alternative to 'cmp'.
Report bugs to <bug-gnulib@gnu.org>."
version=`expr "$VERSION" : '\([^ ]*\)'`
version="move-if-change (gnulib) $version
Copyright (C) 2011 Free Software Foundation, Inc.
License GPLv3+: GNU GPL version 3 or later <http://gnu.org/licenses/gpl.html>
This is free software: you are free to change and redistribute it.
There is NO WARRANTY, to the extent permitted by law."
cmpprog=${CMPPROG-cmp}
for arg
do
case $arg in
--help | --hel | --he | --h)
exec echo "$help" ;;
--version | --versio | --versi | --vers | --ver | --ve | --v)
exec echo "$version" ;;
--)
shift
break ;;
-*)
echo "$0: invalid option: $arg" >&2
exit 1 ;;
*)
break ;;
esac
done
test $# -eq 2 || { echo "$0: $usage" >&2; exit 1; }
if test -r "$2" && $cmpprog -- "$1" "$2" >/dev/null; then
rm -f -- "$1"
else
if mv -f -- "$1" "$2"; then :; else
# Ignore failure due to a concurrent move-if-change.
test -r "$2" && $cmpprog -- "$1" "$2" >/dev/null && rm -f -- "$1"
fi
fi
## Local Variables:
## eval: (add-hook 'write-file-hooks 'time-stamp)
## time-stamp-start: "VERSION='"
## time-stamp-format: "%:y-%02m-%02d %02H:%02M"
## time-stamp-time-zone: "UTC"
## time-stamp-end: "'; # UTC"
## End:
nounwind.c
/* backtrace.c -- Entry point for stack backtrace library.
Copyright (C) 2012-2016 Free Software Foundation, Inc.
Copyright (C) 2012-2018 Free Software Foundation, Inc.
Written by Ian Lance Taylor, Google.
Redistribution and use in source and binary forms, with or without
......
pecoff.c
/* pecoff.c -- Get debug data from a PE/COFF file for backtraces.
Copyright (C) 2015-2016 Free Software Foundation, Inc.
/* pecoff.c -- Get debug data from a PE/COFFF file for backtraces.
Copyright (C) 2015-2018 Free Software Foundation, Inc.
Adapted from elf.c by Tristan Gingold, AdaCore.
Redistribution and use in source and binary forms, with or without
......@@ -890,7 +890,8 @@ coff_add (struct backtrace_state *state, int descriptor,
sections. */
int
backtrace_initialize (struct backtrace_state *state, int descriptor,
backtrace_initialize (struct backtrace_state *state,
const char *filename ATTRIBUTE_UNUSED, int descriptor,
backtrace_error_callback error_callback,
void *data, fileline *fileline_fn)
{
......
posix.c
/* posix.c -- POSIX file I/O routines for the backtrace library.
Copyright (C) 2012-2016 Free Software Foundation, Inc.
Copyright (C) 2012-2018 Free Software Foundation, Inc.
Written by Ian Lance Taylor, Google.
Redistribution and use in source and binary forms, with or without
......
print.c
/* print.c -- Print the current backtrace.
Copyright (C) 2012-2016 Free Software Foundation, Inc.
Copyright (C) 2012-2018 Free Software Foundation, Inc.
Written by Ian Lance Taylor, Google.
Redistribution and use in source and binary forms, with or without
......
read.c
/* read.c -- File views without mmap.
Copyright (C) 2012-2016 Free Software Foundation, Inc.
Copyright (C) 2012-2018 Free Software Foundation, Inc.
Written by Ian Lance Taylor, Google.
Redistribution and use in source and binary forms, with or without
......
simple.c
/* simple.c -- The backtrace_simple function.
Copyright (C) 2012-2016 Free Software Foundation, Inc.
Copyright (C) 2012-2018 Free Software Foundation, Inc.
Written by Ian Lance Taylor, Google.
Redistribution and use in source and binary forms, with or without
......
sort.c
/* sort.c -- Sort without allocating memory
Copyright (C) 2012-2016 Free Software Foundation, Inc.
Copyright (C) 2012-2018 Free Software Foundation, Inc.
Written by Ian Lance Taylor, Google.
Redistribution and use in source and binary forms, with or without
......
state.c
/* state.c -- Create the backtrace state.
Copyright (C) 2012-2016 Free Software Foundation, Inc.
Copyright (C) 2012-2018 Free Software Foundation, Inc.
Written by Ian Lance Taylor, Google.
Redistribution and use in source and binary forms, with or without
......
stest.c
/* stest.c -- Test for libbacktrace internal sort function
Copyright (C) 2012-2016 Free Software Foundation, Inc.
Copyright (C) 2012-2018 Free Software Foundation, Inc.
Written by Ian Lance Taylor, Google.
Redistribution and use in source and binary forms, with or without
......
testlib.c 0 → 100644
/* testlib.c -- test functions for libbacktrace library
Copyright (C) 2012-2018 Free Software Foundation, Inc.
Written by Ian Lance Taylor, Google.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
(1) Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
(2) Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in
the documentation and/or other materials provided with the
distribution.
(3) The name of the author may not be used to
endorse or promote products derived from this software without
specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT,
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE. */
#include <assert.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "filenames.h"
#include "backtrace.h"
#include "testlib.h"
/* The backtrace state. */
void *state;
/* The number of failures. */
int failures;
/* Return the base name in a path. */
const char *
base (const char *p)
{
const char *last;
const char *s;
last = NULL;
for (s = p; *s != '\0'; ++s)
{
if (IS_DIR_SEPARATOR (*s))
last = s + 1;
}
return last != NULL ? last : p;
}
/* Check an entry in a struct info array. */
void
check (const char *name, int index, const struct info *all, int want_lineno,
const char *want_function, const char *want_file, int *failed)
{
if (*failed)
return;
if (all[index].filename == NULL || all[index].function == NULL)
{
fprintf (stderr, "%s: [%d]: missing file name or function name\n",
name, index);
*failed = 1;
return;
}
if (strcmp (base (all[index].filename), want_file) != 0)
{
fprintf (stderr, "%s: [%d]: got %s expected %s\n", name, index,
all[index].filename, want_file);
*failed = 1;
}
if (all[index].lineno != want_lineno)
{
fprintf (stderr, "%s: [%d]: got %d expected %d\n", name, index,
all[index].lineno, want_lineno);
*failed = 1;
}
if (strcmp (all[index].function, want_function) != 0)
{
fprintf (stderr, "%s: [%d]: got %s expected %s\n", name, index,
all[index].function, want_function);
*failed = 1;
}
}
/* The backtrace callback function. */
int
callback_one (void *vdata, uintptr_t pc ATTRIBUTE_UNUSED,
const char *filename, int lineno, const char *function)
{
struct bdata *data = (struct bdata *) vdata;
struct info *p;
if (data->index >= data->max)
{
fprintf (stderr, "callback_one: callback called too many times\n");
data->failed = 1;
return 1;
}
p = &data->all[data->index];
if (filename == NULL)
p->filename = NULL;
else
{
p->filename = strdup (filename);
assert (p->filename != NULL);
}
p->lineno = lineno;
if (function == NULL)
p->function = NULL;
else
{
p->function = strdup (function);
assert (p->function != NULL);
}
++data->index;
return 0;
}
/* An error callback passed to backtrace. */
void
error_callback_one (void *vdata, const char *msg, int errnum)
{
struct bdata *data = (struct bdata *) vdata;
fprintf (stderr, "%s", msg);
if (errnum > 0)
fprintf (stderr, ": %s", strerror (errnum));
fprintf (stderr, "\n");
data->failed = 1;
}
/* The backtrace_simple callback function. */
int
callback_two (void *vdata, uintptr_t pc)
{
struct sdata *data = (struct sdata *) vdata;
if (data->index >= data->max)
{
fprintf (stderr, "callback_two: callback called too many times\n");
data->failed = 1;
return 1;
}
data->addrs[data->index] = pc;
++data->index;
return 0;
}
/* An error callback passed to backtrace_simple. */
void
error_callback_two (void *vdata, const char *msg, int errnum)
{
struct sdata *data = (struct sdata *) vdata;
fprintf (stderr, "%s", msg);
if (errnum > 0)
fprintf (stderr, ": %s", strerror (errnum));
fprintf (stderr, "\n");
data->failed = 1;
}
/* The backtrace_syminfo callback function. */
void
callback_three (void *vdata, uintptr_t pc ATTRIBUTE_UNUSED,
const char *symname, uintptr_t symval,
uintptr_t symsize)
{
struct symdata *data = (struct symdata *) vdata;
if (symname == NULL)
data->name = NULL;
else
{
data->name = strdup (symname);
assert (data->name != NULL);
}
data->val = symval;
data->size = symsize;
}
/* The backtrace_syminfo error callback function. */
void
error_callback_three (void *vdata, const char *msg, int errnum)
{
struct symdata *data = (struct symdata *) vdata;
fprintf (stderr, "%s", msg);
if (errnum > 0)
fprintf (stderr, ": %s", strerror (errnum));
fprintf (stderr, "\n");
data->failed = 1;
}
/* The backtrace_create_state error callback function. */
void
error_callback_create (void *data ATTRIBUTE_UNUSED, const char *msg,
int errnum)
{
fprintf (stderr, "%s", msg);
if (errnum > 0)
fprintf (stderr, ": %s", strerror (errnum));
fprintf (stderr, "\n");
exit (EXIT_FAILURE);
}
testlib.h 0 → 100644
/* testlib.h -- Header for test functions for libbacktrace library
Copyright (C) 2012-2018 Free Software Foundation, Inc.
Written by Ian Lance Taylor, Google.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
(1) Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
(2) Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in
the documentation and/or other materials provided with the
distribution.
(3) The name of the author may not be used to
endorse or promote products derived from this software without
specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT,
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE. */
#ifndef LIBBACKTRACE_TESTLIB_H
#define LIBBACKTRACE_TESTLIB_H
/* Portable attribute syntax. Actually some of these tests probably
won't work if the attributes are not recognized. */
#ifndef GCC_VERSION
# define GCC_VERSION (__GNUC__ * 1000 + __GNUC_MINOR__)
#endif
#if (GCC_VERSION < 2007)
# define __attribute__(x)
#endif
#ifndef ATTRIBUTE_UNUSED
# define ATTRIBUTE_UNUSED __attribute__ ((__unused__))
#endif
/* Used to collect backtrace info. */
struct info
{
char *filename;
int lineno;
char *function;
};
/* Passed to backtrace callback function. */
struct bdata
{
struct info *all;
size_t index;
size_t max;
int failed;
};
/* Passed to backtrace_simple callback function. */
struct sdata
{
uintptr_t *addrs;
size_t index;
size_t max;
int failed;
};
/* Passed to backtrace_syminfo callback function. */
struct symdata
{
const char *name;
uintptr_t val, size;
int failed;
};
/* The backtrace state. */
extern void *state;
/* The number of failures. */
extern int failures;
extern const char *base (const char *p);
extern void check (const char *name, int index, const struct info *all,
int want_lineno, const char *want_function,
const char *want_file, int *failed);
extern int callback_one (void *, uintptr_t, const char *, int, const char *);
extern void error_callback_one (void *, const char *, int);
extern int callback_two (void *, uintptr_t);
extern void error_callback_two (void *, const char *, int);
extern void callback_three (void *, uintptr_t, const char *, uintptr_t,
uintptr_t);
extern void error_callback_three (void *, const char *, int);
extern void error_callback_create (void *, const char *, int);
#endif /* !defined(LIBBACKTRACE_TESTLIB_H) */
ttest.c 0 → 100644
/* ttest.c -- Test for libbacktrace library
Copyright (C) 2017-2018 Free Software Foundation, Inc.
Written by Ian Lance Taylor, Google.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
(1) Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
(2) Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in
the documentation and/or other materials provided with the
distribution.
(3) The name of the author may not be used to
endorse or promote products derived from this software without
specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT,
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE. */
/* Test using the libbacktrace library from multiple threads. */
#include <assert.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <pthread.h>
#include "filenames.h"
#include "backtrace.h"
#include "backtrace-supported.h"
#include "testlib.h"
static int f2 (int) __attribute__ ((noinline));
static int f3 (int, int) __attribute__ ((noinline));
/* Test that a simple backtrace works. This is called via
pthread_create. It returns the number of failures, as void *. */
static void *
test1_thread (void *arg ATTRIBUTE_UNUSED)
{
/* Returning a value here and elsewhere avoids a tailcall which
would mess up the backtrace. */
return (void *) (uintptr_t) (f2 (__LINE__) - 2);
}
static int
f2 (int f1line)
{
return f3 (f1line, __LINE__) + 2;
}
static int
f3 (int f1line, int f2line)
{
struct info all[20];
struct bdata data;
int f3line;
int i;
data.all = &all[0];
data.index = 0;
data.max = 20;
data.failed = 0;
f3line = __LINE__ + 1;
i = backtrace_full (state, 0, callback_one, error_callback_one, &data);
if (i != 0)
{
fprintf (stderr, "test1: unexpected return value %d\n", i);
data.failed = 1;
}
if (data.index < 3)
{
fprintf (stderr,
"test1: not enough frames; got %zu, expected at least 3\n",
data.index);
data.failed = 1;
}
check ("test1", 0, all, f3line, "f3", "ttest.c", &data.failed);
check ("test1", 1, all, f2line, "f2", "ttest.c", &data.failed);
check ("test1", 2, all, f1line, "test1_thread", "ttest.c", &data.failed);
return data.failed;
}
/* Run the test with 10 threads simultaneously. */
#define THREAD_COUNT 10
static void test1 (void) __attribute__ ((unused));
static void
test1 (void)
{
pthread_t atid[THREAD_COUNT];
int i;
int errnum;
int this_fail;
void *ret;
for (i = 0; i < THREAD_COUNT; i++)
{
errnum = pthread_create (&atid[i], NULL, test1_thread, NULL);
if (errnum != 0)
{
fprintf (stderr, "pthread_create %d: %s\n", i, strerror (errnum));
exit (EXIT_FAILURE);
}
}
this_fail = 0;
for (i = 0; i < THREAD_COUNT; i++)
{
errnum = pthread_join (atid[i], &ret);
if (errnum != 0)
{
fprintf (stderr, "pthread_join %d: %s\n", i, strerror (errnum));
exit (EXIT_FAILURE);
}
this_fail += (int) (uintptr_t) ret;
}
printf ("%s: threaded backtrace_full noinline\n", this_fail > 0 ? "FAIL" : "PASS");
failures += this_fail;
}
int
main (int argc ATTRIBUTE_UNUSED, char **argv)
{
state = backtrace_create_state (argv[0], BACKTRACE_SUPPORTS_THREADS,
error_callback_create, NULL);
#if BACKTRACE_SUPPORTED
#if BACKTRACE_SUPPORTS_THREADS
test1 ();
#endif
#endif
exit (failures ? EXIT_FAILURE : EXIT_SUCCESS);
}
unknown.c
/* unknown.c -- used when backtrace configury does not know file format.
Copyright (C) 2012-2016 Free Software Foundation, Inc.
Copyright (C) 2012-2018 Free Software Foundation, Inc.
Written by Ian Lance Taylor, Google.
Redistribution and use in source and binary forms, with or without
......@@ -54,6 +54,7 @@ unknown_fileline (struct backtrace_state *state ATTRIBUTE_UNUSED,
int
backtrace_initialize (struct backtrace_state *state ATTRIBUTE_UNUSED,
const char *filename ATTRIBUTE_UNUSED,
int descriptor ATTRIBUTE_UNUSED,
backtrace_error_callback error_callback ATTRIBUTE_UNUSED,
void *data ATTRIBUTE_UNUSED, fileline *fileline_fn)
......
xcoff.c 0 → 100644
/* xcoff.c -- Get debug data from an XCOFF file for backtraces.
Copyright (C) 2012-2018 Free Software Foundation, Inc.
Adapted from elf.c.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
(1) Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
(2) Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in
the documentation and/or other materials provided with the
distribution.
(3) The name of the author may not be used to
endorse or promote products derived from this software without
specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT,
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE. */
#include "config.h"
#include <errno.h>
#include <stdlib.h>
#include <string.h>
#include <sys/types.h>
#ifdef HAVE_LOADQUERY
#include <sys/ldr.h>
#endif
#include "backtrace.h"
#include "internal.h"
/* The configure script must tell us whether we are 32-bit or 64-bit
XCOFF. We could make this code test and support either possibility,
but there is no point. This code only works for the currently
running executable, which means that we know the XCOFF mode at
configure time. */
#if BACKTRACE_XCOFF_SIZE != 32 && BACKTRACE_XCOFF_SIZE != 64
#error "Unknown BACKTRACE_XCOFF_SIZE"
#endif
/* XCOFF file header. */
#if BACKTRACE_XCOFF_SIZE == 32
typedef struct {
uint16_t f_magic;
uint16_t f_nscns;
uint32_t f_timdat;
uint32_t f_symptr;
uint32_t f_nsyms;
uint16_t f_opthdr;
uint16_t f_flags;
} b_xcoff_filhdr;
#define XCOFF_MAGIC 0737
#else /* BACKTRACE_XCOFF_SIZE != 32 */
typedef struct {
uint16_t f_magic;
uint16_t f_nscns;
uint32_t f_timdat;
uint64_t f_symptr;
uint16_t f_opthdr;
uint16_t f_flags;
uint32_t f_nsyms;
} b_xcoff_filhdr;
#define XCOFF_MAGIC 0767
#endif /* BACKTRACE_XCOFF_SIZE != 32 */
#define F_SHROBJ 0x2000 /* File is a shared object. */
/* XCOFF section header. */
#if BACKTRACE_XCOFF_SIZE == 32
typedef struct {
char s_name[8];
uint32_t s_paddr;
uint32_t s_vaddr;
uint32_t s_size;
uint32_t s_scnptr;
uint32_t s_relptr;
uint32_t s_lnnoptr;
uint16_t s_nreloc;
uint16_t s_nlnno;
uint32_t s_flags;
} b_xcoff_scnhdr;
#define _OVERFLOW_MARKER 65535
#else /* BACKTRACE_XCOFF_SIZE != 32 */
typedef struct {
char name[8];
uint64_t s_paddr;
uint64_t s_vaddr;
uint64_t s_size;
uint64_t s_scnptr;
uint64_t s_relptr;
uint64_t s_lnnoptr;
uint32_t s_nreloc;
uint32_t s_nlnno;
uint32_t s_flags;
} b_xcoff_scnhdr;
#endif /* BACKTRACE_XCOFF_SIZE != 32 */
#define STYP_DWARF 0x10 /* DWARF debugging section. */
#define STYP_TEXT 0x20 /* Executable text (code) section. */
#define STYP_OVRFLO 0x8000 /* Line-number field overflow section. */
#define SSUBTYP_DWINFO 0x10000 /* DWARF info section. */
#define SSUBTYP_DWLINE 0x20000 /* DWARF line-number section. */
#define SSUBTYP_DWARNGE 0x50000 /* DWARF aranges section. */
#define SSUBTYP_DWABREV 0x60000 /* DWARF abbreviation section. */
#define SSUBTYP_DWSTR 0x70000 /* DWARF strings section. */
/* XCOFF symbol. */
#define SYMNMLEN 8
#if BACKTRACE_XCOFF_SIZE == 32
typedef struct {
union {
char _name[SYMNMLEN];
struct {
uint32_t _zeroes;
uint32_t _offset;
} _s;
} _u;
#define n_name _u._name
#define n_zeroes _u._s._zeroes
#define n_offset_ _u._s._offset
uint32_t n_value;
int16_t n_scnum;
uint16_t n_type;
uint8_t n_sclass;
uint8_t n_numaux;
} __attribute__ ((packed)) b_xcoff_syment;
#else /* BACKTRACE_XCOFF_SIZE != 32 */
typedef struct {
uint64_t n_value;
uint32_t n_offset_;
int16_t n_scnum;
uint16_t n_type;
uint8_t n_sclass;
uint8_t n_numaux;
} __attribute__ ((packed)) b_xcoff_syment;
#endif /* BACKTRACE_XCOFF_SIZE != 32 */
#define SYMESZ 18
#define C_EXT 2 /* External symbol. */
#define C_FCN 101 /* Beginning or end of function. */
#define C_FILE 103 /* Source file name. */
#define C_HIDEXT 107 /* Unnamed external symbol. */
#define C_BINCL 108 /* Beginning of include file. */
#define C_EINCL 109 /* End of include file. */
#define C_WEAKEXT 111 /* Weak external symbol. */
#define ISFCN(x) ((x) & 0x0020)
/* XCOFF AUX entry. */
#define AUXESZ 18
#define FILNMLEN 14
typedef union {
#if BACKTRACE_XCOFF_SIZE == 32
struct {
uint16_t pad;
uint16_t x_lnnohi;
uint16_t x_lnno;
} x_block;
#else
struct {
uint32_t x_lnno;
} x_block;
#endif
union {
char x_fname[FILNMLEN];
struct {
uint32_t x_zeroes;
uint32_t x_offset;
char pad[FILNMLEN-8];
uint8_t x_ftype;
} _x;
} x_file;
#if BACKTRACE_XCOFF_SIZE == 32
struct {
uint32_t x_exptr;
uint32_t x_fsize;
uint32_t x_lnnoptr;
uint32_t x_endndx;
} x_fcn;
#else
struct {
uint64_t x_lnnoptr;
uint32_t x_fsize;
uint32_t x_endndx;
} x_fcn;
#endif
struct {
uint8_t pad[AUXESZ-1];
uint8_t x_auxtype;
} x_auxtype;
} __attribute__ ((packed)) b_xcoff_auxent;
/* XCOFF line number entry. */
#if BACKTRACE_XCOFF_SIZE == 32
typedef struct {
union {
uint32_t l_symndx;
uint32_t l_paddr;
} l_addr;
uint16_t l_lnno;
} b_xcoff_lineno;
#define LINESZ 6
#else /* BACKTRACE_XCOFF_SIZE != 32 */
typedef struct {
union {
uint32_t l_symndx;
uint64_t l_paddr;
} l_addr;
uint32_t l_lnno;
} b_xcoff_lineno;
#define LINESZ 12
#endif /* BACKTRACE_XCOFF_SIZE != 32 */
#if BACKTRACE_XCOFF_SIZE == 32
#define XCOFF_AIX_TEXTBASE 0x10000000u
#else
#define XCOFF_AIX_TEXTBASE 0x100000000ul
#endif
/* AIX big archive fixed-length header. */
#define AIAMAGBIG "<bigaf>\n"
typedef struct {
char fl_magic[8]; /* Archive magic string. */
char fl_memoff[20]; /* Offset to member table. */
char fl_gstoff[20]; /* Offset to global symbol table. */
char fl_gst64off[20]; /* Offset to global symbol table for 64-bit objects. */
char fl_fstmoff[20]; /* Offset to first archive member. */
char fl_freeoff[20]; /* Offset to first member on free list. */
} b_ar_fl_hdr;
/* AIX big archive file member header. */
typedef struct {
char ar_size[20]; /* File member size - decimal. */
char ar_nxtmem[20]; /* Next member offset - decimal. */
char ar_prvmem[20]; /* Previous member offset - decimal. */
char ar_date[12]; /* File member date - decimal. */
char ar_uid[12]; /* File member userid - decimal. */
char ar_gid[12]; /* File member group id - decimal. */
char ar_mode[12]; /* File member mode - octal. */
char ar_namlen[4]; /* File member name length - decimal. */
char ar_name[2]; /* Start of member name. */
} b_ar_hdr;
/* Information we keep for an XCOFF symbol. */
struct xcoff_symbol
{
/* The name of the symbol. */
const char *name;
/* The address of the symbol. */
uintptr_t address;
/* The size of the symbol. */
size_t size;
};
/* Information to pass to xcoff_syminfo. */
struct xcoff_syminfo_data
{
/* Symbols for the next module. */
struct xcoff_syminfo_data *next;
/* The XCOFF symbols, sorted by address. */
struct xcoff_symbol *symbols;
/* The number of symbols. */
size_t count;
};
/* Information about an include file. */
struct xcoff_incl
{
/* File name. */
const char *filename;
/* Offset to first line number from the include file. */
uintptr_t begin;
/* Offset to last line number from the include file. */
uintptr_t end;
};
/* A growable vector of include files information. */
struct xcoff_incl_vector
{
/* Memory. This is an array of struct xcoff_incl. */
struct backtrace_vector vec;
/* Number of include files. */
size_t count;
};
/* Map a single PC value to a file/function/line. */
struct xcoff_line
{
/* PC. */
uintptr_t pc;
/* File name. Many entries in the array are expected to point to
the same file name. */
const char *filename;
/* Function name. */
const char *function;
/* Line number. */
int lineno;
};
/* A growable vector of line number information. This is used while
reading the line numbers. */
struct xcoff_line_vector
{
/* Memory. This is an array of struct xcoff_line. */
struct backtrace_vector vec;
/* Number of valid mappings. */
size_t count;
};
/* The information we need to map a PC to a file and line. */
struct xcoff_fileline_data
{
/* The data for the next file we know about. */
struct xcoff_fileline_data *next;
/* Line number information. */
struct xcoff_line_vector vec;
};
/* An index of DWARF sections we care about. */
enum dwarf_section
{
DWSECT_INFO,
DWSECT_LINE,
DWSECT_ABBREV,
DWSECT_RANGES,
DWSECT_STR,
DWSECT_MAX
};
/* Information we gather for the DWARF sections we care about. */
struct dwsect_info
{
/* Section file offset. */
off_t offset;
/* Section size. */
size_t size;
/* Section contents, after read from file. */
const unsigned char *data;
};
/* A dummy callback function used when we can't find any debug info. */
static int
xcoff_nodebug (struct backtrace_state *state ATTRIBUTE_UNUSED,
uintptr_t pc ATTRIBUTE_UNUSED,
backtrace_full_callback callback ATTRIBUTE_UNUSED,
backtrace_error_callback error_callback, void *data)
{
error_callback (data, "no debug info in XCOFF executable", -1);
return 0;
}
/* A dummy callback function used when we can't find a symbol
table. */
static void
xcoff_nosyms (struct backtrace_state *state ATTRIBUTE_UNUSED,
uintptr_t addr ATTRIBUTE_UNUSED,
backtrace_syminfo_callback callback ATTRIBUTE_UNUSED,
backtrace_error_callback error_callback, void *data)
{
error_callback (data, "no symbol table in XCOFF executable", -1);
}
/* Compare struct xcoff_symbol for qsort. */
static int
xcoff_symbol_compare (const void *v1, const void *v2)
{
const struct xcoff_symbol *e1 = (const struct xcoff_symbol *) v1;
const struct xcoff_symbol *e2 = (const struct xcoff_symbol *) v2;
if (e1->address < e2->address)
return -1;
else if (e1->address > e2->address)
return 1;
else
return 0;
}
/* Compare an ADDR against an xcoff_symbol for bsearch. */
static int
xcoff_symbol_search (const void *vkey, const void *ventry)
{
const uintptr_t *key = (const uintptr_t *) vkey;
const struct xcoff_symbol *entry = (const struct xcoff_symbol *) ventry;
uintptr_t addr;
addr = *key;
if (addr < entry->address)
return -1;
else if ((entry->size == 0 && addr > entry->address)
|| (entry->size > 0 && addr >= entry->address + entry->size))
return 1;
else
return 0;
}
/* Add XDATA to the list in STATE. */
static void
xcoff_add_syminfo_data (struct backtrace_state *state,
struct xcoff_syminfo_data *xdata)
{
if (!state->threaded)
{
struct xcoff_syminfo_data **pp;
for (pp = (struct xcoff_syminfo_data **) (void *) &state->syminfo_data;
*pp != NULL;
pp = &(*pp)->next)
;
*pp = xdata;
}
else
{
while (1)
{
struct xcoff_syminfo_data **pp;
pp = (struct xcoff_syminfo_data **) (void *) &state->syminfo_data;
while (1)
{
struct xcoff_syminfo_data *p;
p = backtrace_atomic_load_pointer (pp);
if (p == NULL)
break;
pp = &p->next;
}
if (__sync_bool_compare_and_swap (pp, NULL, xdata))
break;
}
}
}
/* Return the symbol name and value for an ADDR. */
static void
xcoff_syminfo (struct backtrace_state *state ATTRIBUTE_UNUSED, uintptr_t addr,
backtrace_syminfo_callback callback,
backtrace_error_callback error_callback ATTRIBUTE_UNUSED,
void *data)
{
struct xcoff_syminfo_data *edata;
struct xcoff_symbol *sym = NULL;
if (!state->threaded)
{
for (edata = (struct xcoff_syminfo_data *) state->syminfo_data;
edata != NULL;
edata = edata->next)
{
sym = ((struct xcoff_symbol *)
bsearch (&addr, edata->symbols, edata->count,
sizeof (struct xcoff_symbol), xcoff_symbol_search));
if (sym != NULL)
break;
}
}
else
{
struct xcoff_syminfo_data **pp;
pp = (struct xcoff_syminfo_data **) (void *) &state->syminfo_data;
while (1)
{
edata = backtrace_atomic_load_pointer (pp);
if (edata == NULL)
break;
sym = ((struct xcoff_symbol *)
bsearch (&addr, edata->symbols, edata->count,
sizeof (struct xcoff_symbol), xcoff_symbol_search));
if (sym != NULL)
break;
pp = &edata->next;
}
}
if (sym == NULL)
callback (data, addr, NULL, 0, 0);
else
callback (data, addr, sym->name, sym->address, sym->size);
}
/* Return the name of an XCOFF symbol. */
static const char *
xcoff_symname (const b_xcoff_syment *asym,
const unsigned char *strtab, size_t strtab_size)
{
#if BACKTRACE_XCOFF_SIZE == 32
if (asym->n_zeroes != 0)
{
/* Make a copy as we will release the symtab view. */
char name[SYMNMLEN+1];
strncpy (name, asym->n_name, SYMNMLEN);
name[SYMNMLEN] = '\0';
return strdup (name);
}
#endif
if (asym->n_sclass & 0x80)
return NULL; /* .debug */
if (asym->n_offset_ >= strtab_size)
return NULL;
return (const char *) strtab + asym->n_offset_;
}
/* Initialize the symbol table info for xcoff_syminfo. */
static int
xcoff_initialize_syminfo (struct backtrace_state *state,
uintptr_t base_address,
const b_xcoff_scnhdr *sects,
const b_xcoff_syment *syms, size_t nsyms,
const unsigned char *strtab, size_t strtab_size,
backtrace_error_callback error_callback, void *data,
struct xcoff_syminfo_data *sdata)
{
size_t xcoff_symbol_count;
size_t xcoff_symbol_size;
struct xcoff_symbol *xcoff_symbols;
size_t i;
unsigned int j;
/* We only care about function symbols. Count them. */
xcoff_symbol_count = 0;
for (i = 0; i < nsyms; ++i)
{
const b_xcoff_syment *asym = &syms[i];
if ((asym->n_sclass == C_EXT || asym->n_sclass == C_HIDEXT
|| asym->n_sclass == C_WEAKEXT)
&& ISFCN (asym->n_type) && asym->n_numaux > 0 && asym->n_scnum > 0)
++xcoff_symbol_count;
i += asym->n_numaux;
}
xcoff_symbol_size = xcoff_symbol_count * sizeof (struct xcoff_symbol);
xcoff_symbols = ((struct xcoff_symbol *)
backtrace_alloc (state, xcoff_symbol_size, error_callback,
data));
if (xcoff_symbols == NULL)
return 0;
j = 0;
for (i = 0; i < nsyms; ++i)
{
const b_xcoff_syment *asym = &syms[i];
if ((asym->n_sclass == C_EXT || asym->n_sclass == C_HIDEXT
|| asym->n_sclass == C_WEAKEXT)
&& ISFCN (asym->n_type) && asym->n_numaux > 0 && asym->n_scnum > 0)
{
const b_xcoff_auxent *aux = (const b_xcoff_auxent *) (asym + 1);
xcoff_symbols[j].name = xcoff_symname (asym, strtab, strtab_size);
xcoff_symbols[j].address = base_address + asym->n_value
- sects[asym->n_scnum - 1].s_paddr;
/* x_fsize will be 0 if there is no debug information. */
xcoff_symbols[j].size = aux->x_fcn.x_fsize;
++j;
}
i += asym->n_numaux;
}
backtrace_qsort (xcoff_symbols, xcoff_symbol_count,
sizeof (struct xcoff_symbol), xcoff_symbol_compare);
sdata->next = NULL;
sdata->symbols = xcoff_symbols;
sdata->count = xcoff_symbol_count;
return 1;
}
/* Compare struct xcoff_line for qsort. */
static int
xcoff_line_compare (const void *v1, const void *v2)
{
const struct xcoff_line *ln1 = (const struct xcoff_line *) v1;
const struct xcoff_line *ln2 = (const struct xcoff_line *) v2;
if (ln1->pc < ln2->pc)
return -1;
else if (ln1->pc > ln2->pc)
return 1;
else
return 0;
}
/* Find a PC in a line vector. We always allocate an extra entry at
the end of the lines vector, so that this routine can safely look
at the next entry. */
static int
xcoff_line_search (const void *vkey, const void *ventry)
{
const uintptr_t *key = (const uintptr_t *) vkey;
const struct xcoff_line *entry = (const struct xcoff_line *) ventry;
uintptr_t pc;
pc = *key;
if (pc < entry->pc)
return -1;
else if ((entry + 1)->pc == (uintptr_t) -1 || pc >= (entry + 1)->pc)
return 1;
else
return 0;
}
/* Look for a PC in the line vector for one module. On success,
call CALLBACK and return whatever it returns. On error, call
ERROR_CALLBACK and return 0. Sets *FOUND to 1 if the PC is found,
0 if not. */
static int
xcoff_lookup_pc (struct backtrace_state *state ATTRIBUTE_UNUSED,
struct xcoff_fileline_data *fdata, uintptr_t pc,
backtrace_full_callback callback,
backtrace_error_callback error_callback ATTRIBUTE_UNUSED,
void *data, int *found)
{
const struct xcoff_line *ln;
const char *function;
*found = 1;
ln = (struct xcoff_line *) bsearch (&pc, fdata->vec.vec.base,
fdata->vec.count,
sizeof (struct xcoff_line),
xcoff_line_search);
if (ln == NULL)
{
*found = 0;
return 0;
}
function = ln->function;
/* AIX prepends a '.' to function entry points, remove it. */
if (*function == '.')
++function;
return callback (data, pc, ln->filename, ln->lineno, function);
}
/* Return the file/line information for a PC using the XCOFF lineno
mapping we built earlier. */
static int
xcoff_fileline (struct backtrace_state *state, uintptr_t pc,
backtrace_full_callback callback,
backtrace_error_callback error_callback, void *data)
{
struct xcoff_fileline_data *fdata;
int found;
int ret;
if (!state->threaded)
{
for (fdata = (struct xcoff_fileline_data *) state->fileline_data;
fdata != NULL;
fdata = fdata->next)
{
ret = xcoff_lookup_pc (state, fdata, pc, callback, error_callback,
data, &found);
if (ret != 0 || found)
return ret;
}
}
else
{
struct xcoff_fileline_data **pp;
pp = (struct xcoff_fileline_data **) (void *) &state->fileline_data;
while (1)
{
fdata = backtrace_atomic_load_pointer (pp);
if (fdata == NULL)
break;
ret = xcoff_lookup_pc (state, fdata, pc, callback, error_callback,
data, &found);
if (ret != 0 || found)
return ret;
pp = &fdata->next;
}
}
/* FIXME: See if any libraries have been dlopen'ed. */
return callback (data, pc, NULL, 0, NULL);
}
/* Add a new mapping to the vector of line mappings that we are
building. Returns 1 on success, 0 on failure. */
static int
xcoff_add_line (struct backtrace_state *state, uintptr_t pc,
const char *filename, const char *function, uint32_t lnno,
backtrace_error_callback error_callback, void *data,
struct xcoff_line_vector *vec)
{
struct xcoff_line *ln;
ln = ((struct xcoff_line *)
backtrace_vector_grow (state, sizeof (struct xcoff_line),
error_callback, data, &vec->vec));
if (ln == NULL)
return 0;
ln->pc = pc;
ln->filename = filename;
ln->function = function;
ln->lineno = lnno;
++vec->count;
return 1;
}
/* Add the line number entries for a function to the line vector. */
static int
xcoff_process_linenos (struct backtrace_state *state, uintptr_t base_address,
const b_xcoff_syment *fsym, const char *filename,
const b_xcoff_scnhdr *sects,
const unsigned char *strtab, size_t strtab_size,
uint32_t fcn_lnno, struct xcoff_incl_vector *vec,
struct xcoff_line_vector *lvec,
const unsigned char *linenos, size_t linenos_size,
uintptr_t lnnoptr0,
backtrace_error_callback error_callback, void *data)
{
const b_xcoff_auxent *aux;
const b_xcoff_lineno *lineno;
const unsigned char *lineptr;
const char *function;
struct xcoff_incl *incl = NULL;
uintptr_t lnnoptr;
uintptr_t pc;
uint32_t lnno;
int begincl;
size_t i;
aux = (const b_xcoff_auxent *) (fsym + 1);
lnnoptr = aux->x_fcn.x_lnnoptr;
if (lnnoptr < lnnoptr0 || lnnoptr + LINESZ > lnnoptr0 + linenos_size)
return 0;
function = xcoff_symname (fsym, strtab, strtab_size);
if (function == NULL)
return 0;
/* Skip first entry that points to symtab. */
lnnoptr += LINESZ;
lineptr = linenos + (lnnoptr - lnnoptr0);
begincl = -1;
while (lineptr + LINESZ <= linenos + linenos_size)
{
lineno = (const b_xcoff_lineno *) lineptr;
lnno = lineno->l_lnno;
if (lnno == 0)
break;
/* If part of a function other than the beginning comes from an
include file, the line numbers are absolute, rather than
relative to the beginning of the function. */
for (i = 0; i < vec->count; ++i)
{
incl = (struct xcoff_incl *) vec->vec.base + i;
if (incl->begin <= lnnoptr && lnnoptr <= incl->end)
break;
}
if (begincl == -1)
begincl = (i < vec->count);
if (i < vec->count)
{
filename = incl->filename;
if (begincl == 1)
lnno += fcn_lnno - 1;
}
else
lnno += fcn_lnno - 1;
pc = base_address + lineno->l_addr.l_paddr
- sects[fsym->n_scnum - 1].s_paddr;
xcoff_add_line (state, pc, filename, function, lnno, error_callback,
data, lvec);
lnnoptr += LINESZ;
lineptr += LINESZ;
}
return 1;
}
/* Initialize the line vector info for xcoff_fileline. */
static int
xcoff_initialize_fileline (struct backtrace_state *state,
uintptr_t base_address,
const b_xcoff_scnhdr *sects,
const b_xcoff_syment *syms, size_t nsyms,
const unsigned char *strtab, size_t strtab_size,
const unsigned char *linenos, size_t linenos_size,
uint64_t lnnoptr0,
backtrace_error_callback error_callback, void *data)
{
struct xcoff_fileline_data *fdata;
struct xcoff_incl_vector vec;
struct xcoff_line *ln;
const b_xcoff_syment *fsym;
const b_xcoff_auxent *aux;
const char *filename;
const char *name;
struct xcoff_incl *incl;
uintptr_t begin, end;
uintptr_t lnno;
size_t i;
fdata = ((struct xcoff_fileline_data *)
backtrace_alloc (state, sizeof (struct xcoff_fileline_data),
error_callback, data));
if (fdata == NULL)
return 0;
memset (fdata, 0, sizeof *fdata);
memset (&vec, 0, sizeof vec);
/* Process include files first. */
begin = 0;
for (i = 0; i < nsyms; ++i)
{
const b_xcoff_syment *asym = &syms[i];
switch (asym->n_sclass)
{
case C_BINCL:
begin = asym->n_value;
break;
case C_EINCL:
if (begin == 0)
break;
end = asym->n_value;
incl = ((struct xcoff_incl *)
backtrace_vector_grow (state, sizeof (struct xcoff_incl),
error_callback, data, &vec.vec));
if (incl != NULL)
{
incl->filename = xcoff_symname (asym, strtab, strtab_size);
incl->begin = begin;
incl->end = end;
++vec.count;
}
begin = 0;
break;
}
i += asym->n_numaux;
}
filename = NULL;
fsym = NULL;
for (i = 0; i < nsyms; ++i)
{
const b_xcoff_syment *asym = &syms[i];
switch (asym->n_sclass)
{
case C_FILE:
filename = xcoff_symname (asym, strtab, strtab_size);
if (filename == NULL)
break;
/* If the file auxiliary entry is not used, the symbol name is
the name of the source file. If the file auxiliary entry is
used, then the symbol name should be .file, and the first
file auxiliary entry (by convention) contains the source
file name. */
if (asym->n_numaux > 0 && !strcmp (filename, ".file"))
{
aux = (const b_xcoff_auxent *) (asym + 1);
if (aux->x_file._x.x_zeroes != 0)
{
/* Make a copy as we will release the symtab view. */
char name[FILNMLEN+1];
strncpy (name, aux->x_file.x_fname, FILNMLEN);
name[FILNMLEN] = '\0';
filename = strdup (name);
}
else if (aux->x_file._x.x_offset < strtab_size)
filename = (const char *) strtab + aux->x_file._x.x_offset;
else
filename = NULL;
}
break;
case C_EXT:
case C_HIDEXT:
case C_WEAKEXT:
fsym = NULL;
if (!ISFCN (asym->n_type) || asym->n_numaux == 0)
break;
if (filename == NULL)
break;
fsym = asym;
break;
case C_FCN:
if (asym->n_numaux == 0)
break;
if (fsym == NULL)
break;
name = xcoff_symname (asym, strtab, strtab_size);
if (name == NULL)
break;
aux = (const b_xcoff_auxent *) (asym + 1);
#if BACKTRACE_XCOFF_SIZE == 32
lnno = (uint32_t) aux->x_block.x_lnnohi << 16
| aux->x_block.x_lnno;
#else
lnno = aux->x_block.x_lnno;
#endif
if (!strcmp (name, ".bf"))
{
xcoff_process_linenos (state, base_address, fsym, filename,
sects, strtab, strtab_size, lnno, &vec,
&fdata->vec, linenos, linenos_size,
lnnoptr0, error_callback, data);
}
else if (!strcmp (name, ".ef"))
{
fsym = NULL;
}
break;
}
i += asym->n_numaux;
}
/* Allocate one extra entry at the end. */
ln = ((struct xcoff_line *)
backtrace_vector_grow (state, sizeof (struct xcoff_line),
error_callback, data, &fdata->vec.vec));
if (ln == NULL)
goto fail;
ln->pc = (uintptr_t) -1;
ln->filename = NULL;
ln->function = NULL;
ln->lineno = 0;
if (!backtrace_vector_release (state, &fdata->vec.vec, error_callback, data))
goto fail;
backtrace_qsort (fdata->vec.vec.base, fdata->vec.count,
sizeof (struct xcoff_line), xcoff_line_compare);
if (!state->threaded)
{
struct xcoff_fileline_data **pp;
for (pp = (struct xcoff_fileline_data **) (void *) &state->fileline_data;
*pp != NULL;
pp = &(*pp)->next)
;
*pp = fdata;
}
else
{
while (1)
{
struct xcoff_fileline_data **pp;
pp = (struct xcoff_fileline_data **) (void *) &state->fileline_data;
while (1)
{
struct xcoff_fileline_data *p;
p = backtrace_atomic_load_pointer (pp);
if (p == NULL)
break;
pp = &p->next;
}
if (__sync_bool_compare_and_swap (pp, NULL, fdata))
break;
}
}
return 1;
fail:
return 0;
}
/* Add the backtrace data for one XCOFF file. Returns 1 on success,
0 on failure (in both cases descriptor is closed). */
static int
xcoff_add (struct backtrace_state *state, int descriptor, off_t offset,
uintptr_t base_address, backtrace_error_callback error_callback,
void *data, fileline *fileline_fn, int *found_sym, int exe)
{
struct backtrace_view fhdr_view;
struct backtrace_view sects_view;
struct backtrace_view linenos_view;
struct backtrace_view syms_view;
struct backtrace_view str_view;
struct backtrace_view dwarf_view;
b_xcoff_filhdr fhdr;
const b_xcoff_scnhdr *sects;
const b_xcoff_scnhdr *stext;
uint64_t lnnoptr;
uint32_t nlnno;
off_t str_off;
off_t min_offset;
off_t max_offset;
struct dwsect_info dwsect[DWSECT_MAX];
size_t sects_size;
size_t syms_size;
int32_t str_size;
int sects_view_valid;
int linenos_view_valid;
int syms_view_valid;
int str_view_valid;
int dwarf_view_valid;
int magic_ok;
int i;
*found_sym = 0;
sects_view_valid = 0;
linenos_view_valid = 0;
syms_view_valid = 0;
str_view_valid = 0;
dwarf_view_valid = 0;
str_size = 0;
/* Map the XCOFF file header. */
if (!backtrace_get_view (state, descriptor, offset, sizeof (b_xcoff_filhdr),
error_callback, data, &fhdr_view))
goto fail;
memcpy (&fhdr, fhdr_view.data, sizeof fhdr);
magic_ok = (fhdr.f_magic == XCOFF_MAGIC);
backtrace_release_view (state, &fhdr_view, error_callback, data);
if (!magic_ok)
{
if (exe)
error_callback (data, "executable file is not XCOFF", 0);
goto fail;
}
/* Verify object is of expected type. */
if ((exe && (fhdr.f_flags & F_SHROBJ))
|| (!exe && !(fhdr.f_flags & F_SHROBJ)))
goto fail;
/* Read the section headers. */
sects_size = fhdr.f_nscns * sizeof (b_xcoff_scnhdr);
if (!backtrace_get_view (state, descriptor,
offset + sizeof (fhdr) + fhdr.f_opthdr,
sects_size, error_callback, data, &sects_view))
goto fail;
sects_view_valid = 1;
sects = (const b_xcoff_scnhdr *) sects_view.data;
/* FIXME: assumes only one .text section. */
for (i = 0; i < fhdr.f_nscns; ++i)
if ((sects[i].s_flags & 0xffff) == STYP_TEXT)
break;
if (i == fhdr.f_nscns)
goto fail;
stext = &sects[i];
/* AIX ldinfo_textorg includes the XCOFF headers. */
base_address = (exe ? XCOFF_AIX_TEXTBASE : base_address) + stext->s_scnptr;
lnnoptr = stext->s_lnnoptr;
nlnno = stext->s_nlnno;
#if BACKTRACE_XCOFF_SIZE == 32
if (nlnno == _OVERFLOW_MARKER)
{
int sntext = i + 1;
/* Find the matching .ovrflo section. */
for (i = 0; i < fhdr.f_nscns; ++i)
{
if (((sects[i].s_flags & 0xffff) == STYP_OVRFLO)
&& sects[i].s_nlnno == sntext)
{
nlnno = sects[i].s_vaddr;
break;
}
}
}
#endif
/* Read the symbol table and the string table. */
if (fhdr.f_symptr != 0)
{
struct xcoff_syminfo_data *sdata;
/* Symbol table is followed by the string table. The string table
starts with its length (on 4 bytes).
Map the symbol table and the length of the string table. */
syms_size = fhdr.f_nsyms * sizeof (b_xcoff_syment);
if (!backtrace_get_view (state, descriptor, offset + fhdr.f_symptr,
syms_size + 4, error_callback, data,
&syms_view))
goto fail;
syms_view_valid = 1;
memcpy (&str_size, syms_view.data + syms_size, 4);
str_off = fhdr.f_symptr + syms_size;
if (str_size > 4)
{
/* Map string table (including the length word). */
if (!backtrace_get_view (state, descriptor, offset + str_off,
str_size, error_callback, data, &str_view))
goto fail;
str_view_valid = 1;
}
sdata = ((struct xcoff_syminfo_data *)
backtrace_alloc (state, sizeof *sdata, error_callback, data));
if (sdata == NULL)
goto fail;
if (!xcoff_initialize_syminfo (state, base_address, sects,
syms_view.data, fhdr.f_nsyms,
str_view.data, str_size,
error_callback, data, sdata))
{
backtrace_free (state, sdata, sizeof *sdata, error_callback, data);
goto fail;
}
*found_sym = 1;
xcoff_add_syminfo_data (state, sdata);
}
/* Read all the DWARF sections in a single view, since they are
probably adjacent in the file. We never release this view. */
min_offset = 0;
max_offset = 0;
memset (dwsect, 0, sizeof dwsect);
for (i = 0; i < fhdr.f_nscns; ++i)
{
off_t end;
int idx;
if ((sects[i].s_flags & 0xffff) != STYP_DWARF
|| sects[i].s_size == 0)
continue;
/* Map DWARF section to array index. */
switch (sects[i].s_flags & 0xffff0000)
{
case SSUBTYP_DWINFO:
idx = DWSECT_INFO;
break;
case SSUBTYP_DWLINE:
idx = DWSECT_LINE;
break;
case SSUBTYP_DWABREV:
idx = DWSECT_ABBREV;
break;
case SSUBTYP_DWARNGE:
idx = DWSECT_RANGES;
break;
case SSUBTYP_DWSTR:
idx = DWSECT_STR;
break;
default:
continue;
}
if (min_offset == 0 || (off_t) sects[i].s_scnptr < min_offset)
min_offset = sects[i].s_scnptr;
end = sects[i].s_scnptr + sects[i].s_size;
if (end > max_offset)
max_offset = end;
dwsect[idx].offset = sects[i].s_scnptr;
dwsect[idx].size = sects[i].s_size;
}
if (min_offset != 0 && max_offset != 0)
{
if (!backtrace_get_view (state, descriptor, offset + min_offset,
max_offset - min_offset,
error_callback, data, &dwarf_view))
goto fail;
dwarf_view_valid = 1;
for (i = 0; i < (int) DWSECT_MAX; ++i)
{
if (dwsect[i].offset == 0)
dwsect[i].data = NULL;
else
dwsect[i].data = ((const unsigned char *) dwarf_view.data
+ (dwsect[i].offset - min_offset));
}
if (!backtrace_dwarf_add (state, 0,
dwsect[DWSECT_INFO].data,
dwsect[DWSECT_INFO].size,
#if BACKTRACE_XCOFF_SIZE == 32
/* XXX workaround for broken lineoff */
dwsect[DWSECT_LINE].data - 4,
#else
/* XXX workaround for broken lineoff */
dwsect[DWSECT_LINE].data - 12,
#endif
dwsect[DWSECT_LINE].size,
dwsect[DWSECT_ABBREV].data,
dwsect[DWSECT_ABBREV].size,
dwsect[DWSECT_RANGES].data,
dwsect[DWSECT_RANGES].size,
dwsect[DWSECT_STR].data,
dwsect[DWSECT_STR].size,
1, /* big endian */
error_callback, data, fileline_fn))
goto fail;
}
/* Read the XCOFF line number entries if DWARF sections not found. */
if (!dwarf_view_valid && fhdr.f_symptr != 0 && lnnoptr != 0)
{
size_t linenos_size = (size_t) nlnno * LINESZ;
if (!backtrace_get_view (state, descriptor, offset + lnnoptr,
linenos_size,
error_callback, data, &linenos_view))
goto fail;
linenos_view_valid = 1;
if (xcoff_initialize_fileline (state, base_address, sects,
syms_view.data, fhdr.f_nsyms,
str_view.data, str_size,
linenos_view.data, linenos_size,
lnnoptr, error_callback, data))
*fileline_fn = xcoff_fileline;
backtrace_release_view (state, &linenos_view, error_callback, data);
linenos_view_valid = 0;
}
backtrace_release_view (state, &sects_view, error_callback, data);
sects_view_valid = 0;
if (syms_view_valid)
backtrace_release_view (state, &syms_view, error_callback, data);
syms_view_valid = 0;
/* We've read all we need from the executable. */
if (!backtrace_close (descriptor, error_callback, data))
goto fail;
descriptor = -1;
return 1;
fail:
if (sects_view_valid)
backtrace_release_view (state, &sects_view, error_callback, data);
if (str_view_valid)
backtrace_release_view (state, &str_view, error_callback, data);
if (syms_view_valid)
backtrace_release_view (state, &syms_view, error_callback, data);
if (linenos_view_valid)
backtrace_release_view (state, &linenos_view, error_callback, data);
if (dwarf_view_valid)
backtrace_release_view (state, &dwarf_view, error_callback, data);
if (descriptor != -1 && offset == 0)
backtrace_close (descriptor, error_callback, data);
return 0;
}
#ifdef HAVE_LOADQUERY
/* Read an integer value in human-readable format from an AIX
big archive fixed-length or member header. */
static int
xcoff_parse_decimal (const char *buf, size_t size, off_t *off)
{
char str[32];
char *end;
if (size >= sizeof str)
return 0;
memcpy (str, buf, size);
str[size] = '\0';
*off = strtol (str, &end, 10);
if (*end != '\0' && *end != ' ')
return 0;
return 1;
}
/* Add the backtrace data for a member of an AIX big archive.
Returns 1 on success, 0 on failure. */
static int
xcoff_armem_add (struct backtrace_state *state, int descriptor,
uintptr_t base_address, const char *member,
backtrace_error_callback error_callback, void *data,
fileline *fileline_fn, int *found_sym)
{
struct backtrace_view view;
b_ar_fl_hdr fl_hdr;
const b_ar_hdr *ar_hdr;
off_t off;
off_t len;
int memlen;
*found_sym = 0;
/* Map archive fixed-length header. */
if (!backtrace_get_view (state, descriptor, 0, sizeof (b_ar_fl_hdr),
error_callback, data, &view))
goto fail;
memcpy (&fl_hdr, view.data, sizeof (b_ar_fl_hdr));
backtrace_release_view (state, &view, error_callback, data);
if (memcmp (fl_hdr.fl_magic, AIAMAGBIG, 8) != 0)
goto fail;
memlen = strlen (member);
/* Read offset of first archive member. */
if (!xcoff_parse_decimal (fl_hdr.fl_fstmoff, sizeof fl_hdr.fl_fstmoff, &off))
goto fail;
while (off != 0)
{
/* Map archive member header and member name. */
if (!backtrace_get_view (state, descriptor, off,
sizeof (b_ar_hdr) + memlen,
error_callback, data, &view))
break;
ar_hdr = (const b_ar_hdr *) view.data;
/* Read archive member name length. */
if (!xcoff_parse_decimal (ar_hdr->ar_namlen, sizeof ar_hdr->ar_namlen,
&len))
{
backtrace_release_view (state, &view, error_callback, data);
break;
}
if (len == memlen && !memcmp (ar_hdr->ar_name, member, memlen))
{
off = (off + sizeof (b_ar_hdr) + memlen + 1) & ~1;
/* The archive can contain several members with the same name
(e.g. 32-bit and 64-bit), so continue if not ok. */
if (xcoff_add (state, descriptor, off, base_address, error_callback,
data, fileline_fn, found_sym, 0))
{
backtrace_release_view (state, &view, error_callback, data);
return 1;
}
}
/* Read offset of next archive member. */
if (!xcoff_parse_decimal (ar_hdr->ar_nxtmem, sizeof ar_hdr->ar_nxtmem,
&off))
{
backtrace_release_view (state, &view, error_callback, data);
break;
}
backtrace_release_view (state, &view, error_callback, data);
}
fail:
/* No matching member found. */
backtrace_close (descriptor, error_callback, data);
return 0;
}
/* Add the backtrace data for dynamically loaded libraries. */
static void
xcoff_add_shared_libs (struct backtrace_state *state,
backtrace_error_callback error_callback,
void *data, fileline *fileline_fn, int *found_sym)
{
const struct ld_info *ldinfo;
void *buf;
unsigned int buflen;
const char *member;
int descriptor;
int does_not_exist;
int lib_found_sym;
int ret;
/* Retrieve the list of loaded libraries. */
buf = NULL;
buflen = 512;
do
{
buf = realloc (buf, buflen);
if (buf == NULL)
{
ret = -1;
break;
}
ret = loadquery (L_GETINFO, buf, buflen);
if (ret == 0)
break;
buflen *= 2;
}
while (ret == -1 && errno == ENOMEM);
if (ret != 0)
{
free (buf);
return;
}
ldinfo = (const struct ld_info *) buf;
while ((const char *) ldinfo < (const char *) buf + buflen)
{
if (*ldinfo->ldinfo_filename != '/')
goto next;
descriptor = backtrace_open (ldinfo->ldinfo_filename, error_callback,
data, &does_not_exist);
if (descriptor < 0)
goto next;
/* Check if it is an archive (member name not empty). */
member = ldinfo->ldinfo_filename + strlen (ldinfo->ldinfo_filename) + 1;
if (*member)
{
xcoff_armem_add (state, descriptor,
(uintptr_t) ldinfo->ldinfo_textorg, member,
error_callback, data, fileline_fn, &lib_found_sym);
}
else
{
xcoff_add (state, descriptor, 0, (uintptr_t) ldinfo->ldinfo_textorg,
error_callback, data, fileline_fn, &lib_found_sym, 0);
}
if (lib_found_sym)
*found_sym = 1;
next:
if (ldinfo->ldinfo_next == 0)
break;
ldinfo = (const struct ld_info *) ((const char *) ldinfo
+ ldinfo->ldinfo_next);
}
free (buf);
}
#endif /* HAVE_LOADQUERY */
/* Initialize the backtrace data we need from an XCOFF executable.
Returns 1 on success, 0 on failure. */
int
backtrace_initialize (struct backtrace_state *state,
const char *filename ATTRIBUTE_UNUSED, int descriptor,
backtrace_error_callback error_callback,
void *data, fileline *fileline_fn)
{
int ret;
int found_sym;
fileline xcoff_fileline_fn = xcoff_nodebug;
ret = xcoff_add (state, descriptor, 0, 0, error_callback, data,
&xcoff_fileline_fn, &found_sym, 1);
if (!ret)
return 0;
#ifdef HAVE_LOADQUERY
xcoff_add_shared_libs (state, error_callback, data, &xcoff_fileline_fn,
&found_sym);
#endif
if (!state->threaded)
{
if (found_sym)
state->syminfo_fn = xcoff_syminfo;
else if (state->syminfo_fn == NULL)
state->syminfo_fn = xcoff_nosyms;
}
else
{
if (found_sym)
backtrace_atomic_store_pointer (&state->syminfo_fn, xcoff_syminfo);
else
__sync_bool_compare_and_swap (&state->syminfo_fn, NULL, xcoff_nosyms);
}
if (!state->threaded)
{
if (state->fileline_fn == NULL || state->fileline_fn == xcoff_nodebug)
*fileline_fn = xcoff_fileline_fn;
}
else
{
fileline current_fn;
current_fn = backtrace_atomic_load_pointer (&state->fileline_fn);
if (current_fn == NULL || current_fn == xcoff_nodebug)
*fileline_fn = xcoff_fileline_fn;
}
return 1;
}
ztest.c 0 → 100644
/* ztest.c -- Test for libbacktrace inflate code.
Copyright (C) 2017-2018 Free Software Foundation, Inc.
Written by Ian Lance Taylor, Google.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
(1) Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
(2) Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in
the documentation and/or other materials provided with the
distribution.
(3) The name of the author may not be used to
endorse or promote products derived from this software without
specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT,
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE. */
#include "config.h"
#include <errno.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#include <sys/types.h>
#include <sys/stat.h>
#ifdef HAVE_ZLIB
#include <zlib.h>
#endif
#include "backtrace.h"
#include "backtrace-supported.h"
#include "internal.h"
#include "testlib.h"
#ifndef HAVE_CLOCK_GETTIME
typedef int xclockid_t;
static int
xclock_gettime (xclockid_t id ATTRIBUTE_UNUSED,
struct timespec *ts ATTRIBUTE_UNUSED)
{
errno = EINVAL;
return -1;
}
#define clockid_t xclockid_t
#define clock_gettime xclock_gettime
#undef CLOCK_REALTIME
#define CLOCK_REALTIME 0
#endif /* !defined(HAVE_CLOCK_GETTIME) */
#ifdef CLOCK_PROCESS_CPUTIME_ID
#define ZLIB_CLOCK_GETTIME_ARG CLOCK_PROCESS_CPUTIME_ID
#else
#define ZLIB_CLOCK_GETTIME_ARG CLOCK_REALTIME
#endif
/* Some tests for the local zlib inflation code. */
struct zlib_test
{
const char *name;
const char *uncompressed;
const char *compressed;
size_t compressed_len;
};
/* Error callback. */
static void
error_callback_compress (void *vdata, const char *msg, int errnum)
{
fprintf (stderr, "%s", msg);
if (errnum > 0)
fprintf (stderr, ": %s", strerror (errnum));
fprintf (stderr, "\n");
exit (EXIT_FAILURE);
}
static const struct zlib_test tests[] =
{
{
"empty",
"",
"\x78\x9c\x03\x00\x00\x00\x00\x01",
8,
},
{
"hello",
"hello, world\n",
("\x78\x9c\xca\x48\xcd\xc9\xc9\xd7\x51\x28\xcf"
"\x2f\xca\x49\xe1\x02\x04\x00\x00\xff\xff\x21\xe7\x04\x93"),
25,
},
{
"goodbye",
"goodbye, world",
("\x78\x9c\x4b\xcf\xcf\x4f\x49\xaa"
"\x4c\xd5\x51\x28\xcf\x2f\xca\x49"
"\x01\x00\x28\xa5\x05\x5e"),
22,
}
};
/* Test the hand coded samples. */
static void
test_samples (struct backtrace_state *state)
{
size_t i;
for (i = 0; i < sizeof tests / sizeof tests[0]; ++i)
{
char *p;
size_t v;
size_t j;
unsigned char *uncompressed;
size_t uncompressed_len;
p = malloc (12 + tests[i].compressed_len);
memcpy (p, "ZLIB", 4);
v = strlen (tests[i].uncompressed);
for (j = 0; j < 8; ++j)
p[j + 4] = (v >> ((7 - j) * 8)) & 0xff;
memcpy (p + 12, tests[i].compressed, tests[i].compressed_len);
uncompressed = NULL;
uncompressed_len = 0;
if (!backtrace_uncompress_zdebug (state, (unsigned char *) p,
tests[i].compressed_len + 12,
error_callback_compress, NULL,
&uncompressed, &uncompressed_len))
{
fprintf (stderr, "test %s: uncompress failed\n", tests[i].name);
++failures;
}
else
{
if (uncompressed_len != v)
{
fprintf (stderr,
"test %s: got uncompressed length %zu, want %zu\n",
tests[i].name, uncompressed_len, v);
++failures;
}
else if (memcmp (tests[i].uncompressed, uncompressed, v) != 0)
{
size_t j;
fprintf (stderr, "test %s: uncompressed data mismatch\n",
tests[i].name);
for (j = 0; j < v; ++j)
if (tests[i].uncompressed[j] != uncompressed[j])
fprintf (stderr, " %zu: got %#x want %#x\n", j,
uncompressed[j], tests[i].uncompressed[j]);
++failures;
}
else
printf ("PASS: inflate %s\n", tests[i].name);
backtrace_free (state, uncompressed, uncompressed_len,
error_callback_compress, NULL);
}
}
}
#ifdef HAVE_ZLIB
/* Given a set of TRIALS timings, discard the lowest and highest
values and return the mean average of the rest. */
static size_t
average_time (const size_t *times, size_t trials)
{
size_t imax;
size_t max;
size_t imin;
size_t min;
size_t i;
size_t sum;
imin = 0;
imax = 0;
min = times[0];
max = times[0];
for (i = 1; i < trials; ++i)
{
if (times[i] < min)
{
imin = i;
min = times[i];
}
if (times[i] > max)
{
imax = i;
max = times[i];
}
}
sum = 0;
for (i = 0; i < trials; ++i)
{
if (i != imax && i != imin)
sum += times[i];
}
return sum / (trials - 2);
}
#endif
/* Test a larger text, if available. */
static void
test_large (struct backtrace_state *state)
{
#ifdef HAVE_ZLIB
unsigned char *orig_buf;
size_t orig_bufsize;
size_t i;
char *compressed_buf;
size_t compressed_bufsize;
unsigned long compress_sizearg;
unsigned char *uncompressed_buf;
size_t uncompressed_bufsize;
int r;
clockid_t cid;
struct timespec ts1;
struct timespec ts2;
size_t ctime;
size_t ztime;
const size_t trials = 16;
size_t ctimes[16];
size_t ztimes[16];
static const char * const names[] = {
"Mark.Twain-Tom.Sawyer.txt",
"../libgo/go/compress/testdata/Mark.Twain-Tom.Sawyer.txt"
};
orig_buf = NULL;
orig_bufsize = 0;
uncompressed_buf = NULL;
compressed_buf = NULL;
for (i = 0; i < sizeof names / sizeof names[0]; ++i)
{
size_t len;
char *namebuf;
FILE *e;
struct stat st;
char *rbuf;
size_t got;
len = strlen (SRCDIR) + strlen (names[i]) + 2;
namebuf = malloc (len);
if (namebuf == NULL)
{
perror ("malloc");
goto fail;
}
snprintf (namebuf, len, "%s/%s", SRCDIR, names[i]);
e = fopen (namebuf, "r");
free (namebuf);
if (e == NULL)
continue;
if (fstat (fileno (e), &st) < 0)
{
perror ("fstat");
fclose (e);
continue;
}
rbuf = malloc (st.st_size);
if (rbuf == NULL)
{
perror ("malloc");
goto fail;
}
got = fread (rbuf, 1, st.st_size, e);
fclose (e);
if (got > 0)
{
orig_buf = rbuf;
orig_bufsize = got;
break;
}
free (rbuf);
}
if (orig_buf == NULL)
{
/* We couldn't find an input file. */
printf ("UNSUPPORTED: inflate large\n");
return;
}
compressed_bufsize = compressBound (orig_bufsize) + 12;
compressed_buf = malloc (compressed_bufsize);
if (compressed_buf == NULL)
{
perror ("malloc");
goto fail;
}
compress_sizearg = compressed_bufsize - 12;
r = compress (compressed_buf + 12, &compress_sizearg,
orig_buf, orig_bufsize);
if (r != Z_OK)
{
fprintf (stderr, "zlib compress failed: %d\n", r);
goto fail;
}
compressed_bufsize = compress_sizearg + 12;
/* Prepare the header that our library expects. */
memcpy (compressed_buf, "ZLIB", 4);
for (i = 0; i < 8; ++i)
compressed_buf[i + 4] = (orig_bufsize >> ((7 - i) * 8)) & 0xff;
uncompressed_buf = malloc (orig_bufsize);
if (uncompressed_buf == NULL)
{
perror ("malloc");
goto fail;
}
uncompressed_bufsize = orig_bufsize;
if (!backtrace_uncompress_zdebug (state, compressed_buf, compressed_bufsize,
error_callback_compress, NULL,
&uncompressed_buf, &uncompressed_bufsize))
{
fprintf (stderr, "inflate large: backtrace_uncompress_zdebug failed\n");
goto fail;
}
if (uncompressed_bufsize != orig_bufsize)
{
fprintf (stderr,
"inflate large: got uncompressed length %zu, want %zu\n",
uncompressed_bufsize, orig_bufsize);
goto fail;
}
if (memcmp (uncompressed_buf, orig_buf, uncompressed_bufsize) != 0)
{
fprintf (stderr, "inflate large: uncompressed data mismatch\n");
goto fail;
}
printf ("PASS: inflate large\n");
for (i = 0; i < trials; ++i)
{
unsigned long uncompress_sizearg;
cid = ZLIB_CLOCK_GETTIME_ARG;
if (clock_gettime (cid, &ts1) < 0)
{
if (errno == EINVAL)
return;
perror ("clock_gettime");
return;
}
if (!backtrace_uncompress_zdebug (state, compressed_buf,
compressed_bufsize,
error_callback_compress, NULL,
&uncompressed_buf,
&uncompressed_bufsize))
{
fprintf (stderr,
("inflate large: "
"benchmark backtrace_uncompress_zdebug failed\n"));
return;
}
if (clock_gettime (cid, &ts2) < 0)
{
perror ("clock_gettime");
return;
}
ctime = (ts2.tv_sec - ts1.tv_sec) * 1000000000;
ctime += ts2.tv_nsec - ts1.tv_nsec;
ctimes[i] = ctime;
if (clock_gettime (cid, &ts1) < 0)
{
perror("clock_gettime");
return;
}
uncompress_sizearg = uncompressed_bufsize;
r = uncompress (uncompressed_buf, &uncompress_sizearg,
compressed_buf + 12, compressed_bufsize - 12);
if (clock_gettime (cid, &ts2) < 0)
{
perror ("clock_gettime");
return;
}
if (r != Z_OK)
{
fprintf (stderr,
"inflate large: benchmark zlib uncompress failed: %d\n",
r);
return;
}
ztime = (ts2.tv_sec - ts1.tv_sec) * 1000000000;
ztime += ts2.tv_nsec - ts1.tv_nsec;
ztimes[i] = ztime;
}
/* Toss the highest and lowest times and average the rest. */
ctime = average_time (ctimes, trials);
ztime = average_time (ztimes, trials);
printf ("backtrace: %zu ns\n", ctime);
printf ("zlib : %zu ns\n", ztime);
printf ("ratio : %g\n", (double) ztime / (double) ctime);
return;
fail:
printf ("FAIL: inflate large\n");
++failures;
if (orig_buf != NULL)
free (orig_buf);
if (compressed_buf != NULL)
free (compressed_buf);
if (uncompressed_buf != NULL)
free (uncompressed_buf);
#else /* !HAVE_ZLIB */
printf ("UNSUPPORTED: inflate large\n");
#endif /* !HAVE_ZLIB */
}
int
main (int argc ATTRIBUTE_UNUSED, char **argv)
{
struct backtrace_state *state;
state = backtrace_create_state (argv[0], BACKTRACE_SUPPORTS_THREADS,
error_callback_create, NULL);
test_samples (state);
test_large (state);
exit (failures != 0 ? EXIT_FAILURE : EXIT_SUCCESS);
}
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment