Lines Matching defs:index
183 * index. The downside of optimizing index selection in this way
318 * The maximum slot index being used. The value sometimes
339 int index = hashIndex(); // Index of current slot
344 Slot slot = arena[index];
346 createSlot(index); // Continue loop to reread
357 if (index == 0) // Blocking wait for slot 0
366 if (m > (index >>>= 1)) // Decrease index
372 index = m + 1; // Grow on 3rd failed slot
373 else if (--index < 0)
374 index = m; // Circularly traverse
380 * Returns a hash index for the current thread. Uses a one-step
386 * <p>To return an index between 0 and max, we use a cheap
399 * @return a per-thread-random index, 0 <= index < max
409 int index;
410 while ((index = hash & ((1 << nbits) - 1)) > m) // May retry on
412 return index;
416 * Creates a new slot at given index. Called only when the slot
421 * @param index the index to add slot at
423 private void createSlot(int index) {
428 if (a[index] == null)
429 a[index] = newSlot;
510 * Waits for (at index 0) and gets the hole filled in by another