/external/marisa-trie/tools/ |
H A D | marisa-find.cc | 56 void find_first(const marisa::Trie &trie, const std::string &str) { function in namespace:__anon11591 58 const marisa::UInt32 key_id = trie.find_first(str, &length); 117 find_first(trie, str);
|
/external/marisa-trie/v0_1_5/tools/ |
H A D | marisa_alpha-find.cc | 56 void find_first(const marisa_alpha::Trie &trie, const std::string &str) { function in namespace:__anon11604 58 const marisa_alpha::UInt32 key_id = trie.find_first(str, &length); 117 find_first(trie, str);
|
/external/llvm/unittests/ADT/ |
H A D | BitVectorTest.cpp | 77 for (unsigned i = Vec.find_first(); i != -1u; i = Vec.find_next(i)) { 96 EXPECT_TRUE(Vec.find_first() == 3); 107 for (unsigned i = Vec.find_first(); i != -1u; i = Vec.find_next(i)) { 398 EXPECT_EQ(50, C.find_first());
|
/external/llvm/include/llvm/ADT/ |
H A D | SparseBitVector.h | 131 /// find_first - Returns the index of the first set bit. 132 int find_first() const { 336 unsigned BitPos = Iter->find_first(); 368 NextSetBitNumber = Iter->find_first(); 772 int find_first() const { 776 return (First.index() * ElementSize) + First.find_first();
|
H A D | SmallBitVector.h | 211 /// find_first - Returns the index of the first set bit, -1 if none 213 int find_first() const { function in class:llvm::SmallBitVector 220 return getPointer()->find_first();
|
H A D | BitVector.h | 154 /// find_first - Returns the index of the first set bit, -1 if none 156 int find_first() const { function in class:llvm::BitVector
|
/external/marisa-trie/tests/ |
H A D | trie-test.cc | 127 ASSERT(trie.find_first("ap") == trie.notfound()); 128 ASSERT(trie.find_first("applex") == trie["app"]); 325 ASSERT(trie.find_first("ca") == trie.notfound()); 326 ASSERT(trie.find_first("car") == trie["car"]); 327 ASSERT(trie.find_first("card", &length) == trie["car"]); 529 ASSERT(trie.find_first("") == 0); 530 ASSERT(trie.find_first("x") == 0);
|
/external/marisa-trie/v0_1_5/tests/ |
H A D | trie-test.cc | 129 ASSERT(trie.find_first("ap") == trie.notfound()); 130 ASSERT(trie.find_first("applex") == trie["app"]); 327 ASSERT(trie.find_first("ca") == trie.notfound()); 328 ASSERT(trie.find_first("car") == trie["car"]); 329 ASSERT(trie.find_first("card", &length) == trie["car"]); 547 ASSERT(trie.find_first("") == 0); 548 ASSERT(trie.find_first("x") == 0);
|
/external/llvm/lib/CodeGen/ |
H A D | RegisterScavenging.cpp | 59 for (int I = PR.find_first(); I>0; I = PR.find_next(I)) 296 int Survivor = Candidates.find_first(); 345 Survivor = Candidates.find_first();
|
H A D | SpillPlacement.cpp | 304 for (int n = ActiveNodes->find_first(); n>=0; n = ActiveNodes->find_next(n)) { 384 for (int n = ActiveNodes->find_first(); n>=0; n = ActiveNodes->find_next(n))
|
H A D | StackSlotColoring.cpp | 214 NextColor = AllColors.find_first(); 237 Color = UsedColors.find_first();
|
H A D | StackColoring.cpp | 410 for (int pos = MBBLiveness.LiveIn.find_first(); pos != -1; 414 for (int pos = MBBLiveness.LiveOut.find_first(); pos != -1;
|
H A D | AggressiveAntiDepBreaker.cpp | 131 DEBUG(for (int r = CriticalPathSet.find_first(); r != -1; 575 DEBUG(for (int r = BV.find_first(); r != -1; r = BV.find_next(r))
|
/external/llvm/lib/Target/Mips/ |
H A D | Mips16InstrInfo.cpp | 373 Reg = Available.find_first(); 376 Reg = Candidates.find_first(); 389 SpReg = Available.find_first(); 391 SpReg = Candidates.find_first();
|
/external/marisa-trie/lib/marisa/ |
H A D | trie-c.cc | 215 *key_id = h->trie.find_first(ptr, key_length); 217 *key_id = h->trie.find_first(ptr, length, key_length);
|
H A D | trie-inline.h | 42 inline UInt32 Trie::find_first(const std::string &str, function in class:marisa::Trie 44 return find_first(str.c_str(), str.length(), key_length);
|
H A D | trie.h | 91 UInt32 find_first(const char *str, 93 UInt32 find_first(const char *ptr, std::size_t length, 95 UInt32 find_first(const std::string &str,
|
H A D | trie-search.cc | 114 UInt32 Trie::find_first(const char *str, function in class:marisa::Trie 121 UInt32 Trie::find_first(const char *ptr, std::size_t length, function in class:marisa::Trie
|
/external/marisa-trie/v0_1_5/lib/marisa_alpha/ |
H A D | trie-c.cc | 242 *key_id = h->trie.find_first(ptr, key_length); 244 *key_id = h->trie.find_first(ptr, length, key_length);
|
H A D | trie-inline.h | 42 inline UInt32 Trie::find_first(const std::string &str, function in class:marisa_alpha::Trie 44 return find_first(str.c_str(), str.length(), key_length);
|
H A D | trie.h | 91 UInt32 find_first(const char *str, 93 UInt32 find_first(const char *ptr, std::size_t length, 95 UInt32 find_first(const std::string &str,
|
H A D | trie-search.cc | 117 UInt32 Trie::find_first(const char *str, function in class:marisa_alpha::Trie 124 UInt32 Trie::find_first(const char *ptr, std::size_t length, function in class:marisa_alpha::Trie
|
/external/llvm/lib/Transforms/Scalar/ |
H A D | LoopRerollPass.cpp | 1041 dbgs() << "LRR: " << KV.second.find_first() << "\t" << *KV.first << "\n"; 1121 if (LastRootIt->second.find_first() < (int)Iter) 1260 unsigned I = Uses[&*J].find_first(); 1287 if (KV.second.find_first() == 0) 1293 if (Uses[BI].find_first() == IL_All) {
|
/external/llvm/lib/Analysis/ |
H A D | DependenceAnalysis.cpp | 3002 for (int LI = Loops.find_first(); LI >= 0; LI = Loops.find_next(LI)) { 3274 for (int VI = BV.find_first(); VI >= 0; VI = BV.find_next(VI)) { 3514 for (int SI = Separable.find_first(); SI >= 0; SI = Separable.find_next(SI)) { 3553 for (int SI = Coupled.find_first(); SI >= 0; SI = Coupled.find_next(SI)) { 3559 for (int SJ = Group.find_first(); SJ >= 0; SJ = Group.find_next(SJ)) { 3569 for (int SJ = Sivs.find_first(); SJ >= 0; SJ = Sivs.find_next(SJ)) { 3593 for (int SJ = Mivs.find_first(); SJ >= 0; SJ = Mivs.find_next(SJ)) { 3627 for (int SJ = Mivs.find_first(); SJ >= 0; SJ = Mivs.find_next(SJ)) { 3640 for (int SJ = Mivs.find_first(); SJ >= 0; SJ = Mivs.find_next(SJ)) { 3652 for (int SJ = ConstrainedLevels.find_first(); S [all...] |
/external/llvm/lib/ProfileData/ |
H A D | CoverageMapping.cpp | 367 int I = IsNotExpandedFile.find_first(); 378 int I = IsNotExpandedFile.find_first();
|