/external/chromium_org/chrome/browser/ui/tab_contents/ |
tab_contents_iterator.cc | 16 Next(); 19 void TabContentsIterator::Next() { 23 // Update |cur_| to the next WebContents in the list. 26 // Advance to the next Browser in the list. 27 browser_iterator_.Next();
|
/external/chromium_org/storage/browser/fileapi/ |
file_system_file_util.cc | 9 base::FilePath FileSystemFileUtil::EmptyFileEnumerator::Next() {
|
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/r300/compiler/ |
radeon_list.h | 15 * next paragraph) shall be included in all copies or substantial 36 struct rc_list * Next;
|
/external/mesa3d/src/gallium/drivers/r300/compiler/ |
radeon_list.h | 15 * next paragraph) shall be included in all copies or substantial 36 struct rc_list * Next;
|
/external/chromium_org/chrome/browser/ui/ |
browser_iterator.cc | 20 void BrowserIterator::Next() {
|
/external/chromium_org/sandbox/linux/seccomp-bpf/ |
syscall_iterator.cc | 12 uint32_t SyscallIterator::Next() {
|
/external/chromium_org/third_party/re2/util/ |
random.cc | 11 int32 ACMRandom::Next() { 31 return Next() % n;
|
/external/clang/test/CodeGen/ |
2002-08-19-RecursiveLocals.c | 7 struct list *Next;
|
2002-07-14-MiscListTests.c | 19 struct list *Next; 43 L = &(*L)->Next; 46 (*L)->Next = 0; 53 return FindData(L->Next, Data);
|
/development/host/windows/usb/api/ |
adb_interface_enum.cpp | 59 bool AdbInterfaceEnumObject::Next(AdbInterfaceInfo* info, ULONG* size) {
|
/external/chromium_org/base/files/ |
dir_reader_fallback.h | 12 // Open a directory. If |IsValid| is true, then |Next| can be called to start 20 // Move to the next entry returning false if the iteration is complete. 21 bool Next() { return false; }
|
file_enumerator_win.cc | 86 FilePath FileEnumerator::Next() { 117 // Search for the next file/directory. 128 // the next one in the queue. We applied the pattern (if any) to the files
|
/external/chromium_org/chrome/browser/media_galleries/linux/ |
mtp_device_object_enumerator.cc | 19 base::FilePath MTPDeviceObjectEnumerator::Next() { 23 is_index_ready_ = true; // First time calling Next().
|
/external/chromium_org/chrome/browser/media_galleries/win/ |
mtp_device_object_enumerator.cc | 24 base::FilePath MTPDeviceObjectEnumerator::Next() { 29 is_index_ready_ = true; // First time calling Next().
|
/art/compiler/dex/ |
dataflow_iterator-inl.h | 30 // Get the next index. 101 inline BasicBlock* AllNodesIterator::Next(bool had_change) { 107 // Find the next BasicBlock. 109 // Get next BasicBlock. 110 res = all_nodes_iterator_.Next(); 124 inline BasicBlock* LoopRepeatingTopologicalSortIterator::Next(bool had_change) { 132 for (BasicBlock* child_bb = iter.Next(); child_bb != nullptr; child_bb = iter.Next()) { 160 // Get next block and return it if unvisited.
|
/external/chromium_org/components/content_settings/core/browser/ |
content_settings_rule.cc | 32 Rule EmptyRuleIterator::Next() { 58 Rule ConcatenationIterator::Next() { 63 const Rule& to_return = (*current_iterator)->Next();
|
/external/chromium_org/content/browser/indexed_db/leveldb/ |
leveldb_iterator_impl.cc | 48 leveldb::Status LevelDBIteratorImpl::Next() { 50 iterator_->Next();
|
/external/chromium_org/third_party/brotli/src/brotli/enc/ |
block_splitter.h | 45 void Next() {
|
/external/chromium_org/third_party/leveldatabase/src/util/ |
random.h | 25 uint32_t Next() { 48 uint32_t Uniform(int n) { return Next() % n; } 52 bool OneIn(int n) { return (Next() % n) == 0; }
|
/external/chromium_org/third_party/re2/re2/testing/ |
string_generator.cc | 7 // Fetch strings using a Java-like Next()/HasNext() interface. 25 // Next() will return empty string (digits_ is empty). 75 // Returns the next string in the iteration, which is the one 79 const StringPiece& StringGenerator::Next() {
|
/external/chromium_org/tools/gn/ |
config_values_extractors.h | 27 // for (ConfigValueIterator iter(target); !iter.done(); iter.Next()) 54 void Next() { 94 for (ConfigValuesIterator iter(target); !iter.done(); iter.Next())
|
/external/chromium_org/ui/base/models/ |
tree_node_iterator.h | 20 // Node* node = iterator.Next(); 56 // Returns the next descendant. 57 NodeType* Next() { 72 // Advance to next valid node by skipping over the pruned nodes and the 78 positions_.pop(); // This Position is all processed, move to the next. 83 break; // Now positioned at the next node to be returned.
|
/external/chromium_org/v8/src/ |
circular-queue-inl.h | 38 dequeue_pos_ = Next(dequeue_pos_); 55 enqueue_pos_ = Next(enqueue_pos_); 60 typename SamplingCircularQueue<T, L>::Entry* SamplingCircularQueue<T, L>::Next( 62 Entry* next = entry + 1; local 63 if (next == &buffer_[L]) return buffer_; 64 return next;
|
/external/llvm/include/llvm/ADT/ |
ilist_node.h | 39 /// ilist_node - Base class that provides next/prev services for nodes 46 NodeTy *Next; 47 NodeTy *getNext() { return Next; } 48 const NodeTy *getNext() const { return Next; } 49 void setNext(NodeTy *N) { Next = N; } 51 ilist_node() : Next(nullptr) {} 79 /// \brief Get the next node, or 0 for the list tail. 81 NodeTy *Next = getNext(); 84 if (!Next->getNext()) 87 return Next; [all...] |
/external/llvm/lib/Target/AArch64/ |
AArch64CleanupLocalDynamicTLSPass.cpp | 124 MachineInstr *Next = I->getNextNode(); 125 MachineInstr *Copy = BuildMI(*I->getParent(), Next, I->getDebugLoc(),
|