1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505
|
// Copyright 2023 The Abseil Authors.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// https://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
#include "absl/debugging/stacktrace.h"
#include <stddef.h>
#include <stdint.h>
#include <algorithm>
#include <cerrno>
#include <csignal>
#include <cstring>
#include <memory>
#include "gmock/gmock.h"
#include "gtest/gtest.h"
#include "absl/base/attributes.h"
#include "absl/base/config.h"
#include "absl/base/internal/errno_saver.h"
#include "absl/base/optimization.h"
#include "absl/types/span.h"
static int g_should_fixup_calls = 0;
static int g_fixup_calls = 0;
static bool g_enable_fixup = false;
static uintptr_t g_last_fixup_frame_address = 0;
#if ABSL_HAVE_ATTRIBUTE_WEAK
bool absl::internal_stacktrace::ShouldFixUpStack() {
++g_should_fixup_calls;
return g_enable_fixup;
}
void absl::internal_stacktrace::FixUpStack(void**, uintptr_t*, int*, size_t,
size_t&) {
const void* frame_address = nullptr;
#if ABSL_HAVE_BUILTIN(__builtin_frame_address)
frame_address = __builtin_frame_address(0);
#endif
g_last_fixup_frame_address = reinterpret_cast<uintptr_t>(frame_address);
++g_fixup_calls;
}
#endif
namespace {
using ::testing::ContainerEq;
using ::testing::Contains;
using ::testing::internal::Cleanup;
struct StackTrace {
static constexpr int kStackCount = 64;
int depth;
void* result[kStackCount];
uintptr_t frames[kStackCount];
int sizes[kStackCount];
};
// This test is currently only known to pass on Linux x86_64/aarch64.
#if defined(__linux__) && (defined(__x86_64__) || defined(__aarch64__))
ABSL_ATTRIBUTE_NOINLINE void Unwind(void* p) {
ABSL_ATTRIBUTE_UNUSED static void* volatile sink = p;
constexpr int kSize = 16;
void* stack[kSize];
int frames[kSize];
absl::GetStackTrace(stack, kSize, 0);
absl::GetStackFrames(stack, frames, kSize, 0);
}
ABSL_ATTRIBUTE_NOINLINE void HugeFrame() {
char buffer[1 << 20];
Unwind(buffer);
ABSL_BLOCK_TAIL_CALL_OPTIMIZATION();
}
TEST(StackTrace, HugeFrame) {
// Ensure that the unwinder is not confused by very large stack frames.
HugeFrame();
ABSL_BLOCK_TAIL_CALL_OPTIMIZATION();
}
#endif
// This is a separate function to avoid inlining.
ABSL_ATTRIBUTE_NOINLINE static void FixupNoFixupEquivalenceNoInline() {
#if !ABSL_HAVE_ATTRIBUTE_WEAK
const char* kSkipReason = "Need weak symbol support";
#elif defined(__riscv)
const char* kSkipReason =
"Skipping test on RISC-V due to pre-existing failure";
#elif defined(_WIN32)
// TODO(b/434184677): Add support for fixups on Windows if needed
const char* kSkipReason =
"Skipping test on Windows due to lack of support for fixups";
#else
const char* kSkipReason = nullptr;
#endif
// This conditional is to avoid an unreachable code warning.
if (kSkipReason != nullptr) {
GTEST_SKIP() << kSkipReason;
}
bool can_rely_on_frame_pointers = false;
if (!can_rely_on_frame_pointers) {
GTEST_SKIP() << "Frame pointers are required, but not guaranteed in OSS";
}
// This test is known not to pass on MSVC (due to weak symbols)
const Cleanup restore_state([enable_fixup = g_enable_fixup,
fixup_calls = g_fixup_calls,
should_fixup_calls = g_should_fixup_calls]() {
g_enable_fixup = enable_fixup;
g_fixup_calls = fixup_calls;
g_should_fixup_calls = should_fixup_calls;
});
constexpr int kSkip = 1; // Skip our own frame, whose return PCs won't match
constexpr auto kStackCount = 1;
StackTrace a;
StackTrace b;
// ==========================================================================
g_fixup_calls = 0;
g_should_fixup_calls = 0;
a.depth = absl::GetStackTrace(a.result, kStackCount, kSkip);
g_enable_fixup = !g_enable_fixup;
b.depth = absl::GetStackTrace(b.result, kStackCount, kSkip);
EXPECT_THAT(
absl::MakeSpan(a.result, static_cast<size_t>(a.depth)),
ContainerEq(absl::MakeSpan(b.result, static_cast<size_t>(b.depth))));
EXPECT_GT(g_should_fixup_calls, 0);
EXPECT_GE(g_should_fixup_calls, g_fixup_calls);
// ==========================================================================
g_fixup_calls = 0;
g_should_fixup_calls = 0;
a.depth = absl::GetStackFrames(a.result, a.sizes, kStackCount, kSkip);
g_enable_fixup = !g_enable_fixup;
b.depth = absl::GetStackFrames(b.result, b.sizes, kStackCount, kSkip);
EXPECT_THAT(
absl::MakeSpan(a.result, static_cast<size_t>(a.depth)),
ContainerEq(absl::MakeSpan(b.result, static_cast<size_t>(b.depth))));
EXPECT_THAT(
absl::MakeSpan(a.sizes, static_cast<size_t>(a.depth)),
ContainerEq(absl::MakeSpan(b.sizes, static_cast<size_t>(b.depth))));
EXPECT_GT(g_should_fixup_calls, 0);
EXPECT_GE(g_should_fixup_calls, g_fixup_calls);
// ==========================================================================
g_fixup_calls = 0;
g_should_fixup_calls = 0;
a.depth = absl::GetStackTraceWithContext(a.result, kStackCount, kSkip,
nullptr, nullptr);
g_enable_fixup = !g_enable_fixup;
b.depth = absl::GetStackTraceWithContext(b.result, kStackCount, kSkip,
nullptr, nullptr);
EXPECT_THAT(
absl::MakeSpan(a.result, static_cast<size_t>(a.depth)),
ContainerEq(absl::MakeSpan(b.result, static_cast<size_t>(b.depth))));
EXPECT_GT(g_should_fixup_calls, 0);
EXPECT_GE(g_should_fixup_calls, g_fixup_calls);
// ==========================================================================
g_fixup_calls = 0;
g_should_fixup_calls = 0;
a.depth = absl::GetStackFramesWithContext(a.result, a.sizes, kStackCount,
kSkip, nullptr, nullptr);
g_enable_fixup = !g_enable_fixup;
b.depth = absl::GetStackFramesWithContext(b.result, b.sizes, kStackCount,
kSkip, nullptr, nullptr);
EXPECT_THAT(
absl::MakeSpan(a.result, static_cast<size_t>(a.depth)),
ContainerEq(absl::MakeSpan(b.result, static_cast<size_t>(b.depth))));
EXPECT_THAT(
absl::MakeSpan(a.sizes, static_cast<size_t>(a.depth)),
ContainerEq(absl::MakeSpan(b.sizes, static_cast<size_t>(b.depth))));
EXPECT_GT(g_should_fixup_calls, 0);
EXPECT_GE(g_should_fixup_calls, g_fixup_calls);
// ==========================================================================
g_fixup_calls = 0;
g_should_fixup_calls = 0;
a.depth = absl::internal_stacktrace::GetStackFrames(
a.result, a.frames, a.sizes, kStackCount, kSkip);
g_enable_fixup = !g_enable_fixup;
b.depth = absl::internal_stacktrace::GetStackFrames(
b.result, b.frames, b.sizes, kStackCount, kSkip);
EXPECT_THAT(
absl::MakeSpan(a.result, static_cast<size_t>(a.depth)),
ContainerEq(absl::MakeSpan(b.result, static_cast<size_t>(b.depth))));
EXPECT_THAT(
absl::MakeSpan(a.sizes, static_cast<size_t>(a.depth)),
ContainerEq(absl::MakeSpan(b.sizes, static_cast<size_t>(b.depth))));
EXPECT_THAT(
absl::MakeSpan(a.frames, static_cast<size_t>(a.depth)),
ContainerEq(absl::MakeSpan(b.frames, static_cast<size_t>(b.depth))));
EXPECT_GT(g_should_fixup_calls, 0);
EXPECT_GE(g_should_fixup_calls, g_fixup_calls);
// ==========================================================================
g_fixup_calls = 0;
g_should_fixup_calls = 0;
a.depth = absl::internal_stacktrace::GetStackFramesWithContext(
a.result, a.frames, a.sizes, kStackCount, kSkip, nullptr, nullptr);
g_enable_fixup = !g_enable_fixup;
b.depth = absl::internal_stacktrace::GetStackFramesWithContext(
b.result, b.frames, b.sizes, kStackCount, kSkip, nullptr, nullptr);
EXPECT_THAT(
absl::MakeSpan(a.result, static_cast<size_t>(a.depth)),
ContainerEq(absl::MakeSpan(b.result, static_cast<size_t>(b.depth))));
EXPECT_THAT(
absl::MakeSpan(a.sizes, static_cast<size_t>(a.depth)),
ContainerEq(absl::MakeSpan(b.sizes, static_cast<size_t>(b.depth))));
EXPECT_THAT(
absl::MakeSpan(a.frames, static_cast<size_t>(a.depth)),
ContainerEq(absl::MakeSpan(b.frames, static_cast<size_t>(b.depth))));
EXPECT_GT(g_should_fixup_calls, 0);
EXPECT_GE(g_should_fixup_calls, g_fixup_calls);
}
TEST(StackTrace, FixupNoFixupEquivalence) { FixupNoFixupEquivalenceNoInline(); }
TEST(StackTrace, FixupLowStackUsage) {
#if !ABSL_HAVE_ATTRIBUTE_WEAK
const char* kSkipReason = "Skipping test on MSVC due to weak symbols";
#elif defined(_WIN32)
// TODO(b/434184677): Add support for fixups on Windows if needed
const char* kSkipReason =
"Skipping test on Windows due to lack of support for fixups";
#else
const char* kSkipReason = nullptr;
#endif
// This conditional is to avoid an unreachable code warning.
if (kSkipReason != nullptr) {
GTEST_SKIP() << kSkipReason;
}
const Cleanup restore_state([enable_fixup = g_enable_fixup,
fixup_calls = g_fixup_calls,
should_fixup_calls = g_should_fixup_calls]() {
g_enable_fixup = enable_fixup;
g_fixup_calls = fixup_calls;
g_should_fixup_calls = should_fixup_calls;
});
g_enable_fixup = true;
// Request a ton of stack frames, regardless of how many are actually used.
// It's fine to request more frames than we have, since functions preallocate
// memory before discovering how high the stack really is, and we're really
// just trying to make sure the preallocations don't overflow the stack.
//
// Note that we loop in order to cover all sides of any branches in the
// implementation that switch allocation behavior (e.g., from stack to heap)
// and to ensure that no sides allocate too much stack space.
constexpr size_t kPageSize = 4096;
for (size_t depth = 2; depth < (1 << 20); depth += depth / 2) {
const auto stack = std::make_unique<void*[]>(depth);
const auto frames = std::make_unique<int[]>(depth);
absl::GetStackFrames(stack.get(), frames.get(), static_cast<int>(depth), 0);
const void* frame_address = nullptr;
#if ABSL_HAVE_BUILTIN(__builtin_frame_address)
frame_address = __builtin_frame_address(0);
#endif
size_t stack_usage =
reinterpret_cast<uintptr_t>(frame_address) - g_last_fixup_frame_address;
EXPECT_LT(stack_usage, kPageSize);
}
}
TEST(StackTrace, CustomUnwinderPerformsFixup) {
#if !ABSL_HAVE_ATTRIBUTE_WEAK
const char* kSkipReason = "Need weak symbol support";
#elif defined(_WIN32)
// TODO(b/434184677): Add support for fixups on Windows if needed
const char* kSkipReason =
"Skipping test on Windows due to lack of support for fixups";
#else
const char* kSkipReason = nullptr;
#endif
// This conditional is to avoid an unreachable code warning.
if (kSkipReason != nullptr) {
GTEST_SKIP() << kSkipReason;
}
constexpr int kSkip = 1; // Skip our own frame, whose return PCs won't match
constexpr auto kStackCount = 1;
absl::SetStackUnwinder(absl::DefaultStackUnwinder);
const Cleanup restore_state([enable_fixup = g_enable_fixup,
fixup_calls = g_fixup_calls,
should_fixup_calls = g_should_fixup_calls]() {
absl::SetStackUnwinder(nullptr);
g_enable_fixup = enable_fixup;
g_fixup_calls = fixup_calls;
g_should_fixup_calls = should_fixup_calls;
});
StackTrace trace;
g_enable_fixup = true;
g_should_fixup_calls = 0;
g_fixup_calls = 0;
absl::GetStackTrace(trace.result, kSkip, kStackCount);
EXPECT_GT(g_should_fixup_calls, 0);
EXPECT_GT(g_fixup_calls, 0);
g_enable_fixup = true;
g_should_fixup_calls = 0;
g_fixup_calls = 0;
absl::GetStackFrames(trace.result, trace.sizes, kSkip, kStackCount);
EXPECT_GT(g_should_fixup_calls, 0);
EXPECT_GT(g_fixup_calls, 0);
g_enable_fixup = true;
g_should_fixup_calls = 0;
g_fixup_calls = 0;
absl::GetStackTraceWithContext(trace.result, kSkip, kStackCount, nullptr,
nullptr);
EXPECT_GT(g_should_fixup_calls, 0);
EXPECT_GT(g_fixup_calls, 0);
g_enable_fixup = true;
g_should_fixup_calls = 0;
g_fixup_calls = 0;
absl::GetStackFramesWithContext(trace.result, trace.sizes, kSkip, kStackCount,
nullptr, nullptr);
EXPECT_GT(g_should_fixup_calls, 0);
EXPECT_GT(g_fixup_calls, 0);
}
#if ABSL_HAVE_BUILTIN(__builtin_frame_address)
struct FrameInfo {
const void* return_address;
uintptr_t frame_address;
};
// Returns the canonical frame address and return address for the current stack
// frame, while capturing the stack trace at the same time.
// This performs any platform-specific adjustments necessary to convert from the
// compiler built-ins to the expected API outputs.
ABSL_ATTRIBUTE_NO_SANITIZE_ADDRESS // May read random elements from stack.
ABSL_ATTRIBUTE_NO_SANITIZE_MEMORY // May read random elements from stack.
ABSL_ATTRIBUTE_NOINLINE static FrameInfo
CaptureBacktraceNoInline(StackTrace& backtrace) {
FrameInfo result;
result.return_address = __builtin_return_address(0);
// Large enough to cover all realistic slots the return address could be in
const int kMaxReturnAddressIndex = 5;
void* const* bfa = static_cast<void* const*>(__builtin_frame_address(0));
backtrace.depth = absl::internal_stacktrace::GetStackFramesWithContext(
backtrace.result, backtrace.frames, backtrace.sizes,
StackTrace::kStackCount, /*skip_count=*/0,
/*uc=*/nullptr, /*min_dropped_frames=*/nullptr);
// Make sure the return address is at a reasonable location in the frame
ptrdiff_t i;
for (i = 0; i < kMaxReturnAddressIndex; ++i) {
// Avoid std::find() here, since it lacks no-sanitize attributes.
if (bfa[i] == result.return_address) {
break;
}
}
result.frame_address =
i < kMaxReturnAddressIndex
? reinterpret_cast<uintptr_t>(
bfa + i + 1 /* get the Canonical Frame Address (CFA) */)
: 0;
return result;
}
TEST(StackTrace, CanonicalFrameAddresses) {
// Now capture a stack trace and verify that the return addresses and frame
// addresses line up for one frame.
StackTrace backtrace;
const auto [return_address, frame_address] =
CaptureBacktraceNoInline(backtrace);
auto return_addresses = absl::MakeSpan(backtrace.result)
.subspan(0, static_cast<size_t>(backtrace.depth));
auto frame_addresses = absl::MakeSpan(backtrace.frames)
.subspan(0, static_cast<size_t>(backtrace.depth));
// Many platforms don't support this by default.
bool support_is_expected = false;
if (support_is_expected) {
// If all zeros were returned, that is valid per the function's contract.
// It just means we don't support returning frame addresses on this
// platform.
bool supported = static_cast<size_t>(std::count(frame_addresses.begin(),
frame_addresses.end(), 0)) <
frame_addresses.size();
EXPECT_TRUE(supported);
if (supported) {
ASSERT_TRUE(frame_address)
<< "unable to obtain frame address corresponding to return address";
EXPECT_THAT(return_addresses, Contains(return_address).Times(1));
EXPECT_THAT(frame_addresses, Contains(frame_address).Times(1));
ptrdiff_t ifound = std::find(return_addresses.begin(),
return_addresses.end(), return_address) -
return_addresses.begin();
// Make sure we found the frame in the first place.
ASSERT_LT(ifound, backtrace.depth);
// Make sure the frame address actually corresponds to the return
// address.
EXPECT_EQ(frame_addresses[static_cast<size_t>(ifound)], frame_address);
// Make sure the addresses only appear once.
}
}
}
#endif
// This test is Linux specific.
#if defined(__linux__)
const void* g_return_address = nullptr;
bool g_sigusr2_raised = false;
void SigUsr2Handler(int, siginfo_t*, void* uc) {
absl::base_internal::ErrnoSaver errno_saver;
// Many platforms don't support this by default.
bool support_is_expected = false;
constexpr int kMaxStackDepth = 64;
void* result[kMaxStackDepth];
int depth =
absl::GetStackTraceWithContext(result, kMaxStackDepth, 0, uc, nullptr);
// Verify we can unwind past the nested signal handlers.
if (support_is_expected) {
EXPECT_THAT(absl::MakeSpan(result, static_cast<size_t>(depth)),
Contains(g_return_address).Times(1));
}
depth = absl::GetStackTrace(result, kMaxStackDepth, 0);
if (support_is_expected) {
EXPECT_THAT(absl::MakeSpan(result, static_cast<size_t>(depth)),
Contains(g_return_address).Times(1));
}
g_sigusr2_raised = true;
}
void SigUsr1Handler(int, siginfo_t*, void*) {
raise(SIGUSR2);
ABSL_BLOCK_TAIL_CALL_OPTIMIZATION();
}
ABSL_ATTRIBUTE_NOINLINE void RaiseSignal() {
g_return_address = __builtin_return_address(0);
raise(SIGUSR1);
ABSL_BLOCK_TAIL_CALL_OPTIMIZATION();
}
ABSL_ATTRIBUTE_NOINLINE void TestNestedSignal() {
constexpr size_t kAltstackSize = 1 << 14;
// Allocate altstack on regular stack to make sure it'll have a higher
// address than some of the regular stack frames.
char space[kAltstackSize];
stack_t altstack;
stack_t old_stack;
altstack.ss_sp = space;
altstack.ss_size = kAltstackSize;
altstack.ss_flags = 0;
ASSERT_EQ(sigaltstack(&altstack, &old_stack), 0) << strerror(errno);
struct sigaction act;
struct sigaction oldusr1act;
struct sigaction oldusr2act;
act.sa_sigaction = SigUsr1Handler;
act.sa_flags = SA_SIGINFO | SA_ONSTACK;
sigemptyset(&act.sa_mask);
ASSERT_EQ(sigaction(SIGUSR1, &act, &oldusr1act), 0) << strerror(errno);
act.sa_sigaction = SigUsr2Handler;
ASSERT_EQ(sigaction(SIGUSR2, &act, &oldusr2act), 0) << strerror(errno);
RaiseSignal();
ASSERT_EQ(sigaltstack(&old_stack, nullptr), 0) << strerror(errno);
ASSERT_EQ(sigaction(SIGUSR1, &oldusr1act, nullptr), 0) << strerror(errno);
ASSERT_EQ(sigaction(SIGUSR2, &oldusr2act, nullptr), 0) << strerror(errno);
ABSL_BLOCK_TAIL_CALL_OPTIMIZATION();
}
TEST(StackTrace, NestedSignal) {
// Verify we can unwind past the nested signal handlers.
TestNestedSignal();
EXPECT_TRUE(g_sigusr2_raised);
}
#endif
} // namespace
|