HomeSort by relevance Sort by last modified time
    Searched defs:Next (Results 126 - 150 of 371) sorted by null

1 2 3 4 56 7 8 91011>>

  /external/chromium_org/third_party/leveldatabase/src/table/
block.cc 46 // Helper routine: decode the next block entry starting at "p",
139 virtual void Next() {
237 // Decode next entry
  /external/chromium_org/third_party/libjingle/source/talk/base/
fileutils_mock.h 97 virtual bool Next() {
  /external/chromium_org/third_party/libvpx/source/libvpx/test/
encode_test_driver.h 55 const vpx_codec_cx_pkt_t *Next() {
resize_test.cc 108 virtual void Next() {
  /external/chromium_org/third_party/mesa/src/src/gallium/drivers/r300/compiler/
radeon_program.h 15 * next paragraph) shall be included in all copies or substantial
135 struct rc_instruction * Next;
153 * Instructions.Next points to the first instruction,
  /external/chromium_org/third_party/mesa/src/src/gallium/state_trackers/glx/xlib/
xm_api.h 349 struct xmesa_buffer *Next; /* Linked list pointer: */
  /external/chromium_org/third_party/protobuf/src/google/protobuf/io/
coded_stream_unittest.cc 224 virtual bool Next(const void** data, int* size) {
737 // Skip to end of buffer and peek -- should get next buffer.
796 // Skip to end of buffer and peek -- should get next buffer.
    [all...]
tokenizer_unittest.cc 129 bool Next(const void** data, int* size) {
139 return array_stream_.Next(data, size);
256 // Before Next() is called, the initial token should always be TYPE_START.
264 ASSERT_TRUE(tokenizer.Next());
277 EXPECT_FALSE(tokenizer.Next());
279 // After Next() returns false, the token should have type TYPE_END.
302 ASSERT_TRUE(tokenizer.Next());
305 ASSERT_TRUE(tokenizer.Next());
308 ASSERT_TRUE(tokenizer.Next());
311 ASSERT_TRUE(tokenizer.Next());
    [all...]
zero_copy_stream_impl.cc 89 bool FileInputStream::Next(const void** data, int* size) {
90 return impl_.Next(data, size);
192 bool FileOutputStream::Next(void** data, int* size) {
193 return impl_.Next(data, size);
279 bool IstreamInputStream::Next(const void** data, int* size) {
280 return impl_.Next(data, size);
323 bool OstreamOutputStream::Next(void** data, int* size) {
324 return impl_.Next(data, size);
359 bool ConcatenatingInputStream::Next(const void** data, int* size) {
361 if (streams_[0]->Next(data, size)) return true
    [all...]
  /external/chromium_org/third_party/sfntly/cpp/src/sfntly/table/bitmap/
bitmap_size_table.cc 379 info.Attach(it->Next());
503 BitmapGlyphInfo* BitmapSizeTable::Builder::BitmapGlyphInfoIterator::Next() {
508 return Next(sub_table_glyph_info_iter_);
558 BitmapGlyphInfo* BitmapSizeTable::Builder::BitmapGlyphInfoIterator::Next(
566 return it->Next();
573 return it->Next();
580 return it->Next();
587 return it->Next();
594 return it->Next();
index_sub_table_format4.cc 364 IndexSubTableFormat4::Builder::BitmapGlyphInfoIterator::Next() {
index_sub_table_format5.cc 332 IndexSubTableFormat5::Builder::BitmapGlyphInfoIterator::Next() {
  /external/chromium_org/third_party/sqlite/src/contrib/
sqlitecon.tcl 120 bind Sqlitecon <Down> {sqlitecon::Next %W}
121 bind Sqlitecon <Control-n> {sqlitecon::Next %W}
409 # Change the line to the next line
411 proc sqlitecon::Next w {
  /external/chromium_org/third_party/tcmalloc/chromium/src/
pagemap.h 114 void* Next(Number k) const {
309 void* Next(Number k) const {
390 void* Next(Number k) const {
402 // Skip to next top-level entry
502 void* Next(Number k) const {
507 // Advance to next top-level entry
518 // Advance to next interior entry
thread_cache.h 212 void* Next() {
290 // the next ThreadCache from which a thread over its max_size_ should
382 ASSERT(ptr != list->Next());
  /external/chromium_org/third_party/tcmalloc/vendor/src/
thread_cache.h 207 void* Next() {
275 // the next ThreadCache from which a thread over its max_size_ should
355 ASSERT(ptr != list->Next());
  /external/chromium_org/third_party/webrtc/base/
fileutils_mock.h 80 virtual bool Next() {
  /external/chromium_org/v8/src/
hashmap.h 69 // for (Entry* p = map.Start(); p != NULL; p = map.Next(p)) {
74 // calling Next() is undefined.
76 Entry* Next(Entry* p) const;
155 // the entries between the entry to remove and the next empty slot have their
157 // not break the search. If, while searching for the next empty entry, an
172 // Move q to the next entry.
219 return Next(map_ - 1);
225 TemplateHashMapImpl<AllocationPolicy>::Next(Entry* p) const {
310 entry_ = map_->Next(entry_);
v8threads.cc 232 return in_use_anchor_->Next();
236 ThreadState* ThreadState::Next() {
265 ThreadState* next = current->next_; local
267 current = next;
330 state = state->Next()) {
342 state = state->Next()) {
358 state = state->Next()) {
  /external/clang/include/clang/AST/
Redeclarable.h 43 mutable llvm::PointerUnion<NotKnownLatest, KnownLatest> Next;
50 : Next(NotKnownLatest(&Ctx)) {}
52 : Next(NotKnownLatest(Previous(D))) {}
55 return Next.is<NotKnownLatest>() &&
56 // FIXME: 'template' is required on the next line due to an
58 Next.get<NotKnownLatest>().template is<Previous>();
64 if (Next.is<NotKnownLatest>()) {
65 NotKnownLatest NKL = Next.get<NotKnownLatest>();
70 Next = KnownLatest(*NKL.get<UninitializedLatest>(),
74 return static_cast<decl_type*>(Next.get<KnownLatest>().get(D))
    [all...]
  /external/clang/lib/StaticAnalyzer/Core/
ExprEngineCXX.cpp 113 // See if we're constructing an existing region by looking at the next
118 CFGElement Next = (*B)[NextStmtIdx];
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/temp/temp.decls/temp.variadic/
example-bind.cpp 140 typedef get_impl<I-1, tuple<Values...> > Next;
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()); }
example-tuple.cpp 183 typedef get_impl<I-1, tuple<Values...> > Next;
185 static RJ get(tuple<Head, Values...>& t) { return Next::get(t.tail()); }
186 static PJ get(const tuple<Head, Values...>& t) { return Next::get(t.tail()); }
  /external/compiler-rt/lib/sanitizer_common/
sanitizer_procmaps_linux.cc 160 bool MemoryMappingLayout::Next(uptr *start, uptr *end, uptr *offset,
251 Next(&cur_beg, &cur_end, &cur_offset, module_name.data(),
  /external/libnfc-nxp/src/
phFriNfc_NdefReg.h 220 * This member is required by the library to link to the next registered item. In case of the
223 struct phFriNfc_NdefReg_Cb *Next;

Completed in 1124 milliseconds

1 2 3 4 56 7 8 91011>>