HomeSort by relevance Sort by last modified time
    Searched defs:tail (Results 351 - 375 of 486) sorted by null

<<11121314151617181920

  /external/linux-tools-perf/perf-3.12.0/tools/perf/util/
symbol.c 75 const char *tail = str; local
77 while (*tail == '_')
78 tail++;
80 return tail - str;
    [all...]
  /external/mesa3d/src/mesa/drivers/dri/common/
xmlconfig.c 175 * returning tail points to the first character that is not part of
176 * the integer number. If no number was found then tail points to the
178 static GLint strToI (const XML_Char *string, const XML_Char **tail, int base) {
222 *tail = numberFound ? string : start;
233 * returning tail points to the first character that is not part of
234 * the floating point number. If no number was found then tail points
238 static GLfloat strToF (const XML_Char *string, const XML_Char **tail) {
267 *tail = start;
270 *tail = string;
277 *tail = expTail
302 const XML_Char *tail = NULL; local
    [all...]
  /external/openssl/ssl/
ssl_ciph.c 665 CIPHER_ORDER **tail)
667 if (curr == *tail) return;
674 (*tail)->next=curr;
675 curr->prev= *tail;
677 *tail=curr;
681 CIPHER_ORDER **tail)
684 if (curr == *tail)
685 *tail=curr->prev;
928 CIPHER_ORDER *head, *tail, *curr, *curr2, *last; local
941 tail = *tail_p
1362 CIPHER_ORDER *co_list = NULL, *head = NULL, *tail = NULL, *curr; local
    [all...]
  /external/qemu/distrib/mini-glib/src/
glib-mini.c 311 GSList** tail = &list; local
316 *tail = l1;
317 tail = &l1->next;
320 *tail = l2;
321 tail = &l2->next;
325 *tail = l1 ? l1 : l2;
716 queue->head = queue->tail = NULL;
729 node->prev = queue->tail;
730 queue->tail = node;
739 return (queue->tail) ? queue->tail->data : NULL
    [all...]
  /external/wpa_supplicant_8/hostapd/
config_file.c 219 struct hostapd_eap_user *user = NULL, *tail = NULL; local
496 if (tail == NULL) {
497 tail = conf->eap_user = user;
499 tail->next = user;
500 tail = user;
    [all...]
  /frameworks/opt/net/voip/src/jni/rtp/
AudioGroup.cpp 104 bool mix(int32_t *output, int head, int tail, int sampleRate);
234 bool AudioStream::mix(int32_t *output, int head, int tail, int sampleRate)
243 if (tail - mBufferTail > 0) {
244 tail = mBufferTail;
246 if (tail - head <= 0) {
251 tail *= mSampleRate;
254 for (int i = head; i - tail < 0; ++i) {
452 int tail = (tick + mInterval) * mSampleRate; local
453 for (int i = mBufferTail * mSampleRate; i - tail < 0; ++i) {
461 int tail = mBufferTail * mSampleRate local
    [all...]
  /libcore/luni/src/main/java/java/util/concurrent/
ConcurrentLinkedDeque.java 119 * The deque object has two node references, "head" and "tail".
120 * The head and tail are only approximations to the first and last
122 * following prev pointers from head; likewise for tail. However,
123 * it is permissible for head and tail to be referring to deleted
155 * head or tail.
174 * the nodes pointed at by head/tail never get gc-unlinked, since
175 * head/tail are needed to get "back on track" by other nodes that
198 * restart traversal from tail.
232 * - head may not be reachable from the first or last node, or from tail
240 * - the last node is always O(1) reachable from tail via next link
248 private transient volatile Node<E> tail; field in class:ConcurrentLinkedDeque
    [all...]
LinkedTransferQueue.java 26 * producer. The <em>tail</em> of the queue is that element that has
82 * (unmatched) queue node (or null if empty); and "tail" that
87 * head tail
94 * tail pointers. This has led to the development of
130 * updates on head/tail fields.
133 * never versus always updating queue (head and tail) pointers.
140 * head tail
147 * similarly for "tail") is an empirical matter. We have found
154 * virtue of only sometimes updating head or tail pointers when
179 * known first unmatched node, and similarly for tail. Again, thi
533 private transient volatile Node tail; field in class:LinkedTransferQueue
    [all...]
SynchronousQueue.java 115 * cancelled. But if it may be pinned as the current tail, it must
568 /** Tail of queue */
569 transient volatile QNode tail; field in class:SynchronousQueue.TransferQueue
580 tail = h;
594 * Tries to cas nt as new tail.
597 if (tail == t)
627 * advance head and tail on behalf of other stalled/slow
631 * seeing uninitialized head or tail values. This never
643 QNode t = tail;
650 if (t != tail) // inconsistent rea
    [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
77 * operation on "tail", so there is a simple atomic point of
98 * updated "tail" when a node's successor appears to be null.
113 * is constructed and head and tail pointers are set upon first
204 * to be null, we can scan prev's from the tail to
274 * Tail of the wait queue, lazily initialized. Modified only via
277 private transient volatile Node tail; field in class:AbstractQueuedLongSynchronizer
334 Node t = tail;
337 tail = head
    [all...]
AbstractQueuedSynchronizer.java 299 * tail. To dequeue, you just set the head field.
302 * head | | <---- | | <---- | | tail
307 * operation on "tail", so there is a simple atomic point of
328 * updated "tail" when a node's successor appears to be null.
343 * is constructed and head and tail pointers are set upon first
434 * to be null, we can scan prev's from the tail to
504 * Tail of the wait queue, lazily initialized. Modified only via
507 private transient volatile Node tail; field in class:AbstractQueuedSynchronizer
564 Node t = tail;
567 tail = head
    [all...]
  /ndk/sources/host-tools/sed-4.2.1/sed/
compile.c 789 struct replacement *tail;
796 tail = &root;
803 tail = tail->next =
812 ++tail->prefix_length;
817 ++tail->prefix_length;
825 tail->subst_id = *p - '0';
826 if (sub->max_id < tail->subst_id)
827 sub->max_id = tail->subst_id;
857 ++tail->prefix_length
782 struct replacement *tail; local
    [all...]
  /device/lge/mako/camera/mm-camera-interface/
mm_camera.h 110 mm_camera_frame_t *tail; member in struct:__anon3777
  /external/bison/lib/
vasnprintf.c 3118 long double tail = mantissa; local
3269 double tail = mantissa; local
    [all...]
  /external/checkpolicy/
policy_define.c 1733 class_perm_node_t *perms, *tail = NULL, *cur_perms = NULL; local
    [all...]
  /external/chromium_org/third_party/icu/source/tools/pkgdata/
pkgdata.cpp 258 CharList *tail; local
437 tail = NULL;
439 o.fileListFiles = pkg_appendToList(o.fileListFiles, &tail, uprv_strdup(argv[n]));
1630 CharList *l, *tail = NULL, *tail2 = NULL; local
    [all...]
  /external/chromium_org/third_party/usrsctp/usrsctplib/netinet/
sctputil.c 4858 struct mbuf *mm, *tail = NULL, *prev = NULL; local
    [all...]
  /external/chromium_org/v8/src/
lithium-allocator.cc 1841 LiveRange* tail = SplitRangeAt(current, pos); local
1926 LiveRange* tail = SplitBetween(current, local
    [all...]
  /external/dnsmasq/src/
option.c 878 unsigned char *q, *r, *tail; local
916 /* Now tail-compress using earlier names. */
918 for (tail = p + len; *tail; tail += (*tail) + 1)
920 if (strcmp((char *)r, (char *)tail) == 0)
922 PUTSHORT((r - p) | 0xc000, tail);
923 newlen = tail - p;
    [all...]
  /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.apache.ant_1.7.1.v20090120-1145/lib/
ant-launcher.jar 
  /external/flac/libFLAC/
metadata_iterators.c 904 FLAC__Metadata_Node *tail; member in struct:FLAC__Metadata_Chain
    [all...]
  /external/icu/icu4c/source/tools/pkgdata/
pkgdata.cpp 250 CharList *tail; local
451 tail = NULL;
453 o.fileListFiles = pkg_appendToList(o.fileListFiles, &tail, uprv_strdup(argv[n]));
1951 CharList *l, *tail = NULL, *tail2 = NULL; local
    [all...]
  /external/iptables/libiptc/
libiptc.c 881 debug("Insert, list head reached add to tail\n");
887 /* survived till end of list: add at tail */
896 struct list_head *tail = h->chains.prev; local
912 ctail = list_entry(tail, struct chain_head, list);
    [all...]
  /external/libsepol/src/
expand.c 2846 avrule_t *tail, *to_be_appended; local
    [all...]
link.c 1263 avrule_t *cur, *new_rule = NULL, *tail; local
1357 role_trans_rule_t *cur, *new_rule = NULL, *tail; local
1414 role_allow_rule_t *cur, *new_rule = NULL, *tail; local
1457 filename_trans_rule_t *cur, *new_rule, *tail; local
1549 cond_node_t *cur, *new_node = NULL, *tail; local
    [all...]

Completed in 1795 milliseconds

<<11121314151617181920