| /external/e2fsprogs/misc/ |
| fsck.h | 48 struct fs_info *next; member in struct:fs_info
66 struct fsck_instance *next; member in struct:fsck_instance
|
| util.c | 179 char *buf, *token, *next, *p, *arg; local
191 for (token = buf; token && *token; token = next) {
193 next = 0;
196 next = p+1;
|
| /external/e2fsprogs/util/ |
| subst.c | 30 struct subst_entry *next; member in struct:subst_entry
52 ent->next = subst_table;
68 for (ent = subst_table; ent; ent = ent->next) {
|
| /external/eigen/Eigen/src/SparseCore/ |
| AmbiVector.h | 102 Index next; member in struct:Eigen::internal::AmbiVector::ListEl
199 llElements[0].next = -1;
208 el.next = m_llStart;
216 Index nextel = llElements[m_llCurrent].next;
221 nextel = llElements[nextel].next;
241 el.next = llElements[m_llCurrent].next;
242 llElements[m_llCurrent].next = m_llSize;
267 elid = llElements[elid].next;
308 m_currentEl = llElements[m_currentEl].next;
[all...] |
| /external/elfutils/libdw/ |
| dwarf_getlocation.c | 96 struct loclist *next; member in struct:loclist
146 newloc->next = loclist;
324 loclist = loclist->next;
|
| /external/elfutils/libdwfl/ |
| derelocate.c | 67 struct secref *next; member in struct:secref
138 newref->next = refs;
153 for (struct secref *sec = refs; sec != NULL; sec = sec->next)
174 for (size_t i = nrefs; i-- > 0; refs = refs->next)
338 inside the next one. A section limit address can appear in
|
| /external/elfutils/libebl/ |
| eblstrtab.c | 76 struct Ebl_Strent *next; member in struct:Ebl_Strent
86 struct memoryblock *next; member in struct:memoryblock
145 newmem->next = st->memory;
162 mb = mb->next;
192 newstr->next = NULL;
260 for (struct Ebl_Strent *subs = (*sep)->next; subs != NULL;
261 subs = subs->next)
277 newstr->next = (*sep)->next;
278 (*sep)->next = newstr
[all...] |
| eblwstrtab.c | 77 struct Ebl_WStrent *next; member in struct:Ebl_WStrent
87 struct memoryblock *next; member in struct:memoryblock
146 newmem->next = st->memory;
163 mb = mb->next;
198 newstr->next = NULL;
273 for (subs = (*sep)->next; subs != NULL; subs = subs->next)
289 newstr->next = (*sep)->next;
290 (*sep)->next = newstr
[all...] |
| /external/emma/core/java12/com/vladium/util/ |
| IntIntMap.java | 224 final Entry next = entry.m_next; local
229 buckets [bucketIndex] = next;
231 prev.m_next = next;
238 entry = next;
266 Entry (final int key, final int value, final Entry next)
270 m_next = next;
300 final Entry next = entry.m_next; // remember next pointer because we are going to reuse this entry local
310 entry = next;
|
| IntObjectMap.java | 224 Entry (final int key, final Object value, final Entry next)
228 m_next = next;
258 final Entry next = entry.m_next; // remember next pointer because we are going to reuse this entry local
268 entry = next;
|
| IntSet.java | 198 Entry (final int key, final Entry next)
201 m_next = next;
230 final Entry next = entry.m_next; // remember next pointer because we are going to reuse this entry local
240 entry = next;
|
| ObjectIntMap.java | 220 final Entry next = entry.m_next; local
225 buckets [bucketIndex] = next;
227 prev.m_next = next;
234 entry = next;
262 Entry (final Object key, final int value, final Entry next)
266 m_next = next;
296 final Entry next = entry.m_next; // remember next pointer because we are going to reuse this entry local
306 entry = next;
|
| WCMatcher.java | 249 next: while (true)
264 continue next; local
278 continue next; local
288 // [continue next;]
308 next: while (true)
323 continue next; local
337 continue next; local
347 // [continue next;]
|
| /external/freetype/src/cache/ |
| ftccache.c | 364 FTC_Node *pnode = cache->buckets + i, next, node = *pnode; local
369 next = node->link;
379 node = next;
|
| /external/freetype/src/sfnt/ |
| ttkern.c | 199 FT_Byte* next = base; local
209 next = base + length;
211 if ( next > p_limit ) /* handle broken table */
212 next = p_limit;
217 if ( p + 8 > next )
223 if ( ( next - p ) < 6 * (int)num_pairs ) /* handle broken count */
224 num_pairs = (FT_UInt)( ( next - p ) / 6 );
298 p = next;
|
| /external/guava/guava/src/com/google/common/collect/ |
| Cut.java | 309 @Nullable C next = domain.next(endpoint); local
310 return (next == null) ? Cut.<C>belowAll() : belowValue(next);
318 @Nullable C next = domain.next(endpoint); local
319 return (next == null) ? Cut.<C>aboveAll() : belowValue(next);
333 return domain.next(endpoint);
339 C next = leastValueAbove(domain) local
[all...] |
| ForwardingCollection.java | 172 if (Objects.equal(iterator.next(), object)) {
215 iterator.next();
|
| ForwardingMultiset.java | 124 entryIterator.next();
|
| ImmutableCollection.java | 165 return ImmutableList.of(iterator().next());
343 add(elements.next());
|
| SingletonImmutableList.java | 76 @Override public E next() { method
|
| /external/guava/guava/src/com/google/common/hash/ |
| Hashing.java | 192 int next; local
200 next = (int) ((candidate + 1) * inv);
202 if (next >= 0 && next < buckets) {
203 candidate = next;
223 int bits = iterator.next().bits();
249 byte[] resultBytes = new byte[iterator.next().bits() / 8];
|
| /external/guava/guava/src/com/google/common/math/ |
| DoubleUtils.java | 37 static double next(double x, boolean up) { method in class:DoubleUtils
|
| /external/guava/guava/src/com/google/common/primitives/ |
| UnsignedLongs.java | 87 long next = flip(array[i]); local
88 if (next < min) {
89 min = next;
107 long next = flip(array[i]); local
108 if (next > max) {
109 max = next;
|
| /external/guava/guava/src/com/google/common/util/concurrent/ |
| AtomicDouble.java | 96 long next = doubleToRawLongBits(newValue); local
97 value = next;
108 // long next = doubleToRawLongBits(newValue);
109 // updater.lazySet(this, next);
119 long next = doubleToRawLongBits(newValue); local
120 return longBitsToDouble(updater.getAndSet(this, next));
171 long next = doubleToRawLongBits(nextVal); local
172 if (updater.compareAndSet(this, current, next)) {
189 long next = doubleToRawLongBits(nextVal); local
190 if (updater.compareAndSet(this, current, next)) {
[all...] |
| AtomicDoubleArray.java | 103 long next = doubleToRawLongBits(newValue); local
104 longs.set(i, next);
116 // long next = doubleToRawLongBits(newValue);
117 // longs.lazySet(i, next);
129 long next = doubleToRawLongBits(newValue); local
130 return longBitsToDouble(longs.getAndSet(i, next));
186 long next = doubleToRawLongBits(nextVal); local
187 if (longs.compareAndSet(i, current, next)) {
205 long next = doubleToRawLongBits(nextVal); local
206 if (longs.compareAndSet(i, current, next)) {
[all...] |
