Changeset 36083 in webkit for trunk/JavaScriptCore/kjs/PropertyMap.cpp

Timestamp:

Sep 4, 2008, 1:00:04 AM (17 years ago)

Author:

[email protected]

Message:

2008-09-04 Cameron Zwarich <​[email protected]>

Rubber-stamped by Oliver Hunt.

Correct the spelling of 'entryIndices'.

• kjs/PropertyMap.cpp: (KJS::PropertyMap::get): (KJS::PropertyMap::getLocation): (KJS::PropertyMap::put): (KJS::PropertyMap::insert): (KJS::PropertyMap::remove): (KJS::PropertyMap::checkConsistency):
• kjs/PropertyMap.h: (KJS::PropertyMapHashTable::entries): (KJS::PropertyMap::getOffset): (KJS::PropertyMap::putOffset): (KJS::PropertyMap::offsetForTableLocation):

File:

• trunk/JavaScriptCore/kjs/PropertyMap.cpp (modified) (17 diffs)

trunk/JavaScriptCore/kjs/PropertyMap.cpp

@@ -129 +129 @@
 #endif
 
-    unsigned entryIndex = m_u.table->entryIndicies[i & m_u.table->sizeMask];
+    unsigned entryIndex = m_u.table->entryIndices[i & m_u.table->sizeMask];
     if (entryIndex == emptyEntryIndex)
         return 0;
@@ -151 +151 @@
 #endif
 
-        entryIndex = m_u.table->entryIndicies[i & m_u.table->sizeMask];
+        entryIndex = m_u.table->entryIndices[i & m_u.table->sizeMask];
         if (entryIndex == emptyEntryIndex)
             return 0;
@@ -182 +182 @@
 #endif
 
-    unsigned entryIndex = m_u.table->entryIndicies[i & m_u.table->sizeMask];
+    unsigned entryIndex = m_u.table->entryIndices[i & m_u.table->sizeMask];
     if (entryIndex == emptyEntryIndex)
         return 0;
@@ -202 +202 @@
 #endif
 
-        entryIndex = m_u.table->entryIndicies[i & m_u.table->sizeMask];
+        entryIndex = m_u.table->entryIndices[i & m_u.table->sizeMask];
         if (entryIndex == emptyEntryIndex)
             return 0;
@@ -231 +231 @@
 #endif
 
-    unsigned entryIndex = m_u.table->entryIndicies[i & m_u.table->sizeMask];
+    unsigned entryIndex = m_u.table->entryIndices[i & m_u.table->sizeMask];
     if (entryIndex == emptyEntryIndex)
         return 0;
@@ -251 +251 @@
 #endif
 
-        entryIndex = m_u.table->entryIndicies[i & m_u.table->sizeMask];
+        entryIndex = m_u.table->entryIndices[i & m_u.table->sizeMask];
         if (entryIndex == emptyEntryIndex)
             return 0;
@@ -282 +282 @@
 #endif
 
-    unsigned entryIndex = m_u.table->entryIndicies[i & m_u.table->sizeMask];
+    unsigned entryIndex = m_u.table->entryIndices[i & m_u.table->sizeMask];
     if (entryIndex == emptyEntryIndex)
         return 0;
@@ -304 +304 @@
 #endif
 
-        entryIndex = m_u.table->entryIndicies[i & m_u.table->sizeMask];
+        entryIndex = m_u.table->entryIndices[i & m_u.table->sizeMask];
         if (entryIndex == emptyEntryIndex)
             return 0;
@@ -357 +357 @@
 
     while (1) {
-        unsigned entryIndex = m_u.table->entryIndicies[i & m_u.table->sizeMask];
+        unsigned entryIndex = m_u.table->entryIndices[i & m_u.table->sizeMask];
         if (entryIndex == emptyEntryIndex)
             break;
@@ -405 +405 @@
 
     // Create a new hash table entry.
-    m_u.table->entryIndicies[i & m_u.table->sizeMask] = entryIndex;
+    m_u.table->entryIndices[i & m_u.table->sizeMask] = entryIndex;
 
     // Create a new hash table entry.
@@ -434 +434 @@
 
     while (1) {
-        unsigned entryIndex = m_u.table->entryIndicies[i & m_u.table->sizeMask];
+        unsigned entryIndex = m_u.table->entryIndices[i & m_u.table->sizeMask];
         if (entryIndex == emptyEntryIndex)
             break;
@@ -453 +453 @@
 
     unsigned entryIndex = m_u.table->keyCount + 2;
-    m_u.table->entryIndicies[i & m_u.table->sizeMask] = entryIndex;
+    m_u.table->entryIndices[i & m_u.table->sizeMask] = entryIndex;
     m_u.table->entries()[entryIndex - 1] = entry;
     ++m_u.table->keyCount;
@@ -560 +560 @@
     UString::Rep* key = 0;
     while (1) {
-        entryIndex = m_u.table->entryIndicies[i & m_u.table->sizeMask];
+        entryIndex = m_u.table->entryIndices[i & m_u.table->sizeMask];
         if (entryIndex == emptyEntryIndex)
             return;
@@ -584 +584 @@
     // Replace this one element with the deleted sentinel. Also clear out
     // the entry so we can iterate all the entries as needed.
-    m_u.table->entryIndicies[i & m_u.table->sizeMask] = deletedSentinelIndex;
+    m_u.table->entryIndices[i & m_u.table->sizeMask] = deletedSentinelIndex;
     key->deref();
     m_u.table->entries()[entryIndex - 1].key = 0;
@@ -705 +705 @@
     unsigned deletedIndexCount = 0;
     for (unsigned a = 0; a != m_u.table->size; ++a) {
-        unsigned entryIndex = m_u.table->entryIndicies[a];
+        unsigned entryIndex = m_u.table->entryIndices[a];
         if (entryIndex == emptyEntryIndex)
             continue;
@@ -717 +717 @@
 
         for (unsigned b = a + 1; b != m_u.table->size; ++b)
-            ASSERT(m_u.table->entryIndicies[b] != entryIndex);
+            ASSERT(m_u.table->entryIndices[b] != entryIndex);
     }
     ASSERT(indexCount == m_u.table->keyCount);
@@ -736 +736 @@
         unsigned entryIndex;
         while (1) {
-            entryIndex = m_u.table->entryIndicies[i & m_u.table->sizeMask];
+            entryIndex = m_u.table->entryIndices[i & m_u.table->sizeMask];
             ASSERT(entryIndex != emptyEntryIndex);
             if (rep == m_u.table->entries()[entryIndex - 1].key)