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

1234567891011>>

/external/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/marisa-trie/tests/
H A Dtail-test.cc4 #include <marisa/tail.h>
13 marisa::Tail tail; local
15 ASSERT(tail.size() == 0);
16 ASSERT(tail.empty());
17 ASSERT(tail.total_size() == sizeof(marisa::UInt32));
20 tail.build(keys, NULL, MARISA_BINARY_TAIL);
22 ASSERT(tail.size() == 0);
23 ASSERT(tail.empty());
24 ASSERT(tail.total_size() == sizeof(marisa::UInt32));
28 tail
139 marisa::Tail tail; local
[all...]
/external/marisa-trie/v0_1_5/tests/
H A Dtail-test.cc4 #include <marisa_alpha/tail.h>
13 marisa_alpha::Tail tail; local
15 ASSERT(tail.size() == 0);
16 ASSERT(tail.empty());
17 ASSERT(tail.total_size() == sizeof(marisa_alpha::UInt32));
20 tail.build(keys, NULL, MARISA_ALPHA_BINARY_TAIL);
22 ASSERT(tail.size() == 0);
23 ASSERT(tail.empty());
24 ASSERT(tail.total_size() == sizeof(marisa_alpha::UInt32));
28 tail
143 marisa_alpha::Tail tail; local
[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/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/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/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.h44 unsigned int tail; member in struct:io_u_ring
54 if (r->head + 1 != r->tail) {
65 if (r->head != r->tail) {
66 struct io_u *io_u = r->ring[r->tail];
68 r->tail = (r->tail + 1) & (r->max - 1);
77 return ring->head == ring->tail;
/external/jemalloc/include/jemalloc/internal/
H A Dhash.h117 /* tail */
119 const uint8_t *tail = (const uint8_t *) (data + nblocks*4); local
124 case 3: k1 ^= tail[2] << 16;
125 case 2: k1 ^= tail[1] << 8;
126 case 1: k1 ^= tail[0]; k1 *= c1; k1 = hash_rotl_32(k1, 15);
189 /* tail */
191 const uint8_t *tail = (const uint8_t *) (data + nblocks*16); local
198 case 15: k4 ^= tail[14] << 16;
199 case 14: k4 ^= tail[13] << 8;
200 case 13: k4 ^= tail[1
277 const uint8_t *tail = (const uint8_t*)(data + nblocks*16); local
[all...]
/external/okhttp/okio/okio/src/main/java/okio/
H A DInflaterSource.java66 Segment tail = sink.writableSegment(1);
67 int bytesInflated = inflater.inflate(tail.data, tail.limit, Segment.SIZE - tail.limit);
69 tail.limit += bytesInflated;
75 if (tail.pos == tail.limit) {
76 // We allocated a tail segment, but didn't end up needing it. Recycle!
77 sink.head = tail.pop();
78 SegmentPool.recycle(tail);
[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...]
/external/markdown/markdown/
H A Dtreeprocessors.py102 Process placeholders in Element.text or Element.tail
109 * isText: bool variable, True - it's text, False - it's tail
118 text = subnode.tail
119 subnode.tail = None
147 if result[-1].tail:
148 result[-1].tail += text
150 result[-1].tail = text
173 if child.tail:
174 if child.tail.strip():
232 if child.tail
[all...]
/external/apache-harmony/security/src/test/impl/java/org/apache/harmony/security/tests/x509/
H A DORAddressTest.java40 String tail = Integer.toHexString(0x000000ff & data[i]);
41 if (tail.length() == 1) {
42 tail = "0" + tail;
44 System.out.print(prefix + "0x" + tail + delimiter);
/external/icu/icu4c/source/layout/
H A DLEInsertionList.cpp26 : head(NULL), tail(NULL), growAmount(0), append(rightToLeft)
28 tail = (InsertionRecord *) &head;
45 tail = (InsertionRecord *) &head;
74 tail->next = insertion;
75 tail = insertion;
/external/mesa3d/src/gallium/auxiliary/util/
H A Du_fifo.h34 size_t tail; member in struct:util_fifo
46 fifo->tail = 0;
78 if (++fifo->tail >= fifo->size)
79 fifo->tail = 0;
81 *ptr = array[fifo->tail];
/external/clang/test/SemaTemplate/
H A Dexample-typelist.cpp10 typedef Tail tail; typedef in struct:cons
50 typedef typename reverse<typename T::tail>::type reversed_tail;
52 typedef typename reverse<typename reversed_tail::tail>::type most_of_tail;
83 struct find : find<typename List::tail, T> { };

Completed in 1010 milliseconds

1234567891011>>