| /external/freetype/src/base/ |
| ftrfork.c | 57 unsigned char head[16], head2[16]; local
69 error = FT_Stream_Read( stream, (FT_Byte *)head, 16 );
73 *rdata_pos = rfork_offset + ( ( head[0] << 24 ) |
74 ( head[1] << 16 ) |
75 ( head[2] << 8 ) |
76 head[3] );
77 map_pos = rfork_offset + ( ( head[4] << 24 ) |
78 ( head[5] << 16 ) |
79 ( head[6] << 8 ) |
80 head[7] )
[all...] |
| /external/fsck_msdos/ |
| dosfs.h | 91 cl_t head; /* pointer to start of chain */ member in struct:fatEntry
128 cl_t head; /* cluster no */ member in struct:dosDirEntry
|
| /external/grub/stage2/ |
| bios.c | 106 int head;
111 head = sector / geometry->sectors;
112 head_offset = head % geometry->heads;
113 cylinder_offset = head / geometry->heads;
104 int head; local
|
| /external/guava/guava-testlib/src/com/google/common/collect/testing/testers/ |
| ListSubListTester.java | 212 List<E> head = list.subList(0, size - 1); local
218 assertEquals(list.get(0), head.get(0));
219 assertEquals(list.get(size - 2), head.get(size - 2));
220 for (List<E> subList : Arrays.asList(copy, head, tail)) {
236 List<E> head = list.subList(0, size - 1); local
239 assertTrue(head.contains(list.get(0)));
243 assertTrue(head.contains(list.get(size - 2)));
245 assertFalse(head.contains(list.get(size - 1)));
254 List<E> head = list.subList(0, size - 1); local
258 assertEquals(head.indexOf(list.get(0))
280 List<E> head = list.subList(0, size - 1); local
[all...] |
| /external/ipsec-tools/src/include-glibc/sys/ |
| queue.h | 50 * added to the list after an existing element or at the head of the list.
51 * Elements being removed from the head of the list should use the explicit
58 * head of the list and the other to the tail of the list. The elements are
61 * to the list after an existing element, at the head of the list, or at the
62 * end of the list. Elements being removed from the head of the tail queue
72 * or after an existing element or at the head of the list. A list
75 * A tail queue is headed by a pair of pointers, one to the head of the
79 * after an existing element, at the head of the list, or at the end of
114 #define SLIST_HEAD_INITIALIZER(head) \
125 #define SLIST_EMPTY(head) ((head)->slh_first == NULL
427 *head = (struct quehead *)b; local
[all...] |
| /external/javassist/src/main/javassist/tools/reflect/ |
| ClassMetaobject.java | 207 String head = methodPrefix + identifier; local
209 if (allmethods[i].getName().startsWith(head)) {
|
| /external/jsilver/src/com/google/clearsilver/jsilver/data/ |
| DefaultDataContext.java | 38 * Head of the linked list of local variables, starting with the newest variable created.
40 private LocalVariable head = null; field in class:DefaultDataContext
85 head = head.nextScope;
119 if (head == null && !newScope) {
127 // We only look at the first local variable (head) if it is part of the
132 // single scope and thus head may not be the only local variable in the
138 if (!newScope && head != null && name.equals(head.name)) {
140 head.isFirst = true
[all...] |
| /external/kernel-headers/original/linux/ |
| notifier.h | 43 struct notifier_block *head; member in struct:atomic_notifier_head
48 struct notifier_block *head; member in struct:blocking_notifier_head
52 struct notifier_block *head; member in struct:raw_notifier_head
57 (name)->head = NULL; \
61 (name)->head = NULL; \
64 (name)->head = NULL; \
69 .head = NULL }
72 .head = NULL }
74 .head = NULL }
|
| uinput.h | 69 unsigned char head; member in struct:uinput_device
|
| /external/kernel-headers/original/linux/sunrpc/ |
| xdr.h | 51 struct kvec head[1], /* RPC header + non-page data */ member in struct:xdr_buf
|
| /external/libmtp/src/ |
| playlist-spl.c | 341 text_t* head = NULL; local
397 if(head == NULL) {
398 head = malloc(sizeof(text_t));
399 tail = head;
436 if(head != NULL)
439 // return the head of the list (NULL if no list)
440 return head;
|
| /external/libppp/src/ |
| cbcp.c | 198 struct cbcp_header *head; local
201 bp = m_get(sizeof *head + data->length, MB_CBCPOUT);
202 head = (struct cbcp_header *)MBUF_CTOP(bp);
203 head->code = code;
204 head->id = cbcp->fsm.id;
205 head->length = htons(sizeof *head + data->length);
206 memcpy(MBUF_CTOP(bp) + sizeof *head, data, data->length);
625 struct cbcp_header *head; local
642 head = (struct cbcp_header *)MBUF_CTOP(bp)
[all...] |
| mbuf.c | 245 struct mbuf *head; local
262 head = m_get(len + extra, bp ? bp->m_type : MB_UNKNOWN);
263 head->m_offset = extra;
264 head->m_len -= extra;
266 memcpy(MBUF_CTOP(head), ptr, len);
267 head->m_next = bp;
269 return head;
|
| /external/libxml2/ |
| HTMLtree.c | 64 if (xmlStrEqual(cur->name, BAD_CAST"head"))
76 * Search the head
80 if (xmlStrEqual(cur->name, BAD_CAST"head"))
163 htmlNodePtr cur, meta = NULL, head = NULL; local
190 if (xmlStrcasecmp(cur->name, BAD_CAST"head") == 0)
202 * Search the head
206 if (xmlStrcasecmp(cur->name, BAD_CAST"head") == 0)
209 head = cur->parent;
218 head = cur;
267 if ((encoding != NULL) && (head != NULL))
[all...] |
| /external/linux-tools-perf/util/ |
| evlist.c | 158 struct hlist_head *head; local
167 head = &evlist->heads[hash];
169 hlist_for_each_entry(sid, pos, head, node)
180 unsigned int head = perf_mmap__read_head(md); local
190 * If we somehow ended up ahead of the head, we got messed up.
192 * In either case, truncate and restart at head.
194 int diff = head - old;
199 * head points to a known good entry, start there.
201 old = head;
205 if (old != head) {
[all...] |
| /external/linux-tools-perf/util/ui/ |
| browser.c | 44 struct list_head *head = self->entries; local
49 pos = head->next;
55 pos = head->prev;
315 struct list_head *head = self->entries; local
319 self->top = head->next;
323 list_for_each_from(pos, head) {
|
| /external/mesa3d/src/gallium/auxiliary/pipebuffer/ |
| pb_buffer_fenced.c | 122 struct list_head head; member in struct:fenced_buffer
209 fenced_buf = LIST_ENTRY(struct fenced_buffer, curr, head);
224 fenced_buf = LIST_ENTRY(struct fenced_buffer, curr, head);
250 assert(fenced_buf->head.prev);
251 assert(fenced_buf->head.next);
252 LIST_DEL(&fenced_buf->head);
278 LIST_DEL(&fenced_buf->head);
281 LIST_ADDTAIL(&fenced_buf->head, &fenced_mgr->fenced);
304 assert(fenced_buf->head.prev);
305 assert(fenced_buf->head.next)
[all...] |
| pb_bufmgr_debug.c | 84 struct list_head head; member in struct:pb_debug_buffer
239 LIST_DEL(&buf->head);
351 buf = LIST_ENTRY(struct pb_debug_buffer, curr, head);
424 LIST_ADDTAIL(&buf->head, &mgr->list);
|
| pb_bufmgr_slab.c | 65 struct list_head head; member in struct:pb_slab_buffer
83 struct list_head head; member in struct:pb_slab
200 struct list_head *list = &buf->head;
212 if (slab->head.next == &slab->head)
213 LIST_ADDTAIL(&slab->head, &mgr->slabs);
217 list = &slab->head;
337 LIST_INITHEAD(&slab->head);
354 LIST_ADDTAIL(&buf->head, &slab->freeBuffers);
360 LIST_ADDTAIL(&slab->head, &mgr->slabs)
[all...] |
| /external/mesa3d/src/gallium/drivers/llvmpipe/ |
| lp_rast_debug.c | 95 const struct cmd_block *head = bin->head; local
100 while (head) {
101 for (i = 0; i < head->count; i++, j++) {
102 if (head->cmd[i] == LP_RAST_OP_SET_STATE)
103 state = head->arg[i].state;
106 cmd_name(head->cmd[i]),
107 is_blend(state, head, i) ? "blended" : "");
109 head = head->next
[all...] |
| lp_scene.h | 80 struct cmd_block *head; member in struct:cmd_block_list
99 struct cmd_block *head; member in struct:cmd_bin
116 struct data_block *head; member in struct:data_block_list
206 struct data_block *block = list->head;
240 struct data_block *block = list->head;
271 assert(list->head && list->head->used >= size);
272 list->head->used -= size;
|
| /external/mesa3d/src/gallium/drivers/nouveau/ |
| nouveau_mm.c | 36 struct list_head head; member in struct:mm_slab
138 LIST_INITHEAD(&slab->head);
144 LIST_ADD(&slab->head, &mm_bucket_by_order(cache, chunk_order)->free);
178 slab = LIST_ENTRY(struct mm_slab, bucket->used.next, head);
183 slab = LIST_ENTRY(struct mm_slab, bucket->free.next, head);
185 LIST_DEL(&slab->head);
186 LIST_ADD(&slab->head, &bucket->used);
198 LIST_DEL(&slab->head);
199 LIST_ADD(&slab->head, &bucket->full);
218 LIST_DEL(&slab->head);
[all...] |
| /external/mesa3d/src/gallium/state_trackers/egl/common/ |
| native_helper.c | 61 unsigned int head; member in struct:resource_surface
324 screen->fence_reference(screen, &rsurf->swap_fences[rsurf->head++],
326 rsurf->head &= EGL_SWAP_FENCES_MASK;
|
| /external/mesa3d/src/glsl/ |
| list.h | 28 * Each doubly-linked list has a sentinel head and tail node. These nodes
29 * contain no data. The head sentinel can be identified by its \c prev
33 * A list is empty if either the head sentinel's \c next pointer points to the
34 * tail sentinel or the tail sentinel's \c prev poiner points to the head
43 * - A \c head pointer that represents the \c next pointer of the
44 * head sentinel node.
45 * - A \c tail pointer that represents the \c prev pointer of the head
51 * Therefore, if \c head->next is \c NULL or \c tail_prev->prev is \c NULL,
191 * Is this the sentinel at the head of the list?
283 struct exec_node *head; member in struct:exec_list
[all...] |
| /external/mesa3d/src/glx/ |
| dri_common.c | 357 struct glx_config head, *tail, *m; local
359 tail = &head;
360 head.next = NULL;
372 return head.next;
|
