[llvm] r254390 - Introduce a range version of std::any_of, and use it in SCEV
Sanjoy Das via llvm-commits
llvm-commits at lists.llvm.org
Mon Nov 30 23:49:24 PST 2015
Author: sanjoy
Date: Tue Dec 1 01:49:23 2015
New Revision: 254390
URL: http://llvm.org/viewvc/llvm-project?rev=254390&view=rev
Log:
Introduce a range version of std::any_of, and use it in SCEV
Reviewers: dblaikie, pcc
Subscribers: llvm-commits
Differential Revision: http://reviews.llvm.org/D15063
Modified:
llvm/trunk/include/llvm/ADT/STLExtras.h
llvm/trunk/lib/Analysis/ScalarEvolution.cpp
llvm/trunk/tools/llvm-pdbdump/LinePrinter.cpp
Modified: llvm/trunk/include/llvm/ADT/STLExtras.h
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/include/llvm/ADT/STLExtras.h?rev=254390&r1=254389&r2=254390&view=diff
==============================================================================
--- llvm/trunk/include/llvm/ADT/STLExtras.h (original)
+++ llvm/trunk/include/llvm/ADT/STLExtras.h Tue Dec 1 01:49:23 2015
@@ -371,6 +371,14 @@ bool all_of(R &&Range, UnaryPredicate &&
std::forward<UnaryPredicate>(P));
}
+/// Provide wrappers to std::any_of which take ranges instead of having to pass
+/// begin/end explicitly.
+template <typename R, class UnaryPredicate>
+bool any_of(R &&Range, UnaryPredicate &&P) {
+ return std::any_of(Range.begin(), Range.end(),
+ std::forward<UnaryPredicate>(P));
+}
+
//===----------------------------------------------------------------------===//
// Extra additions to <memory>
//===----------------------------------------------------------------------===//
Modified: llvm/trunk/lib/Analysis/ScalarEvolution.cpp
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/lib/Analysis/ScalarEvolution.cpp?rev=254390&r1=254389&r2=254390&view=diff
==============================================================================
--- llvm/trunk/lib/Analysis/ScalarEvolution.cpp (original)
+++ llvm/trunk/lib/Analysis/ScalarEvolution.cpp Tue Dec 1 01:49:23 2015
@@ -8403,8 +8403,7 @@ const SCEV *SCEVAddRecExpr::getNumIterat
// The only time we can solve this is when we have all constant indices.
// Otherwise, we cannot determine the overflow conditions.
- if (std::any_of(op_begin(), op_end(),
- [](const SCEV *Op) { return !isa<SCEVConstant>(Op);}))
+ if (any_of(operands(), [](const SCEV *Op) { return !isa<SCEVConstant>(Op); }))
return SE.getCouldNotCompute();
// Okay at this point we know that all elements of the chrec are constants and
@@ -9694,8 +9693,8 @@ bool SCEVUnionPredicate::implies(const S
return false;
auto &SCEVPreds = ScevPredsIt->second;
- return std::any_of(SCEVPreds.begin(), SCEVPreds.end(),
- [N](const SCEVPredicate *I) { return I->implies(N); });
+ return any_of(SCEVPreds,
+ [N](const SCEVPredicate *I) { return I->implies(N); });
}
const SCEV *SCEVUnionPredicate::getExpr() const { return nullptr; }
Modified: llvm/trunk/tools/llvm-pdbdump/LinePrinter.cpp
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/tools/llvm-pdbdump/LinePrinter.cpp?rev=254390&r1=254389&r2=254390&view=diff
==============================================================================
--- llvm/trunk/tools/llvm-pdbdump/LinePrinter.cpp (original)
+++ llvm/trunk/tools/llvm-pdbdump/LinePrinter.cpp Tue Dec 1 01:49:23 2015
@@ -11,15 +11,12 @@
#include "llvm-pdbdump.h"
+#include "llvm/ADT/STLExtras.h"
#include "llvm/Support/Regex.h"
#include <algorithm>
namespace {
-template <class T, class Pred> bool any_of_range(T &&R, Pred P) {
- return std::any_of(R.begin(), R.end(), P);
-}
-
bool IsItemExcluded(llvm::StringRef Item,
std::list<llvm::Regex> &IncludeFilters,
std::list<llvm::Regex> &ExcludeFilters) {
@@ -30,10 +27,10 @@ bool IsItemExcluded(llvm::StringRef Item
// Include takes priority over exclude. If the user specified include
// filters, and none of them include this item, them item is gone.
- if (!IncludeFilters.empty() && !any_of_range(IncludeFilters, match_pred))
+ if (!IncludeFilters.empty() && !any_of(IncludeFilters, match_pred))
return true;
- if (any_of_range(ExcludeFilters, match_pred))
+ if (any_of(ExcludeFilters, match_pred))
return true;
return false;
More information about the llvm-commits
mailing list