| /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/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/dom/ |
| NodeTraversal.h | 39 Element* next(const Node*);
40 Element* next(const Node*, const Node* stayWithin);
41 Element* next(const ContainerNode*);
42 Element* next(const ContainerNode*, const Node* stayWithin);
44 // Like next, but skips children.
62 // Does a pre-order traversal of the tree to find the next node after this one.
66 Node* next(const Node*);
67 Node* next(const Node*, const Node* stayWithin);
68 Node* next(const ContainerNode*);
69 Node* next(const ContainerNode*, const Node* stayWithin)
118 inline Element* next(const ContainerNode* current) { return traverseNextElementTemplate(current); } function in namespace:WebCore::ElementTraversal
119 inline Element* next(const Node* current) { return traverseNextElementTemplate(current); } function in namespace:WebCore::ElementTraversal
129 inline Element* next(const ContainerNode* current, const Node* stayWithin) { return traverseNextElementTemplate(current, stayWithin); } function in namespace:WebCore::ElementTraversal
130 inline Element* next(const Node* current, const Node* stayWithin) { return traverseNextElementTemplate(current, stayWithin); } function in namespace:WebCore::ElementTraversal
202 inline Node* next(const Node* current) { return traverseNextTemplate(current); } function in namespace:WebCore::NodeTraversal
203 inline Node* next(const ContainerNode* current) { return traverseNextTemplate(current); } function in namespace:WebCore::NodeTraversal
216 inline Node* next(const Node* current, const Node* stayWithin) { return traverseNextTemplate(current, stayWithin); } function in namespace:WebCore::NodeTraversal
217 inline Node* next(const ContainerNode* current, const Node* stayWithin) { return traverseNextTemplate(current, stayWithin); } function in namespace:WebCore::NodeTraversal
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/editing/ |
| RenderedPosition.cpp | 156 InlineBox* next = box->nextLeafChildIgnoringLineBreak(); local
157 if (!next || next->bidiLevel() < bidiLevelOfRun)
159 box = next;
|
| /external/chromium_org/third_party/WebKit/Source/core/platform/ |
| PODFreeListArena.h | 78 m_freeList->next = oldFreeList;
94 m_freeList = m_freeList->next;
113 for (FixedSizeMemoryChunk* cur = m_freeList; cur; cur = cur->next) {
123 FixedSizeMemoryChunk* next; member in struct:WebCore::PODFreeListArena::FixedSizeMemoryChunk
|
| /external/chromium_org/third_party/WebKit/Source/core/platform/graphics/ |
| FontFamily.h | 46 const FontFamily* next() const;
74 reaper = reaper->releaseNext(); // implicitly protects reaper->next, then derefs reaper
77 inline const FontFamily* FontFamily::next() const function in class:WebCore::FontFamily
|
| /external/chromium_org/third_party/WebKit/Source/core/rendering/ |
| RenderLazyBlock.h | 52 RenderLazyBlock* next() const { return m_next; } function in class:WebCore::FINAL
|
| /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/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); }
|
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/draw/ |
| draw_pipe.h | 15 * next paragraph) shall be included in all copies or substantial portions
59 struct draw_stage *next; /**< next stage in pipeline */ member in struct:draw_stage
|
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/ |
| u_dirty_surfaces.h | 14 * next paragraph) shall be included in all copies or substantial
59 struct list_head *p, *next; local
60 for(p = dss->dirty_list.next; p != &dss->dirty_list; p = next)
63 next = p->next;
72 struct list_head *p, *next; local
75 for(p = dss->dirty_list.next; p != &dss->dirty_list; p = next)
78 next = p->next
[all...] |
| u_mm.c | 44 for (p = heap->next; p != heap; p = p->next) {
87 heap->next = block;
93 block->next = heap;
113 /* break left [p, newblock, p->next], then p = newblock */
123 newblock->next = p->next;
125 p->next->prev = newblock;
126 p->next = newblock;
137 /* break right, also [p, newblock, p->next] */
290 struct mem_block *next = p->next; local
[all...] |
| u_slab.h | 11 * The above copyright notice and this permission notice (including the next
49 struct util_slab_page *prev, *next; member in struct:util_slab_page
|
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nouveau/ |
| nouveau_fence.c | 96 screen->fence.tail->next = fence;
117 screen->fence.head = fence->next;
121 for (it = screen->fence.head; it && it->next != fence; it = it->next);
122 it->next = fence->next;
140 struct nouveau_fence *next = NULL; local
147 for (fence = screen->fence.head; fence; fence = next) {
148 next = fence->next;
[all...] |
| nouveau_fence.h | 21 struct nouveau_fence *next; member in struct:nouveau_fence
|
