| /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/sandbox/linux/seccomp-bpf/ |
| syscall_iterator_unittest.cc | 17 uint32_t next = iter.Next(); local
21 SANDBOX_ASSERT(next == 0);
23 for (uint32_t last = next; !iter.Done(); last = next) {
24 next = iter.Next();
25 SANDBOX_ASSERT(last < next);
28 SANDBOX_ASSERT(next == 0xFFFFFFFFu);
34 uint32_t next = iter.Next()
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/r300/compiler/ |
| radeon_list.c | 15 * next paragraph) shall be included in all copies or substantial
39 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
[all...] |
| radeon_program.c | 15 * next paragraph) shall be included in all copies or substantial
57 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/ |
| 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/mesa3d/src/gallium/drivers/r300/compiler/ |
| radeon_list.c | 15 * next paragraph) shall be included in all copies or substantial
39 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
[all...] |
| radeon_program.c | 15 * next paragraph) shall be included in all copies or substantial
57 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/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; }
|
| /external/chromium_org/third_party/tcmalloc/chromium/src/tests/ |
| pagemap_unittest.cc | 128 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(39) == &a)
[all...] |
| /external/chromium_org/third_party/tcmalloc/vendor/src/tests/ |
| pagemap_unittest.cc | 128 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(39) == &a)
[all...] |
| /external/llvm/lib/Support/ |
| ManagedStatic.cpp | 53 Next = StaticList;
57 assert(!Ptr && !DeleterFn && !Next &&
63 Next = StaticList;
73 StaticList = Next;
74 Next = nullptr;
|
| /external/chromium_org/ui/base/models/ |
| tree_node_iterator_unittest.cc | 36 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/llvm/include/llvm/IR/ |
| Use.h | 117 Use *getNext() const { return Next; }
136 Use *Next;
141 Next = *List;
142 if (Next)
143 Next->setPrev(&Next);
149 *StrippedPrev = Next;
150 if (Next)
151 Next->setPrev(StrippedPrev);
|
| /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/clang/test/CodeGen/ |
| 2002-08-19-RecursiveLocals.c | 7 struct list *Next;
|
| /external/chromium_org/third_party/protobuf/src/google/protobuf/io/ |
| zero_copy_stream.h | 60 // input->Next(&buffer, &size);
78 // while (input->Next(&buffer, &size)) {
94 // while (output->Next(&buffer, &size)) {
143 // as repeatedly calling Next() eventually yields a buffer with non-zero
145 virtual bool Next(const void** data, int* size) = 0;
147 // Backs up a number of bytes, so that the next call to Next() returns
148 // data again that was already returned by the last call to Next(). This
150 // to a certain point in the input, then return. If Next() returns a
155 // * The last method called must have been Next()
[all...] |
| /external/protobuf/src/google/protobuf/io/ |
| zero_copy_stream.h | 60 // input->Next(&buffer, &size);
78 // while (input->Next(&buffer, &size)) {
94 // while (output->Next(&buffer, &size)) {
143 // as repeatedly calling Next() eventually yields a buffer with non-zero
145 virtual bool Next(const void** data, int* size) = 0;
147 // Backs up a number of bytes, so that the next call to Next() returns
148 // data again that was already returned by the last call to Next(). This
150 // to a certain point in the input, then return. If Next() returns a
155 // * The last method called must have been Next()
[all...] |
| /external/llvm/include/llvm/Support/ |
| Registry.h | 74 for (listener *Cur = ListenerHead; Cur; Cur = Cur->Next)
90 node *Next;
94 node(const entry& V) : Next(nullptr), Val(V) {
96 Tail->Next = this;
116 iterator &operator++() { Cur = Cur->Next; return *this; }
142 listener *Prev, *Next;
159 listener() : Prev(ListenerTail), Next(0) {
161 Prev->Next = this;
168 if (Next)
169 Next->Prev = Prev
[all...] |
| /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/chromium_org/chrome/browser/content_settings/ |
| content_settings_rule.h | 37 virtual Rule Next() = 0;
44 virtual Rule Next() OVERRIDE;
55 virtual Rule Next() OVERRIDE;
|
| /external/chromium_org/v8/src/utils/ |
| random-number-generator.h | 38 // Returns the next pseudorandom, uniformly distributed int value from this
44 return Next(32);
55 // Returns the next pseudorandom, uniformly distributed boolean value from
61 return Next(1) != 0;
64 // Returns the next pseudorandom, uniformly distributed double value between
79 int Next(int bits) V8_WARN_UNUSED_RESULT;
|
| /external/chromium_org/v8/src/ |
| dateparser-inl.h | 79 token = scanner.Next()) {
92 if (scanner.Peek().IsSymbol('.')) scanner.Next();
97 int n = ReadMilliseconds(scanner.Next());
139 n = scanner.Next().number();
192 in_->Next();
211 DateToken sign_token = scanner->Next();
214 int year = scanner->Next().number();
218 day->Add(scanner->Next().number());
220 return scanner->Next();
224 !DayComposer::IsMonth(scanner->Peek().number())) return scanner->Next();
[all...] |
| /external/chromium_org/net/disk_cache/simple/ |
| simple_index_file_win.cc | 24 for (base::FilePath file_path = enumerator.Next(); !file_path.empty();
25 file_path = enumerator.Next()) {
|
| /external/chromium_org/third_party/libjingle/source/talk/base/ |
| win32toolhelp_unittest.cc | 71 static bool Next(HANDLE handle, TestData* d) {
115 bool CheckCallCounters(int first, int next, int fail, int close) {
116 bool match = first_called_ == first && next_called_ == next
122 << next << ", "
157 static bool Next(HANDLE handle, Type* t) {
158 return Win32ToolhelpTest::Next(handle, t);
174 static bool Next(HANDLE handle, Type* t) {
193 static bool Next(HANDLE handle, Type* t) {
211 EXPECT_FALSE(t.Next());
215 // Tests that Next() returns false if the first-pointe
[all...] |
| /external/chromium_org/third_party/re2/util/ |
| random.cc | 11 int32 ACMRandom::Next() {
31 return Next() % n;
|
