Searched refs:next (Results 1 - 25 of 32) sorted by relevance

12

/hardware/msm7k/libgralloc/
H A Dallocator.h48 newNode->next = node->next;
49 if (node->next == 0) mLast = newNode;
50 else node->next->prev = newNode;
51 node->next = newNode;
56 newNode->next = node;
58 else node->prev->next = newNode;
65 newNode->prev = newNode->next = 0;
68 newNode->next = mFirst;
79 newNode->next
117 mutable chunk_t* next; member in struct:SimpleBestFitAllocator::chunk_t
[all...]
H A Dallocator.cpp101 cur = cur->next;
146 chunk_t* const n = cur->next;
162 cur = cur->next;
/hardware/msm7k/libgralloc-qsd8k/
H A Dallocator.h49 newNode->next = node->next;
50 if (node->next == 0) mLast = newNode;
51 else node->next->prev = newNode;
52 node->next = newNode;
57 newNode->next = node;
59 else node->prev->next = newNode;
66 newNode->prev = newNode->next = 0;
69 newNode->next = mFirst;
80 newNode->next
118 mutable chunk_t* next; member in struct:SimpleBestFitAllocator::chunk_t
[all...]
H A Dallocator.cpp101 cur = cur->next;
146 chunk_t* const n = cur->next;
162 cur = cur->next;
/hardware/ti/wlan/lib/
H A Dshlist.c13 listPtr->next = listPtr;
21 for(item=head->next;( item != head );item=item->next)
44 if( head->next != head )
45 return( head->next );
54 for(i=0,item=head->next;( (i < num) && (item != head) );i++,item=item->next);
64 if( item->next != head )
65 return( item->next );
85 (item->prev)->next
[all...]
H A Dshlist.h9 struct SHLIST_STRUC *next; member in struct:SHLIST_STRUC
/hardware/qcom/media/mm-video/vidc/vdec/inc/
H A DMap.h42 node* next; member in struct:Map::node
44 data(t), data2(t2), prev(p), next(n) {}
69 head=head->next;
86 tmp = tmp->next;
101 tmp = tmp->next;
124 tmp = tmp->next;
135 tmp = tmp->next;
146 tail->prev->next = tail;
179 tmp = tmp->next;
182 tempnode->next
[all...]
H A Dh264_utils.h164 uint32 next ();
/hardware/qcom/media/mm-video/vidc/vdec/src/
H A Dqueue.c40 struct Node *next; member in struct:Node
87 new_node->next = NULL;
95 q->tail->next = new_node;
121 q->head = q->head->next;
H A Dh264_utils.cpp82 // Return next RBSP byte as a word
83 uint32 RbspParser::next () function in class:RbspParser
90 // Advance RBSP decoder to next byte
123 x |= ((next () >> ((8 - static_cast<uint32>(bit)) - s)) &
/hardware/ril/libril/
H A Dril_event.cpp82 dlog(" next = %x", (unsigned int)ev->next);
111 list->next = list;
118 ev->next = list;
120 ev->prev->next = ev;
130 ev->next->prev = ev->prev;
131 ev->prev->next = ev->next;
132 ev->next = NULL;
164 struct ril_event * tev = timer_list.next;
165 struct ril_event * next; local
208 struct ril_event * next = ev->next; local
[all...]
H A Dril_event.h24 struct ril_event *next; member in struct:ril_event
/hardware/ti/omap3/dspbridge/inc/
H A Ddrv.h186 struct NODE_RES_OBJECT *next; member in struct:NODE_RES_OBJECT
197 struct DMM_RES_OBJECT *next; member in struct:DMM_RES_OBJECT
208 struct DSPHEAP_RES_OBJECT *next; member in struct:DSPHEAP_RES_OBJECT
217 struct STRM_RES_OBJECT *next; member in struct:STRM_RES_OBJECT
233 /* Pointer to next process context
235 struct PROCESS_CONTEXT *next; member in struct:PROCESS_CONTEXT
379 * 0: If it fail to get the next Dev Object.
395 * 0: If it fail to Get the next Dev Extension
H A Dlist.h60 #define LST_IsEmpty(l) (((l)->head.next == &(l)->head))
63 struct LST_ELEM *next; member in struct:LST_ELEM
84 * An empty list is indicated by the "next" pointer in the element
95 * "empty" element, because its "next" and "prev" pointers point at
158 * Else, removes the element at the head of the list, making the next
161 * "next" pointer at the next element after the head, and by making the
162 * "prev" pointer of the next element after the head point at the tail
163 * element. So the next element after the head becomes the new head of
177 * Because the tail of the list points forward (its "next" pointe
[all...]
/hardware/ti/omap3/dspbridge/libbridge/inc/
H A Dlist.h60 #define LST_IsEmpty(l) (((l)->head.next == &(l)->head))
63 struct LST_ELEM *next; member in struct:LST_ELEM
84 * An empty list is indicated by the "next" pointer in the element
95 * "empty" element, because its "next" and "prev" pointers point at
158 * Else, removes the element at the head of the list, making the next
161 * "next" pointer at the next element after the head, and by making the
162 * "prev" pointer of the next element after the head point at the tail
163 * element. So the next element after the head becomes the new head of
177 * Because the tail of the list points forward (its "next" pointe
[all...]
/hardware/broadcom/wlan/bcm4329/src/bcmsdio/sys/
H A Dbcmsdh_linux.c67 bcmsdh_hc_t *next; member in struct:bcmsdh_hc
244 sdhc->next = sdhcinfo;
283 for (sdhc = sdhcinfo, prev = NULL; sdhc; sdhc = sdhc->next) {
286 prev->next = sdhc->next;
477 sdhc->next = sdhcinfo;
504 for (sdhc = sdhcinfo, prev = NULL; sdhc; sdhc = sdhc->next) {
507 prev->next = sdhc->next;
570 if (bcmsdh_pci_driver.node.next)
[all...]
/hardware/msm7k/librpc/
H A Dsvc.c76 struct registered_server_struct *next; member in struct:registered_server_struct
130 for (; trav; trav = trav->next)
188 for (; trav; trav = trav->next) {
273 svc->next = xprt->servers;
299 prev->next = found->next;
303 xprt->servers = found->next;
H A Dclnt.c30 struct CLIENT *next; member in struct:CLIENT
203 for (; client; client = client->next) {
280 for(; trav; trav = trav->next) {
572 client->next = (CLIENT *)clients;
621 for(; trav; trav = trav->next) {
627 prev->next = trav->next;
629 clients = trav->next;
/hardware/broadcom/wlan/bcm4329/src/shared/
H A Dsbutils.c459 uint next; local
472 for (i = 0, next = sii->numcores; i < numcores && next < SB_BUS_MAXCORES; i++, next++) {
473 sii->common_info->coresba[next] = sbba + (i * SI_CORE_SIZE);
477 (sii->common_info->coresba[next] == sba)) {
478 SI_MSG(("_sb_scan: reuse mapped regs %p for core %u\n", regs, next));
479 sii->common_info->regs[next] = regs;
482 /* change core to 'next' and read its coreid */
483 sii->curmap = _sb_setcoreidx(sii, next);
[all...]
H A Dlinux_osl.c68 struct bcm_mem_link *next; member in struct:bcm_mem_link
274 nskb = skb->next;
275 skb->next = NULL;
/hardware/libhardware/include/hardware/
H A Dcopybit.h128 int (*next)(struct copybit_region_t const *region, struct copybit_rect_t *rect); member in struct:copybit_region_t
/hardware/ti/wlan/wl1271/CUDK/configurationutility/src/
H A Dconsole.c79 struct ConEntry_t *next; member in struct:ConEntry_t
201 pEntryTemp1 = pEntryTemp->next;
245 p_token = p_token->next;
505 p_token = p_token->next;
514 p_token = p_token->next;
537 p_token = p_token->next;
613 p_token = p_token->next;
631 p_token = p_token->next;
893 p_e = &((*p_e)->next);
1040 p_e = &((*p_e)->next);
[all...]
/hardware/broadcom/wlan/bcm4329/src/include/
H A Dlinuxver.h196 for (pos = (head)->next; pos != (head); pos = pos->next)
304 tasklet->next = NULL;
H A Dlinux_osl.h244 #define PKTNEXT(osh, skb) (((struct sk_buff*)(skb))->next)
245 #define PKTSETNEXT(osh, skb, x) (((struct sk_buff*)(skb))->next = (struct sk_buff*)(x))
277 for (nskb = skb; nskb; nskb = nskb->next) {
295 for (nskb = (struct sk_buff *)pkt; nskb; nskb = nskb->next) {
/hardware/broadcom/wlan/bcm4329/src/dhd/sys/
H A Ddhd_common.c1417 iscanbuf_alloc->next = NULL;
1430 while (iscanbuf_head->next)
1431 iscanbuf_head = iscanbuf_head->next;
1433 iscanbuf_head->next = iscanbuf_alloc;
1455 iscanbuf_cur = iscanbuf_cur->next;
1456 iscanbuf_free->next = 0;
1465 iscanbuf_cur = iscanbuf_cur->next;
1468 iscanbuf_prv->next = iscan_delete->next;
1470 iscan_delete->next
[all...]

Completed in 171 milliseconds

12