| /bootable/bootloader/legacy/arch_msm7k/ |
| hsusb.c | 44 struct ept_queue_head *head; member in struct:usb_endpoint
77 ept->head = epts + (num * 2) + (ept->in);
78 ept->head->config = cfg;
84 num, in ? "in":"out", ept, ept->head, max_pkt, ept->bit);
103 ept->head->config = CONFIG_MAX_PKT(512) | CONFIG_ZLT;
105 ept->head->config = CONFIG_MAX_PKT(64) | CONFIG_ZLT;
131 ept->head->next = (unsigned) item;
132 ept->head->info = 0;
226 memcpy(&s, ept->head->setup_data, sizeof(s));
406 ept->head->info = INFO_ACTIVE
[all...] |
| /external/openssl/crypto/bn/ |
| bn_ctx.c | 102 BN_POOL_ITEM *head, *current, *tail; member in struct:bignum_pool
159 BN_POOL_ITEM *item = ctx->pool.head;
237 BN_POOL_ITEM *pool = ctx->pool.head;
362 p->head = p->current = p->tail = NULL;
368 while(p->head)
371 BIGNUM *bn = p->head->vals;
377 p->current = p->head->next;
378 OPENSSL_free(p->head);
379 p->head = p->current;
386 BN_POOL_ITEM *item = p->head;
[all...] |
| /external/kernel-headers/original/linux/sunrpc/ |
| sched.h | 103 #define task_for_each(task, pos, head) \
104 list_for_each(pos, head) \
107 #define task_for_first(task, head) \
108 if (!list_empty(head) && \
109 ((task=list_entry((head)->next, struct rpc_task, u.tk_wait.list)),1))
112 #define alltask_for_each(task, pos, head) \
113 list_for_each(pos, head) \
|
| /external/webkit/WebCore/platform/ |
| Arena.cpp | 199 * Free tail arenas linked after head, which may not be the true list head.
200 * Reset pool->current to point to head in case it pointed at a tail arena.
202 static void FreeArenaList(ArenaPool *pool, Arena *head, bool reallyFree)
206 ap = &head->next;
243 head->next = 0;
245 pool->current = head;
|
| /dalvik/libcore/concurrent/src/main/java/java/util/concurrent/ |
| DelayQueue.java | 19 * when its delay has expired. The <em>head</em> of the queue is that
21 * past. If no delay has expired there is no head and <tt>poll</tt>
46 * Thread designated to wait for the element at the head of
54 * interim. Whenever the head of the queue is replaced with
65 * at the head of the queue or a new thread may need to
146 * Retrieves and removes the head of this queue, or returns <tt>null</tt>
149 * @return the head of this queue, or <tt>null</tt> if this
167 * Retrieves and removes the head of this queue, waiting if necessary
170 * @return the head of this queue
207 * Retrieves and removes the head of this queue, waiting if necessar
[all...] |
| SynchronousQueue.java | 26 * <em>head</em> of the queue is the element that the first queued
129 * old head pointers), but references in Queue nodes must be
261 /** The head (top) of the stack */
262 volatile SNode head; field in class:SynchronousQueue.TransferStack
266 (TransferStack.class, SNode.class, "head");
269 return h == head && headUpdater.compareAndSet(this, h, nh);
276 * and CASes of head and to avoid surges of garbage when CASes
315 SNode h = head;
328 if ((h = head) != null && h.next == s)
383 * to be at the head of the stack, calls to park ar
538 transient volatile QNode head; field in class:SynchronousQueue.TransferQueue
[all...] |
| /external/quake/quake/src/WinQuake/ |
| net_comx.cpp | 36 volatile int head;
member in struct:__anon5435
41 #define FULL(q) (q.head == ((q.tail-1) & QUEUEMASK))
42 #define EMPTY(q) (q.tail == q.head)
43 #define ENQUEUE(q,b) (q.data[q.head] = b, q.head = (q.head + 1) & QUEUEMASK)
406 p->outputQueue.head = p->outputQueue.tail = 0;
407 p->inputQueue.head = p->inputQueue.tail = 0;
585 // I got this from the guys at head-to-head who say it's necessary.
[all...] |
| /hardware/ti/wlan/wl1271/platforms/os/linux/src/ |
| RxBuf.c | 61 rx_head = (rx_head_t *)skb->head;
65 printk("-->> RxBufAlloc(len=%d) skb=0x%x skb->data=0x%x skb->head=0x%x skb->len=%d\n",
66 (int)len, (int)skb, (int)skb->data, (int)skb->head, (int)skb->len);
97 printk("-->> RxBufFree() skb=0x%x skb->data=0x%x skb->head=0x%x skb->len=%d\n",
98 (int)skb, (int)skb->data, (int)skb->head, (int)skb->len);
|
| /system/core/init/ |
| util.c | 198 void list_add_tail(struct listnode *head, struct listnode *item)
200 item->next = head;
201 item->prev = head->prev;
202 head->prev->next = item;
203 head->prev = item;
|
| /system/wlan/ti/wilink_6_1/platforms/os/linux/src/ |
| RxBuf.c | 58 rx_head = (rx_head_t *)skb->head;
62 printk("-->> RxBufAlloc(len=%d) skb=0x%x skb->data=0x%x skb->head=0x%x skb->len=%d\n",
63 (int)len, (int)skb, (int)skb->data, (int)skb->head, (int)skb->len);
94 printk("-->> RxBufFree() skb=0x%x skb->data=0x%x skb->head=0x%x skb->len=%d\n",
95 (int)skb, (int)skb->data, (int)skb->head, (int)skb->len);
|
| /bionic/libc/kernel/common/linux/raid/ |
| md_k.h | 174 #define ITERATE_RDEV_GENERIC(head,rdev,tmp) for ((tmp) = (head).next; (rdev) = (list_entry((tmp), mdk_rdev_t, same_set)), (tmp) = (tmp)->next, (tmp)->prev != &(head) ; )
|
| /dalvik/libcore/logging/src/main/java/java/util/logging/ |
| Formatter.java | 25 * string representation. Head and tail strings are sometimes used to wrap a set
94 * Gets the head string used to wrap a set of log records. This base class
99 * @return the head string used to wrap a set of log records, empty in this
|
| /external/svox/pico/lib/ |
| picowa.c | 255 picodata_itemhead_t *head /*inout*/,
265 PICODBG_DEBUG(("type %c, len %d", head->type, head->len));
281 found = picoklex_lexLookup(wa->ulex[i], content, head->len, &lexres);
290 if (!found && !picoklex_lexLookup(wa->lex, content, head->len, &lexres)) {
298 waClassifyPos(this, wa, content, head->len))) {
315 head->type = PICODATA_ITEM_WORDINDEX;
317 head->info1 = lexres.posind[0];
324 head->info1 = picoktab_getPosGroup(wa->tabpos, posbuf,
327 head->info2 = foundIndex
[all...] |
| /hardware/msm7k/libgralloc/ |
| allocator.cpp | 39 delete mList.remove(mList.head());
86 chunk_t* cur = mList.head();
134 chunk_t* cur = mList.head();
|
| /hardware/msm7k/libgralloc-qsd8k/ |
| allocator.cpp | 39 delete mList.remove(mList.head());
86 chunk_t* cur = mList.head();
134 chunk_t* cur = mList.head();
|
| /ndk/build/platforms/android-3/arch-arm/usr/include/linux/raid/ |
| md_k.h | 174 #define ITERATE_RDEV_GENERIC(head,rdev,tmp) for ((tmp) = (head).next; (rdev) = (list_entry((tmp), mdk_rdev_t, same_set)), (tmp) = (tmp)->next, (tmp)->prev != &(head) ; )
|
| /ndk/build/platforms/android-4/arch-arm/usr/include/linux/raid/ |
| md_k.h | 174 #define ITERATE_RDEV_GENERIC(head,rdev,tmp) for ((tmp) = (head).next; (rdev) = (list_entry((tmp), mdk_rdev_t, same_set)), (tmp) = (tmp)->next, (tmp)->prev != &(head) ; )
|
| /ndk/build/platforms/android-5/arch-arm/usr/include/linux/raid/ |
| md_k.h | 174 #define ITERATE_RDEV_GENERIC(head,rdev,tmp) for ((tmp) = (head).next; (rdev) = (list_entry((tmp), mdk_rdev_t, same_set)), (tmp) = (tmp)->next, (tmp)->prev != &(head) ; )
|
| /ndk/build/platforms/android-5/arch-x86/usr/include/linux/raid/ |
| md_k.h | 174 #define ITERATE_RDEV_GENERIC(head,rdev,tmp) for ((tmp) = (head).next; (rdev) = (list_entry((tmp), mdk_rdev_t, same_set)), (tmp) = (tmp)->next, (tmp)->prev != &(head) ; )
|
| /ndk/build/platforms/android-8/arch-arm/usr/include/linux/raid/ |
| md_k.h | 174 #define ITERATE_RDEV_GENERIC(head,rdev,tmp) for ((tmp) = (head).next; (rdev) = (list_entry((tmp), mdk_rdev_t, same_set)), (tmp) = (tmp)->next, (tmp)->prev != &(head) ; )
|
| /ndk/build/platforms/android-8/arch-x86/usr/include/linux/raid/ |
| md_k.h | 174 #define ITERATE_RDEV_GENERIC(head,rdev,tmp) for ((tmp) = (head).next; (rdev) = (list_entry((tmp), mdk_rdev_t, same_set)), (tmp) = (tmp)->next, (tmp)->prev != &(head) ; )
|
| /frameworks/base/obex/javax/obex/ |
| Operation.java | 67 * void putObjectViaOBEX(ClientSession conn, HeaderSet head, byte[] obj) throws IOException {
69 * head.setHeader(head.LENGTH, new Long(obj.length));
71 * Operation op = conn.put(head);
85 * byte[] getObjectViaOBEX(ClientSession conn, HeaderSet head) throws IOException {
87 * Operation op = conn.get(head);
|
| /build/tools/droiddoc/templates/ |
| head_tag.cs | 0 <head>
34 </head>
|
| /build/tools/droiddoc/templates-pdk/ |
| head_tag.cs | 0 <head>
46 </head>
|
| /dalvik/docs/opcodes/ |
| opcode-04-move-wide.html | 5 <head>
8 </head>
|
