| /external/openssl/crypto/pqueue/ |
| pqueue.h | 73 struct _pitem *next; member in struct:_pitem
|
| /external/openssl/include/openssl/ |
| pqueue.h | 73 struct _pitem *next; member in struct:_pitem
|
| /external/oprofile/daemon/liblegacy/ |
| opd_mapping.h | 26 /** next mapping for this image */
27 struct list_head next; member in struct:opd_map
|
| opd_proc.h | 43 struct list_head next; member in struct:opd_proc
|
| /external/qemu/ |
| acl.h | 37 QTAILQ_ENTRY(qemu_acl_entry) next; member in struct:qemu_acl_entry
|
| disas.h | 36 struct syminfo *next; member in struct:syminfo
|
| qlist.h | 22 QTAILQ_ENTRY(QListEntry) next; member in struct:QListEntry
36 (var) = ((var)->next.tqe_next))
|
| /external/qemu/android/ |
| cmdline-option.h | 19 struct ParamList* next; member in struct:ParamList
|
| /external/qemu/hw/ |
| boards.h | 20 struct QEMUMachine *next; member in struct:QEMUMachine
|
| /external/skia/include/core/ |
| SkTRegistry.h | 42 const SkTRegistry* next() const { return fChain; } function in class:SkTRegistry
|
| /external/skia/src/core/ |
| SkDeviceLooper.cpp | 17 // sentinels that next() has not yet been called, and so our mapper functions
32 // back up by 1 DX, so that next() will put us in a correct starting
100 bool SkDeviceLooper::next() { function in class:SkDeviceLooper
|
| /external/smack/src/org/jivesoftware/smackx/provider/ |
| HeaderProvider.java | 33 parser.next();
39 parser.next();
|
| /external/tcpdump/ |
| cpack.c | 52 /* Advance to the next wordsize boundary. Return NULL if fewer than
59 u_int8_t *next; local
62 next = cpack_next_boundary(cs->c_buf, cs->c_next, wordsize);
65 if (next - cs->c_buf + wordsize > cs->c_len)
68 return next;
87 u_int8_t *next; local
89 if ((next = cpack_align_and_reserve(cs, sizeof(*u))) == NULL)
92 *u = EXTRACT_LE_64BITS(next);
95 cs->c_next = next + sizeof(*u);
103 u_int8_t *next; local
119 u_int8_t *next; local
[all...] |
| /external/v8/tools/ |
| consarray.js | 56 this.tail_ = this.tail_.next = new ConsArray.Cell(null, null);
72 * Returns the current item, moves to the next one.
74 ConsArray.prototype.next = function() {
77 this.currCell_ = this.currCell_.next;
89 ConsArray.Cell = function(data, next) {
91 this.next = next;
|
| /external/valgrind/main/callgrind/ |
| costs.h | 25 CostChunk *next, *prev; member in struct:_CostChunk
|
| /frameworks/av/media/libstagefright/ |
| MediaBufferGroup.cpp | 32 MediaBuffer *next; local
34 buffer = next) {
35 next = buffer->nextBuffer();
|
| /frameworks/base/graphics/java/android/graphics/ |
| RegionIterator.java | 33 * Return the next rectangle in the region. If there are no more rectangles
37 public final boolean next(Rect r) { method in class:RegionIterator
|
| /hardware/akm/AK8975_FS/libsensors/ |
| InputEventReader.cpp | 81 void InputEventCircularReader::next() function in class:InputEventCircularReader
|
| /hardware/qcom/camera/QCamera2/stack/common/ |
| cam_list.h | 43 struct cam_list *next, *prev; member in struct:cam_list
48 ptr->next = ptr;
58 item->next = head;
60 prev->next = item;
66 item->next = node;
68 item->prev->next = item;
75 struct cam_list *next = ptr->next; local
77 next->prev = ptr->prev;
78 prev->next = ptr->next
[all...] |
| /hardware/ti/omap3/dspbridge/inc/ |
| list.h | 60 #define LST_IsEmpty(l) (((l)->head.next == &(l)->head))
63 struct LST_ELEM *next; member in struct:LST_ELEM
84 * An empty list is indicated by the "next" pointer in the element
95 * "empty" element, because its "next" and "prev" pointers point at
158 * Else, removes the element at the head of the list, making the next
161 * "next" pointer at the next element after the head, and by making the
162 * "prev" pointer of the next element after the head point at the tail
163 * element. So the next element after the head becomes the new head of
177 * Because the tail of the list points forward (its "next" pointer) t
[all...] |
| /hardware/ti/omap3/dspbridge/libbridge/inc/ |
| list.h | 60 #define LST_IsEmpty(l) (((l)->head.next == &(l)->head))
63 struct LST_ELEM *next; member in struct:LST_ELEM
84 * An empty list is indicated by the "next" pointer in the element
95 * "empty" element, because its "next" and "prev" pointers point at
158 * Else, removes the element at the head of the list, making the next
161 * "next" pointer at the next element after the head, and by making the
162 * "prev" pointer of the next element after the head point at the tail
163 * element. So the next element after the head becomes the new head of
177 * Because the tail of the list points forward (its "next" pointer) t
[all...] |
| /hardware/ti/wlan/lib/ |
| shlist.h | 9 struct SHLIST_STRUC *next; member in struct:SHLIST_STRUC
|
| /libcore/luni/src/main/java/java/sql/ |
| SQLWarning.java | 126 * Gets the next {@code SQLWarning} chained to this {@code SQLWarning} object.
133 SQLException next = super.getNextException(); local
134 if (next == null) {
137 if (next instanceof SQLWarning) {
138 return (SQLWarning) next;
|
| /libcore/luni/src/test/java/libcore/java/util/ |
| OldAbstractSetTest.java | 38 public Object next() { method in class:OldAbstractSetTest.Mock_AbstractSet
74 public Object next() {
|
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/mpl/list/aux_/ |
| iterator.hpp | 43 struct next< l_iter<Node> > struct in namespace:boost::mpl
45 typedef l_iter< typename Node::next > type;
56 typedef l_iter< typename mpl::next<Node>::type > next;
68 typedef l_iter next; typedef in struct:boost::mpl::l_iter
|
