Searched refs:head (Results 51 - 75 of 736) sorted by relevance

1234567891011>>

/external/javassist/src/main/javassist/compiler/ast/
H A DFieldDecl.java27 public Declarator getDeclarator() { return (Declarator)tail().head(); }
29 public ASTree getInit() { return (ASTree)sublist(2).head(); }
H A DCondExpr.java28 public ASTree condExpr() { return head(); }
32 public ASTree thenExpr() { return tail().head(); }
36 public ASTree elseExpr() { return tail().tail().head(); }
/external/jemalloc/src/
H A Dtsd.c161 tsd_init_check_recursion(tsd_init_head_t *head, tsd_init_block_t *block) argument
167 malloc_mutex_lock(&head->lock);
168 ql_foreach(iter, &head->blocks, link) {
170 malloc_mutex_unlock(&head->lock);
177 ql_tail_insert(&head->blocks, block, link);
178 malloc_mutex_unlock(&head->lock);
183 tsd_init_finish(tsd_init_head_t *head, tsd_init_block_t *block) argument
186 malloc_mutex_lock(&head->lock);
187 ql_remove(&head->blocks, block, link);
188 malloc_mutex_unlock(&head
[all...]
/external/mesa3d/src/glsl/
H A Dlist.h28 * 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/okhttp/okio/okio/src/main/java/okio/
H A DInflaterSource.java77 sink.head = tail.pop();
104 Segment head = source.buffer().head;
105 bufferBytesHeldByInflater = head.limit - head.pos;
106 inflater.setInput(head.data, head.pos, bufferBytesHeldByInflater);
H A DGzipSink.java131 for (Segment head = buffer.head; byteCount > 0; head = head.next) {
132 int segmentLength = (int) Math.min(byteCount, head.limit - head.pos);
133 crc.update(head.data, head.pos, segmentLength);
H A DBuffer.java52 Segment head; field in class:Buffer
148 Segment s = head;
174 Segment s = head;
184 if (out.head == null) {
185 out.head = copy.next = copy.prev = copy;
187 out.head.prev.push(copy);
206 Segment s = head;
217 head = s = toRecycle.pop();
264 Segment tail = head.prev;
275 Segment segment = head;
[all...]
/external/libdrm/freedreno/
H A Dlist.h110 #define LIST_FOR_EACH_ENTRY(pos, head, member) \
111 for (pos = container_of((head)->next, pos, member); \
112 &pos->member != (head); \
115 #define LIST_FOR_EACH_ENTRY_SAFE(pos, storage, head, member) \
116 for (pos = container_of((head)->next, pos, member), \
118 &pos->member != (head); \
121 #define LIST_FOR_EACH_ENTRY_SAFE_REV(pos, storage, head, member) \
122 for (pos = container_of((head)->prev, pos, member), \
124 &pos->member != (head); \
127 #define LIST_FOR_EACH_ENTRY_FROM(pos, start, head, membe
[all...]
/external/libdrm/tests/radeon/
H A Dlist.h110 #define LIST_FOR_EACH_ENTRY(pos, head, member) \
111 for (pos = container_of((head)->next, pos, member); \
112 &pos->member != (head); \
115 #define LIST_FOR_EACH_ENTRY_SAFE(pos, storage, head, member) \
116 for (pos = container_of((head)->next, pos, member), \
118 &pos->member != (head); \
121 #define LIST_FOR_EACH_ENTRY_SAFE_REV(pos, storage, head, member) \
122 for (pos = container_of((head)->prev, pos, member), \
124 &pos->member != (head); \
127 #define LIST_FOR_EACH_ENTRY_FROM(pos, start, head, membe
[all...]
/external/mesa3d/src/gallium/auxiliary/util/
H A Du_double_list.h120 #define LIST_FOR_EACH_ENTRY(pos, head, member) \
121 for (pos = NULL, pos = container_of((head)->next, pos, member); \
122 &pos->member != (head); \
125 #define LIST_FOR_EACH_ENTRY_SAFE(pos, storage, head, member) \
126 for (pos = NULL, pos = container_of((head)->next, pos, member), \
128 &pos->member != (head); \
131 #define LIST_FOR_EACH_ENTRY_SAFE_REV(pos, storage, head, member) \
132 for (pos = NULL, pos = container_of((head)->prev, pos, member), \
134 &pos->member != (head); \
137 #define LIST_FOR_EACH_ENTRY_FROM(pos, start, head, membe
[all...]
H A Du_fifo.h33 size_t head; member in struct:util_fifo
45 fifo->head = 0;
60 if (++fifo->head >= fifo->size)
61 fifo->head = 0;
63 array[fifo->head] = ptr;
/external/valgrind/coregrind/m_gdbserver/
H A Dinferiors.c48 list->head = new_inferior;
55 struct inferior_list_entry *cur = list->head, *next;
67 if (list->head != list->tail)
70 list->head->id = new_id;
78 if (list->head == entry) {
79 list->head = entry->next;
81 list->tail = list->head;
85 cur = &list->head;
119 struct inferior_list_entry *inf = all_threads.head;
138 struct inferior_list_entry *inf = all_threads.head;
[all...]
/external/blktrace/btt/
H A Ddevmap.c25 struct list_head head; member in struct:devmap
44 list_add_tail(&dmp->head, &all_devmaps);
55 struct devmap *dmp = list_entry(p, struct devmap, head);
87 struct devmap *dmp = list_entry(p, struct devmap, head);
89 list_del(&dmp->head);
H A Dmisc.c35 struct list_head head; member in struct:file_info
41 struct list_head head; member in struct:buf_info
54 struct file_info *fip = list_entry(p, struct file_info, head);
60 list_del(&fip->head);
71 struct buf_info *bip = list_entry(p, struct buf_info, head);
73 list_del(&bip->head);
124 list_add_tail(&fip->head, &files_to_clean);
132 list_add_tail(&bip->head, &all_bufs);
/external/linux-tools-perf/src/tools/perf/util/
H A Dparse-events.y62 %type <head> event_config
64 %type <head> event_pmu
65 %type <head> event_legacy_symbol
66 %type <head> event_legacy_cache
67 %type <head> event_legacy_mem
68 %type <head> event_legacy_tracepoint
69 %type <head> event_legacy_numeric
70 %type <head> event_legacy_raw
71 %type <head> event_def
72 %type <head> event_mo
[all...]
/external/mesa3d/src/gallium/drivers/nv50/codegen/
H A Dnv50_ir_util.cpp29 for (Item *next, *item = head.next; item != &head; item = next) {
33 head.next = head.prev = &head;
53 assert(term != &dest.head);
59 DLLIST_ADDHEAD(&dest.head, item);
91 Interval::Interval(const Interval& that) : head(NULL), tail(NULL)
104 for (Range *next, *r = head; r; r = next) {
108 head
[all...]
/external/skia/src/views/
H A DSkTagList.cpp29 void SkTagList::DeleteTag(SkTagList** head, U8CPU tag)
33 SkTagList* rec = *head;
45 *head = next;
H A DSkTagList.h38 static SkTagList* Find(SkTagList* head, U8CPU tag);
40 static void DeleteAll(SkTagList* head);
/external/libcap-ng/libcap-ng-0.7/utils/
H A Dproc-llist.c31 l->head = NULL;
58 if (l->head == NULL)
59 l->head = newnode;
73 cur = l->head;
82 l->head = NULL;
91 cur = l->head; /* start at the beginning */
/external/kernel-headers/original/uapi/asm-arm64/asm/
H A Dsigcontext.h50 struct _aarch64_ctx head; member in struct:fpsimd_context
60 struct _aarch64_ctx head; member in struct:esr_context
/external/compiler-rt/lib/interception/
H A Dinterception_win.cc143 // wrapper, in this case we need to keep the leading 5+ bytes ('head')
144 // of the original code somewhere with a "jmp <old_func+head>".
145 // We call these 'head'+5 bytes of instructions a "trampoline".
149 size_t head = 5; local
152 // to the trampoline and store it in 'head'.
153 head = RoundUpToInstrBoundary(head, old_bytes);
154 if (!head)
158 char *trampoline = GetMemoryForTrampoline(head + 5);
161 _memcpy(trampoline, old_bytes, head);
[all...]
/external/mesa3d/src/gallium/drivers/nouveau/
H A Dnouveau_mm.c36 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);
260 nouveau_mm_free_slabs(struct list_head *head) argument
[all...]
/external/fsck_msdos/
H A Ddir.c249 || fat[boot->RootCl].head != boot->RootCl) {
267 rootDir->head = boot->RootCl;
398 if (dir->head == CLUST_FREE)
401 if (dir->head < CLUST_FIRST || dir->head >= boot->NumClusters)
403 physicalSize = fat[dir->head].length * boot->ClusterSize;
424 for (cl = dir->head; (sz += boot->ClusterSize) < dir->size;)
453 cl = dir->head;
541 cl = dir->head;
739 dirent.head
1019 reconnect(int dosfs, struct bootblock *boot, struct fatEntry *fat, cl_t head) argument
[all...]
/external/eigen/doc/examples/
H A DTutorial_BlockOperations_vector.cpp10 cout << "v.head(3) =" << endl << v.head(3) << endl << endl;
/external/ipsec-tools/src/racoon/
H A Dlogger.h38 int head; member in struct:log

Completed in 754 milliseconds

1234567891011>>