Searched defs:tail (Results 1 - 25 of 240) sorted by relevance

12345678910

/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];
/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/icu/icu4c/source/layout/
H A DLEInsertionList.h150 * The tail of the insertion list.
154 InsertionRecord *tail; member in class:LEInsertionList
/external/chromium_org/media/formats/common/
H A Doffset_byte_queue.h33 // if the current offset is beyond tail(), but you will of course get back
43 // Returns false if |max_offset| > tail() (although all bytes currently
47 // The head and tail positions, in terms of the file's absolute offsets.
48 // tail() is an exclusive bound.
50 int64 tail() { return head_ + size_; } function in class:media::OffsetByteQueue
/external/guava/guava-tests/test/com/google/common/collect/
H A DBstPathTest.java30 private SimplePath(SimpleNode tip, SimplePath tail) { argument
31 super(tip, tail);
/external/antlr/antlr-3.4/runtime/ObjC/Framework/
H A DANTLRUnbufferedCommonTreeNodeStream.h56 NSUInteger tail; variable
72 @property (assign, getter=getTail, setter=setTail:) NSUInteger tail; variable
/external/checkpolicy/
H A Dqueue.h26 queue_node_ptr_t tail; member in struct:queue_info
/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/chromium_org/third_party/mesa/src/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/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/chromium_org/third_party/smhasher/src/
H A DRandom.h83 uint8_t * tail = reinterpret_cast<uint8_t*>(blocks); local
87 tail[i] = (uint8_t)rand_u32();
109 uint8_t * tail = (uint8_t*)blocks; local
113 tail[i] = (uint8_t)rand_u32();
/external/chromium_org/third_party/yasm/source/patched-yasm/libyasm/tests/
H A Dsplitpath_test.c34 size_t (*splitpath) (const char *path, const char **tail);
42 /* correct tail returned */
43 const char *tail; member in struct:Test_Entry
106 const char *tail; local
114 headlen = test->splitpath(test->input, &tail);
123 if (strcmp(tail, test->tail) != 0) {
125 "splitpath_%s(\"%s\") bad tail: expected \"%s\", got \"%s\"!",
126 funcname, test->input, test->tail, 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/iproute2/tc/
H A Df_basic.c42 struct rtattr *tail; local
59 tail = (struct rtattr*)(((void*)n)+NLMSG_ALIGN(n->nlmsg_len));
105 tail->rta_len = (((void*)n)+n->nlmsg_len) - (void*)tail;
H A Df_cgroup.c29 struct rtattr *tail; local
43 tail = (struct rtattr*)(((void*)n)+NLMSG_ALIGN(n->nlmsg_len));
79 tail->rta_len = (((void*)n)+n->nlmsg_len) - (void*)tail;
/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/llvm/unittests/IR/
H A DWaymarkTest.cpp28 static uint8_t tail[22] = "s02s33s30y2y0s1x0syxS"; local
30 std::transform(tail, tail + 22, values, char2constant);
/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/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/srec/seti/sltsEngine/include/
H A Dlinklist.h32 struct LNode *tail; member in struct:LList
/external/chromium_org/base/containers/
H A Dlinked_list.h20 // Next, to keep track of the list's head/tail, use a LinkedList instance:
46 // for (LinkNode<MyNodeType>* node = list.tail();
158 LinkNode<T>* tail() const { function in class:base::LinkedList

Completed in 766 milliseconds

12345678910