HomeSort by relevance Sort by last modified time
    Searched defs:head (Results 601 - 625 of 818) sorted by null

<<21222324252627282930>>

  /external/mesa3d/src/mesa/drivers/dri/intel/
intel_mipmap_tree.c 852 struct intel_resolve_map *head = &mt->hiz_map; local
855 head->next = malloc(sizeof(*head->next));
856 head->next->prev = head;
857 head->next->next = NULL;
858 head = head->next;
860 head->level = level;
861 head->layer = layer
    [all...]
  /external/mesa3d/src/mesa/main/
attrib.c 186 * Insert it into the linked list named by 'head'.
189 save_attrib_data(struct gl_attrib_node **head,
196 /* insert at head */
197 n->next = *head;
198 *head = n;
209 struct gl_attrib_node *head; local
224 head = NULL;
230 save_attrib_data(&head, GL_ACCUM_BUFFER_BIT, attr);
241 save_attrib_data(&head, GL_COLOR_BUFFER_BIT, attr);
249 save_attrib_data(&head, GL_CURRENT_BIT, attr)
1506 struct gl_attrib_node *head; local
    [all...]
  /external/openssl/ssl/
ssl_ciph.c 664 static void ll_append_tail(CIPHER_ORDER **head, CIPHER_ORDER *curr,
668 if (curr == *head)
669 *head=curr->next;
680 static void ll_append_head(CIPHER_ORDER **head, CIPHER_ORDER *curr,
683 if (curr == *head) return;
690 (*head)->prev=curr;
691 curr->next= *head;
693 *head=curr;
856 CIPHER_ORDER *head)
870 ciph_curr = head;
928 CIPHER_ORDER *head, *tail, *curr, *curr2, *last; local
1362 CIPHER_ORDER *co_list = NULL, *head = NULL, *tail = NULL, *curr; local
    [all...]
  /external/qemu/android/
main-common.c 336 part_properties* head = NULL; local
351 head = t;
359 return head;
363 free_all_part_properties(part_properties* head)
365 part_properties* prev = head;
366 while (head) {
367 prev = head;
368 head = head->next;
    [all...]
  /external/qemu/distrib/jpeg-6b/
jdmarker.c 1252 unsigned char *head; local
    [all...]
  /external/smack/src/org/jivesoftware/smack/util/
Base64.java 900 int head = ((int)bytes[0] & 0xff) | ((bytes[1] << 8) & 0xff00); local
    [all...]
  /external/svox/pico/lib/
picospho.c 150 /* "expanded head": item head expanded by a content position and a by boundary information
153 picodata_itemhead_t head; member in struct:__anon26789
178 picospho_headx_t headx[SPHO_MAXNR_HEADX]; /* "expanded head" buffer */
533 picodata_itemhead_t * head; local
549 head = &(spho->headx[pos].head);
553 picodata_head_to_string(head,msgstr,SPHO_MSGSTR_SIZE)));
555 switch (head->type) {
558 fstSymbol = (PICODATA_ITEMINFO1_BOUND_SBEG == head->info1 || PICODATA_ITEMINFO1_BOUND_TERM == head->info1) ? PICODATA_ITEMINFO1_BOUND_SEND : head->in (…)
    [all...]
  /external/tcpdump/
isakmp.h 362 struct isakmp_ph1 *head;
368 struct isakmp_ph2 *head;
361 struct isakmp_ph1 *head; member in struct:isakmp_ph1tab
367 struct isakmp_ph2 *head; member in struct:isakmp_ph2tab
  /frameworks/av/services/audioflinger/
Tracks.cpp 1240 TimedBuffer& head = mTimedBufferQueue.editItemAt(0); local
1379 const TimedBuffer& head = mTimedBufferQueue[0]; local
1437 TimedBuffer& head = mTimedBufferQueue.editItemAt(0); local
    [all...]
  /libcore/luni/src/main/java/java/util/concurrent/
ArrayBlockingQueue.java 23 * <em>head</em> of the queue is that element that has been on the
27 * operations obtain elements at the head of the queue.
718 * The elements will be returned in order from first (head) to last (tail).
740 * not at head) would cause iterators to sometimes lose their
802 private Node head; field in class:ArrayBlockingQueue.Itrs
824 // assert head != null;
832 p = head;
845 p = head;
857 head = next;
880 head = new Node(itr, head)
    [all...]
ConcurrentLinkedDeque.java 121 * The deque object has two node references, "head" and "tail".
122 * The head and tail are only approximations to the first and last
124 * following prev pointers from head; likewise for tail. However,
125 * it is permissible for head and tail to be referring to deleted
157 * head or tail.
176 * the nodes pointed at by head/tail never get gc-unlinked, since
177 * head/tail are needed to get "back on track" by other nodes that
192 * pointers from head), and p.next == null && p.prev == p means
227 * - the first node is always O(1) reachable from head via prev links
229 * - head != nul
236 private transient volatile Node<E> head; field in class:ConcurrentLinkedDeque
    [all...]
LinkedTransferQueue.java 24 * to any given producer. The <em>head</em> of the queue is that
81 * It maintains two pointer fields, "head", pointing to a
88 * head tail
94 * overhead limitations when maintaining (via CAS) these head and
131 * updates on head/tail fields.
134 * never versus always updating queue (head and tail) pointers.
141 * head tail
147 * between the value of "head" and the first unmatched node, and
155 * virtue of only sometimes updating head or tail pointers when
177 * be further reduced without increasing contention of head
531 transient volatile Node head; field in class:LinkedTransferQueue
    [all...]
ScheduledThreadPoolExecutor.java 482 Delayed head = (Delayed) super.getQueue().peek(); local
483 if (head != null) {
484 long headDelay = head.getDelay(NANOSECONDS);
811 * Thread designated to wait for the task at the head of the
819 * interim. Whenever the head of the queue is replaced with a
    [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
271 /** The head (top) of the stack */
272 volatile SNode head; field in class:SynchronousQueue.TransferStack
275 return h == head &&
283 * and CASes of head and to avoid surges of garbage when CASes
323 SNode h = head;
336 if ((h = head) != null && h.next == s)
391 * to be at the head of the stack, calls to park are
434 * Returns true if node s is at head or there is an activ
567 transient volatile QNode head; field in class:SynchronousQueue.TransferQueue
    [all...]
  /libcore/luni/src/main/java/java/util/concurrent/locks/
AbstractQueuedLongSynchronizer.java 69 * tail. To dequeue, you just set the head field.
72 * head | | <---- | | <---- | | tail
79 * involves only updating the "head". However, it takes a bit
113 * is constructed and head and tail pointers are set upon first
166 * nodes. This is set (for head node only) in
189 * because the head node is never cancelled: A node becomes
190 * head only as a result of successful acquire. A
251 Node() { // Used to establish initial head or SHARED marker
266 * Head of the wait queue, lazily initialized. Except for
268 * If head exists, its waitStatus is guaranteed not to b
271 private transient volatile Node head; field in class:AbstractQueuedLongSynchronizer
    [all...]
AbstractQueuedSynchronizer.java 299 * tail. To dequeue, you just set the head field.
302 * head | | <---- | | <---- | | tail
309 * involves only updating the "head". However, it takes a bit
343 * is constructed and head and tail pointers are set upon first
396 * nodes. This is set (for head node only) in
419 * because the head node is never cancelled: A node becomes
420 * head only as a result of successful acquire. A
481 Node() { // Used to establish initial head or SHARED marker
496 * Head of the wait queue, lazily initialized. Except for
498 * If head exists, its waitStatus is guaranteed not to b
501 private transient volatile Node head; field in class:AbstractQueuedSynchronizer
    [all...]
  /packages/inputmethods/OpenWnn/src/jp/co/omronsoft/openwnn/JAJP/
OpenWnnEngineJAJP.java 421 WnnClause head = null; local
429 head = new WnnClause(input, (WnnWord)headCandidates.next());
442 if (head != null) {
443 sentence = new WnnSentence(head, sentence);
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/linux/
fd.h 15 head, /* nr of heads */ member in struct:floppy_struct
32 spec1, /* stepping rate, head unload time */
66 unsigned int device,head,track; member in struct:format_descr
122 /* Spec2 is (HLD<<1 | ND), where HLD is head load time (1=2ms, 2=4 ms
126 unsigned long hlt; /* Head load/settle time, msec */
127 unsigned long hut; /* Head unload time (remnant of
genhd.h 49 unsigned char head; /* starting head */ member in struct:partition
53 unsigned char end_head; /* end head */
121 __u32 d_headswitch; /* head switch time, usec */
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/linux/
fd.h 15 head, /* nr of heads */ member in struct:floppy_struct
32 spec1, /* stepping rate, head unload time */
66 unsigned int device,head,track; member in struct:format_descr
122 /* Spec2 is (HLD<<1 | ND), where HLD is head load time (1=2ms, 2=4 ms
126 unsigned long hlt; /* Head load/settle time, msec */
127 unsigned long hut; /* Head unload time (remnant of
genhd.h 49 unsigned char head; /* starting head */ member in struct:partition
53 unsigned char end_head; /* end head */
121 __u32 d_headswitch; /* head switch time, usec */
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/linux/
fd.h 15 head, /* nr of heads */ member in struct:floppy_struct
32 spec1, /* stepping rate, head unload time */
66 unsigned int device,head,track; member in struct:format_descr
122 /* Spec2 is (HLD<<1 | ND), where HLD is head load time (1=2ms, 2=4 ms
126 unsigned long hlt; /* Head load/settle time, msec */
127 unsigned long hut; /* Head unload time (remnant of
genhd.h 49 unsigned char head; /* starting head */ member in struct:partition
53 unsigned char end_head; /* end head */
121 __u32 d_headswitch; /* head switch time, usec */
  /prebuilts/ndk/4/platforms/android-3/arch-arm/usr/include/linux/
fd.h 21 head, member in struct:floppy_struct
58 unsigned int device,head,track; member in struct:format_descr
  /prebuilts/ndk/4/platforms/android-4/arch-arm/usr/include/linux/
fd.h 21 head, member in struct:floppy_struct
58 unsigned int device,head,track; member in struct:format_descr

Completed in 879 milliseconds

<<21222324252627282930>>