| /bionic/libc/kernel/common/linux/ |
| notifier.h | 14 *** Any manual change here will be lost the next time this script will
27 struct notifier_block *next; member in struct:notifier_block
|
| /bionic/libc/upstream-netbsd/libc/gen/ |
| popen.c | 68 struct pid *next; member in struct:pid
131 for (old = pidlist; old; old = old->next)
178 cur->next = pidlist;
202 for (last = NULL, cur = pidlist; cur; last = cur, cur = cur->next)
214 pidlist = cur->next;
216 last->next = cur->next;
|
| /cts/tests/tests/graphics/src/android/graphics/cts/ |
| RegionIteratorTest.java | 37 regionIterator.next(null);
41 assertTrue(regionIterator.next(rect));
47 assertFalse(regionIterator.next(rect));
58 assertTrue(regionIterator.next(rect));
63 assertTrue(regionIterator.next(rect));
68 assertTrue(regionIterator.next(rect));
74 assertFalse(regionIterator.next(rect));
85 assertTrue(regionIterator.next(rect));
90 assertTrue(regionIterator.next(rect));
96 assertFalse(regionIterator.next(rect))
[all...] |
| /dalvik/vm/compiler/ |
| CompilerUtility.h | 31 struct ArenaMemBlock *next; member in struct:ArenaMemBlock
|
| /development/ndk/platforms/android-3/include/linux/ |
| notifier.h | 20 struct notifier_block *next; member in struct:notifier_block
|
| /external/apache-http/src/org/apache/http/message/ |
| BasicListHeaderIterator.java | 58 * The position of the next header in {@link #allHeaders allHeaders}.
100 * Determines the index of the next header.
105 * @return the index of the next header that matches the filter name,
148 * Obtains the next header from this iteration.
150 * @return the next header in this iteration
170 * Returns the next header.
173 * @return the next header in this iteration
177 public final Object next() method in class:BasicListHeaderIterator
|
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ |
| DTMAxisIterator.java | 33 * Get the next node in the iteration.
35 * @return The next node handle in the iteration, or END.
37 public int next(); method in interface:DTMAxisIterator
60 * Remembers the current node for the next call to gotoMark().
71 * i.e. subsequent call to next() should return END.
81 * i.e. subsequent call to next() should return END.
|
| /external/bison/src/ |
| nullable.c | 38 struct rule_list *next; member in struct:rule_list
96 p->next = rsets[*rp - ntokens];
117 for (p = rsets[*s1++ - ntokens]; p; p = p->next)
|
| symlist.c | 53 res->next = NULL;
72 res->next = NULL;
90 res->next = NULL;
108 res->next = NULL;
121 for (/* Nothing. */; l && l->content.sym; l = l->next)
138 node->next = list;
150 symbol_list *node, *next; local
151 for (node = list; node; node = next)
153 next = node->next;
[all...] |
| /external/chromium/base/ |
| linked_list.h | 13 // list, as extending LinkNode (this gives it next/previous pointers).
19 // Next, to keep track of the list's head/tail, use a LinkedList instance:
38 // node = node->next()) {
72 // A. Doubly-linked lists are made up of nodes that contain "next" and
76 // space for the "next" and "previous" pointers (base::LinkNode<T>*).
78 // needs to glue on the "next" and "previous" pointers using
87 LinkNode(LinkNode<T>* previous, LinkNode<T>* next)
88 : previous_(previous), next_(next) {}
116 LinkNode<T>* next() const { function in class:base::LinkNode
132 void set(LinkNode<T>* prev, LinkNode<T>* next) {
[all...] |
| /external/chromium_org/base/containers/ |
| linked_list.h | 12 // list, as extending LinkNode (this gives it next/previous pointers).
18 // Next, to keep track of the list's head/tail, use a LinkedList instance:
37 // node = node->next()) {
71 // A. Doubly-linked lists are made up of nodes that contain "next" and
75 // space for the "next" and "previous" pointers (base::LinkNode<T>*).
77 // needs to glue on the "next" and "previous" pointers using
86 LinkNode(LinkNode<T>* previous, LinkNode<T>* next)
87 : previous_(previous), next_(next) {}
115 LinkNode<T>* next() const { function in class:base::LinkNode
137 // list (root_.next() will point back to the start of the list
[all...] |
| mru_cache_unittest.cc | 95 Cache::reverse_iterator next = cache.Erase(cache.rbegin()); local
99 EXPECT_TRUE(next == cache.rbegin());
100 EXPECT_EQ(kItem1Key, next->first);
101 EXPECT_EQ(item1.value, next->second.value);
|
| /external/chromium_org/cc/base/ |
| region.h | 73 void next() { function in class:cc::Region::Iterator
74 it_.next();
|
| /external/chromium_org/components/autofill/core/browser/ |
| name_field.cc | 110 const AutofillField* next = NULL; local
113 ParseEmptyLabel(scanner, &next)) {
117 v->middle_name_ = next;
120 v->last_name_ = next;
|
| /external/chromium_org/native_client_sdk/src/libraries/xray/ |
| stringpool.c | 22 struct XRayStringPoolNode* next; member in struct:XRayStringPoolNode
37 s->next = NULL;
60 pool->current->next = XRayStringPoolAllocNode();
61 pool->current = pool->current->next;
87 n = n->next;
|
| /external/chromium_org/net/base/ |
| priority_queue_unittest.cc | 97 PriorityQueue<int>::Pointer next = queue_.GetNextTowardsLastMin(current); local
99 current = next;
|
| /external/chromium_org/sandbox/win/wow_helper/ |
| wow_helper.cc | 105 wchar_t* next; local
106 DWORD process_id = wcstoul(command_line, &next, 0);
115 DWORD buffer = wcstoul(next, NULL, 0);
|
| /external/chromium_org/third_party/WebKit/Source/core/editing/ |
| RenderedPosition.cpp | 155 InlineBox* next = box->nextLeafChildIgnoringLineBreak(); local
156 if (!next || next->bidiLevel() < bidiLevelOfRun)
158 box = next;
|
| /external/chromium_org/third_party/WebKit/Source/core/rendering/ |
| AbstractInlineTextBox.cpp | 137 int next = iterator->next(); local
139 words.append(WordBoundaries(pos, next));
140 pos = next;
|
| /external/chromium_org/third_party/WebKit/Source/devtools/front_end/cm/ |
| headlesscodemirror.js | 14 next: function() {
|
| /external/chromium_org/third_party/WebKit/Source/platform/ |
| PODFreeListArena.h | 81 m_freeList->next = oldFreeList;
97 m_freeList = m_freeList->next;
106 for (FixedSizeMemoryChunk* cur = m_freeList; cur; cur = cur->next) {
118 FixedSizeMemoryChunk* next; member in struct:WebCore::PODFreeListArena::FixedSizeMemoryChunk
|
| /external/chromium_org/third_party/WebKit/Source/platform/fonts/ |
| FontFamily.h | 47 const FontFamily* next() const;
75 reaper = reaper->releaseNext(); // implicitly protects reaper->next, then derefs reaper
78 inline const FontFamily* FontFamily::next() const function in class:WebCore::FontFamily
|
| /external/chromium_org/third_party/WebKit/Source/wtf/ |
| DoublyLinkedList.h | 40 T* next() const;
54 template<typename T> inline void DoublyLinkedListNode<T>::setNext(T* next)
56 static_cast<T*>(this)->m_next = next;
64 template<typename T> inline T* DoublyLinkedListNode<T>::next() const function in class:WTF::DoublyLinkedListNode
105 for (T* node = m_head; node; node = node->next())
166 node->prev()->setNext(node->next());
169 m_head = node->next();
172 if (node->next()) {
174 node->next()->setPrev(node->prev());
|
| /external/chromium_org/third_party/freetype/src/cache/ |
| ftcmru.c | 52 cnode = cnode->next;
59 last->next = node;
60 node->next = first;
65 node->next = node;
83 FTC_MruNode prev, next, last; local
93 cnode = cnode->next;
103 next = node->next;
105 prev->next = next;
126 FTC_MruNode prev, next; local
331 FTC_MruNode first, node, next; local
[all...] |
| /external/chromium_org/third_party/leveldatabase/src/table/ |
| iterator.cc | 11 cleanup_.next = NULL;
17 for (Cleanup* c = cleanup_.next; c != NULL; ) {
19 Cleanup* next = c->next; local
21 c = next;
33 c->next = cleanup_.next;
34 cleanup_.next = c;
49 virtual void Next() { assert(false); }
|
