vasilito
cb424d7448
verify-patch-sanity.py validates every active recipe .patch has internally- consistent hunk line counts — catching the 'malformed patch at line N' failure at commit/CI/preflight time instead of hours into a cook. This cycle hit that class three times (qtwaylandscanner, sddm, xwayland), each only discovered when cookbook tried to apply the patch. Running it across the repo found 29 latent malformed patches (validated against GNU patch: e.g. relibc/P3-sysv-ipc reproduces 'malformed patch at line 22'). They were harmless only because they sit in vendored recipes (baked, not re- applied) — but would fail on any version-bump re-derivation. --fix recounts the hunk headers (body untouched) and repaired all 29. Wired into build-preflight.sh (Phase 1.0D) and redbear-ci.yml, with a unit test (test-patch-sanity.sh). Skips archived/legacy trees and unvalidatable formats (empty placeholders, bare-@@ git hunks).
59 lines
2.0 KiB
C++
59 lines
2.0 KiB
C++
//===--- Stack.cpp - Utilities for dealing with stack space ---------------===//
|
|
//
|
|
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
|
|
// See https://llvm.org/LICENSE.txt for license information.
|
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
///
|
|
/// \file
|
|
/// Defines utilities for dealing with stack allocation and stack space.
|
|
///
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "clang/Basic/Stack.h"
|
|
#include "llvm/Support/CrashRecoveryContext.h"
|
|
#include "llvm/Support/ProgramStack.h"
|
|
|
|
static LLVM_THREAD_LOCAL uintptr_t BottomOfStack = 0;
|
|
|
|
void clang::noteBottomOfStack(bool ForceSet) {
|
|
if (!BottomOfStack || ForceSet)
|
|
BottomOfStack = llvm::getStackPointer();
|
|
}
|
|
|
|
bool clang::isStackNearlyExhausted() {
|
|
// We consider 256 KiB to be sufficient for any code that runs between checks
|
|
// for stack size.
|
|
constexpr size_t SufficientStack = 256 << 10;
|
|
|
|
// If we don't know where the bottom of the stack is, hope for the best.
|
|
if (!BottomOfStack)
|
|
return false;
|
|
|
|
intptr_t StackDiff =
|
|
(intptr_t)llvm::getStackPointer() - (intptr_t)BottomOfStack;
|
|
size_t StackUsage = (size_t)std::abs(StackDiff);
|
|
|
|
// If the stack pointer has a surprising value, we do not understand this
|
|
// stack usage scheme. (Perhaps the target allocates new stack regions on
|
|
// demand for us.) Don't try to guess what's going on.
|
|
if (StackUsage > DesiredStackSize)
|
|
return false;
|
|
|
|
return StackUsage >= DesiredStackSize - SufficientStack;
|
|
}
|
|
|
|
void clang::runWithSufficientStackSpaceSlow(llvm::function_ref<void()> Diag,
|
|
llvm::function_ref<void()> Fn) {
|
|
llvm::CrashRecoveryContext CRC;
|
|
// Preserve the BottomOfStack in case RunSafelyOnNewStack uses split stacks.
|
|
uintptr_t PrevBottom = BottomOfStack;
|
|
CRC.RunSafelyOnNewStack([&] {
|
|
noteBottomOfStack(true);
|
|
Diag();
|
|
Fn();
|
|
}, DesiredStackSize);
|
|
BottomOfStack = PrevBottom;
|
|
}
|