/openjdk9/jaxws/src/java.xml.ws/share/classes/com/sun/xml/internal/ws/util/pipe/ |
H A D | StandalonePipeAssembler.java | 46 Pipe head = context.createTransportPipe(); 47 head = context.createSecurityPipe(head); 52 head = context.createDumpPipe("client", System.out, head); 54 head = context.createWsaPipe(head); 55 head = context.createClientMUPipe(head); 56 return context.createHandlerPipe(head); [all...] |
H A D | StandaloneTubeAssembler.java | 45 Tube head = context.createTransportTube(); 46 head = context.createSecurityTube(head); 50 head = context.createDumpTube("client", System.out, head); 52 head = context.createWsaTube(head); 53 head = context.createClientMUTube(head); 54 head [all...] |
/openjdk9/jdk/src/jdk.internal.le/share/classes/jdk/internal/jline/console/ |
H A D | KillRing.java | 29 private int head = 0; field in class:KillRing 76 if (slots[head] != null) { 77 slots[head] += str; 84 slots[head] = str; 98 if (slots[head] != null) { 99 slots[head] = str + slots[head]; 106 slots[head] = str; 116 return slots[head]; 128 return slots[head]; [all...] |
/openjdk9/jdk/src/java.naming/share/classes/com/sun/jndi/toolkit/ctx/ |
H A D | HeadTail.java | 37 private Name head; field in class:HeadTail 40 public HeadTail(Name head, Name tail) { argument 41 this(head, tail, 0); 44 public HeadTail(Name head, Name tail, int status) { argument 46 this.head = head; 55 return this.head;
|
H A D | StringHeadTail.java | 35 private String head; field in class:StringHeadTail 38 public StringHeadTail(String head, String tail) { argument 39 this(head, tail, 0); 42 public StringHeadTail(String head, String tail, int status) { argument 44 this.head = head; 53 return this.head;
|
/openjdk9/jdk/src/java.management/share/classes/com/sun/jmx/remote/internal/ |
H A D | ArrayQueue.java | 35 this.head = 0; 51 this.head = 0; 63 if (newtail == head) 71 throw new IllegalArgumentException("Can only remove head of queue"); 72 if (head == tail) 74 T removed = queue[head]; 75 queue[head] = null; 76 head = (head + 1) % capacity; 86 int index = (head 100 private int head; field in class:ArrayQueue [all...] |
/openjdk9/jdk/src/java.desktop/share/classes/sun/awt/geom/ |
H A D | ChainEnd.java | 29 CurveLink head; field in class:ChainEnd 35 this.head = first; 42 return head; 54 * Returns head of a complete chain to be added to subcurves 79 enter.tail.setNext(exit.head); 83 return enter.head; 90 if (enter.head.getYTop() < otherenter.head.getYTop()) { 91 enter.tail.setNext(otherenter.head); 92 otherenter.head [all...] |
/openjdk9/hotspot/src/share/vm/services/ |
H A D | mallocSiteTable.cpp | 112 MallocSiteHashtableEntry* head; local 114 head = _table[index]; 115 while (head != NULL) { 116 if (!walker->do_malloc_site(head->peek())) { 119 head = (MallocSiteHashtableEntry*)head->next(); 148 // swap in the head 156 MallocSiteHashtableEntry* head = _table[index]; local 157 while (head != NULL && (*pos_idx) <= MAX_BUCKET_LENGTH) { 158 MallocSite* site = head 202 MallocSiteHashtableEntry* head = _table[index]; local 208 delete_linked_list(MallocSiteHashtableEntry* head) argument [all...] |
H A D | virtualMemoryTracker.cpp | 58 LinkedListNode<CommittedMemoryRegion>* node = _committed_regions.head(); 179 LinkedListNode<CommittedMemoryRegion>* head = _committed_regions.head(); local 183 while (head != NULL) { 184 crgn = head->data(); 195 head = head->next(); 197 continue; // don't update head or prev 206 return remove_uncommitted_region(head, addr, sz); // done! 222 prev = head; 234 LinkedListNode<CommittedMemoryRegion>* head = local 262 LinkedListNode<CommittedMemoryRegion>* head = local 467 LinkedListNode<ReservedMemoryRegion>* head = _reserved_regions->head(); local [all...] |
/openjdk9/jdk/src/java.desktop/share/native/libfontmanager/layout/ |
H A D | LEInsertionList.cpp | 51 : head(NULL), tail(NULL), growAmount(0), append(rightToLeft) 53 tail = (InsertionRecord *) &head; 63 while (head != NULL) { 64 InsertionRecord *record = head; 66 head = head->next; 70 tail = (InsertionRecord *) &head; 103 insertion->next = head; 104 head = insertion; 112 for (InsertionRecord *rec = head; re [all...] |
/openjdk9/jdk/src/java.instrument/share/native/libinstrument/ |
H A D | JarFacade.c | 34 jarAttribute* head; member in struct:__anon1308 80 if (context->head == NULL) { 81 context->head = attribute; 105 return context.head; 107 freeAttributes(context.head); 117 freeAttributes(jarAttribute* head) { argument 118 while (head != NULL) { 119 jarAttribute* next = (jarAttribute*)head->next; 120 free(head->name); 121 free(head [all...] |
/openjdk9/jdk/test/java/util/LinkedList/ |
H A D | AddAll.java | 34 List head = Collections.nCopies(7, "deadly sin"); 36 List l1 = new ArrayList(head); 37 List l2 = new LinkedList(head);
|
/openjdk9/hotspot/src/share/vm/gc/shared/ |
H A D | referenceProcessor.inline.hpp | 31 oop DiscoveredList::head() const { function in class:DiscoveredList 38 // Must compress the head ptr. 46 return head() == NULL; 55 _ref(refs_list.head()), 57 _first_seen(refs_list.head()),
|
/openjdk9/jdk/test/java/lang/ref/SoftReference/ |
H A D | Bash.java | 41 public static TestReference head; field in class:Bash.TestReference 46 next = head; 47 head = this; 64 for (TestReference r = TestReference.head; r != null; r = r.next) {
|
/openjdk9/nashorn/src/jdk.scripting.nashorn/share/classes/jdk/nashorn/internal/objects/ |
H A D | LinkedMap.java | 55 // The head and tail of our doubly-linked list. We use the same node to represent both the head and the 57 private final Node head = new Node(); field in class:LinkedMap 72 * Constructor for the list head. This creates an empty circular list. 124 this.cursor = head; 138 // and continue from there. This may be the list head, which always remains alive. 140 assert cursor != head; 146 if (cursor == head) { 209 for (Node node = head.next; node != head; nod [all...] |
/openjdk9/hotspot/src/share/vm/memory/ |
H A D | freeList.cpp | 39 // of space in the heap. The head and tail are maintained so that 41 // at the tail of the list and removed from the head of the list to 59 // If this method is not used (just set the head instead), 92 assert(head() == NULL || head()->prev() == NULL, "list invariant"); 94 Chunk_t* fc = head(); 107 assert(head() == NULL || head()->prev() == NULL, "list invariant"); 119 fl->set_head(head()); n--; 120 Chunk* tl = head(); [all...] |
/openjdk9/jaxws/src/jdk.xml.bind/share/classes/com/sun/xml/internal/rngom/digested/ |
H A D | DContainerPattern.java | 57 private DPattern head; field in class:DContainerPattern 61 return head; 77 DPattern next = head; 97 head = tail = child;
|
/openjdk9/hotspot/test/compiler/c2/ |
H A D | Test6843752.java | 47 Item head = list; 48 if (head == null) { 53 item.next = head; 54 item.prev = head.prev; 55 head.prev.next = item; 56 head.prev = item; 61 Item head = list; 67 if (head == item) {
|
/openjdk9/jdk/src/java.desktop/windows/native/libawt/java2d/d3d/ |
H A D | ShaderList.c | 57 info->next = programList->head; 63 // insert it at the head of the list 64 programList->head = info; 100 ShaderInfo *info = programList->head; 111 if (info != programList->head) { 113 info->next = programList->head; 114 programList->head = info; 131 ShaderInfo *info = programList->head; 142 programList->head = NULL;
|
/openjdk9/jaxp/test/javax/xml/jaxp/unittest/util/ |
H A D | BOMInputStream.java | 39 byte[] head = bom.get(charset); 40 if (head == null) 42 byte[] result = new byte[head.length + content.length]; 43 System.arraycopy(head, 0, result, 0, head.length); 44 System.arraycopy(content, 0, result, head.length, content.length);
|
/openjdk9/hotspot/src/share/vm/opto/ |
H A D | loopUnswitch.cpp | 74 LoopNode* head = _head->as_Loop(); local 75 if (head->unswitch_count() + 1 > head->unswitch_max()) { 86 LoopNode *head = loop->_head->as_Loop(); local 88 Node* n = head->in(LoopNode::LoopBackControl); 89 while (n != head) { 118 LoopNode *head = loop->_head->as_Loop(); local 125 tty->print("Unswitch %d ", head->unswitch_count()+1); 131 if (head->is_CountedLoop() && !head 227 LoopNode* head = loop->_head->as_Loop(); local 271 LoopNode* head = loop->_head->as_Loop(); local [all...] |
/openjdk9/jdk/src/java.base/share/classes/java/lang/ref/ |
H A D | ReferenceQueue.java | 57 private volatile Reference<? extends T> head; field in class:ReferenceQueue 69 r.next = (head == null) ? r : head; 70 head = r; 85 Reference<? extends T> r = head; 93 head = (rn == r) ? null : rn; 113 if (head == null) 184 for (Reference<? extends T> r = head; r != null;) { 194 // restart from head when overtaken by queue poller(s) 195 r = head; [all...] |
/openjdk9/jaxws/src/java.xml.ws/share/classes/com/sun/xml/internal/ws/assembler/ |
H A D | TubelineAssemblyContextImpl.java | 48 private Tube head; field in class:TubelineAssemblyContextImpl 54 return head; 60 adaptedHead = PipeAdapter.adapt(head); 66 if (newHead == head || newHead == adaptedHead) { 70 head = newHead; 71 tubes.add(head);
|
/openjdk9/langtools/test/tools/javac/unit/util/list/ |
H A D | FromArray.java | 44 if (s != ss.head) 45 throw new AssertionError("s != ss.head (" + s + ", " + ss.head + ")");
|
/openjdk9/langtools/test/tools/javac/generics/odersky/ |
H A D | List.java | 28 public A head; field in class:List 35 /** Construct a list given its head and tail. 37 public List(A head, List<A> tail) { argument 39 this.head = head; 122 else return this.prependList(xs.tail).prepend(xs.head); 130 rev = new List<A>(l.head, rev); 155 vec[i] = l.head; 169 buf.append(((Object)head).toString()); 172 buf.append(((Object)l.head) [all...] |