Searched refs:head (Results 26 - 50 of 217) sorted by relevance

123456789

/openjdk7/jaxws/src/share/jaxws_classes/com/sun/xml/internal/fastinfoset/util/
H A DDuplicateAttributeVerifier.java103 final Entry head = _map[hash];
104 if (head == null || head.iteration < _currentIteration) {
110 Entry e = head;
118 newEntry.hashNext = head;
/openjdk7/jdk/test/java/rmi/MarshalledObject/compare/
H A DCompare.java97 Node head = null;
100 if (head == null)
101 cur = head = new Node();
105 System.err.println("head = " + head);
106 return new MarshalledObject(head);
/openjdk7/langtools/src/share/classes/com/sun/tools/javac/util/
H A DList.java43 * <p>Lists are always trailed by a sentinel element, whose head and tail
55 public A head; field in class:List
63 /** Construct a list given its head and tail.
65 List(A head, List<A> tail) { argument
67 this.head = head;
183 if (xs.tail.isEmpty()) return prepend(xs.head);
184 // return this.prependList(xs.tail).prepend(xs.head);
210 rev = new List<A>(l.head, rev);
245 dest[i] = l.head;
[all...]
H A DListBuffer.java106 List<A> p = elems = new List<A>(elems.head, elems.tail);
110 tail = new List<A>(tail.head, tail.tail);
131 last.head = x;
142 append(xs.head);
188 return elems.head;
194 A x = elems.head;
213 A elem = elems.head;
/openjdk7/jdk/test/java/util/Collections/
H A DCheckedMapBash.java44 Object head = nil;
51 m.put(newHead, head);
52 head = newHead;
79 while (head != nil) {
80 if (!m.containsKey(head))
82 Object newHead = m.get(head);
85 m.remove(head);
86 head = newHead;
/openjdk7/hotspot/src/share/vm/services/
H A DmemTrackWorker.cpp193 int MemTrackWorker::count_recorder(const MemRecorder* head) { argument
195 while(head != NULL) {
197 head = head->next();
205 MemRecorder* head = _gen[index].peek(); local
206 if (head != NULL) {
207 count += count_recorder(head);
/openjdk7/langtools/test/com/sun/javadoc/testHtmlDocument/
H A DTestHtmlDocument.java65 HtmlTree head = new HtmlTree(HtmlTag.HEAD);
70 head.addContent(title);
75 head.addContent(meta);
78 head.addContent(invmeta);
83 head.addContent(link);
86 head.addContent(invlink);
87 html.addContent(head);
/openjdk7/jdk/src/share/classes/java/util/concurrent/
H A DLinkedBlockingQueue.java50 * The <em>head</em> of the queue is that element that has been on the
55 * operations obtain elements at the head of the queue.
114 * self-link implicitly means to advance to head.next.
126 * - this Node, meaning the successor is head.next
142 * Invariant: head.item == null
144 private transient Node<E> head; field in class:LinkedBlockingQueue
203 * Removes a node from head of queue.
209 // assert head.item == null;
210 Node<E> h = head;
213 head
[all...]
H A DLinkedTransferQueue.java49 * to any given producer. The <em>head</em> of the queue is that
109 * It maintains two pointer fields, "head", pointing to a
116 * head tail
122 * overhead limitations when maintaining (via CAS) these head and
159 * updates on head/tail fields.
162 * never versus always updating queue (head and tail) pointers.
169 * head tail
175 * between the value of "head" and the first unmatched node, and
183 * virtue of only sometimes updating head or tail pointers when
205 * be further reduced without increasing contention of head
559 transient volatile Node head; field in class:LinkedTransferQueue
[all...]
/openjdk7/jdk/src/share/native/sun/font/
H A DAccelGlyphCache.c78 gcinfo->head = NULL;
124 if (cache->head == NULL) {
161 if (cache->head == NULL) {
162 // initialize the head cell
163 cache->head = cellinfo;
192 * towards the head of the list and will eventually be kicked to
199 * eventually hit the original "head" cell, whose counter is now zero.
204 // the head cell will be updated on each iteration
205 CacheCellInfo *current = cache->head;
215 // move cell to the end of the list; update existing head an
[all...]
/openjdk7/jdk/src/share/back/
H A DclassTrack.c80 KlassNode **head = &table[slot]; local
86 for (nodePtr = head; node = *nodePtr, node != NULL; nodePtr = &(node->next)) {
214 KlassNode **head = &table[slot]; local
220 for (node = *head; node != NULL; node = node->next) {
244 node->next = *head;
245 *head = node;
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/xml/internal/org/jvnet/mimepull/
H A DDataHead.java46 volatile Chunk head, tail; field in class:DataHead
74 head = tail = new Chunk(new MemoryData(buf, part.msg.config));
102 head = tail = null;
129 if (head == null) {
179 head = null;
190 this.current = head;
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/xml/internal/xsom/impl/
H A DUtil.java67 private static void buildSubstitutables( XSType head, XSType _this, Set substitutables ) { argument
68 if(!isSubstitutable(head,_this))
69 return; // no derived type of _this can substitute head.
74 buildSubstitutables( head, child[i], substitutables );
/openjdk7/jdk/test/javax/sound/midi/Gervill/SoftTuning/
H A DLoad1.java59 int[] head = {0xf0,0x7e,0x7f,0x08,0x01,0x00};
61 for (int i = 0; i < head.length; i++)
62 msg[ox++] = head[i];
/openjdk7/jdk/src/share/classes/com/sun/jndi/ldap/
H A DServiceLocator.java191 int head = 0;
199 // find the head and tail of the list of records having the same
201 head = i;
209 sublistLength = (tail - head) + 1;
211 hostports[k++] = selectHostport(srvRecords, head, tail);
218 * Randomly select a service record in the range [head, tail] and return
221 private static String selectHostport(SrvRecord[] srvRecords, int head, argument
223 if (head == tail) {
224 return srvRecords[head].hostport;
227 // compute the running sum for records between head an
[all...]
/openjdk7/jdk/src/share/native/sun/java2d/
H A DShaderList.h59 ShaderInfo *head; member in struct:__anon810
/openjdk7/jdk/src/share/classes/sun/security/krb5/
H A DKrbServiceLocator.java202 int head = 0;
210 // find the head and tail of the list of records having the same
212 head = i;
220 sublistLength = (tail - head) + 1;
222 hostports[k++] = selectHostport(srvRecords, head, tail);
229 * Randomly select a service record in the range [head, tail] and return
232 private static String selectHostport(SrvRecord[] srvRecords, int head, argument
234 if (head == tail) {
235 return srvRecords[head].hostport;
238 // compute the running sum for records between head an
[all...]
/openjdk7/hotspot/src/share/vm/memory/
H A DbinaryTreeDictionary.cpp106 Chunk* list = head();
112 assert(head() == NULL || head()->prev() == NULL, "list invariant");
183 assert(!retTL->head() || retTL->size() == retTL->head()->size(),
191 for (Chunk* curFC = retTL->head();
211 assert(retTL->head() == NULL || retTL->head()->prev() == NULL,
225 assert(head() == NULL || head()
[all...]
/openjdk7/langtools/src/share/classes/com/sun/tools/javac/code/
H A DTypes.java191 (TypeVar)parms.head);
192 if (!containsType(args.head, unb))
244 if (res.contains(l.head) && !t.contains(l.head))
245 openVars.append(l.head);
255 qs.append(new WildcardType(syms.objectType, BoundKind.UNBOUND, syms.boundClass, (TypeVar) iter.head));
533 if (!isSubtypeUnchecked(t, l.head, warn))
545 isSubtype(ts.head, ss.head)) {
561 isSubtypeUnchecked(ts.head, s
[all...]
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/xml/internal/ws/api/server/
H A DAdapter.java89 public final PipeHead head; field in class:Adapter.Toolkit
93 this.head = endpoint.createPipeHead();
/openjdk7/jdk/test/java/util/LinkedHashMap/
H A DBasic.java44 Object head = nil;
51 m.put(newHead, head);
52 head = newHead;
66 while (head != nil) {
67 if (!m.containsKey(head))
69 Object newHead = m.get(head);
72 m.remove(head);
73 head = newHead;
/openjdk7/jdk/src/share/native/java/util/zip/zlib-1.2.3/
H A Dinflate.c141 state->head = Z_NULL;
628 if (state->head != Z_NULL)
629 state->head->done = -1;
671 if (state->head != Z_NULL)
672 state->head->text = (int)((hold >> 8) & 1);
678 if (state->head != Z_NULL)
679 state->head->time = hold;
685 if (state->head != Z_NULL) {
686 state->head->xflags = (int)(hold & 0xff);
687 state->head
[all...]
/openjdk7/hotspot/src/share/vm/gc_implementation/shared/
H A DmutableSpace.cpp78 MemRegion head, tail; local
81 head = mr;
106 head = MemRegion(intersection.start() - head_size, intersection.start());
109 assert(mr.contains(head) && mr.contains(tail), "Sanity");
112 numa_setup_pages(head, clear_space);
117 pretouch_pages(head);
122 set_last_setup_region(MemRegion(head.start(), tail.end()));
/openjdk7/jdk/src/share/classes/com/sun/jndi/toolkit/ctx/
H A DComponentContext.java86 * the empty name (new CompositeName()) as the head,
91 * head is the empty name and tail is the entire name.
93 * Otherwise, it returns the first component as head, and the rest of
99 * determination would simply return as head 'name'.
115 Name head, tail;
118 head = name.getPrefix(separator);
122 head = new CompositeName().add(name.toString());
131 return new HeadTail(head, tail);
379 Name head = p.getHead();
382 //System.out.println("terminal : " + head);
[all...]
/openjdk7/langtools/src/share/classes/com/sun/tools/javac/tree/
H A DTreeTranslator.java70 l.head = translate(l.head);
78 l.head = translate(l.head);
86 l.head = translate(l.head);
94 l.head = translate(l.head);
102 l.head = translate(l.head);
[all...]

Completed in 79 milliseconds

123456789