| /external/apache-harmony/security/src/test/support/common/java/org/apache/harmony/security/tests/support/ |
| TestUtils.java | 51 String tail = Integer.toHexString(0x000000ff & data[i]); local
52 if (tail.length() == 1) {
53 tail = "0" + tail;
55 System.out.print(prefix + "0x" + tail + delimiter);
|
| /external/checkpolicy/ |
| queue.h | 26 queue_node_ptr_t tail; member in struct:queue_info
|
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/ |
| 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];
|
| u_ringbuffer.c | 18 unsigned tail; member in struct:util_ringbuffer
61 return (ring->tail - (ring->head + 1)) & ring->mask;
135 ring_packet = &ring->buf[ring->tail];
149 packet[i] = ring->buf[ring->tail];
150 ring->tail++;
151 ring->tail &= ring->mask;
|
| /external/chromium_org/third_party/smhasher/src/ |
| Random.h | 83 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/ |
| splitpath_test.c | 34 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/ |
| 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->next = b
[all...] |
| /external/iproute2/tc/ |
| f_fw.c | 38 struct rtattr *tail; local
64 tail = NLMSG_TAIL(n);
115 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
|
| f_route.c | 41 struct rtattr *tail; local
57 tail = NLMSG_TAIL(n);
124 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
|
| f_tcindex.c | 31 struct rtattr *tail; local
42 tail = NLMSG_TAIL(n);
116 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
|
| q_drr.c | 55 struct rtattr *tail; local
58 tail = NLMSG_TAIL(n);
80 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *)tail;
|
| q_dsmark.c | 32 struct rtattr *tail; local
71 tail = NLMSG_TAIL(n);
80 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
94 struct rtattr *tail; local
98 tail = NLMSG_TAIL(n);
126 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
|
| q_sfb.c | 55 struct rtattr *tail; local
137 tail = NLMSG_TAIL(n);
140 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
|
| /external/javassist/src/main/javassist/bytecode/analysis/ |
| 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/llvm/unittests/IR/ |
| WaymarkTest.cpp | 28 static uint8_t tail[22] = "s02s33s30y2y0s1x0syxS"; local
30 std::transform(tail, tail + 22, values, char2constant);
|
| /external/mesa3d/src/gallium/auxiliary/util/ |
| 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];
|
| /external/srec/seti/sltsEngine/include/ |
| linklist.h | 32 struct LNode *tail; member in struct:LList
|
| /frameworks/av/media/mtp/ |
| MtpUtils.cpp | 44 const char* tail = dateTime + 15; local
46 if (tail[0] == '.' && tail[1])
47 tail += 2;
49 bool useUTC = (tail[0] == 'Z');
|
| /hardware/qcom/media/mm-video-legacy/vidc/vdec/src/ |
| queue.c | 46 Node *tail; member in struct:Queue
55 q->head = q->tail = NULL;
95 q->tail->next = new_node;
98 q->tail = new_node;
117 q->head = q->tail = NULL;
|
| /hardware/qcom/media/mm-video-v4l2/vidc/vdec/src/ |
| queue.c | 44 Node *tail; member in struct:Queue
53 q->head = q->tail = NULL;
90 q->tail->next = new_node;
93 q->tail = new_node;
111 q->head = q->tail = NULL;
|
| /libcore/support/src/test/java/org/apache/harmony/security/tests/support/ |
| TestUtils.java | 52 String tail = Integer.toHexString(0x000000ff & data[i]); local
53 if (tail.length() == 1) {
54 tail = "0" + tail;
56 System.out.print(prefix + "0x" + tail + delimiter);
|
| /art/compiler/utils/ |
| scoped_arena_allocator.cc | 65 Arena* tail = top_arena_->next_; local
68 top_arena_->next_ = tail;
|
| /external/apache-harmony/security/src/test/impl/java/org/apache/harmony/security/tests/x509/ |
| ORAddressTest.java | 40 String tail = Integer.toHexString(0x000000ff & data[i]); local
41 if (tail.length() == 1) {
42 tail = "0" + tail;
44 System.out.print(prefix + "0x" + tail + delimiter);
|
| /external/chromium_org/base/containers/ |
| linked_list.h | 18 // Next, to keep track of the list's head/tail, use a LinkedList instance:
44 // for (LinkNode<MyNodeType>* node = list.tail();
150 LinkNode<T>* tail() const { function in class:base::LinkedList
|
| /external/chromium_org/third_party/WebKit/Source/wtf/ |
| DoublyLinkedList.h | 80 T* tail() const;
121 template<typename T> inline T* DoublyLinkedList<T>::tail() const function in class:WTF::DoublyLinkedList
|
