Searched refs:head (Results 51 - 75 of 217) sorted by relevance

123456789

/openjdk7/jdk/test/javax/sound/midi/Gervill/SoftTuning/
H A DLoad4.java59 int[] head = {0xf0,0x7e,0x7f,0x08,0x04,0x00,0x00};
61 for (int i = 0; i < head.length; i++)
62 msg[ox++] = head[i];
/openjdk7/jdk/test/sun/net/www/
H A DHeaderTests.java90 MessageHeader head = createMessageHeader (s1);
91 Iterator iter = head.multiValueIterator ("Foo");
93 iter = head.multiValueIterator ("Fub");
/openjdk7/jaxp/src/com/sun/org/apache/xerces/internal/xs/
H A DXSModel.java153 * @param head The substitution group head.
159 public XSObjectList getSubstitutionGroup(XSElementDeclaration head); argument
/openjdk7/jdk/src/share/native/java/util/zip/zlib-1.2.3/
H A Dinflate.h110 gz_headerp head; /* where to save gzip header information */ member in struct:inflate_state
/openjdk7/jdk/src/share/native/sun/font/layout/
H A DLEInsertionList.h168 * The head of the insertion list.
172 InsertionRecord *head; member in class:LEInsertionList
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/xml/internal/org/jvnet/mimepull/
H A DMemoryData.java91 if (dataHead.head != null) {
92 for (Chunk c = dataHead.head; c != null; c = c.next) {
/openjdk7/jdk/src/share/native/com/sun/java/util/jar/pack/
H A Dzip.h54 bytes& head, bytes& tail);
82 bool deflate_bytes(bytes& head, bytes& tail);
H A Dzip.cpp51 inline bool jar::deflate_bytes(bytes& head, bytes& tail) { argument
264 bytes& head, bytes& tail) {
265 int len = (int)(head.len + tail.len);
269 if (head.len != 0)
270 crc = get_crc32(crc, (uchar *)head.ptr, (uint)head.len);
277 if (deflate_bytes(head, tail) == false) {
290 write_data(head);
358 bool jar::deflate_bytes(bytes& head, bytes& tail) { argument
359 int len = (int)(head
262 addJarEntry(const char* fname, bool deflate_hint, int modtime, bytes& head, bytes& tail) argument
[all...]
/openjdk7/jdk/src/share/sample/nio/server/
H A DReply.java78 Reply(Code rc, Content c, Request.Action head) { argument
81 headersOnly = (head == Request.Action.HEAD);
/openjdk7/jdk/src/share/classes/java/util/concurrent/locks/
H A DAbstractQueuedLongSynchronizer.java97 * tail. To dequeue, you just set the head field.
100 * head | | <---- | | <---- | | tail
107 * involves only updating the "head". However, it takes a bit
141 * is constructed and head and tail pointers are set upon first
194 * nodes. This is set (for head node only) in
217 * because the head node is never cancelled: A node becomes
218 * head only as a result of successful acquire. A
279 Node() { // Used to establish initial head or SHARED marker
296 * If head exists, its waitStatus is guaranteed not to be
299 private transient volatile Node head; field in class:AbstractQueuedLongSynchronizer
[all...]
H A DAbstractQueuedSynchronizer.java320 * tail. To dequeue, you just set the head field.
323 * head | | <---- | | <---- | | tail
330 * involves only updating the "head". However, it takes a bit
364 * is constructed and head and tail pointers are set upon first
417 * nodes. This is set (for head node only) in
440 * because the head node is never cancelled: A node becomes
441 * head only as a result of successful acquire. A
502 Node() { // Used to establish initial head or SHARED marker
519 * If head exists, its waitStatus is guaranteed not to be
522 private transient volatile Node head; field in class:AbstractQueuedSynchronizer
[all...]
/openjdk7/langtools/src/share/classes/com/sun/tools/doclets/formats/html/markup/
H A DHtmlDocWriter.java325 Content head = new HtmlTree(HtmlTag.HEAD);
328 head.addContent(headComment);
333 head.addContent(meta);
336 head.addContent(windowTitle);
337 head.addContent(getFramesetJavaScript());
339 head, frameset);
/openjdk7/jdk/src/share/classes/java/util/concurrent/
H A DConcurrentLinkedQueue.java48 * The <em>head</em> of the queue is that element that has been on the
53 * operations obtain elements at the head of the queue.
125 * head as well.
127 * Nodes that are reachable from head. CASing the item
129 * queue. Reachability of all elements from head must remain
131 * head to advance. A dequeued Node may remain in use
145 * self-link implicitly means to advance to head.
147 * Both head and tail are permitted to lag. In fact, failing to
151 * that is, we update head/tail when the current pointer appears
154 * Since head an
234 private transient volatile Node<E> head; field in class:ConcurrentLinkedQueue
[all...]
H A DSynchronousQueue.java51 * <em>head</em> of the queue is the element that the first queued
158 * old head pointers), but references in Queue nodes must be
300 /** The head (top) of the stack */
301 volatile SNode head; field in class:SynchronousQueue.TransferStack
304 return h == head &&
312 * and CASes of head and to avoid surges of garbage when CASes
351 SNode h = head;
364 if ((h = head) != null && h.next == s)
419 * to be at the head of the stack, calls to park are
435 SNode h = head;
598 transient volatile QNode head; field in class:SynchronousQueue.TransferQueue
[all...]
H A DPhaser.java966 AtomicReference<QNode> head = (phase & 1) == 0 ? evenQ : oddQ;
967 while ((q = head.get()) != null &&
969 if (head.compareAndSet(q, q.next) &&
981 * head of queue, which suffices to reduce memory footprint in
987 AtomicReference<QNode> head = (phase & 1) == 0 ? evenQ : oddQ;
990 QNode q = head.get();
994 if (head.compareAndSet(q, q.next) && t != null) {
1048 AtomicReference<QNode> head = (phase & 1) == 0 ? evenQ : oddQ;
1049 QNode q = node.next = head.get();
1052 queued = head
[all...]
/openjdk7/langtools/src/share/classes/com/sun/tools/javac/comp/
H A DInfer.java213 that.inst = hibounds.head;
268 that.inst = lobounds.head.isPrimitive() ? syms.errType : lobounds.head;
283 hb = hibounds.head;
309 UndetVar uv = (UndetVar) l.head;
317 if (inst.nonEmpty() && inst.head.tag != BOT) {
318 uv.inst = inst.head;
330 maximizeInst((UndetVar) l.head, warn);
359 wt.bound = (TypeVar)formals.head;
393 while (actuals.nonEmpty() && formals.head !
[all...]
H A DFlow.java455 PendingExit exit = exits.head;
474 PendingExit exit = exits.head;
542 scanStat(l.head);
560 scanExpr(l.head);
618 if (l.head.getTag() == JCTree.VARDEF) {
619 JCVariableDecl def = (JCVariableDecl)l.head;
630 if (l.head.getTag() != JCTree.METHODDEF &&
631 (TreeInfo.flags(l.head) & STATIC) != 0) {
632 scanDef(l.head);
642 if (TreeInfo.isInitialConstructor(l.head)) {
[all...]
H A DResolve.java359 List<Type> bounds = types.subst(types.getBounds((TypeVar)formals.head),
362 if (!types.isSubtypeUnchecked(actuals.head, bounds.head, warn))
363 throw inapplicableMethodException.setMessage("explicit.param.do.not.conform.to.bounds",actuals.head, bounds);
381 if (l.head.tag == FORALL) instNeeded = true;
446 while (argtypes.nonEmpty() && formals.head != varargsFormal) {
448 ? types.isConvertible(argtypes.head, formals.head, warn)
449 : types.isSubtypeUnchecked(argtypes.head, formals.head, war
[all...]
H A DAnnotate.java151 if (args.length() == 1 && args.head.getTag() != JCTree.ASSIGN) {
153 args.head = make.at(args.head.pos).
154 Assign(make.Ident(names.value), args.head);
159 JCExpression t = tl.head;
244 l.head,
/openjdk7/hotspot/src/share/vm/opto/
H A DidealGraphPrinter.cpp165 head(TOP_ELEMENT);
225 void IdealGraphPrinter::head(const char *name) { function in class:IdealGraphPrinter
226 _xml->head(name);
267 head(BYTECODES_ELEMENT);
273 head(INLINE_ELEMENT);
316 head(GROUP_ELEMENT);
318 head(PROPERTIES_ELEMENT);
403 head(PROPERTIES_ELEMENT);
692 head(NODES_ELEMENT);
696 head(EDGES_ELEMEN
[all...]
H A DloopTransform.cpp113 CountedLoopNode* head = _head->as_CountedLoop(); local
114 if (head->profile_trip_cnt() != COUNT_UNKNOWN) {
119 Node* back = head->in(LoopNode::LoopBackControl);
120 while (back != head) {
130 if (back != head) {
164 tty->print_cr("compute_profile_trip_cnt lp: %d cnt: %f\n", head->_idx, trip_cnt);
167 head->set_profile_trip_cnt(trip_cnt);
484 Node* head = loop->_head; local
485 bool counted_loop = head->is_CountedLoop();
487 CountedLoopNode *cl = head
2406 CountedLoopNode* head = lpt->_head->as_CountedLoop(); local
2625 CountedLoopNode* head = lpt->_head->as_CountedLoop(); local
[all...]
/openjdk7/hotspot/src/share/vm/classfile/
H A DjavaAssertions.cpp66 OptionList** head = &_classes; local
71 head = &_packages;
85 head == &_classes ? "class" : "package",
92 *head = new OptionList(name_copy, enable, *head);
/openjdk7/hotspot/src/os/windows/vm/
H A DattachListener_windows.cpp70 // head of preallocated operations list
73 // head and tail of enqueue operations list
78 static Win32AttachOperation* head() { return _head; } function in class:Win32AttachListener
79 static void set_head(Win32AttachOperation* head) { _head = head; } argument
106 // dequeue an operation from from head of the list
232 // dequeue the operation from the head of the operation list. If
241 Win32AttachOperation* op = head();
244 if (head() == NULL) { // list is empty
/openjdk7/jdk/src/share/classes/javax/swing/tree/
H A DDefaultMutableTreeNode.java1401 QNode head; // null if empty field in class:DefaultMutableTreeNode.BreadthFirstEnumeration.Queue
1414 if (head == null) {
1415 head = tail = new QNode(anObject, null);
1423 if (head == null) {
1427 Object retval = head.object;
1428 QNode oldHead = head;
1429 head = head.next;
1430 if (head == null) {
1439 if (head
[all...]
/openjdk7/langtools/src/share/classes/com/sun/tools/javac/code/
H A DPrinter.java253 s.append(visit(is.head, locale));
263 visit(norm.interfaces_field.head, locale));
291 buf.append(visit(args.head, locale));
295 if (args.head.tag == ARRAY) {
296 buf.append(visit(((ArrayType) args.head).elemtype, locale));
299 buf.append(visit(args.head, locale));

Completed in 74 milliseconds

123456789