Lines Matching refs:node
373 * Also, scanAndLockForPut speculatively creates a fresh node
374 * to use in put if no node is found.
432 HashEntry<K,V> node = tryLock() ? null :
454 if (node != null)
455 node.setNext(first);
457 node = new HashEntry<K,V>(hash, key, value, first);
460 rehash(node);
462 setEntryAt(tab, index, node);
477 * given node to new table
480 private void rehash(HashEntry<K,V> node) {
485 * power of two offset. We eliminate unnecessary node
509 if (next == null) // Single node on list
535 int nodeIndex = node.hash & sizeMask; // add the new node
536 node.setNext(newTable[nodeIndex]);
537 newTable[nodeIndex] = node;
542 * Scans for a node containing given key while trying to
549 * @return a new node if key not found, else null
554 HashEntry<K,V> node = null;
555 int retries = -1; // negative while locating node
560 if (node == null) // speculatively create node
561 node = new HashEntry<K,V>(hash, key, value, null);
579 return node;
583 * Scans for a node containing the given key while trying to
1331 * Set nextEntry to first node of next non-empty table