| /bionic/libc/kernel/common/linux/ |
| circ_buf.h | 18 int tail; member in struct:circ_buf
21 #define CIRC_CNT(head,tail,size) (((head) - (tail)) & ((size)-1))
23 #define CIRC_SPACE(head,tail,size) CIRC_CNT((tail),((head)+1),(size))
25 #define CIRC_CNT_TO_END(head,tail,size) ({int end = (size) - (tail); int n = ((head) + end) & ((size)-1); n < end ? n : end;})
27 #define CIRC_SPACE_TO_END(head,tail,size) ({int end = (size) - 1 - (head); int n = (end + (tail)) & ((size)-1); n <= end ? n : end+1;})
|
| /development/ndk/platforms/android-3/include/linux/ |
| circ_buf.h | 18 int tail; member in struct:circ_buf
21 #define CIRC_CNT(head,tail,size) (((head) - (tail)) & ((size)-1))
23 #define CIRC_SPACE(head,tail,size) CIRC_CNT((tail),((head)+1),(size))
25 #define CIRC_CNT_TO_END(head,tail,size) ({int end = (size) - (tail); int n = ((head) + end) & ((size)-1); n < end ? n : end;})
27 #define CIRC_SPACE_TO_END(head,tail,size) ({int end = (size) - 1 - (head); int n = (end + (tail)) & ((size)-1); n <= end ? n : end+1;})
|
| /external/kernel-headers/original/linux/ |
| circ_buf.h | 7 int tail; member in struct:circ_buf
11 #define CIRC_CNT(head,tail,size) (((head) - (tail)) & ((size)-1))
14 as a completely full buffer has head == tail, which is the same as
16 #define CIRC_SPACE(head,tail,size) CIRC_CNT((tail),((head)+1),(size))
19 accessing head and tail more than once, so they can change
21 #define CIRC_CNT_TO_END(head,tail,size) \
22 ({int end = (size) - (tail); \
27 #define CIRC_SPACE_TO_END(head,tail,size)
[all...] |
| /prebuilt/ndk/android-ndk-r4/platforms/android-3/arch-arm/usr/include/linux/ |
| circ_buf.h | 18 int tail; member in struct:circ_buf
21 #define CIRC_CNT(head,tail,size) (((head) - (tail)) & ((size)-1))
23 #define CIRC_SPACE(head,tail,size) CIRC_CNT((tail),((head)+1),(size))
25 #define CIRC_CNT_TO_END(head,tail,size) ({int end = (size) - (tail); int n = ((head) + end) & ((size)-1); n < end ? n : end;})
27 #define CIRC_SPACE_TO_END(head,tail,size) ({int end = (size) - 1 - (head); int n = (end + (tail)) & ((size)-1); n <= end ? n : end+1;})
|
| /prebuilt/ndk/android-ndk-r4/platforms/android-4/arch-arm/usr/include/linux/ |
| circ_buf.h | 18 int tail; member in struct:circ_buf
21 #define CIRC_CNT(head,tail,size) (((head) - (tail)) & ((size)-1))
23 #define CIRC_SPACE(head,tail,size) CIRC_CNT((tail),((head)+1),(size))
25 #define CIRC_CNT_TO_END(head,tail,size) ({int end = (size) - (tail); int n = ((head) + end) & ((size)-1); n < end ? n : end;})
27 #define CIRC_SPACE_TO_END(head,tail,size) ({int end = (size) - 1 - (head); int n = (end + (tail)) & ((size)-1); n <= end ? n : end+1;})
|
| /prebuilt/ndk/android-ndk-r4/platforms/android-5/arch-arm/usr/include/linux/ |
| circ_buf.h | 18 int tail; member in struct:circ_buf
21 #define CIRC_CNT(head,tail,size) (((head) - (tail)) & ((size)-1))
23 #define CIRC_SPACE(head,tail,size) CIRC_CNT((tail),((head)+1),(size))
25 #define CIRC_CNT_TO_END(head,tail,size) ({int end = (size) - (tail); int n = ((head) + end) & ((size)-1); n < end ? n : end;})
27 #define CIRC_SPACE_TO_END(head,tail,size) ({int end = (size) - 1 - (head); int n = (end + (tail)) & ((size)-1); n <= end ? n : end+1;})
|
| /prebuilt/ndk/android-ndk-r4/platforms/android-5/arch-x86/usr/include/linux/ |
| circ_buf.h | 18 int tail; member in struct:circ_buf
21 #define CIRC_CNT(head,tail,size) (((head) - (tail)) & ((size)-1))
23 #define CIRC_SPACE(head,tail,size) CIRC_CNT((tail),((head)+1),(size))
25 #define CIRC_CNT_TO_END(head,tail,size) ({int end = (size) - (tail); int n = ((head) + end) & ((size)-1); n < end ? n : end;})
27 #define CIRC_SPACE_TO_END(head,tail,size) ({int end = (size) - 1 - (head); int n = (end + (tail)) & ((size)-1); n <= end ? n : end+1;})
|
| /prebuilt/ndk/android-ndk-r4/platforms/android-8/arch-arm/usr/include/linux/ |
| circ_buf.h | 18 int tail; member in struct:circ_buf
21 #define CIRC_CNT(head,tail,size) (((head) - (tail)) & ((size)-1))
23 #define CIRC_SPACE(head,tail,size) CIRC_CNT((tail),((head)+1),(size))
25 #define CIRC_CNT_TO_END(head,tail,size) ({int end = (size) - (tail); int n = ((head) + end) & ((size)-1); n < end ? n : end;})
27 #define CIRC_SPACE_TO_END(head,tail,size) ({int end = (size) - 1 - (head); int n = (end + (tail)) & ((size)-1); n <= end ? n : end+1;})
|
| /prebuilt/ndk/android-ndk-r4/platforms/android-8/arch-x86/usr/include/linux/ |
| circ_buf.h | 18 int tail; member in struct:circ_buf
21 #define CIRC_CNT(head,tail,size) (((head) - (tail)) & ((size)-1))
23 #define CIRC_SPACE(head,tail,size) CIRC_CNT((tail),((head)+1),(size))
25 #define CIRC_CNT_TO_END(head,tail,size) ({int end = (size) - (tail); int n = ((head) + end) & ((size)-1); n < end ? n : end;})
27 #define CIRC_SPACE_TO_END(head,tail,size) ({int end = (size) - 1 - (head); int n = (end + (tail)) & ((size)-1); n <= end ? n : end+1;})
|
| /prebuilt/ndk/android-ndk-r5/platforms/android-3/arch-arm/usr/include/linux/ |
| circ_buf.h | 18 int tail; member in struct:circ_buf
21 #define CIRC_CNT(head,tail,size) (((head) - (tail)) & ((size)-1))
23 #define CIRC_SPACE(head,tail,size) CIRC_CNT((tail),((head)+1),(size))
25 #define CIRC_CNT_TO_END(head,tail,size) ({int end = (size) - (tail); int n = ((head) + end) & ((size)-1); n < end ? n : end;})
27 #define CIRC_SPACE_TO_END(head,tail,size) ({int end = (size) - 1 - (head); int n = (end + (tail)) & ((size)-1); n <= end ? n : end+1;})
|
| /prebuilt/ndk/android-ndk-r6/platforms/android-3/arch-arm/usr/include/linux/ |
| circ_buf.h | 18 int tail; member in struct:circ_buf
21 #define CIRC_CNT(head,tail,size) (((head) - (tail)) & ((size)-1))
23 #define CIRC_SPACE(head,tail,size) CIRC_CNT((tail),((head)+1),(size))
25 #define CIRC_CNT_TO_END(head,tail,size) ({int end = (size) - (tail); int n = ((head) + end) & ((size)-1); n < end ? n : end;})
27 #define CIRC_SPACE_TO_END(head,tail,size) ({int end = (size) - 1 - (head); int n = (end + (tail)) & ((size)-1); n <= end ? n : end+1;})
|
| /prebuilt/ndk/android-ndk-r6/platforms/android-3/arch-x86/usr/include/linux/ |
| circ_buf.h | 18 int tail; member in struct:circ_buf
21 #define CIRC_CNT(head,tail,size) (((head) - (tail)) & ((size)-1))
23 #define CIRC_SPACE(head,tail,size) CIRC_CNT((tail),((head)+1),(size))
25 #define CIRC_CNT_TO_END(head,tail,size) ({int end = (size) - (tail); int n = ((head) + end) & ((size)-1); n < end ? n : end;})
27 #define CIRC_SPACE_TO_END(head,tail,size) ({int end = (size) - 1 - (head); int n = (end + (tail)) & ((size)-1); n <= end ? n : end+1;})
|
| /external/clang/test/CXX/temp/temp.decls/temp.variadic/ |
| p2.cpp | 12 template<typename Head, typename ...Tail>
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}}
14 recurse_until_fail(tail...); // expected-error{{no matching function for call to 'recurse_until_fail'}} \
|
| /packages/apps/Email/emailcommon/src/org/apache/james/mime4j/decoder/ |
| UnboundedFifoByteBuffer.java | 59 protected int tail;
field in class:UnboundedFifoByteBuffer
86 tail = 0;
97 if (tail < head) {
98 size = buffer.length - head + tail;
100 size = tail - head;
127 for (int i = head; i != tail;) {
140 tail = j;
143 buffer[tail] = b;
144 tail++;
145 if (tail >= buffer.length) {
[all...] |
| /external/javassist/src/main/javassist/compiler/ast/ |
| 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/ |
| 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/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;
|
| /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);
|
| /external/webkit/Source/WebCore/dom/ |
| ContainerNodeAlgorithms.h | 34 void addChildNodesToDeletionQueue(GenericNode*& head, GenericNode*& tail, GenericNodeContainer* container);
45 GenericNode* tail = 0; local
47 Private::addChildNodesToDeletionQueue<GenericNode, GenericNodeContainer>(head, tail, container);
59 tail = 0;
62 Private::addChildNodesToDeletionQueue<GenericNode, GenericNodeContainer>(head, tail, static_cast<GenericNodeContainer*>(n));
114 void addChildNodesToDeletionQueue(GenericNode*& head, GenericNode*& tail, GenericNodeContainer* container)
132 if (tail)
133 tail->setNextSibling(n);
137 tail = n;
|
| /external/opencv/cvaux/src/ |
| 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 = newseq
[all...] |
| /external/valgrind/tsan/ |
| ignore.cc | 46 string tail; local
47 if (CutStringPrefixIfPresent(input_line, "obj:", &tail)) {
48 ignore_lists->ignores.push_back(IgnoreObj(tail));
49 } else if (CutStringPrefixIfPresent(input_line, "src:", &tail)) {
50 ignore_lists->ignores.push_back(IgnoreFile(tail));
51 } else if (CutStringPrefixIfPresent(input_line, "fun:", &tail)) {
52 ignore_lists->ignores.push_back(IgnoreFun(tail));
53 } else if (CutStringPrefixIfPresent(input_line, "fun_r:", &tail)) {
54 ignore_lists->ignores_r.push_back(IgnoreFun(tail));
55 } else if (CutStringPrefixIfPresent(input_line, "fun_hist:", &tail)) {
[all...] |
| /development/pdk/hosting/ |
| edoxfix.sh | 11 tail -n $count $f > $f.tail.tmp
12 cat $f.head.tmp $1/div.tmp $f.tail.tmp > $f
|
| /external/bluetooth/glib/glib/ |
| gqueue.c | 78 queue->head = queue->tail = NULL;
147 queue->tail = queue->head;
279 queue->tail = g_list_last (queue->head);
296 if (!queue->tail)
297 queue->tail = queue->head;
350 queue->tail = link;
360 * Adds a new element at the tail of the queue.
368 queue->tail = g_list_append (queue->tail, data);
369 if (queue->tail->next
[all...] |
| /system/extras/fatblock/ |
| fdpool.c | 66 struct pooled_fd *tail = fdpool_head.prev; local
68 assert(tail != &fdpool_head);
70 fdpool_remove(tail);
72 return tail;
91 struct pooled_fd *tail; local
93 tail = fdpool_remove_tail();
94 fdpool_unpool(tail);
|
| /external/apache-harmony/auth/src/test/java/common/org/apache/harmony/auth/tests/support/ |
| TestUtils.java | 55 String tail = Integer.toHexString(0x000000ff & data[i]); local
56 if (tail.length() == 1) {
57 tail = "0" + tail;
59 System.out.print(prefix + "0x" + tail + delimiter);
|
