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).
79 lines
2.5 KiB
C++
79 lines
2.5 KiB
C++
//===-- lib/Parser/instrumented-parser.cpp --------------------------------===//
|
|
//
|
|
// 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
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "flang/Parser/instrumented-parser.h"
|
|
#include "flang/Parser/message.h"
|
|
#include "flang/Parser/provenance.h"
|
|
#include "llvm/Support/raw_ostream.h"
|
|
#include <map>
|
|
|
|
namespace Fortran::parser {
|
|
|
|
void ParsingLog::clear() { perPos_.clear(); }
|
|
|
|
// In the logs, just use the addresses of the message texts to sort the
|
|
// map keys.
|
|
bool operator<(const MessageFixedText &x, const MessageFixedText &y) {
|
|
return x.text().begin() < y.text().begin();
|
|
}
|
|
|
|
bool ParsingLog::Fails(
|
|
const char *at, const MessageFixedText &tag, ParseState &state) {
|
|
std::size_t offset{reinterpret_cast<std::size_t>(at)};
|
|
auto posIter{perPos_.find(offset)};
|
|
if (posIter == perPos_.end()) {
|
|
return false;
|
|
}
|
|
auto tagIter{posIter->second.perTag.find(tag)};
|
|
if (tagIter == posIter->second.perTag.end()) {
|
|
return false;
|
|
}
|
|
auto &entry{tagIter->second};
|
|
if (entry.deferred && !state.deferMessages()) {
|
|
return false; // don't fail fast, we want to generate messages
|
|
}
|
|
++entry.count;
|
|
if (!state.deferMessages()) {
|
|
state.messages().Copy(entry.messages);
|
|
}
|
|
return !entry.pass;
|
|
}
|
|
|
|
void ParsingLog::Note(const char *at, const MessageFixedText &tag, bool pass,
|
|
const ParseState &state) {
|
|
std::size_t offset{reinterpret_cast<std::size_t>(at)};
|
|
auto &entry{perPos_[offset].perTag[tag]};
|
|
if (++entry.count == 1) {
|
|
entry.pass = pass;
|
|
entry.deferred = state.deferMessages();
|
|
if (!entry.deferred) {
|
|
entry.messages.Copy(state.messages());
|
|
}
|
|
} else {
|
|
CHECK(entry.pass == pass);
|
|
if (entry.deferred && !state.deferMessages()) {
|
|
entry.deferred = false;
|
|
entry.messages.Copy(state.messages());
|
|
}
|
|
}
|
|
}
|
|
|
|
void ParsingLog::Dump(
|
|
llvm::raw_ostream &o, const AllCookedSources &allCooked) const {
|
|
for (const auto &posLog : perPos_) {
|
|
const char *at{reinterpret_cast<const char *>(posLog.first)};
|
|
for (const auto &tagLog : posLog.second.perTag) {
|
|
Message{at, tagLog.first}.Emit(o, allCooked, true);
|
|
auto &entry{tagLog.second};
|
|
o << " " << (entry.pass ? "pass" : "fail") << " " << entry.count << '\n';
|
|
entry.messages.Emit(o, allCooked);
|
|
}
|
|
}
|
|
}
|
|
} // namespace Fortran::parser
|