Searched refs:next (Results 401 - 425 of 2130) sorted by relevance

<<11121314151617181920>>

/openjdk7/jdk/src/share/classes/java/security/
H A DSecureRandom.java472 final protected int next(int numBits) { method in class:SecureRandom
475 int next = 0;
479 next = (next << 8) + (b[i] & 0xFF);
481 return next >>> (numBytes*8 - numBits);
/openjdk7/hotspot/src/share/vm/classfile/
H A Ddictionary.cpp76 entry->set_pd_set(to_delete->next());
90 current = current->next()) {
110 current = current->next()) {
280 *p = probe->next();
300 probe = probe->next()) {
320 probe = probe->next()) {
335 probe = probe->next()) {
352 probe = probe->next()) {
366 probe = probe->next()) {
378 probe = probe->next()) {
[all...]
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/xml/internal/messaging/saaj/packaging/mime/internet/
H A DParameterList.java78 tk = h.next();
86 tk = h.next();
96 tk = h.next();
101 tk = h.next();
197 Map.Entry e = (Map.Entry)itr.next();
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/xml/internal/ws/org/objectweb/asm/
H A DFieldWriter.java72 FieldWriter next; field in class:FieldWriter
148 cw.lastField.next = this;
179 aw.next = anns;
182 aw.next = ianns;
189 attr.next = attrs;
/openjdk7/langtools/src/share/classes/com/sun/tools/javac/util/
H A DSharedNameTable.java109 n = n.next;
115 n.next = hashes[h];
132 n = n.next;
146 n.next = hashes[h];
162 /** The next name occupying the same hash bucket.
164 NameImpl next; field in class:SharedNameTable.NameImpl
/openjdk7/jdk/src/share/demo/jvmti/agent_util/
H A Dagent_util.c154 char *next; local
160 next = get_token(list, ",", token, sizeof(token));
161 while ( next != NULL ) {
165 next = get_token(next, ",", token, sizeof(token));
/openjdk7/jdk/test/sun/net/idn/
H A DPunycodeTest.java86 String next = sc.next();
87 uplus[0] = next.charAt(0);
88 uplus[1] = next.charAt(1);
89 codept = Integer.parseInt(next.substring(2), 16);
/openjdk7/jdk/src/share/classes/java/util/concurrent/locks/
H A DAbstractQueuedLongSynchronizer.java119 * <p>We also use "next" links to implement blocking mechanics.
121 * predecessor signals the next node to wake up by traversing
122 * next link to determine which thread it is. Determination of
124 * the "next" fields of their predecessors. This is solved
127 * (Or, said differently, the next-links are an optimization
170 * waitStatus value to indicate the next acquireShared should
229 * assign next field of a predecessor until after attachment,
230 * so seeing a null next field does not necessarily mean that
231 * node is at end of queue. However, if a next field appears
233 * double-check. The next fiel
237 volatile Node next; field in class:AbstractQueuedLongSynchronizer.Node
[all...]
H A DAbstractQueuedSynchronizer.java71 * mechanical sense that when a shared mode acquire succeeds, the next
342 * <p>We also use "next" links to implement blocking mechanics.
344 * predecessor signals the next node to wake up by traversing
345 * next link to determine which thread it is. Determination of
347 * the "next" fields of their predecessors. This is solved
350 * (Or, said differently, the next-links are an optimization
393 * waitStatus value to indicate the next acquireShared should
452 * assign next field of a predecessor until after attachment,
453 * so seeing a null next field does not necessarily mean that
454 * node is at end of queue. However, if a next fiel
460 volatile Node next; field in class:AbstractQueuedSynchronizer.Node
[all...]
/openjdk7/jaxp/src/com/sun/org/apache/xalan/internal/xsltc/trax/
H A DDOM2SAX.java213 Node next = node.getFirstChild();
214 while (next != null) {
215 parse(next);
216 next = next.getNextSibling();
300 next = node.getFirstChild();
301 while (next != null) {
302 parse(next);
303 next = next
[all...]
/openjdk7/jdk/src/share/classes/java/nio/charset/
H A DCharset.java350 Object next = null;
353 while (next == null) {
357 next = i.next();
373 public Object next() {
376 Object n = next;
377 next = null;
414 CharsetProvider cp = (CharsetProvider)i.next();
551 Charset cs = i.next();
592 CharsetProvider cp = (CharsetProvider)i.next();
[all...]
/openjdk7/jdk/src/share/classes/java/util/
H A DAbstractList.java181 if (it.next()==null)
185 if (o.equals(it.next()))
332 * Index of element to be returned by subsequent call to next.
337 * Index of element returned by most recent call to next or
354 public E next() { method in class:AbstractList.Itr
358 E next = get(i);
361 return next;
521 E o1 = e1.next();
522 Object o2 = e2.next();
559 * {@code fromIndex}, and repeatedly calls {@code ListIterator.next}
[all...]
/openjdk7/jaxp/src/com/sun/org/apache/xml/internal/dtm/ref/
H A DDTMDefaultBaseIterators.java260 * returned (starting point for the next() search); for single-node
266 * Remembers the current node for the next call to gotoMark().
295 * i.e. subsequent call to next() should return END.
323 * Get the next node in the iteration.
325 * @return The next node handle in the iteration, or END if no more
328 public int next() method in class:DTMDefaultBaseIterators.ChildrenIterator
353 * i.e. subsequent call to next() should return END.
394 * Get the next node in the iteration. In this case, we return
397 * @return The next node handle in the iteration, or END.
399 public int next() method in class:DTMDefaultBaseIterators.ParentIterator
473 public int next() method in class:DTMDefaultBaseIterators.TypedChildrenIterator
562 public int next() method in class:DTMDefaultBaseIterators.NamespaceChildrenIterator
628 public int next() method in class:DTMDefaultBaseIterators.NamespaceIterator
667 public int next() method in class:DTMDefaultBaseIterators.TypedNamespaceIterator
731 public int next() method in class:DTMDefaultBaseIterators.RootIterator
768 public int next() method in class:DTMDefaultBaseIterators.TypedRootIterator
852 public int next() method in class:DTMDefaultBaseIterators.NamespaceAttributeIterator
899 public int next() method in class:DTMDefaultBaseIterators.FollowingSiblingIterator
933 public int next() method in class:DTMDefaultBaseIterators.TypedFollowingSiblingIterator
1005 public int next() method in class:DTMDefaultBaseIterators.AttributeIterator
1068 public int next() method in class:DTMDefaultBaseIterators.TypedAttributeIterator
1153 public int next() method in class:DTMDefaultBaseIterators.PrecedingSiblingIterator
1197 public int next() method in class:DTMDefaultBaseIterators.TypedPrecedingSiblingIterator
1352 public int next() method in class:DTMDefaultBaseIterators.PrecedingIterator
1428 public int next() method in class:DTMDefaultBaseIterators.TypedPrecedingIterator
1532 public int next() method in class:DTMDefaultBaseIterators.FollowingIterator
1568 public int next() method in class:DTMDefaultBaseIterators.TypedFollowingIterator
1712 public int next() method in class:DTMDefaultBaseIterators.AncestorIterator
1875 public int next() method in class:DTMDefaultBaseIterators.DescendantIterator
1947 public int next() method in class:DTMDefaultBaseIterators.TypedDescendantIterator
2001 public int next() method in class:DTMDefaultBaseIterators.NthDescendantIterator
2137 public int next() method in class:DTMDefaultBaseIterators.SingletonIterator
2173 public int next() method in class:DTMDefaultBaseIterators.TypedSingletonIterator
[all...]
H A DExpandedNameTable.java201 for (HashEntry e = m_table[index]; e != null; e = e.next)
262 old = old.next;
268 e.next = m_table[newIndex];
374 * The field next points to the next entry which is hashed into
382 HashEntry next; field in class:ExpandedNameTable.HashEntry
384 protected HashEntry(ExtendedType key, int value, int hash, HashEntry next) argument
389 this.next = next;
/openjdk7/hotspot/src/share/vm/memory/
H A DreferenceProcessor.cpp319 // clear the decks for the next collection (cycle).
348 // (java.lang.ref.Reference.discovered), self-loop their "next" field
352 // the "next" field is used to chain the pending list, not the discovered
363 // Walk down the list, self-looping the next field
373 assert(java_lang_ref_Reference::next(obj) == NULL,
375 // Self-loop next, so as to make Ref not active.
389 // the next field and clearing the discovered field.
398 assert(java_lang_ref_Reference::next(obj) == NULL,
402 // set obj's next to what we read from pending_list_addr.
516 // will dirty the card for the next fiel
638 oop next = java_lang_ref_Reference::next(iter.obj()); local
705 oop next = refs_list.head(); local
997 oop next = java_lang_ref_Reference::next(iter.obj()); local
1165 oop next = java_lang_ref_Reference::next(obj); local
1377 oop next = java_lang_ref_Reference::next(obj); local
[all...]
H A Dallocation.cpp175 Chunk* _first; // first cached Chunk; its first word points to next chunk
189 _first = _first->next();
231 Chunk* next; local
238 for (size_t i = 0; i < (n - 1) && cur != NULL; i++) cur = cur->next();
241 next = cur->next();
243 cur = next;
253 next = cur->next();
255 cur = next;
[all...]
/openjdk7/jdk/src/share/native/java/util/zip/zlib-1.2.3/
H A Dinflate.c62 * - Use local copies of stream next and avail values, as well as local bit
147 state->lencode = state->distcode = state->next = state->codes;
240 static code *next; local
248 next = fixed;
249 lenfix = next;
251 inflate_table(LENS, state->lens, 288, &(next), &(bits), state->work);
256 distfix = next;
258 inflate_table(DISTS, state->lens, 32, &(next), &(bits), state->work);
431 next = strm->next_in; \
442 strm->next_in = next; \
583 unsigned char FAR *next; /* next input */ local
[all...]
/openjdk7/jdk/src/share/back/
H A DoutStream.c46 stream->segment->next = NULL;
120 newHeader->next = NULL;
121 stream->segment->next = newHeader;
418 if (stream->firstSegment.next == NULL) {
432 segment = segment->next;
445 segment = segment->next;
498 struct PacketData *next; local
504 next = stream->firstSegment.next;
505 while (next !
[all...]
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/xml/internal/messaging/saaj/soap/ver1_2/
H A DFault1_2Impl.java151 SOAPElement textElement = (SOAPElement) eachTextElement.next();
240 SOAPElement textElement = (SOAPElement) eachTextElement.next();
258 locale = (Locale) getFaultReasonLocales().next();
273 SOAPElement textElement = (SOAPElement) eachTextElement.next();
336 return ((SOAPElement) codeValues.next()).getValue();
350 (SOAPElement) valueElements.next());
365 (SOAPElement) valueElements.next()));
373 reason = (String) getFaultReasonTexts().next();
430 SOAPElement subcode = (SOAPElement) subcodeElements.next();
443 currentCodeElement = (ElementImpl) subcodeElements.next();
[all...]
/openjdk7/jdk/src/share/classes/javax/management/
H A DObjectName.java847 int next = startKey;
850 while (next < len) {
851 final char k = s[next++];
864 endKey = next-1;
867 if (next < len) continue;
868 else endKey=next;
893 int next = startValue;
901 if (++next == len) throw new
903 while (next < len) {
904 char last = s[next];
[all...]
/openjdk7/jaxp/src/com/sun/org/apache/xerces/internal/dom/
H A DAttrImpl.java544 Node kid, next;
546 for (kid = firstChild; kid != null; kid = next) {
547 next = kid.getNextSibling();
557 if ( next!=null && next.getNodeType() == Node.TEXT_NODE )
559 ((Text)kid).appendData(next.getNodeValue());
560 removeChild( next );
561 next = kid; // Don't advance; there might be another.
722 // juggling so many next/previous pointers. (Wipe out the
923 // next lin
[all...]
/openjdk7/jdk/src/share/classes/java/lang/invoke/
H A DMethodType.java1044 // The next size value at which to resize (capacity * load factor).
1116 Entry next = p.next;
1119 table[i] = next;
1121 prev.next = next;
1122 entry.next = null;
1127 p = next;
1163 e = e.next;
1182 for (Entry e = tab[i]; e != null; e = e.next) {
1265 Entry next; field in class:MethodType.WeakInternSet.Entry
1270 Entry(MethodType key, ReferenceQueue<Object> queue, int hash, Entry next) argument
[all...]
/openjdk7/jdk/src/share/classes/java/util/concurrent/
H A DForkJoinTask.java421 ExceptionNode next; field in class:ForkJoinTask.ExceptionNode
423 ExceptionNode(ForkJoinTask<?> task, Throwable ex, ExceptionNode next) { argument
426 this.next = next;
444 for (ExceptionNode e = t[i]; ; e = e.next) {
471 ExceptionNode next = e.next;
474 t[i] = next;
476 pred.next = next;
[all...]
/openjdk7/jdk/src/share/classes/sun/tools/asm/
H A DInstruction.java46 Instruction next; field in class:Instruction
152 if (lbl == next) {
153 // goto to the next instruction, obsolete
199 if (lbl.next != null && env.opt()) {
200 switch (lbl.next.opc) {
204 opc = lbl.next.opc;
205 value = lbl.next.value;
216 if (value == next) {
217 // branch to next instruction, obsolete
221 if ((next
[all...]
/openjdk7/hotspot/src/share/vm/gc_implementation/g1/
H A DdirtyCardQueue.cpp119 for(JavaThread* t = Threads::first(); t; t = t->next()) {
188 _completed_buffers_head = nd->next();
211 return true; // In normal case, go on to next buffer.
247 nd = nd->next();
258 _completed_buffers_head = nd->next();
268 buffers_to_delete = nd->next();
279 for (JavaThread* t = Threads::first(); t; t = t->next()) {
293 for (JavaThread* t = Threads::first(); t; t = t->next()) {

Completed in 91 milliseconds

<<11121314151617181920>>