/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;})
|
/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;})
|
/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...] |
/external/bluetooth/glib/gio/ |
gioenumtypes.c.template | 26 /*** BEGIN value-tail ***/ 37 /*** END value-tail ***/ 39 /*** BEGIN file-tail ***/ 42 /*** END file-tail ***/
|
gioenumtypes.h.template | 20 /*** BEGIN file-tail ***/ 24 /*** END file-tail ***/
|
/external/bluetooth/glib/tests/ |
queue-test.c | 27 g_assert (!queue->tail); 28 if (!queue->tail) 40 g_assert (last == queue->tail); 44 for (list = queue->tail; list != NULL; list = list->prev) 58 for (list = queue->tail; list != NULL; list = list->prev) 66 for (list = queue->tail; list != NULL; list = list->prev) 155 enum { OFF_QUEUE, HEAD, TAIL, MIDDLE, LAST } where; 172 case TAIL: 220 GList *tail; member in struct:QueueInfo 238 queues[i].tail = NULL [all...] |
/external/chromium/base/ |
linked_list_unittest.cc | 34 // Checks that when iterating |list| (either from head to tail, or from 35 // tail to head, as determined by |forward|), we get back |node_ids|, 40 for (const LinkNode<Node>* node = (forward ? list.head() : list.tail()); 55 SCOPED_TRACE("Iterating forward (from head to tail)"); 59 SCOPED_TRACE("Iterating backward (from tail to head)"); 67 EXPECT_EQ(list.end(), list.tail()); 79 EXPECT_EQ(&n1, list.tail()); 89 EXPECT_EQ(&n2, list.tail()); 99 EXPECT_EQ(&n3, list.tail()); 122 EXPECT_EQ(&n5, list.tail()); [all...] |
/packages/apps/Gallery3D/src/com/cooliris/media/ |
Deque.java | 50 int tail = mTail; local 51 if (head != tail) { 56 } while (head != tail); 82 int tail = mTail; local 83 array[tail] = e; 84 tail = (tail + 1) & (array.length - 1); 85 mTail = tail; 86 if (mHead == tail) { 105 int tail = (mTail - 1) & (array.length - 1) local [all...] |
DirectLinkedList.java | 48 final Entry<E> tail = mTail; local 49 if (tail != null) { 50 tail.next = entry; 51 entry.previous = tail;
|
/external/icu4c/layout/ |
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;
|
/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
|
/packages/apps/Email/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...] |
/bionic/libc/private/isc/ |
list.h | 24 #define LIST(type) struct { type *head, *tail; } 26 do { (list).head = NULL; (list).tail = NULL; } while (/*CONSTCOND*/0) 39 #define TAIL(list) ((list).tail) 48 (list).tail = (elt); \ 57 if ((list).tail != NULL) \ 58 (list).tail->link.next = (elt); \ 61 (elt)->link.prev = (list).tail; \ 63 (list).tail = (elt); \ 72 (list).tail = (elt)->link.prev; [all...] |
/external/webkit/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;
|
/hardware/qcom/media/mm-video/vidc/vdec/inc/ |
Map.h | 47 node* tail; member in class:Map 52 Map() : head( NULL ), tail ( NULL ),tmp(head),size_of_list(0) {} 53 bool empty() const { return ( !head || !tail ); } 144 tail = new node(data, data2,tail, NULL); 145 if( tail->prev ) 146 tail->prev->next = tail; 150 head = tail; 167 if((head == tail) && (head->data == d) [all...] |
/external/iproute2/tc/ |
q_dsmark.c | 35 struct rtattr *tail; local 74 tail = NLMSG_TAIL(n); 83 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail; 97 struct rtattr *tail; local 101 tail = NLMSG_TAIL(n); 129 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
|
/external/dropbear/ |
queue.c | 32 queue->tail = NULL; 54 queue->tail = NULL; 79 if (queue->tail != NULL) { 80 queue->tail->link = newlink; 82 queue->tail = newlink;
|
/external/webkit/WebCore/platform/ |
DeprecatedPtrListImpl.cpp | 47 static DeprecatedListNode *copyList(DeprecatedListNode *l, DeprecatedListNode *&tail) 67 tail = last; 74 tail(0), 88 head = copyList(impl.head, tail); 117 tail = 0; 129 node = tail; 156 if (tail == 0) { 157 tail = node; 160 // inserting at tail 161 node->prev = tail; [all...] |
/libcore/luni/src/main/java/org/apache/harmony/xnet/provider/jsse/ |
Logger.java | 82 String tail = local 84 if (tail.length() == 1) { 85 tail = "0" + tail; 87 line += prefix + tail + delimiter;
|