Lines Matching defs:Node
279 * key-value mapping is held in a Node. Most nodes are instances
280 * of the basic Node class with hash, key, value, and next
296 * list of Nodes (most often, the list has only zero or one Node).
302 * We use the top (sign) bit of Node hash fields for control
589 * Encodings for Node hash fields. See above for explanation.
621 * in bulk tasks. Subclasses of Node with a negative hash field
625 static class Node<K,V> implements Map.Entry<K,V> {
629 volatile Node<K,V> next;
631 Node(int hash, K key, V val, Node<K,V> next) {
660 Node<K,V> find(int h, Object k) {
661 Node<K,V> e = this;
762 static final <K,V> Node<K,V> tabAt(Node<K,V>[] tab, int i) {
763 return (Node<K,V>)U.getObjectVolatile(tab, ((long)i << ASHIFT) + ABASE);
766 static final <K,V> boolean casTabAt(Node<K,V>[] tab, int i,
767 Node<K,V> c, Node<K,V> v) {
771 static final <K,V> void setTabAt(Node<K,V>[] tab, int i, Node<K,V> v) {
781 transient volatile Node<K,V>[] table;
786 private transient volatile Node<K,V>[] nextTable;
943 Node<K,V>[] tab; Node<K,V> e, p; int n, eh; K ek;
988 Node<K,V>[] t;
991 for (Node<K,V> p; (p = it.advance()) != null; ) {
1022 for (Node<K,V>[] tab = table;;) {
1023 Node<K,V> f; int n, i, fh;
1028 new Node<K,V>(hash, key, value, null)))
1039 for (Node<K,V> e = f;; ++binCount) {
1049 Node<K,V> pred = e;
1051 pred.next = new Node<K,V>(hash, key,
1058 Node<K,V> p;
1117 for (Node<K,V>[] tab = table;;) {
1118 Node<K,V> f; int n, i, fh;
1131 for (Node<K,V> e = f, pred = null;;) {
1194 Node<K,V>[] tab = table;
1197 Node<K,V> f = tabAt(tab, i);
1207 Node<K,V> p = (fh >= 0 ? f :
1304 Node<K,V>[] t;
1307 for (Node<K,V> p; (p = it.advance()) != null; )
1325 Node<K,V>[] t;
1330 Node<K,V> p;
1361 Node<K,V>[] t;
1364 for (Node<K,V> p; (p = it.advance()) != null; ) {
1425 Node<K,V>[] t;
1428 for (Node<K,V> p; (p = it.advance()) != null; ) {
1456 Node<K,V> p = null;
1463 p = new Node<K,V>(spread(k.hashCode()), k, v, p);
1480 Node<K,V>[] tab = (Node<K,V>[])new Node<?,?>[n];
1485 Node<K,V> next = p.next, first;
1500 Node<K,V> q; K qk;
1609 Node<K,V>[] t;
1612 for (Node<K,V> p; (p = it.advance()) != null; ) {
1620 Node<K,V>[] t;
1623 for (Node<K,V> p; (p = it.advance()) != null; ) {
1642 Node<K,V>[] t;
1646 for (Node<K,V> p; (p = it.advance()) != null; ) {
1662 Node<K,V>[] t;
1666 for (Node<K,V> p; (p = it.advance()) != null; ) {
1704 for (Node<K,V>[] tab = table;;) {
1705 Node<K,V> f; int n, i, fh;
1709 Node<K,V> r = new ReservationNode<K,V>();
1713 Node<K,V> node = null;
1716 node = new Node<K,V>(h, key, val, null);
1733 for (Node<K,V> e = f;; ++binCount) {
1741 Node<K,V> pred = e;
1747 pred.next = new Node<K,V>(h, key, val, null);
1810 for (Node<K,V>[] tab = table;;) {
1811 Node<K,V> f; int n, i, fh;
1823 for (Node<K,V> e = f, pred = null;; ++binCount) {
1833 Node<K,V> en = e.next;
1903 for (Node<K,V>[] tab = table;;) {
1904 Node<K,V> f; int n, i, fh;
1908 Node<K,V> r = new ReservationNode<K,V>();
1912 Node<K,V> node = null;
1916 node = new Node<K,V>(h, key, val, null);
1933 for (Node<K,V> e = f, pred = null;; ++binCount) {
1943 Node<K,V> en = e.next;
1959 new Node<K,V>(h, key, val, null);
2032 for (Node<K,V>[] tab = table;;) {
2033 Node<K,V> f; int n, i, fh;
2037 if (casTabAt(tab, i, null, new Node<K,V>(h, key, value, null))) {
2050 for (Node<K,V> e = f, pred = null;; ++binCount) {
2060 Node<K,V> en = e.next;
2073 new Node<K,V>(h, key, val, null);
2145 Node<K,V>[] t;
2157 Node<K,V>[] t;
2231 static final class ForwardingNode<K,V> extends Node<K,V> {
2232 final Node<K,V>[] nextTable;
2233 ForwardingNode(Node<K,V>[] tab) {
2238 Node<K,V> find(int h, Object k) {
2240 outer: for (Node<K,V>[] tab = nextTable;;) {
2241 Node<K,V> e; int n;
2268 static final class ReservationNode<K,V> extends Node<K,V> {
2273 Node<K,V> find(int h, Object k) {
2291 private final Node<K,V>[] initTable() {
2292 Node<K,V>[] tab; int sc;
2301 Node<K,V>[] nt = (Node<K,V>[])new Node<?,?>[n];
2342 Node<K,V>[] tab, nt; int n, sc;
2365 final Node<K,V>[] helpTransfer(Node<K,V>[] tab, Node<K,V> f) {
2366 Node<K,V>[] nextTab; int sc;
2395 Node<K,V>[] tab = table; int n;
2402 Node<K,V>[] nt = (Node<K,V>[])new Node<?,?>[n];
2426 private final void transfer(Node<K,V>[] tab, Node<K,V>[] nextTab) {
2433 Node<K,V>[] nt = (Node<K,V>[])new Node<?,?>[n << 1];
2447 Node<K,V> f; int fh;
2487 Node<K,V> ln, hn;
2490 Node<K,V> lastRun = f;
2491 for (Node<K,V> p = f.next; p != null; p = p.next) {
2506 for (Node<K,V> p = f; p != lastRun; p = p.next) {
2509 ln = new Node<K,V>(ph, pk, pv, ln);
2511 hn = new Node<K,V>(ph, pk, pv, hn);
2523 for (Node<K,V> e = t.first; e != null; e = e.next) {
2671 private final void treeifyBin(Node<K,V>[] tab, int index) {
2672 Node<K,V> b; int n;
2680 for (Node<K,V> e = b; e != null; e = e.next) {
2700 static <K,V> Node<K,V> untreeify(Node<K,V> b) {
2701 Node<K,V> hd = null, tl = null;
2702 for (Node<K,V> q = b; q != null; q = q.next) {
2703 Node<K,V> p = new Node<K,V>(q.hash, q.key, q.val, null);
2718 static final class TreeNode<K,V> extends Node<K,V> {
2725 TreeNode(int hash, K key, V val, Node<K,V> next,
2731 Node<K,V> find(int h, Object k) {
2778 static final class TreeBin<K,V> extends Node<K,V> {
2896 final Node<K,V> find(int h, Object k) {
2898 for (Node<K,V> e = first; e != null; ) {
3325 Node<K,V>[] tab;
3351 Node<K,V>[] tab; // current table; updated if resized
3352 Node<K,V> next; // the next entry to use
3359 Traverser(Node<K,V>[] tab, int size, int index, int limit) {
3370 final Node<K,V> advance() {
3371 Node<K,V> e;
3375 Node<K,V>[] t; int i, n; // must use locals in checks
3403 private void pushState(Node<K,V>[] t, int i, int n) {
3444 Node<K,V> lastReturned;
3445 BaseIterator(Node<K,V>[] tab, int size, int index, int limit,
3456 Node<K,V> p;
3466 KeyIterator(Node<K,V>[] tab, int index, int size, int limit,
3472 Node<K,V> p;
3486 ValueIterator(Node<K,V>[] tab, int index, int size, int limit,
3492 Node<K,V> p;
3506 EntryIterator(Node<K,V>[] tab, int index, int size, int limit,
3512 Node<K,V> p;
3571 KeySpliterator(Node<K,V>[] tab, int size, int index, int limit,
3586 for (Node<K,V> p; (p = advance()) != null;)
3592 Node<K,V> p;
3610 ValueSpliterator(Node<K,V>[] tab, int size, int index, int limit,
3625 for (Node<K,V> p; (p = advance()) != null;)
3631 Node<K,V> p;
3649 EntrySpliterator(Node<K,V>[] tab, int size, int index, int limit,
3665 for (Node<K,V> p; (p = advance()) != null; )
3671 Node<K,V> p;
4634 Node<K,V>[] t;
4695 Node<K,V>[] t;
4704 Node<K,V>[] t;
4707 for (Node<K,V> p; (p = it.advance()) != null; )
4740 Node<K,V>[] t;
4757 Node<K,V>[] t;
4766 Node<K,V>[] t;
4769 for (Node<K,V> p; (p = it.advance()) != null; )
4807 Node<K,V>[] t;
4831 Node<K,V>[] t;
4834 for (Node<K,V> p; (p = it.advance()) != null; ) {
4849 Node<K,V>[] t;
4858 Node<K,V>[] t;
4861 for (Node<K,V> p; (p = it.advance()) != null; )
4876 Node<K,V>[] tab; // same as Traverser
4877 Node<K,V> next;
4885 BulkTask(BulkTask<K,V,?> par, int b, int i, int f, Node<K,V>[] t) {
4902 final Node<K,V> advance() {
4903 Node<K,V> e;
4907 Node<K,V>[] t; int i, n;
4932 private void pushState(Node<K,V>[] t, int i, int n) {
4974 (BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
4989 for (Node<K,V> p; (p = advance()) != null;)
5001 (BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5016 for (Node<K,V> p; (p = advance()) != null;)
5028 (BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5043 for (Node<K,V> p; (p = advance()) != null; )
5055 (BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5070 for (Node<K,V> p; (p = advance()) != null; )
5083 (BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5100 for (Node<K,V> p; (p = advance()) != null; ) {
5116 (BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5133 for (Node<K,V> p; (p = advance()) != null; ) {
5149 (BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5166 for (Node<K,V> p; (p = advance()) != null; ) {
5182 (BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5200 for (Node<K,V> p; (p = advance()) != null; ) {
5216 (BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5239 Node<K,V> p;
5260 (BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5283 Node<K,V> p;
5304 (BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5327 Node<K,V> p;
5348 (BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5371 Node<K,V> p;
5393 (BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5411 for (Node<K,V> p; (p = advance()) != null; ) {
5441 (BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5459 for (Node<K,V> p; (p = advance()) != null; ) {
5489 (BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5507 for (Node<K,V> p; (p = advance()) != null; )
5536 (BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5558 for (Node<K,V> p; (p = advance()) != null; ) {
5590 (BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5612 for (Node<K,V> p; (p = advance()) != null; ) {
5644 (BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5666 for (Node<K,V> p; (p = advance()) != null; ) {
5698 (BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5720 for (Node<K,V> p; (p = advance()) != null; ) {
5753 (BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5776 for (Node<K,V> p; (p = advance()) != null; )
5803 (BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5826 for (Node<K,V> p; (p = advance()) != null; )
5853 (BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5876 for (Node<K,V> p; (p = advance()) != null; )
5903 (BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5926 for (Node<K,V> p; (p = advance()) != null; )
5953 (BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5976 for (Node<K,V> p; (p = advance()) != null; )
6003 (BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
6026 for (Node<K,V> p; (p = advance()) != null; )
6053 (BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
6076 for (Node<K,V> p; (p = advance()) != null; )
6103 (BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
6126 for (Node<K,V> p; (p = advance()) != null; )
6153 (BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
6176 for (Node<K,V> p; (p = advance()) != null; )
6203 (BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
6226 for (Node<K,V> p; (p = advance()) != null; )
6253 (BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
6276 for (Node<K,V> p; (p = advance()) != null; )
6303 (BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
6326 for (Node<K,V> p; (p = advance()) != null; )
6368 ABASE = U.arrayBaseOffset(Node[].class);
6369 int scale = U.arrayIndexScale(Node[].class);