| /dalvik/libcore/logging/src/main/java/java/util/logging/ |
| Formatter.java | 25 * string representation. Head and tail strings are sometimes used to wrap a set
107 * Gets the tail string used to wrap a set of log records. This base class
112 * @return the tail string used to wrap a set of log records, empty in this
|
| /dalvik/libcore/xml/src/main/java/org/apache/xml/utils/ |
| NodeVector.java | 180 * Pop a node from the tail of the vector and return the result.
182 * @return the node at the tail of the vector
197 * Pop a node from the tail of the vector and return the
213 * Pop a node from the tail of the vector.
272 * Pop a pair of nodes from the tail of the stack.
285 * Set the tail of the stack to the given node.
289 * @param n Node to set at the tail of vector
297 * Set the given node one position from the tail.
309 * Return the node at the tail of the vector without popping
313 * @return Node at the tail of the vecto
[all...] |
| /external/freetype/src/base/ |
| ftutil.c | 266 FT_ListNode before = list->tail;
277 list->tail = node;
294 list->tail = node;
322 list->tail = before;
347 list->tail = before;
409 list->tail = 0;
|
| /external/tremolo/Tremolo/ |
| framing.c | 227 the buffer preceeding pos and 'head'/'tail' are the buffer past the
229 'head/tail' are NULL */
230 static ogg_reference *ogg_buffer_split(ogg_reference **tail,
236 ogg_reference *ret=*tail;
237 ogg_reference *or=*tail;
255 *tail=or->next;
261 *tail=*head=0;
271 /* make a new reference to tail the second piece */
272 *tail=_fetch_ref(or->buffer->ptr.owner);
274 (*tail)->buffer=or->buffer
[all...] |
| /bionic/libc/kernel/common/linux/netfilter/ |
| nfnetlink.h | 59 #define NFA_NEST(skb, type) ({ struct nfattr *__start = (struct nfattr *) (skb)->tail; NFA_PUT(skb, (NFNL_NFA_NEST | type), 0, NULL); __start; })
60 #define NFA_NEST_END(skb, start) ({ (start)->nfa_len = ((skb)->tail - (unsigned char *) (start)); (skb)->len; })
|
| /external/iproute2/man/man8/ |
| tc-bfifo.8 | 30 A list of packets is maintained, when a packet is enqueued it gets inserted at the tail of
33 If the list is too long, no further packets are allowed on. This is called 'tail drop'.
|
| tc-pfifo.8 | 30 A list of packets is maintained, when a packet is enqueued it gets inserted at the tail of
33 If the list is too long, no further packets are allowed on. This is called 'tail drop'.
|
| /external/iproute2/tc/ |
| q_gred.c | 55 struct rtattr *tail; local
111 tail = NLMSG_TAIL(n);
114 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
130 struct rtattr *tail; local
252 tail = NLMSG_TAIL(n);
256 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
|
| q_htb.c | 66 struct rtattr *tail; local
96 tail = NLMSG_TAIL(n);
99 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
114 struct rtattr *tail; local
234 tail = NLMSG_TAIL(n);
239 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
|
| /external/webkit/JavaScriptCore/API/tests/ |
| Node.c | 51 /* Linear search from tail -- good enough for our purposes here */
66 /* Linear search from tail -- good enough for our purposes here */
|
| NodeList.c | 42 /* Linear count from tail -- good enough for our purposes here */
59 /* Linear search from tail -- good enough for our purposes here */
|
| /ndk/build/platforms/android-3/arch-arm/usr/include/linux/netfilter/ |
| nfnetlink.h | 59 #define NFA_NEST(skb, type) ({ struct nfattr *__start = (struct nfattr *) (skb)->tail; NFA_PUT(skb, (NFNL_NFA_NEST | type), 0, NULL); __start; })
60 #define NFA_NEST_END(skb, start) ({ (start)->nfa_len = ((skb)->tail - (unsigned char *) (start)); (skb)->len; })
|
| /ndk/build/platforms/android-4/arch-arm/usr/include/linux/netfilter/ |
| nfnetlink.h | 59 #define NFA_NEST(skb, type) ({ struct nfattr *__start = (struct nfattr *) (skb)->tail; NFA_PUT(skb, (NFNL_NFA_NEST | type), 0, NULL); __start; })
60 #define NFA_NEST_END(skb, start) ({ (start)->nfa_len = ((skb)->tail - (unsigned char *) (start)); (skb)->len; })
|
| /ndk/build/platforms/android-5/arch-arm/usr/include/linux/netfilter/ |
| nfnetlink.h | 59 #define NFA_NEST(skb, type) ({ struct nfattr *__start = (struct nfattr *) (skb)->tail; NFA_PUT(skb, (NFNL_NFA_NEST | type), 0, NULL); __start; })
60 #define NFA_NEST_END(skb, start) ({ (start)->nfa_len = ((skb)->tail - (unsigned char *) (start)); (skb)->len; })
|
| /ndk/build/platforms/android-5/arch-x86/usr/include/linux/netfilter/ |
| nfnetlink.h | 59 #define NFA_NEST(skb, type) ({ struct nfattr *__start = (struct nfattr *) (skb)->tail; NFA_PUT(skb, (NFNL_NFA_NEST | type), 0, NULL); __start; })
60 #define NFA_NEST_END(skb, start) ({ (start)->nfa_len = ((skb)->tail - (unsigned char *) (start)); (skb)->len; })
|
| /ndk/build/platforms/android-8/arch-arm/usr/include/linux/netfilter/ |
| nfnetlink.h | 59 #define NFA_NEST(skb, type) ({ struct nfattr *__start = (struct nfattr *) (skb)->tail; NFA_PUT(skb, (NFNL_NFA_NEST | type), 0, NULL); __start; })
60 #define NFA_NEST_END(skb, start) ({ (start)->nfa_len = ((skb)->tail - (unsigned char *) (start)); (skb)->len; })
|
| /ndk/build/platforms/android-8/arch-x86/usr/include/linux/netfilter/ |
| nfnetlink.h | 59 #define NFA_NEST(skb, type) ({ struct nfattr *__start = (struct nfattr *) (skb)->tail; NFA_PUT(skb, (NFNL_NFA_NEST | type), 0, NULL); __start; })
60 #define NFA_NEST_END(skb, start) ({ (start)->nfa_len = ((skb)->tail - (unsigned char *) (start)); (skb)->len; })
|
| /dalvik/libcore/concurrent/src/main/java/java/util/concurrent/ |
| ConcurrentLinkedQueue.java | 21 * The <em>tail</em> of the queue is that element that has been on the
23 * are inserted at the tail of the queue, and the queue retrieval
76 * reached in O(1) time from tail, but tail is merely an
100 * Both head and tail are permitted to lag. In fact, failing to
106 * Since head and tail are updated concurrently and independently,
107 * it is possible for tail to lag behind head (why not)?
122 * Both head and tail may or may not point to a Node with a
124 * be null. Upon creation, both head and tail refer to a dummy
125 * Node with null item. Both head and tail are only updated usin
200 private transient volatile Node<E> tail = head; field in class:ConcurrentLinkedQueue
[all...] |
| /external/quake/quake/src/WinQuake/ |
| net_comx.cpp | 37 volatile int tail;
member in struct:__anon5435
41 #define FULL(q) (q.head == ((q.tail-1) & QUEUEMASK))
42 #define EMPTY(q) (q.tail == q.head)
44 #define DEQUEUE(q,b) (b = q.data[q.tail], q.tail = (q.tail + 1) & QUEUEMASK)
406 p->outputQueue.head = p->outputQueue.tail = 0;
407 p->inputQueue.head = p->inputQueue.tail = 0;
807 p->outputQueue.head = p->outputQueue.tail = 0;
808 p->inputQueue.head = p->inputQueue.tail = 0;
[all...] |
| /frameworks/base/libs/ui/ |
| Region.cpp | 242 Rect* tail;
247 : bounds(reg.mBounds), storage(reg.mStorage), head(), tail(), cur() {
291 if (tail-head == ssize_t(span.size())) {
296 while (q != tail) {
308 while (r != tail) {
316 tail = storage.editArray() + storage.size();
317 head = tail - span.size();
327 const_iterator const tail = reg.end();
330 while (cur != tail) {
424 Region::const_iterator const tail = dst.end()
[all...] |
| /frameworks/base/core/java/android/util/ |
| Base64.java | 515 // Account for the tail of the data and the padding bytes, if any.
572 final private byte[] tail; field in class:Base64.Encoder
589 tail = new byte[2];
614 // First we need to concatenate the tail of the previous call
616 // the tail.
620 // There was no tail.
625 // A 1-byte tail with at least 2 bytes of
627 v = ((tail[0] & 0xff) << 16) |
636 // A 2-byte tail with at least 1 byte of input.
637 v = ((tail[0] & 0xff) << 16)
[all...] |
| /dalvik/tools/ |
| get-hprof | 24 FILE_BASE=`adb shell ls -l '/data/misc/heap-dump*.hprof' | tail -1 | \
|
| /development/simulator/app/ |
| LogPool.h | 16 * delete one or more from the tail.
|
| /external/dropbear/ |
| queue.h | 38 struct Link* tail; member in struct:Queue
|
| /external/e2fsprogs/lib/ext2fs/tdb/ |
| build-tdb | 23 if [ `tail -n 1 tdb.c | wc -c` -gt 1 ]; then
|
