| /prebuilts/ndk/9/platforms/android-17/arch-mips/usr/include/sys/ |
| queue.h | 36 * This file defines five types of data structures: singly-linked lists,
39 * A singly-linked list is headed by a single forward pointer. The
40 * elements are singly linked for minimum space and pointer manipulation
45 * efficiency. A singly-linked list may only be traversed in the forward
46 * direction. Singly-linked lists are ideal for applications with large
50 * pointers for a hash table header). The elements are doubly linked
58 * linked to save space, so elements can only be removed from the
65 * linked so that an arbitrary element can be removed without a need to
72 * linked so that an arbitrary element can be removed without a need to
148 * Singly-linked List definitions
[all...] |
| /prebuilts/ndk/9/platforms/android-17/arch-x86/usr/include/sys/ |
| queue.h | 36 * This file defines five types of data structures: singly-linked lists,
39 * A singly-linked list is headed by a single forward pointer. The
40 * elements are singly linked for minimum space and pointer manipulation
45 * efficiency. A singly-linked list may only be traversed in the forward
46 * direction. Singly-linked lists are ideal for applications with large
50 * pointers for a hash table header). The elements are doubly linked
58 * linked to save space, so elements can only be removed from the
65 * linked so that an arbitrary element can be removed without a need to
72 * linked so that an arbitrary element can be removed without a need to
148 * Singly-linked List definitions
[all...] |
| /prebuilts/ndk/9/platforms/android-18/arch-arm/usr/include/sys/ |
| queue.h | 36 * This file defines five types of data structures: singly-linked lists,
39 * A singly-linked list is headed by a single forward pointer. The
40 * elements are singly linked for minimum space and pointer manipulation
45 * efficiency. A singly-linked list may only be traversed in the forward
46 * direction. Singly-linked lists are ideal for applications with large
50 * pointers for a hash table header). The elements are doubly linked
58 * linked to save space, so elements can only be removed from the
65 * linked so that an arbitrary element can be removed without a need to
72 * linked so that an arbitrary element can be removed without a need to
148 * Singly-linked List definitions
[all...] |
| /prebuilts/ndk/9/platforms/android-18/arch-mips/usr/include/sys/ |
| queue.h | 36 * This file defines five types of data structures: singly-linked lists,
39 * A singly-linked list is headed by a single forward pointer. The
40 * elements are singly linked for minimum space and pointer manipulation
45 * efficiency. A singly-linked list may only be traversed in the forward
46 * direction. Singly-linked lists are ideal for applications with large
50 * pointers for a hash table header). The elements are doubly linked
58 * linked to save space, so elements can only be removed from the
65 * linked so that an arbitrary element can be removed without a need to
72 * linked so that an arbitrary element can be removed without a need to
148 * Singly-linked List definitions
[all...] |
| /prebuilts/ndk/9/platforms/android-18/arch-x86/usr/include/sys/ |
| queue.h | 36 * This file defines five types of data structures: singly-linked lists,
39 * A singly-linked list is headed by a single forward pointer. The
40 * elements are singly linked for minimum space and pointer manipulation
45 * efficiency. A singly-linked list may only be traversed in the forward
46 * direction. Singly-linked lists are ideal for applications with large
50 * pointers for a hash table header). The elements are doubly linked
58 * linked to save space, so elements can only be removed from the
65 * linked so that an arbitrary element can be removed without a need to
72 * linked so that an arbitrary element can be removed without a need to
148 * Singly-linked List definitions
[all...] |
| /prebuilts/ndk/9/platforms/android-19/arch-arm/usr/include/sys/ |
| queue.h | 36 * This file defines five types of data structures: singly-linked lists,
39 * A singly-linked list is headed by a single forward pointer. The
40 * elements are singly linked for minimum space and pointer manipulation
45 * efficiency. A singly-linked list may only be traversed in the forward
46 * direction. Singly-linked lists are ideal for applications with large
50 * pointers for a hash table header). The elements are doubly linked
58 * linked to save space, so elements can only be removed from the
65 * linked so that an arbitrary element can be removed without a need to
72 * linked so that an arbitrary element can be removed without a need to
148 * Singly-linked List definitions
[all...] |
| /prebuilts/ndk/9/platforms/android-19/arch-arm64/usr/include/sys/ |
| queue.h | 36 * This file defines five types of data structures: singly-linked lists,
39 * A singly-linked list is headed by a single forward pointer. The
40 * elements are singly linked for minimum space and pointer manipulation
45 * efficiency. A singly-linked list may only be traversed in the forward
46 * direction. Singly-linked lists are ideal for applications with large
50 * pointers for a hash table header). The elements are doubly linked
58 * linked to save space, so elements can only be removed from the
65 * linked so that an arbitrary element can be removed without a need to
72 * linked so that an arbitrary element can be removed without a need to
148 * Singly-linked List definitions
[all...] |
| /prebuilts/ndk/9/platforms/android-19/arch-mips/usr/include/sys/ |
| queue.h | 36 * This file defines five types of data structures: singly-linked lists,
39 * A singly-linked list is headed by a single forward pointer. The
40 * elements are singly linked for minimum space and pointer manipulation
45 * efficiency. A singly-linked list may only be traversed in the forward
46 * direction. Singly-linked lists are ideal for applications with large
50 * pointers for a hash table header). The elements are doubly linked
58 * linked to save space, so elements can only be removed from the
65 * linked so that an arbitrary element can be removed without a need to
72 * linked so that an arbitrary element can be removed without a need to
148 * Singly-linked List definitions
[all...] |
| /prebuilts/ndk/9/platforms/android-19/arch-mips64/usr/include/sys/ |
| queue.h | 36 * This file defines five types of data structures: singly-linked lists,
39 * A singly-linked list is headed by a single forward pointer. The
40 * elements are singly linked for minimum space and pointer manipulation
45 * efficiency. A singly-linked list may only be traversed in the forward
46 * direction. Singly-linked lists are ideal for applications with large
50 * pointers for a hash table header). The elements are doubly linked
58 * linked to save space, so elements can only be removed from the
65 * linked so that an arbitrary element can be removed without a need to
72 * linked so that an arbitrary element can be removed without a need to
148 * Singly-linked List definitions
[all...] |
| /prebuilts/ndk/9/platforms/android-19/arch-x86/usr/include/sys/ |
| queue.h | 36 * This file defines five types of data structures: singly-linked lists,
39 * A singly-linked list is headed by a single forward pointer. The
40 * elements are singly linked for minimum space and pointer manipulation
45 * efficiency. A singly-linked list may only be traversed in the forward
46 * direction. Singly-linked lists are ideal for applications with large
50 * pointers for a hash table header). The elements are doubly linked
58 * linked to save space, so elements can only be removed from the
65 * linked so that an arbitrary element can be removed without a need to
72 * linked so that an arbitrary element can be removed without a need to
148 * Singly-linked List definitions
[all...] |
| /prebuilts/ndk/9/platforms/android-19/arch-x86_64/usr/include/sys/ |
| queue.h | 36 * This file defines five types of data structures: singly-linked lists,
39 * A singly-linked list is headed by a single forward pointer. The
40 * elements are singly linked for minimum space and pointer manipulation
45 * efficiency. A singly-linked list may only be traversed in the forward
46 * direction. Singly-linked lists are ideal for applications with large
50 * pointers for a hash table header). The elements are doubly linked
58 * linked to save space, so elements can only be removed from the
65 * linked so that an arbitrary element can be removed without a need to
72 * linked so that an arbitrary element can be removed without a need to
148 * Singly-linked List definitions
[all...] |
| /prebuilts/ndk/9/platforms/android-3/arch-arm/usr/include/sys/ |
| queue.h | 36 * This file defines five types of data structures: singly-linked lists,
39 * A singly-linked list is headed by a single forward pointer. The
40 * elements are singly linked for minimum space and pointer manipulation
45 * efficiency. A singly-linked list may only be traversed in the forward
46 * direction. Singly-linked lists are ideal for applications with large
50 * pointers for a hash table header). The elements are doubly linked
58 * linked to save space, so elements can only be removed from the
65 * linked so that an arbitrary element can be removed without a need to
72 * linked so that an arbitrary element can be removed without a need to
148 * Singly-linked List definitions
[all...] |
| /prebuilts/ndk/9/platforms/android-4/arch-arm/usr/include/sys/ |
| queue.h | 36 * This file defines five types of data structures: singly-linked lists,
39 * A singly-linked list is headed by a single forward pointer. The
40 * elements are singly linked for minimum space and pointer manipulation
45 * efficiency. A singly-linked list may only be traversed in the forward
46 * direction. Singly-linked lists are ideal for applications with large
50 * pointers for a hash table header). The elements are doubly linked
58 * linked to save space, so elements can only be removed from the
65 * linked so that an arbitrary element can be removed without a need to
72 * linked so that an arbitrary element can be removed without a need to
148 * Singly-linked List definitions
[all...] |
| /prebuilts/ndk/9/platforms/android-5/arch-arm/usr/include/sys/ |
| queue.h | 36 * This file defines five types of data structures: singly-linked lists,
39 * A singly-linked list is headed by a single forward pointer. The
40 * elements are singly linked for minimum space and pointer manipulation
45 * efficiency. A singly-linked list may only be traversed in the forward
46 * direction. Singly-linked lists are ideal for applications with large
50 * pointers for a hash table header). The elements are doubly linked
58 * linked to save space, so elements can only be removed from the
65 * linked so that an arbitrary element can be removed without a need to
72 * linked so that an arbitrary element can be removed without a need to
148 * Singly-linked List definitions
[all...] |
| /prebuilts/ndk/9/platforms/android-8/arch-arm/usr/include/sys/ |
| queue.h | 36 * This file defines five types of data structures: singly-linked lists,
39 * A singly-linked list is headed by a single forward pointer. The
40 * elements are singly linked for minimum space and pointer manipulation
45 * efficiency. A singly-linked list may only be traversed in the forward
46 * direction. Singly-linked lists are ideal for applications with large
50 * pointers for a hash table header). The elements are doubly linked
58 * linked to save space, so elements can only be removed from the
65 * linked so that an arbitrary element can be removed without a need to
72 * linked so that an arbitrary element can be removed without a need to
148 * Singly-linked List definitions
[all...] |
| /prebuilts/ndk/9/platforms/android-9/arch-arm/usr/include/sys/ |
| queue.h | 36 * This file defines five types of data structures: singly-linked lists,
39 * A singly-linked list is headed by a single forward pointer. The
40 * elements are singly linked for minimum space and pointer manipulation
45 * efficiency. A singly-linked list may only be traversed in the forward
46 * direction. Singly-linked lists are ideal for applications with large
50 * pointers for a hash table header). The elements are doubly linked
58 * linked to save space, so elements can only be removed from the
65 * linked so that an arbitrary element can be removed without a need to
72 * linked so that an arbitrary element can be removed without a need to
148 * Singly-linked List definitions
[all...] |
| /prebuilts/ndk/9/platforms/android-9/arch-mips/usr/include/sys/ |
| queue.h | 36 * This file defines five types of data structures: singly-linked lists,
39 * A singly-linked list is headed by a single forward pointer. The
40 * elements are singly linked for minimum space and pointer manipulation
45 * efficiency. A singly-linked list may only be traversed in the forward
46 * direction. Singly-linked lists are ideal for applications with large
50 * pointers for a hash table header). The elements are doubly linked
58 * linked to save space, so elements can only be removed from the
65 * linked so that an arbitrary element can be removed without a need to
72 * linked so that an arbitrary element can be removed without a need to
148 * Singly-linked List definitions
[all...] |
| /prebuilts/ndk/9/platforms/android-9/arch-x86/usr/include/sys/ |
| queue.h | 36 * This file defines five types of data structures: singly-linked lists,
39 * A singly-linked list is headed by a single forward pointer. The
40 * elements are singly linked for minimum space and pointer manipulation
45 * efficiency. A singly-linked list may only be traversed in the forward
46 * direction. Singly-linked lists are ideal for applications with large
50 * pointers for a hash table header). The elements are doubly linked
58 * linked to save space, so elements can only be removed from the
65 * linked so that an arbitrary element can be removed without a need to
72 * linked so that an arbitrary element can be removed without a need to
148 * Singly-linked List definitions
[all...] |
| /external/chromium_org/third_party/tcmalloc/chromium/src/ |
| addressmap-inl.h | 51 // block-ID tht points to the first entry in the linked-list
53 // 3. At the bottom, we keep a singly-linked list of all
78 // c. A traversal over the linked-list for a block
152 // up the address-space into blocks and using a linked-list entry
155 // Size of each block. There is one linked-list for each block, so
157 // will be spent traversing linked lists.
161 // Entry kept in per-block linked-list
170 // linked-lists, one list per contained block.
179 Entry* blocks[kClusterBlocks]; // Per-block linked-lists
240 // Memory management -- we keep all objects we allocate linked
[all...] |
| /external/chromium_org/third_party/tcmalloc/vendor/src/ |
| addressmap-inl.h | 51 // block-ID tht points to the first entry in the linked-list
53 // 3. At the bottom, we keep a singly-linked list of all
78 // c. A traversal over the linked-list for a block
152 // up the address-space into blocks and using a linked-list entry
155 // Size of each block. There is one linked-list for each block, so
157 // will be spent traversing linked lists.
161 // Entry kept in per-block linked-list
170 // linked-lists, one list per contained block.
179 Entry* blocks[kClusterBlocks]; // Per-block linked-lists
240 // Memory management -- we keep all objects we allocate linked
[all...] |
| /external/chromium_org/third_party/mesa/src/src/glsl/ |
| opt_array_splitting.cpp | 101 bool get_split_list(exec_list *instructions, bool linked);
204 bool linked)
208 /* If the shaders aren't linked yet, we can't mess with global
211 if (!linked) {
356 optimize_split_arrays(exec_list *instructions, bool linked)
359 if (!refs.get_split_list(instructions, linked))
|
| /external/emma/core/java12/com/vladium/util/ |
| IntIntMap.java | 90 // traverse the singly-linked list of entries in the bucket:
114 // traverse the singly-linked list of entries in the bucket:
133 // traverse the singly-linked list of entries in the bucket:
177 // traverse the singly-linked list of entries in the bucket:
220 // traverse the singly-linked list of entries in the bucket:
276 Entry m_next; // singly-linked list link
|
| /external/llvm/lib/ExecutionEngine/ |
| RTDyldMemoryManager.cpp | 126 // How can it find the end? Because crtendS.o is linked
143 // ARM math functions are statically linked on Android from libgcc.a, but not
147 // List of functions which are statically linked on Android and can be generated
203 // Declare statically linked math functions on ARM. The function declarations
221 // Force the following functions to be linked in to anything that uses the
241 // ARM_MATH_IMPORTS, and if so redirect to the statically linked symbol.
|
| /external/mesa3d/src/glsl/ |
| opt_array_splitting.cpp | 101 bool get_split_list(exec_list *instructions, bool linked);
204 bool linked)
208 /* If the shaders aren't linked yet, we can't mess with global
211 if (!linked) {
356 optimize_split_arrays(exec_list *instructions, bool linked)
359 if (!refs.get_split_list(instructions, linked))
|
| /bootable/recovery/updater/ |
| Android.mk | 11 # Build a statically-linked binary to include in OTA packages
45 # These libs are also linked in with updater, but we don't try to call
|
