Searched defs:tail (Results 26 - 50 of 58) sorted by relevance

123

/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
61 public List<A> tail; field in class:List
63 /** Construct a list given its head and tail.
65 List(A head, List<A> tail) { argument
66 this.tail = tail;
78 public List<Object> setTail(List<Object> tail) {
138 return tail == null;
145 return tail != null;
154 while (l.tail !
165 setTail(List<A> tail) argument
[all...]
/openjdk7/jdk/src/share/native/sun/awt/debug/
H A Ddebug_mem.c142 static void DMem_VerifyTail(MemoryBlockTail * tail) { argument
143 DASSERTMSG( DMem_ClientCheckPtr(tail, sizeof(MemoryBlockTail)), "Tail corruption, invalid pointer");
144 DASSERTMSG( DMem_VerifyGuardArea(tail->guard), "Tail corruption, possible overwrite" );
149 MemoryBlockTail * tail; local
161 /* check the tail of the block for overruns */
162 tail = (MemoryBlockTail *) ( (byte_t *)memptr + header->size );
163 DMem_VerifyTail(tail);
200 MemoryBlockTail * tail; local
241 tail = (MemoryBlockTail *)(memptr + size);
242 memset(tail
[all...]
/openjdk7/hotspot/src/share/vm/gc_implementation/g1/
H A DsparsePRT.cpp431 SparsePRT* tail = sprt_cleanup_task->tail(); local
433 assert(tail != NULL, "if head is not NULL, so should tail");
435 tail->set_next_expanded(_head_expanded_list);
438 assert(tail == NULL, "if head is NULL, so should tail");
H A DsparsePRT.hpp307 // pause. It creates a list of expanded tables whose head / tail
347 SparsePRT* tail() { return _tail; } function in class:VALUE_OBJ_CLASS_SPEC
H A Dg1CollectorPolicy.hpp508 // The tail of the incrementally built collection set.
742 // The tail of the incrementally built collection set.
914 HeapRegion* tail) {
917 _recorded_survivor_tail = tail;
912 record_survivor_regions(uint regions, HeapRegion* head, HeapRegion* tail) argument
/openjdk7/jdk/src/share/classes/com/sun/java/util/jar/pack/
H A DFixups.java48 int tail; // desc locating last reloc field in class:Fixups
338 head = tail = thisDesc;
340 int prevDesc = tail;
341 // Store new desc in previous tail.
349 tail = thisDesc;
/openjdk7/hotspot/src/share/vm/utilities/
H A Dxmlstream.cpp308 void xmlStream::tail(const char* kind) { function in class:xmlStream
353 // Output the tail-tag of the enclosing element.
355 tail(buffer);
/openjdk7/jdk/src/share/instrument/
H A DInvocationAdapter.c61 * Parse -javaagent tail, of the form name[=options], into name
66 parseArgumentTail(char* tail, char** name, char** options) { argument
70 pos = strchr(tail, '=');
71 len = (pos == NULL) ? (int)strlen(tail) : (int)(pos - tail);
77 memcpy(*name, tail, len);
135 * The argument tail string provided to Agent_OnLoad will be of form
136 * <jarfile>[=<options>]. The tail string is split into the jarfile and
144 Agent_OnLoad(JavaVM *vm, char *tail, void * reserved) { argument
162 if (parseArgumentTail(tail,
[all...]
/openjdk7/jdk/src/share/native/com/sun/java/util/jar/pack/
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);
271 if (tail.len != 0)
272 crc = get_crc32(crc, (uchar *)tail.ptr, (uint)tail.len);
277 if (deflate_bytes(head, tail) == false) {
291 write_data(tail);
358 bool jar::deflate_bytes(bytes& head, bytes& tail) { argument
359 int len = (int)(head.len + tail
262 addJarEntry(const char* fname, bool deflate_hint, int modtime, bytes& head, bytes& tail) argument
[all...]
H A Dcoding.cpp608 coding_method* tail = U_NEW(coding_method, 1); local
609 CHECK_NULL(tail);
610 tail->u = u;
618 self->next = tail;
624 tail->init(band_rp, band_limit, NO_META, mode, defc, N2, valueSink);
626 tail->init(band_rp, band_limit, meta_rp, mode, defc, N2, valueSink);
628 // Note: The preceding calls to init should be tail-recursive.
/openjdk7/jaxp/src/com/sun/org/apache/xpath/internal/axes/
H A DWalkerFactory.java861 StepPattern tail = step;
937 tail = pat;
944 XNumber score = tail.getStaticScore();
945 tail.setRelativePathPattern(selfPattern);
946 tail.setStaticScore(score);
969 * @param tail The step that is the first step analyzed, but the last
970 * step in the relative match linked list, i.e. the tail.
982 int analysis, StepPattern tail, StepPattern head)
980 createDefaultStepPattern( Compiler compiler, int opPos, MatchPatternIterator mpi, int analysis, StepPattern tail, StepPattern head) argument
/openjdk7/jdk/src/share/classes/javax/swing/tree/
H A DDefaultMutableTreeNode.java1160 return myParent.getNextLeaf(); // tail recursion
1195 return myParent.getPreviousLeaf(); // tail recursion
1402 QNode tail; field in class:DefaultMutableTreeNode.BreadthFirstEnumeration.Queue
1415 head = tail = new QNode(anObject, null);
1417 tail.next = new QNode(anObject, null);
1418 tail = tail.next;
1431 tail = null;
/openjdk7/jdk/src/share/classes/java/util/concurrent/
H A DConcurrentLinkedDeque.java149 * The deque object has two node references, "head" and "tail".
150 * The head and tail are only approximations to the first and last
152 * following prev pointers from head; likewise for tail. However,
153 * it is permissible for head and tail to be referring to deleted
185 * head or tail.
204 * the nodes pointed at by head/tail never get gc-unlinked, since
205 * head/tail are needed to get "back on track" by other nodes that
228 * restart traversal from tail.
262 * - head may not be reachable from the first or last node, or from tail
270 * - the last node is always O(1) reachable from tail vi
278 private transient volatile Node<E> tail; field in class:ConcurrentLinkedDeque
[all...]
H A DLinkedTransferQueue.java51 * producer. The <em>tail</em> of the queue is that element that has
111 * (unmatched) queue node (or null if empty); and "tail" that
116 * head tail
123 * tail pointers. This has led to the development of
159 * updates on head/tail fields.
162 * never versus always updating queue (head and tail) pointers.
169 * head tail
176 * similarly for "tail") is an empirical matter. We have found
183 * virtue of only sometimes updating head or tail pointers when
208 * known first unmatched node, and similarly for tail
562 private transient volatile Node tail; field in class:LinkedTransferQueue
[all...]
H A DSynchronousQueue.java144 * cancelled. But if it may be pinned as the current tail, it must
600 transient volatile QNode tail; field in class:SynchronousQueue.TransferQueue
611 tail = h;
625 * Tries to cas nt as new tail.
628 if (tail == t)
657 * advance head and tail on behalf of other stalled/slow
661 * seeing uninitialized head or tail values. This never
673 QNode t = tail;
680 if (t != tail) // inconsistent read
682 if (tn != null) { // lagging tail
[all...]
/openjdk7/jdk/src/share/classes/java/awt/
H A DEventQueue.java320 queues[priority].head = queues[priority].tail = newItem;
333 queues[priority].tail.next = newItem;
334 queues[priority].tail = newItem;
559 queues[i].tail = null;
588 if (queues[i].tail == entry) {
589 queues[i].tail = prev;
1153 queues[i].tail = prev;
1307 EventQueueItem tail; field in class:Queue
/openjdk7/hotspot/src/os/solaris/vm/
H A DattachListener_solaris.cpp103 static SolarisAttachOperation* tail() { return _tail; } function in class:SolarisAttachListener
104 static void set_tail(SolarisAttachOperation* tail) { _tail = tail; } argument
490 // enqueue at tail
495 tail()->set_next(op);
/openjdk7/jdk/src/windows/native/java/net/
H A DNetworkInterface.c317 * Put the interface at tail of list as GetIfTable(,,TRUE) is
324 netif *tail = netifP; local
325 while (tail->next != NULL) {
326 tail = tail->next;
328 tail->next = curr;
/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
105 * operation on "tail", so there is a simple atomic point of
126 * updated "tail" when a node's successor appears to be null.
141 * is constructed and head and tail pointers are set upon first
232 * to be null, we can scan prev's from the tail to
305 private transient volatile Node tail; field in class:AbstractQueuedLongSynchronizer
362 Node t = tail;
365 tail = head;
385 Node pred = tail;
[all...]
H A DAbstractQueuedSynchronizer.java320 * tail. To dequeue, you just set the head field.
323 * head | | <---- | | <---- | | tail
328 * operation on "tail", so there is a simple atomic point of
349 * updated "tail" when a node's successor appears to be null.
364 * is constructed and head and tail pointers are set upon first
455 * to be null, we can scan prev's from the tail to
528 private transient volatile Node tail; field in class:AbstractQueuedSynchronizer
585 Node t = tail;
588 tail = head;
608 Node pred = tail;
[all...]
/openjdk7/hotspot/src/share/vm/opto/
H A DidealGraphPrinter.cpp171 tail(TOP_ELEMENT);
229 void IdealGraphPrinter::tail(const char *name) { function in class:IdealGraphPrinter
230 _xml->tail(name);
249 tail(PROPERTY_ELEMENT);
271 tail(BYTECODES_ELEMENT);
280 tail(INLINE_ELEMENT);
282 tail(METHOD_ELEMENT);
334 tail(PROPERTIES_ELEMENT);
353 tail(GROUP_ELEMENT);
625 tail(PROPERTIES_ELEMEN
[all...]
H A Dsuperword.hpp131 DepMem* tail() { return _tail; } function in class:VALUE_OBJ_CLASS_SPEC
221 GrowableArray<Node*> _mem_slice_tail; // Memory slice tail nodes
H A Dgcm.cpp1496 Block* tail = _bbs[tail_n->_idx]; local
1499 // For all reasonable loops, the head occurs before the tail in RPO.
1500 if (i <= tail->_rpo) {
1502 // The tail and (recursive) predecessors of the tail
1560 // For all reasonable loops, the head occurs before the tail in RPO.
/openjdk7/jdk/src/share/back/
H A DeventHelper.c117 HelperCommand *tail; member in struct:__anon507
182 queue->tail->next = command;
184 queue->tail = command;
235 if (queue->tail == command) {
236 queue->tail = NULL;
723 commandQueue.tail = NULL;
/openjdk7/hotspot/src/share/vm/ci/
H A DciTypeFlow.cpp1890 st->print(" %d<-%d", lp->head()->pre_order(),lp->tail()->pre_order());
2225 // Clone lp's head and replace tail's successors with clone.
2250 Block* tail = lp->tail(); local
2253 tty->print(" for predecessor "); tail->print_value_on(tty);
2262 // Insert clone after (orig) tail in reverse post order
2263 clone->set_rpo_next(tail->rpo_next());
2264 tail->set_rpo_next(clone);
2266 // tail->head becomes tail
[all...]

Completed in 1539 milliseconds

123