/prebuilts/ndk/android-ndk-r7/platforms/android-9/arch-x86/usr/include/linux/ |
circ_buf.h | 17 int head; member in struct:circ_buf 21 #define CIRC_CNT(head,tail,size) (((head) - (tail)) & ((size)-1)) 23 #define CIRC_SPACE(head,tail,size) CIRC_CNT((tail),((head)+1),(size)) 25 #define CIRC_CNT_TO_END(head,tail,size) ({int end = (size) - (tail); int n = ((head) + end) & ((size)-1); n < end ? n : end;}) 27 #define CIRC_SPACE_TO_END(head,tail,size) ({int end = (size) - 1 - (head); int n = (end + (tail)) & ((size)-1); n <= end ? n : end+1;})
|
/external/qemu/ |
qemu-queue.h | 51 * or after an existing element or at the head of the list. A list 54 * A simple queue is headed by a pair of pointers, one the head of the 57 * head of the list. New elements can be added to the list after 58 * an existing element, at the head of the list, or at the end of the 61 * A tail queue is headed by a pair of pointers, one to the head of the 65 * after an existing element, at the head of the list, or at the end of 68 * A circle queue is headed by a pair of pointers, one to the head of the 72 * an existing element, at the head of the list, or at the end of the list. 87 #define QLIST_HEAD_INITIALIZER(head) \ 99 #define QLIST_INIT(head) do { [all...] |
/external/chromium/net/base/ |
address_list_net_log_param.cc | 21 for (const addrinfo* head = address_list_.head(); 22 head != NULL ; head = head->ai_next) { 23 list->Append(Value::CreateStringValue(NetAddressToStringWithPort(head)));
|
/bionic/libc/include/sys/ |
queue.h | 43 * head of the list. Elements being removed from the head of the list 53 * or after an existing element or at the head of the list. A list 56 * A simple queue is headed by a pair of pointers, one the head of the 59 * head of the list. New elements can be added to the list after 60 * an existing element, at the head of the list, or at the end of the 63 * A tail queue is headed by a pair of pointers, one to the head of the 67 * after an existing element, at the head of the list, or at the end of 70 * A circle queue is headed by a pair of pointers, one to the head of the 74 * an existing element, at the head of the list, or at the end of the list [all...] |
/development/ndk/platforms/android-3/include/sys/ |
queue.h | 43 * head of the list. Elements being removed from the head of the list 53 * or after an existing element or at the head of the list. A list 56 * A simple queue is headed by a pair of pointers, one the head of the 59 * head of the list. New elements can be added to the list after 60 * an existing element, at the head of the list, or at the end of the 63 * A tail queue is headed by a pair of pointers, one to the head of the 67 * after an existing element, at the head of the list, or at the end of 70 * A circle queue is headed by a pair of pointers, one to the head of the 74 * an existing element, at the head of the list, or at the end of the list [all...] |
/prebuilts/gcc/darwin-x86/mips/mipsel-linux-android-4.4.3/sysroot/usr/include/sys/ |
queue.h | 43 * head of the list. Elements being removed from the head of the list 53 * or after an existing element or at the head of the list. A list 56 * A simple queue is headed by a pair of pointers, one the head of the 59 * head of the list. New elements can be added to the list after 60 * an existing element, at the head of the list, or at the end of the 63 * A tail queue is headed by a pair of pointers, one to the head of the 67 * after an existing element, at the head of the list, or at the end of 70 * A circle queue is headed by a pair of pointers, one to the head of the 74 * an existing element, at the head of the list, or at the end of the list [all...] |
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/sys/ |
queue.h | 43 * head of the list. Elements being removed from the head of the list 53 * or after an existing element or at the head of the list. A list 56 * A simple queue is headed by a pair of pointers, one the head of the 59 * head of the list. New elements can be added to the list after 60 * an existing element, at the head of the list, or at the end of the 63 * A tail queue is headed by a pair of pointers, one to the head of the 67 * after an existing element, at the head of the list, or at the end of 70 * A circle queue is headed by a pair of pointers, one to the head of the 74 * an existing element, at the head of the list, or at the end of the list [all...] |
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/sys/ |
queue.h | 43 * head of the list. Elements being removed from the head of the list 53 * or after an existing element or at the head of the list. A list 56 * A simple queue is headed by a pair of pointers, one the head of the 59 * head of the list. New elements can be added to the list after 60 * an existing element, at the head of the list, or at the end of the 63 * A tail queue is headed by a pair of pointers, one to the head of the 67 * after an existing element, at the head of the list, or at the end of 70 * A circle queue is headed by a pair of pointers, one to the head of the 74 * an existing element, at the head of the list, or at the end of the list [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/sys/ |
queue.h | 43 * head of the list. Elements being removed from the head of the list 53 * or after an existing element or at the head of the list. A list 56 * A simple queue is headed by a pair of pointers, one the head of the 59 * head of the list. New elements can be added to the list after 60 * an existing element, at the head of the list, or at the end of the 63 * A tail queue is headed by a pair of pointers, one to the head of the 67 * after an existing element, at the head of the list, or at the end of 70 * A circle queue is headed by a pair of pointers, one to the head of the 74 * an existing element, at the head of the list, or at the end of the list [all...] |
/prebuilts/gcc/linux-x86/mips/mipsel-linux-android-4.4.3/sysroot/usr/include/sys/ |
queue.h | 43 * head of the list. Elements being removed from the head of the list 53 * or after an existing element or at the head of the list. A list 56 * A simple queue is headed by a pair of pointers, one the head of the 59 * head of the list. New elements can be added to the list after 60 * an existing element, at the head of the list, or at the end of the 63 * A tail queue is headed by a pair of pointers, one to the head of the 67 * after an existing element, at the head of the list, or at the end of 70 * A circle queue is headed by a pair of pointers, one to the head of the 74 * an existing element, at the head of the list, or at the end of the list [all...] |
/prebuilts/ndk/android-ndk-r4/platforms/android-8/arch-arm/usr/include/sys/ |
queue.h | 43 * head of the list. Elements being removed from the head of the list 53 * or after an existing element or at the head of the list. A list 56 * A simple queue is headed by a pair of pointers, one the head of the 59 * head of the list. New elements can be added to the list after 60 * an existing element, at the head of the list, or at the end of the 63 * A tail queue is headed by a pair of pointers, one to the head of the 67 * after an existing element, at the head of the list, or at the end of 70 * A circle queue is headed by a pair of pointers, one to the head of the 74 * an existing element, at the head of the list, or at the end of the list [all...] |
/prebuilts/ndk/android-ndk-r4/platforms/android-8/arch-x86/usr/include/sys/ |
queue.h | 43 * head of the list. Elements being removed from the head of the list 53 * or after an existing element or at the head of the list. A list 56 * A simple queue is headed by a pair of pointers, one the head of the 59 * head of the list. New elements can be added to the list after 60 * an existing element, at the head of the list, or at the end of the 63 * A tail queue is headed by a pair of pointers, one to the head of the 67 * after an existing element, at the head of the list, or at the end of 70 * A circle queue is headed by a pair of pointers, one to the head of the 74 * an existing element, at the head of the list, or at the end of the list [all...] |
/prebuilts/ndk/android-ndk-r5/platforms/android-3/arch-arm/usr/include/sys/ |
queue.h | 43 * head of the list. Elements being removed from the head of the list 53 * or after an existing element or at the head of the list. A list 56 * A simple queue is headed by a pair of pointers, one the head of the 59 * head of the list. New elements can be added to the list after 60 * an existing element, at the head of the list, or at the end of the 63 * A tail queue is headed by a pair of pointers, one to the head of the 67 * after an existing element, at the head of the list, or at the end of 70 * A circle queue is headed by a pair of pointers, one to the head of the 74 * an existing element, at the head of the list, or at the end of the list [all...] |
/prebuilts/ndk/android-ndk-r6/platforms/android-3/arch-arm/usr/include/sys/ |
queue.h | 43 * head of the list. Elements being removed from the head of the list 53 * or after an existing element or at the head of the list. A list 56 * A simple queue is headed by a pair of pointers, one the head of the 59 * head of the list. New elements can be added to the list after 60 * an existing element, at the head of the list, or at the end of the 63 * A tail queue is headed by a pair of pointers, one to the head of the 67 * after an existing element, at the head of the list, or at the end of 70 * A circle queue is headed by a pair of pointers, one to the head of the 74 * an existing element, at the head of the list, or at the end of the list [all...] |
/prebuilts/ndk/android-ndk-r6/platforms/android-3/arch-x86/usr/include/sys/ |
queue.h | 43 * head of the list. Elements being removed from the head of the list 53 * or after an existing element or at the head of the list. A list 56 * A simple queue is headed by a pair of pointers, one the head of the 59 * head of the list. New elements can be added to the list after 60 * an existing element, at the head of the list, or at the end of the 63 * A tail queue is headed by a pair of pointers, one to the head of the 67 * after an existing element, at the head of the list, or at the end of 70 * A circle queue is headed by a pair of pointers, one to the head of the 74 * an existing element, at the head of the list, or at the end of the list [all...] |
/prebuilts/ndk/android-ndk-r7/platforms/android-14/arch-arm/usr/include/sys/ |
queue.h | 43 * head of the list. Elements being removed from the head of the list 53 * or after an existing element or at the head of the list. A list 56 * A simple queue is headed by a pair of pointers, one the head of the 59 * head of the list. New elements can be added to the list after 60 * an existing element, at the head of the list, or at the end of the 63 * A tail queue is headed by a pair of pointers, one to the head of the 67 * after an existing element, at the head of the list, or at the end of 70 * A circle queue is headed by a pair of pointers, one to the head of the 74 * an existing element, at the head of the list, or at the end of the list [all...] |
/prebuilts/ndk/android-ndk-r7/platforms/android-14/arch-x86/usr/include/sys/ |
queue.h | 43 * head of the list. Elements being removed from the head of the list 53 * or after an existing element or at the head of the list. A list 56 * A simple queue is headed by a pair of pointers, one the head of the 59 * head of the list. New elements can be added to the list after 60 * an existing element, at the head of the list, or at the end of the 63 * A tail queue is headed by a pair of pointers, one to the head of the 67 * after an existing element, at the head of the list, or at the end of 70 * A circle queue is headed by a pair of pointers, one to the head of the 74 * an existing element, at the head of the list, or at the end of the list [all...] |
/prebuilts/ndk/android-ndk-r7/platforms/android-3/arch-arm/usr/include/sys/ |
queue.h | 43 * head of the list. Elements being removed from the head of the list 53 * or after an existing element or at the head of the list. A list 56 * A simple queue is headed by a pair of pointers, one the head of the 59 * head of the list. New elements can be added to the list after 60 * an existing element, at the head of the list, or at the end of the 63 * A tail queue is headed by a pair of pointers, one to the head of the 67 * after an existing element, at the head of the list, or at the end of 70 * A circle queue is headed by a pair of pointers, one to the head of the 74 * an existing element, at the head of the list, or at the end of the list [all...] |
/prebuilts/ndk/android-ndk-r7/platforms/android-3/arch-x86/usr/include/sys/ |
queue.h | 43 * head of the list. Elements being removed from the head of the list 53 * or after an existing element or at the head of the list. A list 56 * A simple queue is headed by a pair of pointers, one the head of the 59 * head of the list. New elements can be added to the list after 60 * an existing element, at the head of the list, or at the end of the 63 * A tail queue is headed by a pair of pointers, one to the head of the 67 * after an existing element, at the head of the list, or at the end of 70 * A circle queue is headed by a pair of pointers, one to the head of the 74 * an existing element, at the head of the list, or at the end of the list [all...] |
/prebuilts/ndk/android-ndk-r7/platforms/android-4/arch-arm/usr/include/sys/ |
queue.h | 43 * head of the list. Elements being removed from the head of the list 53 * or after an existing element or at the head of the list. A list 56 * A simple queue is headed by a pair of pointers, one the head of the 59 * head of the list. New elements can be added to the list after 60 * an existing element, at the head of the list, or at the end of the 63 * A tail queue is headed by a pair of pointers, one to the head of the 67 * after an existing element, at the head of the list, or at the end of 70 * A circle queue is headed by a pair of pointers, one to the head of the 74 * an existing element, at the head of the list, or at the end of the list [all...] |
/prebuilts/ndk/android-ndk-r7/platforms/android-4/arch-x86/usr/include/sys/ |
queue.h | 43 * head of the list. Elements being removed from the head of the list 53 * or after an existing element or at the head of the list. A list 56 * A simple queue is headed by a pair of pointers, one the head of the 59 * head of the list. New elements can be added to the list after 60 * an existing element, at the head of the list, or at the end of the 63 * A tail queue is headed by a pair of pointers, one to the head of the 67 * after an existing element, at the head of the list, or at the end of 70 * A circle queue is headed by a pair of pointers, one to the head of the 74 * an existing element, at the head of the list, or at the end of the list [all...] |
/prebuilts/ndk/android-ndk-r7/platforms/android-5/arch-arm/usr/include/sys/ |
queue.h | 43 * head of the list. Elements being removed from the head of the list 53 * or after an existing element or at the head of the list. A list 56 * A simple queue is headed by a pair of pointers, one the head of the 59 * head of the list. New elements can be added to the list after 60 * an existing element, at the head of the list, or at the end of the 63 * A tail queue is headed by a pair of pointers, one to the head of the 67 * after an existing element, at the head of the list, or at the end of 70 * A circle queue is headed by a pair of pointers, one to the head of the 74 * an existing element, at the head of the list, or at the end of the list [all...] |
/prebuilts/ndk/android-ndk-r7/platforms/android-5/arch-x86/usr/include/sys/ |
queue.h | 43 * head of the list. Elements being removed from the head of the list 53 * or after an existing element or at the head of the list. A list 56 * A simple queue is headed by a pair of pointers, one the head of the 59 * head of the list. New elements can be added to the list after 60 * an existing element, at the head of the list, or at the end of the 63 * A tail queue is headed by a pair of pointers, one to the head of the 67 * after an existing element, at the head of the list, or at the end of 70 * A circle queue is headed by a pair of pointers, one to the head of the 74 * an existing element, at the head of the list, or at the end of the list [all...] |
/prebuilts/ndk/android-ndk-r7/platforms/android-8/arch-arm/usr/include/sys/ |
queue.h | 43 * head of the list. Elements being removed from the head of the list 53 * or after an existing element or at the head of the list. A list 56 * A simple queue is headed by a pair of pointers, one the head of the 59 * head of the list. New elements can be added to the list after 60 * an existing element, at the head of the list, or at the end of the 63 * A tail queue is headed by a pair of pointers, one to the head of the 67 * after an existing element, at the head of the list, or at the end of 70 * A circle queue is headed by a pair of pointers, one to the head of the 74 * an existing element, at the head of the list, or at the end of the list [all...] |
/prebuilts/ndk/android-ndk-r7/platforms/android-8/arch-x86/usr/include/sys/ |
queue.h | 43 * head of the list. Elements being removed from the head of the list 53 * or after an existing element or at the head of the list. A list 56 * A simple queue is headed by a pair of pointers, one the head of the 59 * head of the list. New elements can be added to the list after 60 * an existing element, at the head of the list, or at the end of the 63 * A tail queue is headed by a pair of pointers, one to the head of the 67 * after an existing element, at the head of the list, or at the end of 70 * A circle queue is headed by a pair of pointers, one to the head of the 74 * an existing element, at the head of the list, or at the end of the list [all...] |