Home
last modified time | relevance | path

Searched full:head (Results 1 – 25 of 17555) sorted by relevance

12345678910>>...703

/aosp_15_r20/external/coreboot/payloads/libpayload/include/
H A Dqueue.h46 * 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
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
67 * A tail queue is headed by a pair of pointers, one to the head of the
71 * after an existing element, at the head of the list, or at the end of
74 * A circle queue is headed by a pair of pointers, one to the head of the
78 * an existing element, at the head of the list, or at the end of the list.
[all …]
/aosp_15_r20/prebuilts/runtime/mainline/runtime/sdk/android/x86_64/include/bionic/libc/include/sys/
H A Dqueue.h45 * head of the list. Elements being removed from the head of the list
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
69 * after an existing element, at the head of the list, or at the end of
72 * A circle queue is headed by a pair of pointers, one to the head of the
76 * an existing element, at the head of the list, or at the end of the list.
91 #define LIST_HEAD_INITIALIZER(head) \ argument
[all …]
/aosp_15_r20/prebuilts/vndk/v34/x86_64/include/generated-headers/bionic/libc/libc/android_vendor.34_x86_64_shared/gen/include/sys/
Dqueue.h45 * head of the list. Elements being removed from the head of the list
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
69 * after an existing element, at the head of the list, or at the end of
72 * A circle queue is headed by a pair of pointers, one to the head of the
76 * an existing element, at the head of the list, or at the end of the list.
91 #define LIST_HEAD_INITIALIZER(head) \ argument
[all …]
/aosp_15_r20/prebuilts/vndk/v34/arm64/include/generated-headers/bionic/libc/libc/android_vendor.34_arm64_armv8-a_shared/gen/include/sys/
Dqueue.h45 * head of the list. Elements being removed from the head of the list
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
69 * after an existing element, at the head of the list, or at the end of
72 * A circle queue is headed by a pair of pointers, one to the head of the
76 * an existing element, at the head of the list, or at the end of the list.
91 #define LIST_HEAD_INITIALIZER(head) \ argument
[all …]
/aosp_15_r20/prebuilts/vndk/v32/x86_64/include/generated-headers/bionic/libc/libc/android_vendor.32_x86_64_shared/gen/include/sys/
Dqueue.h45 * head of the list. Elements being removed from the head of the list
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
69 * after an existing element, at the head of the list, or at the end of
72 * A circle queue is headed by a pair of pointers, one to the head of the
76 * an existing element, at the head of the list, or at the end of the list.
91 #define LIST_HEAD_INITIALIZER(head) \ argument
[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/
Dqueue.h45 * head of the list. Elements being removed from the head of the list
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
69 * after an existing element, at the head of the list, or at the end of
72 * A circle queue is headed by a pair of pointers, one to the head of the
76 * an existing element, at the head of the list, or at the end of the list.
91 #define LIST_HEAD_INITIALIZER(head) \ argument
[all …]
/aosp_15_r20/prebuilts/runtime/mainline/runtime/sdk/android/arm64/include/bionic/libc/include/sys/
H A Dqueue.h45 * head of the list. Elements being removed from the head of the list
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
69 * after an existing element, at the head of the list, or at the end of
72 * A circle queue is headed by a pair of pointers, one to the head of the
76 * an existing element, at the head of the list, or at the end of the list.
91 #define LIST_HEAD_INITIALIZER(head) \ argument
[all …]
/aosp_15_r20/bionic/libc/include/sys/
H A Dqueue.h45 * head of the list. Elements being removed from the head of the list
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
69 * after an existing element, at the head of the list, or at the end of
72 * A circle queue is headed by a pair of pointers, one to the head of the
76 * an existing element, at the head of the list, or at the end of the list.
91 #define LIST_HEAD_INITIALIZER(head) \ argument
[all …]
/aosp_15_r20/prebuilts/vndk/v33/arm64/include/generated-headers/bionic/libc/libc/android_vendor.33_arm64_armv8-a_shared/gen/include/sys/
Dqueue.h45 * head of the list. Elements being removed from the head of the list
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
69 * after an existing element, at the head of the list, or at the end of
72 * A circle queue is headed by a pair of pointers, one to the head of the
76 * an existing element, at the head of the list, or at the end of the list.
91 #define LIST_HEAD_INITIALIZER(head) \ argument
[all …]
/aosp_15_r20/out/soong/ndk/sysroot/usr/include/sys/
Dqueue.h45 * head of the list. Elements being removed from the head of the list
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
69 * after an existing element, at the head of the list, or at the end of
72 * A circle queue is headed by a pair of pointers, one to the head of the
76 * an existing element, at the head of the list, or at the end of the list.
91 #define LIST_HEAD_INITIALIZER(head) \ argument
[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/
Dqueue.h45 * head of the list. Elements being removed from the head of the list
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
69 * after an existing element, at the head of the list, or at the end of
72 * A circle queue is headed by a pair of pointers, one to the head of the
76 * an existing element, at the head of the list, or at the end of the list.
91 #define LIST_HEAD_INITIALIZER(head) \ argument
[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/
Dqueue.h45 * head of the list. Elements being removed from the head of the list
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
69 * after an existing element, at the head of the list, or at the end of
72 * A circle queue is headed by a pair of pointers, one to the head of the
76 * an existing element, at the head of the list, or at the end of the list.
91 #define LIST_HEAD_INITIALIZER(head) \ argument
[all …]
/aosp_15_r20/prebuilts/vndk/v33/arm64/include/generated-headers/bionic/libc/libc/android_vendor.33_arm_armv8-a_shared/gen/include/sys/
Dqueue.h45 * head of the list. Elements being removed from the head of the list
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
69 * after an existing element, at the head of the list, or at the end of
72 * A circle queue is headed by a pair of pointers, one to the head of the
76 * an existing element, at the head of the list, or at the end of the list.
91 #define LIST_HEAD_INITIALIZER(head) \ argument
[all …]
/aosp_15_r20/prebuilts/vndk/v31/x86_64/include/generated-headers/bionic/libc/libc/android_vendor.31_x86_64_shared/gen/include/sys/
Dqueue.h45 * head of the list. Elements being removed from the head of the list
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
69 * after an existing element, at the head of the list, or at the end of
72 * A circle queue is headed by a pair of pointers, one to the head of the
76 * an existing element, at the head of the list, or at the end of the list.
91 #define LIST_HEAD_INITIALIZER(head) \ argument
[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/
Dqueue.h45 * head of the list. Elements being removed from the head of the list
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
69 * after an existing element, at the head of the list, or at the end of
72 * A circle queue is headed by a pair of pointers, one to the head of the
76 * an existing element, at the head of the list, or at the end of the list.
91 #define LIST_HEAD_INITIALIZER(head) \ argument
[all …]
/aosp_15_r20/prebuilts/runtime/mainline/runtime/sdk/android/x86/include/bionic/libc/include/sys/
H A Dqueue.h45 * head of the list. Elements being removed from the head of the list
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
69 * after an existing element, at the head of the list, or at the end of
72 * A circle queue is headed by a pair of pointers, one to the head of the
76 * an existing element, at the head of the list, or at the end of the list.
91 #define LIST_HEAD_INITIALIZER(head) \ argument
[all …]
/aosp_15_r20/prebuilts/runtime/mainline/runtime/sdk/linux_bionic/include/bionic/libc/include/sys/
H A Dqueue.h45 * head of the list. Elements being removed from the head of the list
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
69 * after an existing element, at the head of the list, or at the end of
72 * A circle queue is headed by a pair of pointers, one to the head of the
76 * an existing element, at the head of the list, or at the end of the list.
91 #define LIST_HEAD_INITIALIZER(head) \ argument
[all …]
/aosp_15_r20/prebuilts/vndk/v32/arm64/include/generated-headers/bionic/libc/libc/android_vendor.32_arm_armv8-a_shared/gen/include/sys/
Dqueue.h45 * head of the list. Elements being removed from the head of the list
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
69 * after an existing element, at the head of the list, or at the end of
72 * A circle queue is headed by a pair of pointers, one to the head of the
76 * an existing element, at the head of the list, or at the end of the list.
91 #define LIST_HEAD_INITIALIZER(head) \ argument
[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/
Dqueue.h45 * head of the list. Elements being removed from the head of the list
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
69 * after an existing element, at the head of the list, or at the end of
72 * A circle queue is headed by a pair of pointers, one to the head of the
76 * an existing element, at the head of the list, or at the end of the list.
91 #define LIST_HEAD_INITIALIZER(head) \ argument
[all …]
/aosp_15_r20/prebuilts/vndk/v32/x86/include/generated-headers/bionic/libc/libc/android_vendor.32_x86_shared/gen/include/sys/
Dqueue.h45 * head of the list. Elements being removed from the head of the list
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
69 * after an existing element, at the head of the list, or at the end of
72 * A circle queue is headed by a pair of pointers, one to the head of the
76 * an existing element, at the head of the list, or at the end of the list.
91 #define LIST_HEAD_INITIALIZER(head) \ argument
[all …]
/aosp_15_r20/prebuilts/vndk/v32/arm64/include/generated-headers/bionic/libc/libc/android_vendor.32_arm64_armv8-a_shared/gen/include/sys/
Dqueue.h45 * head of the list. Elements being removed from the head of the list
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
69 * after an existing element, at the head of the list, or at the end of
72 * A circle queue is headed by a pair of pointers, one to the head of the
76 * an existing element, at the head of the list, or at the end of the list.
91 #define LIST_HEAD_INITIALIZER(head) \ argument
[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/
Dqueue.h45 * head of the list. Elements being removed from the head of the list
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
69 * after an existing element, at the head of the list, or at the end of
72 * A circle queue is headed by a pair of pointers, one to the head of the
76 * an existing element, at the head of the list, or at the end of the list.
91 #define LIST_HEAD_INITIALIZER(head) \ argument
[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/
Dqueue.h45 * head of the list. Elements being removed from the head of the list
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
69 * after an existing element, at the head of the list, or at the end of
72 * A circle queue is headed by a pair of pointers, one to the head of the
76 * an existing element, at the head of the list, or at the end of the list.
91 #define LIST_HEAD_INITIALIZER(head) \ argument
[all …]
/aosp_15_r20/prebuilts/vndk/v31/arm64/include/generated-headers/bionic/libc/libc/android_vendor.31_arm_armv8-a_shared/gen/include/sys/
Dqueue.h45 * head of the list. Elements being removed from the head of the list
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
69 * after an existing element, at the head of the list, or at the end of
72 * A circle queue is headed by a pair of pointers, one to the head of the
76 * an existing element, at the head of the list, or at the end of the list.
91 #define LIST_HEAD_INITIALIZER(head) \ argument
[all …]
/aosp_15_r20/prebuilts/vndk/v33/x86_64/include/generated-headers/bionic/libc/libc/android_vendor.33_x86_64_shared/gen/include/sys/
Dqueue.h45 * head of the list. Elements being removed from the head of the list
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
69 * after an existing element, at the head of the list, or at the end of
72 * A circle queue is headed by a pair of pointers, one to the head of the
76 * an existing element, at the head of the list, or at the end of the list.
91 #define LIST_HEAD_INITIALIZER(head) \ argument
[all …]

12345678910>>...703