/external/okhttp/okio/src/main/java/okio/ |
H A D | Segment.java | 36 /** The next byte of application data byte to read in this segment. */ 43 Segment next; field in class:Segment 53 Segment result = next != this ? next : null; 54 prev.next = next; 55 next.prev = prev; 56 next = null; 67 segment.next = next; [all...] |
/external/oprofile/daemon/liblegacy/ |
H A D | opd_mapping.h | 26 /** next mapping for this image */ 27 struct list_head next; member in struct:opd_map
|
/external/oprofile/opjitconv/ |
H A D | conversion.c | 20 struct jitentry * entry, * next; local 22 for (entry = jitentry_list; entry; entry = next) { 25 next = entry->next; 33 struct jitentry_debug_line * entry, * next; local 35 for (entry = jitentry_debug_line_list; entry; entry = next) { 36 next = entry->next;
|
/external/ppp/pppd/plugins/radius/ |
H A D | clientid.c | 19 struct map2id_s *next; member in struct:map2id_s 76 p->next = map2id_list; 115 for(p = map2id_list; p; p = p->next)
|
/external/proguard/src/proguard/gui/ |
H A D | TabbedPane.java | 205 * Selects the next tab. 207 public void next() method in class:TabbedPane 209 cardLayout.next(cardPanel);
|
/external/qemu/android/utils/ |
H A D | list.h | 23 * - List entries contain references to the next, and the previous entry in the 26 * in its 'next' reference, and the "list head" references the "last" entry in 28 * - The list is empty if its 'next' and 'previous' references are addressing the 34 ACList* next; member in struct:ACList 43 list->next = list->prev = list; 50 return list->next == list; 57 ACList* const next = list->next; local 58 entry->next = next; 79 ACList* const next = entry->next; local [all...] |
/external/qemu/distrib/libselinux/src/ |
H A D | avc_sidtab.h | 14 struct sidtab_node *next; member in struct:sidtab_node
|
/external/qemu/include/qapi/qmp/ |
H A D | qdict.h | 26 QLIST_ENTRY(QDictEntry) next; member in struct:QDictEntry
|
H A D | qlist.h | 21 QTAILQ_ENTRY(QListEntry) next; member in struct:QListEntry 35 (var) = ((var)->next.tqe_next)) 60 return QTAILQ_NEXT(entry, next);
|
/external/qemu/include/sysemu/ |
H A D | blockdev.h | 31 QTAILQ_ENTRY(DriveInfo) next; member in struct:DriveInfo
|
/external/qemu/util/ |
H A D | notify.c | 36 Notifier *notifier, *next; local 38 QLIST_FOREACH_SAFE(notifier, &list->notifiers, node, next) { 61 NotifierWithReturn *notifier, *next; local 64 QLIST_FOREACH_SAFE(notifier, &list->notifiers, node, next) {
|
/external/skia/include/core/ |
H A D | SkTRegistry.h | 42 const SkTRegistry* next() const { return fChain; } function in class:SkTRegistry
|
/external/skia/src/core/ |
H A D | SkRecordDraw.h | 26 void next() { ++fIndex; } function in class:SkRecords::Draw
|
H A D | SkRefDict.cpp | 83 Impl* next = rec->fNext; local 86 rec = next;
|
/external/skia/tests/ |
H A D | SListTest.cpp | 13 SListEntry* next() { return getSListNext(); } function in class:SListEntry 41 SListEntry* next = list.head(); local 48 if (NULL == next) { 52 if (next!= value) { 56 next = next->next(); 58 if (NULL != next) {
|
/external/smack/src/org/jivesoftware/smack/util/collections/ |
H A D | MapIterator.java | 32 * to <code>next()</code>, the <code>getValue()</code> method provides direct 37 * Object key = it.next(); 57 * Gets the next <em>key</em> from the <code>Map</code>. 59 * @return the next key in the iteration 63 K next(); method in interface:MapIterator 68 * to <code>next()</code>. 71 * @throws IllegalStateException if <code>next()</code> has not yet been called 77 * returned by <code>next()</code>. 80 * @throws IllegalStateException if <code>next()</code> has not yet been called 88 * This method can be called once per call to <code>next()</cod [all...] |
/external/smack/src/org/xbill/DNS/ |
H A D | Compression.java | 18 Entry next; field in class:Compression.Entry 47 entry.next = table[row]; 63 for (Entry entry = table[row]; entry != null; entry = entry.next) {
|
/external/smali/dexlib2/src/main/java/org/jf/dexlib2/dexbacked/util/ |
H A D | ParameterIterator.java | 62 @Override public MethodParameter next() { method in class:ParameterIterator 63 @Nonnull final String type = parameterTypes.next().toString(); 68 annotations = parameterAnnotations.next(); 74 name = parameterNames.next();
|
H A D | VariableSizeIterator.java | 58 * Reads the next item from reader. 60 * @param reader The {@code DexReader} to read the next item from 76 public T next() { method in class:VariableSizeIterator
|
H A D | VariableSizeLookaheadIterator.java | 53 * Reads the next item from reader. If the end of the list has been reached, it should return null. 66 public T next() { method in class:VariableSizeLookaheadIterator
|
/external/smali/util/src/main/java/org/jf/util/ |
H A D | AbstractListIterator.java | 43 public T next() { method in class:AbstractListIterator
|
/external/srec/config/en.us/dictionary/ |
H A D | cmu2nuance.cpp | 78 const char* next = 0; local 80 (next=xlate(p, "AA1 R", ")r")) || // odd AA D 81 (next=xlate(p, "AA0", "o")) || // odd AA D 82 (next=xlate(p, "AA1", "o")) || // odd AA D 83 (next=xlate(p, "AA2", "o")) || // odd AA D 85 (next=xlate(p, "AE0", "a")) || // at AE T 86 (next=xlate(p, "AE1", "a")) || // at AE T 87 (next=xlate(p, "AE2", "a")) || // at AE T 89 // (next=xlate(p, "AH0 L", "L")) || // drops accuracy by 1% 90 (next [all...] |
/external/srec/seti/sltsEngine/include/ |
H A D | linklist.h | 22 /* each node stores pointer to data, and pointer to next node */ 25 struct LNode *next; member in struct:LNode
|
/external/srec/srec/Semproc/include/ |
H A D | SR_SymbolTable.h | 70 * Pointer to the next available symbol slot for storing a symbol in the array 72 Symbol *next; member in struct:SymbolTable_t
|
/external/wpa_supplicant_8/hostapd/src/ap/ |
H A D | ap_list.h | 15 /* Note: next/prev pointers are updated whenever a new beacon is 18 struct ap_info *next; /* next entry in AP list */ member in struct:ap_info 20 struct ap_info *hnext; /* next entry in hash table list */
|