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).
142 lines
4.9 KiB
C++
142 lines
4.9 KiB
C++
//===- ValueSymbolTable.cpp - Implement the ValueSymbolTable class --------===//
|
|
//
|
|
// 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
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
//
|
|
// This file implements the ValueSymbolTable class for the IR library.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "llvm/IR/ValueSymbolTable.h"
|
|
#include "llvm/ADT/SmallString.h"
|
|
#include "llvm/Config/llvm-config.h"
|
|
#include "llvm/IR/GlobalValue.h"
|
|
#include "llvm/IR/Module.h"
|
|
#include "llvm/IR/Type.h"
|
|
#include "llvm/IR/Value.h"
|
|
#include "llvm/Support/Casting.h"
|
|
#include "llvm/Support/Compiler.h"
|
|
#include "llvm/Support/Debug.h"
|
|
#include "llvm/Support/raw_ostream.h"
|
|
#include "llvm/TargetParser/Triple.h"
|
|
#include <cassert>
|
|
#include <utility>
|
|
|
|
using namespace llvm;
|
|
|
|
#define DEBUG_TYPE "valuesymtab"
|
|
|
|
// Class destructor
|
|
ValueSymbolTable::~ValueSymbolTable() {
|
|
#ifndef NDEBUG // Only do this in -g mode...
|
|
for (const auto &VI : vmap)
|
|
dbgs() << "Value still in symbol table! Type = '"
|
|
<< *VI.getValue()->getType() << "' Name = '" << VI.getKeyData()
|
|
<< "'\n";
|
|
assert(vmap.empty() && "Values remain in symbol table!");
|
|
#endif
|
|
}
|
|
|
|
ValueName *ValueSymbolTable::makeUniqueName(Value *V,
|
|
SmallString<256> &UniqueName) {
|
|
unsigned BaseSize = UniqueName.size();
|
|
bool AppenDot = false;
|
|
if (auto *GV = dyn_cast<GlobalValue>(V)) {
|
|
// A dot is appended to mark it as clone during ABI demangling so that
|
|
// for example "_Z1fv" and "_Z1fv.1" both demangle to "f()", the second
|
|
// one being a clone.
|
|
// On NVPTX we cannot use a dot because PTX only allows [A-Za-z0-9_$] for
|
|
// identifiers. This breaks ABI demangling but at least ptxas accepts and
|
|
// compiles the program.
|
|
const Module *M = GV->getParent();
|
|
if (!(M && M->getTargetTriple().isNVPTX()))
|
|
AppenDot = true;
|
|
}
|
|
|
|
while (true) {
|
|
// Trim any suffix off and append the next number.
|
|
UniqueName.resize(BaseSize);
|
|
raw_svector_ostream S(UniqueName);
|
|
if (AppenDot)
|
|
S << ".";
|
|
S << ++LastUnique;
|
|
|
|
// Retry if MaxNameSize has been exceeded.
|
|
if (MaxNameSize > -1 && UniqueName.size() > (size_t)MaxNameSize) {
|
|
assert(BaseSize >= UniqueName.size() - (size_t)MaxNameSize &&
|
|
"Can't generate unique name: MaxNameSize is too small.");
|
|
BaseSize -= UniqueName.size() - (size_t)MaxNameSize;
|
|
continue;
|
|
}
|
|
// Try insert the vmap entry with this suffix.
|
|
auto IterBool = vmap.insert(std::make_pair(UniqueName.str(), V));
|
|
if (IterBool.second)
|
|
return &*IterBool.first;
|
|
}
|
|
}
|
|
|
|
// Insert a value into the symbol table with the specified name...
|
|
//
|
|
void ValueSymbolTable::reinsertValue(Value *V) {
|
|
assert(V->hasName() && "Can't insert nameless Value into symbol table");
|
|
|
|
// Try inserting the name, assuming it won't conflict.
|
|
if (vmap.insert(V->getValueName())) {
|
|
// LLVM_DEBUG(dbgs() << " Inserted value: " << V->getValueName() << ": " <<
|
|
// *V << "\n");
|
|
return;
|
|
}
|
|
|
|
// Otherwise, there is a naming conflict. Rename this value.
|
|
SmallString<256> UniqueName(V->getName().begin(), V->getName().end());
|
|
|
|
// The name is too already used, just free it so we can allocate a new name.
|
|
MallocAllocator Allocator;
|
|
V->getValueName()->Destroy(Allocator);
|
|
|
|
ValueName *VN = makeUniqueName(V, UniqueName);
|
|
V->setValueName(VN);
|
|
}
|
|
|
|
void ValueSymbolTable::removeValueName(ValueName *V) {
|
|
// LLVM_DEBUG(dbgs() << " Removing Value: " << V->getKeyData() << "\n");
|
|
// Remove the value from the symbol table.
|
|
vmap.remove(V);
|
|
}
|
|
|
|
/// createValueName - This method attempts to create a value name and insert
|
|
/// it into the symbol table with the specified name. If it conflicts, it
|
|
/// auto-renames the name and returns that instead.
|
|
ValueName *ValueSymbolTable::createValueName(StringRef Name, Value *V) {
|
|
if (MaxNameSize > -1 && Name.size() > (unsigned)MaxNameSize)
|
|
Name = Name.substr(0, std::max(1u, (unsigned)MaxNameSize));
|
|
|
|
// In the common case, the name is not already in the symbol table.
|
|
auto IterBool = vmap.insert(std::make_pair(Name, V));
|
|
if (IterBool.second) {
|
|
// LLVM_DEBUG(dbgs() << " Inserted value: " << Entry.getKeyData() << ": "
|
|
// << *V << "\n");
|
|
return &*IterBool.first;
|
|
}
|
|
|
|
// Otherwise, there is a naming conflict. Rename this value.
|
|
SmallString<256> UniqueName(Name.begin(), Name.end());
|
|
return makeUniqueName(V, UniqueName);
|
|
}
|
|
|
|
#if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
|
|
// dump - print out the symbol table
|
|
//
|
|
LLVM_DUMP_METHOD void ValueSymbolTable::dump() const {
|
|
// dbgs() << "ValueSymbolTable:\n";
|
|
for (const auto &I : *this) {
|
|
// dbgs() << " '" << I->getKeyData() << "' = ";
|
|
I.getValue()->dump();
|
|
// dbgs() << "\n";
|
|
}
|
|
}
|
|
#endif
|