/hardware/msm7k/libgralloc/ |
H A D | allocator.h | 47 newNode->prev = node; 50 else node->next->prev = newNode; 55 newNode->prev = node->prev; 57 if (node->prev == 0) mFirst = newNode; 58 else node->prev->next = newNode; 59 node->prev = newNode; 65 newNode->prev = newNode->next = 0; 67 newNode->prev = 0; 69 mFirst->prev 116 mutable chunk_t* prev; member in struct:SimpleBestFitAllocator::chunk_t [all...] |
H A D | allocator.cpp | 145 chunk_t* const p = cur->prev;
|
/hardware/msm7k/libgralloc-qsd8k/ |
H A D | allocator.h | 48 newNode->prev = node; 51 else node->next->prev = newNode; 56 newNode->prev = node->prev; 58 if (node->prev == 0) mFirst = newNode; 59 else node->prev->next = newNode; 60 node->prev = newNode; 66 newNode->prev = newNode->next = 0; 68 newNode->prev = 0; 70 mFirst->prev 117 mutable chunk_t* prev; member in struct:SimpleBestFitAllocator::chunk_t [all...] |
H A D | allocator.cpp | 145 chunk_t* const p = cur->prev;
|
/hardware/ril/libril/ |
H A D | ril_event.h | 25 struct ril_event *prev; member in struct:ril_event
|
H A D | ril_event.cpp | 83 dlog(" prev = %x", (unsigned int)ev->prev); 112 list->prev = list; 119 ev->prev = list->prev; 120 ev->prev->next = ev; 121 list->prev = ev; 130 ev->next->prev = ev->prev; 131 ev->prev [all...] |
/hardware/qcom/media/mm-video/vidc/vdec/inc/ |
H A D | Map.h | 41 node* prev; member in struct:Map::node 44 data(t), data2(t2), prev(p), next(n) {} 145 if( tail->prev ) 146 tail->prev->next = tail; 180 tmp->prev = NULL; 191 tmp->prev = NULL; 200 tmp->next->prev = prevnode->next;
|
/hardware/msm7k/librpc/ |
H A D | svc.c | 183 registered_server **prev) 187 if (prev) *prev = NULL; 191 if (prev) *prev = trav; 290 registered_server *prev, *found; local 292 found = svc_find_nosync(xprt, prog, vers, &prev); 296 if (prev) { 299 prev->next = found->next; 181 svc_find_nosync(SVCXPRT *xprt, rpcprog_t prog, rpcvers_t vers, registered_server **prev) argument
|
H A D | clnt.c | 620 CLIENT *trav = (CLIENT *)clients, *prev = NULL; local 626 if (prev) 627 prev->next = trav->next; 634 prev = trav;
|
/hardware/ti/omap4xxx/ |
H A D | heaptracker.c | 46 struct hdr *prev; member in struct:hdr 164 hdr->prev = 0; 167 (*last)->prev = hdr; 175 if (hdr->prev) 176 hdr->prev->next = hdr->next; 180 hdr->next->prev = hdr->prev; 182 *first = hdr->prev;
|
/hardware/ti/omap3/dspbridge/inc/ |
H A D | list.h | 64 struct LST_ELEM *prev; member in struct:LST_ELEM 95 * "empty" element, because its "next" and "prev" pointers point at 162 * "prev" pointer of the next element after the head point at the tail 179 * "prev" pointer) to the tail of the list, this list is circular. 258 * Sets new element's "prev" pointer to the address previously held by 259 * the head element's prev pointer. This is the previous tail member of 261 * Sets the new head's prev pointer to the address of the element. 265 * Sets head's prev pointer to the address of the new element. 280 * "prev" pointer points at the tail of the list), the list is circular.
|
/hardware/ti/omap3/dspbridge/libbridge/inc/ |
H A D | list.h | 64 struct LST_ELEM *prev; member in struct:LST_ELEM 95 * "empty" element, because its "next" and "prev" pointers point at 162 * "prev" pointer of the next element after the head point at the tail 179 * "prev" pointer) to the tail of the list, this list is circular. 258 * Sets new element's "prev" pointer to the address previously held by 259 * the head element's prev pointer. This is the previous tail member of 261 * Sets the new head's prev pointer to the address of the element. 265 * Sets head's prev pointer to the address of the new element. 280 * "prev" pointer points at the tail of the list), the list is circular.
|
/hardware/broadcom/wlan/bcm4329/dhdutil/ |
H A D | bcmutils.c | 246 void *p, *prev; local 255 for (prev = NULL; p != q->tail; p = PKTLINK(p)) 256 prev = p; 258 if (prev) 259 PKTSETLINK(prev, NULL); 263 q->tail = prev; 275 void *p, *prev = NULL; local 285 PKTSETLINK(prev, PKTLINK(p)); 290 p = (head ? q->head : PKTLINK(prev)); 292 prev 391 void *p, *prev; local [all...] |
/hardware/broadcom/wlan/bcmdhd/dhdutil/ |
H A D | bcmutils.c | 246 void *p, *prev; local 255 for (prev = NULL; p != q->tail; p = PKTLINK(p)) 256 prev = p; 258 if (prev) 259 PKTSETLINK(prev, NULL); 263 q->tail = prev; 275 void *p, *prev = NULL; local 285 PKTSETLINK(prev, PKTLINK(p)); 290 p = (head ? q->head : PKTLINK(prev)); 292 prev 391 void *p, *prev; local [all...] |