| /aosp_15_r20/external/coreboot/payloads/libpayload/include/ |
| H A D | queue.h | 39 * This file defines five types of data structures: singly-linked lists,
43 * A singly-linked list is headed by a single forward pointer. The elements
46 * added to the list after an existing element or at the head of the list.
47 * Elements being removed from the head of the list should use the explicit
48 * macro for this purpose for optimum efficiency. A singly-linked list may
49 * only be traversed in the forward direction. Singly-linked lists are ideal
57 * or after an existing element or at the head of the list. A list
60 * A simple queue is headed by a pair of pointers, one the head of the
63 * head of the list. New elements can be added to the list before or after
64 * an existing element, at the head of the list, or at the end of the
[all …]
|
| /aosp_15_r20/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.17-4.8/sysroot/usr/include/i386-linux-gnu/sys/ |
| D | 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
43 * head of the list. Elements being removed from the head of the list
45 * efficiency. A singly-linked list may only be traversed in the forward
46 * direction. Singly-linked lists are ideal for applications with large
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
[all …]
|
| /aosp_15_r20/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.17-4.8/sysroot/usr/include/x86_64-linux-gnu/sys/ |
| D | 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
43 * head of the list. Elements being removed from the head of the list
45 * efficiency. A singly-linked list may only be traversed in the forward
46 * direction. Singly-linked lists are ideal for applications with large
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
[all …]
|
| /aosp_15_r20/prebuilts/runtime/mainline/runtime/sdk/android/x86_64/include/bionic/libc/include/sys/ |
| H A D | queue.h | 38 * This file defines five types of data structures: singly-linked lists,
41 * A singly-linked list is headed by a single forward pointer. The
45 * head of the list. Elements being removed from the head of the list
47 * efficiency. A singly-linked list may only be traversed in the forward
48 * direction. Singly-linked lists are ideal for applications with large
55 * or after an existing element or at the head of the list. A list
58 * A simple queue is headed by a pair of pointers, one the head of the
61 * head of the list. New elements can be added to the list after
62 * an existing element, at the head of the list, or at the end of the
65 * A tail queue is headed by a pair of pointers, one to the head of the
[all …]
|
| /aosp_15_r20/prebuilts/vndk/v34/x86_64/include/generated-headers/bionic/libc/libc/android_vendor.34_x86_64_shared/gen/include/sys/ |
| D | queue.h | 38 * This file defines five types of data structures: singly-linked lists,
41 * A singly-linked list is headed by a single forward pointer. The
45 * head of the list. Elements being removed from the head of the list
47 * efficiency. A singly-linked list may only be traversed in the forward
48 * direction. Singly-linked lists are ideal for applications with large
55 * or after an existing element or at the head of the list. A list
58 * A simple queue is headed by a pair of pointers, one the head of the
61 * head of the list. New elements can be added to the list after
62 * an existing element, at the head of the list, or at the end of the
65 * A tail queue is headed by a pair of pointers, one to the head of the
[all …]
|
| /aosp_15_r20/prebuilts/vndk/v34/arm64/include/generated-headers/bionic/libc/libc/android_vendor.34_arm64_armv8-a_shared/gen/include/sys/ |
| D | queue.h | 38 * This file defines five types of data structures: singly-linked lists,
41 * A singly-linked list is headed by a single forward pointer. The
45 * head of the list. Elements being removed from the head of the list
47 * efficiency. A singly-linked list may only be traversed in the forward
48 * direction. Singly-linked lists are ideal for applications with large
55 * or after an existing element or at the head of the list. A list
58 * A simple queue is headed by a pair of pointers, one the head of the
61 * head of the list. New elements can be added to the list after
62 * an existing element, at the head of the list, or at the end of the
65 * A tail queue is headed by a pair of pointers, one to the head of the
[all …]
|
| /aosp_15_r20/prebuilts/vndk/v32/x86_64/include/generated-headers/bionic/libc/libc/android_vendor.32_x86_64_shared/gen/include/sys/ |
| D | queue.h | 38 * This file defines five types of data structures: singly-linked lists,
41 * A singly-linked list is headed by a single forward pointer. The
45 * head of the list. Elements being removed from the head of the list
47 * efficiency. A singly-linked list may only be traversed in the forward
48 * direction. Singly-linked lists are ideal for applications with large
55 * or after an existing element or at the head of the list. A list
58 * A simple queue is headed by a pair of pointers, one the head of the
61 * head of the list. New elements can be added to the list after
62 * an existing element, at the head of the list, or at the end of the
65 * A tail queue is headed by a pair of pointers, one to the head of the
[all …]
|
| /aosp_15_r20/prebuilts/vndk/v32/x86_64/include/generated-headers/bionic/libc/libc/android_vendor.32_x86_x86_64_shared/gen/include/sys/ |
| D | queue.h | 38 * This file defines five types of data structures: singly-linked lists,
41 * A singly-linked list is headed by a single forward pointer. The
45 * head of the list. Elements being removed from the head of the list
47 * efficiency. A singly-linked list may only be traversed in the forward
48 * direction. Singly-linked lists are ideal for applications with large
55 * or after an existing element or at the head of the list. A list
58 * A simple queue is headed by a pair of pointers, one the head of the
61 * head of the list. New elements can be added to the list after
62 * an existing element, at the head of the list, or at the end of the
65 * A tail queue is headed by a pair of pointers, one to the head of the
[all …]
|
| /aosp_15_r20/prebuilts/runtime/mainline/runtime/sdk/android/arm64/include/bionic/libc/include/sys/ |
| H A D | queue.h | 38 * This file defines five types of data structures: singly-linked lists,
41 * A singly-linked list is headed by a single forward pointer. The
45 * head of the list. Elements being removed from the head of the list
47 * efficiency. A singly-linked list may only be traversed in the forward
48 * direction. Singly-linked lists are ideal for applications with large
55 * or after an existing element or at the head of the list. A list
58 * A simple queue is headed by a pair of pointers, one the head of the
61 * head of the list. New elements can be added to the list after
62 * an existing element, at the head of the list, or at the end of the
65 * A tail queue is headed by a pair of pointers, one to the head of the
[all …]
|
| /aosp_15_r20/bionic/libc/include/sys/ |
| H A D | queue.h | 38 * This file defines five types of data structures: singly-linked lists,
41 * A singly-linked list is headed by a single forward pointer. The
45 * head of the list. Elements being removed from the head of the list
47 * efficiency. A singly-linked list may only be traversed in the forward
48 * direction. Singly-linked lists are ideal for applications with large
55 * or after an existing element or at the head of the list. A list
58 * A simple queue is headed by a pair of pointers, one the head of the
61 * head of the list. New elements can be added to the list after
62 * an existing element, at the head of the list, or at the end of the
65 * A tail queue is headed by a pair of pointers, one to the head of the
[all …]
|
| /aosp_15_r20/prebuilts/vndk/v33/arm64/include/generated-headers/bionic/libc/libc/android_vendor.33_arm64_armv8-a_shared/gen/include/sys/ |
| D | queue.h | 38 * This file defines five types of data structures: singly-linked lists,
41 * A singly-linked list is headed by a single forward pointer. The
45 * head of the list. Elements being removed from the head of the list
47 * efficiency. A singly-linked list may only be traversed in the forward
48 * direction. Singly-linked lists are ideal for applications with large
55 * or after an existing element or at the head of the list. A list
58 * A simple queue is headed by a pair of pointers, one the head of the
61 * head of the list. New elements can be added to the list after
62 * an existing element, at the head of the list, or at the end of the
65 * A tail queue is headed by a pair of pointers, one to the head of the
[all …]
|
| /aosp_15_r20/out/soong/ndk/sysroot/usr/include/sys/ |
| D | queue.h | 38 * This file defines five types of data structures: singly-linked lists,
41 * A singly-linked list is headed by a single forward pointer. The
45 * head of the list. Elements being removed from the head of the list
47 * efficiency. A singly-linked list may only be traversed in the forward
48 * direction. Singly-linked lists are ideal for applications with large
55 * or after an existing element or at the head of the list. A list
58 * A simple queue is headed by a pair of pointers, one the head of the
61 * head of the list. New elements can be added to the list after
62 * an existing element, at the head of the list, or at the end of the
65 * A tail queue is headed by a pair of pointers, one to the head of the
[all …]
|
| /aosp_15_r20/prebuilts/vndk/v34/x86_64/include/generated-headers/bionic/libc/libc/android_vendor.34_x86_x86_64_shared/gen/include/sys/ |
| D | queue.h | 38 * This file defines five types of data structures: singly-linked lists,
41 * A singly-linked list is headed by a single forward pointer. The
45 * head of the list. Elements being removed from the head of the list
47 * efficiency. A singly-linked list may only be traversed in the forward
48 * direction. Singly-linked lists are ideal for applications with large
55 * or after an existing element or at the head of the list. A list
58 * A simple queue is headed by a pair of pointers, one the head of the
61 * head of the list. New elements can be added to the list after
62 * an existing element, at the head of the list, or at the end of the
65 * A tail queue is headed by a pair of pointers, one to the head of the
[all …]
|
| /aosp_15_r20/prebuilts/vndk/v33/x86_64/include/generated-headers/bionic/libc/libc/android_vendor.33_x86_x86_64_shared/gen/include/sys/ |
| D | queue.h | 38 * This file defines five types of data structures: singly-linked lists,
41 * A singly-linked list is headed by a single forward pointer. The
45 * head of the list. Elements being removed from the head of the list
47 * efficiency. A singly-linked list may only be traversed in the forward
48 * direction. Singly-linked lists are ideal for applications with large
55 * or after an existing element or at the head of the list. A list
58 * A simple queue is headed by a pair of pointers, one the head of the
61 * head of the list. New elements can be added to the list after
62 * an existing element, at the head of the list, or at the end of the
65 * A tail queue is headed by a pair of pointers, one to the head of the
[all …]
|
| /aosp_15_r20/prebuilts/vndk/v33/arm64/include/generated-headers/bionic/libc/libc/android_vendor.33_arm_armv8-a_shared/gen/include/sys/ |
| D | queue.h | 38 * This file defines five types of data structures: singly-linked lists,
41 * A singly-linked list is headed by a single forward pointer. The
45 * head of the list. Elements being removed from the head of the list
47 * efficiency. A singly-linked list may only be traversed in the forward
48 * direction. Singly-linked lists are ideal for applications with large
55 * or after an existing element or at the head of the list. A list
58 * A simple queue is headed by a pair of pointers, one the head of the
61 * head of the list. New elements can be added to the list after
62 * an existing element, at the head of the list, or at the end of the
65 * A tail queue is headed by a pair of pointers, one to the head of the
[all …]
|
| /aosp_15_r20/prebuilts/vndk/v31/x86_64/include/generated-headers/bionic/libc/libc/android_vendor.31_x86_64_shared/gen/include/sys/ |
| D | queue.h | 38 * This file defines five types of data structures: singly-linked lists,
41 * A singly-linked list is headed by a single forward pointer. The
45 * head of the list. Elements being removed from the head of the list
47 * efficiency. A singly-linked list may only be traversed in the forward
48 * direction. Singly-linked lists are ideal for applications with large
55 * or after an existing element or at the head of the list. A list
58 * A simple queue is headed by a pair of pointers, one the head of the
61 * head of the list. New elements can be added to the list after
62 * an existing element, at the head of the list, or at the end of the
65 * A tail queue is headed by a pair of pointers, one to the head of the
[all …]
|
| /aosp_15_r20/prebuilts/vndk/v32/arm/include/generated-headers/bionic/libc/libc/android_vendor.32_arm_armv7-a-neon_shared/gen/include/sys/ |
| D | queue.h | 38 * This file defines five types of data structures: singly-linked lists,
41 * A singly-linked list is headed by a single forward pointer. The
45 * head of the list. Elements being removed from the head of the list
47 * efficiency. A singly-linked list may only be traversed in the forward
48 * direction. Singly-linked lists are ideal for applications with large
55 * or after an existing element or at the head of the list. A list
58 * A simple queue is headed by a pair of pointers, one the head of the
61 * head of the list. New elements can be added to the list after
62 * an existing element, at the head of the list, or at the end of the
65 * A tail queue is headed by a pair of pointers, one to the head of the
[all …]
|
| /aosp_15_r20/prebuilts/runtime/mainline/runtime/sdk/android/x86/include/bionic/libc/include/sys/ |
| H A D | queue.h | 38 * This file defines five types of data structures: singly-linked lists,
41 * A singly-linked list is headed by a single forward pointer. The
45 * head of the list. Elements being removed from the head of the list
47 * efficiency. A singly-linked list may only be traversed in the forward
48 * direction. Singly-linked lists are ideal for applications with large
55 * or after an existing element or at the head of the list. A list
58 * A simple queue is headed by a pair of pointers, one the head of the
61 * head of the list. New elements can be added to the list after
62 * an existing element, at the head of the list, or at the end of the
65 * A tail queue is headed by a pair of pointers, one to the head of the
[all …]
|
| /aosp_15_r20/prebuilts/runtime/mainline/runtime/sdk/linux_bionic/include/bionic/libc/include/sys/ |
| H A D | queue.h | 38 * This file defines five types of data structures: singly-linked lists,
41 * A singly-linked list is headed by a single forward pointer. The
45 * head of the list. Elements being removed from the head of the list
47 * efficiency. A singly-linked list may only be traversed in the forward
48 * direction. Singly-linked lists are ideal for applications with large
55 * or after an existing element or at the head of the list. A list
58 * A simple queue is headed by a pair of pointers, one the head of the
61 * head of the list. New elements can be added to the list after
62 * an existing element, at the head of the list, or at the end of the
65 * A tail queue is headed by a pair of pointers, one to the head of the
[all …]
|
| /aosp_15_r20/prebuilts/vndk/v32/arm64/include/generated-headers/bionic/libc/libc/android_vendor.32_arm_armv8-a_shared/gen/include/sys/ |
| D | queue.h | 38 * This file defines five types of data structures: singly-linked lists,
41 * A singly-linked list is headed by a single forward pointer. The
45 * head of the list. Elements being removed from the head of the list
47 * efficiency. A singly-linked list may only be traversed in the forward
48 * direction. Singly-linked lists are ideal for applications with large
55 * or after an existing element or at the head of the list. A list
58 * A simple queue is headed by a pair of pointers, one the head of the
61 * head of the list. New elements can be added to the list after
62 * an existing element, at the head of the list, or at the end of the
65 * A tail queue is headed by a pair of pointers, one to the head of the
[all …]
|
| /aosp_15_r20/prebuilts/vndk/v33/arm/include/generated-headers/bionic/libc/libc/android_vendor.33_arm_armv7-a-neon_shared/gen/include/sys/ |
| D | queue.h | 38 * This file defines five types of data structures: singly-linked lists,
41 * A singly-linked list is headed by a single forward pointer. The
45 * head of the list. Elements being removed from the head of the list
47 * efficiency. A singly-linked list may only be traversed in the forward
48 * direction. Singly-linked lists are ideal for applications with large
55 * or after an existing element or at the head of the list. A list
58 * A simple queue is headed by a pair of pointers, one the head of the
61 * head of the list. New elements can be added to the list after
62 * an existing element, at the head of the list, or at the end of the
65 * A tail queue is headed by a pair of pointers, one to the head of the
[all …]
|
| /aosp_15_r20/prebuilts/vndk/v32/x86/include/generated-headers/bionic/libc/libc/android_vendor.32_x86_shared/gen/include/sys/ |
| D | queue.h | 38 * This file defines five types of data structures: singly-linked lists,
41 * A singly-linked list is headed by a single forward pointer. The
45 * head of the list. Elements being removed from the head of the list
47 * efficiency. A singly-linked list may only be traversed in the forward
48 * direction. Singly-linked lists are ideal for applications with large
55 * or after an existing element or at the head of the list. A list
58 * A simple queue is headed by a pair of pointers, one the head of the
61 * head of the list. New elements can be added to the list after
62 * an existing element, at the head of the list, or at the end of the
65 * A tail queue is headed by a pair of pointers, one to the head of the
[all …]
|
| /aosp_15_r20/prebuilts/vndk/v32/arm64/include/generated-headers/bionic/libc/libc/android_vendor.32_arm64_armv8-a_shared/gen/include/sys/ |
| D | queue.h | 38 * This file defines five types of data structures: singly-linked lists,
41 * A singly-linked list is headed by a single forward pointer. The
45 * head of the list. Elements being removed from the head of the list
47 * efficiency. A singly-linked list may only be traversed in the forward
48 * direction. Singly-linked lists are ideal for applications with large
55 * or after an existing element or at the head of the list. A list
58 * A simple queue is headed by a pair of pointers, one the head of the
61 * head of the list. New elements can be added to the list after
62 * an existing element, at the head of the list, or at the end of the
65 * A tail queue is headed by a pair of pointers, one to the head of the
[all …]
|
| /aosp_15_r20/prebuilts/vndk/v31/x86_64/include/generated-headers/bionic/libc/libc/android_vendor.31_x86_x86_64_shared/gen/include/sys/ |
| D | queue.h | 38 * This file defines five types of data structures: singly-linked lists,
41 * A singly-linked list is headed by a single forward pointer. The
45 * head of the list. Elements being removed from the head of the list
47 * efficiency. A singly-linked list may only be traversed in the forward
48 * direction. Singly-linked lists are ideal for applications with large
55 * or after an existing element or at the head of the list. A list
58 * A simple queue is headed by a pair of pointers, one the head of the
61 * head of the list. New elements can be added to the list after
62 * an existing element, at the head of the list, or at the end of the
65 * A tail queue is headed by a pair of pointers, one to the head of the
[all …]
|
| /aosp_15_r20/prebuilts/vndk/v34/arm/include/generated-headers/bionic/libc/libc/android_vendor.34_arm_armv7-a-neon_shared/gen/include/sys/ |
| D | queue.h | 38 * This file defines five types of data structures: singly-linked lists,
41 * A singly-linked list is headed by a single forward pointer. The
45 * head of the list. Elements being removed from the head of the list
47 * efficiency. A singly-linked list may only be traversed in the forward
48 * direction. Singly-linked lists are ideal for applications with large
55 * or after an existing element or at the head of the list. A list
58 * A simple queue is headed by a pair of pointers, one the head of the
61 * head of the list. New elements can be added to the list after
62 * an existing element, at the head of the list, or at the end of the
65 * A tail queue is headed by a pair of pointers, one to the head of the
[all …]
|