/external/v8/test/mjsunit/regress/ |
H A D | regress-1708.js | 39 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 D | regress-2073.js | 44 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/mesa3d/src/mesa/drivers/dri/i915/ |
H A D | intel_resolve_map.c | 41 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 D | intel_resolve_map.c | 41 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 D | intel_resolve_map.c | 41 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 D | flist_sort.c | 18 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 D | p2.cpp | 13 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 D | MatrixBase_end_int.cpp | 3 cout << "Here is v.tail(2):" << endl << v.tail(2) << endl; 4 v.tail(2).setZero();
|
H A D | MatrixBase_template_int_end.cpp | 3 cout << "Here is v.tail(2):" << endl << v.tail<2>() << endl; 4 v.tail<2>().setZero();
|
H A D | Tutorial_commainit_01b.cpp | 4 m.col(2).tail(2) << 6, 9;
|
/external/valgrind/auxprogs/ |
H A D | dump_insn_ppc.sh | 4 =(perl -e 'print pack "N", hex $ARGV[0]' $1) | tail +7
|
/external/javassist/src/main/javassist/compiler/ast/ |
H A D | CondExpr.java | 32 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 D | TestUtils.java | 51 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 D | IntQueue.java | 29 private IntQueue.Entry tail; field in class:IntQueue 33 if (tail != null) 34 tail.next = entry; 35 tail = entry; 52 tail = null;
|
/external/chromium-trace/catapult/telemetry/third_party/altgraph/altgraph/ |
H A D | GraphUtil.py | 34 tail = random.choice(nodes) 37 if head == tail and not self_loops: 41 if g.edge_by_node(head,tail) is not None and not multi_edges: 45 g.add_edge(head, tail) 114 get_tail = graph.tail 127 tail = get_tail(edge) 129 orphans.add((last_good, tail)) 130 if tail not in visited: 131 visited.add(tail) 132 stack.append((last_good, tail)) [all...] |
/external/libgdx/gdx/src/com/badlogic/gdx/utils/ |
H A D | Queue.java | 29 /** Contains the values in the queue. Head and tail indices go in a circle around this array, wrapping at the end. */ 32 /** Index of first element. Logically smaller than tail. Unless empty, it points to a valid element inside queue. */ 37 protected int tail = 0; field in class:Queue 62 /** Append given object to the tail. (enqueue to tail) Unless backing array needs resizing, operates in O(1) time. 72 values[tail++] = object; 73 if (tail == values.length) { 74 tail = 0; 114 final int tail = this.tail; [all...] |
H A D | PooledLinkedList.java | 29 private Item<T> tail;
field in class:PooledLinkedList 54 tail = item;
59 item.prev = tail;
60 tail.next = item;
61 tail = item;
75 /** Starts iterating over the list's items from the tail of the list */
77 iter = tail;
118 tail = null;
128 if (c == tail) {
130 tail [all...] |
/external/fio/ |
H A D | io_u_queue.h | 44 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/okhttp/okio/okio/src/main/java/okio/ |
H A D | InflaterSource.java | 66 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 D | extendededges.cpp | 137 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 D | treeprocessors.py | 102 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/jemalloc/include/jemalloc/internal/ |
H A D | hash.h | 137 /* tail */ 139 const uint8_t *tail = (const uint8_t *) (data + nblocks*4); local 144 case 3: k1 ^= tail[2] << 16; 145 case 2: k1 ^= tail[1] << 8; 146 case 1: k1 ^= tail[0]; k1 *= c1; k1 = hash_rotl_32(k1, 15); 209 /* tail */ 211 const uint8_t *tail = (const uint8_t *) (data + nblocks*16); local 218 case 15: k4 ^= tail[14] << 16; 219 case 14: k4 ^= tail[13] << 8; 220 case 13: k4 ^= tail[1 297 const uint8_t *tail = (const uint8_t*)(data + nblocks*16); local [all...] |
/external/apache-harmony/security/src/test/impl/java/org/apache/harmony/security/tests/x509/ |
H A D | ORAddressTest.java | 40 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 D | LEInsertionList.cpp | 26 : 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 D | u_fifo.h | 34 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];
|