mirror of
https://sourceware.org/git/binutils-gdb.git
synced 2024-11-21 01:12:32 +08:00
b450e10273
Note that this includes Nick's fix from edf64cd235 which
landed upstream a bit differently as r13-1566-g9ed57796235abc in GCC.
This pulls in libbacktrace as of r14-9404-gc775a030af9cad in GCC trunk.
Note that I have dropped a top-level Darwin change from r14-4825-g6a6d3817afa02b
which would've required an autoreconf, as it should be handled separately.
Approved-By: Tom Tromey <tom@tromey.com>
121 lines
3.7 KiB
C
121 lines
3.7 KiB
C
/* edtest.c -- Test for libbacktrace storage allocation stress handling
|
|
Copyright (C) 2017-2024 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, noclone, 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);
|
|
}
|