Searched refs:Next (Results 1 - 25 of 940) sorted by relevance

1234567891011>>

/external/chromium_org/chrome/browser/ui/tab_contents/
H A Dtab_contents_iterator.cc16 Next();
19 void TabContentsIterator::Next() { function in class:TabContentsIterator
27 browser_iterator_.Next();
/external/chromium_org/sandbox/linux/seccomp-bpf/
H A Dsyscall_iterator_unittest.cc17 uint32_t next = iter.Next();
24 next = iter.Next();
34 uint32_t next = iter.Next();
43 SANDBOX_ASSERT((next = iter.Next()) == last + 1);
51 uint32_t next = iter.Next();
53 next = iter.Next();
59 SANDBOX_ASSERT((next = iter.Next()) == last + 1);
66 uint32_t next = iter.Next();
68 next = iter.Next();
74 SANDBOX_ASSERT((next = iter.Next())
[all...]
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/r300/compiler/
H A Dradeon_list.c39 new->Next = NULL;
54 for (temp = *list; temp->Next; temp = temp->Next);
56 temp->Next = new_value;
63 *list = rm_value->Next;
67 rm_value->Prev->Next = rm_value->Next;
68 if (rm_value->Next) {
69 rm_value->Next->Prev = rm_value->Prev;
78 list = list->Next;
[all...]
H A Dradeon_program.c57 struct rc_instruction * inst = c->Program.Instructions.Next;
63 inst = inst->Next;
114 for(inst = c->Program.Instructions.Next;
115 inst != &c->Program.Instructions; inst = inst->Next) {
187 inst->Next = after->Next;
189 inst->Prev->Next = inst;
190 inst->Next->Prev = inst;
204 inst->Prev->Next = inst->Next;
[all...]
/external/llvm/include/llvm/ADT/
H A Dilist_node.h46 NodeTy *Next; member in class:llvm::ilist_node
47 NodeTy *getNext() { return Next; }
48 const NodeTy *getNext() const { return Next; }
49 void setNext(NodeTy *N) { Next = N; }
51 ilist_node() : Next(0) {}
81 NodeTy *Next = getNext(); local
84 if (!Next->getNext())
87 return Next;
92 const NodeTy *Next = getNext(); local
95 if (!Next
[all...]
/external/mesa3d/src/gallium/drivers/r300/compiler/
H A Dradeon_list.c39 new->Next = NULL;
54 for (temp = *list; temp->Next; temp = temp->Next);
56 temp->Next = new_value;
63 *list = rm_value->Next;
67 rm_value->Prev->Next = rm_value->Next;
68 if (rm_value->Next) {
69 rm_value->Next->Prev = rm_value->Prev;
78 list = list->Next;
[all...]
H A Dradeon_program.c57 struct rc_instruction * inst = c->Program.Instructions.Next;
63 inst = inst->Next;
114 for(inst = c->Program.Instructions.Next;
115 inst != &c->Program.Instructions; inst = inst->Next) {
187 inst->Next = after->Next;
189 inst->Prev->Next = inst;
190 inst->Next->Prev = inst;
204 inst->Prev->Next = inst->Next;
[all...]
/external/chromium_org/third_party/tcmalloc/chromium/src/tests/
H A Dpagemap_unittest.cc128 CHECK(map.Next(0) == NULL);
129 CHECK(map.Next(5) == NULL);
130 CHECK(map.Next(1<<30) == NULL);
135 CHECK(map.Next(0) == &a);
136 CHECK(map.Next(39) == &a);
137 CHECK(map.Next(40) == &a);
138 CHECK(map.Next(41) == NULL);
139 CHECK(map.Next(1<<30) == NULL);
148 CHECK(map.Next(0) == &a);
149 CHECK(map.Next(3
[all...]
/external/chromium_org/third_party/tcmalloc/vendor/src/tests/
H A Dpagemap_unittest.cc128 CHECK(map.Next(0) == NULL);
129 CHECK(map.Next(5) == NULL);
130 CHECK(map.Next(1<<30) == NULL);
135 CHECK(map.Next(0) == &a);
136 CHECK(map.Next(39) == &a);
137 CHECK(map.Next(40) == &a);
138 CHECK(map.Next(41) == NULL);
139 CHECK(map.Next(1<<30) == NULL);
148 CHECK(map.Next(0) == &a);
149 CHECK(map.Next(3
[all...]
/external/llvm/lib/Support/
H A DManagedStatic.cpp42 Next = StaticList;
48 assert(Ptr == 0 && DeleterFn == 0 && Next == 0 &&
54 Next = StaticList;
64 StaticList = Next;
65 Next = 0;
/external/chromium_org/ui/base/models/
H A Dtree_node_iterator_unittest.cc36 ASSERT_EQ(root.GetChild(0), iterator.Next());
39 ASSERT_EQ(root.GetChild(1), iterator.Next());
42 ASSERT_EQ(root.GetChild(2), iterator.Next());
45 ASSERT_EQ(f4, iterator.Next());
48 ASSERT_EQ(f4->GetChild(0), iterator.Next());
71 ASSERT_EQ(2, odd_iterator.Next()->value);
76 ASSERT_EQ(1, even_iterator.Next()->value);
78 ASSERT_EQ(3, even_iterator.Next()->value);
80 ASSERT_EQ(7, even_iterator.Next()->value);
/external/chromium_org/third_party/leveldatabase/src/util/
H A Drandom.h20 uint32_t Next() { function in class:leveldb::Random
43 uint32_t Uniform(int n) { return Next() % n; }
47 bool OneIn(int n) { return (Next() % n) == 0; }
/external/chromium/base/
H A Ddir_reader_fallback.h13 // Open a directory. If |IsValid| is true, then |Next| can be called to start
20 bool Next() { return false; } function in class:base::DirReaderFallback
/external/chromium_org/base/files/
H A Ddir_reader_fallback.h12 // Open a directory. If |IsValid| is true, then |Next| can be called to start
21 bool Next() { return false; } function in class:base::DirReaderFallback
/external/clang/test/CodeGen/
H A D2002-08-19-RecursiveLocals.c7 struct list *Next; member in struct:list
/external/llvm/include/llvm/Support/
H A DRegistry.h71 for (listener *Cur = ListenerHead; Cur; Cur = Cur->Next)
87 node *Next; member in class:llvm::Registry::node
91 node(const entry& V) : Next(0), Val(V) {
93 Tail->Next = this;
113 iterator &operator++() { Cur = Cur->Next; return *this; }
139 listener *Prev, *Next; member in class:llvm::Registry::listener
156 listener() : Prev(ListenerTail), Next(0) {
158 Prev->Next = this;
165 if (Next)
166 Next
[all...]
/external/chromium_org/chrome/browser/content_settings/
H A Dcontent_settings_rule.h37 virtual Rule Next() = 0;
44 virtual Rule Next() OVERRIDE;
55 virtual Rule Next() OVERRIDE;
/external/chromium_org/v8/src/
H A Ddateparser-inl.h102 token = scanner.Next()) {
115 if (scanner.Peek().IsSymbol('.')) scanner.Next();
120 int n = ReadMilliseconds(scanner.Next());
162 n = scanner.Next().number();
215 in_->Next();
234 DateToken sign_token = scanner->Next();
237 int year = scanner->Next().number();
241 day->Add(scanner->Next().number());
243 return scanner->Next();
247 !DayComposer::IsMonth(scanner->Peek().number())) return scanner->Next();
[all...]
/external/v8/src/
H A Ddateparser-inl.h101 token = scanner.Next()) {
114 if (scanner.Peek().IsSymbol('.')) scanner.Next();
119 int n = ReadMilliseconds(scanner.Next());
158 n = scanner.Next().number();
211 in_->Next();
230 DateToken sign_token = scanner->Next();
233 int year = scanner->Next().number();
237 day->Add(scanner->Next().number());
239 return scanner->Next();
243 !DayComposer::IsMonth(scanner->Peek().number())) return scanner->Next();
[all...]
/external/chromium_org/net/disk_cache/simple/
H A Dsimple_index_file_win.cc24 for (base::FilePath file_path = enumerator.Next(); !file_path.empty();
25 file_path = enumerator.Next()) {
/external/chromium_org/third_party/libjingle/source/talk/base/
H A Dwin32toolhelp_unittest.cc71 static bool Next(HANDLE handle, TestData* d) { function in class:talk_base::Win32ToolhelpTest
157 static bool Next(HANDLE handle, Type* t) { function in class:talk_base::TestTraits
158 return Win32ToolhelpTest::Next(handle, t);
174 static bool Next(HANDLE handle, Type* t) { function in class:talk_base::BadFirstTraits
193 static bool Next(HANDLE handle, Type* t) { function in class:talk_base::BadNextTraits
211 EXPECT_FALSE(t.Next());
215 // Tests that Next() returns false if the first-pointer
222 EXPECT_FALSE(t->Next());
223 EXPECT_FALSE(t->Next());
224 EXPECT_FALSE(t->Next());
[all...]
/external/chromium_org/third_party/re2/util/
H A Drandom.cc11 int32 ACMRandom::Next() { function in class:re2::ACMRandom
31 return Next() % n;
/external/regex-re2/util/
H A Drandom.cc11 int32 ACMRandom::Next() { function in class:re2::ACMRandom
31 return Next() % n;
/external/chromium/net/disk_cache/
H A Dcache_util_posix.cc31 for (FilePath name = iter.Next(); !name.value().empty(); name = iter.Next()) {
48 for (FilePath file = iter.Next(); !file.value().empty(); file = iter.Next()) {
/external/chromium_org/chrome/browser/ui/
H A Dbrowser_iterator.h20 // for (BrowserIterator iterator; !iterator.done(); iterator.Next()) {
47 void Next();

Completed in 598 milliseconds

1234567891011>>