jdk/src/share/classes/java/util/WeakHashMap.java
changeset 17949 6c33d8f2601e
parent 17939 bd750ec19d82
child 18166 a24e00a7c5ae
equal deleted inserted replaced
17948:de14cee4b93d 17949:6c33d8f2601e
  1098                 mc = expectedModCount = m.modCount;
  1098                 mc = expectedModCount = m.modCount;
  1099                 hi = fence = tab.length;
  1099                 hi = fence = tab.length;
  1100             }
  1100             }
  1101             else
  1101             else
  1102                 mc = expectedModCount;
  1102                 mc = expectedModCount;
  1103             if (tab.length >= hi && (i = index) >= 0 && i < hi) {
  1103             if (tab.length >= hi && (i = index) >= 0 &&
  1104                 index = hi;
  1104                 (i < (index = hi) || current != null)) {
  1105                 WeakHashMap.Entry<K,V> p = current;
  1105                 WeakHashMap.Entry<K,V> p = current;
       
  1106                 current = null; // exhaust
  1106                 do {
  1107                 do {
  1107                     if (p == null)
  1108                     if (p == null)
  1108                         p = tab[i++];
  1109                         p = tab[i++];
  1109                     else {
  1110                     else {
  1110                         Object x = p.get();
  1111                         Object x = p.get();
  1177                 mc = expectedModCount = m.modCount;
  1178                 mc = expectedModCount = m.modCount;
  1178                 hi = fence = tab.length;
  1179                 hi = fence = tab.length;
  1179             }
  1180             }
  1180             else
  1181             else
  1181                 mc = expectedModCount;
  1182                 mc = expectedModCount;
  1182             if (tab.length >= hi && (i = index) >= 0 && i < hi) {
  1183             if (tab.length >= hi && (i = index) >= 0 &&
  1183                 index = hi;
  1184                 (i < (index = hi) || current != null)) {
  1184                 WeakHashMap.Entry<K,V> p = current;
  1185                 WeakHashMap.Entry<K,V> p = current;
       
  1186                 current = null; // exhaust
  1185                 do {
  1187                 do {
  1186                     if (p == null)
  1188                     if (p == null)
  1187                         p = tab[i++];
  1189                         p = tab[i++];
  1188                     else {
  1190                     else {
  1189                         Object x = p.get();
  1191                         Object x = p.get();
  1254                 mc = expectedModCount = m.modCount;
  1256                 mc = expectedModCount = m.modCount;
  1255                 hi = fence = tab.length;
  1257                 hi = fence = tab.length;
  1256             }
  1258             }
  1257             else
  1259             else
  1258                 mc = expectedModCount;
  1260                 mc = expectedModCount;
  1259             if (tab.length >= hi && (i = index) >= 0 && i < hi) {
  1261             if (tab.length >= hi && (i = index) >= 0 &&
  1260                 index = hi;
  1262                 (i < (index = hi) || current != null)) {
  1261                 WeakHashMap.Entry<K,V> p = current;
  1263                 WeakHashMap.Entry<K,V> p = current;
       
  1264                 current = null; // exhaust
  1262                 do {
  1265                 do {
  1263                     if (p == null)
  1266                     if (p == null)
  1264                         p = tab[i++];
  1267                         p = tab[i++];
  1265                     else {
  1268                     else {
  1266                         Object x = p.get();
  1269                         Object x = p.get();