# | Line 50 | Line 50 | public class ConcurrentQueueLoops { | |
---|---|---|
50 | Thread.sleep(100); | |
51 | print = true; | |
52 | ||
53 | < | int k = 1; |
54 | < | for (int i = 1; i <= maxStages;) { |
53 | > | for (int k = 1, i = 1; i <= maxStages;) { |
54 | oneRun(klass, i); | |
55 | if (i == k) { | |
56 | k = i << 1; | |
# | Line 76 | Line 75 | public class ConcurrentQueueLoops { | |
75 | static int compute(int l) { | |
76 | if (l == 0) | |
77 | return (int) System.nanoTime(); | |
78 | < | int nn = (l >>> 7) & workMask; |
78 | > | int nn = (l >>> 7) & workMask; |
79 | while (nn-- > 0) | |
80 | l = LoopHelpers.compute6(l); | |
81 | return l; |
– | Removed lines |
+ | Added lines |
< | Changed lines |
> | Changed lines |