Changeset 53320 in webkit for trunk/JavaScriptCore/runtime/Structure.cpp
- Timestamp:
- Jan 14, 2010, 10:43:21 PM (15 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
trunk/JavaScriptCore/runtime/Structure.cpp
r53170 r53320 304 304 ASSERT(m_propertyTable); 305 305 306 unsigned i = rep-> computedHash();306 unsigned i = rep->existingHash(); 307 307 308 308 #if DUMP_PROPERTYMAP_STATS … … 322 322 #endif 323 323 324 unsigned k = 1 | doubleHash(rep-> computedHash());324 unsigned k = 1 | doubleHash(rep->existingHash()); 325 325 326 326 while (1) { … … 687 687 return notFound; 688 688 689 unsigned i = rep-> computedHash();689 unsigned i = rep->existingHash(); 690 690 691 691 #if DUMP_PROPERTYMAP_STATS … … 707 707 #endif 708 708 709 unsigned k = 1 | doubleHash(rep-> computedHash());709 unsigned k = 1 | doubleHash(rep->existingHash()); 710 710 711 711 while (1) { … … 738 738 UString::Rep* rep = propertyName._ustring.rep(); 739 739 740 unsigned i = rep-> computedHash();740 unsigned i = rep->existingHash(); 741 741 742 742 #if DUMP_PROPERTYMAP_STATS … … 758 758 #endif 759 759 760 unsigned k = 1 | doubleHash(rep-> computedHash());760 unsigned k = 1 | doubleHash(rep->existingHash()); 761 761 762 762 while (1) { … … 807 807 // FIXME: Consider a fast case for tables with no deleted sentinels. 808 808 809 unsigned i = rep-> computedHash();809 unsigned i = rep->existingHash(); 810 810 unsigned k = 0; 811 811 bool foundDeletedElement = false; … … 830 830 831 831 if (k == 0) { 832 k = 1 | doubleHash(rep-> computedHash());832 k = 1 | doubleHash(rep->existingHash()); 833 833 #if DUMP_PROPERTYMAP_STATS 834 834 ++numCollisions; … … 910 910 911 911 // Find the thing to remove. 912 unsigned i = rep-> computedHash();912 unsigned i = rep->existingHash(); 913 913 unsigned k = 0; 914 914 unsigned entryIndex; … … 924 924 925 925 if (k == 0) { 926 k = 1 | doubleHash(rep-> computedHash());926 k = 1 | doubleHash(rep->existingHash()); 927 927 #if DUMP_PROPERTYMAP_STATS 928 928 ++numCollisions; … … 968 968 ASSERT(m_propertyTable); 969 969 970 unsigned i = entry.key-> computedHash();970 unsigned i = entry.key->existingHash(); 971 971 unsigned k = 0; 972 972 … … 981 981 982 982 if (k == 0) { 983 k = 1 | doubleHash(entry.key-> computedHash());983 k = 1 | doubleHash(entry.key->existingHash()); 984 984 #if DUMP_PROPERTYMAP_STATS 985 985 ++numCollisions; … … 1179 1179 continue; 1180 1180 ++nonEmptyEntryCount; 1181 unsigned i = rep-> computedHash();1181 unsigned i = rep->existingHash(); 1182 1182 unsigned k = 0; 1183 1183 unsigned entryIndex; … … 1188 1188 break; 1189 1189 if (k == 0) 1190 k = 1 | doubleHash(rep-> computedHash());1190 k = 1 | doubleHash(rep->existingHash()); 1191 1191 i += k; 1192 1192 }
Note:
See TracChangeset
for help on using the changeset viewer.