| /hardware/ti/omap3/dspbridge/inc/ |
| H A D | list.h | 60 #define LST_IsEmpty(l) (((l)->head.next == &(l)->head))
71 struct LST_ELEM head; member in struct:LST_LIST
85 * at the head of the list pointing to the head of the list, itself.
155 * Pops the head off the list and returns a pointer to it.
158 * Else, removes the element at the head of the list, making the next
159 * element the head of the list.
160 * The head is removed by making the tail element of the list point its
161 * "next" pointer at the next element after the head, an
[all...] |
| /hardware/ti/omap3/dspbridge/libbridge/inc/ |
| H A D | list.h | 60 #define LST_IsEmpty(l) (((l)->head.next == &(l)->head))
71 struct LST_ELEM head; member in struct:LST_LIST
85 * at the head of the list pointing to the head of the list, itself.
155 * Pops the head off the list and returns a pointer to it.
158 * Else, removes the element at the head of the list, making the next
159 * element the head of the list.
160 * The head is removed by making the tail element of the list point its
161 * "next" pointer at the next element after the head, an
[all...] |
| /hardware/qcom/media/mm-video/vidc/vdec/src/ |
| H A D | queue.c | 45 Node *head; member in struct:Queue
55 q->head = q->tail = NULL;
91 q->head = new_node;
112 temp = q->head;
117 q->head = q->tail = NULL;
121 q->head = q->head->next;
|
| /hardware/ti/wlan/lib/ |
| H A D | shlist.c | 17 SHLIST *shListFindItem( SHLIST *head, void *val, shListEqual func ) argument
21 for(item=head->next;( item != head );item=item->next)
35 SHLIST *shListGetLastItem( SHLIST *head )
37 if( head->prev != head )
38 return( head->prev );
42 SHLIST *shListGetFirstItem( SHLIST *head )
44 if( head->next != head )
49 shListGetNItem( SHLIST *head, unsigned long num ) argument
60 shListGetNextItem( SHLIST *head, SHLIST *item ) argument
69 shListGetPrevItem( SHLIST *head, SHLIST *item ) argument
78 shListDelItem( SHLIST *head, SHLIST *item, shListFree func ) argument
94 shListInsFirstItem( SHLIST *head, void *val ) argument
112 shListInsLastItem( SHLIST *head, void *val ) argument
130 shListInsBeforeItem( SHLIST *head, void *val, void *etal, shListCmp func ) argument
156 shListDelAllItems( SHLIST *head, shListFree func ) argument
167 shListPrintAllItems( SHLIST *head, shListPrint func ) argument
[all...] |
| H A D | scanmerge.c | 147 head - pointer to scan merge list head
151 static scan_merge_t *scan_add( SHLIST *head, scan_result_t *res_ptr ) argument
164 shListInsLastItem(head, (void *)scan_ptr);
236 SHLIST *head = &(mydrv->scan_merge_list); local
243 item = shListGetFirstItem(head);
248 item = shListGetNextItem(head, item);
257 item = shListFindItem( head, res_ptr, scan_equal );
278 scan_add(head, res_ptr);
282 item = shListGetFirstItem( head ); /* Ad
324 SHLIST *head = &(mydrv->scan_merge_list); local
[all...] |
| /hardware/msm7k/libgralloc/ |
| H A D | allocator.h | 41 NODE const* head() const { return mFirst; } function in class:LinkedList
42 NODE* head() { return mFirst; } function in class:LinkedList
|
| /hardware/msm7k/libgralloc-qsd8k/ |
| H A D | allocator.h | 42 NODE const* head() const { return mFirst; } function in class:LinkedList
43 NODE* head() { return mFirst; } function in class:LinkedList
|
| /hardware/qcom/media/mm-video/vidc/vdec/inc/ |
| H A D | Map.h | 46 node* head; member in class:Map
52 Map() : head( NULL ), tail ( NULL ),tmp(head),size_of_list(0) {}
53 bool empty() const { return ( !head || !tail ); }
66 while(head)
68 node* temp(head);
69 head=head->next;
79 tmp = head;
94 tmp = head;
[all...] |
| /hardware/ti/wlan/wl1271/TWD/Ctrl/ |
| H A D | CmdQueue.h | 142 TI_UINT32 head; member in struct:__anon700
|
| /hardware/qcom/media/mm-video/vidc/venc/test/ |
| H A D | venc_test.cpp | 224 int head; member in struct:MsgQ
592 m_sMsgQ.q[(m_sMsgQ.head + m_sMsgQ.size) % MAX_MSG].id = id;
594 m_sMsgQ.q[(m_sMsgQ.head + m_sMsgQ.size) % MAX_MSG].data = *data;
607 *msg = m_sMsgQ.q[m_sMsgQ.head];
609 m_sMsgQ.head = (m_sMsgQ.head + 1) % MAX_MSG;
|
| /hardware/broadcom/wlan/bcm4329/src/include/ |
| H A D | bcmutils.h | 95 void *head; member in struct:pktq_prec
140 #define pktq_ppeek(pq, prec) ((pq)->q[prec].head)
|