Searched refs:trip (Results 1 - 5 of 5) sorted by relevance
/openjdk7/jdk/src/share/classes/java/util/concurrent/ |
H A D | CyclicBarrier.java | 151 private final Condition trip = lock.newCondition(); field in class:CyclicBarrier 167 * Updates state on barrier trip and wakes up everyone. 172 trip.signalAll(); 185 trip.signalAll(); 227 trip.await(); 229 nanos = trip.awaitNanos(nanos); 259 * Creates a new <tt>CyclicBarrier</tt> that will trip when the 278 * Creates a new <tt>CyclicBarrier</tt> that will trip when the 291 * Returns the number of parties required to trip this barrier. 293 * @return the number of parties required to trip thi [all...] |
/openjdk7/hotspot/src/share/vm/opto/ |
H A D | loopTransform.cpp | 67 // Compute loop exact trip count if possible. Do not recalculate trip count for 100 // Set exact trip count. 107 // Compute loop trip count from profile data as 562 // Calculate exact loop trip count and return true if loop can be maximally 576 // Note, max_juint is used to indicate unknown trip count. 650 // over the expected trip count of the loop. One is subtracted 651 // from the expected trip count because the pre-loop normally 661 // the residual iterations are more than 10% of the trip count 735 // Unroll once! (Each trip wil 1371 Node *trip = new (C) DivINode( 0, span, stride ); local [all...] |
H A D | node.cpp | 1549 int trip = 10; local 1558 if (trip-- <= 0) break;
|
H A D | loopnode.cpp | 311 // Find the trip-counter increment & limit. Limit must be loop invariant. 319 if (!is_member(loop, get_ctrl(incr))) { // Swapped trip counter and limit? 334 return false; // Not simple trip counter expression 365 return false; // Too much math on the trip counter 470 // to be adjusted to keep trip count the same and the 542 // to be adjusted to keep trip count the same and we 586 // trip-count for +-tive stride should be: (limit - init_trip + stride - 1)/stride. 685 // Build a canonical trip test. 950 Node *trip = phase->transform(new (phase->C) DivINode(0, bias, in(Stride))); local 951 Node *span = phase->transform(new (phase->C) MulINode(trip, i 979 Node *trip = phase->transform(new (phase->C) DivLNode(0, bias, stride)); local [all...] |
H A D | memnode.cpp | 1001 for (int trip = 0; trip <= 1; trip++) { 1053 continue; // take one more trip around 3537 // Undo the effects of the previous loop trip, which swallowed st:
|
Completed in 51 milliseconds