Searched refs:tail (Results 1 - 25 of 492) sorted by relevance

1234567891011>>

/external/chromium_org/v8/test/mjsunit/regress/
H A Dregress-1708.js39 var tail = head; variable
44 tail[1] = new Array(1000);
45 tail = tail[1];
64 tail[1] = new Array(1000);
65 tail = tail[1];
H A Dregress-2073.js44 this.tail = null;
60 child.tail = null;
63 this.tail.right = child;
64 this.tail = child;
66 this.head = this.tail = child;
75 if (parent.tail == this) parent.tail = this.left;
/external/chromium_org/third_party/mesa/src/src/mesa/drivers/dri/i915/
H A Dintel_resolve_map.c41 struct intel_resolve_map **tail = &head->next; local
44 while (*tail) {
45 if ((*tail)->level == level && (*tail)->layer == layer) {
46 (*tail)->need = need;
49 prev = *tail;
50 tail = &(*tail)->next;
53 *tail = malloc(sizeof(**tail));
[all...]
/external/chromium_org/third_party/mesa/src/src/mesa/drivers/dri/i965/
H A Dintel_resolve_map.c41 struct intel_resolve_map **tail = &head->next; local
44 while (*tail) {
45 if ((*tail)->level == level && (*tail)->layer == layer) {
46 (*tail)->need = need;
49 prev = *tail;
50 tail = &(*tail)->next;
53 *tail = malloc(sizeof(**tail));
[all...]
/external/chromium_org/third_party/mesa/src/src/mesa/drivers/dri/intel/
H A Dintel_resolve_map.c41 struct intel_resolve_map **tail = &head->next; local
44 while (*tail) {
45 if ((*tail)->level == level && (*tail)->layer == layer) {
46 (*tail)->need = need;
49 prev = *tail;
50 tail = &(*tail)->next;
53 *tail = malloc(sizeof(**tail));
[all...]
/external/mesa3d/src/mesa/drivers/dri/i915/
H A Dintel_resolve_map.c41 struct intel_resolve_map **tail = &head->next; local
44 while (*tail) {
45 if ((*tail)->level == level && (*tail)->layer == layer) {
46 (*tail)->need = need;
49 prev = *tail;
50 tail = &(*tail)->next;
53 *tail = malloc(sizeof(**tail));
[all...]
/external/mesa3d/src/mesa/drivers/dri/i965/
H A Dintel_resolve_map.c41 struct intel_resolve_map **tail = &head->next; local
44 while (*tail) {
45 if ((*tail)->level == level && (*tail)->layer == layer) {
46 (*tail)->need = need;
49 prev = *tail;
50 tail = &(*tail)->next;
53 *tail = malloc(sizeof(**tail));
[all...]
/external/mesa3d/src/mesa/drivers/dri/intel/
H A Dintel_resolve_map.c41 struct intel_resolve_map **tail = &head->next; local
44 while (*tail) {
45 if ((*tail)->level == level && (*tail)->layer == layer) {
46 (*tail)->need = need;
49 prev = *tail;
50 tail = &(*tail)->next;
53 *tail = malloc(sizeof(**tail));
[all...]
/external/fio/lib/
H A Dflist_sort.c18 struct flist_head head, *tail = &head; local
23 tail->next = a;
26 tail->next = b;
29 tail = tail->next;
31 tail->next = a?:b;
48 struct flist_head *tail = head; local
53 tail->next = a;
54 a->prev = tail;
57 tail
[all...]
/external/clang/test/CXX/temp/temp.decls/temp.variadic/
H A Dp2.cpp13 void recurse_until_fail(const Head &, const Tail &...tail) { // expected-note{{candidate function template not viable: requires at least 1 argument, but 0 were provided}} argument
14 recurse_until_fail(tail...); // expected-error{{no matching function for call to 'recurse_until_fail'}} \
/external/eigen/doc/snippets/
H A DMatrixBase_end_int.cpp3 cout << "Here is v.tail(2):" << endl << v.tail(2) << endl;
4 v.tail(2).setZero();
H A DMatrixBase_template_int_end.cpp3 cout << "Here is v.tail(2):" << endl << v.tail<2>() << endl;
4 v.tail<2>().setZero();
H A DTutorial_commainit_01b.cpp4 m.col(2).tail(2) << 6, 9;
/external/valgrind/main/auxprogs/
H A Ddump_insn_ppc.sh4 =(perl -e 'print pack "N", hex $ARGV[0]' $1) | tail +7
/external/javassist/src/main/javassist/compiler/ast/
H A DCondExpr.java32 public ASTree thenExpr() { return tail().head(); }
34 public void setThen(ASTree t) { tail().setHead(t); }
36 public ASTree elseExpr() { return tail().tail().head(); }
38 public void setElse(ASTree t) { tail().tail().setHead(t); }
/external/chromium_org/third_party/sqlite/src/test/
H A DmallocAll.test52 set tail [file tail $testfile]
53 if {[lsearch -exact $EXCLUDE $tail]>=0} continue
54 if {[llength $INCLUDE]>0 && [lsearch -exact $INCLUDE $tail]<0} continue
58 puts "$tail did not close all files: $sqlite_open_file_count"
59 fail_test $tail
/external/chromium_org/tools/traceline/traceline/scripts/
H A Dfilter_split.sh12 ./scripts/filter_short.py "$f" | tail -n +2 | head -n -1 >> totalsplit
/external/apache-harmony/security/src/test/support/common/java/org/apache/harmony/security/tests/support/
H A DTestUtils.java51 String tail = Integer.toHexString(0x000000ff & data[i]);
52 if (tail.length() == 1) {
53 tail = "0" + tail;
55 System.out.print(prefix + "0x" + tail + delimiter);
/external/chromium_org/sandbox/linux/bpf_dsl/
H A Dcons.h25 // Return this node's tail element.
26 List tail() const { return tail_; } function in class:sandbox::Cons
28 // Construct a new List using |head| and |tail|.
29 static List Make(const T& head, List tail) { argument
30 return make_scoped_refptr(new const Cons<T>(head, tail));
34 Cons(const T& head, List tail) : head_(head), tail_(tail) {} argument
/external/javassist/src/main/javassist/bytecode/analysis/
H A DIntQueue.java29 private IntQueue.Entry tail; field in class:IntQueue
33 if (tail != null)
34 tail.next = entry;
35 tail = entry;
52 tail = null;
/external/fio/
H A Dio_u_queue.h39 unsigned int tail; member in struct:io_u_ring
49 if (r->head + 1 != r->tail) {
60 if (r->head != r->tail) {
61 struct io_u *io_u = r->ring[r->tail];
63 r->tail = (r->tail + 1) & (r->max - 1);
72 return ring->head == ring->tail;
/external/chromium_org/third_party/angle/src/third_party/murmurhash/
H A DMurmurHash3.cpp124 // tail
126 const uint8_t * tail = (const uint8_t*)(data + nblocks*4); local
132 case 3: k1 ^= tail[2] << 16;
133 case 2: k1 ^= tail[1] << 8;
134 case 1: k1 ^= tail[0];
196 // tail
198 const uint8_t * tail = (const uint8_t*)(data + nblocks*16); local
207 case 15: k4 ^= tail[14] << 16;
208 case 14: k4 ^= tail[13] << 8;
209 case 13: k4 ^= tail[1
289 const uint8_t * tail = (const uint8_t*)(data + nblocks*16); local
[all...]
/external/chromium_org/third_party/smhasher/src/
H A DMurmurHash3.cpp124 // tail
126 const uint8_t * tail = (const uint8_t*)(data + nblocks*4); local
132 case 3: k1 ^= tail[2] << 16;
133 case 2: k1 ^= tail[1] << 8;
134 case 1: k1 ^= tail[0];
196 // tail
198 const uint8_t * tail = (const uint8_t*)(data + nblocks*16); local
207 case 15: k4 ^= tail[14] << 16;
208 case 14: k4 ^= tail[13] << 8;
209 case 13: k4 ^= tail[1
289 const uint8_t * tail = (const uint8_t*)(data + nblocks*16); local
[all...]
/external/jemalloc/include/jemalloc/internal/
H A Dhash.h116 /* tail */
118 const uint8_t *tail = (const uint8_t *) (data + nblocks*4); local
123 case 3: k1 ^= tail[2] << 16;
124 case 2: k1 ^= tail[1] << 8;
125 case 1: k1 ^= tail[0]; k1 *= c1; k1 = hash_rotl_32(k1, 15);
188 /* tail */
190 const uint8_t *tail = (const uint8_t *) (data + nblocks*16); local
197 case 15: k4 ^= tail[14] << 16;
198 case 14: k4 ^= tail[13] << 8;
199 case 13: k4 ^= tail[1
276 const uint8_t *tail = (const uint8_t*)(data + nblocks*16); local
[all...]
/external/opencv/cvaux/src/
H A Dextendededges.cpp137 CvSeq* tail = 0; local
184 if( tail )
186 tail->v_next = newseq;
187 newseq->v_prev = tail;
188 tail = newseq;
192 output = tail = newseq;
204 if( tail )
206 tail->v_next = newseq;
207 newseq->v_prev = tail;
208 tail
[all...]

Completed in 732 milliseconds

1234567891011>>