| /external/e2fsprogs/lib/ext2fs/ |
| kernel-list.h | 9 * sometimes we already know the next/prev entries and we can
15 struct list_head *next, *prev; member in struct:list_head
24 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
35 * the prev/next entries already!
39 struct list_head * next)
41 next->prev = new;
42 new->next = next;
44 prev->next = new;
52 __list_add(new, head, head->next);
[all...] |
| link.c | 40 struct ext2_dir_entry *next; local
54 next = (struct ext2_dir_entry *) (buf + offset + curr_rec_len);
56 (next->inode == 0) &&
57 (offset + curr_rec_len + next->rec_len <= blocksize)) {
58 curr_rec_len += next->rec_len;
78 next = (struct ext2_dir_entry *) (buf + offset +
80 next->inode = 0;
81 next->name_len = 0;
82 ls->err = ext2fs_set_rec_len(ls->fs, rec_len, next);
|
| /external/e2fsprogs/misc/ |
| ismounted.c | 58 char *word, *next; local
65 next = skip_over_word(word);
66 if (*next)
67 *next++ = 0;
68 *buf = next;
|
| /external/easymock/src/org/easymock/internal/ |
| Results.java | 45 public Result next() {
method in class:Results
|
| /external/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/guava/guava/src/com/google/common/base/ |
| AbstractIterator.java | 40 private T next; field in class:AbstractIterator
64 next = computeNext();
73 public final T next() { method in class:AbstractIterator
78 return next;
|
| /external/guava/guava/src/com/google/common/collect/ |
| AbstractIterator.java | 46 * String s = in.next();
71 /** We have computed the next element and haven't returned it yet. */
84 private T next; field in class:AbstractIterator
87 * Returns the next element. <b>Note:</b> the implementation must call {@link
91 * <p>The initial invocation of {@link #hasNext()} or {@link #next()} calls
93 * next} following each successful call to {@code next}. Once the
98 * {@code hasNext} or {@code next} invocation that invoked this method. Any
103 * {@code next}, or {@link #peek()} methods on this instance; if it does, an
106 * @return the next element if there was one. If {@code endOfData} was calle
152 public final T next() { method in class:AbstractIterator
[all...] |
| AbstractMapBasedMultiset.java | 103 public Multiset.Entry<E> next() { method
104 final Map.Entry<E, Count> mapEntry = backingEntries.next();
128 "no calls to next() since the last call to remove()");
161 * Not subclassing AbstractMultiset$MultisetIterator because next() needs to
181 public E next() {
183 currentEntry = entryIterator.next();
194 "no calls to next() since the last call to remove()");
352 public E next() {
353 toRemove = entries.next();
360 "no calls to next() since the last call to remove()")
[all...] |
| LinkedListMultimap.java | 114 Node<K, V> next; // the next node (with any key) field in class:LinkedListMultimap.Node
116 Node<K, V> nextSibling; // the next node with the same key
197 tail.next = node;
211 node.next = nextSibling;
221 nextSibling.previous.next = node;
237 node.previous.next = node.next;
239 head = node.next;
241 if (node.next != null)
281 Node<K, V> next; field in class:LinkedListMultimap.NodeIterator
300 next(); method
310 public Node<K, V> next() { method in class:LinkedListMultimap.NodeIterator
366 Node<K, V> next = head; field in class:LinkedListMultimap.DistinctKeyIterator
374 public K next() { method in class:LinkedListMultimap.DistinctKeyIterator
395 Node<K, V> next; field in class:LinkedListMultimap.ValueForKeyIterator
426 next(); method
439 public V next() { method in class:LinkedListMultimap.ValueForKeyIterator
[all...] |
| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| AbstractMapBasedMultiset.java | 100 public Multiset.Entry<E> next() { method
101 final Map.Entry<E, Count> mapEntry = backingEntries.next();
125 "no calls to next() since the last call to remove()");
158 * Not subclassing AbstractMultiset$MultisetIterator because next() needs to
178 public E next() {
180 currentEntry = entryIterator.next();
191 "no calls to next() since the last call to remove()");
349 public E next() {
350 toRemove = entries.next();
357 "no calls to next() since the last call to remove()")
[all...] |
| LinkedListMultimap.java | 110 Node<K, V> next; // the next node (with any key) field in class:LinkedListMultimap.Node
112 Node<K, V> nextSibling; // the next node with the same key
193 tail.next = node;
207 node.next = nextSibling;
217 nextSibling.previous.next = node;
233 node.previous.next = node.next;
235 head = node.next;
237 if (node.next != null)
277 Node<K, V> next; field in class:LinkedListMultimap.NodeIterator
296 next(); method
306 public Node<K, V> next() { method in class:LinkedListMultimap.NodeIterator
362 Node<K, V> next = head; field in class:LinkedListMultimap.DistinctKeyIterator
370 public K next() { method in class:LinkedListMultimap.DistinctKeyIterator
391 Node<K, V> next; field in class:LinkedListMultimap.ValueForKeyIterator
422 next(); method
435 public V next() { method in class:LinkedListMultimap.ValueForKeyIterator
[all...] |
| /external/hamcrest/src/org/hamcrest/ |
| BaseDescription.java | 78 appendDescriptionOf(i.next());
|
| /external/iproute2/include/ |
| xt-internal.h | 37 struct xtables_rule_match *next; member in struct:xtables_rule_match
|
| /external/iptables/extensions/ |
| libip6t_dst.c | 58 char *buffer, *cp, *next, *range; local
65 for (cp = buffer, i = 0; cp && i < IP6T_OPTS_OPTSNR; cp = next, i++)
67 next = strchr(cp, ',');
69 if (next)
70 *next++='\0';
|
| /external/javassist/src/main/javassist/bytecode/stackmap/ |
| BasicBlock.java | 54 Catch next; field in class:BasicBlock.Catch
60 next = c;
89 th = th.next;
216 int index = ci.next();
224 Mark next = makeMark(marks, index + 3);
225 makeMark(marks, index, makeArray(to.block, next.block), 3, false);
302 Mark next = makeMark(marks, pos + size);
303 BasicBlock[] jumps = makeArray(to.block, next.block);
|
| /external/libnl-headers/netlink/ |
| list.h | 17 struct nl_list_head * next; member in struct:nl_list_head
23 list->next = list;
29 struct nl_list_head *next)
31 prev->next = obj;
33 next->prev = obj;
34 obj->next = next;
46 __nl_list_add(obj, head, head->next);
51 obj->next->prev = obj->prev;
52 obj->prev->next = obj->next
[all...] |
| /external/libselinux/src/ |
| label_internal.h | 38 struct selabel_sub *next; member in struct:selabel_sub
|
| /external/libsepol/include/sepol/policydb/ |
| hashtab.h | 30 hashtab_ptr_t next; member in struct:hashtab_node
|
| /external/libsepol/src/ |
| avrule_block.c | 119 avrule_decl_t *next_decl = decl->next;
129 avrule_block_t *next = x->next; local
131 x = next;
144 result->next = decl->cond_list;
|
| /external/libvpx/libvpx/nestegg/halloc/src/ |
| hlist.h | 32 hlist_item_t * next; member in struct:hlist_head
37 hlist_item_t * next; member in struct:hlist_item
50 #define __hlist_init_item(i) { &hlist_null, &(i).next }
76 for (i = (h)->next; i != &hlist_null; i = i->next)
79 for (i = (h)->next, tmp = i->next; \
81 i = tmp, tmp = i->next)
89 h->next = &hlist_null;
95 i->prev = &i->next;
101 hlist_item_t * next; local
112 hlist_item_t * next; local
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| MetaRenamer.cpp | 33 unsigned long next; member in struct:__anon24108::PRNG
36 next = seed;
40 next = next * 1103515245 + 12345;
41 return (unsigned int)(next / 65536) % 32768;
|
| /external/mesa3d/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/mesa3d/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
|
