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

1234567891011>>

/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/e2fsprogs/contrib/android/
H A Dbase_fs.h11 struct block_range *tail; member in struct:basefs_entry
H A Dblock_range.c15 void add_blocks_to_range(struct block_range **head, struct block_range **tail, argument
19 *head = *tail = new_block_range(blk_start, blk_end);
20 else if ((*tail)->end + 1 == blk_start)
21 (*tail)->end += (blk_end - blk_start + 1);
24 (*tail)->next = range;
25 *tail = range;
/external/syslinux/gpxe/src/include/gpxe/
H A Diobuf.h57 void *tail; member in struct:io_buffer
71 iobuf->tail += len;
77 assert ( (iobuf)->tail <= (iobuf)->end ); \
106 assert ( iobuf->data <= iobuf->tail );
112 assert ( (iobuf)->data <= (iobuf)->tail ); \
123 void *old_tail = iobuf->tail;
124 iobuf->tail += len;
130 assert ( (iobuf)->tail <= (iobuf)->end ); \
140 iobuf->tail -= len;
144 assert ( (iobuf)->tail >
[all...]
/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/chromium-trace/catapult/telemetry/third_party/altgraph/altgraph/
H A DGraphUtil.py34 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/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/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/libmojo/mojo/public/tools/bindings/pylib/mojom_tests/generate/
H A Dgenerator_unittest.py15 path, tail = os.path.split(path)
16 assert tail
17 if tail == dirname:
/external/syslinux/core/fs/ntfs/
H A Drunlist.h34 static struct runlist *tail; variable in typeref:struct:runlist
63 tail = n;
65 tail->next = n;
66 tail = n;
/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/jemalloc/include/jemalloc/internal/
H A Dhash.h133 /* tail */
135 const uint8_t *tail = (const uint8_t *) (data + nblocks*4); local
140 case 3: k1 ^= tail[2] << 16;
141 case 2: k1 ^= tail[1] << 8;
142 case 1: k1 ^= tail[0]; k1 *= c1; k1 = hash_rotl_32(k1, 15);
205 /* tail */
207 const uint8_t *tail = (const uint8_t *) (data + nblocks*16); local
214 case 15: k4 ^= tail[14] << 16;
215 case 14: k4 ^= tail[13] << 8;
216 case 13: k4 ^= tail[1
293 const uint8_t *tail = (const uint8_t*)(data + nblocks*16); local
[all...]
/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/syslinux/core/thread/
H A Dmbox.c21 mbox->tail = &mbox->data[0];
55 *msg = *mbox->tail;
56 mbox->tail++;
57 if (mbox->tail == mbox->wrap)
58 mbox->tail = &mbox->data[0];
/external/vulkan-validation-layers/loader/
H A Dmurmurhash.c46 const uint8_t *tail = NULL; // tail - last 8 bytes local
53 tail = (const uint8_t *)(d + l * 4); // last 8 byte chunk of `key'
76 k ^= (tail[2] << 16);
78 k ^= (tail[1] << 8);
81 k ^= tail[0];

Completed in 2418 milliseconds

1234567891011>>