mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2024-12-15 04:30:12 +00:00
dad20b2ae2
Split `Metadata` away from the `Value` class hierarchy, as part of PR21532. Assembly and bitcode changes are in the wings, but this is the bulk of the change for the IR C++ API. I have a follow-up patch prepared for `clang`. If this breaks other sub-projects, I apologize in advance :(. Help me compile it on Darwin I'll try to fix it. FWIW, the errors should be easy to fix, so it may be simpler to just fix it yourself. This breaks the build for all metadata-related code that's out-of-tree. Rest assured the transition is mechanical and the compiler should catch almost all of the problems. Here's a quick guide for updating your code: - `Metadata` is the root of a class hierarchy with three main classes: `MDNode`, `MDString`, and `ValueAsMetadata`. It is distinct from the `Value` class hierarchy. It is typeless -- i.e., instances do *not* have a `Type`. - `MDNode`'s operands are all `Metadata *` (instead of `Value *`). - `TrackingVH<MDNode>` and `WeakVH` referring to metadata can be replaced with `TrackingMDNodeRef` and `TrackingMDRef`, respectively. If you're referring solely to resolved `MDNode`s -- post graph construction -- just use `MDNode*`. - `MDNode` (and the rest of `Metadata`) have only limited support for `replaceAllUsesWith()`. As long as an `MDNode` is pointing at a forward declaration -- the result of `MDNode::getTemporary()` -- it maintains a side map of its uses and can RAUW itself. Once the forward declarations are fully resolved RAUW support is dropped on the ground. This means that uniquing collisions on changing operands cause nodes to become "distinct". (This already happened fairly commonly, whenever an operand went to null.) If you're constructing complex (non self-reference) `MDNode` cycles, you need to call `MDNode::resolveCycles()` on each node (or on a top-level node that somehow references all of the nodes). Also, don't do that. Metadata cycles (and the RAUW machinery needed to construct them) are expensive. - An `MDNode` can only refer to a `Constant` through a bridge called `ConstantAsMetadata` (one of the subclasses of `ValueAsMetadata`). As a side effect, accessing an operand of an `MDNode` that is known to be, e.g., `ConstantInt`, takes three steps: first, cast from `Metadata` to `ConstantAsMetadata`; second, extract the `Constant`; third, cast down to `ConstantInt`. The eventual goal is to introduce `MDInt`/`MDFloat`/etc. and have metadata schema owners transition away from using `Constant`s when the type isn't important (and they don't care about referring to `GlobalValue`s). In the meantime, I've added transitional API to the `mdconst` namespace that matches semantics with the old code, in order to avoid adding the error-prone three-step equivalent to every call site. If your old code was: MDNode *N = foo(); bar(isa <ConstantInt>(N->getOperand(0))); baz(cast <ConstantInt>(N->getOperand(1))); bak(cast_or_null <ConstantInt>(N->getOperand(2))); bat(dyn_cast <ConstantInt>(N->getOperand(3))); bay(dyn_cast_or_null<ConstantInt>(N->getOperand(4))); you can trivially match its semantics with: MDNode *N = foo(); bar(mdconst::hasa <ConstantInt>(N->getOperand(0))); baz(mdconst::extract <ConstantInt>(N->getOperand(1))); bak(mdconst::extract_or_null <ConstantInt>(N->getOperand(2))); bat(mdconst::dyn_extract <ConstantInt>(N->getOperand(3))); bay(mdconst::dyn_extract_or_null<ConstantInt>(N->getOperand(4))); and when you transition your metadata schema to `MDInt`: MDNode *N = foo(); bar(isa <MDInt>(N->getOperand(0))); baz(cast <MDInt>(N->getOperand(1))); bak(cast_or_null <MDInt>(N->getOperand(2))); bat(dyn_cast <MDInt>(N->getOperand(3))); bay(dyn_cast_or_null<MDInt>(N->getOperand(4))); - A `CallInst` -- specifically, intrinsic instructions -- can refer to metadata through a bridge called `MetadataAsValue`. This is a subclass of `Value` where `getType()->isMetadataTy()`. `MetadataAsValue` is the *only* class that can legally refer to a `LocalAsMetadata`, which is a bridged form of non-`Constant` values like `Argument` and `Instruction`. It can also refer to any other `Metadata` subclass. (I'll break all your testcases in a follow-up commit, when I propagate this change to assembly.) git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@223802 91177308-0d34-0410-b5e6-96231b3b80d8
248 lines
9.1 KiB
C++
248 lines
9.1 KiB
C++
//===- LexicalScopes.cpp - Collecting lexical scope info -*- C++ -*--------===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is distributed under the University of Illinois Open Source
|
|
// License. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
//
|
|
// This file implements LexicalScopes analysis.
|
|
//
|
|
// This pass collects lexical scope information and maps machine instructions
|
|
// to respective lexical scopes.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#ifndef LLVM_CODEGEN_LEXICALSCOPES_H
|
|
#define LLVM_CODEGEN_LEXICALSCOPES_H
|
|
|
|
#include "llvm/ADT/ArrayRef.h"
|
|
#include "llvm/ADT/DenseMap.h"
|
|
#include "llvm/ADT/SmallPtrSet.h"
|
|
#include "llvm/ADT/SmallVector.h"
|
|
#include "llvm/ADT/STLExtras.h"
|
|
#include "llvm/IR/DebugLoc.h"
|
|
#include "llvm/IR/Metadata.h"
|
|
#include "llvm/IR/ValueHandle.h"
|
|
#include <utility>
|
|
#include <unordered_map>
|
|
namespace llvm {
|
|
|
|
class MachineInstr;
|
|
class MachineBasicBlock;
|
|
class MachineFunction;
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
/// InsnRange - This is used to track range of instructions with identical
|
|
/// lexical scope.
|
|
///
|
|
typedef std::pair<const MachineInstr *, const MachineInstr *> InsnRange;
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
/// LexicalScope - This class is used to track scope information.
|
|
///
|
|
class LexicalScope {
|
|
|
|
public:
|
|
LexicalScope(LexicalScope *P, const MDNode *D, const MDNode *I, bool A)
|
|
: Parent(P), Desc(D), InlinedAtLocation(I), AbstractScope(A),
|
|
LastInsn(nullptr), FirstInsn(nullptr), DFSIn(0), DFSOut(0) {
|
|
assert((!D || D->isResolved()) && "Expected resolved node");
|
|
assert((!I || I->isResolved()) && "Expected resolved node");
|
|
if (Parent)
|
|
Parent->addChild(this);
|
|
}
|
|
|
|
// Accessors.
|
|
LexicalScope *getParent() const { return Parent; }
|
|
const MDNode *getDesc() const { return Desc; }
|
|
const MDNode *getInlinedAt() const { return InlinedAtLocation; }
|
|
const MDNode *getScopeNode() const { return Desc; }
|
|
bool isAbstractScope() const { return AbstractScope; }
|
|
SmallVectorImpl<LexicalScope *> &getChildren() { return Children; }
|
|
SmallVectorImpl<InsnRange> &getRanges() { return Ranges; }
|
|
|
|
/// addChild - Add a child scope.
|
|
void addChild(LexicalScope *S) { Children.push_back(S); }
|
|
|
|
/// openInsnRange - This scope covers instruction range starting from MI.
|
|
void openInsnRange(const MachineInstr *MI) {
|
|
if (!FirstInsn)
|
|
FirstInsn = MI;
|
|
|
|
if (Parent)
|
|
Parent->openInsnRange(MI);
|
|
}
|
|
|
|
/// extendInsnRange - Extend the current instruction range covered by
|
|
/// this scope.
|
|
void extendInsnRange(const MachineInstr *MI) {
|
|
assert(FirstInsn && "MI Range is not open!");
|
|
LastInsn = MI;
|
|
if (Parent)
|
|
Parent->extendInsnRange(MI);
|
|
}
|
|
|
|
/// closeInsnRange - Create a range based on FirstInsn and LastInsn collected
|
|
/// until now. This is used when a new scope is encountered while walking
|
|
/// machine instructions.
|
|
void closeInsnRange(LexicalScope *NewScope = nullptr) {
|
|
assert(LastInsn && "Last insn missing!");
|
|
Ranges.push_back(InsnRange(FirstInsn, LastInsn));
|
|
FirstInsn = nullptr;
|
|
LastInsn = nullptr;
|
|
// If Parent dominates NewScope then do not close Parent's instruction
|
|
// range.
|
|
if (Parent && (!NewScope || !Parent->dominates(NewScope)))
|
|
Parent->closeInsnRange(NewScope);
|
|
}
|
|
|
|
/// dominates - Return true if current scope dominates given lexical scope.
|
|
bool dominates(const LexicalScope *S) const {
|
|
if (S == this)
|
|
return true;
|
|
if (DFSIn < S->getDFSIn() && DFSOut > S->getDFSOut())
|
|
return true;
|
|
return false;
|
|
}
|
|
|
|
// Depth First Search support to walk and manipulate LexicalScope hierarchy.
|
|
unsigned getDFSOut() const { return DFSOut; }
|
|
void setDFSOut(unsigned O) { DFSOut = O; }
|
|
unsigned getDFSIn() const { return DFSIn; }
|
|
void setDFSIn(unsigned I) { DFSIn = I; }
|
|
|
|
/// dump - print lexical scope.
|
|
void dump(unsigned Indent = 0) const;
|
|
|
|
private:
|
|
LexicalScope *Parent; // Parent to this scope.
|
|
const MDNode *Desc; // Debug info descriptor.
|
|
const MDNode *InlinedAtLocation; // Location at which this
|
|
// scope is inlined.
|
|
bool AbstractScope; // Abstract Scope
|
|
SmallVector<LexicalScope *, 4> Children; // Scopes defined in scope.
|
|
// Contents not owned.
|
|
SmallVector<InsnRange, 4> Ranges;
|
|
|
|
const MachineInstr *LastInsn; // Last instruction of this scope.
|
|
const MachineInstr *FirstInsn; // First instruction of this scope.
|
|
unsigned DFSIn, DFSOut; // In & Out Depth use to determine
|
|
// scope nesting.
|
|
};
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
/// LexicalScopes - This class provides interface to collect and use lexical
|
|
/// scoping information from machine instruction.
|
|
///
|
|
class LexicalScopes {
|
|
public:
|
|
LexicalScopes() : MF(nullptr), CurrentFnLexicalScope(nullptr) {}
|
|
|
|
/// initialize - Scan machine function and constuct lexical scope nest, resets
|
|
/// the instance if necessary.
|
|
void initialize(const MachineFunction &);
|
|
|
|
/// releaseMemory - release memory.
|
|
void reset();
|
|
|
|
/// empty - Return true if there is any lexical scope information available.
|
|
bool empty() { return CurrentFnLexicalScope == nullptr; }
|
|
|
|
/// getCurrentFunctionScope - Return lexical scope for the current function.
|
|
LexicalScope *getCurrentFunctionScope() const {
|
|
return CurrentFnLexicalScope;
|
|
}
|
|
|
|
/// getMachineBasicBlocks - Populate given set using machine basic blocks
|
|
/// which have machine instructions that belong to lexical scope identified by
|
|
/// DebugLoc.
|
|
void getMachineBasicBlocks(DebugLoc DL,
|
|
SmallPtrSetImpl<const MachineBasicBlock *> &MBBs);
|
|
|
|
/// dominates - Return true if DebugLoc's lexical scope dominates at least one
|
|
/// machine instruction's lexical scope in a given machine basic block.
|
|
bool dominates(DebugLoc DL, MachineBasicBlock *MBB);
|
|
|
|
/// findLexicalScope - Find lexical scope, either regular or inlined, for the
|
|
/// given DebugLoc. Return NULL if not found.
|
|
LexicalScope *findLexicalScope(DebugLoc DL);
|
|
|
|
/// getAbstractScopesList - Return a reference to list of abstract scopes.
|
|
ArrayRef<LexicalScope *> getAbstractScopesList() const {
|
|
return AbstractScopesList;
|
|
}
|
|
|
|
/// findAbstractScope - Find an abstract scope or return null.
|
|
LexicalScope *findAbstractScope(const MDNode *N) {
|
|
auto I = AbstractScopeMap.find(N);
|
|
return I != AbstractScopeMap.end() ? &I->second : nullptr;
|
|
}
|
|
|
|
/// findInlinedScope - Find an inlined scope for the given DebugLoc or return
|
|
/// NULL.
|
|
LexicalScope *findInlinedScope(DebugLoc DL);
|
|
|
|
/// findLexicalScope - Find regular lexical scope or return null.
|
|
LexicalScope *findLexicalScope(const MDNode *N) {
|
|
auto I = LexicalScopeMap.find(N);
|
|
return I != LexicalScopeMap.end() ? &I->second : nullptr;
|
|
}
|
|
|
|
/// dump - Print data structures to dbgs().
|
|
void dump();
|
|
|
|
/// getOrCreateAbstractScope - Find or create an abstract lexical scope.
|
|
LexicalScope *getOrCreateAbstractScope(const MDNode *N);
|
|
|
|
private:
|
|
/// getOrCreateLexicalScope - Find lexical scope for the given DebugLoc. If
|
|
/// not available then create new lexical scope.
|
|
LexicalScope *getOrCreateLexicalScope(DebugLoc DL);
|
|
|
|
/// getOrCreateRegularScope - Find or create a regular lexical scope.
|
|
LexicalScope *getOrCreateRegularScope(MDNode *Scope);
|
|
|
|
/// getOrCreateInlinedScope - Find or create an inlined lexical scope.
|
|
LexicalScope *getOrCreateInlinedScope(MDNode *Scope, MDNode *InlinedAt);
|
|
|
|
/// extractLexicalScopes - Extract instruction ranges for each lexical scopes
|
|
/// for the given machine function.
|
|
void extractLexicalScopes(SmallVectorImpl<InsnRange> &MIRanges,
|
|
DenseMap<const MachineInstr *, LexicalScope *> &M);
|
|
void constructScopeNest(LexicalScope *Scope);
|
|
void
|
|
assignInstructionRanges(SmallVectorImpl<InsnRange> &MIRanges,
|
|
DenseMap<const MachineInstr *, LexicalScope *> &M);
|
|
|
|
private:
|
|
const MachineFunction *MF;
|
|
|
|
/// LexicalScopeMap - Tracks the scopes in the current function.
|
|
// Use an unordered_map to ensure value pointer validity over insertion.
|
|
std::unordered_map<const MDNode *, LexicalScope> LexicalScopeMap;
|
|
|
|
/// InlinedLexicalScopeMap - Tracks inlined function scopes in current
|
|
/// function.
|
|
std::unordered_map<std::pair<const MDNode *, const MDNode *>, LexicalScope,
|
|
pair_hash<const MDNode *, const MDNode *>>
|
|
InlinedLexicalScopeMap;
|
|
|
|
/// AbstractScopeMap - These scopes are not included LexicalScopeMap.
|
|
// Use an unordered_map to ensure value pointer validity over insertion.
|
|
std::unordered_map<const MDNode *, LexicalScope> AbstractScopeMap;
|
|
|
|
/// AbstractScopesList - Tracks abstract scopes constructed while processing
|
|
/// a function.
|
|
SmallVector<LexicalScope *, 4> AbstractScopesList;
|
|
|
|
/// CurrentFnLexicalScope - Top level scope for the current function.
|
|
///
|
|
LexicalScope *CurrentFnLexicalScope;
|
|
};
|
|
|
|
} // end llvm namespace
|
|
|
|
#endif
|