HomeSort by relevance Sort by last modified time
    Searched refs:findLeader (Results 1 - 25 of 40) sorted by null

1 2

  /external/llvm/unittests/ADT/
IntEqClassesTest.cpp 25 EXPECT_EQ(0u, ec.findLeader(0));
26 EXPECT_EQ(0u, ec.findLeader(1));
27 EXPECT_EQ(2u, ec.findLeader(2));
28 EXPECT_EQ(2u, ec.findLeader(3));
29 EXPECT_EQ(4u, ec.findLeader(4));
30 EXPECT_EQ(4u, ec.findLeader(5));
31 EXPECT_EQ(6u, ec.findLeader(6));
32 EXPECT_EQ(6u, ec.findLeader(7));
33 EXPECT_EQ(8u, ec.findLeader(8));
34 EXPECT_EQ(9u, ec.findLeader(9))
    [all...]
  /external/swiftshader/third_party/LLVM/unittests/ADT/
IntEqClassesTest.cpp 25 EXPECT_EQ(0u, ec.findLeader(0));
26 EXPECT_EQ(0u, ec.findLeader(1));
27 EXPECT_EQ(2u, ec.findLeader(2));
28 EXPECT_EQ(2u, ec.findLeader(3));
29 EXPECT_EQ(4u, ec.findLeader(4));
30 EXPECT_EQ(4u, ec.findLeader(5));
31 EXPECT_EQ(6u, ec.findLeader(6));
32 EXPECT_EQ(6u, ec.findLeader(7));
33 EXPECT_EQ(8u, ec.findLeader(8));
34 EXPECT_EQ(9u, ec.findLeader(9))
    [all...]
  /external/llvm/include/llvm/ADT/
IntEqClasses.h 57 /// findLeader(a) == findLeader(b). This requires an uncompressed map.
61 /// findLeader - Compute the leader of a's equivalence class. This is the
64 unsigned findLeader(unsigned a) const;
EquivalenceClasses.h 167 member_iterator MI = findLeader(V);
176 member_iterator MI = findLeader(insert(V));
200 /// findLeader - Given a value in the set, return a member iterator for the
205 member_iterator findLeader(iterator I) const {
209 member_iterator findLeader(const ElemTy &V) const {
210 return findLeader(TheMapping.find(V));
218 return unionSets(findLeader(V1I), findLeader(V2I));
  /external/swiftshader/third_party/LLVM/include/llvm/ADT/
IntEqClasses.h 57 /// findLeader(a) == findLeader(b).
61 /// findLeader - Compute the leader of a's equivalence class. This is the
64 unsigned findLeader(unsigned a) const;
EquivalenceClasses.h 164 member_iterator MI = findLeader(V);
173 member_iterator MI = findLeader(insert(V));
197 /// findLeader - Given a value in the set, return a member iterator for the
202 member_iterator findLeader(iterator I) const {
206 member_iterator findLeader(const ElemTy &V) const {
207 return findLeader(TheMapping.find(V));
215 return unionSets(findLeader(V1I), findLeader(V2I));
  /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/ADT/
IntEqClasses.h 57 /// findLeader(a) == findLeader(b). This requires an uncompressed map.
61 /// findLeader - Compute the leader of a's equivalence class. This is the
64 unsigned findLeader(unsigned a) const;
EquivalenceClasses.h 171 member_iterator MI = findLeader(V);
180 member_iterator MI = findLeader(insert(V));
203 /// findLeader - Given a value in the set, return a member iterator for the
208 member_iterator findLeader(iterator I) const {
212 member_iterator findLeader(const ElemTy &V) const {
213 return findLeader(TheMapping.find(V));
220 return unionSets(findLeader(V1I), findLeader(V2I));
  /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/ADT/
IntEqClasses.h 57 /// findLeader(a) == findLeader(b). This requires an uncompressed map.
61 /// findLeader - Compute the leader of a's equivalence class. This is the
64 unsigned findLeader(unsigned a) const;
EquivalenceClasses.h 171 member_iterator MI = findLeader(V);
180 member_iterator MI = findLeader(insert(V));
203 /// findLeader - Given a value in the set, return a member iterator for the
208 member_iterator findLeader(iterator I) const {
212 member_iterator findLeader(const ElemTy &V) const {
213 return findLeader(TheMapping.find(V));
220 return unionSets(findLeader(V1I), findLeader(V2I));
  /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/ADT/
IntEqClasses.h 57 /// findLeader(a) == findLeader(b). This requires an uncompressed map.
61 /// findLeader - Compute the leader of a's equivalence class. This is the
64 unsigned findLeader(unsigned a) const;
EquivalenceClasses.h 171 member_iterator MI = findLeader(V);
180 member_iterator MI = findLeader(insert(V));
203 /// findLeader - Given a value in the set, return a member iterator for the
208 member_iterator findLeader(iterator I) const {
212 member_iterator findLeader(const ElemTy &V) const {
213 return findLeader(TheMapping.find(V));
220 return unionSets(findLeader(V1I), findLeader(V2I));
  /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/
IntEqClasses.h 57 /// findLeader(a) == findLeader(b). This requires an uncompressed map.
61 /// findLeader - Compute the leader of a's equivalence class. This is the
64 unsigned findLeader(unsigned a) const;
EquivalenceClasses.h 171 member_iterator MI = findLeader(V);
180 member_iterator MI = findLeader(insert(V));
203 /// findLeader - Given a value in the set, return a member iterator for the
208 member_iterator findLeader(iterator I) const {
212 member_iterator findLeader(const ElemTy &V) const {
213 return findLeader(TheMapping.find(V));
220 return unionSets(findLeader(V1I), findLeader(V2I));
  /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/ADT/
IntEqClasses.h 57 /// findLeader(a) == findLeader(b). This requires an uncompressed map.
61 /// findLeader - Compute the leader of a's equivalence class. This is the
64 unsigned findLeader(unsigned a) const;
EquivalenceClasses.h 171 member_iterator MI = findLeader(V);
180 member_iterator MI = findLeader(insert(V));
203 /// findLeader - Given a value in the set, return a member iterator for the
208 member_iterator findLeader(iterator I) const {
212 member_iterator findLeader(const ElemTy &V) const {
213 return findLeader(TheMapping.find(V));
220 return unionSets(findLeader(V1I), findLeader(V2I));
  /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/ADT/
IntEqClasses.h 57 /// findLeader(a) == findLeader(b). This requires an uncompressed map.
61 /// findLeader - Compute the leader of a's equivalence class. This is the
64 unsigned findLeader(unsigned a) const;
EquivalenceClasses.h 171 member_iterator MI = findLeader(V);
180 member_iterator MI = findLeader(insert(V));
203 /// findLeader - Given a value in the set, return a member iterator for the
208 member_iterator findLeader(iterator I) const {
212 member_iterator findLeader(const ElemTy &V) const {
213 return findLeader(TheMapping.find(V));
220 return unionSets(findLeader(V1I), findLeader(V2I));
  /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/ADT/
IntEqClasses.h 57 /// findLeader(a) == findLeader(b). This requires an uncompressed map.
61 /// findLeader - Compute the leader of a's equivalence class. This is the
64 unsigned findLeader(unsigned a) const;
EquivalenceClasses.h 171 member_iterator MI = findLeader(V);
180 member_iterator MI = findLeader(insert(V));
203 /// findLeader - Given a value in the set, return a member iterator for the
208 member_iterator findLeader(iterator I) const {
212 member_iterator findLeader(const ElemTy &V) const {
213 return findLeader(TheMapping.find(V));
220 return unionSets(findLeader(V1I), findLeader(V2I));
  /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/
IntEqClasses.h 57 /// findLeader(a) == findLeader(b). This requires an uncompressed map.
61 /// findLeader - Compute the leader of a's equivalence class. This is the
64 unsigned findLeader(unsigned a) const;
EquivalenceClasses.h 171 member_iterator MI = findLeader(V);
180 member_iterator MI = findLeader(insert(V));
203 /// findLeader - Given a value in the set, return a member iterator for the
208 member_iterator findLeader(iterator I) const {
212 member_iterator findLeader(const ElemTy &V) const {
213 return findLeader(TheMapping.find(V));
220 return unionSets(findLeader(V1I), findLeader(V2I));
  /external/llvm/lib/Transforms/Instrumentation/
MaximumSpanningTree.h 91 if (Forest.findLeader(e.first) != Forest.findLeader(e.second)) {
  /external/swiftshader/third_party/LLVM/lib/Transforms/Instrumentation/
MaximumSpanningTree.h 88 if (Forest.findLeader(e.first) != Forest.findLeader(e.second)) {
  /external/llvm/lib/Support/
IntEqClasses.cpp 53 unsigned IntEqClasses::findLeader(unsigned a) const {
54 assert(NumClasses == 0 && "findLeader() called after compress().");

Completed in 469 milliseconds

1 2