2010-11-30 10:17:10 +08:00
|
|
|
//===- LiveDebugVariables.cpp - Tracking debug info variables -------------===//
|
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
|
|
|
// This file implements the LiveDebugVariables analysis.
|
|
|
|
//
|
|
|
|
// Remove all DBG_VALUE instructions referencing virtual registers and replace
|
|
|
|
// them with a data structure tracking where live user variables are kept - in a
|
|
|
|
// virtual register or in a stack slot.
|
|
|
|
//
|
|
|
|
// Allow the data structure to be updated during register allocation when values
|
|
|
|
// are moved between registers and stack slots. Finally emit new DBG_VALUE
|
|
|
|
// instructions after register allocation is complete.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
#include "LiveDebugVariables.h"
|
2017-08-25 05:21:39 +08:00
|
|
|
#include "llvm/ADT/ArrayRef.h"
|
|
|
|
#include "llvm/ADT/DenseMap.h"
|
2010-12-02 08:37:37 +08:00
|
|
|
#include "llvm/ADT/IntervalMap.h"
|
2017-08-25 05:21:39 +08:00
|
|
|
#include "llvm/ADT/STLExtras.h"
|
2017-08-03 19:54:02 +08:00
|
|
|
#include "llvm/ADT/SmallSet.h"
|
2017-08-25 05:21:39 +08:00
|
|
|
#include "llvm/ADT/SmallVector.h"
|
2011-08-05 02:45:38 +08:00
|
|
|
#include "llvm/ADT/Statistic.h"
|
2017-08-25 05:21:39 +08:00
|
|
|
#include "llvm/ADT/StringRef.h"
|
2017-08-03 19:54:02 +08:00
|
|
|
#include "llvm/CodeGen/LexicalScopes.h"
|
2017-08-25 05:21:39 +08:00
|
|
|
#include "llvm/CodeGen/LiveInterval.h"
|
2017-12-13 10:51:04 +08:00
|
|
|
#include "llvm/CodeGen/LiveIntervals.h"
|
2017-08-25 05:21:39 +08:00
|
|
|
#include "llvm/CodeGen/MachineBasicBlock.h"
|
2010-12-02 08:37:37 +08:00
|
|
|
#include "llvm/CodeGen/MachineDominators.h"
|
2010-12-04 05:47:10 +08:00
|
|
|
#include "llvm/CodeGen/MachineFunction.h"
|
2017-08-25 05:21:39 +08:00
|
|
|
#include "llvm/CodeGen/MachineInstr.h"
|
2010-12-04 05:47:10 +08:00
|
|
|
#include "llvm/CodeGen/MachineInstrBuilder.h"
|
2017-08-25 05:21:39 +08:00
|
|
|
#include "llvm/CodeGen/MachineOperand.h"
|
2011-03-19 05:42:19 +08:00
|
|
|
#include "llvm/CodeGen/MachineRegisterInfo.h"
|
2017-08-25 05:21:39 +08:00
|
|
|
#include "llvm/CodeGen/SlotIndexes.h"
|
2017-11-08 09:01:31 +08:00
|
|
|
#include "llvm/CodeGen/TargetInstrInfo.h"
|
2017-11-17 09:07:10 +08:00
|
|
|
#include "llvm/CodeGen/TargetOpcodes.h"
|
|
|
|
#include "llvm/CodeGen/TargetRegisterInfo.h"
|
|
|
|
#include "llvm/CodeGen/TargetSubtargetInfo.h"
|
2012-11-29 03:13:06 +08:00
|
|
|
#include "llvm/CodeGen/VirtRegMap.h"
|
2017-08-25 05:21:39 +08:00
|
|
|
#include "llvm/IR/DebugInfoMetadata.h"
|
|
|
|
#include "llvm/IR/DebugLoc.h"
|
|
|
|
#include "llvm/IR/Function.h"
|
2013-01-02 19:36:10 +08:00
|
|
|
#include "llvm/IR/Metadata.h"
|
2017-08-25 05:21:39 +08:00
|
|
|
#include "llvm/MC/MCRegisterInfo.h"
|
|
|
|
#include "llvm/Pass.h"
|
|
|
|
#include "llvm/Support/Casting.h"
|
2010-12-02 08:37:37 +08:00
|
|
|
#include "llvm/Support/CommandLine.h"
|
2017-08-25 05:21:39 +08:00
|
|
|
#include "llvm/Support/Compiler.h"
|
2010-12-02 08:37:37 +08:00
|
|
|
#include "llvm/Support/Debug.h"
|
2015-03-24 03:32:43 +08:00
|
|
|
#include "llvm/Support/raw_ostream.h"
|
2017-08-25 05:21:39 +08:00
|
|
|
#include <algorithm>
|
|
|
|
#include <cassert>
|
|
|
|
#include <iterator>
|
2014-04-22 04:37:07 +08:00
|
|
|
#include <memory>
|
2016-05-27 22:27:24 +08:00
|
|
|
#include <utility>
|
2014-04-22 04:37:07 +08:00
|
|
|
|
2010-11-30 10:17:10 +08:00
|
|
|
using namespace llvm;
|
|
|
|
|
2017-05-26 05:26:32 +08:00
|
|
|
#define DEBUG_TYPE "livedebugvars"
|
2014-04-22 10:02:50 +08:00
|
|
|
|
2011-01-08 06:33:41 +08:00
|
|
|
static cl::opt<bool>
|
2011-01-13 07:36:21 +08:00
|
|
|
EnableLDV("live-debug-variables", cl::init(true),
|
2011-01-08 06:33:41 +08:00
|
|
|
cl::desc("Enable the live debug variables pass"), cl::Hidden);
|
|
|
|
|
2011-08-05 02:45:38 +08:00
|
|
|
STATISTIC(NumInsertedDebugValues, "Number of DBG_VALUEs inserted");
|
2017-08-25 05:21:39 +08:00
|
|
|
|
2010-11-30 10:17:10 +08:00
|
|
|
char LiveDebugVariables::ID = 0;
|
|
|
|
|
2017-05-26 05:26:32 +08:00
|
|
|
INITIALIZE_PASS_BEGIN(LiveDebugVariables, DEBUG_TYPE,
|
2010-11-30 10:17:10 +08:00
|
|
|
"Debug Variable Analysis", false, false)
|
2010-12-02 08:37:37 +08:00
|
|
|
INITIALIZE_PASS_DEPENDENCY(MachineDominatorTree)
|
2010-11-30 10:17:10 +08:00
|
|
|
INITIALIZE_PASS_DEPENDENCY(LiveIntervals)
|
2017-05-26 05:26:32 +08:00
|
|
|
INITIALIZE_PASS_END(LiveDebugVariables, DEBUG_TYPE,
|
2010-11-30 10:17:10 +08:00
|
|
|
"Debug Variable Analysis", false, false)
|
|
|
|
|
|
|
|
void LiveDebugVariables::getAnalysisUsage(AnalysisUsage &AU) const {
|
2010-12-02 08:37:37 +08:00
|
|
|
AU.addRequired<MachineDominatorTree>();
|
2010-11-30 10:17:10 +08:00
|
|
|
AU.addRequiredTransitive<LiveIntervals>();
|
|
|
|
AU.setPreservesAll();
|
|
|
|
MachineFunctionPass::getAnalysisUsage(AU);
|
|
|
|
}
|
|
|
|
|
2017-08-25 05:21:39 +08:00
|
|
|
LiveDebugVariables::LiveDebugVariables() : MachineFunctionPass(ID) {
|
2010-11-30 10:17:10 +08:00
|
|
|
initializeLiveDebugVariablesPass(*PassRegistry::getPassRegistry());
|
|
|
|
}
|
|
|
|
|
2017-10-04 01:59:02 +08:00
|
|
|
enum : unsigned { UndefLocNo = ~0U };
|
|
|
|
|
|
|
|
/// Describes a location by number along with some flags about the original
|
|
|
|
/// usage of the location.
|
|
|
|
class DbgValueLocation {
|
|
|
|
public:
|
|
|
|
DbgValueLocation(unsigned LocNo, bool WasIndirect)
|
|
|
|
: LocNo(LocNo), WasIndirect(WasIndirect) {
|
|
|
|
static_assert(sizeof(*this) == sizeof(unsigned), "bad bitfield packing");
|
|
|
|
assert(locNo() == LocNo && "location truncation");
|
|
|
|
}
|
|
|
|
|
|
|
|
DbgValueLocation() : LocNo(0), WasIndirect(0) {}
|
|
|
|
|
|
|
|
unsigned locNo() const {
|
|
|
|
// Fix up the undef location number, which gets truncated.
|
|
|
|
return LocNo == INT_MAX ? UndefLocNo : LocNo;
|
|
|
|
}
|
|
|
|
bool wasIndirect() const { return WasIndirect; }
|
|
|
|
bool isUndef() const { return locNo() == UndefLocNo; }
|
|
|
|
|
|
|
|
DbgValueLocation changeLocNo(unsigned NewLocNo) const {
|
|
|
|
return DbgValueLocation(NewLocNo, WasIndirect);
|
|
|
|
}
|
|
|
|
|
2017-10-04 02:30:11 +08:00
|
|
|
friend inline bool operator==(const DbgValueLocation &LHS,
|
|
|
|
const DbgValueLocation &RHS) {
|
|
|
|
return LHS.LocNo == RHS.LocNo && LHS.WasIndirect == RHS.WasIndirect;
|
|
|
|
}
|
|
|
|
|
|
|
|
friend inline bool operator!=(const DbgValueLocation &LHS,
|
|
|
|
const DbgValueLocation &RHS) {
|
|
|
|
return !(LHS == RHS);
|
2017-10-04 01:59:02 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
|
|
|
unsigned LocNo : 31;
|
|
|
|
unsigned WasIndirect : 1;
|
|
|
|
};
|
|
|
|
|
2010-12-02 08:37:37 +08:00
|
|
|
/// LocMap - Map of where a user value is live, and its location.
|
2017-10-04 01:59:02 +08:00
|
|
|
using LocMap = IntervalMap<SlotIndex, DbgValueLocation, 4>;
|
2017-08-25 05:21:39 +08:00
|
|
|
|
|
|
|
namespace {
|
|
|
|
|
|
|
|
class LDVImpl;
|
2010-12-02 08:37:37 +08:00
|
|
|
|
|
|
|
/// UserValue - A user value is a part of a debug info user variable.
|
|
|
|
///
|
|
|
|
/// A DBG_VALUE instruction notes that (a sub-register of) a virtual register
|
|
|
|
/// holds part of a user variable. The part is identified by a byte offset.
|
|
|
|
///
|
|
|
|
/// UserValues are grouped into equivalence classes for easier searching. Two
|
|
|
|
/// user values are related if they refer to the same variable, or if they are
|
|
|
|
/// held by the same virtual register. The equivalence class is the transitive
|
|
|
|
/// closure of that relation.
|
|
|
|
class UserValue {
|
2017-09-21 02:19:08 +08:00
|
|
|
const DILocalVariable *Variable; ///< The debug info variable we are part of.
|
|
|
|
const DIExpression *Expression; ///< Any complex address expression.
|
2011-02-04 09:43:25 +08:00
|
|
|
DebugLoc dl; ///< The debug location for the variable. This is
|
|
|
|
///< used by dwarf writer to find lexical scope.
|
2010-12-02 08:37:37 +08:00
|
|
|
UserValue *leader; ///< Equivalence class leader.
|
2017-08-25 05:21:39 +08:00
|
|
|
UserValue *next = nullptr; ///< Next value in equivalence class, or null.
|
2010-12-02 08:37:37 +08:00
|
|
|
|
|
|
|
/// Numbered locations referenced by locmap.
|
2011-01-09 13:33:21 +08:00
|
|
|
SmallVector<MachineOperand, 4> locations;
|
2010-12-02 08:37:37 +08:00
|
|
|
|
|
|
|
/// Map of slot indices where this value is live.
|
|
|
|
LocMap locInts;
|
|
|
|
|
2017-08-03 19:54:02 +08:00
|
|
|
/// Set of interval start indexes that have been trimmed to the
|
|
|
|
/// lexical scope.
|
|
|
|
SmallSet<SlotIndex, 2> trimmedDefs;
|
|
|
|
|
2010-12-04 05:47:10 +08:00
|
|
|
/// insertDebugValue - Insert a DBG_VALUE into MBB at Idx for LocNo.
|
2017-10-05 16:37:31 +08:00
|
|
|
void insertDebugValue(MachineBasicBlock *MBB, SlotIndex StartIdx,
|
|
|
|
SlotIndex StopIdx,
|
2017-10-04 01:59:02 +08:00
|
|
|
DbgValueLocation Loc, bool Spilled, LiveIntervals &LIS,
|
2017-10-05 16:37:31 +08:00
|
|
|
const TargetInstrInfo &TII,
|
|
|
|
const TargetRegisterInfo &TRI);
|
2010-12-04 05:47:10 +08:00
|
|
|
|
2011-05-07 02:00:02 +08:00
|
|
|
/// splitLocation - Replace OldLocNo ranges with NewRegs ranges where NewRegs
|
|
|
|
/// is live. Returns true if any changes were made.
|
2013-08-15 07:50:04 +08:00
|
|
|
bool splitLocation(unsigned OldLocNo, ArrayRef<unsigned> NewRegs,
|
|
|
|
LiveIntervals &LIS);
|
2011-05-07 02:00:02 +08:00
|
|
|
|
2010-12-02 08:37:37 +08:00
|
|
|
public:
|
|
|
|
/// UserValue - Create a new UserValue.
|
2017-10-04 01:59:02 +08:00
|
|
|
UserValue(const DILocalVariable *var, const DIExpression *expr, DebugLoc L,
|
|
|
|
LocMap::Allocator &alloc)
|
|
|
|
: Variable(var), Expression(expr), dl(std::move(L)), leader(this),
|
|
|
|
locInts(alloc) {}
|
2010-12-02 08:37:37 +08:00
|
|
|
|
|
|
|
/// getLeader - Get the leader of this value's equivalence class.
|
|
|
|
UserValue *getLeader() {
|
|
|
|
UserValue *l = leader;
|
|
|
|
while (l != l->leader)
|
|
|
|
l = l->leader;
|
|
|
|
return leader = l;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// getNext - Return the next UserValue in the equivalence class.
|
|
|
|
UserValue *getNext() const { return next; }
|
|
|
|
|
2011-07-07 07:09:51 +08:00
|
|
|
/// match - Does this UserValue match the parameters?
|
2017-09-21 02:19:08 +08:00
|
|
|
bool match(const DILocalVariable *Var, const DIExpression *Expr,
|
2017-10-04 01:59:02 +08:00
|
|
|
const DILocation *IA) const {
|
|
|
|
// FIXME: The fragment should be part of the equivalence class, but not
|
|
|
|
// other things in the expression like stack values.
|
|
|
|
return Var == Variable && Expr == Expression && dl->getInlinedAt() == IA;
|
2010-12-02 08:37:37 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/// merge - Merge equivalence classes.
|
|
|
|
static UserValue *merge(UserValue *L1, UserValue *L2) {
|
|
|
|
L2 = L2->getLeader();
|
|
|
|
if (!L1)
|
|
|
|
return L2;
|
|
|
|
L1 = L1->getLeader();
|
|
|
|
if (L1 == L2)
|
|
|
|
return L1;
|
|
|
|
// Splice L2 before L1's members.
|
|
|
|
UserValue *End = L2;
|
2016-02-19 06:09:30 +08:00
|
|
|
while (End->next) {
|
|
|
|
End->leader = L1;
|
|
|
|
End = End->next;
|
|
|
|
}
|
2010-12-02 08:37:37 +08:00
|
|
|
End->leader = L1;
|
|
|
|
End->next = L1->next;
|
|
|
|
L1->next = L2;
|
|
|
|
return L1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// getLocationNo - Return the location number that matches Loc.
|
2011-01-09 13:33:21 +08:00
|
|
|
unsigned getLocationNo(const MachineOperand &LocMO) {
|
2011-03-19 05:42:19 +08:00
|
|
|
if (LocMO.isReg()) {
|
|
|
|
if (LocMO.getReg() == 0)
|
2017-09-16 06:08:50 +08:00
|
|
|
return UndefLocNo;
|
2011-03-19 05:42:19 +08:00
|
|
|
// For register locations we dont care about use/def and other flags.
|
|
|
|
for (unsigned i = 0, e = locations.size(); i != e; ++i)
|
|
|
|
if (locations[i].isReg() &&
|
|
|
|
locations[i].getReg() == LocMO.getReg() &&
|
|
|
|
locations[i].getSubReg() == LocMO.getSubReg())
|
|
|
|
return i;
|
|
|
|
} else
|
|
|
|
for (unsigned i = 0, e = locations.size(); i != e; ++i)
|
|
|
|
if (LocMO.isIdenticalTo(locations[i]))
|
|
|
|
return i;
|
2011-01-09 13:33:21 +08:00
|
|
|
locations.push_back(LocMO);
|
|
|
|
// We are storing a MachineOperand outside a MachineInstr.
|
|
|
|
locations.back().clearParent();
|
2011-03-19 05:42:19 +08:00
|
|
|
// Don't store def operands.
|
2017-12-30 05:01:09 +08:00
|
|
|
if (locations.back().isReg()) {
|
|
|
|
if (locations.back().isDef())
|
|
|
|
locations.back().setIsDead(false);
|
2011-03-19 05:42:19 +08:00
|
|
|
locations.back().setIsUse();
|
2017-12-30 05:01:09 +08:00
|
|
|
}
|
2011-01-09 13:33:21 +08:00
|
|
|
return locations.size() - 1;
|
2010-12-02 08:37:37 +08:00
|
|
|
}
|
|
|
|
|
2011-03-19 05:42:19 +08:00
|
|
|
/// mapVirtRegs - Ensure that all virtual register locations are mapped.
|
|
|
|
void mapVirtRegs(LDVImpl *LDV);
|
|
|
|
|
2010-12-02 08:37:37 +08:00
|
|
|
/// addDef - Add a definition point to this value.
|
2017-10-04 01:59:02 +08:00
|
|
|
void addDef(SlotIndex Idx, const MachineOperand &LocMO, bool IsIndirect) {
|
|
|
|
DbgValueLocation Loc(getLocationNo(LocMO), IsIndirect);
|
2010-12-02 08:37:37 +08:00
|
|
|
// Add a singular (Idx,Idx) -> Loc mapping.
|
|
|
|
LocMap::iterator I = locInts.find(Idx);
|
|
|
|
if (!I.valid() || I.start() != Idx)
|
2017-10-04 01:59:02 +08:00
|
|
|
I.insert(Idx, Idx.getNextSlot(), Loc);
|
2011-08-04 07:44:31 +08:00
|
|
|
else
|
|
|
|
// A later DBG_VALUE at the same SlotIndex overrides the old location.
|
2017-10-04 01:59:02 +08:00
|
|
|
I.setValue(Loc);
|
2010-12-02 08:37:37 +08:00
|
|
|
}
|
|
|
|
|
2016-09-29 05:34:23 +08:00
|
|
|
/// extendDef - Extend the current definition as far as possible down.
|
|
|
|
/// Stop when meeting an existing def or when leaving the live
|
2010-12-02 08:37:37 +08:00
|
|
|
/// range of VNI.
|
2011-03-19 05:42:19 +08:00
|
|
|
/// End points where VNI is no longer live are added to Kills.
|
2010-12-02 08:37:37 +08:00
|
|
|
/// @param Idx Starting point for the definition.
|
2017-10-04 01:59:02 +08:00
|
|
|
/// @param Loc Location number to propagate.
|
2013-10-11 05:29:02 +08:00
|
|
|
/// @param LR Restrict liveness to where LR has the value VNI. May be null.
|
|
|
|
/// @param VNI When LR is not null, this is the value to restrict to.
|
2011-03-19 05:42:19 +08:00
|
|
|
/// @param Kills Append end points of VNI's live range to Kills.
|
2010-12-02 08:37:37 +08:00
|
|
|
/// @param LIS Live intervals analysis.
|
2017-10-04 01:59:02 +08:00
|
|
|
void extendDef(SlotIndex Idx, DbgValueLocation Loc,
|
2013-10-11 05:29:02 +08:00
|
|
|
LiveRange *LR, const VNInfo *VNI,
|
2011-03-19 05:42:19 +08:00
|
|
|
SmallVectorImpl<SlotIndex> *Kills,
|
2016-09-29 05:34:23 +08:00
|
|
|
LiveIntervals &LIS);
|
2010-12-02 08:37:37 +08:00
|
|
|
|
2011-03-19 05:42:19 +08:00
|
|
|
/// addDefsFromCopies - The value in LI/LocNo may be copies to other
|
|
|
|
/// registers. Determine if any of the copies are available at the kill
|
|
|
|
/// points, and add defs if possible.
|
|
|
|
/// @param LI Scan for copies of the value in LI->reg.
|
|
|
|
/// @param LocNo Location number of LI->reg.
|
2017-10-04 01:59:02 +08:00
|
|
|
/// @param WasIndirect Indicates if the original use of LI->reg was indirect
|
2011-03-19 05:42:19 +08:00
|
|
|
/// @param Kills Points where the range of LocNo could be extended.
|
|
|
|
/// @param NewDefs Append (Idx, LocNo) of inserted defs here.
|
2017-10-04 01:59:02 +08:00
|
|
|
void addDefsFromCopies(
|
|
|
|
LiveInterval *LI, unsigned LocNo, bool WasIndirect,
|
|
|
|
const SmallVectorImpl<SlotIndex> &Kills,
|
|
|
|
SmallVectorImpl<std::pair<SlotIndex, DbgValueLocation>> &NewDefs,
|
|
|
|
MachineRegisterInfo &MRI, LiveIntervals &LIS);
|
2011-03-19 05:42:19 +08:00
|
|
|
|
2010-12-02 08:37:37 +08:00
|
|
|
/// computeIntervals - Compute the live intervals of all locations after
|
|
|
|
/// collecting all their def points.
|
2012-06-23 01:15:32 +08:00
|
|
|
void computeIntervals(MachineRegisterInfo &MRI, const TargetRegisterInfo &TRI,
|
2017-08-03 19:54:02 +08:00
|
|
|
LiveIntervals &LIS, LexicalScopes &LS);
|
2010-12-02 08:37:37 +08:00
|
|
|
|
2011-05-07 02:00:02 +08:00
|
|
|
/// splitRegister - Replace OldReg ranges with NewRegs ranges where NewRegs is
|
|
|
|
/// live. Returns true if any changes were made.
|
2013-08-15 07:50:04 +08:00
|
|
|
bool splitRegister(unsigned OldLocNo, ArrayRef<unsigned> NewRegs,
|
|
|
|
LiveIntervals &LIS);
|
2011-05-07 02:00:02 +08:00
|
|
|
|
2010-12-04 05:47:10 +08:00
|
|
|
/// rewriteLocations - Rewrite virtual register locations according to the
|
2017-09-21 02:19:08 +08:00
|
|
|
/// provided virtual register map. Record which locations were spilled.
|
|
|
|
void rewriteLocations(VirtRegMap &VRM, const TargetRegisterInfo &TRI,
|
|
|
|
BitVector &SpilledLocations);
|
2010-12-04 05:47:10 +08:00
|
|
|
|
2013-02-13 10:29:18 +08:00
|
|
|
/// emitDebugValues - Recreate DBG_VALUE instruction from data structures.
|
2017-09-21 02:19:08 +08:00
|
|
|
void emitDebugValues(VirtRegMap *VRM, LiveIntervals &LIS,
|
2017-10-05 16:37:31 +08:00
|
|
|
const TargetInstrInfo &TII,
|
|
|
|
const TargetRegisterInfo &TRI,
|
2017-09-21 02:19:08 +08:00
|
|
|
const BitVector &SpilledLocations);
|
2010-12-04 05:47:10 +08:00
|
|
|
|
2011-09-14 02:40:53 +08:00
|
|
|
/// getDebugLoc - Return DebugLoc of this UserValue.
|
|
|
|
DebugLoc getDebugLoc() { return dl;}
|
2017-08-25 05:21:39 +08:00
|
|
|
|
2015-02-27 08:11:34 +08:00
|
|
|
void print(raw_ostream &, const TargetRegisterInfo *);
|
2010-12-02 08:37:37 +08:00
|
|
|
};
|
|
|
|
|
|
|
|
/// LDVImpl - Implementation of the LiveDebugVariables pass.
|
|
|
|
class LDVImpl {
|
|
|
|
LiveDebugVariables &pass;
|
|
|
|
LocMap::Allocator allocator;
|
2017-08-25 05:21:39 +08:00
|
|
|
MachineFunction *MF = nullptr;
|
2010-12-02 08:37:37 +08:00
|
|
|
LiveIntervals *LIS;
|
|
|
|
const TargetRegisterInfo *TRI;
|
|
|
|
|
2013-02-14 04:23:48 +08:00
|
|
|
/// Whether emitDebugValues is called.
|
2017-08-25 05:21:39 +08:00
|
|
|
bool EmitDone = false;
|
|
|
|
|
2013-02-14 04:23:48 +08:00
|
|
|
/// Whether the machine function is modified during the pass.
|
2017-08-25 05:21:39 +08:00
|
|
|
bool ModifiedMF = false;
|
2013-02-14 04:23:48 +08:00
|
|
|
|
2010-12-02 08:37:37 +08:00
|
|
|
/// userValues - All allocated UserValue instances.
|
2014-04-22 04:37:07 +08:00
|
|
|
SmallVector<std::unique_ptr<UserValue>, 8> userValues;
|
2010-12-02 08:37:37 +08:00
|
|
|
|
|
|
|
/// Map virtual register to eq class leader.
|
2017-08-25 05:21:39 +08:00
|
|
|
using VRMap = DenseMap<unsigned, UserValue *>;
|
2010-12-04 06:25:09 +08:00
|
|
|
VRMap virtRegToEqClass;
|
2010-12-02 08:37:37 +08:00
|
|
|
|
|
|
|
/// Map user variable to eq class leader.
|
2017-09-21 02:19:08 +08:00
|
|
|
using UVMap = DenseMap<const DILocalVariable *, UserValue *>;
|
2010-12-02 08:37:37 +08:00
|
|
|
UVMap userVarMap;
|
|
|
|
|
|
|
|
/// getUserValue - Find or create a UserValue.
|
2017-09-21 02:19:08 +08:00
|
|
|
UserValue *getUserValue(const DILocalVariable *Var, const DIExpression *Expr,
|
2017-10-04 01:59:02 +08:00
|
|
|
const DebugLoc &DL);
|
2010-12-02 08:37:37 +08:00
|
|
|
|
2010-12-03 02:15:44 +08:00
|
|
|
/// lookupVirtReg - Find the EC leader for VirtReg or null.
|
|
|
|
UserValue *lookupVirtReg(unsigned VirtReg);
|
|
|
|
|
2010-12-02 08:37:37 +08:00
|
|
|
/// handleDebugValue - Add DBG_VALUE instruction to our maps.
|
|
|
|
/// @param MI DBG_VALUE instruction
|
|
|
|
/// @param Idx Last valid SLotIndex before instruction.
|
|
|
|
/// @return True if the DBG_VALUE instruction should be deleted.
|
2016-07-01 07:13:38 +08:00
|
|
|
bool handleDebugValue(MachineInstr &MI, SlotIndex Idx);
|
2010-12-02 08:37:37 +08:00
|
|
|
|
|
|
|
/// collectDebugValues - Collect and erase all DBG_VALUE instructions, adding
|
|
|
|
/// a UserValue def for each instruction.
|
|
|
|
/// @param mf MachineFunction to be scanned.
|
|
|
|
/// @return True if any debug values were found.
|
|
|
|
bool collectDebugValues(MachineFunction &mf);
|
|
|
|
|
|
|
|
/// computeIntervals - Compute the live intervals of all user values after
|
|
|
|
/// collecting all their def points.
|
|
|
|
void computeIntervals();
|
|
|
|
|
|
|
|
public:
|
2017-08-25 05:21:39 +08:00
|
|
|
LDVImpl(LiveDebugVariables *ps) : pass(*ps) {}
|
|
|
|
|
2010-12-02 08:37:37 +08:00
|
|
|
bool runOnMachineFunction(MachineFunction &mf);
|
|
|
|
|
2013-02-14 04:23:48 +08:00
|
|
|
/// clear - Release all memory.
|
2010-12-02 08:37:37 +08:00
|
|
|
void clear() {
|
Recommit r212203: Don't try to construct debug LexicalScopes hierarchy for functions that do not have top level debug information.
Reverted by Eric Christopher (Thanks!) in r212203 after Bob Wilson
reported LTO issues. Duncan Exon Smith and Aditya Nandakumar helped
provide a reduced reproduction, though the failure wasn't too hard to
guess, and even easier with the example to confirm.
The assertion that the subprogram metadata associated with an
llvm::Function matches the scope data referenced by the DbgLocs on the
instructions in that function is not valid under LTO. In LTO, a C++
inline function might exist in multiple CUs and the subprogram metadata
nodes will refer to the same llvm::Function. In this case, depending on
the order of the CUs, the first intance of the subprogram metadata may
not be the one referenced by the instructions in that function and the
assertion will fail.
A test case (test/DebugInfo/cross-cu-linkonce-distinct.ll) is added, the
assertion removed and a comment added to explain this situation.
This was then reverted again in r213581 as it caused PR20367. The root
cause of this was the early exit in LiveDebugVariables meant that
spurious DBG_VALUE intrinsics that referenced dead variables were not
removed, causing an assertion/crash later on. The fix is to have
LiveDebugVariables strip all DBG_VALUE intrinsics in functions without
debug info as they're not needed anyway. Test case added to cover this
situation (that occurs when a debug-having function is inlined into a
nodebug function) in test/DebugInfo/X86/nodebug_with_debug_loc.ll
Original commit message:
If a function isn't actually in a CU's subprogram list in the debug info
metadata, ignore all the DebugLocs and don't try to build scopes, track
variables, etc.
While this is possibly a minor optimization, it's also a correctness fix
for an incoming patch that will add assertions to LexicalScopes and the
debug info verifier to ensure that all scope chains lead to debug info
for the current function.
Fix up a few test cases that had broken/incomplete debug info that could
violate this constraint.
Add a test case where this occurs by design (inlining a
debug-info-having function in an attribute nodebug function - we want
this to work because /if/ the nodebug function is then inlined into a
debug-info-having function, it should be fine (and will work fine - we
just stitch the scopes up as usual), but should the inlining not happen
we need to not assert fail either).
llvm-svn: 213952
2014-07-26 00:10:16 +08:00
|
|
|
MF = nullptr;
|
2010-12-02 08:37:37 +08:00
|
|
|
userValues.clear();
|
2010-12-04 06:25:09 +08:00
|
|
|
virtRegToEqClass.clear();
|
2010-12-02 08:37:37 +08:00
|
|
|
userVarMap.clear();
|
2013-02-14 04:23:48 +08:00
|
|
|
// Make sure we call emitDebugValues if the machine function was modified.
|
|
|
|
assert((!ModifiedMF || EmitDone) &&
|
|
|
|
"Dbg values are not emitted in LDV");
|
|
|
|
EmitDone = false;
|
|
|
|
ModifiedMF = false;
|
2010-12-02 08:37:37 +08:00
|
|
|
}
|
|
|
|
|
2011-03-19 05:42:19 +08:00
|
|
|
/// mapVirtReg - Map virtual register to an equivalence class.
|
|
|
|
void mapVirtReg(unsigned VirtReg, UserValue *EC);
|
|
|
|
|
2011-05-07 02:00:02 +08:00
|
|
|
/// splitRegister - Replace all references to OldReg with NewRegs.
|
2013-08-15 07:50:04 +08:00
|
|
|
void splitRegister(unsigned OldReg, ArrayRef<unsigned> NewRegs);
|
2011-05-07 02:00:02 +08:00
|
|
|
|
2013-02-13 10:29:18 +08:00
|
|
|
/// emitDebugValues - Recreate DBG_VALUE instruction from data structures.
|
2010-12-04 05:47:10 +08:00
|
|
|
void emitDebugValues(VirtRegMap *VRM);
|
|
|
|
|
2010-12-02 08:37:37 +08:00
|
|
|
void print(raw_ostream&);
|
|
|
|
};
|
2017-08-25 05:21:39 +08:00
|
|
|
|
|
|
|
} // end anonymous namespace
|
2010-12-02 08:37:37 +08:00
|
|
|
|
2017-10-15 22:32:27 +08:00
|
|
|
#if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
|
2016-06-12 23:39:02 +08:00
|
|
|
static void printDebugLoc(const DebugLoc &DL, raw_ostream &CommentOS,
|
2015-04-14 10:09:32 +08:00
|
|
|
const LLVMContext &Ctx) {
|
|
|
|
if (!DL)
|
|
|
|
return;
|
|
|
|
|
2015-04-30 00:38:44 +08:00
|
|
|
auto *Scope = cast<DIScope>(DL.getScope());
|
2015-04-14 10:09:32 +08:00
|
|
|
// Omit the directory, because it's likely to be long and uninteresting.
|
2015-04-16 09:37:00 +08:00
|
|
|
CommentOS << Scope->getFilename();
|
2015-04-14 10:09:32 +08:00
|
|
|
CommentOS << ':' << DL.getLine();
|
|
|
|
if (DL.getCol() != 0)
|
|
|
|
CommentOS << ':' << DL.getCol();
|
|
|
|
|
|
|
|
DebugLoc InlinedAtDL = DL.getInlinedAt();
|
|
|
|
if (!InlinedAtDL)
|
|
|
|
return;
|
|
|
|
|
|
|
|
CommentOS << " @[ ";
|
|
|
|
printDebugLoc(InlinedAtDL, CommentOS, Ctx);
|
|
|
|
CommentOS << " ]";
|
|
|
|
}
|
|
|
|
|
2015-04-30 00:38:44 +08:00
|
|
|
static void printExtendedName(raw_ostream &OS, const DILocalVariable *V,
|
|
|
|
const DILocation *DL) {
|
2015-04-14 10:09:32 +08:00
|
|
|
const LLVMContext &Ctx = V->getContext();
|
|
|
|
StringRef Res = V->getName();
|
|
|
|
if (!Res.empty())
|
|
|
|
OS << Res << "," << V->getLine();
|
2015-04-16 06:29:27 +08:00
|
|
|
if (auto *InlinedAt = DL->getInlinedAt()) {
|
2015-04-14 10:09:32 +08:00
|
|
|
if (DebugLoc InlinedAtDL = InlinedAt) {
|
|
|
|
OS << " @[";
|
|
|
|
printDebugLoc(InlinedAtDL, OS, Ctx);
|
|
|
|
OS << "]";
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2015-02-27 08:11:34 +08:00
|
|
|
void UserValue::print(raw_ostream &OS, const TargetRegisterInfo *TRI) {
|
2015-04-30 00:38:44 +08:00
|
|
|
auto *DV = cast<DILocalVariable>(Variable);
|
2014-08-08 04:04:00 +08:00
|
|
|
OS << "!\"";
|
2015-04-16 06:29:27 +08:00
|
|
|
printExtendedName(OS, DV, dl);
|
2015-04-14 10:09:32 +08:00
|
|
|
|
2011-08-09 09:03:35 +08:00
|
|
|
OS << "\"\t";
|
2010-12-02 08:37:37 +08:00
|
|
|
for (LocMap::const_iterator I = locInts.begin(); I.valid(); ++I) {
|
|
|
|
OS << " [" << I.start() << ';' << I.stop() << "):";
|
2017-10-04 01:59:02 +08:00
|
|
|
if (I.value().isUndef())
|
2010-12-02 08:37:37 +08:00
|
|
|
OS << "undef";
|
2017-10-04 01:59:02 +08:00
|
|
|
else {
|
|
|
|
OS << I.value().locNo();
|
|
|
|
if (I.value().wasIndirect())
|
|
|
|
OS << " ind";
|
|
|
|
}
|
2010-12-02 08:37:37 +08:00
|
|
|
}
|
2011-05-07 01:59:59 +08:00
|
|
|
for (unsigned i = 0, e = locations.size(); i != e; ++i) {
|
|
|
|
OS << " Loc" << i << '=';
|
2015-02-27 08:11:34 +08:00
|
|
|
locations[i].print(OS, TRI);
|
2011-05-07 01:59:59 +08:00
|
|
|
}
|
2010-12-02 08:37:37 +08:00
|
|
|
OS << '\n';
|
|
|
|
}
|
|
|
|
|
|
|
|
void LDVImpl::print(raw_ostream &OS) {
|
|
|
|
OS << "********** DEBUG VARIABLES **********\n";
|
|
|
|
for (unsigned i = 0, e = userValues.size(); i != e; ++i)
|
2015-02-27 08:11:34 +08:00
|
|
|
userValues[i]->print(OS, TRI);
|
2010-12-02 08:37:37 +08:00
|
|
|
}
|
2017-07-31 18:07:49 +08:00
|
|
|
#endif
|
2010-12-02 08:37:37 +08:00
|
|
|
|
2011-03-19 05:42:19 +08:00
|
|
|
void UserValue::mapVirtRegs(LDVImpl *LDV) {
|
|
|
|
for (unsigned i = 0, e = locations.size(); i != e; ++i)
|
|
|
|
if (locations[i].isReg() &&
|
|
|
|
TargetRegisterInfo::isVirtualRegister(locations[i].getReg()))
|
|
|
|
LDV->mapVirtReg(locations[i].getReg(), this);
|
|
|
|
}
|
|
|
|
|
2017-09-21 02:19:08 +08:00
|
|
|
UserValue *LDVImpl::getUserValue(const DILocalVariable *Var,
|
2017-10-04 01:59:02 +08:00
|
|
|
const DIExpression *Expr, const DebugLoc &DL) {
|
2010-12-02 08:37:37 +08:00
|
|
|
UserValue *&Leader = userVarMap[Var];
|
|
|
|
if (Leader) {
|
|
|
|
UserValue *UV = Leader->getLeader();
|
|
|
|
Leader = UV;
|
|
|
|
for (; UV; UV = UV->getNext())
|
2017-10-04 01:59:02 +08:00
|
|
|
if (UV->match(Var, Expr, DL->getInlinedAt()))
|
2010-12-02 08:37:37 +08:00
|
|
|
return UV;
|
|
|
|
}
|
|
|
|
|
2014-04-22 04:37:07 +08:00
|
|
|
userValues.push_back(
|
2017-10-04 01:59:02 +08:00
|
|
|
llvm::make_unique<UserValue>(Var, Expr, DL, allocator));
|
2014-04-22 04:37:07 +08:00
|
|
|
UserValue *UV = userValues.back().get();
|
2010-12-02 08:37:37 +08:00
|
|
|
Leader = UserValue::merge(Leader, UV);
|
|
|
|
return UV;
|
|
|
|
}
|
|
|
|
|
|
|
|
void LDVImpl::mapVirtReg(unsigned VirtReg, UserValue *EC) {
|
|
|
|
assert(TargetRegisterInfo::isVirtualRegister(VirtReg) && "Only map VirtRegs");
|
2010-12-04 06:25:09 +08:00
|
|
|
UserValue *&Leader = virtRegToEqClass[VirtReg];
|
2010-12-02 08:37:37 +08:00
|
|
|
Leader = UserValue::merge(Leader, EC);
|
|
|
|
}
|
|
|
|
|
2010-12-03 02:15:44 +08:00
|
|
|
UserValue *LDVImpl::lookupVirtReg(unsigned VirtReg) {
|
2010-12-04 06:25:09 +08:00
|
|
|
if (UserValue *UV = virtRegToEqClass.lookup(VirtReg))
|
2010-12-03 02:15:44 +08:00
|
|
|
return UV->getLeader();
|
2014-04-14 08:51:57 +08:00
|
|
|
return nullptr;
|
2010-12-03 02:15:44 +08:00
|
|
|
}
|
|
|
|
|
2016-07-01 07:13:38 +08:00
|
|
|
bool LDVImpl::handleDebugValue(MachineInstr &MI, SlotIndex Idx) {
|
2010-12-02 08:37:37 +08:00
|
|
|
// DBG_VALUE loc, offset, variable
|
2016-07-01 07:13:38 +08:00
|
|
|
if (MI.getNumOperands() != 4 ||
|
|
|
|
!(MI.getOperand(1).isReg() || MI.getOperand(1).isImm()) ||
|
|
|
|
!MI.getOperand(2).isMetadata()) {
|
|
|
|
DEBUG(dbgs() << "Can't handle " << MI);
|
2010-12-02 08:37:37 +08:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
[DebugInfo] Discard invalid DBG_VALUE instructions in LiveDebugVariables
Summary:
This is a workaround for pr36417
https://bugs.llvm.org/show_bug.cgi?id=36417
LiveDebugVariables will now verify that the DBG_VALUE instructions
are sane (prior to register allocation) by asking LIS if a virtual
register used in the DBG_VALUE is live (or dead def) in the slot
index before the DBG_VALUE. If it isn't sane the DBG_VALUE is
discarded.
One pass that was identified as introducing non-sane DBG_VALUE
instructtons, when analysing pr36417, was the DAG->DAG Instruction
Selection. It sometimes inserts DBG_VALUE instructions referring to
a virtual register that is defined later in the same basic block.
So it is a use before def kind of problem. The DBG_VALUE is
typically inserted in the beginning of a basic block when this
happens. The problem can be seen in the test case
test/DebugInfo/X86/dbg-value-inlined-parameter.ll
Reviewers: aprantl, rnk, probinson
Reviewed By: aprantl
Subscribers: vsk, davide, alexcrichton, Ka-Ka, eraman, llvm-commits, JDevlieghere
Differential Revision: https://reviews.llvm.org/D43956
llvm-svn: 326769
2018-03-06 16:47:07 +08:00
|
|
|
// Detect invalid DBG_VALUE instructions, with a debug-use of a virtual
|
|
|
|
// register that hasn't been defined yet. If we do not remove those here, then
|
|
|
|
// the re-insertion of the DBG_VALUE instruction after register allocation
|
|
|
|
// will be incorrect.
|
|
|
|
// TODO: If earlier passes are corrected to generate sane debug information
|
|
|
|
// (and if the machine verifier is improved to catch this), then these checks
|
|
|
|
// could be removed or replaced by asserts.
|
|
|
|
bool Discard = false;
|
|
|
|
if (MI.getOperand(0).isReg() &&
|
|
|
|
TargetRegisterInfo::isVirtualRegister(MI.getOperand(0).getReg())) {
|
|
|
|
const unsigned Reg = MI.getOperand(0).getReg();
|
|
|
|
if (!LIS->hasInterval(Reg)) {
|
|
|
|
// The DBG_VALUE is described by a virtual register that does not have a
|
|
|
|
// live interval. Discard the DBG_VALUE.
|
|
|
|
Discard = true;
|
|
|
|
DEBUG(dbgs() << "Discarding debug info (no LIS interval): "
|
|
|
|
<< Idx << " " << MI);
|
|
|
|
} else {
|
|
|
|
// The DBG_VALUE is only valid if either Reg is live out from Idx, or Reg
|
|
|
|
// is defined dead at Idx (where Idx is the slot index for the instruction
|
|
|
|
// preceeding the DBG_VALUE).
|
|
|
|
const LiveInterval &LI = LIS->getInterval(Reg);
|
|
|
|
LiveQueryResult LRQ = LI.Query(Idx);
|
|
|
|
if (!LRQ.valueOutOrDead()) {
|
|
|
|
// We have found a DBG_VALUE with the value in a virtual register that
|
|
|
|
// is not live. Discard the DBG_VALUE.
|
|
|
|
Discard = true;
|
|
|
|
DEBUG(dbgs() << "Discarding debug info (reg not live): "
|
|
|
|
<< Idx << " " << MI);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2017-10-04 01:59:02 +08:00
|
|
|
// Get or create the UserValue for (variable,offset) here.
|
2017-09-21 02:19:08 +08:00
|
|
|
bool IsIndirect = MI.getOperand(1).isImm();
|
2017-07-29 07:06:50 +08:00
|
|
|
if (IsIndirect)
|
|
|
|
assert(MI.getOperand(1).getImm() == 0 && "DBG_VALUE with nonzero offset");
|
2017-09-21 02:19:08 +08:00
|
|
|
const DILocalVariable *Var = MI.getDebugVariable();
|
|
|
|
const DIExpression *Expr = MI.getDebugExpression();
|
2017-10-04 01:59:02 +08:00
|
|
|
UserValue *UV =
|
|
|
|
getUserValue(Var, Expr, MI.getDebugLoc());
|
[DebugInfo] Discard invalid DBG_VALUE instructions in LiveDebugVariables
Summary:
This is a workaround for pr36417
https://bugs.llvm.org/show_bug.cgi?id=36417
LiveDebugVariables will now verify that the DBG_VALUE instructions
are sane (prior to register allocation) by asking LIS if a virtual
register used in the DBG_VALUE is live (or dead def) in the slot
index before the DBG_VALUE. If it isn't sane the DBG_VALUE is
discarded.
One pass that was identified as introducing non-sane DBG_VALUE
instructtons, when analysing pr36417, was the DAG->DAG Instruction
Selection. It sometimes inserts DBG_VALUE instructions referring to
a virtual register that is defined later in the same basic block.
So it is a use before def kind of problem. The DBG_VALUE is
typically inserted in the beginning of a basic block when this
happens. The problem can be seen in the test case
test/DebugInfo/X86/dbg-value-inlined-parameter.ll
Reviewers: aprantl, rnk, probinson
Reviewed By: aprantl
Subscribers: vsk, davide, alexcrichton, Ka-Ka, eraman, llvm-commits, JDevlieghere
Differential Revision: https://reviews.llvm.org/D43956
llvm-svn: 326769
2018-03-06 16:47:07 +08:00
|
|
|
if (!Discard)
|
|
|
|
UV->addDef(Idx, MI.getOperand(0), IsIndirect);
|
2018-03-06 21:23:28 +08:00
|
|
|
else {
|
|
|
|
MachineOperand MO = MachineOperand::CreateReg(0U, false);
|
|
|
|
MO.setIsDebug();
|
|
|
|
UV->addDef(Idx, MO, false);
|
|
|
|
}
|
2010-12-02 08:37:37 +08:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool LDVImpl::collectDebugValues(MachineFunction &mf) {
|
|
|
|
bool Changed = false;
|
|
|
|
for (MachineFunction::iterator MFI = mf.begin(), MFE = mf.end(); MFI != MFE;
|
|
|
|
++MFI) {
|
2015-10-10 03:13:58 +08:00
|
|
|
MachineBasicBlock *MBB = &*MFI;
|
2010-12-02 08:37:37 +08:00
|
|
|
for (MachineBasicBlock::iterator MBBI = MBB->begin(), MBBE = MBB->end();
|
|
|
|
MBBI != MBBE;) {
|
|
|
|
if (!MBBI->isDebugValue()) {
|
|
|
|
++MBBI;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
// DBG_VALUE has no slot index, use the previous instruction instead.
|
2016-02-27 14:40:41 +08:00
|
|
|
SlotIndex Idx =
|
|
|
|
MBBI == MBB->begin()
|
|
|
|
? LIS->getMBBStartIdx(MBB)
|
|
|
|
: LIS->getInstructionIndex(*std::prev(MBBI)).getRegSlot();
|
2010-12-02 08:37:37 +08:00
|
|
|
// Handle consecutive DBG_VALUE instructions with the same slot index.
|
|
|
|
do {
|
2016-07-01 07:13:38 +08:00
|
|
|
if (handleDebugValue(*MBBI, Idx)) {
|
2010-12-02 08:37:37 +08:00
|
|
|
MBBI = MBB->erase(MBBI);
|
|
|
|
Changed = true;
|
|
|
|
} else
|
|
|
|
++MBBI;
|
|
|
|
} while (MBBI != MBBE && MBBI->isDebugValue());
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return Changed;
|
|
|
|
}
|
|
|
|
|
2015-12-22 04:03:00 +08:00
|
|
|
/// We only propagate DBG_VALUES locally here. LiveDebugValues performs a
|
|
|
|
/// data-flow analysis to propagate them beyond basic block boundaries.
|
2017-10-04 01:59:02 +08:00
|
|
|
void UserValue::extendDef(SlotIndex Idx, DbgValueLocation Loc, LiveRange *LR,
|
2015-12-22 04:03:00 +08:00
|
|
|
const VNInfo *VNI, SmallVectorImpl<SlotIndex> *Kills,
|
2016-09-29 05:34:23 +08:00
|
|
|
LiveIntervals &LIS) {
|
2015-12-22 04:03:00 +08:00
|
|
|
SlotIndex Start = Idx;
|
|
|
|
MachineBasicBlock *MBB = LIS.getMBBFromIndex(Start);
|
|
|
|
SlotIndex Stop = LIS.getMBBEndIdx(MBB);
|
|
|
|
LocMap::iterator I = locInts.find(Start);
|
|
|
|
|
|
|
|
// Limit to VNI's live range.
|
|
|
|
bool ToEnd = true;
|
|
|
|
if (LR && VNI) {
|
|
|
|
LiveInterval::Segment *Segment = LR->getSegmentContaining(Start);
|
|
|
|
if (!Segment || Segment->valno != VNI) {
|
|
|
|
if (Kills)
|
|
|
|
Kills->push_back(Start);
|
|
|
|
return;
|
2010-12-02 08:37:37 +08:00
|
|
|
}
|
2016-02-19 06:09:30 +08:00
|
|
|
if (Segment->end < Stop) {
|
|
|
|
Stop = Segment->end;
|
|
|
|
ToEnd = false;
|
|
|
|
}
|
2015-12-22 04:03:00 +08:00
|
|
|
}
|
2010-12-02 08:37:37 +08:00
|
|
|
|
2015-12-22 04:03:00 +08:00
|
|
|
// There could already be a short def at Start.
|
|
|
|
if (I.valid() && I.start() <= Start) {
|
|
|
|
// Stop when meeting a different location or an already extended interval.
|
|
|
|
Start = Start.getNextSlot();
|
2017-10-04 01:59:02 +08:00
|
|
|
if (I.value() != Loc || I.stop() != Start)
|
2015-12-22 04:03:00 +08:00
|
|
|
return;
|
|
|
|
// This is a one-slot placeholder. Just skip it.
|
|
|
|
++I;
|
|
|
|
}
|
2010-12-02 08:37:37 +08:00
|
|
|
|
2015-12-22 04:03:00 +08:00
|
|
|
// Limited by the next def.
|
2016-02-19 06:09:30 +08:00
|
|
|
if (I.valid() && I.start() < Stop) {
|
|
|
|
Stop = I.start();
|
|
|
|
ToEnd = false;
|
|
|
|
}
|
2015-12-22 04:03:00 +08:00
|
|
|
// Limited by VNI's live range.
|
|
|
|
else if (!ToEnd && Kills)
|
|
|
|
Kills->push_back(Stop);
|
2010-12-02 08:37:37 +08:00
|
|
|
|
2015-12-22 04:03:00 +08:00
|
|
|
if (Start < Stop)
|
2017-10-04 01:59:02 +08:00
|
|
|
I.insert(Start, Stop, Loc);
|
2010-12-02 08:37:37 +08:00
|
|
|
}
|
|
|
|
|
2017-10-04 01:59:02 +08:00
|
|
|
void UserValue::addDefsFromCopies(
|
|
|
|
LiveInterval *LI, unsigned LocNo, bool WasIndirect,
|
|
|
|
const SmallVectorImpl<SlotIndex> &Kills,
|
|
|
|
SmallVectorImpl<std::pair<SlotIndex, DbgValueLocation>> &NewDefs,
|
|
|
|
MachineRegisterInfo &MRI, LiveIntervals &LIS) {
|
2011-03-19 05:42:19 +08:00
|
|
|
if (Kills.empty())
|
|
|
|
return;
|
|
|
|
// Don't track copies from physregs, there are too many uses.
|
|
|
|
if (!TargetRegisterInfo::isVirtualRegister(LI->reg))
|
|
|
|
return;
|
|
|
|
|
|
|
|
// Collect all the (vreg, valno) pairs that are copies of LI.
|
|
|
|
SmallVector<std::pair<LiveInterval*, const VNInfo*>, 8> CopyValues;
|
2014-03-18 03:36:09 +08:00
|
|
|
for (MachineOperand &MO : MRI.use_nodbg_operands(LI->reg)) {
|
|
|
|
MachineInstr *MI = MO.getParent();
|
2011-03-19 05:42:19 +08:00
|
|
|
// Copies of the full value.
|
2014-03-18 03:36:09 +08:00
|
|
|
if (MO.getSubReg() || !MI->isCopy())
|
2011-03-19 05:42:19 +08:00
|
|
|
continue;
|
|
|
|
unsigned DstReg = MI->getOperand(0).getReg();
|
|
|
|
|
2011-03-23 06:33:08 +08:00
|
|
|
// Don't follow copies to physregs. These are usually setting up call
|
|
|
|
// arguments, and the argument registers are always call clobbered. We are
|
|
|
|
// better off in the source register which could be a callee-saved register,
|
|
|
|
// or it could be spilled.
|
|
|
|
if (!TargetRegisterInfo::isVirtualRegister(DstReg))
|
|
|
|
continue;
|
|
|
|
|
2011-03-19 05:42:19 +08:00
|
|
|
// Is LocNo extended to reach this copy? If not, another def may be blocking
|
|
|
|
// it, or we are looking at a wrong value of LI.
|
2016-02-27 14:40:41 +08:00
|
|
|
SlotIndex Idx = LIS.getInstructionIndex(*MI);
|
2011-11-14 04:45:27 +08:00
|
|
|
LocMap::iterator I = locInts.find(Idx.getRegSlot(true));
|
2017-10-04 01:59:02 +08:00
|
|
|
if (!I.valid() || I.value().locNo() != LocNo)
|
2011-03-19 05:42:19 +08:00
|
|
|
continue;
|
|
|
|
|
|
|
|
if (!LIS.hasInterval(DstReg))
|
|
|
|
continue;
|
|
|
|
LiveInterval *DstLI = &LIS.getInterval(DstReg);
|
2011-11-14 04:45:27 +08:00
|
|
|
const VNInfo *DstVNI = DstLI->getVNInfoAt(Idx.getRegSlot());
|
|
|
|
assert(DstVNI && DstVNI->def == Idx.getRegSlot() && "Bad copy value");
|
2011-03-19 05:42:19 +08:00
|
|
|
CopyValues.push_back(std::make_pair(DstLI, DstVNI));
|
|
|
|
}
|
|
|
|
|
|
|
|
if (CopyValues.empty())
|
|
|
|
return;
|
|
|
|
|
|
|
|
DEBUG(dbgs() << "Got " << CopyValues.size() << " copies of " << *LI << '\n');
|
|
|
|
|
|
|
|
// Try to add defs of the copied values for each kill point.
|
|
|
|
for (unsigned i = 0, e = Kills.size(); i != e; ++i) {
|
|
|
|
SlotIndex Idx = Kills[i];
|
|
|
|
for (unsigned j = 0, e = CopyValues.size(); j != e; ++j) {
|
|
|
|
LiveInterval *DstLI = CopyValues[j].first;
|
|
|
|
const VNInfo *DstVNI = CopyValues[j].second;
|
|
|
|
if (DstLI->getVNInfoAt(Idx) != DstVNI)
|
|
|
|
continue;
|
|
|
|
// Check that there isn't already a def at Idx
|
|
|
|
LocMap::iterator I = locInts.find(Idx);
|
|
|
|
if (I.valid() && I.start() <= Idx)
|
|
|
|
continue;
|
|
|
|
DEBUG(dbgs() << "Kill at " << Idx << " covered by valno #"
|
|
|
|
<< DstVNI->id << " in " << *DstLI << '\n');
|
|
|
|
MachineInstr *CopyMI = LIS.getInstructionFromIndex(DstVNI->def);
|
|
|
|
assert(CopyMI && CopyMI->isCopy() && "Bad copy value");
|
|
|
|
unsigned LocNo = getLocationNo(CopyMI->getOperand(0));
|
2017-10-04 01:59:02 +08:00
|
|
|
DbgValueLocation NewLoc(LocNo, WasIndirect);
|
|
|
|
I.insert(Idx, Idx.getNextSlot(), NewLoc);
|
|
|
|
NewDefs.push_back(std::make_pair(Idx, NewLoc));
|
2011-03-19 05:42:19 +08:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2017-08-03 19:54:02 +08:00
|
|
|
void UserValue::computeIntervals(MachineRegisterInfo &MRI,
|
|
|
|
const TargetRegisterInfo &TRI,
|
|
|
|
LiveIntervals &LIS, LexicalScopes &LS) {
|
2017-10-04 01:59:02 +08:00
|
|
|
SmallVector<std::pair<SlotIndex, DbgValueLocation>, 16> Defs;
|
2010-12-02 08:37:37 +08:00
|
|
|
|
|
|
|
// Collect all defs to be extended (Skipping undefs).
|
|
|
|
for (LocMap::const_iterator I = locInts.begin(); I.valid(); ++I)
|
2017-10-04 01:59:02 +08:00
|
|
|
if (!I.value().isUndef())
|
2010-12-02 08:37:37 +08:00
|
|
|
Defs.push_back(std::make_pair(I.start(), I.value()));
|
|
|
|
|
2011-03-19 05:42:19 +08:00
|
|
|
// Extend all defs, and possibly add new ones along the way.
|
|
|
|
for (unsigned i = 0; i != Defs.size(); ++i) {
|
2010-12-02 08:37:37 +08:00
|
|
|
SlotIndex Idx = Defs[i].first;
|
2017-10-04 01:59:02 +08:00
|
|
|
DbgValueLocation Loc = Defs[i].second;
|
|
|
|
const MachineOperand &LocMO = locations[Loc.locNo()];
|
2010-12-02 08:37:37 +08:00
|
|
|
|
2017-10-04 01:59:02 +08:00
|
|
|
if (!LocMO.isReg()) {
|
|
|
|
extendDef(Idx, Loc, nullptr, nullptr, nullptr, LIS);
|
2012-06-23 01:15:32 +08:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
2010-12-02 08:37:37 +08:00
|
|
|
// Register locations are constrained to where the register value is live.
|
2017-10-04 01:59:02 +08:00
|
|
|
if (TargetRegisterInfo::isVirtualRegister(LocMO.getReg())) {
|
2014-04-14 08:51:57 +08:00
|
|
|
LiveInterval *LI = nullptr;
|
|
|
|
const VNInfo *VNI = nullptr;
|
2017-10-04 01:59:02 +08:00
|
|
|
if (LIS.hasInterval(LocMO.getReg())) {
|
|
|
|
LI = &LIS.getInterval(LocMO.getReg());
|
2012-06-23 02:51:35 +08:00
|
|
|
VNI = LI->getVNInfoAt(Idx);
|
|
|
|
}
|
2011-03-19 05:42:19 +08:00
|
|
|
SmallVector<SlotIndex, 16> Kills;
|
2017-10-04 01:59:02 +08:00
|
|
|
extendDef(Idx, Loc, LI, VNI, &Kills, LIS);
|
2012-06-23 02:51:35 +08:00
|
|
|
if (LI)
|
2017-10-04 01:59:02 +08:00
|
|
|
addDefsFromCopies(LI, Loc.locNo(), Loc.wasIndirect(), Kills, Defs, MRI,
|
|
|
|
LIS);
|
2012-06-23 01:15:32 +08:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
[DebugInfo] Do not extend range for physreg in LiveDebugVariables
Summary:
A DBG_VALUE that is referring to a physical register is
valid up until the next def of the register, or the end
of the basic block that it belongs to.
LiveDebugVariables is computing live intervals (slot index
ranges) for DBG_VALUE instructions, before regalloc, in order
to be able to re-insert DBG_VALUE instructions again after
regalloc. When the DBG_VALUE is mapping a variable to a
physical register we do not need to compute the range. We
should simply re-insert the DBG_VALUE at the start position.
The problem that was found, resulting in this patch, was a
situation when the DBG_VALUE was the last real use of the
physical register. The computeIntervals/extendDef methods
extended the range to cover the whole basic block, even though
the physical register very well could be allocated to some
virtual register inside the basic block. So the extended
range could not be trusted.
This patch is a preparation for https://reviews.llvm.org/D38229,
where the goal is to insert DBG_VALUE after each new definition
of a variable, even if the virtual registers that the variable
was connected to has been coalesced into using the same physical
register (e.g. due to two address instructions). For more info
see https://bugs.llvm.org/show_bug.cgi?id=34545
Reviewers: aprantl, rnk, echristo
Reviewed By: aprantl
Subscribers: Ka-Ka, llvm-commits
Differential Revision: https://reviews.llvm.org/D38140
llvm-svn: 314414
2017-09-28 21:10:06 +08:00
|
|
|
// For physregs, we only mark the start slot idx. DwarfDebug will see it
|
|
|
|
// as if the DBG_VALUE is valid up until the end of the basic block, or
|
|
|
|
// the next def of the physical register. So we do not need to extend the
|
|
|
|
// range. It might actually happen that the DBG_VALUE is the last use of
|
|
|
|
// the physical register (e.g. if this is an unused input argument to a
|
|
|
|
// function).
|
2010-12-02 08:37:37 +08:00
|
|
|
}
|
|
|
|
|
2017-08-03 19:54:02 +08:00
|
|
|
// Erase all the undefs.
|
2010-12-02 08:37:37 +08:00
|
|
|
for (LocMap::iterator I = locInts.begin(); I.valid();)
|
2017-10-04 01:59:02 +08:00
|
|
|
if (I.value().isUndef())
|
2010-12-02 08:37:37 +08:00
|
|
|
I.erase();
|
|
|
|
else
|
|
|
|
++I;
|
2017-08-03 19:54:02 +08:00
|
|
|
|
|
|
|
// The computed intervals may extend beyond the range of the debug
|
|
|
|
// location's lexical scope. In this case, splitting of an interval
|
|
|
|
// can result in an interval outside of the scope being created,
|
|
|
|
// causing extra unnecessary DBG_VALUEs to be emitted. To prevent
|
|
|
|
// this, trim the intervals to the lexical scope.
|
|
|
|
|
|
|
|
LexicalScope *Scope = LS.findLexicalScope(dl);
|
|
|
|
if (!Scope)
|
|
|
|
return;
|
|
|
|
|
|
|
|
SlotIndex PrevEnd;
|
|
|
|
LocMap::iterator I = locInts.begin();
|
|
|
|
|
|
|
|
// Iterate over the lexical scope ranges. Each time round the loop
|
|
|
|
// we check the intervals for overlap with the end of the previous
|
|
|
|
// range and the start of the next. The first range is handled as
|
|
|
|
// a special case where there is no PrevEnd.
|
|
|
|
for (const InsnRange &Range : Scope->getRanges()) {
|
|
|
|
SlotIndex RStart = LIS.getInstructionIndex(*Range.first);
|
|
|
|
SlotIndex REnd = LIS.getInstructionIndex(*Range.second);
|
|
|
|
|
|
|
|
// At the start of each iteration I has been advanced so that
|
|
|
|
// I.stop() >= PrevEnd. Check for overlap.
|
|
|
|
if (PrevEnd && I.start() < PrevEnd) {
|
|
|
|
SlotIndex IStop = I.stop();
|
2017-10-04 01:59:02 +08:00
|
|
|
DbgValueLocation Loc = I.value();
|
2017-08-03 19:54:02 +08:00
|
|
|
|
|
|
|
// Stop overlaps previous end - trim the end of the interval to
|
|
|
|
// the scope range.
|
|
|
|
I.setStopUnchecked(PrevEnd);
|
|
|
|
++I;
|
|
|
|
|
|
|
|
// If the interval also overlaps the start of the "next" (i.e.
|
|
|
|
// current) range create a new interval for the remainder (which
|
|
|
|
// may be further trimmed).
|
|
|
|
if (RStart < IStop)
|
2017-10-04 01:59:02 +08:00
|
|
|
I.insert(RStart, IStop, Loc);
|
2017-08-03 19:54:02 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
// Advance I so that I.stop() >= RStart, and check for overlap.
|
|
|
|
I.advanceTo(RStart);
|
|
|
|
if (!I.valid())
|
|
|
|
return;
|
|
|
|
|
|
|
|
if (I.start() < RStart) {
|
|
|
|
// Interval start overlaps range - trim to the scope range.
|
|
|
|
I.setStartUnchecked(RStart);
|
|
|
|
// Remember that this interval was trimmed.
|
|
|
|
trimmedDefs.insert(RStart);
|
|
|
|
}
|
|
|
|
|
|
|
|
// The end of a lexical scope range is the last instruction in the
|
|
|
|
// range. To convert to an interval we need the index of the
|
|
|
|
// instruction after it.
|
|
|
|
REnd = REnd.getNextIndex();
|
|
|
|
|
|
|
|
// Advance I to first interval outside current range.
|
|
|
|
I.advanceTo(REnd);
|
|
|
|
if (!I.valid())
|
|
|
|
return;
|
|
|
|
|
|
|
|
PrevEnd = REnd;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Check for overlap with end of final range.
|
|
|
|
if (PrevEnd && I.start() < PrevEnd)
|
|
|
|
I.setStopUnchecked(PrevEnd);
|
2010-12-02 08:37:37 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
void LDVImpl::computeIntervals() {
|
2017-08-03 19:54:02 +08:00
|
|
|
LexicalScopes LS;
|
|
|
|
LS.initialize(*MF);
|
|
|
|
|
2011-03-19 05:42:19 +08:00
|
|
|
for (unsigned i = 0, e = userValues.size(); i != e; ++i) {
|
2017-08-03 19:54:02 +08:00
|
|
|
userValues[i]->computeIntervals(MF->getRegInfo(), *TRI, *LIS, LS);
|
2011-03-19 05:42:19 +08:00
|
|
|
userValues[i]->mapVirtRegs(this);
|
|
|
|
}
|
2010-12-02 08:37:37 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
bool LDVImpl::runOnMachineFunction(MachineFunction &mf) {
|
Recommit r212203: Don't try to construct debug LexicalScopes hierarchy for functions that do not have top level debug information.
Reverted by Eric Christopher (Thanks!) in r212203 after Bob Wilson
reported LTO issues. Duncan Exon Smith and Aditya Nandakumar helped
provide a reduced reproduction, though the failure wasn't too hard to
guess, and even easier with the example to confirm.
The assertion that the subprogram metadata associated with an
llvm::Function matches the scope data referenced by the DbgLocs on the
instructions in that function is not valid under LTO. In LTO, a C++
inline function might exist in multiple CUs and the subprogram metadata
nodes will refer to the same llvm::Function. In this case, depending on
the order of the CUs, the first intance of the subprogram metadata may
not be the one referenced by the instructions in that function and the
assertion will fail.
A test case (test/DebugInfo/cross-cu-linkonce-distinct.ll) is added, the
assertion removed and a comment added to explain this situation.
This was then reverted again in r213581 as it caused PR20367. The root
cause of this was the early exit in LiveDebugVariables meant that
spurious DBG_VALUE intrinsics that referenced dead variables were not
removed, causing an assertion/crash later on. The fix is to have
LiveDebugVariables strip all DBG_VALUE intrinsics in functions without
debug info as they're not needed anyway. Test case added to cover this
situation (that occurs when a debug-having function is inlined into a
nodebug function) in test/DebugInfo/X86/nodebug_with_debug_loc.ll
Original commit message:
If a function isn't actually in a CU's subprogram list in the debug info
metadata, ignore all the DebugLocs and don't try to build scopes, track
variables, etc.
While this is possibly a minor optimization, it's also a correctness fix
for an incoming patch that will add assertions to LexicalScopes and the
debug info verifier to ensure that all scope chains lead to debug info
for the current function.
Fix up a few test cases that had broken/incomplete debug info that could
violate this constraint.
Add a test case where this occurs by design (inlining a
debug-info-having function in an attribute nodebug function - we want
this to work because /if/ the nodebug function is then inlined into a
debug-info-having function, it should be fine (and will work fine - we
just stitch the scopes up as usual), but should the inlining not happen
we need to not assert fail either).
llvm-svn: 213952
2014-07-26 00:10:16 +08:00
|
|
|
clear();
|
2010-12-02 08:37:37 +08:00
|
|
|
MF = &mf;
|
|
|
|
LIS = &pass.getAnalysis<LiveIntervals>();
|
2014-08-05 10:39:49 +08:00
|
|
|
TRI = mf.getSubtarget().getRegisterInfo();
|
2010-12-02 08:37:37 +08:00
|
|
|
DEBUG(dbgs() << "********** COMPUTING LIVE DEBUG VARIABLES: "
|
2012-08-23 01:18:53 +08:00
|
|
|
<< mf.getName() << " **********\n");
|
2010-12-02 08:37:37 +08:00
|
|
|
|
|
|
|
bool Changed = collectDebugValues(mf);
|
|
|
|
computeIntervals();
|
|
|
|
DEBUG(print(dbgs()));
|
2013-02-14 04:23:48 +08:00
|
|
|
ModifiedMF = Changed;
|
2010-12-02 08:37:37 +08:00
|
|
|
return Changed;
|
|
|
|
}
|
|
|
|
|
Recommit r212203: Don't try to construct debug LexicalScopes hierarchy for functions that do not have top level debug information.
Reverted by Eric Christopher (Thanks!) in r212203 after Bob Wilson
reported LTO issues. Duncan Exon Smith and Aditya Nandakumar helped
provide a reduced reproduction, though the failure wasn't too hard to
guess, and even easier with the example to confirm.
The assertion that the subprogram metadata associated with an
llvm::Function matches the scope data referenced by the DbgLocs on the
instructions in that function is not valid under LTO. In LTO, a C++
inline function might exist in multiple CUs and the subprogram metadata
nodes will refer to the same llvm::Function. In this case, depending on
the order of the CUs, the first intance of the subprogram metadata may
not be the one referenced by the instructions in that function and the
assertion will fail.
A test case (test/DebugInfo/cross-cu-linkonce-distinct.ll) is added, the
assertion removed and a comment added to explain this situation.
This was then reverted again in r213581 as it caused PR20367. The root
cause of this was the early exit in LiveDebugVariables meant that
spurious DBG_VALUE intrinsics that referenced dead variables were not
removed, causing an assertion/crash later on. The fix is to have
LiveDebugVariables strip all DBG_VALUE intrinsics in functions without
debug info as they're not needed anyway. Test case added to cover this
situation (that occurs when a debug-having function is inlined into a
nodebug function) in test/DebugInfo/X86/nodebug_with_debug_loc.ll
Original commit message:
If a function isn't actually in a CU's subprogram list in the debug info
metadata, ignore all the DebugLocs and don't try to build scopes, track
variables, etc.
While this is possibly a minor optimization, it's also a correctness fix
for an incoming patch that will add assertions to LexicalScopes and the
debug info verifier to ensure that all scope chains lead to debug info
for the current function.
Fix up a few test cases that had broken/incomplete debug info that could
violate this constraint.
Add a test case where this occurs by design (inlining a
debug-info-having function in an attribute nodebug function - we want
this to work because /if/ the nodebug function is then inlined into a
debug-info-having function, it should be fine (and will work fine - we
just stitch the scopes up as usual), but should the inlining not happen
we need to not assert fail either).
llvm-svn: 213952
2014-07-26 00:10:16 +08:00
|
|
|
static void removeDebugValues(MachineFunction &mf) {
|
|
|
|
for (MachineBasicBlock &MBB : mf) {
|
|
|
|
for (auto MBBI = MBB.begin(), MBBE = MBB.end(); MBBI != MBBE; ) {
|
|
|
|
if (!MBBI->isDebugValue()) {
|
|
|
|
++MBBI;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
MBBI = MBB.erase(MBBI);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2010-11-30 10:17:10 +08:00
|
|
|
bool LiveDebugVariables::runOnMachineFunction(MachineFunction &mf) {
|
2011-01-08 06:33:41 +08:00
|
|
|
if (!EnableLDV)
|
|
|
|
return false;
|
2017-12-16 06:22:58 +08:00
|
|
|
if (!mf.getFunction().getSubprogram()) {
|
Recommit r212203: Don't try to construct debug LexicalScopes hierarchy for functions that do not have top level debug information.
Reverted by Eric Christopher (Thanks!) in r212203 after Bob Wilson
reported LTO issues. Duncan Exon Smith and Aditya Nandakumar helped
provide a reduced reproduction, though the failure wasn't too hard to
guess, and even easier with the example to confirm.
The assertion that the subprogram metadata associated with an
llvm::Function matches the scope data referenced by the DbgLocs on the
instructions in that function is not valid under LTO. In LTO, a C++
inline function might exist in multiple CUs and the subprogram metadata
nodes will refer to the same llvm::Function. In this case, depending on
the order of the CUs, the first intance of the subprogram metadata may
not be the one referenced by the instructions in that function and the
assertion will fail.
A test case (test/DebugInfo/cross-cu-linkonce-distinct.ll) is added, the
assertion removed and a comment added to explain this situation.
This was then reverted again in r213581 as it caused PR20367. The root
cause of this was the early exit in LiveDebugVariables meant that
spurious DBG_VALUE intrinsics that referenced dead variables were not
removed, causing an assertion/crash later on. The fix is to have
LiveDebugVariables strip all DBG_VALUE intrinsics in functions without
debug info as they're not needed anyway. Test case added to cover this
situation (that occurs when a debug-having function is inlined into a
nodebug function) in test/DebugInfo/X86/nodebug_with_debug_loc.ll
Original commit message:
If a function isn't actually in a CU's subprogram list in the debug info
metadata, ignore all the DebugLocs and don't try to build scopes, track
variables, etc.
While this is possibly a minor optimization, it's also a correctness fix
for an incoming patch that will add assertions to LexicalScopes and the
debug info verifier to ensure that all scope chains lead to debug info
for the current function.
Fix up a few test cases that had broken/incomplete debug info that could
violate this constraint.
Add a test case where this occurs by design (inlining a
debug-info-having function in an attribute nodebug function - we want
this to work because /if/ the nodebug function is then inlined into a
debug-info-having function, it should be fine (and will work fine - we
just stitch the scopes up as usual), but should the inlining not happen
we need to not assert fail either).
llvm-svn: 213952
2014-07-26 00:10:16 +08:00
|
|
|
removeDebugValues(mf);
|
|
|
|
return false;
|
|
|
|
}
|
2010-12-02 08:37:37 +08:00
|
|
|
if (!pImpl)
|
|
|
|
pImpl = new LDVImpl(this);
|
2013-02-14 04:23:48 +08:00
|
|
|
return static_cast<LDVImpl*>(pImpl)->runOnMachineFunction(mf);
|
2010-12-02 08:37:37 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
void LiveDebugVariables::releaseMemory() {
|
2013-02-14 04:23:48 +08:00
|
|
|
if (pImpl)
|
2010-12-02 08:37:37 +08:00
|
|
|
static_cast<LDVImpl*>(pImpl)->clear();
|
|
|
|
}
|
|
|
|
|
|
|
|
LiveDebugVariables::~LiveDebugVariables() {
|
|
|
|
if (pImpl)
|
|
|
|
delete static_cast<LDVImpl*>(pImpl);
|
2010-11-30 10:17:10 +08:00
|
|
|
}
|
2010-12-03 02:15:44 +08:00
|
|
|
|
2011-05-07 02:00:02 +08:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Live Range Splitting
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
bool
|
2013-08-15 07:50:04 +08:00
|
|
|
UserValue::splitLocation(unsigned OldLocNo, ArrayRef<unsigned> NewRegs,
|
|
|
|
LiveIntervals& LIS) {
|
2011-05-07 02:00:02 +08:00
|
|
|
DEBUG({
|
|
|
|
dbgs() << "Splitting Loc" << OldLocNo << '\t';
|
2014-04-14 08:51:57 +08:00
|
|
|
print(dbgs(), nullptr);
|
2011-05-07 02:00:02 +08:00
|
|
|
});
|
|
|
|
bool DidChange = false;
|
|
|
|
LocMap::iterator LocMapI;
|
|
|
|
LocMapI.setMap(locInts);
|
|
|
|
for (unsigned i = 0; i != NewRegs.size(); ++i) {
|
2013-08-15 07:50:04 +08:00
|
|
|
LiveInterval *LI = &LIS.getInterval(NewRegs[i]);
|
2011-05-07 02:00:02 +08:00
|
|
|
if (LI->empty())
|
|
|
|
continue;
|
|
|
|
|
|
|
|
// Don't allocate the new LocNo until it is needed.
|
2017-09-16 06:08:50 +08:00
|
|
|
unsigned NewLocNo = UndefLocNo;
|
2011-05-07 02:00:02 +08:00
|
|
|
|
|
|
|
// Iterate over the overlaps between locInts and LI.
|
|
|
|
LocMapI.find(LI->beginIndex());
|
|
|
|
if (!LocMapI.valid())
|
|
|
|
continue;
|
|
|
|
LiveInterval::iterator LII = LI->advanceTo(LI->begin(), LocMapI.start());
|
|
|
|
LiveInterval::iterator LIE = LI->end();
|
|
|
|
while (LocMapI.valid() && LII != LIE) {
|
|
|
|
// At this point, we know that LocMapI.stop() > LII->start.
|
|
|
|
LII = LI->advanceTo(LII, LocMapI.start());
|
|
|
|
if (LII == LIE)
|
|
|
|
break;
|
|
|
|
|
|
|
|
// Now LII->end > LocMapI.start(). Do we have an overlap?
|
2017-10-04 01:59:02 +08:00
|
|
|
if (LocMapI.value().locNo() == OldLocNo && LII->start < LocMapI.stop()) {
|
2011-05-07 02:00:02 +08:00
|
|
|
// Overlapping correct location. Allocate NewLocNo now.
|
2017-09-16 06:08:50 +08:00
|
|
|
if (NewLocNo == UndefLocNo) {
|
2011-05-07 02:00:02 +08:00
|
|
|
MachineOperand MO = MachineOperand::CreateReg(LI->reg, false);
|
|
|
|
MO.setSubReg(locations[OldLocNo].getSubReg());
|
|
|
|
NewLocNo = getLocationNo(MO);
|
|
|
|
DidChange = true;
|
|
|
|
}
|
|
|
|
|
|
|
|
SlotIndex LStart = LocMapI.start();
|
|
|
|
SlotIndex LStop = LocMapI.stop();
|
2017-10-04 01:59:02 +08:00
|
|
|
DbgValueLocation OldLoc = LocMapI.value();
|
2011-05-07 02:00:02 +08:00
|
|
|
|
|
|
|
// Trim LocMapI down to the LII overlap.
|
|
|
|
if (LStart < LII->start)
|
|
|
|
LocMapI.setStartUnchecked(LII->start);
|
|
|
|
if (LStop > LII->end)
|
|
|
|
LocMapI.setStopUnchecked(LII->end);
|
|
|
|
|
|
|
|
// Change the value in the overlap. This may trigger coalescing.
|
2017-10-04 01:59:02 +08:00
|
|
|
LocMapI.setValue(OldLoc.changeLocNo(NewLocNo));
|
2011-05-07 02:00:02 +08:00
|
|
|
|
|
|
|
// Re-insert any removed OldLocNo ranges.
|
|
|
|
if (LStart < LocMapI.start()) {
|
2017-10-04 01:59:02 +08:00
|
|
|
LocMapI.insert(LStart, LocMapI.start(), OldLoc);
|
2011-05-07 02:00:02 +08:00
|
|
|
++LocMapI;
|
|
|
|
assert(LocMapI.valid() && "Unexpected coalescing");
|
|
|
|
}
|
|
|
|
if (LStop > LocMapI.stop()) {
|
|
|
|
++LocMapI;
|
2017-10-04 01:59:02 +08:00
|
|
|
LocMapI.insert(LII->end, LStop, OldLoc);
|
2011-05-07 02:00:02 +08:00
|
|
|
--LocMapI;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Advance to the next overlap.
|
|
|
|
if (LII->end < LocMapI.stop()) {
|
|
|
|
if (++LII == LIE)
|
|
|
|
break;
|
|
|
|
LocMapI.advanceTo(LII->start);
|
|
|
|
} else {
|
|
|
|
++LocMapI;
|
|
|
|
if (!LocMapI.valid())
|
|
|
|
break;
|
|
|
|
LII = LI->advanceTo(LII, LocMapI.start());
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Finally, remove any remaining OldLocNo intervals and OldLocNo itself.
|
|
|
|
locations.erase(locations.begin() + OldLocNo);
|
|
|
|
LocMapI.goToBegin();
|
|
|
|
while (LocMapI.valid()) {
|
2017-10-04 01:59:02 +08:00
|
|
|
DbgValueLocation v = LocMapI.value();
|
|
|
|
if (v.locNo() == OldLocNo) {
|
2011-05-07 02:00:02 +08:00
|
|
|
DEBUG(dbgs() << "Erasing [" << LocMapI.start() << ';'
|
|
|
|
<< LocMapI.stop() << ")\n");
|
|
|
|
LocMapI.erase();
|
|
|
|
} else {
|
2017-10-04 01:59:02 +08:00
|
|
|
if (v.locNo() > OldLocNo)
|
|
|
|
LocMapI.setValueUnchecked(v.changeLocNo(v.locNo() - 1));
|
2011-05-07 02:00:02 +08:00
|
|
|
++LocMapI;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2014-04-14 08:51:57 +08:00
|
|
|
DEBUG({dbgs() << "Split result: \t"; print(dbgs(), nullptr);});
|
2011-05-07 02:00:02 +08:00
|
|
|
return DidChange;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool
|
2013-08-15 07:50:04 +08:00
|
|
|
UserValue::splitRegister(unsigned OldReg, ArrayRef<unsigned> NewRegs,
|
|
|
|
LiveIntervals &LIS) {
|
2011-05-07 02:00:02 +08:00
|
|
|
bool DidChange = false;
|
2011-05-07 03:31:19 +08:00
|
|
|
// Split locations referring to OldReg. Iterate backwards so splitLocation can
|
2012-03-16 05:33:35 +08:00
|
|
|
// safely erase unused locations.
|
2011-05-07 03:31:19 +08:00
|
|
|
for (unsigned i = locations.size(); i ; --i) {
|
|
|
|
unsigned LocNo = i-1;
|
2011-05-07 02:00:02 +08:00
|
|
|
const MachineOperand *Loc = &locations[LocNo];
|
|
|
|
if (!Loc->isReg() || Loc->getReg() != OldReg)
|
|
|
|
continue;
|
2013-08-15 07:50:04 +08:00
|
|
|
DidChange |= splitLocation(LocNo, NewRegs, LIS);
|
2011-05-07 02:00:02 +08:00
|
|
|
}
|
|
|
|
return DidChange;
|
|
|
|
}
|
|
|
|
|
2013-08-15 07:50:04 +08:00
|
|
|
void LDVImpl::splitRegister(unsigned OldReg, ArrayRef<unsigned> NewRegs) {
|
2011-05-07 02:00:02 +08:00
|
|
|
bool DidChange = false;
|
|
|
|
for (UserValue *UV = lookupVirtReg(OldReg); UV; UV = UV->getNext())
|
2013-08-15 07:50:04 +08:00
|
|
|
DidChange |= UV->splitRegister(OldReg, NewRegs, *LIS);
|
2011-05-07 02:00:02 +08:00
|
|
|
|
|
|
|
if (!DidChange)
|
|
|
|
return;
|
|
|
|
|
|
|
|
// Map all of the new virtual registers.
|
|
|
|
UserValue *UV = lookupVirtReg(OldReg);
|
|
|
|
for (unsigned i = 0; i != NewRegs.size(); ++i)
|
2013-08-15 07:50:04 +08:00
|
|
|
mapVirtReg(NewRegs[i], UV);
|
2011-05-07 02:00:02 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
void LiveDebugVariables::
|
2013-08-15 07:50:04 +08:00
|
|
|
splitRegister(unsigned OldReg, ArrayRef<unsigned> NewRegs, LiveIntervals &LIS) {
|
2011-05-07 02:00:02 +08:00
|
|
|
if (pImpl)
|
|
|
|
static_cast<LDVImpl*>(pImpl)->splitRegister(OldReg, NewRegs);
|
|
|
|
}
|
|
|
|
|
2017-09-21 02:19:08 +08:00
|
|
|
void UserValue::rewriteLocations(VirtRegMap &VRM, const TargetRegisterInfo &TRI,
|
|
|
|
BitVector &SpilledLocations) {
|
2017-09-21 01:32:54 +08:00
|
|
|
// Build a set of new locations with new numbers so we can coalesce our
|
|
|
|
// IntervalMap if two vreg intervals collapse to the same physical location.
|
|
|
|
// Use MapVector instead of SetVector because MapVector::insert returns the
|
2017-09-21 02:19:08 +08:00
|
|
|
// position of the previously or newly inserted element. The boolean value
|
|
|
|
// tracks if the location was produced by a spill.
|
|
|
|
// FIXME: This will be problematic if we ever support direct and indirect
|
|
|
|
// frame index locations, i.e. expressing both variables in memory and
|
|
|
|
// 'int x, *px = &x'. The "spilled" bit must become part of the location.
|
2017-09-21 01:32:54 +08:00
|
|
|
MapVector<MachineOperand, bool> NewLocations;
|
|
|
|
SmallVector<unsigned, 4> LocNoMap(locations.size());
|
|
|
|
for (unsigned I = 0, E = locations.size(); I != E; ++I) {
|
2017-09-21 02:19:08 +08:00
|
|
|
bool Spilled = false;
|
2017-09-21 01:32:54 +08:00
|
|
|
MachineOperand Loc = locations[I];
|
2010-12-04 05:47:10 +08:00
|
|
|
// Only virtual registers are rewritten.
|
2017-09-21 01:32:54 +08:00
|
|
|
if (Loc.isReg() && Loc.getReg() &&
|
|
|
|
TargetRegisterInfo::isVirtualRegister(Loc.getReg())) {
|
|
|
|
unsigned VirtReg = Loc.getReg();
|
|
|
|
if (VRM.isAssignedReg(VirtReg) &&
|
|
|
|
TargetRegisterInfo::isPhysicalRegister(VRM.getPhys(VirtReg))) {
|
|
|
|
// This can create a %noreg operand in rare cases when the sub-register
|
|
|
|
// index is no longer available. That means the user value is in a
|
|
|
|
// non-existent sub-register, and %noreg is exactly what we want.
|
|
|
|
Loc.substPhysReg(VRM.getPhys(VirtReg), TRI);
|
|
|
|
} else if (VRM.getStackSlot(VirtReg) != VirtRegMap::NO_STACK_SLOT) {
|
|
|
|
// FIXME: Translate SubIdx to a stackslot offset.
|
|
|
|
Loc = MachineOperand::CreateFI(VRM.getStackSlot(VirtReg));
|
2017-09-21 02:19:08 +08:00
|
|
|
Spilled = true;
|
2017-09-21 01:32:54 +08:00
|
|
|
} else {
|
|
|
|
Loc.setReg(0);
|
|
|
|
Loc.setSubReg(0);
|
|
|
|
}
|
2010-12-04 05:47:10 +08:00
|
|
|
}
|
2017-09-21 01:32:54 +08:00
|
|
|
|
|
|
|
// Insert this location if it doesn't already exist and record a mapping
|
|
|
|
// from the old number to the new number.
|
2017-09-21 02:19:08 +08:00
|
|
|
auto InsertResult = NewLocations.insert({Loc, Spilled});
|
|
|
|
unsigned NewLocNo = std::distance(NewLocations.begin(), InsertResult.first);
|
|
|
|
LocNoMap[I] = NewLocNo;
|
2017-09-21 01:32:54 +08:00
|
|
|
}
|
|
|
|
|
2017-09-21 02:19:08 +08:00
|
|
|
// Rewrite the locations and record which ones were spill slots.
|
2017-09-21 01:32:54 +08:00
|
|
|
locations.clear();
|
2017-09-21 02:19:08 +08:00
|
|
|
SpilledLocations.clear();
|
|
|
|
SpilledLocations.resize(NewLocations.size());
|
|
|
|
for (auto &Pair : NewLocations) {
|
2017-09-21 01:32:54 +08:00
|
|
|
locations.push_back(Pair.first);
|
2017-09-21 02:19:08 +08:00
|
|
|
if (Pair.second) {
|
|
|
|
unsigned NewLocNo = std::distance(&*NewLocations.begin(), &Pair);
|
|
|
|
SpilledLocations.set(NewLocNo);
|
|
|
|
}
|
|
|
|
}
|
2017-09-21 01:32:54 +08:00
|
|
|
|
|
|
|
// Update the interval map, but only coalesce left, since intervals to the
|
|
|
|
// right use the old location numbers. This should merge two contiguous
|
|
|
|
// DBG_VALUE intervals with different vregs that were allocated to the same
|
|
|
|
// physical register.
|
|
|
|
for (LocMap::iterator I = locInts.begin(); I.valid(); ++I) {
|
2017-10-04 01:59:02 +08:00
|
|
|
DbgValueLocation Loc = I.value();
|
|
|
|
unsigned NewLocNo = LocNoMap[Loc.locNo()];
|
|
|
|
I.setValueUnchecked(Loc.changeLocNo(NewLocNo));
|
2017-09-21 01:32:54 +08:00
|
|
|
I.setStart(I.start());
|
2010-12-04 05:47:10 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2017-10-05 16:37:31 +08:00
|
|
|
/// Find an iterator for inserting a DBG_VALUE instruction.
|
2010-12-04 05:47:10 +08:00
|
|
|
static MachineBasicBlock::iterator
|
2011-02-04 09:43:25 +08:00
|
|
|
findInsertLocation(MachineBasicBlock *MBB, SlotIndex Idx,
|
2010-12-04 05:47:10 +08:00
|
|
|
LiveIntervals &LIS) {
|
|
|
|
SlotIndex Start = LIS.getMBBStartIdx(MBB);
|
|
|
|
Idx = Idx.getBaseIndex();
|
|
|
|
|
|
|
|
// Try to find an insert location by going backwards from Idx.
|
|
|
|
MachineInstr *MI;
|
|
|
|
while (!(MI = LIS.getInstructionFromIndex(Idx))) {
|
|
|
|
// We've reached the beginning of MBB.
|
|
|
|
if (Idx == Start) {
|
2016-09-16 22:07:29 +08:00
|
|
|
MachineBasicBlock::iterator I = MBB->SkipPHIsLabelsAndDebug(MBB->begin());
|
2010-12-04 05:47:10 +08:00
|
|
|
return I;
|
|
|
|
}
|
|
|
|
Idx = Idx.getPrevIndex();
|
|
|
|
}
|
2011-02-04 09:43:25 +08:00
|
|
|
|
2011-01-14 07:35:53 +08:00
|
|
|
// Don't insert anything after the first terminator, though.
|
2011-12-07 15:15:52 +08:00
|
|
|
return MI->isTerminator() ? MBB->getFirstTerminator() :
|
2014-03-02 20:27:27 +08:00
|
|
|
std::next(MachineBasicBlock::iterator(MI));
|
2010-12-04 05:47:10 +08:00
|
|
|
}
|
|
|
|
|
2017-10-05 16:37:31 +08:00
|
|
|
/// Find an iterator for inserting the next DBG_VALUE instruction
|
|
|
|
/// (or end if no more insert locations found).
|
|
|
|
static MachineBasicBlock::iterator
|
|
|
|
findNextInsertLocation(MachineBasicBlock *MBB,
|
|
|
|
MachineBasicBlock::iterator I,
|
|
|
|
SlotIndex StopIdx, MachineOperand &LocMO,
|
|
|
|
LiveIntervals &LIS,
|
|
|
|
const TargetRegisterInfo &TRI) {
|
|
|
|
if (!LocMO.isReg())
|
|
|
|
return MBB->instr_end();
|
|
|
|
unsigned Reg = LocMO.getReg();
|
|
|
|
|
|
|
|
// Find the next instruction in the MBB that define the register Reg.
|
2018-02-09 22:03:26 +08:00
|
|
|
while (I != MBB->end() && !I->isTerminator()) {
|
2017-10-05 16:37:31 +08:00
|
|
|
if (!LIS.isNotInMIMap(*I) &&
|
|
|
|
SlotIndex::isEarlierEqualInstr(StopIdx, LIS.getInstructionIndex(*I)))
|
|
|
|
break;
|
|
|
|
if (I->definesRegister(Reg, &TRI))
|
|
|
|
// The insert location is directly after the instruction/bundle.
|
|
|
|
return std::next(I);
|
|
|
|
++I;
|
|
|
|
}
|
|
|
|
return MBB->end();
|
|
|
|
}
|
|
|
|
|
|
|
|
void UserValue::insertDebugValue(MachineBasicBlock *MBB, SlotIndex StartIdx,
|
|
|
|
SlotIndex StopIdx,
|
2017-10-04 01:59:02 +08:00
|
|
|
DbgValueLocation Loc, bool Spilled,
|
2010-12-04 05:47:10 +08:00
|
|
|
LiveIntervals &LIS,
|
2017-10-05 16:37:31 +08:00
|
|
|
const TargetInstrInfo &TII,
|
|
|
|
const TargetRegisterInfo &TRI) {
|
|
|
|
SlotIndex MBBEndIdx = LIS.getMBBEndIdx(&*MBB);
|
|
|
|
// Only search within the current MBB.
|
|
|
|
StopIdx = (MBBEndIdx < StopIdx) ? MBBEndIdx : StopIdx;
|
|
|
|
MachineBasicBlock::iterator I = findInsertLocation(MBB, StartIdx, LIS);
|
2017-10-04 01:59:02 +08:00
|
|
|
MachineOperand &MO = locations[Loc.locNo()];
|
2011-08-05 04:42:11 +08:00
|
|
|
++NumInsertedDebugValues;
|
2010-12-04 05:47:10 +08:00
|
|
|
|
2015-04-30 00:38:44 +08:00
|
|
|
assert(cast<DILocalVariable>(Variable)
|
2015-04-07 07:27:40 +08:00
|
|
|
->isValidLocationForIntrinsic(getDebugLoc()) &&
|
2015-04-04 03:20:26 +08:00
|
|
|
"Expected inlined-at fields to agree");
|
2017-09-21 02:19:08 +08:00
|
|
|
|
|
|
|
// If the location was spilled, the new DBG_VALUE will be indirect. If the
|
|
|
|
// original DBG_VALUE was indirect, we need to add DW_OP_deref to indicate
|
|
|
|
// that the original virtual register was a pointer.
|
|
|
|
const DIExpression *Expr = Expression;
|
2017-10-04 01:59:02 +08:00
|
|
|
bool IsIndirect = Loc.wasIndirect();
|
|
|
|
if (Spilled) {
|
|
|
|
if (IsIndirect)
|
|
|
|
Expr = DIExpression::prepend(Expr, DIExpression::WithDeref);
|
|
|
|
IsIndirect = true;
|
|
|
|
}
|
2017-09-21 02:19:08 +08:00
|
|
|
|
2017-10-04 01:59:02 +08:00
|
|
|
assert((!Spilled || MO.isFI()) && "a spilled location must be a frame index");
|
2017-09-21 02:19:08 +08:00
|
|
|
|
2017-10-05 16:37:31 +08:00
|
|
|
do {
|
|
|
|
MachineInstrBuilder MIB =
|
2017-09-21 02:19:08 +08:00
|
|
|
BuildMI(*MBB, I, getDebugLoc(), TII.get(TargetOpcode::DBG_VALUE))
|
2017-10-04 01:59:02 +08:00
|
|
|
.add(MO);
|
2017-10-05 16:37:31 +08:00
|
|
|
if (IsIndirect)
|
|
|
|
MIB.addImm(0U);
|
|
|
|
else
|
|
|
|
MIB.addReg(0U, RegState::Debug);
|
|
|
|
MIB.addMetadata(Variable).addMetadata(Expr);
|
|
|
|
|
|
|
|
// Continue and insert DBG_VALUES after every redefinition of register
|
|
|
|
// associated with the debug value within the range
|
|
|
|
I = findNextInsertLocation(MBB, I, StopIdx, MO, LIS, TRI);
|
|
|
|
} while (I != MBB->end());
|
2010-12-04 05:47:10 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
void UserValue::emitDebugValues(VirtRegMap *VRM, LiveIntervals &LIS,
|
2017-09-21 02:19:08 +08:00
|
|
|
const TargetInstrInfo &TII,
|
2017-10-05 16:37:31 +08:00
|
|
|
const TargetRegisterInfo &TRI,
|
2017-09-21 02:19:08 +08:00
|
|
|
const BitVector &SpilledLocations) {
|
2010-12-04 05:47:10 +08:00
|
|
|
MachineFunction::iterator MFEnd = VRM->getMachineFunction().end();
|
|
|
|
|
|
|
|
for (LocMap::const_iterator I = locInts.begin(); I.valid();) {
|
|
|
|
SlotIndex Start = I.start();
|
|
|
|
SlotIndex Stop = I.stop();
|
2017-10-04 01:59:02 +08:00
|
|
|
DbgValueLocation Loc = I.value();
|
|
|
|
bool Spilled = !Loc.isUndef() ? SpilledLocations.test(Loc.locNo()) : false;
|
2017-08-03 19:54:02 +08:00
|
|
|
|
|
|
|
// If the interval start was trimmed to the lexical scope insert the
|
|
|
|
// DBG_VALUE at the previous index (otherwise it appears after the
|
|
|
|
// first instruction in the range).
|
|
|
|
if (trimmedDefs.count(Start))
|
|
|
|
Start = Start.getPrevIndex();
|
|
|
|
|
2017-10-04 01:59:02 +08:00
|
|
|
DEBUG(dbgs() << "\t[" << Start << ';' << Stop << "):" << Loc.locNo());
|
2015-10-10 03:13:58 +08:00
|
|
|
MachineFunction::iterator MBB = LIS.getMBBFromIndex(Start)->getIterator();
|
|
|
|
SlotIndex MBBEnd = LIS.getMBBEndIdx(&*MBB);
|
2010-12-04 05:47:10 +08:00
|
|
|
|
2017-12-05 01:18:51 +08:00
|
|
|
DEBUG(dbgs() << ' ' << printMBBReference(*MBB) << '-' << MBBEnd);
|
2017-10-05 16:37:31 +08:00
|
|
|
insertDebugValue(&*MBB, Start, Stop, Loc, Spilled, LIS, TII, TRI);
|
2010-12-04 05:47:10 +08:00
|
|
|
// This interval may span multiple basic blocks.
|
|
|
|
// Insert a DBG_VALUE into each one.
|
2017-10-05 16:37:31 +08:00
|
|
|
while (Stop > MBBEnd) {
|
2010-12-04 05:47:10 +08:00
|
|
|
// Move to the next block.
|
|
|
|
Start = MBBEnd;
|
|
|
|
if (++MBB == MFEnd)
|
|
|
|
break;
|
2015-10-10 03:13:58 +08:00
|
|
|
MBBEnd = LIS.getMBBEndIdx(&*MBB);
|
2017-12-05 01:18:51 +08:00
|
|
|
DEBUG(dbgs() << ' ' << printMBBReference(*MBB) << '-' << MBBEnd);
|
2017-10-05 16:37:31 +08:00
|
|
|
insertDebugValue(&*MBB, Start, Stop, Loc, Spilled, LIS, TII, TRI);
|
2010-12-04 05:47:10 +08:00
|
|
|
}
|
|
|
|
DEBUG(dbgs() << '\n');
|
|
|
|
if (MBB == MFEnd)
|
|
|
|
break;
|
|
|
|
|
|
|
|
++I;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void LDVImpl::emitDebugValues(VirtRegMap *VRM) {
|
|
|
|
DEBUG(dbgs() << "********** EMITTING LIVE DEBUG VARIABLES **********\n");
|
Recommit r212203: Don't try to construct debug LexicalScopes hierarchy for functions that do not have top level debug information.
Reverted by Eric Christopher (Thanks!) in r212203 after Bob Wilson
reported LTO issues. Duncan Exon Smith and Aditya Nandakumar helped
provide a reduced reproduction, though the failure wasn't too hard to
guess, and even easier with the example to confirm.
The assertion that the subprogram metadata associated with an
llvm::Function matches the scope data referenced by the DbgLocs on the
instructions in that function is not valid under LTO. In LTO, a C++
inline function might exist in multiple CUs and the subprogram metadata
nodes will refer to the same llvm::Function. In this case, depending on
the order of the CUs, the first intance of the subprogram metadata may
not be the one referenced by the instructions in that function and the
assertion will fail.
A test case (test/DebugInfo/cross-cu-linkonce-distinct.ll) is added, the
assertion removed and a comment added to explain this situation.
This was then reverted again in r213581 as it caused PR20367. The root
cause of this was the early exit in LiveDebugVariables meant that
spurious DBG_VALUE intrinsics that referenced dead variables were not
removed, causing an assertion/crash later on. The fix is to have
LiveDebugVariables strip all DBG_VALUE intrinsics in functions without
debug info as they're not needed anyway. Test case added to cover this
situation (that occurs when a debug-having function is inlined into a
nodebug function) in test/DebugInfo/X86/nodebug_with_debug_loc.ll
Original commit message:
If a function isn't actually in a CU's subprogram list in the debug info
metadata, ignore all the DebugLocs and don't try to build scopes, track
variables, etc.
While this is possibly a minor optimization, it's also a correctness fix
for an incoming patch that will add assertions to LexicalScopes and the
debug info verifier to ensure that all scope chains lead to debug info
for the current function.
Fix up a few test cases that had broken/incomplete debug info that could
violate this constraint.
Add a test case where this occurs by design (inlining a
debug-info-having function in an attribute nodebug function - we want
this to work because /if/ the nodebug function is then inlined into a
debug-info-having function, it should be fine (and will work fine - we
just stitch the scopes up as usual), but should the inlining not happen
we need to not assert fail either).
llvm-svn: 213952
2014-07-26 00:10:16 +08:00
|
|
|
if (!MF)
|
|
|
|
return;
|
2014-08-05 10:39:49 +08:00
|
|
|
const TargetInstrInfo *TII = MF->getSubtarget().getInstrInfo();
|
2017-09-21 02:19:08 +08:00
|
|
|
BitVector SpilledLocations;
|
2010-12-04 05:47:10 +08:00
|
|
|
for (unsigned i = 0, e = userValues.size(); i != e; ++i) {
|
2015-02-27 08:11:34 +08:00
|
|
|
DEBUG(userValues[i]->print(dbgs(), TRI));
|
2017-09-21 02:19:08 +08:00
|
|
|
userValues[i]->rewriteLocations(*VRM, *TRI, SpilledLocations);
|
2017-10-05 16:37:31 +08:00
|
|
|
userValues[i]->emitDebugValues(VRM, *LIS, *TII, *TRI, SpilledLocations);
|
2010-12-04 05:47:10 +08:00
|
|
|
}
|
2013-02-14 04:23:48 +08:00
|
|
|
EmitDone = true;
|
2010-12-04 05:47:10 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
void LiveDebugVariables::emitDebugValues(VirtRegMap *VRM) {
|
2013-02-14 04:23:48 +08:00
|
|
|
if (pImpl)
|
2010-12-04 05:47:10 +08:00
|
|
|
static_cast<LDVImpl*>(pImpl)->emitDebugValues(VRM);
|
|
|
|
}
|
|
|
|
|
Recommit r212203: Don't try to construct debug LexicalScopes hierarchy for functions that do not have top level debug information.
Reverted by Eric Christopher (Thanks!) in r212203 after Bob Wilson
reported LTO issues. Duncan Exon Smith and Aditya Nandakumar helped
provide a reduced reproduction, though the failure wasn't too hard to
guess, and even easier with the example to confirm.
The assertion that the subprogram metadata associated with an
llvm::Function matches the scope data referenced by the DbgLocs on the
instructions in that function is not valid under LTO. In LTO, a C++
inline function might exist in multiple CUs and the subprogram metadata
nodes will refer to the same llvm::Function. In this case, depending on
the order of the CUs, the first intance of the subprogram metadata may
not be the one referenced by the instructions in that function and the
assertion will fail.
A test case (test/DebugInfo/cross-cu-linkonce-distinct.ll) is added, the
assertion removed and a comment added to explain this situation.
This was then reverted again in r213581 as it caused PR20367. The root
cause of this was the early exit in LiveDebugVariables meant that
spurious DBG_VALUE intrinsics that referenced dead variables were not
removed, causing an assertion/crash later on. The fix is to have
LiveDebugVariables strip all DBG_VALUE intrinsics in functions without
debug info as they're not needed anyway. Test case added to cover this
situation (that occurs when a debug-having function is inlined into a
nodebug function) in test/DebugInfo/X86/nodebug_with_debug_loc.ll
Original commit message:
If a function isn't actually in a CU's subprogram list in the debug info
metadata, ignore all the DebugLocs and don't try to build scopes, track
variables, etc.
While this is possibly a minor optimization, it's also a correctness fix
for an incoming patch that will add assertions to LexicalScopes and the
debug info verifier to ensure that all scope chains lead to debug info
for the current function.
Fix up a few test cases that had broken/incomplete debug info that could
violate this constraint.
Add a test case where this occurs by design (inlining a
debug-info-having function in an attribute nodebug function - we want
this to work because /if/ the nodebug function is then inlined into a
debug-info-having function, it should be fine (and will work fine - we
just stitch the scopes up as usual), but should the inlining not happen
we need to not assert fail either).
llvm-svn: 213952
2014-07-26 00:10:16 +08:00
|
|
|
bool LiveDebugVariables::doInitialization(Module &M) {
|
|
|
|
return Pass::doInitialization(M);
|
|
|
|
}
|
2010-12-04 05:47:10 +08:00
|
|
|
|
2017-10-15 22:32:27 +08:00
|
|
|
#if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
|
2017-06-22 06:19:17 +08:00
|
|
|
LLVM_DUMP_METHOD void LiveDebugVariables::dump() const {
|
2010-12-03 02:15:44 +08:00
|
|
|
if (pImpl)
|
|
|
|
static_cast<LDVImpl*>(pImpl)->print(dbgs());
|
|
|
|
}
|
|
|
|
#endif
|