/external/srec/tools/thirdparty/OpenFst/fst/lib/ |
H A D | relabel.h | 62 !siter.Done(); siter.Next()) { 65 !aiter.Done(); aiter.Next()) { 110 syms_iter.Next()) { 120 syms_iter.Next()) { 209 syms_iter.Next()) { 219 syms_iter.Next()) { 274 for (ArcIterator<Fst<A> > aiter(*fst_, s); !aiter.Done(); aiter.Next()) { 420 void Next() { function in class:fst::StateIterator 423 siter_.Next();
|
H A D | symbol-table.h | 354 void Next(void) { function in class:fst::SymbolTableIterator
|
/external/webrtc/src/system_wrappers/source/ |
H A D | list_unittest.cc | 59 ListItem* Next(ListItem* item) const { function in class:ListWrapperSimple 60 return list_.Next(item); 304 list_item = list->Next(list_item); 331 lhs_item = lhs->Next(lhs_item); 332 rhs_item = rhs->Next(rhs_item); 366 // Reverse the reversed list using PushFront and Next. 368 item = list_to_reverse->Next(item)) { 420 item = interleave_list->Next(item); 466 item = interleave_list->Next(item);
|
/external/chromium_org/media/video/capture/win/ |
H A D | pin_base_win.cc | 45 STDMETHOD(Next)(ULONG count, AM_MEDIA_TYPE** types, ULONG* fetched) { function in class:media::FINAL
|
/external/chromium_org/third_party/libvpx/source/libvpx/test/ |
H A D | encode_test_driver.h | 55 const vpx_codec_cx_pkt_t *Next() { function in class:libvpx_test::CxDataIterator
|
/external/chromium_org/third_party/mesa/src/src/egl/main/ |
H A D | egldisplay.h | 79 _EGLResource *Next; member in struct:_egl_resource 123 _EGLDisplay *Next; member in struct:_egl_display
|
/external/chromium_org/third_party/protobuf/src/google/protobuf/io/ |
H A D | coded_stream_unittest.cc | 224 virtual bool Next(const void** data, int* size) { function in class:google::protobuf::io::__anon14840::In 1129 bool Next(const void** data, int* size) { function in class:google::protobuf::io::__anon14840::ReallyBigInputStream
|
/external/chromium_org/third_party/sfntly/cpp/src/sfntly/table/bitmap/ |
H A D | bitmap_size_table.cc | 379 info.Attach(it->Next()); 503 BitmapGlyphInfo* BitmapSizeTable::Builder::BitmapGlyphInfoIterator::Next() { function in class:sfntly::BitmapSizeTable::Builder::BitmapGlyphInfoIterator 508 return Next(sub_table_glyph_info_iter_); 558 BitmapGlyphInfo* BitmapSizeTable::Builder::BitmapGlyphInfoIterator::Next( function in class:sfntly::BitmapSizeTable::Builder::BitmapGlyphInfoIterator 566 return it->Next(); 573 return it->Next(); 580 return it->Next(); 587 return it->Next(); 594 return it->Next();
|
/external/chromium_org/third_party/tcmalloc/chromium/src/base/ |
H A D | low_level_alloc.cc | 75 // Next two fields: in unallocated blocks: freelist skiplist data 361 static AllocList *Next(int i, AllocList *prev, LowLevelAlloc::Arena *arena) { function 362 RAW_CHECK(i < prev->levels, "too few levels in Next()"); 366 "bad magic number in Next()"); 368 "bad arena pointer in Next()"); 447 while ((s = Next(i, before, arena)) != 0 && s->header.size < req_rnd) {
|
/external/chromium_org/third_party/tcmalloc/chromium/src/ |
H A D | thread_cache.h | 212 void* Next() { function in class:tcmalloc::ThreadCache::FreeList 382 ASSERT(ptr != list->Next());
|
/external/chromium_org/third_party/tcmalloc/vendor/src/base/ |
H A D | low_level_alloc.cc | 75 // Next two fields: in unallocated blocks: freelist skiplist data 361 static AllocList *Next(int i, AllocList *prev, LowLevelAlloc::Arena *arena) { function 362 RAW_CHECK(i < prev->levels, "too few levels in Next()"); 366 "bad magic number in Next()"); 368 "bad arena pointer in Next()"); 447 while ((s = Next(i, before, arena)) != 0 && s->header.size < req_rnd) {
|
/external/chromium_org/third_party/webrtc/base/ |
H A D | fileutils_mock.h | 80 virtual bool Next() { function in class:rtc::FakeDirectoryIterator
|
/external/clang/lib/Format/ |
H A D | ContinuationIndenter.cpp | 35 while (End->Next && !End->Next->CanBreakBefore) { 36 End = End->Next; 335 const FormatToken *Next = Previous.MatchingParen->getNextNonComment(); local 336 HasTrailingCall = Next && Next->isMemberAccess(); 499 if (Current.is(tok::identifier) && Current.Next && 500 Current.Next->Type == TT_DictLiteral) 606 // Next(...) 657 State.NextToken = State.NextToken->Next; [all...] |
/external/clang/lib/StaticAnalyzer/Core/ |
H A D | ExprEngineCXX.cpp | 118 CFGElement Next = (*B)[NextStmtIdx]; local 122 while (Next.getAs<CFGImplicitDtor>() && NextStmtIdx + 1 < B->size()) { 124 Next = (*B)[NextStmtIdx]; 128 if (Optional<CFGStmt> StmtElem = Next.getAs<CFGStmt>()) { 142 if (Optional<CFGInitializer> InitElem = Next.getAs<CFGInitializer>()) {
|
/external/clang/test/CXX/class.access/class.friend/ |
H A D | p1.cpp | 130 X *Next; member in class:test2::ilist_node 131 X *getNext() { return Next; } // expected-note {{declared private here}}
|
/external/clang/test/CXX/temp/temp.decls/temp.variadic/ |
H A D | example-bind.cpp | 140 typedef get_impl<I-1, tuple<Values...> > Next; typedef in class:get_impl 142 static RJ get(tuple<Head, Values...>& t) { return Next::get(t.tail()); } 143 static PJ get(const tuple<Head, Values...>& t) { return Next::get(t.tail()); }
|
/external/compiler-rt/lib/sanitizer_common/ |
H A D | sanitizer_procmaps_linux.cc | 160 bool MemoryMappingLayout::Next(uptr *start, uptr *end, uptr *offset, function in class:__sanitizer::MemoryMappingLayout 251 Next(&cur_beg, &cur_end, &cur_offset, module_name.data(),
|
/external/libvpx/libvpx/test/ |
H A D | encode_test_driver.h | 55 const vpx_codec_cx_pkt_t *Next() { function in class:libvpx_test::CxDataIterator
|
/external/llvm/include/llvm/ADT/ |
H A D | SparseMultiSet.h | 85 /// circular in Prev indices, and INVALID-terminated in Next indices. This 94 unsigned Next; member in struct:llvm::SparseMultiSet::SMSNode 96 SMSNode(ValueT D, unsigned P, unsigned N) : Data(D), Prev(P), Next(N) { } 100 return Next == INVALID; 157 unsigned addValue(const ValueT& V, unsigned Prev, unsigned Next) { argument 159 Dense.push_back(SMSNode(V, Prev, Next)); 165 unsigned NextFree = Dense[Idx].Next; 168 Dense[Idx] = SMSNode(V, Prev, Next); 177 Dense[Idx].Next = FreelistIdx; 241 unsigned Next() cons function in class:llvm::SparseMultiSet::iterator_base [all...] |
/external/llvm/lib/CodeGen/ |
H A D | Analysis.cpp | 419 /// Find the first non-empty, scalar-like type in Next and setup the iterator 422 /// Assuming Next is an aggregate of some kind, this function will traverse the 426 /// For example, if Next was {[0 x i64], {{}, i32, {}}, i32} then we would setup 427 /// Path as [1, 1] and SubTypes as [Next, {{}, i32, {}}] to represent the first 429 static bool firstRealType(Type *Next, argument 435 while (Next->isAggregateType() && 436 indexReallyValid(cast<CompositeType>(Next), 0)) { 437 SubTypes.push_back(cast<CompositeType>(Next)); 439 Next = cast<CompositeType>(Next) [all...] |
H A D | ShadowStackGC.cpp | 102 IRBuilder<> *Next() { function in class:__anon25820::EscapeEnumerator 286 // ShadowStackEntry *Next; // Caller's stack entry. 434 while (IRBuilder<> *AtExit = EE.Next()) {
|
/external/llvm/lib/Transforms/Scalar/ |
H A D | DeadStoreElimination.cpp | 532 if (!NextInst) // Next instruction deleted. 684 Instruction *Next = std::next(BasicBlock::iterator(Dependency)); local 696 Dep = MD->getPointerDependencyFrom(Loc, false, Next, BB);
|
/external/llvm/tools/llvm-diff/ |
H A D | DifferenceEngine.cpp | 498 DiffEntry *Next = Paths2.data(); local 515 Next[0] = Cur[0]; 516 Next[0].Cost += RightCost; 517 Next[0].Path.push_back(DC_right); 522 Next[Index] = Cur[Index-1]; 523 Next[Index].Cost += MatchCost; 524 Next[Index].Path.push_back(DC_match); 526 } else if (Next[Index-1].Cost <= Cur[Index].Cost) { 527 Next[Index] = Next[Inde [all...] |
/external/mesa3d/src/egl/main/ |
H A D | egldisplay.h | 79 _EGLResource *Next; member in struct:_egl_resource 123 _EGLDisplay *Next; member in struct:_egl_display
|
/external/openfst/src/include/fst/ |
H A D | const-fst.h | 168 siter.Next()) { 173 aiter.Next()) 189 aiter.Next()) { 358 for (StateIterator<F> siter(fst); !siter.Done(); siter.Next()) { 384 for (StateIterator<F> siter(fst); !siter.Done(); siter.Next()) { 399 for (StateIterator<F> siter(fst); !siter.Done(); siter.Next()) { 401 for (ArcIterator<F> aiter(fst, s); !aiter.Done(); aiter.Next()) { 442 void Next() { ++s_; } function in class:fst::StateIterator 470 void Next() { ++i_; } function in class:fst::ArcIterator
|