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

12

/external/marisa-trie/tools/
H A Dmarisa-find.cc56 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 Dmarisa_alpha-find.cc56 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 DBitVectorTest.cpp77 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 DSparseBitVector.h131 /// 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 DSmallBitVector.h211 /// 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 DBitVector.h154 /// 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 Dtrie-test.cc127 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 Dtrie-test.cc129 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 DRegisterScavenging.cpp59 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 DSpillPlacement.cpp304 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 DStackSlotColoring.cpp214 NextColor = AllColors.find_first();
237 Color = UsedColors.find_first();
H A DStackColoring.cpp410 for (int pos = MBBLiveness.LiveIn.find_first(); pos != -1;
414 for (int pos = MBBLiveness.LiveOut.find_first(); pos != -1;
H A DAggressiveAntiDepBreaker.cpp131 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 DMips16InstrInfo.cpp373 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 Dtrie-c.cc215 *key_id = h->trie.find_first(ptr, key_length);
217 *key_id = h->trie.find_first(ptr, length, key_length);
H A Dtrie-inline.h42 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 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,
H A Dtrie-search.cc114 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 Dtrie-c.cc242 *key_id = h->trie.find_first(ptr, key_length);
244 *key_id = h->trie.find_first(ptr, length, key_length);
H A Dtrie-inline.h42 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 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,
H A Dtrie-search.cc117 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 DLoopRerollPass.cpp1041 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 DDependenceAnalysis.cpp3002 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 DCoverageMapping.cpp367 int I = IsNotExpandedFile.find_first();
378 int I = IsNotExpandedFile.find_first();

Completed in 300 milliseconds

12