Fix method name typo in PartitionAlloc.

Source/wtf/PartitionAlloc.cpp

 /*
  * Copyright (C) 2013 Google Inc. All rights reserved.
  *
  * Redistribution and use in source and binary forms, with or without
  * modification, are permitted provided that the following conditions are
  * met:
  *
  *     * Redistributions of source code must retain the above copyright
  * notice, this list of conditions and the following disclaimer.
  *     * Redistributions in binary form must reproduce the above
@@ skipping 80 matching lines @@
         double wasteRatio = (double) waste / (double) pageSize;
         if (wasteRatio < bestWasteRatio) {
             bestWasteRatio = wasteRatio;
             bestPages = i;
         }
     }
     ASSERT(bestPages > 0);
     return bestPages;
 }
 
-static void parititonAllocBaseInit(PartitionRootBase* root)
+static void partitionAllocBaseInit(PartitionRootBase* root)
 {
     ASSERT(!root->initialized);
 
     spinLockLock(&PartitionRootBase::gInitializedLock);
     if (!PartitionRootBase::gInitialized) {
         PartitionRootBase::gInitialized = true;
         // We mark the seed page as free to make sure it is skipped by our
         // logic to find a new active page.
         PartitionRootBase::gPagedBucket.activePagesHead = &PartitionRootGeneric::gSeedPage;
     }
@@ skipping 21 matching lines @@
 {
     bucket->activePagesHead = &PartitionRootGeneric::gSeedPage;
     bucket->emptyPagesHead = 0;
     bucket->decommittedPagesHead = 0;
     bucket->numFullPages = 0;
     bucket->numSystemPagesPerSlotSpan = partitionBucketNumSystemPages(bucket->slotSize);
 }
 
 void partitionAllocInit(PartitionRoot* root, size_t numBuckets, size_t maxAllocation)
 {
-    parititonAllocBaseInit(root);
+    partitionAllocBaseInit(root);
 
     root->numBuckets = numBuckets;
     root->maxAllocation = maxAllocation;
     size_t i;
     for (i = 0; i < root->numBuckets; ++i) {
         PartitionBucket* bucket = &root->buckets()[i];
         if (!i)
             bucket->slotSize = kAllocationGranularity;
         else
             bucket->slotSize = i << kBucketShift;
         partitionBucketInitBase(bucket, root);
     }
 }
 
 void partitionAllocGenericInit(PartitionRootGeneric* root)
 {
-    parititonAllocBaseInit(root);
+    partitionAllocBaseInit(root);
 
     root->lock = 0;
 
     // Precalculate some shift and mask constants used in the hot path.
     // Example: malloc(41) == 101001 binary.
     // Order is 6 (1 << 6-1)==32 is highest bit set.
     // orderIndex is the next three MSB == 010 == 2.
     // subOrderIndexMask is a mask for the remaining bits == 11 (masking to 01 for the subOrderIndex).
     size_t order;
     for (order = 0; order <= kBitsPerSizet; ++order) {
@@ skipping 1225 matching lines @@
             partitionStats.totalDiscardableBytes += memoryStats[i].discardableBytes;
             if (!isLightDump)
                 partitionStatsDumper->partitionsDumpBucketStats(partitionName, &memoryStats[i]);
         }
     }
     partitionStatsDumper->partitionDumpTotals(partitionName, &partitionStats);
 }
 
 } // namespace WTF