Home
last modified time | relevance | path

Searched refs:find_first (Results 1 – 25 of 32) sorted by relevance

12

/external/marisa-trie/tools/
Dmarisa-find.cc56 void find_first(const marisa::Trie &trie, const std::string &str) { in find_first() function
58 const marisa::UInt32 key_id = trie.find_first(str, &length); in find_first()
117 find_first(trie, str); in find()
/external/marisa-trie/v0_1_5/tools/
Dmarisa_alpha-find.cc56 void find_first(const marisa_alpha::Trie &trie, const std::string &str) { in find_first() function
58 const marisa_alpha::UInt32 key_id = trie.find_first(str, &length); in find_first()
117 find_first(trie, str); in find()
/external/marisa-trie/tests/
Dtrie-test.cc127 ASSERT(trie.find_first("ap") == trie.notfound()); in TestTrie()
128 ASSERT(trie.find_first("applex") == trie["app"]); in TestTrie()
325 ASSERT(trie.find_first("ca") == trie.notfound()); in TestPrefixTrie()
326 ASSERT(trie.find_first("car") == trie["car"]); in TestPrefixTrie()
327 ASSERT(trie.find_first("card", &length) == trie["car"]); in TestPrefixTrie()
529 ASSERT(trie.find_first("") == 0); in TestEmptyString()
530 ASSERT(trie.find_first("x") == 0); in TestEmptyString()
/external/llvm/unittests/ADT/
DBitVectorTest.cpp77 for (unsigned i = Vec.find_first(); i != -1u; i = Vec.find_next(i)) { in TYPED_TEST()
96 EXPECT_TRUE(Vec.find_first() == 3); in TYPED_TEST()
107 for (unsigned i = Vec.find_first(); i != -1u; i = Vec.find_next(i)) { in TYPED_TEST()
398 EXPECT_EQ(50, C.find_first()); in TYPED_TEST()
/external/marisa-trie/v0_1_5/tests/
Dtrie-test.cc129 ASSERT(trie.find_first("ap") == trie.notfound()); in TestTrie()
130 ASSERT(trie.find_first("applex") == trie["app"]); in TestTrie()
327 ASSERT(trie.find_first("ca") == trie.notfound()); in TestPrefixTrie()
328 ASSERT(trie.find_first("car") == trie["car"]); in TestPrefixTrie()
329 ASSERT(trie.find_first("card", &length) == trie["car"]); in TestPrefixTrie()
547 ASSERT(trie.find_first("") == 0); in TestEmptyString()
548 ASSERT(trie.find_first("x") == 0); in TestEmptyString()
/external/llvm/include/llvm/ADT/
DSparseBitVector.h132 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();
DSmallBitVector.h213 int find_first() const { in find_first() function
220 return getPointer()->find_first(); in find_first()
DBitVector.h156 int find_first() const { in find_first() function
/external/llvm/lib/CodeGen/
DRegisterScavenging.cpp59 for (int I = PR.find_first(); I>0; I = PR.find_next(I)) in initRegState()
296 int Survivor = Candidates.find_first(); in findSurvivorReg()
345 Survivor = Candidates.find_first(); in findSurvivorReg()
DSpillPlacement.cpp304 for (int n = ActiveNodes->find_first(); n>=0; n = ActiveNodes->find_next(n)) { in scanActiveBundles()
384 for (int n = ActiveNodes->find_first(); n>=0; n = ActiveNodes->find_next(n)) in finish()
DStackSlotColoring.cpp214 NextColor = AllColors.find_first(); in InitializeSlots()
237 Color = UsedColors.find_first(); in ColorSlot()
DStackColoring.cpp410 for (int pos = MBBLiveness.LiveIn.find_first(); pos != -1; in calculateLiveIntervals()
414 for (int pos = MBBLiveness.LiveOut.find_first(); pos != -1; in calculateLiveIntervals()
DAggressiveAntiDepBreaker.cpp131 DEBUG(for (int r = CriticalPathSet.find_first(); r != -1; in AggressiveAntiDepBreaker()
575 DEBUG(for (int r = BV.find_first(); r != -1; r = BV.find_next(r)) in FindSuitableFreeRegisters()
/external/llvm/lib/Target/Mips/
DMips16InstrInfo.cpp373 Reg = Available.find_first(); in loadImmediate()
376 Reg = Candidates.find_first(); in loadImmediate()
389 SpReg = Available.find_first(); in loadImmediate()
391 SpReg = Candidates.find_first(); in loadImmediate()
/external/marisa-trie/lib/marisa/
Dtrie-c.cc215 *key_id = h->trie.find_first(ptr, key_length); in marisa_find_first()
217 *key_id = h->trie.find_first(ptr, length, key_length); in marisa_find_first()
Dtrie.h91 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,
Dtrie-inline.h42 inline UInt32 Trie::find_first(const std::string &str, in find_first() function
44 return find_first(str.c_str(), str.length(), key_length); in find_first()
Dtrie-search.cc114 UInt32 Trie::find_first(const char *str, in find_first() function in marisa::Trie
121 UInt32 Trie::find_first(const char *ptr, std::size_t length, in find_first() function in marisa::Trie
/external/llvm/lib/Transforms/Scalar/
DLoopRerollPass.cpp1041 dbgs() << "LRR: " << KV.second.find_first() << "\t" << *KV.first << "\n"; in validate()
1121 if (LastRootIt->second.find_first() < (int)Iter) in validate()
1260 unsigned I = Uses[&*J].find_first(); in replace()
1287 if (KV.second.find_first() == 0) in replace()
1293 if (Uses[BI].find_first() == IL_All) { in replace()
/external/marisa-trie/v0_1_5/lib/marisa_alpha/
Dtrie-c.cc242 *key_id = h->trie.find_first(ptr, key_length); in marisa_alpha_find_first()
244 *key_id = h->trie.find_first(ptr, length, key_length); in marisa_alpha_find_first()
Dtrie.h91 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,
Dtrie-inline.h42 inline UInt32 Trie::find_first(const std::string &str, in find_first() function
44 return find_first(str.c_str(), str.length(), key_length); in find_first()
Dtrie-search.cc117 UInt32 Trie::find_first(const char *str, in find_first() function in marisa_alpha::Trie
124 UInt32 Trie::find_first(const char *ptr, std::size_t length, in find_first() function in marisa_alpha::Trie
/external/llvm/lib/Analysis/
DDependenceAnalysis.cpp3002 for (int LI = Loops.find_first(); LI >= 0; LI = Loops.find_next(LI)) { in propagate()
3274 for (int VI = BV.find_first(); VI >= 0; VI = BV.find_next(VI)) { in dumpSmallBitVector()
3514 for (int SI = Separable.find_first(); SI >= 0; SI = Separable.find_next(SI)) { in depends()
3553 for (int SI = Coupled.find_first(); SI >= 0; SI = Coupled.find_next(SI)) { in depends()
3559 for (int SJ = Group.find_first(); SJ >= 0; SJ = Group.find_next(SJ)) { in depends()
3569 for (int SJ = Sivs.find_first(); SJ >= 0; SJ = Sivs.find_next(SJ)) { in depends()
3593 for (int SJ = Mivs.find_first(); SJ >= 0; SJ = Mivs.find_next(SJ)) { in depends()
3627 for (int SJ = Mivs.find_first(); SJ >= 0; SJ = Mivs.find_next(SJ)) { in depends()
3640 for (int SJ = Mivs.find_first(); SJ >= 0; SJ = Mivs.find_next(SJ)) { in depends()
3652 for (int SJ = ConstrainedLevels.find_first(); SJ >= 0; in depends()
[all …]
/external/llvm/lib/ProfileData/
DCoverageMapping.cpp367 int I = IsNotExpandedFile.find_first(); in findMainViewFileID()
378 int I = IsNotExpandedFile.find_first(); in findMainViewFileID()

12