| /bionic/libc/upstream-netbsd/lib/libc/include/isc/ |
| list.h | 24 #define LIST(type) struct { type *head, *tail; }
26 do { (list).head = NULL; (list).tail = NULL; } while (/*CONSTCOND*/0)
39 #define HEAD(list) ((list).head)
41 #define EMPTY(list) ((list).head == NULL)
46 if ((list).head != NULL) \
47 (list).head->link.prev = (elt); \
51 (elt)->link.next = (list).head; \
52 (list).head = (elt); \
61 (list).head = (elt);
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/serializer/ |
| ElemDesc.java | 95 /** Bit position if this element type is a head element (i.e. H1, H2, etc.) */
96 static final int HEAD = (1 << 18);
107 /** Bit position if this element type is a header element (i.e. HEAD). */
|
| /external/emma/core/java12/com/vladium/emma/report/html/doc/ |
| Tag.java | 23 public static final Tag HEAD = new TagImpl ("HEAD");
|
| /external/jetty/src/java/org/eclipse/jetty/http/ |
| HttpMethods.java | 33 HEAD= "HEAD",
56 HEAD_BUFFER= CACHE.add(HEAD, HEAD_ORDINAL),
|
| /frameworks/volley/src/test/java/com/android/volley/toolbox/ |
| HttpClientStackTest.java | 106 TestRequest.Head request = new TestRequest.Head();
107 assertEquals(request.getMethod(), Method.HEAD);
|
| HurlStackTest.java | 112 TestRequest.Head request = new TestRequest.Head();
113 assertEquals(request.getMethod(), Method.HEAD);
116 assertEquals("HEAD", mMockConnection.getRequestMethod());
|
| /external/testng/src/main/java/org/testng/reporters/ |
| TestHTMLReporter.java | 197 private static String HEAD =
258 sb.append("<html>\n<head>\n")
261 .append(HEAD)
262 .append("</head>\n")
|
| /external/opencv3/3rdparty/zlib/ |
| inflate.h | 21 HEAD, /* i: waiting for magic header */
61 HEAD -> (gzip) or (zlib) or (raw)
90 gz_headerp head; /* where to save gzip header information */ member in struct:inflate_state
|
| /external/pdfium/third_party/zlib_v128/ |
| inflate.h | 21 HEAD, /* i: waiting for magic header */
61 HEAD -> (gzip) or (zlib) or (raw)
90 gz_headerp head; /* where to save gzip header information */ member in struct:inflate_state
|
| /external/zlib/src/examples/ |
| gzlog.c | 316 #define HEAD sizeof(log_gzhead) /* should be 16 */
318 /* initial gzip extra field content (52 == HEAD + EXTRA + 1) */
413 unsigned char buf[HEAD + EXTRA];
416 read(log->fd, buf, HEAD + EXTRA) != HEAD + EXTRA ||
417 memcmp(buf, log_gzhead, HEAD)) {
420 log->first = PULL8(buf + HEAD);
421 log->last = PULL8(buf + HEAD + 8);
422 log->ccrc = PULL4(buf + HEAD + 16);
423 log->clen = PULL4(buf + HEAD + 20)
[all...] |
| /external/zlib/src/ |
| inflate.h | 21 HEAD, /* i: waiting for magic header */
61 HEAD -> (gzip) or (zlib) or (raw)
90 gz_headerp head; /* where to save gzip header information */ member in struct:inflate_state
|
| /frameworks/volley/src/main/java/com/android/volley/ |
| Request.java | 54 int HEAD = 4;
64 * Request method of this request. Currently supports GET, POST, PUT, DELETE, HEAD, OPTIONS,
|
| /libcore/luni/src/main/java/java/util/concurrent/ |
| ConcurrentLinkedQueue.java | 27 * The <em>head</em> of the queue is that element that has been on the
32 * operations obtain elements at the head of the queue.
99 * head as well.
101 * Nodes that are reachable from head. CASing the item
103 * queue. Reachability of all elements from head must remain
105 * head to advance. A dequeued Node may remain in use
119 * self-link implicitly means to advance to head.
121 * Both head and tail are permitted to lag. In fact, failing to
125 * that is, we update head/tail when the current pointer appears
128 * Since head and tail are updated concurrently and independently
191 transient volatile Node<E> head; field in class:ConcurrentLinkedQueue
[all...] |
| ConcurrentLinkedDeque.java | 119 * The deque object has two node references, "head" and "tail".
120 * The head and tail are only approximations to the first and last
122 * following prev pointers from head; likewise for tail. However,
123 * it is permissible for head and tail to be referring to deleted
155 * head or tail.
174 * the nodes pointed at by head/tail never get gc-unlinked, since
175 * head/tail are needed to get "back on track" by other nodes that
190 * pointers from head), and p.next == null && p.prev == p means
225 * - the first node is always O(1) reachable from head via prev links
227 * - head != nul
234 private transient volatile Node<E> head; field in class:ConcurrentLinkedDeque
[all...] |
| LinkedTransferQueue.java | 27 * to any given producer. The <em>head</em> of the queue is that
83 * It maintains two pointer fields, "head", pointing to a
90 * head tail
96 * overhead limitations when maintaining (via CAS) these head and
133 * updates on head/tail fields.
136 * never versus always updating queue (head and tail) pointers.
143 * head tail
149 * between the value of "head" and the first unmatched node, and
157 * virtue of only sometimes updating head or tail pointers when
179 * be further reduced without increasing contention of head
531 transient volatile Node head; field in class:LinkedTransferQueue
[all...] |
| SynchronousQueue.java | 32 * <em>head</em> of the queue is the element that the first queued
135 * old head pointers), but references in Queue nodes must be
273 /** The head (top) of the stack */
274 volatile SNode head; field in class:SynchronousQueue.TransferStack
277 return h == head &&
278 U.compareAndSwapObject(this, HEAD, h, nh);
285 * and CASes of head and to avoid surges of garbage when CASes
325 SNode h = head;
338 if ((h = head) != null && h.next == s)
393 * to be at the head of the stack, calls to park ar
566 transient volatile QNode head; field in class:SynchronousQueue.TransferQueue
[all...] |
| ConcurrentSkipListMap.java | 99 * Head nodes Index nodes
259 * tree-like structure) also uses CAS. The head index has initial
261 * than the current level adds a level to the head index by
262 * CAS'ing on a new top-most head. To maintain good performance
321 * Head: h
336 * The topmost head index of the skiplist.
338 private transient volatile HeadIndex<K,V> head; field in class:ConcurrentSkipListMap
367 head = new HeadIndex<K,V>(new Node<K,V>(null, BASE_HEADER, null),
372 * compareAndSet head node.
375 return U.compareAndSwapObject(this, HEAD, cmp, val)
[all...] |
| /external/jetty/src/java/org/eclipse/jetty/client/ |
| AbstractHttpConnection.java | 213 _parser.setHeadResponse(HttpMethods.HEAD.equalsIgnoreCase(method));
|
| /libcore/luni/src/main/java/java/util/concurrent/locks/ |
| AbstractQueuedLongSynchronizer.java | 52 * Head of the wait queue, lazily initialized. Except for
54 * If head exists, its waitStatus is guaranteed not to be
57 private transient volatile Node head; field in class:AbstractQueuedLongSynchronizer
158 * Sets head of queue to be node, thus dequeuing. Called only by
165 head = node;
205 * to calling unparkSuccessor of head if it needs signal.)
211 * way of trying to unparkSuccessor of head if it needs
220 Node h = head;
232 if (h == head) // loop if head change
[all...] |
| AbstractQueuedSynchronizer.java | 292 * tail. To dequeue, you just set the head field.
295 * head | | <---- | | <---- | | tail
302 * involves only updating the "head". However, it takes a bit
336 * is constructed and head and tail pointers are set upon first
389 * nodes. This is set (for head node only) in
412 * because the head node is never cancelled: A node becomes
413 * head only as a result of successful acquire. A
474 /** Establishes initial head or SHARED marker. */
521 * Head of the wait queue, lazily initialized. Except for
523 * If head exists, its waitStatus is guaranteed not to b
526 private transient volatile Node head; field in class:AbstractQueuedSynchronizer
[all...] |
| /external/llvm/include/llvm/TableGen/ |
| Record.h | 680 enum UnaryOp { CAST, HEAD, TAIL, EMPTY };
[all...] |
| /external/caliper/lib/ |
| jsr311-api-1.1.1.jar | |
| /external/nanohttpd/core/src/main/java/fi/iki/elonen/ |
| NanoHTTPD.java | [all...] |
| /prebuilts/tools/common/m2/repository/org/codehaus/groovy/modules/http-builder/http-builder/0.7.2/ |
| http-builder-0.7.2.jar | |
| /prebuilts/tools/common/m2/repository/nekohtml/nekohtml/1.9.6.2/ |
| nekohtml-1.9.6.2.jar | |
