HomeSort by relevance Sort by last modified time
    Searched full:head (Results 51 - 75 of 3883) sorted by null

1 23 4 5 6 7 8 91011>>

  /ndk/build/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...]
  /ndk/build/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...]
  /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/qemu/
sys-queue.h 50 * or after an existing element or at the head of the list. A list
53 * A tail queue is headed by a pair of pointers, one to the head of the
57 * after an existing element, at the head of the list, or at the end of
60 * A circle queue is headed by a pair of pointers, one to the head of the
64 * an existing element, at the head of the list, or at the end of the list.
79 #define LIST_HEAD_INITIALIZER(head) \
91 #define LIST_INIT(head) do { \
92 (head)->lh_first = NULL; \
110 #define LIST_INSERT_HEAD(head, elm, field) do { \
111 if (((elm)->field.le_next = (head)->lh_first) != NULL)
    [all...]
sys-tree.h 88 #define SPLAY_ROOT(head) (head)->sph_root
89 #define SPLAY_EMPTY(head) (SPLAY_ROOT(head) == NULL)
92 #define SPLAY_ROTATE_RIGHT(head, tmp, field) do { \
93 SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(tmp, field); \
94 SPLAY_RIGHT(tmp, field) = (head)->sph_root; \
95 (head)->sph_root = tmp; \
98 #define SPLAY_ROTATE_LEFT(head, tmp, field) do { \
99 SPLAY_RIGHT((head)->sph_root, field) = SPLAY_LEFT(tmp, field);
    [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/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...]
  /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...]
  /system/core/adb/
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...]
  /system/wlan/ti/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...]
  /bionic/libc/kernel/common/linux/
notifier.h 26 struct notifier_block *head; member in struct:atomic_notifier_head
31 struct notifier_block *head; member in struct:blocking_notifier_head
35 struct notifier_block *head; member in struct:raw_notifier_head
38 #define ATOMIC_INIT_NOTIFIER_HEAD(name) do { spin_lock_init(&(name)->lock); (name)->head = NULL; } while (0)
39 #define BLOCKING_INIT_NOTIFIER_HEAD(name) do { init_rwsem(&(name)->rwsem); (name)->head = NULL; } while (0)
40 #define RAW_INIT_NOTIFIER_HEAD(name) do { (name)->head = NULL; } while (0)
42 #define ATOMIC_NOTIFIER_INIT(name) { .lock = __SPIN_LOCK_UNLOCKED(name.lock), .head = NULL }
43 #define BLOCKING_NOTIFIER_INIT(name) { .rwsem = __RWSEM_INITIALIZER((name).rwsem), .head = NULL }
44 #define RAW_NOTIFIER_INIT(name) { .head = NULL }
  /ndk/build/platforms/android-3/arch-arm/usr/include/linux/
notifier.h 26 struct notifier_block *head; member in struct:atomic_notifier_head
31 struct notifier_block *head; member in struct:blocking_notifier_head
35 struct notifier_block *head; member in struct:raw_notifier_head
38 #define ATOMIC_INIT_NOTIFIER_HEAD(name) do { spin_lock_init(&(name)->lock); (name)->head = NULL; } while (0)
39 #define BLOCKING_INIT_NOTIFIER_HEAD(name) do { init_rwsem(&(name)->rwsem); (name)->head = NULL; } while (0)
40 #define RAW_INIT_NOTIFIER_HEAD(name) do { (name)->head = NULL; } while (0)
42 #define ATOMIC_NOTIFIER_INIT(name) { .lock = __SPIN_LOCK_UNLOCKED(name.lock), .head = NULL }
43 #define BLOCKING_NOTIFIER_INIT(name) { .rwsem = __RWSEM_INITIALIZER((name).rwsem), .head = NULL }
44 #define RAW_NOTIFIER_INIT(name) { .head = NULL }
  /ndk/build/platforms/android-4/arch-arm/usr/include/linux/
notifier.h 26 struct notifier_block *head; member in struct:atomic_notifier_head
31 struct notifier_block *head; member in struct:blocking_notifier_head
35 struct notifier_block *head; member in struct:raw_notifier_head
38 #define ATOMIC_INIT_NOTIFIER_HEAD(name) do { spin_lock_init(&(name)->lock); (name)->head = NULL; } while (0)
39 #define BLOCKING_INIT_NOTIFIER_HEAD(name) do { init_rwsem(&(name)->rwsem); (name)->head = NULL; } while (0)
40 #define RAW_INIT_NOTIFIER_HEAD(name) do { (name)->head = NULL; } while (0)
42 #define ATOMIC_NOTIFIER_INIT(name) { .lock = __SPIN_LOCK_UNLOCKED(name.lock), .head = NULL }
43 #define BLOCKING_NOTIFIER_INIT(name) { .rwsem = __RWSEM_INITIALIZER((name).rwsem), .head = NULL }
44 #define RAW_NOTIFIER_INIT(name) { .head = NULL }
  /ndk/build/platforms/android-5/arch-arm/usr/include/linux/
notifier.h 26 struct notifier_block *head; member in struct:atomic_notifier_head
31 struct notifier_block *head; member in struct:blocking_notifier_head
35 struct notifier_block *head; member in struct:raw_notifier_head
38 #define ATOMIC_INIT_NOTIFIER_HEAD(name) do { spin_lock_init(&(name)->lock); (name)->head = NULL; } while (0)
39 #define BLOCKING_INIT_NOTIFIER_HEAD(name) do { init_rwsem(&(name)->rwsem); (name)->head = NULL; } while (0)
40 #define RAW_INIT_NOTIFIER_HEAD(name) do { (name)->head = NULL; } while (0)
42 #define ATOMIC_NOTIFIER_INIT(name) { .lock = __SPIN_LOCK_UNLOCKED(name.lock), .head = NULL }
43 #define BLOCKING_NOTIFIER_INIT(name) { .rwsem = __RWSEM_INITIALIZER((name).rwsem), .head = NULL }
44 #define RAW_NOTIFIER_INIT(name) { .head = NULL }
  /ndk/build/platforms/android-5/arch-x86/usr/include/linux/
notifier.h 26 struct notifier_block *head; member in struct:atomic_notifier_head
31 struct notifier_block *head; member in struct:blocking_notifier_head
35 struct notifier_block *head; member in struct:raw_notifier_head
38 #define ATOMIC_INIT_NOTIFIER_HEAD(name) do { spin_lock_init(&(name)->lock); (name)->head = NULL; } while (0)
39 #define BLOCKING_INIT_NOTIFIER_HEAD(name) do { init_rwsem(&(name)->rwsem); (name)->head = NULL; } while (0)
40 #define RAW_INIT_NOTIFIER_HEAD(name) do { (name)->head = NULL; } while (0)
42 #define ATOMIC_NOTIFIER_INIT(name) { .lock = __SPIN_LOCK_UNLOCKED(name.lock), .head = NULL }
43 #define BLOCKING_NOTIFIER_INIT(name) { .rwsem = __RWSEM_INITIALIZER((name).rwsem), .head = NULL }
44 #define RAW_NOTIFIER_INIT(name) { .head = NULL }
  /ndk/build/platforms/android-8/arch-arm/usr/include/linux/
notifier.h 26 struct notifier_block *head; member in struct:atomic_notifier_head
31 struct notifier_block *head; member in struct:blocking_notifier_head
35 struct notifier_block *head; member in struct:raw_notifier_head
38 #define ATOMIC_INIT_NOTIFIER_HEAD(name) do { spin_lock_init(&(name)->lock); (name)->head = NULL; } while (0)
39 #define BLOCKING_INIT_NOTIFIER_HEAD(name) do { init_rwsem(&(name)->rwsem); (name)->head = NULL; } while (0)
40 #define RAW_INIT_NOTIFIER_HEAD(name) do { (name)->head = NULL; } while (0)
42 #define ATOMIC_NOTIFIER_INIT(name) { .lock = __SPIN_LOCK_UNLOCKED(name.lock), .head = NULL }
43 #define BLOCKING_NOTIFIER_INIT(name) { .rwsem = __RWSEM_INITIALIZER((name).rwsem), .head = NULL }
44 #define RAW_NOTIFIER_INIT(name) { .head = NULL }
  /ndk/build/platforms/android-8/arch-x86/usr/include/linux/
notifier.h 26 struct notifier_block *head; member in struct:atomic_notifier_head
31 struct notifier_block *head; member in struct:blocking_notifier_head
35 struct notifier_block *head; member in struct:raw_notifier_head
38 #define ATOMIC_INIT_NOTIFIER_HEAD(name) do { spin_lock_init(&(name)->lock); (name)->head = NULL; } while (0)
39 #define BLOCKING_INIT_NOTIFIER_HEAD(name) do { init_rwsem(&(name)->rwsem); (name)->head = NULL; } while (0)
40 #define RAW_INIT_NOTIFIER_HEAD(name) do { (name)->head = NULL; } while (0)
42 #define ATOMIC_NOTIFIER_INIT(name) { .lock = __SPIN_LOCK_UNLOCKED(name.lock), .head = NULL }
43 #define BLOCKING_NOTIFIER_INIT(name) { .rwsem = __RWSEM_INITIALIZER((name).rwsem), .head = NULL }
44 #define RAW_NOTIFIER_INIT(name) { .head = NULL }
  /external/bluetooth/glib/tests/
queue-test.c 26 if (!queue->head)
29 g_assert (!queue->head);
33 for (list = queue->head; list != NULL; list = list->next)
51 g_assert (last == queue->head);
54 for (list = queue->head; list != NULL; list = list->next)
70 for (list = queue->head; list != NULL; list = list->next)
155 enum { OFF_QUEUE, HEAD, TAIL, MIDDLE, LAST } where;
160 where = g_random_int_range (HEAD, LAST);
168 case HEAD:
221 GList *head; member in struct:QueueInfo
    [all...]
  /external/iptables/libiptc/
linux_list.h 85 * @head: list head to add it after
87 * Insert a new entry after the specified head.
90 static inline void list_add(struct list_head *new, struct list_head *head)
92 __list_add(new, head, head->next);
98 * @head: list head to add it before
100 * Insert a new entry before the specified head.
103 static inline void list_add_tail(struct list_head *new, struct list_head *head)
    [all...]
  /dalvik/libcore/dom/src/test/resources/
hc_nodtdstaff.html 1 <html><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8"><title>hc_nodtdstaff</title></head><body onload="parent.loadComplete()">
hc_nodtdstaff.xhtml 1 <html xmlns="http://www.w3.org/1999/xhtml"><head><title>hc_nodtdstaff</title></head><body onload="parent.loadComplete()">
  /dalvik/libcore/xml/src/main/java/javax/xml/parsers/
package.html 1 <HTML><HEAD>
6 </HEAD><BODY>
  /external/oprofile/libutil/
op_list.h 32 * Init a list head to create an empty list from it
59 * @param head list head to add it after
61 * Insert a new entry after the specified head.
64 static __inline__ void list_add(struct list_head * new_entry, struct list_head * head)
66 __list_add(new_entry, head, head->next);
72 * @param head list head to add it before
74 * Insert a new entry before the specified head
    [all...]

Completed in 213 milliseconds

1 23 4 5 6 7 8 91011>>