| /external/v8/src/crankshaft/ |
| D | lithium-inl.h | 41 bool TempIterator::Done() { return current_ >= limit_; } in Done() function
45 DCHECK(!Done()); in Current()
67 bool InputIterator::Done() { return current_ >= limit_; } in Done() function
71 DCHECK(!Done()); in Current()
96 bool UseIterator::Done() { in Done() function
97 return input_iterator_.Done() && env_iterator_.Done(); in Done()
102 DCHECK(!Done()); in Current()
103 LOperand* result = input_iterator_.Done() ? env_iterator_.Current() in Current()
111 input_iterator_.Done() ? env_iterator_.Advance() : input_iterator_.Advance(); in Advance()
|
| D | hydrogen-infer-representation.cc | 42 for (HUseIterator it(phi->uses()); !it.Done(); it.Advance()) { in Run()
65 !it.Done(); in Run()
78 !it.Done(); in Run()
87 !it.Done(); in Run()
107 !it.Done(); in Run()
123 for (HInstructionIterator it(block); !it.Done(); it.Advance()) { in Run()
147 for (HInstructionIterator it(block); !it.Done(); it.Advance()) { in Run()
|
| /external/openfst/src/include/fst/ |
| D | equal.h | 43 while (!siter1.Done() || !siter2.Done()) {
44 if (siter1.Done() || siter2.Done()) {
67 for (size_t a = 0; !aiter1.Done() || !aiter2.Done(); ++a) {
68 if (aiter1.Done() || aiter2.Done()) {
|
| D | sparse-tuple-weight.h | 91 for (SparseTupleWeightIterator<W, K> it(w); !it.Done(); it.Next()) { in SparseTupleWeight()
126 for (SparseTupleWeightIterator<W, K> it(w); !it.Done(); it.Next()) {
134 for (SparseTupleWeightIterator<W, K> it(*this); !it.Done(); it.Next()) { in Member()
144 for (SparseTupleWeightIterator<W, K> it(*this); !it.Done(); it.Next()) { in Hash()
153 for (SparseTupleWeightIterator<W, K> it(*this); !it.Done(); it.Next()) {
161 for (SparseTupleWeightIterator<W, K> it(*this); !it.Done(); it.Next()) { in Reverse()
236 bool Done() const { in Done() function
277 while (!w1_it.Done() || !w2_it.Done()) { in SparseTupleWeightMap()
278 const K& k1 = (w1_it.Done()) ? w2_it.Value().first : w1_it.Value().first; in SparseTupleWeightMap()
279 const K& k2 = (w2_it.Done()) ? w1_it.Value().first : w2_it.Value().first; in SparseTupleWeightMap()
[all …]
|
| D | string-weight.h | 171 bool Done() const { in Done() function
206 bool Done() const { return fin_; } in Done() function
250 for (StringWeightIterator<L, S> iter(*this); !iter.Done(); iter.Next()) { in Write()
269 for (StringWeightIterator<L, S> iter(*this); !iter.Done(); iter.Next()) in Reverse()
277 for (StringWeightIterator<L, S> iter(*this); !iter.Done(); iter.Next()) in Hash()
304 for (; !iter1.Done() ; iter1.Next(), iter2.Next())
327 if (iter.Done())
334 for (size_t i = 0; !iter.Done(); ++i, iter.Next()) {
405 for (; !iter1.Done() && !iter2.Done() && iter1.Value() == iter2.Value(); in Plus()
426 for (; !iter1.Done() && !iter2.Done() && iter1.Value() == iter2.Value(); in Plus()
[all …]
|
| D | rmfinalepsilon.h | 52 for (StateIterator<Fst<A> > siter(*fst); !siter.Done(); siter.Next()) { in RmFinalEpsilon()
56 for (ArcIterator<Fst<A> > aiter(*fst, s); !aiter.Done(); aiter.Next()) { in RmFinalEpsilon()
71 for (StateIterator<Fst<A> > siter(*fst); !siter.Done(); siter.Next()) { in RmFinalEpsilon()
76 for (ArcIterator<Fst<A> > aiter(*fst, s); !aiter.Done(); aiter.Next()) { in RmFinalEpsilon()
|
| D | matcher.h | 117 bool Done() const { return Done_(); } in Done() function
259 bool Done() const { in Done() function
262 if (aiter_->Done()) in Done()
302 virtual bool Done_() const { return Done(); } in Done_()
361 for (aiter_->Reset(); !aiter_->Done(); aiter_->Next()) { in Search()
471 bool Done() const { return matcher_->Done(); } in Done() function
507 virtual bool Done_() const { return Done(); } in Done_()
647 bool Done() const { in Done() function
648 return matcher_->Done(); in Done()
672 if (matcher_->Done() && has_sigma_ && (sigma_match_ == kNoLabel) && in Next()
[all …]
|
| D | symbol-table-ops.h | 43 for (; !siter.Done(); siter.Next()) { in PruneSymbolTable()
45 for (; !aiter.Done(); aiter.Next()) { in PruneSymbolTable()
52 for (SymbolTableIterator stiter(syms); !stiter.Done(); stiter.Next()) { in PruneSymbolTable()
|
| D | relabel.h | 75 !siter.Done(); siter.Next()) { in Relabel()
78 !aiter.Done(); aiter.Next()) { in Relabel()
146 for (SymbolTableIterator syms_iter(*old_isymbols); !syms_iter.Done(); in Relabel()
159 for (SymbolTableIterator syms_iter(*old_osymbols); !syms_iter.Done(); in Relabel()
256 for (SymbolTableIterator syms_iter(*old_isymbols); !syms_iter.Done(); in RelabelFstImpl()
266 for (SymbolTableIterator syms_iter(*old_osymbols); !syms_iter.Done(); in RelabelFstImpl()
344 for (ArcIterator<Fst<A> > aiter(*fst_, s); !aiter.Done(); aiter.Next()) { in Expand()
471 bool Done() const { return siter_.Done(); } in Done() function
476 if (!siter_.Done()) { in Next()
488 bool Done_() const { return Done(); } in Done_()
|
| D | lookahead-matcher.h | 208 bool Done() const { return matcher_.Done(); } in Done() function
230 virtual bool Done_() const { return Done(); } in Done_()
292 bool Done() const { return matcher_.Done(); } in Done() function
322 virtual bool Done_() const { return Done(); } in Done_()
363 for (; !matcher_.Done(); matcher_.Next()) in LookAheadFst()
368 !aiter.Done(); in LookAheadFst()
394 for (; !matcher_.Done(); matcher_.Next()) { in LookAheadFst()
497 bool Done() const { return matcher_.Done(); } in Done() function
563 virtual bool Done_() const { return Done(); } in Done_()
739 bool Done() const { return base_->Done(); } in Done() function
|
| D | reweight.h | 69 for (; !sit.Done(); sit.Next()) { in Reweight()
76 !ait.Done(); in Reweight()
100 for (; !sit.Done(); sit.Next()) { in Reweight()
112 !ait.Done(); in Reweight()
|
| D | complement.h | 201 bool Done() const { return s_ > 0 && siter_.Done(); } in Done() function
220 virtual bool Done_() const { return Done(); } in Done_()
248 bool Done() const { in Done() function
250 return pos_ > 0 && aiter_->Done(); in Done()
305 virtual bool Done_() const { return Done(); } in Done_()
|
| D | minimize.h | 88 !aiter1.Done() && !aiter2.Done(); aiter1.Next(), aiter2.Next()) { in operator()
194 for (siter.Next(); !siter.Done(); siter.Next()) { in PrePartition()
236 !siter.Done(); siter.Next()) { in Split()
248 if (aiter->Done()) { in Split()
265 if (aiter->Done()) in Split()
418 for (siter.Next(); !siter.Done(); siter.Next()) { in Refine()
428 for (siter.Reset(); !siter.Done();) { in Refine()
467 !siter.Done(); siter.Next()) { in MergeStates()
470 !aiter.Done(); aiter.Next()) { in MergeStates()
|
| /external/llvm/lib/IR/ |
| D | Use.cpp | 58 ptrdiff_t Done = 0; in initTags() local
59 while (Done < 20) { in initTags()
67 new (Stop) Use(tags[Done++]); in initTags()
70 ptrdiff_t Count = Done; in initTags()
75 ++Done; in initTags()
76 Count = Done; in initTags()
80 ++Done; in initTags()
|
| /external/openfst/src/include/fst/extensions/far/ |
| D | equal.h | 58 for(; !reader1->Done() && !reader2->Done();
82 if (!reader1->Done() || !reader2->Done()) {
84 << (reader1->Done() ? reader2->GetKey() : reader1->GetKey())
85 << "\" missing form " << (reader2->Done() ? "first" : "second")
|
| /external/libvpx/libvpx/vp9/common/ |
| D | vp9_mvref_common.c | 49 refmv_count, mv_ref_list, Done); in find_mv_refs_idx()
52 refmv_count, mv_ref_list, Done); in find_mv_refs_idx()
67 ADD_MV_REF_LIST(candidate->mv[0], refmv_count, mv_ref_list, Done); in find_mv_refs_idx()
69 ADD_MV_REF_LIST(candidate->mv[1], refmv_count, mv_ref_list, Done); in find_mv_refs_idx()
91 ADD_MV_REF_LIST(prev_frame_mvs->mv[0], refmv_count, mv_ref_list, Done); in find_mv_refs_idx()
93 ADD_MV_REF_LIST(prev_frame_mvs->mv[1], refmv_count, mv_ref_list, Done); in find_mv_refs_idx()
109 refmv_count, mv_ref_list, Done); in find_mv_refs_idx()
124 ADD_MV_REF_LIST(mv, refmv_count, mv_ref_list, Done); in find_mv_refs_idx()
136 ADD_MV_REF_LIST(mv, refmv_count, mv_ref_list, Done); in find_mv_refs_idx()
140 Done: in find_mv_refs_idx()
|
| D | vp9_mvref_common.h | 161 #define ADD_MV_REF_LIST(mv, refmv_count, mv_ref_list, Done) \ argument
166 goto Done; \
176 mv_ref_list, Done) \ argument
181 refmv_count, mv_ref_list, Done); \
186 refmv_count, mv_ref_list, Done); \
|
| /external/libchrome/base/metrics/ |
| D | sample_map.cc | 50 for (; !iter->Done(); iter->Next()) { in AddSubtractImpl()
68 bool SampleMapIterator::Done() const { in Done() function in base::SampleMapIterator
73 DCHECK(!Done()); in Next()
79 DCHECK(!Done()); in Get()
89 while (!Done() && iter_->second == 0) { in SkipEmptyBuckets()
|
| D | sample_vector.cc | 81 while (index < counts_size_ && !iter->Done()) { in AddSubtractImpl()
101 return iter->Done(); in AddSubtractImpl()
156 bool SampleVectorIterator::Done() const { in Done() function in base::SampleVectorIterator
161 DCHECK(!Done()); in Next()
169 DCHECK(!Done()); in Get()
179 DCHECK(!Done()); in GetBucketIndex()
186 if (Done()) in SkipEmptyBuckets()
|
| D | histogram_samples.cc | 18 bool Done() const override;
39 bool SampleCountPickleIterator::Done() const { in Done() function in base::__anon2e1edf9c0111::SampleCountPickleIterator
44 DCHECK(!Done()); in Next()
54 DCHECK(!Done()); in Get()
141 !it->Done(); in Serialize()
164 DCHECK(!Done()); in GetBucketIndex()
|
| D | sample_map_unittest.cc | 90 EXPECT_TRUE(it->Done()); in TEST()
109 EXPECT_FALSE(it->Done()); in TEST()
121 EXPECT_FALSE(it->Done()); in TEST()
129 EXPECT_TRUE(it->Done()); in TEST()
139 EXPECT_TRUE(it->Done()); in TEST()
150 EXPECT_FALSE(it->Done()); in TEST()
|
| /external/openfst/src/test/ |
| D | fst_test.h | 70 for (; !siter.Done(); siter.Next()) {} in TestBase()
71 for (siter.Reset(); !siter.Done(); siter.Next()) { in TestBase()
77 for (; !aiter.Done(); aiter.Next()) {} in TestBase()
78 for (aiter.Reset(); !aiter.Done(); aiter.Next()) { in TestBase()
114 !siter.Done(); in TestExpanded()
128 !siter.Done(); in TestMutable()
134 for (; !aiter.Done(); aiter.Next()) {} in TestMutable()
135 for (aiter.Reset(); !aiter.Done(); aiter.Next()) { in TestMutable()
156 !siter.Done(); in TestMutable()
|
| /external/llvm/test/Transforms/SimplifyCFG/ |
| D | switch_thread.ll | 15 i32 17, label %Done
32 br i1 %cond2, label %Done, label %C
37 br i1 %cond, label %Done, label %C
38 Done: ; preds = %B, %A, %A2, %0
44 br i1 %cond3, label %Done, label %C
|
| /external/llvm/test/Transforms/ADCE/ |
| D | 2003-11-16-MissingPostDominanceInfo.ll | 6 br i1 %C, label %Cond, label %Done
9 br i1 %C, label %Loop, label %Done
15 Done: ; preds = %Cond, %0
|
| /external/openfst/src/include/fst/extensions/pdt/ |
| D | paren.h | 98 bool Done() const { in Done() function
241 !aiter.Done(); in DFSearch()
253 !set_iter.Done(); set_iter.Next()) { in DFSearch()
256 !paren_arc_iter.Done(); in DFSearch()
280 !aiter.Done(); in ComputeStateSet()
291 !set_iter.Done(); set_iter.Next()) { in ComputeStateSet()
294 !paren_arc_iter.Done(); in ComputeStateSet()
334 !paren_iter.Done(); paren_iter.Next()) { in UpdateStateSet()
338 !set_iter.Done(); set_iter.Next()) { in UpdateStateSet()
479 !set_iter.Done(); set_iter.Next()) { in Reverse()
|