projects
/
oota-llvm.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
Taints the non-acquire RMW's store address with the load part
[oota-llvm.git]
/
unittests
/
ADT
/
SCCIteratorTest.cpp
diff --git
a/unittests/ADT/SCCIteratorTest.cpp
b/unittests/ADT/SCCIteratorTest.cpp
index 00fa0665dda83b2ebc9ca57244973f0df8d9da43..da8c04483f9cabddaf12720f20efcf43a9f6e0d3 100644
(file)
--- a/
unittests/ADT/SCCIteratorTest.cpp
+++ b/
unittests/ADT/SCCIteratorTest.cpp
@@
-7,10
+7,10
@@
//
//===----------------------------------------------------------------------===//
//
//===----------------------------------------------------------------------===//
-#include <limits.h>
-#include "llvm/ADT/GraphTraits.h"
#include "llvm/ADT/SCCIterator.h"
#include "llvm/ADT/SCCIterator.h"
+#include "llvm/ADT/GraphTraits.h"
#include "gtest/gtest.h"
#include "gtest/gtest.h"
+#include <limits.h>
using namespace llvm;
using namespace llvm;
@@
-39,8
+39,6
@@
public:
NodeSubset() : Elements(0) {
assert(N <= sizeof(BitVector)*CHAR_BIT && "Graph too big!");
}
NodeSubset() : Elements(0) {
assert(N <= sizeof(BitVector)*CHAR_BIT && "Graph too big!");
}
- /// NodeSubset - Copy constructor.
- NodeSubset(const NodeSubset &other) : Elements(other.Elements) {}
/// Comparison operators.
bool operator==(const NodeSubset &other) const {
/// Comparison operators.
bool operator==(const NodeSubset &other) const {
@@
-213,7
+211,7
@@
public:
// Return a pointer to it.
return FirstNode + i;
assert(false && "Dereferencing end iterator!");
// Return a pointer to it.
return FirstNode + i;
assert(false && "Dereferencing end iterator!");
- return
0
; // Avoid compiler warning.
+ return
nullptr
; // Avoid compiler warning.
}
};
}
};
@@
-252,7
+250,7
@@
TEST(SCCIteratorTest, AllSmallGraphs) {
typedef Graph<NUM_NODES> GT;
/// Enumerate all graphs using NUM_GRAPHS bits.
typedef Graph<NUM_NODES> GT;
/// Enumerate all graphs using NUM_GRAPHS bits.
-
assert(NUM_GRAPHS < sizeof(unsigned) * CHAR_BIT &&
"Too many graphs!");
+
static_assert(NUM_GRAPHS < sizeof(unsigned) * CHAR_BIT,
"Too many graphs!");
for (unsigned GraphDescriptor = 0; GraphDescriptor < (1U << NUM_GRAPHS);
++GraphDescriptor) {
GT G;
for (unsigned GraphDescriptor = 0; GraphDescriptor < (1U << NUM_GRAPHS);
++GraphDescriptor) {
GT G;
@@
-277,7
+275,7
@@
TEST(SCCIteratorTest, AllSmallGraphs) {
GT::NodeSubset NodesInSomeSCC;
for (scc_iterator<GT> I = scc_begin(G), E = scc_end(G); I != E; ++I) {
GT::NodeSubset NodesInSomeSCC;
for (scc_iterator<GT> I = scc_begin(G), E = scc_end(G); I != E; ++I) {
-
std::vector<GT::NodeType
*> &SCC = *I;
+
const std::vector<GT::NodeType
*> &SCC = *I;
// Get the nodes in this SCC as a NodeSubset rather than a vector.
GT::NodeSubset NodesInThisSCC;
// Get the nodes in this SCC as a NodeSubset rather than a vector.
GT::NodeSubset NodesInThisSCC;