Add retry logic to partition alloc

Source/wtf/PartitionAlloc.h

 /*
  * 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 181 matching lines @@
 static const size_t kCookieSize = 16; // Handles alignment up to XMM instructions on Intel.
 #endif
 
 struct PartitionBucket;
 struct PartitionRootBase;
 
 struct PartitionFreelistEntry {
     PartitionFreelistEntry* next;
 };
 
+

[Chris Evans, 2014/11/06 21:43:51]

Nit: looks like a double newline here?

+typedef void (*PartitionFreeUpMemoryCallback)(void);
+
 // Some notes on page states. A page can be in one of three major states:
 // 1) Active.
 // 2) Full.
 // 3) Free.
 // An active page has available free slots. A full page has no free slots. A
 // free page has had its backing memory released back to the system.
 // There are two linked lists tracking the pages. The "active page" list is an
 // approximation of a list of active pages. It is an approximation because both
 // free and full pages may briefly be present in the list until we next do a
 // scan over it. The "free page" list is an accurate list of pages which have
@@ skipping 73 matching lines @@
     // The trailing +1 caters for the overflow case for very large allocation sizes.
     // It is one flat array instead of a 2D array because in the 2D world, we'd
     // need to index array[blah][max+1] which risks undefined behavior.
     PartitionBucket* bucketLookups[((kBitsPerSizet + 1) * kGenericNumBucketsPerOrder) + 1];
     PartitionBucket buckets[kGenericNumBucketedOrders * kGenericNumBucketsPerOrder];
 };
 
 // Flags for partitionAllocGenericFlags.
 enum PartitionAllocFlags {
     PartitionAllocReturnNull = 1 << 0,
+    // If you add a flag here, also update PartitionAllocFlagsInternal.
 };
 
+WTF_EXPORT void partitionSetFreeUpMemoryCallback(PartitionFreeUpMemoryCallback);
+
 WTF_EXPORT void partitionAllocInit(PartitionRoot*, size_t numBuckets, size_t maxAllocation);
 WTF_EXPORT bool partitionAllocShutdown(PartitionRoot*);
 WTF_EXPORT void partitionAllocGenericInit(PartitionRootGeneric*);
 WTF_EXPORT bool partitionAllocGenericShutdown(PartitionRootGeneric*);
 
 WTF_EXPORT NEVER_INLINE void* partitionAllocSlowPath(PartitionRootBase*, int, size_t, PartitionBucket*);
 WTF_EXPORT NEVER_INLINE void partitionFreeSlowPath(PartitionPage*);
 WTF_EXPORT NEVER_INLINE void* partitionReallocGeneric(PartitionRootGeneric*, void*, size_t);
 
 #ifndef NDEBUG
@@ skipping 338 matching lines @@
     ALWAYS_INLINE PartitionRootGeneric* root() { return &m_partitionRoot; }
 private:
     PartitionRootGeneric m_partitionRoot;
 };
 
 } // namespace WTF
 
 using WTF::SizeSpecificPartitionAllocator;
 using WTF::PartitionAllocatorGeneric;
 using WTF::PartitionRoot;
+using WTF::partitionSetFreeUpMemoryCallback;
 using WTF::partitionAllocInit;
 using WTF::partitionAllocShutdown;
 using WTF::partitionAlloc;
 using WTF::partitionFree;
 using WTF::partitionAllocGeneric;
 using WTF::partitionFreeGeneric;
 using WTF::partitionReallocGeneric;
 using WTF::partitionAllocActualSize;
 using WTF::partitionAllocSupportsGetSize;
 using WTF::partitionAllocGetSize;
 
 #endif // WTF_PartitionAlloc_h