| /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...] |
| /prebuilts/ndk/android-ndk-r7/platforms/android-9/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-9/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...] |
| /external/openssh/regress/ |
| yes-head.sh | 1 # $OpenBSD: yes-head.sh,v 1.4 2002/03/15 13:08:56 markus Exp $
4 tid="yes pipe head"
7 lines=`${SSH} -$p -F $OBJ/ssh_proxy thishost 'sh -c "while true;do echo yes;done | _POSIX2_VERSION=199209 head -2000"' | (sleep 3 ; wc -l)`
9 fail "yes|head test failed"
13 fail "yes|head returns $lines lines instead of 2000"
|
| /external/ipsec-tools/src/include-glibc/sys/ |
| queue.h | 50 * added to the list after an existing element or at the head of the list.
51 * Elements being removed from the head of the list should use the explicit
58 * head of the list and the other to the tail of the list. The elements are
61 * to the list after an existing element, at the head of the list, or at the
62 * end of the list. Elements being removed from the head of the tail queue
72 * or after an existing element or at the head of the list. A list
75 * A tail queue is headed by a pair of pointers, one to the head of the
79 * after an existing element, at the head of the list, or at the end of
114 #define SLIST_HEAD_INITIALIZER(head) \
125 #define SLIST_EMPTY(head) ((head)->slh_first == NULL
427 *head = (struct quehead *)b; local
[all...] |
| /external/kernel-headers/original/linux/ |
| circ_buf.h | 6 int head; member in struct:circ_buf
11 #define CIRC_CNT(head,tail,size) (((head) - (tail)) & ((size)-1))
14 as a completely full buffer has head == tail, which is the same as
16 #define CIRC_SPACE(head,tail,size) CIRC_CNT((tail),((head)+1),(size))
19 accessing head and tail more than once, so they can change
21 #define CIRC_CNT_TO_END(head,tail,size) \
23 int n = ((head) + end) & ((size)-1); \
27 #define CIRC_SPACE_TO_END(head,tail,size)
[all...] |
| /external/openssh/openbsd-compat/ |
| sys-queue.h | 131 * added to the list after an existing element or at the head of the list.
132 * Elements being removed from the head of the list should use the explicit
142 * or after an existing element or at the head of the list. A list
145 * A simple queue is headed by a pair of pointers, one the head of the
148 * head of the list. New elements can be added to the list before or after
149 * an existing element, at the head of the list, or at the end of the
152 * A tail queue is headed by a pair of pointers, one to the head of the
156 * after an existing element, at the head of the list, or at the end of
159 * A circle queue is headed by a pair of pointers, one to the head of the
163 * an existing element, at the head of the list, or at the end of the list
[all...] |
| /external/blktrace/btt/ |
| list.h | 68 * @head: list head to add it after
70 * Insert a new entry after the specified head.
73 static inline void list_add(struct list_head *new, struct list_head *head)
75 __list_add(new, head, head->next);
81 * @head: list head to add it before
83 * Insert a new entry before the specified head.
86 static inline void list_add_tail(struct list_head *new, struct list_head *head)
[all...] |
| /external/e2fsprogs/lib/ext2fs/ |
| kernel-list.h | 48 * Insert a new entry after the specified head..
50 static __inline__ void list_add(struct list_head *new, struct list_head *head)
52 __list_add(new, head, head->next);
58 static __inline__ void list_add_tail(struct list_head *new, struct list_head *head)
60 __list_add(new, head->prev, head);
82 static __inline__ int list_empty(struct list_head *head)
84 return head->next == head;
[all...] |
| /external/linux-tools-perf/util/include/linux/added/ |
| list.h | 42 * @head: list head to add it after
44 * Insert a new entry after the specified head.
47 static inline void list_add(struct list_head *new, struct list_head *head)
49 __list_add(new, head, head->next);
56 * @head: list head to add it before
58 * Insert a new entry before the specified head.
61 static inline void list_add_tail(struct list_head *new, struct list_head *head)
[all...] |
| /external/skia/src/utils/ |
| SkSfntUtils.cpp | 33 bool SkSfntUtils::ReadTable_head(SkFontID fontID, SkSfntTable_head* head) {
44 head->fVersion = parse_be32(p);
45 head->fRevision = parse_be32(p);
46 head->fCheckSumAdjustment = parse_be32(p);
47 head->fMagicNumber = parse_be32(p);
48 head->fFlags = parse_be16(p);
49 head->fUnitsPerEm = parse_be16(p);
50 head->fDateCreated = parse_be64(p);
51 head->fDateModified = parse_be64(p);
52 head->fXMin = parse_be16(p)
[all...] |
| /external/icu4c/layout/ |
| LEInsertionList.cpp | 26 : head(NULL), tail(NULL), growAmount(0), append(rightToLeft)
28 tail = (InsertionRecord *) &head;
38 while (head != NULL) {
39 InsertionRecord *record = head;
41 head = head->next;
45 tail = (InsertionRecord *) &head;
78 insertion->next = head;
79 head = insertion;
87 for (InsertionRecord *rec = head; rec != NULL; rec = rec->next)
[all...] |
| /bionic/libc/kernel/common/linux/ |
| plist.h | 36 #define PLIST_HEAD_INIT(head, _lock) { .prio_list = LIST_HEAD_INIT((head).prio_list), .node_list = LIST_HEAD_INIT((head).node_list), PLIST_HEAD_LOCK_INIT(&(_lock)) }
39 #define plist_for_each(pos, head) list_for_each_entry(pos, &(head)->node_list, plist.node_list)
40 #define plist_for_each_safe(pos, n, head) list_for_each_entry_safe(pos, n, &(head)->node_list, plist.node_list)
41 #define plist_for_each_entry(pos, head, mem) list_for_each_entry(pos, &(head)->node_list, mem.plist.node_list)
42 #define plist_for_each_entry_safe(pos, n, head, m) list_for_each_entry_safe(pos, n, &(head)->node_list, m.plist.node_list
[all...] |
| /hardware/ti/wlan/lib/ |
| shlist.h | 19 SHLIST *shListFindItem( SHLIST *head, void *val, shListEqual func );
20 SHLIST *shListGetFirstItem( SHLIST *head );
21 SHLIST *shListGetNItem( SHLIST *head, unsigned long num );
22 SHLIST *shListGetLastItem( SHLIST *head );
23 SHLIST *shListGetNextItem( SHLIST *head, SHLIST *item );
24 SHLIST *shListGetPrevItem( SHLIST *head, SHLIST *item );
25 void shListDelItem( SHLIST *head, SHLIST *item, shListFree func );
26 void shListInsFirstItem( SHLIST *head, void *val );
27 void shListInsBeforeItem( SHLIST *head, void *val, void *etalon,
29 void shListInsLastItem( SHLIST *head, void *val )
[all...] |
