X-Git-Url: http://plrg.eecs.uci.edu/git/?a=blobdiff_plain;f=include%2Fllvm%2FProfileData%2FCoverageMapping.h;h=7c88977cb29e02f311fea21b88fd9490855f4543;hb=c937185054dfa1a0f11fbfe06aa57a0e7e358e7e;hp=6d833648a17aac709fed5f6edfc7060a7a7739a8;hpb=a740e5d8d6acfcd7ae142fb9a84b371fd6e1b150;p=oota-llvm.git diff --git a/include/llvm/ProfileData/CoverageMapping.h b/include/llvm/ProfileData/CoverageMapping.h index 6d833648a17..7c88977cb29 100644 --- a/include/llvm/ProfileData/CoverageMapping.h +++ b/include/llvm/ProfileData/CoverageMapping.h @@ -16,6 +16,10 @@ #define LLVM_PROFILEDATA_COVERAGEMAPPING_H_ #include "llvm/ADT/ArrayRef.h" +#include "llvm/ADT/DenseMap.h" +#include "llvm/ADT/Hashing.h" +#include "llvm/ADT/iterator.h" +#include "llvm/Support/Debug.h" #include "llvm/Support/ErrorOr.h" #include "llvm/Support/raw_ostream.h" #include @@ -59,8 +63,12 @@ public: unsigned getExpressionID() const { return ID; } - bool operator==(const Counter &Other) const { - return Kind == Other.Kind && ID == Other.ID; + friend bool operator==(const Counter &LHS, const Counter &RHS) { + return LHS.Kind == RHS.Kind && LHS.ID == RHS.ID; + } + + friend bool operator!=(const Counter &LHS, const Counter &RHS) { + return !(LHS == RHS); } friend bool operator<(const Counter &LHS, const Counter &RHS) { @@ -91,10 +99,6 @@ struct CounterExpression { CounterExpression(ExprKind Kind, Counter LHS, Counter RHS) : Kind(Kind), LHS(LHS), RHS(RHS) {} - - bool operator==(const CounterExpression &Other) const { - return Kind == Other.Kind && LHS == Other.LHS && RHS == Other.RHS; - } }; /// \brief A Counter expression builder is used to construct the @@ -102,9 +106,9 @@ struct CounterExpression { /// and simplifies algebraic expressions. class CounterExpressionBuilder { /// \brief A list of all the counter expressions - llvm::SmallVector Expressions; - /// \brief An array of terms used in expression simplification. - llvm::SmallVector Terms; + std::vector Expressions; + /// \brief A lookup table for the index of a given expression. + llvm::DenseMap ExpressionIndices; /// \brief Return the counter which corresponds to the given expression. /// @@ -113,18 +117,19 @@ class CounterExpressionBuilder { /// expression is added to the builder's collection of expressions. Counter get(const CounterExpression &E); - /// \brief Convert the expression tree represented by a counter - /// into a polynomial in the form of K1Counter1 + .. + KNCounterN - /// where K1 .. KN are integer constants that are stored in the Terms array. - void extractTerms(Counter C, int Sign = 1); + /// \brief Gather the terms of the expression tree for processing. + /// + /// This collects each addition and subtraction referenced by the counter into + /// a sequence that can be sorted and combined to build a simplified counter + /// expression. + void extractTerms(Counter C, int Sign, + SmallVectorImpl> &Terms); /// \brief Simplifies the given expression tree /// by getting rid of algebraically redundant operations. Counter simplify(Counter ExpressionTree); public: - CounterExpressionBuilder(unsigned NumCounterValues); - ArrayRef getExpressions() const { return Expressions; } /// \brief Return a counter that represents the expression @@ -217,7 +222,7 @@ public: : Expressions(Expressions), CounterValues(CounterValues) {} void dump(const Counter &C, llvm::raw_ostream &OS) const; - void dump(const Counter &C) const { dump(C, llvm::outs()); } + void dump(const Counter &C) const { dump(C, dbgs()); } /// \brief Return the number of times that a region of code associated with /// this counter was executed. @@ -241,6 +246,40 @@ struct FunctionRecord { ExecutionCount(ExecutionCount) {} }; +/// \brief Iterator over Functions, optionally filtered to a single file. +class FunctionRecordIterator + : public iterator_facade_base { + ArrayRef Records; + ArrayRef::iterator Current; + StringRef Filename; + + /// \brief Skip records whose primary file is not \c Filename. + void skipOtherFiles(); + +public: + FunctionRecordIterator(ArrayRef Records_, + StringRef Filename = "") + : Records(Records_), Current(Records.begin()), Filename(Filename) { + skipOtherFiles(); + } + + FunctionRecordIterator() : Current(Records.begin()) {} + + bool operator==(const FunctionRecordIterator &RHS) const { + return Current == RHS.Current && Filename == RHS.Filename; + } + + const FunctionRecord &operator*() const { return *Current; } + + FunctionRecordIterator &operator++() { + assert(Current != Records.end() && "incremented past end"); + ++Current; + skipOtherFiles(); + return *this; + } +}; + /// \brief Coverage information for a macro expansion or #included file. /// /// When covered code has pieces that can be expanded for more detail, such as a @@ -343,7 +382,7 @@ public: unsigned getMismatchedCount() { return MismatchedFunctionCount; } /// \brief Returns the list of files that are covered. - std::vector getUniqueSourceFiles(); + std::vector getUniqueSourceFiles() const; /// \brief Get the coverage for a particular file. /// @@ -353,8 +392,16 @@ public: CoverageData getCoverageForFile(StringRef Filename); /// \brief Gets all of the functions covered by this profile. - ArrayRef getCoveredFunctions() { - return ArrayRef(Functions.data(), Functions.size()); + iterator_range getCoveredFunctions() const { + return make_range(FunctionRecordIterator(Functions), + FunctionRecordIterator()); + } + + /// \brief Gets all of the functions in a particular file. + iterator_range + getCoveredFunctions(StringRef Filename) const { + return make_range(FunctionRecordIterator(Functions, Filename), + FunctionRecordIterator()); } /// \brief Get the list of function instantiations in the file. @@ -371,6 +418,36 @@ public: }; } // end namespace coverage + +/// \brief Provide DenseMapInfo for CounterExpression +template<> struct DenseMapInfo { + static inline coverage::CounterExpression getEmptyKey() { + using namespace coverage; + return CounterExpression(CounterExpression::ExprKind::Subtract, + Counter::getCounter(~0U), + Counter::getCounter(~0U)); + } + + static inline coverage::CounterExpression getTombstoneKey() { + using namespace coverage; + return CounterExpression(CounterExpression::ExprKind::Add, + Counter::getCounter(~0U), + Counter::getCounter(~0U)); + } + + static unsigned getHashValue(const coverage::CounterExpression &V) { + return static_cast( + hash_combine(V.Kind, V.LHS.getKind(), V.LHS.getCounterID(), + V.RHS.getKind(), V.RHS.getCounterID())); + } + + static bool isEqual(const coverage::CounterExpression &LHS, + const coverage::CounterExpression &RHS) { + return LHS.Kind == RHS.Kind && LHS.LHS == RHS.LHS && LHS.RHS == RHS.RHS; + } +}; + + } // end namespace llvm #endif // LLVM_PROFILEDATA_COVERAGEMAPPING_H_