Searched refs:top (Results 1 – 3 of 3) sorted by relevance
638 int top; // index of next slot for push field in ForkJoinPool.WorkQueue656 base = top = INITIAL_QUEUE_CAPACITY >>> 1; in WorkQueue()663 int n = base - top; // non-owner callers must read base first in queueSize()674 int n = base - (s = top); in isEmpty()692 int s = top, n; in push()696 if ((n = (top = s + 1) - base) <= 2) in push()716 (t = top) - (b = base) > 0) { in growArray()738 for (int s; (s = top - 1) - base >= 0;) { in pop()743 top = s; in pop()774 while ((b = base) - top < 0 && (a = array) != null) { in poll()[all …]
128 a->top = 8 / BN_BYTES; in NativeBN_putULongInt()215 ret->top = wlen; in NativeBN_litEndInts2bn()225 ret->top = 0; in NativeBN_litEndInts2bn()248 ret->top = wLen; in negBigEndianBytes2bn()321 int wLen = a->top; in NativeBN_longInt()393 int wLen = a->top; in NativeBN_bn2litEndInts()436 int wLen = a->top; in NativeBN_bitLength()
2408 public static final int top = 0; field in R