| /external/syslinux/com32/lib/zlib/ |
| inflate.c | 113 state->mode = HEAD;
117 state->head = Z_NULL;
624 case HEAD:
639 if (state->head != Z_NULL)
640 state->head->done = -1;
684 if (state->head != Z_NULL)
685 state->head->text = (int)((hold >> 8) & 1);
691 if (state->head != Z_NULL)
692 state->head->time = hold;
698 if (state->head != Z_NULL)
[all...] |
| /external/zlib/src/ |
| inflate.c | 115 state->mode = HEAD;
119 state->head = Z_NULL;
640 case HEAD:
655 if (state->head != Z_NULL)
656 state->head->done = -1;
700 if (state->head != Z_NULL)
701 state->head->text = (int)((hold >> 8) & 1);
707 if (state->head != Z_NULL)
708 state->head->time = hold;
714 if (state->head != Z_NULL)
[all...] |
| /hardware/intel/common/libwsbm/src/ |
| wsbm_fencemgr.c | 47 struct _WsbmListHead head; member in struct:_WsbmFenceClass
106 struct _WsbmListHead head; member in struct:_WsbmFenceObject
134 WSBMINITLISTHEAD(&fc->head);
175 WSBMLISTDELINIT(&fence->head);
197 while (list != &fc->head && list->next != list) {
198 entry = WSBMLISTENTRY(list, struct _WsbmFenceObject, head);
236 wsbmSignalPreviousFences(mgr, &fence->head, fence->fence_class,
278 wsbmSignalPreviousFences(mgr, &fence->head, fence->fence_class,
325 WSBMLISTADDTAIL(&fence->head, &fc->head);
[all...] |
| wsbm_slabpool.c | 91 struct _WsbmListHead head; member in struct:_WsbmSlabBuffer
124 struct _WsbmListHead head; member in struct:_WsbmSlabKernelBO
130 struct _WsbmListHead head; member in struct:_WsbmSlab
268 WSBMLISTDELINIT(&kbo->head);
296 WSBMLISTADD(&kbo->head, &cache->cached);
298 WSBMLISTADD(&kbo->head, &cache->unCached);
315 struct _WsbmListHead *list, *head; local
335 head = (slabPool->proposedPlacement & TTM_PL_FLAG_CACHED) ?
338 WSBMLISTFOREACH(list, head) {
339 kboTmp = WSBMLISTENTRY(list, struct _WsbmSlabKernelBO, head);
578 struct _WsbmListHead *list, *prev, *first, *head; local
[all...] |
| /prebuilts/go/darwin-x86/src/vendor/golang_org/x/crypto/chacha20poly1305/ |
| chacha20poly1305.go | 74 func sliceForAppend(in []byte, n int) (head, tail []byte) {
76 head = in[:total]
78 head = make([]byte, total)
79 copy(head, in)
81 tail = head[len(in):]
|
| /prebuilts/go/linux-x86/src/vendor/golang_org/x/crypto/chacha20poly1305/ |
| chacha20poly1305.go | 74 func sliceForAppend(in []byte, n int) (head, tail []byte) {
76 head = in[:total]
78 head = make([]byte, total)
79 copy(head, in)
81 tail = head[len(in):]
|
| /frameworks/native/libs/ui/ |
| Region.cpp | 422 Rect* head; member in class:android::Region::rasterizer
428 : bounds(INT_MAX, 0, INT_MIN, 0), storage(reg.mStorage), head(), tail(), cur() {
482 if (tail-head == ssize_t(span.size())) {
484 Rect const* q = head;
499 Rect* r = head;
509 head = tail - span.size();
651 Region::const_iterator head = dst.begin(); local
655 if (head != tail) {
657 head->left != it.rect().fLeft ||
658 head->top != it.rect().fTop ||
848 const_iterator head = begin(); local
862 const_iterator head = begin(); local
[all...] |
| /external/cmockery/cmockery_0_1_2/src/ |
| cmockery.c | 118 static ListNode* list_add(ListNode * const head, ListNode *new_node);
119 static ListNode* list_add_value(ListNode * const head, const void *value,
127 static int list_empty(const ListNode * const head);
129 ListNode * const head, const void *value,
131 static int list_first(ListNode * const head, ListNode **output);
133 ListNode * const head, const CleanupListValue cleanup_value,
321 static ListNode* list_add_value(ListNode * const head, const void *value,
324 assert_true(head);
328 return list_add(head, new_node);
333 static ListNode* list_add(ListNode * const head, ListNode *new_node)
1344 const ListNode * const head = get_allocated_blocks_list(); local
1368 const ListNode * const head = get_allocated_blocks_list(); local
[all...] |
| /external/pdfium/third_party/zlib_v128/ |
| inflate.c | 115 state->mode = HEAD;
119 state->head = Z_NULL;
640 case HEAD:
655 if (state->head != Z_NULL)
656 state->head->done = -1;
700 if (state->head != Z_NULL)
701 state->head->text = (int)((hold >> 8) & 1);
707 if (state->head != Z_NULL)
708 state->head->time = hold;
714 if (state->head != Z_NULL)
[all...] |
| /external/mesa3d/src/gallium/drivers/nouveau/codegen/ |
| nv50_ir_util.h | 164 DLList() : head(0) { }
173 item->prev = &head;
174 item->next = head.next;
175 head.next->prev = item;
176 head.next = item;
185 DLLIST_ADDTAIL(&head, item);
195 Iterator(Item *head, bool r) : rev(r), pos(r ? head->prev : head->next),
196 term(head) { }
233 Item head; member in class:nv50_ir::DLList
[all...] |
| /external/pdfium/third_party/freetype/src/base/ |
| ftrfork.c | 58 unsigned char head[16], head2[16]; local
70 error = FT_Stream_Read( stream, (FT_Byte *)head, 16 );
75 if ( head[0] >= 0x80 || head[4] >= 0x80 || head[8] >= 0x80 )
78 *rdata_pos = ( head[ 0] << 24 ) |
79 ( head[ 1] << 16 ) |
80 ( head[ 2] << 8 ) |
81 head[ 3];
82 map_pos = ( head[ 4] << 24 )
[all...] |
| /external/mesa3d/src/gallium/drivers/llvmpipe/ |
| lp_scene.c | 62 scene->data.head =
94 assert(scene->data.head->next == NULL);
95 FREE(scene->data.head);
112 if (bin->head) {
141 bin->head = bin->tail;
241 bin->head = NULL;
283 for (block = list->head->next; block; block = tmp) {
288 list->head->next = NULL;
289 list->head->used = 0;
319 bin->head = block
[all...] |
| lp_scene.h | 98 struct cmd_block *head; member in struct:cmd_bin
115 struct data_block *head; member in struct:data_block_list
214 struct data_block *block = list->head;
248 struct data_block *block = list->head;
279 assert(list->head && list->head->used >= size);
280 list->head->used -= size;
|
| /external/syslinux/gpxe/src/net/80211/ |
| wpa_ccmp.c | 326 struct ccmp_head head; local
346 memcpy ( head.pn_lo, tx_pn, 2 );
347 memcpy ( head.pn_hi, tx_pn + 2, 4 );
348 head.kid = 0x20; /* have Extended IV, key ID 0 */
349 head._rsvd = 0;
350 memcpy ( iob_put ( eiob, sizeof ( head ) ), &head, sizeof ( head ) ); local
394 struct ccmp_head *head; local
409 head = eiob->data + hdrlen
[all...] |
| /external/tremolo/Tremolo/ |
| bitwiseARM.s | 88 LDR r11,[r0,#12] @ r11= head = b->head
92 LDR r11,[r11,#12] @ r11= head = head->next
134 LDR r11,[r0,#12] @ r11 = head = b->head
138 LDR r11,[r11,#12] @ r11 = head->next
176 LDR r14,[r0,#12] @ r14= head
180 LDR r10,[r14,#8] @ r10= head->length
181 LDR r14,[r14,#12] @ r14= head->nex
[all...] |
| /libcore/ojluni/src/main/java/java/util/ |
| LinkedHashMap.java | 207 * (head, tail) rather than a pointer to a header node to maintain
226 * The head (eldest) of the doubly linked list.
228 transient LinkedHashMapEntry<K,V> head; field in class:LinkedHashMap
250 head = p;
263 head = dst;
276 head = tail = null;
312 head = a;
323 if (evict && (first = head) != null && removeEldestEntry(first)) {
336 head = a;
344 head = p
[all...] |
| /development/ndk/platforms/android-9/include/linux/sunrpc/ |
| sched.h | 83 #define task_for_each(task, pos, head) list_for_each(pos, head) if ((task=list_entry(pos, struct rpc_task, u.tk_wait.list)),1)
85 #define task_for_first(task, head) if (!list_empty(head) && ((task=list_entry((head)->next, struct rpc_task, u.tk_wait.list)),1))
87 #define alltask_for_each(task, pos, head) list_for_each(pos, head) if ((task=list_entry(pos, struct rpc_task, tk_task)),1)
|
| /external/ipsec-tools/src/racoon/ |
| logger.c | 108 if (p->buf[p->head])
109 racoon_free(p->buf[p->head]);
110 p->buf[p->head] = racoon_strdup(str);
111 p->tbuf[p->head] = time(NULL);
112 p->head++;
113 p->head %= p->siz;
195 j = (p->head + i) % p->siz;
|
| /external/mesa3d/src/gallium/drivers/nouveau/ |
| nouveau_fence.c | 73 screen->fence.head = fence;
91 if (fence == screen->fence.head) {
92 screen->fence.head = fence->next;
93 if (!screen->fence.head)
96 for (it = screen->fence.head; it && it->next != fence; it = it->next);
122 for (fence = screen->fence.head; fence; fence = next) {
134 screen->fence.head = next;
|
| /frameworks/base/libs/hwui/font/ |
| CacheTexture.cpp | 38 CacheBlock* CacheBlock::insertBlock(CacheBlock* head, CacheBlock* newBlock) {
45 CacheBlock* currBlock = head;
56 return head;
76 return head;
82 CacheBlock* CacheBlock::removeBlock(CacheBlock* head, CacheBlock* blockToRemove) {
89 CacheBlock* newHead = head;
95 LOG_ALWAYS_FATAL_IF(head == blockToRemove,
96 "removeBlock: head should not have a previous block");
|
| /prebuilts/misc/common/swig/include/2.0.11/guile/ |
| std_vector.i | 56 SCM head, tail;
60 head = SCM_CAR(tail);
62 $1.push_back(*((T*)SWIG_MustGetPtr(head,
89 SCM head, tail;
92 head = SCM_CAR(tail);
94 temp.push_back(*((T*) SWIG_MustGetPtr(head,
133 SCM head = SCM_CAR($input);
134 if (SWIG_ConvertPtr(head,(void**) &x,
173 SCM head = SCM_CAR($input);
174 if (SWIG_ConvertPtr(head,(void**) &x
[all...] |
| /prebuilts/ndk/r10/platforms/android-12/arch-arm/usr/include/linux/sunrpc/ |
| sched.h | 83 #define task_for_each(task, pos, head) list_for_each(pos, head) if ((task=list_entry(pos, struct rpc_task, u.tk_wait.list)),1)
85 #define task_for_first(task, head) if (!list_empty(head) && ((task=list_entry((head)->next, struct rpc_task, u.tk_wait.list)),1))
87 #define alltask_for_each(task, pos, head) list_for_each(pos, head) if ((task=list_entry(pos, struct rpc_task, tk_task)),1)
|
| /prebuilts/ndk/r10/platforms/android-12/arch-mips/usr/include/linux/sunrpc/ |
| sched.h | 83 #define task_for_each(task, pos, head) list_for_each(pos, head) if ((task=list_entry(pos, struct rpc_task, u.tk_wait.list)),1)
85 #define task_for_first(task, head) if (!list_empty(head) && ((task=list_entry((head)->next, struct rpc_task, u.tk_wait.list)),1))
87 #define alltask_for_each(task, pos, head) list_for_each(pos, head) if ((task=list_entry(pos, struct rpc_task, tk_task)),1)
|
| /prebuilts/ndk/r10/platforms/android-12/arch-x86/usr/include/linux/sunrpc/ |
| sched.h | 83 #define task_for_each(task, pos, head) list_for_each(pos, head) if ((task=list_entry(pos, struct rpc_task, u.tk_wait.list)),1)
85 #define task_for_first(task, head) if (!list_empty(head) && ((task=list_entry((head)->next, struct rpc_task, u.tk_wait.list)),1))
87 #define alltask_for_each(task, pos, head) list_for_each(pos, head) if ((task=list_entry(pos, struct rpc_task, tk_task)),1)
|
| /prebuilts/ndk/r10/platforms/android-13/arch-arm/usr/include/linux/sunrpc/ |
| sched.h | 83 #define task_for_each(task, pos, head) list_for_each(pos, head) if ((task=list_entry(pos, struct rpc_task, u.tk_wait.list)),1)
85 #define task_for_first(task, head) if (!list_empty(head) && ((task=list_entry((head)->next, struct rpc_task, u.tk_wait.list)),1))
87 #define alltask_for_each(task, pos, head) list_for_each(pos, head) if ((task=list_entry(pos, struct rpc_task, tk_task)),1)
|
