diff options
| author | Dimitry Andric <dim@FreeBSD.org> | 2015-05-27 20:26:41 +0000 | 
|---|---|---|
| committer | Dimitry Andric <dim@FreeBSD.org> | 2015-05-27 20:26:41 +0000 | 
| commit | ff0cc061ecf297f1556e906d229826fd709f37d6 (patch) | |
| tree | bd13a22d9db57ccf3eddbc07b32c18109521d050 /contrib/llvm/lib/CodeGen/AsmPrinter/DebugLocEntry.h | |
| parent | e14ba20ace4c6ab45aca5130defd992ab7d6bf5f (diff) | |
| parent | 5a5ac124e1efaf208671f01c46edb15f29ed2a0b (diff) | |
Notes
Diffstat (limited to 'contrib/llvm/lib/CodeGen/AsmPrinter/DebugLocEntry.h')
| -rw-r--r-- | contrib/llvm/lib/CodeGen/AsmPrinter/DebugLocEntry.h | 91 | 
1 files changed, 43 insertions, 48 deletions
diff --git a/contrib/llvm/lib/CodeGen/AsmPrinter/DebugLocEntry.h b/contrib/llvm/lib/CodeGen/AsmPrinter/DebugLocEntry.h index b4fcada59ecc..6a943c64ea22 100644 --- a/contrib/llvm/lib/CodeGen/AsmPrinter/DebugLocEntry.h +++ b/contrib/llvm/lib/CodeGen/AsmPrinter/DebugLocEntry.h @@ -9,52 +9,51 @@  #ifndef LLVM_LIB_CODEGEN_ASMPRINTER_DEBUGLOCENTRY_H  #define LLVM_LIB_CODEGEN_ASMPRINTER_DEBUGLOCENTRY_H +#include "llvm/ADT/SmallString.h"  #include "llvm/IR/Constants.h"  #include "llvm/IR/DebugInfo.h"  #include "llvm/MC/MCSymbol.h"  #include "llvm/MC/MachineLocation.h"  namespace llvm { -class MDNode; +class AsmPrinter; +class DebugLocStream; +  /// \brief This struct describes location entries emitted in the .debug_loc  /// section.  class DebugLocEntry { -  // Begin and end symbols for the address range that this location is valid. +  /// Begin and end symbols for the address range that this location is valid.    const MCSymbol *Begin;    const MCSymbol *End;  public: -  /// A single location or constant. +  /// \brief A single location or constant.    struct Value { -    Value(const MDNode *Var, const MDNode *Expr, int64_t i) -        : Variable(Var), Expression(Expr), EntryKind(E_Integer) { +    Value(const DIExpression *Expr, int64_t i) +        : Expression(Expr), EntryKind(E_Integer) {        Constant.Int = i;      } -    Value(const MDNode *Var, const MDNode *Expr, const ConstantFP *CFP) -        : Variable(Var), Expression(Expr), EntryKind(E_ConstantFP) { +    Value(const DIExpression *Expr, const ConstantFP *CFP) +        : Expression(Expr), EntryKind(E_ConstantFP) {        Constant.CFP = CFP;      } -    Value(const MDNode *Var, const MDNode *Expr, const ConstantInt *CIP) -        : Variable(Var), Expression(Expr), EntryKind(E_ConstantInt) { +    Value(const DIExpression *Expr, const ConstantInt *CIP) +        : Expression(Expr), EntryKind(E_ConstantInt) {        Constant.CIP = CIP;      } -    Value(const MDNode *Var, const MDNode *Expr, MachineLocation Loc) -        : Variable(Var), Expression(Expr), EntryKind(E_Location), Loc(Loc) { -      assert(DIVariable(Var).Verify()); -      assert(DIExpression(Expr).Verify()); +    Value(const DIExpression *Expr, MachineLocation Loc) +        : Expression(Expr), EntryKind(E_Location), Loc(Loc) { +      assert(cast<DIExpression>(Expr)->isValid());      } -    // The variable to which this location entry corresponds. -    const MDNode *Variable; - -    // Any complex address location expression for this Value. -    const MDNode *Expression; +    /// Any complex address location expression for this Value. +    const DIExpression *Expression; -    // Type of entry that this represents. +    /// Type of entry that this represents.      enum EntryType { E_Location, E_Integer, E_ConstantFP, E_ConstantInt };      enum EntryType EntryKind; -    // Either a constant, +    /// Either a constant,      union {        int64_t Int;        const ConstantFP *CFP; @@ -72,10 +71,8 @@ public:      const ConstantFP *getConstantFP() const { return Constant.CFP; }      const ConstantInt *getConstantInt() const { return Constant.CIP; }      MachineLocation getLoc() const { return Loc; } -    const MDNode *getVariableNode() const { return Variable; } -    DIVariable getVariable() const { return DIVariable(Variable); } -    bool isVariablePiece() const { return getExpression().isVariablePiece(); } -    DIExpression getExpression() const { return DIExpression(Expression); } +    bool isBitPiece() const { return getExpression()->isBitPiece(); } +    const DIExpression *getExpression() const { return Expression; }      friend bool operator==(const Value &, const Value &);      friend bool operator<(const Value &, const Value &);    }; @@ -92,17 +89,14 @@ public:    }    /// \brief If this and Next are describing different pieces of the same -  // variable, merge them by appending Next's values to the current -  // list of values. -  // Return true if the merge was successful. +  /// variable, merge them by appending Next's values to the current +  /// list of values. +  /// Return true if the merge was successful.    bool MergeValues(const DebugLocEntry &Next) {      if (Begin == Next.Begin) { -      DIExpression Expr(Values[0].Expression); -      DIVariable Var(Values[0].Variable); -      DIExpression NextExpr(Next.Values[0].Expression); -      DIVariable NextVar(Next.Values[0].Variable); -      if (Var == NextVar && Expr.isVariablePiece() && -          NextExpr.isVariablePiece()) { +      auto *Expr = cast_or_null<DIExpression>(Values[0].Expression); +      auto *NextExpr = cast_or_null<DIExpression>(Next.Values[0].Expression); +      if (Expr->isBitPiece() && NextExpr->isBitPiece()) {          addValues(Next.Values);          End = Next.End;          return true; @@ -131,24 +125,28 @@ public:      Values.append(Vals.begin(), Vals.end());      sortUniqueValues();      assert(std::all_of(Values.begin(), Values.end(), [](DebugLocEntry::Value V){ -          return V.isVariablePiece(); +          return V.isBitPiece();          }) && "value must be a piece");    } -  // Sort the pieces by offset. +  // \brief Sort the pieces by offset.    // Remove any duplicate entries by dropping all but the first.    void sortUniqueValues() {      std::sort(Values.begin(), Values.end()); -    Values.erase(std::unique(Values.begin(), Values.end(), -                             [](const Value &A, const Value &B) { -                   return A.getVariable() == B.getVariable() && -                          A.getExpression() == B.getExpression(); -                 }), -                 Values.end()); +    Values.erase( +        std::unique( +            Values.begin(), Values.end(), [](const Value &A, const Value &B) { +              return A.getExpression() == B.getExpression(); +            }), +        Values.end());    } + +  /// \brief Lower this entry into a DWARF expression. +  void finalize(const AsmPrinter &AP, DebugLocStream &Locs, +                const DIBasicType *BT);  }; -/// Compare two Values for equality. +/// \brief Compare two Values for equality.  inline bool operator==(const DebugLocEntry::Value &A,                         const DebugLocEntry::Value &B) {    if (A.EntryKind != B.EntryKind) @@ -157,9 +155,6 @@ inline bool operator==(const DebugLocEntry::Value &A,    if (A.Expression != B.Expression)      return false; -  if (A.Variable != B.Variable) -    return false; -    switch (A.EntryKind) {    case DebugLocEntry::Value::E_Location:      return A.Loc == B.Loc; @@ -173,11 +168,11 @@ inline bool operator==(const DebugLocEntry::Value &A,    llvm_unreachable("unhandled EntryKind");  } -/// Compare two pieces based on their offset. +/// \brief Compare two pieces based on their offset.  inline bool operator<(const DebugLocEntry::Value &A,                        const DebugLocEntry::Value &B) { -  return A.getExpression().getPieceOffset() < -         B.getExpression().getPieceOffset(); +  return A.getExpression()->getBitPieceOffset() < +         B.getExpression()->getBitPieceOffset();  }  }  | 
