blob: 6d55c03854147a4588556ed3c75419c81cda0da3 [file] [log] [blame]
David Blaikie1275e4f2014-04-01 21:49:04 +00001//===-- llvm/CodeGen/DebugLocEntry.h - Entry in debug_loc list -*- C++ -*--===//
2//
3// The LLVM Compiler Infrastructure
4//
5// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//
9
Benjamin Kramera7c40ef2014-08-13 16:26:38 +000010#ifndef LLVM_LIB_CODEGEN_ASMPRINTER_DEBUGLOCENTRY_H
11#define LLVM_LIB_CODEGEN_ASMPRINTER_DEBUGLOCENTRY_H
David Blaikie1275e4f2014-04-01 21:49:04 +000012#include "llvm/IR/Constants.h"
Adrian Prantlb1416832014-08-01 22:11:58 +000013#include "llvm/IR/DebugInfo.h"
David Blaikie1275e4f2014-04-01 21:49:04 +000014#include "llvm/MC/MCSymbol.h"
Chandler Carruthd9903882015-01-14 11:23:27 +000015#include "llvm/MC/MachineLocation.h"
David Blaikie1275e4f2014-04-01 21:49:04 +000016
17namespace llvm {
David Blaikie1275e4f2014-04-01 21:49:04 +000018class MDNode;
19/// \brief This struct describes location entries emitted in the .debug_loc
20/// section.
21class DebugLocEntry {
22 // Begin and end symbols for the address range that this location is valid.
23 const MCSymbol *Begin;
24 const MCSymbol *End;
25
Adrian Prantle19e5ef2014-04-27 18:25:40 +000026public:
27 /// A single location or constant.
28 struct Value {
Adrian Prantl87b7eb92014-10-01 18:55:02 +000029 Value(const MDNode *Var, const MDNode *Expr, int64_t i)
30 : Variable(Var), Expression(Expr), EntryKind(E_Integer) {
Adrian Prantle19e5ef2014-04-27 18:25:40 +000031 Constant.Int = i;
32 }
Adrian Prantl87b7eb92014-10-01 18:55:02 +000033 Value(const MDNode *Var, const MDNode *Expr, const ConstantFP *CFP)
34 : Variable(Var), Expression(Expr), EntryKind(E_ConstantFP) {
Adrian Prantle19e5ef2014-04-27 18:25:40 +000035 Constant.CFP = CFP;
36 }
Adrian Prantl87b7eb92014-10-01 18:55:02 +000037 Value(const MDNode *Var, const MDNode *Expr, const ConstantInt *CIP)
38 : Variable(Var), Expression(Expr), EntryKind(E_ConstantInt) {
Adrian Prantle19e5ef2014-04-27 18:25:40 +000039 Constant.CIP = CIP;
40 }
Adrian Prantl87b7eb92014-10-01 18:55:02 +000041 Value(const MDNode *Var, const MDNode *Expr, MachineLocation Loc)
42 : Variable(Var), Expression(Expr), EntryKind(E_Location), Loc(Loc) {
43 assert(DIVariable(Var).Verify());
44 assert(DIExpression(Expr).Verify());
David Blaikied306baf2014-04-01 22:04:07 +000045 }
46
Adrian Prantle19e5ef2014-04-27 18:25:40 +000047 // The variable to which this location entry corresponds.
48 const MDNode *Variable;
49
Adrian Prantl87b7eb92014-10-01 18:55:02 +000050 // Any complex address location expression for this Value.
51 const MDNode *Expression;
52
Adrian Prantle19e5ef2014-04-27 18:25:40 +000053 // Type of entry that this represents.
54 enum EntryType { E_Location, E_Integer, E_ConstantFP, E_ConstantInt };
55 enum EntryType EntryKind;
56
57 // Either a constant,
58 union {
59 int64_t Int;
60 const ConstantFP *CFP;
61 const ConstantInt *CIP;
62 } Constant;
63
64 // Or a location in the machine frame.
65 MachineLocation Loc;
66
Adrian Prantle19e5ef2014-04-27 18:25:40 +000067 bool isLocation() const { return EntryKind == E_Location; }
68 bool isInt() const { return EntryKind == E_Integer; }
69 bool isConstantFP() const { return EntryKind == E_ConstantFP; }
70 bool isConstantInt() const { return EntryKind == E_ConstantInt; }
71 int64_t getInt() const { return Constant.Int; }
72 const ConstantFP *getConstantFP() const { return Constant.CFP; }
73 const ConstantInt *getConstantInt() const { return Constant.CIP; }
74 MachineLocation getLoc() const { return Loc; }
Adrian Prantl76502d82014-08-11 23:22:59 +000075 const MDNode *getVariableNode() const { return Variable; }
76 DIVariable getVariable() const { return DIVariable(Variable); }
Adrian Prantl27bd01f2015-02-09 23:57:15 +000077 bool isBitPiece() const { return getExpression().isBitPiece(); }
Adrian Prantl87b7eb92014-10-01 18:55:02 +000078 DIExpression getExpression() const { return DIExpression(Expression); }
Adrian Prantle8bde9f2014-08-11 22:52:56 +000079 friend bool operator==(const Value &, const Value &);
80 friend bool operator<(const Value &, const Value &);
Adrian Prantle19e5ef2014-04-27 18:25:40 +000081 };
Adrian Prantle8bde9f2014-08-11 22:52:56 +000082
Adrian Prantle19e5ef2014-04-27 18:25:40 +000083private:
Adrian Prantlbe4b5172014-08-11 21:06:03 +000084 /// A nonempty list of locations/constants belonging to this entry,
85 /// sorted by offset.
Adrian Prantle19e5ef2014-04-27 18:25:40 +000086 SmallVector<Value, 1> Values;
87
David Blaikie1275e4f2014-04-01 21:49:04 +000088public:
David Blaikiee1a26a62014-08-05 23:14:16 +000089 DebugLocEntry(const MCSymbol *B, const MCSymbol *E, Value Val)
90 : Begin(B), End(E) {
Adrian Prantle19e5ef2014-04-27 18:25:40 +000091 Values.push_back(std::move(Val));
David Blaikie1275e4f2014-04-01 21:49:04 +000092 }
93
Adrian Prantle09ee3f2014-08-11 20:59:28 +000094 /// \brief If this and Next are describing different pieces of the same
95 // variable, merge them by appending Next's values to the current
96 // list of values.
97 // Return true if the merge was successful.
98 bool MergeValues(const DebugLocEntry &Next) {
Adrian Prantl87b7eb92014-10-01 18:55:02 +000099 if (Begin == Next.Begin) {
100 DIExpression Expr(Values[0].Expression);
Adrian Prantlb1416832014-08-01 22:11:58 +0000101 DIVariable Var(Values[0].Variable);
Adrian Prantl87b7eb92014-10-01 18:55:02 +0000102 DIExpression NextExpr(Next.Values[0].Expression);
Adrian Prantlb1416832014-08-01 22:11:58 +0000103 DIVariable NextVar(Next.Values[0].Variable);
Adrian Prantl27bd01f2015-02-09 23:57:15 +0000104 if (Var == NextVar && Expr.isBitPiece() &&
105 NextExpr.isBitPiece()) {
Adrian Prantl1c6f2ec2014-08-11 21:06:00 +0000106 addValues(Next.Values);
Adrian Prantlb1416832014-08-01 22:11:58 +0000107 End = Next.End;
108 return true;
109 }
110 }
Adrian Prantle09ee3f2014-08-11 20:59:28 +0000111 return false;
112 }
113
114 /// \brief Attempt to merge this DebugLocEntry with Next and return
115 /// true if the merge was successful. Entries can be merged if they
116 /// share the same Loc/Constant and if Next immediately follows this
117 /// Entry.
118 bool MergeRanges(const DebugLocEntry &Next) {
Adrian Prantlb1416832014-08-01 22:11:58 +0000119 // If this and Next are describing the same variable, merge them.
Adrian Prantle19e5ef2014-04-27 18:25:40 +0000120 if ((End == Next.Begin && Values == Next.Values)) {
David Blaikie6fa99662014-04-01 23:19:23 +0000121 End = Next.End;
122 return true;
123 }
124 return false;
David Blaikie1275e4f2014-04-01 21:49:04 +0000125 }
Adrian Prantlb1416832014-08-01 22:11:58 +0000126
David Blaikie1275e4f2014-04-01 21:49:04 +0000127 const MCSymbol *getBeginSym() const { return Begin; }
128 const MCSymbol *getEndSym() const { return End; }
Craig Topper3af97222014-08-27 05:25:00 +0000129 ArrayRef<Value> getValues() const { return Values; }
Adrian Prantl1c6f2ec2014-08-11 21:06:00 +0000130 void addValues(ArrayRef<DebugLocEntry::Value> Vals) {
131 Values.append(Vals.begin(), Vals.end());
Adrian Prantl293dd932014-08-11 21:05:55 +0000132 sortUniqueValues();
Adrian Prantl1c6f2ec2014-08-11 21:06:00 +0000133 assert(std::all_of(Values.begin(), Values.end(), [](DebugLocEntry::Value V){
Adrian Prantl27bd01f2015-02-09 23:57:15 +0000134 return V.isBitPiece();
Adrian Prantl1c6f2ec2014-08-11 21:06:00 +0000135 }) && "value must be a piece");
Adrian Prantl293dd932014-08-11 21:05:55 +0000136 }
137
138 // Sort the pieces by offset.
139 // Remove any duplicate entries by dropping all but the first.
140 void sortUniqueValues() {
141 std::sort(Values.begin(), Values.end());
Adrian Prantl9724b5c2014-08-12 01:07:53 +0000142 Values.erase(std::unique(Values.begin(), Values.end(),
143 [](const Value &A, const Value &B) {
Adrian Prantl87b7eb92014-10-01 18:55:02 +0000144 return A.getVariable() == B.getVariable() &&
145 A.getExpression() == B.getExpression();
146 }),
147 Values.end());
Adrian Prantlb1416832014-08-01 22:11:58 +0000148 }
David Blaikie1275e4f2014-04-01 21:49:04 +0000149};
150
Adrian Prantle8bde9f2014-08-11 22:52:56 +0000151/// Compare two Values for equality.
152inline bool operator==(const DebugLocEntry::Value &A,
153 const DebugLocEntry::Value &B) {
154 if (A.EntryKind != B.EntryKind)
155 return false;
156
Adrian Prantl87b7eb92014-10-01 18:55:02 +0000157 if (A.Expression != B.Expression)
158 return false;
159
160 if (A.Variable != B.Variable)
Adrian Prantle8bde9f2014-08-11 22:52:56 +0000161 return false;
162
163 switch (A.EntryKind) {
164 case DebugLocEntry::Value::E_Location:
165 return A.Loc == B.Loc;
166 case DebugLocEntry::Value::E_Integer:
167 return A.Constant.Int == B.Constant.Int;
168 case DebugLocEntry::Value::E_ConstantFP:
169 return A.Constant.CFP == B.Constant.CFP;
170 case DebugLocEntry::Value::E_ConstantInt:
171 return A.Constant.CIP == B.Constant.CIP;
172 }
173 llvm_unreachable("unhandled EntryKind");
David Blaikie1275e4f2014-04-01 21:49:04 +0000174}
Adrian Prantle8bde9f2014-08-11 22:52:56 +0000175
176/// Compare two pieces based on their offset.
177inline bool operator<(const DebugLocEntry::Value &A,
178 const DebugLocEntry::Value &B) {
Adrian Prantl27bd01f2015-02-09 23:57:15 +0000179 return A.getExpression().getBitPieceOffset() <
180 B.getExpression().getBitPieceOffset();
Adrian Prantle8bde9f2014-08-11 22:52:56 +0000181}
182
183}
184
David Blaikie1275e4f2014-04-01 21:49:04 +0000185#endif