/external/kernel-headers/original/linux/ |
H A D | 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,tai [all...] |
H A D | plist.h | 102 * @head: struct plist_head variable name 104 #define PLIST_HEAD_INIT(head, _lock) \ 106 .prio_list = LIST_HEAD_INIT((head).prio_list), \ 107 .node_list = LIST_HEAD_INIT((head).node_list), \ 126 * @head: &struct plist_head pointer 129 plist_head_init(struct plist_head *head, spinlock_t *lock) argument 131 INIT_LIST_HEAD(&head->prio_list); 132 INIT_LIST_HEAD(&head->node_list); 134 head->lock = lock; 150 extern void plist_add(struct plist_node *node, struct plist_head *head); 200 plist_head_empty(const struct plist_head *head) argument 242 plist_first(const struct plist_head *head) argument [all...] |
H A D | list.h | 55 * @head: list head to add it after 57 * Insert a new entry after the specified head. 60 static inline void list_add(struct list_head *new, struct list_head *head) argument 62 __list_add(new, head, head->next); 68 * @head: list head to add it before 70 * Insert a new entry before the specified head. 73 static inline void list_add_tail(struct list_head *new, struct list_head *head) argument 110 list_add_rcu(struct list_head *new, struct list_head *head) argument 131 list_add_tail_rcu(struct list_head *new, struct list_head *head) argument 249 list_move(struct list_head *list, struct list_head *head) argument 260 list_move_tail(struct list_head *list, struct list_head *head) argument 272 list_is_last(const struct list_head *list, const struct list_head *head) argument 282 list_empty(const struct list_head *head) argument 300 list_empty_careful(const struct list_head *head) argument 306 __list_splice(struct list_head *list, struct list_head *head) argument 325 list_splice(struct list_head *list, struct list_head *head) argument 338 list_splice_init(struct list_head *list, struct list_head *head) argument [all...] |
/external/qemu/ |
H A D | 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) d [all...] |
H A D | 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) [all...] |
/external/chromium/third_party/libevent/compat/sys/ |
H A D | queue.h | 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 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 o [all...] |
/external/ipsec-tools/src/include-glibc/sys/ |
H A D | 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) ((hea 427 *head = (struct quehead *)b; local [all...] |
/external/e2fsprogs/lib/ext2fs/ |
H A D | 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) argument 52 __list_add(new, head, head->next); 58 static __inline__ void list_add_tail(struct list_head *new, struct list_head *head) argument 60 __list_add(new, head->prev, head); 82 static __inline__ int list_empty(struct list_head *head) argument 84 return head->next == head; 90 list_splice(struct list_head *list, struct list_head *head) argument [all...] |
/external/ipsec-tools/src/racoon/ |
H A D | genlist.h | 51 /* This function returns an initialized list head. */ 55 struct genlist_entry *genlist_insert (struct genlist *head, void *data); 56 struct genlist_entry *genlist_append (struct genlist *head, void *data); 67 void *genlist_foreach (struct genlist *head, genlist_func_t func, void *arg); 69 /* Get first entry in list if head is not NULL, otherwise get next 72 void *genlist_next (struct genlist *head, struct genlist_entry **buf); 78 /* Free all storage associated with list at head using func to free any 80 void genlist_free (struct genlist *head, genlist_freedata_t func);
|
H A D | genlist.c | 50 genlist_insert (struct genlist *head, void *data) argument 54 TAILQ_INSERT_HEAD(head, entry, chain); 59 genlist_append (struct genlist *head, void *data) argument 63 TAILQ_INSERT_TAIL(head, entry, chain); 68 genlist_foreach (struct genlist *head, genlist_func_t func, void *arg) argument 72 TAILQ_FOREACH(p, head, chain) { 82 genlist_next (struct genlist *head, struct genlist_entry **buf) argument 86 if (head) 87 p = TAILQ_FIRST(head); 96 genlist_free (struct genlist *head, genlist_freedata_ argument [all...] |
/external/iptables/libiptc/ |
H A D | 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) argument 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) argument 140 list_add_rcu(struct list_head *new, struct list_head *head) argument 161 list_add_tail_rcu(struct list_head *new, struct list_head *head) argument 238 list_move(struct list_head *list, struct list_head *head) argument 249 list_move_tail(struct list_head *list, struct list_head *head) argument 260 list_empty(const struct list_head *head) argument 277 list_empty_careful(const struct list_head *head) argument 283 __list_splice(struct list_head *list, struct list_head *head) argument 302 list_splice(struct list_head *list, struct list_head *head) argument 315 list_splice_init(struct list_head *list, struct list_head *head) argument [all...] |
/external/v8/tools/ |
H A D | profile_view.js | 54 var head; 61 if (viewParent === head) { 67 var viewNode = createViewNode(node.label, totalWeight, selfWeight, head); 71 head = viewNode; 75 var view = this.createView(head); 83 * @param {devtools.profiler.ProfileView.Node} head View head node. 86 devtools.profiler.ViewBuilder.prototype.createView = function(head) { 87 return new devtools.profiler.ProfileView(head); 100 * @param {devtools.profiler.ProfileView.Node} head Profil [all...] |
/external/e2fsprogs/lib/blkid/ |
H A D | list.h | 56 * @head: list head to add it after 58 * Insert a new entry after the specified head. 61 _INLINE_ void list_add(struct list_head *add, struct list_head *head) argument 63 __list_add(add, head, head->next); 69 * @head: list head to add it before 71 * Insert a new entry before the specified head. 74 _INLINE_ void list_add_tail(struct list_head *add, struct list_head *head) argument 119 list_empty(struct list_head *head) argument 129 list_splice(struct list_head *list, struct list_head *head) argument [all...] |
/external/oprofile/libutil/ |
H A D | 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) argument 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 77 list_add_tail(struct list_head * new_entry, struct list_head * head) argument 120 list_empty(struct list_head const * head) argument 130 list_splice(struct list_head * list, struct list_head * head) argument [all...] |
/external/blktrace/btt/ |
H A D | 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) argument 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) argument 165 list_empty(const struct list_head *head) argument 174 list_first(const struct list_head *head) argument 184 list_move_tail(struct list_head *list, struct list_head *head) argument 191 __list_splice(struct list_head *list, struct list_head *head) argument 210 list_splice(struct list_head *list, struct list_head *head) argument [all...] |
/external/bluetooth/hcidump/parser/ |
H A D | hidp.c | 39 static char *type2str(uint8_t head) argument 41 switch (head & 0xf0) { 67 static char *result2str(uint8_t head) argument 69 switch (head & 0x0f) { 89 static char *operation2str(uint8_t head) argument 91 switch (head & 0x0f) { 109 static char *report2str(uint8_t head) argument 111 switch (head & 0x03) { 125 static char *protocol2str(uint8_t head) argument 127 switch (head [all...] |
H A D | rfcomm.c | 53 static void print_rfcomm_hdr(long_frame_head* head, uint8_t *ptr, int len) argument 55 address_field addr = head->addr; 56 uint8_t ctr = head->control; 57 uint16_t ilen = head->length.bits.len; 74 long_frame_head *head, mcc_long_frame_head *mcc_head) 77 print_rfcomm_hdr(head, ptr, len); 81 long_frame_head *head, mcc_long_frame_head *mcc_head) 84 print_rfcomm_hdr(head, ptr, len); 89 long_frame_head *head, mcc_long_frame_head *mcc_head) 92 print_rfcomm_hdr(head, pt 73 mcc_test(int level, uint8_t *ptr, int len, long_frame_head *head, mcc_long_frame_head *mcc_head) argument 80 mcc_fcon(int level, uint8_t *ptr, int len, long_frame_head *head, mcc_long_frame_head *mcc_head) argument 88 mcc_fcoff(int level, uint8_t *ptr, int len, long_frame_head *head, mcc_long_frame_head *mcc_head) argument 96 mcc_msc(int level, uint8_t *ptr, int len, long_frame_head *head, mcc_long_frame_head *mcc_head) argument 119 mcc_rpn(int level, uint8_t *ptr, int len, long_frame_head *head, mcc_long_frame_head *mcc_head) argument 150 mcc_rls(int level, uint8_t *ptr, int len, long_frame_head *head, mcc_long_frame_head *mcc_head) argument 161 mcc_pn(int level, uint8_t *ptr, int len, long_frame_head *head, mcc_long_frame_head *mcc_head) argument 178 mcc_nsc(int level, uint8_t *ptr, int len, long_frame_head *head, mcc_long_frame_head *mcc_head) argument 193 mcc_frame(int level, struct frame *frm, long_frame_head *head) argument 251 uih_frame(int level, struct frame *frm, long_frame_head *head) argument 306 long_frame_head head; local [all...] |
/external/icu4c/layout/ |
H A D | 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; re [all...] |
/external/chromium/net/base/ |
H A D | address_list.h | 24 void Adopt(struct addrinfo* head); 27 void Copy(const struct addrinfo* head); 50 // Get access to the head of the addrinfo list. 51 const struct addrinfo* head() const { return data_->head; } function in class:net::AddressList 56 : head(ai), is_system_created(is_system_created) {} 57 struct addrinfo* head; member in struct:net::AddressList::Data 59 // Indicates which free function to use for |head|.
|
/external/dropbear/ |
H A D | queue.c | 31 queue->head = NULL; 38 return (queue->head == NULL); 47 ret = queue->head->item; 48 oldhead = queue->head; 51 queue->head = oldhead->link; 53 queue->head = NULL; 66 return queue->head->item; 84 if (queue->head == NULL) { 85 queue->head = newlink;
|
/external/webkit/JavaScriptCore/runtime/ |
H A D | StructureChain.h | 42 static PassRefPtr<StructureChain> create(Structure* head) { return adoptRef(new StructureChain(head)); } argument 43 RefPtr<Structure>* head() { return m_vector.get(); } function in class:JSC::StructureChain 46 StructureChain(Structure* head);
|
H A D | StructureChain.cpp | 35 StructureChain::StructureChain(Structure* head) argument 38 for (Structure* current = head; current; current = current->storedPrototype().isNull() ? 0 : asObject(current->storedPrototype())->structure()) 44 for (Structure* current = head; current; current = current->storedPrototype().isNull() ? 0 : asObject(current->storedPrototype())->structure())
|
/external/yaffs2/yaffs2/ |
H A D | devextras.h | 88 * @head: list head to add it after 90 * Insert a new entry after the specified head. 93 static __inline__ void list_add(struct list_head *new, struct list_head *head) argument 95 __list_add(new, head, head->next); 101 * @head: list head to add it before 103 * Insert a new entry before the specified head. 107 struct list_head *head) 106 list_add_tail(struct list_head *new, struct list_head *head) argument 151 list_empty(struct list_head *head) argument 161 list_splice(struct list_head *list, struct list_head *head) argument [all...] |
/external/bluetooth/glib/tests/ |
H A D | 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) 221 GList *head; member in struct:QueueInfo 237 queues[i].head = NULL; 249 g_assert (qinf->head == q->head); [all...] |
/external/srec/seti/sltsEngine/src/ |
H A D | linklist_impl.c | 131 if(list->head == NULL){ 132 /* if list is empty, assign to head */ 133 list->head = newnode; 134 (list->head)->next = NULL; 135 (list->head)->prev = NULL; 138 list->curr = list->head; 139 list->tail = list->head; 160 }else if(list->curr == list->head){ 161 /* insert at head */ 162 newnode->next = list->head; [all...] |