1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857
|
/*
* Copyright (c) 2005, 2007, Google Inc. All rights reserved.
* Copyright (C) 2005-2018 Apple 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:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY
* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
* OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "config.h"
#include <wtf/FastMalloc.h>
#include <string.h>
#include <wtf/CheckedArithmetic.h>
#if OS(DARWIN)
#include <malloc/malloc.h>
#endif
#if OS(WINDOWS)
#include <windows.h>
#else
#if HAVE(RESOURCE_H)
#include <sys/resource.h>
#endif // HAVE(RESOURCE_H)
#endif
#if ENABLE(MALLOC_HEAP_BREAKDOWN)
#include <wtf/Atomics.h>
#include <wtf/HashMap.h>
#include <wtf/Lock.h>
#include <wtf/NeverDestroyed.h>
#include <wtf/SetForScope.h>
#include <wtf/StackShot.h>
#if PLATFORM(COCOA)
#include <notify.h>
#endif
#endif
namespace WTF {
#if !defined(NDEBUG)
namespace {
// We do not use std::numeric_limits<size_t>::max() here due to the edge case in VC++.
// https://bugs.webkit.org/show_bug.cgi?id=173720
static size_t maxSingleAllocationSize = SIZE_MAX;
};
void fastSetMaxSingleAllocationSize(size_t size)
{
maxSingleAllocationSize = size;
}
#if ASSERT_ENABLED
#define ASSERT_IS_WITHIN_LIMIT(size) do { \
size_t size__ = (size); \
ASSERT_WITH_MESSAGE((size__) <= maxSingleAllocationSize, "Requested size (%zu) exceeds max single allocation size set for testing (%zu)", (size__), maxSingleAllocationSize); \
} while (false)
#else
#define ASSERT_IS_WITHIN_LIMIT(size)
#endif // ASSERT_ENABLED
#define FAIL_IF_EXCEEDS_LIMIT(size) do { \
if (UNLIKELY((size) > maxSingleAllocationSize)) \
return nullptr; \
} while (false)
#else // !defined(NDEBUG)
#define ASSERT_IS_WITHIN_LIMIT(size)
#define FAIL_IF_EXCEEDS_LIMIT(size)
#endif // !defined(NDEBUG)
WTF_ALLOW_UNSAFE_BUFFER_USAGE_BEGIN
char* fastStrDup(const char* src)
{
size_t len = strlen(src) + 1;
char* dup = static_cast<char*>(fastMalloc(len));
memcpy(dup, src, len);
return dup;
}
void* fastMemDup(const void* mem, size_t bytes)
{
if (!mem || !bytes)
return nullptr;
void* result = fastMalloc(bytes);
memcpy(result, mem, bytes);
return result;
}
char* fastCompactStrDup(const char* src)
{
size_t len = strlen(src) + 1;
char* dup = static_cast<char*>(fastCompactMalloc(len));
memcpy(dup, src, len);
return dup;
}
void* fastCompactMemDup(const void* mem, size_t bytes)
{
if (!mem || !bytes)
return nullptr;
void* result = fastCompactMalloc(bytes);
memcpy(result, mem, bytes);
return result;
}
WTF_ALLOW_UNSAFE_BUFFER_USAGE_END
} // namespace WTF
#if USE(SYSTEM_MALLOC)
#include <wtf/OSAllocator.h>
#if OS(WINDOWS)
#include <malloc.h>
#endif
namespace WTF {
bool isFastMallocEnabled()
{
return false;
}
size_t fastMallocGoodSize(size_t bytes)
{
#if OS(DARWIN)
return malloc_good_size(bytes);
#else
return bytes;
#endif
}
#if OS(WINDOWS)
void* fastAlignedMalloc(size_t alignment, size_t size)
{
ASSERT_IS_WITHIN_LIMIT(size);
void* p = _aligned_malloc(size, alignment);
if (UNLIKELY(!p))
CRASH();
return p;
}
void* tryFastAlignedMalloc(size_t alignment, size_t size)
{
FAIL_IF_EXCEEDS_LIMIT(size);
return _aligned_malloc(size, alignment);
}
void fastAlignedFree(void* p)
{
_aligned_free(p);
}
#else
void* fastAlignedMalloc(size_t alignment, size_t size)
{
ASSERT_IS_WITHIN_LIMIT(size);
void* p = aligned_alloc(alignment, size);
if (UNLIKELY(!p))
CRASH();
return p;
}
void* tryFastAlignedMalloc(size_t alignment, size_t size)
{
FAIL_IF_EXCEEDS_LIMIT(size);
return aligned_alloc(alignment, size);
}
void fastAlignedFree(void* p)
{
free(p);
}
#endif // OS(WINDOWS)
TryMallocReturnValue tryFastMalloc(size_t n)
{
FAIL_IF_EXCEEDS_LIMIT(n);
assertMallocRestrictionForCurrentThreadScope();
return malloc(n);
}
void* fastMalloc(size_t n)
{
ASSERT_IS_WITHIN_LIMIT(n);
assertMallocRestrictionForCurrentThreadScope();
void* result = malloc(n);
if (!result)
CRASH();
return result;
}
void* fastZeroedMalloc(size_t n)
{
void* result = fastMalloc(n);
memset(result, 0, n);
return result;
}
TryMallocReturnValue tryFastZeroedMalloc(size_t n)
{
void* result;
if (!tryFastMalloc(n).getValue(result))
return nullptr;
memset(result, 0, n);
return result;
}
TryMallocReturnValue tryFastCalloc(size_t n_elements, size_t element_size)
{
FAIL_IF_EXCEEDS_LIMIT(n_elements * element_size);
assertMallocRestrictionForCurrentThreadScope();
return calloc(n_elements, element_size);
}
void* fastCalloc(size_t n_elements, size_t element_size)
{
ASSERT_IS_WITHIN_LIMIT(n_elements * element_size);
assertMallocRestrictionForCurrentThreadScope();
void* result = calloc(n_elements, element_size);
if (!result)
CRASH();
return result;
}
void fastFree(void* p)
{
free(p);
}
void* fastRealloc(void* p, size_t n)
{
ASSERT_IS_WITHIN_LIMIT(n);
assertMallocRestrictionForCurrentThreadScope();
void* result = realloc(p, n);
if (!result)
CRASH();
return result;
}
TryMallocReturnValue tryFastRealloc(void* p, size_t n)
{
FAIL_IF_EXCEEDS_LIMIT(n);
assertMallocRestrictionForCurrentThreadScope();
return realloc(p, n);
}
void releaseFastMallocFreeMemory() { }
void releaseFastMallocFreeMemoryForThisThread() { }
FastMallocStatistics fastMallocStatistics()
{
FastMallocStatistics statistics = { 0, 0, 0 };
return statistics;
}
size_t fastMallocSize(const void* p)
{
#if OS(DARWIN)
return malloc_size(p);
#elif OS(WINDOWS)
return _msize(const_cast<void*>(p));
#else
UNUSED_PARAM(p);
return 1;
#endif
}
void fastCommitAlignedMemory(void* ptr, size_t size)
{
OSAllocator::commit(ptr, size, true, false);
}
void fastDecommitAlignedMemory(void* ptr, size_t size)
{
OSAllocator::decommit(ptr, size);
}
void fastEnableMiniMode(bool) { }
void fastDisableScavenger() { }
void fastMallocDumpMallocStats() { }
void* fastCompactMalloc(size_t size) { return fastMalloc(size); }
void* fastCompactZeroedMalloc(size_t size) { return fastZeroedMalloc(size); }
void* fastCompactCalloc(size_t numElements, size_t elementSize) { return fastCalloc(numElements, elementSize); }
void* fastCompactRealloc(void* ptr, size_t size) { return fastRealloc(ptr, size); }
TryMallocReturnValue tryFastCompactMalloc(size_t size) { return tryFastMalloc(size); }
TryMallocReturnValue tryFastCompactZeroedMalloc(size_t size) { return tryFastZeroedMalloc(size); }
TryMallocReturnValue tryFastCompactCalloc(size_t numElements, size_t elementSize) { return tryFastCalloc(numElements, elementSize); }
TryMallocReturnValue tryFastCompactRealloc(void* ptr, size_t size) { return tryFastRealloc(ptr, size); }
void* fastCompactAlignedMalloc(size_t alignment, size_t size) { return fastAlignedMalloc(alignment, size); }
void* tryFastCompactAlignedMalloc(size_t alignment, size_t size) { return tryFastAlignedMalloc(alignment, size); }
} // namespace WTF
#else // USE(SYSTEM_MALLOC)
#include <bmalloc/bmalloc.h>
namespace WTF {
#define TRACK_MALLOC_CALLSTACK 0
#if ENABLE(MALLOC_HEAP_BREAKDOWN) && TRACK_MALLOC_CALLSTACK
static ThreadSpecificKey avoidRecordingCountKey { InvalidThreadSpecificKey };
class AvoidRecordingScope {
public:
AvoidRecordingScope();
~AvoidRecordingScope();
static uintptr_t avoidRecordingCount()
{
return std::bit_cast<uintptr_t>(threadSpecificGet(avoidRecordingCountKey));
}
};
AvoidRecordingScope::AvoidRecordingScope()
{
static std::once_flag onceKey;
std::call_once(onceKey, [] {
// The value stored in TLS is initially 0.
threadSpecificKeyCreate(&avoidRecordingCountKey, [](void*) { });
});
threadSpecificSet(avoidRecordingCountKey, std::bit_cast<void*>(avoidRecordingCount() + 1));
}
AvoidRecordingScope::~AvoidRecordingScope()
{
threadSpecificSet(avoidRecordingCountKey, std::bit_cast<void*>(avoidRecordingCount() - 1));
}
class MallocCallTracker {
public:
MallocCallTracker();
void recordMalloc(void*, size_t);
void recordRealloc(void* oldAddress, void* newAddress, size_t);
void recordFree(void*);
void dumpStats();
static MallocCallTracker& singleton();
private:
struct MallocSiteData {
StackShot stack;
size_t size;
MallocSiteData(size_t stackSize, size_t allocationSize)
: stack(stackSize)
, size(allocationSize)
{
}
};
Lock m_lock;
HashMap<void*, std::unique_ptr<MallocSiteData>> m_addressMallocSiteData WTF_GUARDED_BY_LOCK(m_lock);
};
MallocCallTracker& MallocCallTracker::singleton()
{
AvoidRecordingScope avoidRecording;
static LazyNeverDestroyed<MallocCallTracker> tracker;
static std::once_flag onceKey;
std::call_once(onceKey, [&] {
tracker.construct();
});
return tracker;
}
MallocCallTracker::MallocCallTracker()
{
int token;
notify_register_dispatch("com.apple.WebKit.dumpUntrackedMallocs", &token, dispatch_get_main_queue(), ^(int) {
MallocCallTracker::singleton().dumpStats();
});
}
void MallocCallTracker::recordMalloc(void* address, size_t allocationSize)
{
AvoidRecordingScope avoidRecording;
// Intentionally using std::make_unique not to use FastMalloc for data structure tracking FastMalloc.
const size_t stackSize = 10;
auto siteData = std::make_unique<MallocSiteData>(stackSize, allocationSize);
Locker locker { m_lock };
auto addResult = m_addressMallocSiteData.add(address, WTFMove(siteData));
UNUSED_PARAM(addResult);
}
void MallocCallTracker::recordRealloc(void* oldAddress, void* newAddress, size_t newSize)
{
AvoidRecordingScope avoidRecording;
Locker locker { m_lock };
auto it = m_addressMallocSiteData.find(oldAddress);
if (it == m_addressMallocSiteData.end()) {
ASSERT_NOT_REACHED();
return;
}
it->value->size = newSize;
if (oldAddress != newAddress) {
auto value = WTFMove(it->value);
m_addressMallocSiteData.remove(it);
auto addResult = m_addressMallocSiteData.add(newAddress, WTFMove(value));
ASSERT_UNUSED(addResult, addResult.isNewEntry);
}
}
void MallocCallTracker::recordFree(void* address)
{
AvoidRecordingScope avoidRecording;
Locker locker { m_lock };
bool removed = m_addressMallocSiteData.remove(address);
UNUSED_PARAM(removed);
}
void MallocCallTracker::dumpStats()
{
AvoidRecordingScope avoidRecording;
{
Locker locker { m_lock };
// Build a hash of stack to address vector
struct MallocSiteTotals {
Vector<MallocSiteData*> siteData;
size_t count { 0 };
size_t totalSize { 0 };
};
size_t totalUntrackedSize = 0;
size_t totalUntrackedCount = 0;
HashMap<unsigned, std::unique_ptr<MallocSiteTotals>> callSiteToMallocData;
for (const auto& it : m_addressMallocSiteData) {
auto result = callSiteToMallocData.ensure(it.value->stack.hash(), [] () {
// Intentionally using std::make_unique not to use FastMalloc for data structure tracking FastMalloc.
return std::make_unique<MallocSiteTotals>();
});
auto& siteTotal = result.iterator->value;
siteTotal->siteData.append(it.value.get());
++siteTotal->count;
siteTotal->totalSize += it.value->size;
totalUntrackedSize += it.value->size;
++totalUntrackedCount;
}
Vector<unsigned> stackHashes;
auto stackKeys = callSiteToMallocData.keys();
for (auto key : stackKeys)
stackHashes.append(key);
// Sort by reverse total size.
std::sort(stackHashes.begin(), stackHashes.end(), [&] (unsigned a, unsigned b) {
const auto& aSiteTotals = callSiteToMallocData.get(a);
const auto& bSiteTotals = callSiteToMallocData.get(b);
return aSiteTotals->totalSize > bSiteTotals->totalSize;
});
WTFLogAlways("Total untracked bytes: %lu (%lu allocations)\n", totalUntrackedSize, totalUntrackedCount);
const size_t numStacksToDump = 100;
for (size_t i = 0; i < std::min(numStacksToDump, stackHashes.size()); ++i) {
const auto& mallocDataForStack = callSiteToMallocData.get(stackHashes[i]);
WTFLogAlways("Total allocation size: %lu (%lu allocations)\n", mallocDataForStack->totalSize, mallocDataForStack->count);
// FIXME: Add a way to remove some entries in StackShot in a programable way.
// https://bugs.webkit.org/show_bug.cgi?id=205701
const size_t framesToSkip = 6;
WTFPrintBacktrace(mallocDataForStack->siteData[0]->stack.span().subspan(framesToSkip));
WTFLogAlways("\n");
}
}
}
void fastMallocDumpMallocStats()
{
MallocCallTracker::singleton().dumpStats();
}
#else
void fastMallocDumpMallocStats()
{
}
#endif
bool isFastMallocEnabled()
{
return bmalloc::api::isEnabled();
}
void* fastMalloc(size_t size)
{
ASSERT_IS_WITHIN_LIMIT(size);
assertMallocRestrictionForCurrentThreadScope();
void* result = bmalloc::api::malloc(size, bmalloc::CompactAllocationMode::NonCompact);
#if ENABLE(MALLOC_HEAP_BREAKDOWN) && TRACK_MALLOC_CALLSTACK
if (!AvoidRecordingScope::avoidRecordingCount())
MallocCallTracker::singleton().recordMalloc(result, size);
#endif
BPROFILE_ALLOCATION(NON_JS_CELL, result, size);
return result;
}
void* fastZeroedMalloc(size_t size)
{
ASSERT_IS_WITHIN_LIMIT(size);
assertMallocRestrictionForCurrentThreadScope();
void* result = bmalloc::api::zeroedMalloc(size, bmalloc::CompactAllocationMode::NonCompact);
#if ENABLE(MALLOC_HEAP_BREAKDOWN) && TRACK_MALLOC_CALLSTACK
if (!AvoidRecordingScope::avoidRecordingCount())
MallocCallTracker::singleton().recordMalloc(result, size);
#endif
BPROFILE_ALLOCATION(NON_JS_CELL, result, size);
return result;
}
TryMallocReturnValue tryFastZeroedMalloc(size_t size)
{
FAIL_IF_EXCEEDS_LIMIT(size);
assertMallocRestrictionForCurrentThreadScope();
void* result = bmalloc::api::tryZeroedMalloc(size, bmalloc::CompactAllocationMode::NonCompact);
BPROFILE_TRY_ALLOCATION(NON_JS_CELL, result, size);
return result;
}
void* fastCalloc(size_t numElements, size_t elementSize)
{
ASSERT_IS_WITHIN_LIMIT(numElements * elementSize);
Checked<size_t> checkedSize = elementSize;
checkedSize *= numElements;
void* result = fastZeroedMalloc(checkedSize);
if (!result)
CRASH();
BPROFILE_ALLOCATION(NON_JS_CELL, result, checkedSize);
return result;
}
void* fastRealloc(void* object, size_t size)
{
ASSERT_IS_WITHIN_LIMIT(size);
assertMallocRestrictionForCurrentThreadScope();
void* result = bmalloc::api::realloc(object, size, bmalloc::CompactAllocationMode::NonCompact);
#if ENABLE(MALLOC_HEAP_BREAKDOWN) && TRACK_MALLOC_CALLSTACK
if (!AvoidRecordingScope::avoidRecordingCount())
MallocCallTracker::singleton().recordRealloc(object, result, size);
#endif
BPROFILE_ALLOCATION(NON_JS_CELL, result, size);
return result;
}
void fastFree(void* object)
{
bmalloc::api::free(object);
#if ENABLE(MALLOC_HEAP_BREAKDOWN) && TRACK_MALLOC_CALLSTACK
if (!AvoidRecordingScope::avoidRecordingCount())
MallocCallTracker::singleton().recordFree(object);
#endif
}
size_t fastMallocSize(const void* p)
{
#if BENABLE(MALLOC_SIZE)
return bmalloc::api::mallocSize(p);
#else
// FIXME: This is incorrect; best fix is probably to remove this function.
// Caller currently are all using this for assertion, not to actually check
// the size of the allocation, so maybe we can come up with something for that.
UNUSED_PARAM(p);
return 1;
#endif
}
size_t fastMallocGoodSize(size_t size)
{
#if BENABLE(MALLOC_GOOD_SIZE)
return bmalloc::api::mallocGoodSize(size);
#else
return size;
#endif
}
void* fastAlignedMalloc(size_t alignment, size_t size)
{
ASSERT_IS_WITHIN_LIMIT(size);
assertMallocRestrictionForCurrentThreadScope();
void* result = bmalloc::api::memalign(alignment, size, bmalloc::CompactAllocationMode::NonCompact);
#if ENABLE(MALLOC_HEAP_BREAKDOWN) && TRACK_MALLOC_CALLSTACK
if (!AvoidRecordingScope::avoidRecordingCount())
MallocCallTracker::singleton().recordMalloc(result, size);
#endif
BPROFILE_ALLOCATION(NON_JS_CELL, result, size);
return result;
}
void* tryFastAlignedMalloc(size_t alignment, size_t size)
{
FAIL_IF_EXCEEDS_LIMIT(size);
assertMallocRestrictionForCurrentThreadScope();
void* result = bmalloc::api::tryMemalign(alignment, size, bmalloc::CompactAllocationMode::NonCompact);
#if ENABLE(MALLOC_HEAP_BREAKDOWN) && TRACK_MALLOC_CALLSTACK
if (!AvoidRecordingScope::avoidRecordingCount())
MallocCallTracker::singleton().recordMalloc(result, size);
#endif
BPROFILE_TRY_ALLOCATION(NON_JS_CELL, result, size);
return result;
}
void fastAlignedFree(void* p)
{
bmalloc::api::free(p);
}
TryMallocReturnValue tryFastMalloc(size_t size)
{
FAIL_IF_EXCEEDS_LIMIT(size);
assertMallocRestrictionForCurrentThreadScope();
void* result = bmalloc::api::tryMalloc(size, bmalloc::CompactAllocationMode::NonCompact);
BPROFILE_TRY_ALLOCATION(NON_JS_CELL, result, size);
return result;
}
TryMallocReturnValue tryFastCalloc(size_t numElements, size_t elementSize)
{
FAIL_IF_EXCEEDS_LIMIT(numElements * elementSize);
CheckedSize checkedSize = elementSize;
checkedSize *= numElements;
if (checkedSize.hasOverflowed())
return nullptr;
return tryFastZeroedMalloc(checkedSize);
}
TryMallocReturnValue tryFastRealloc(void* object, size_t newSize)
{
FAIL_IF_EXCEEDS_LIMIT(newSize);
assertMallocRestrictionForCurrentThreadScope();
void* result = bmalloc::api::tryRealloc(object, newSize, bmalloc::CompactAllocationMode::NonCompact);
BPROFILE_TRY_ALLOCATION(NON_JS_CELL, result, newSize);
return result;
}
void* fastCompactMalloc(size_t size)
{
ASSERT_IS_WITHIN_LIMIT(size);
assertMallocRestrictionForCurrentThreadScope();
void* result = bmalloc::api::malloc(size, bmalloc::CompactAllocationMode::Compact);
#if ENABLE(MALLOC_HEAP_BREAKDOWN) && TRACK_MALLOC_CALLSTACK
if (!AvoidRecordingScope::avoidRecordingCount())
MallocCallTracker::singleton().recordMalloc(result, size);
#endif
BPROFILE_ALLOCATION(COMPACTIBLE, result, size);
return result;
}
void* fastCompactZeroedMalloc(size_t size)
{
ASSERT_IS_WITHIN_LIMIT(size);
assertMallocRestrictionForCurrentThreadScope();
void* result = bmalloc::api::zeroedMalloc(size, bmalloc::CompactAllocationMode::Compact);
#if ENABLE(MALLOC_HEAP_BREAKDOWN) && TRACK_MALLOC_CALLSTACK
if (!AvoidRecordingScope::avoidRecordingCount())
MallocCallTracker::singleton().recordMalloc(result, size);
#endif
BPROFILE_ALLOCATION(COMPACTIBLE, result, size);
return result;
}
TryMallocReturnValue tryFastCompactZeroedMalloc(size_t size)
{
FAIL_IF_EXCEEDS_LIMIT(size);
assertMallocRestrictionForCurrentThreadScope();
return bmalloc::api::tryZeroedMalloc(size, bmalloc::CompactAllocationMode::Compact);
}
void* fastCompactCalloc(size_t numElements, size_t elementSize)
{
ASSERT_IS_WITHIN_LIMIT(numElements * elementSize);
Checked<size_t> checkedSize = elementSize;
checkedSize *= numElements;
void* result = fastZeroedMalloc(checkedSize);
if (!result)
CRASH();
BPROFILE_ALLOCATION(COMPACTIBLE, result, elementSize);
return result;
}
void* fastCompactRealloc(void* object, size_t size)
{
ASSERT_IS_WITHIN_LIMIT(size);
assertMallocRestrictionForCurrentThreadScope();
void* result = bmalloc::api::realloc(object, size, bmalloc::CompactAllocationMode::Compact);
#if ENABLE(MALLOC_HEAP_BREAKDOWN) && TRACK_MALLOC_CALLSTACK
if (!AvoidRecordingScope::avoidRecordingCount())
MallocCallTracker::singleton().recordRealloc(object, result, size);
#endif
BPROFILE_ALLOCATION(COMPACTIBLE, result, size);
return result;
}
void* fastCompactAlignedMalloc(size_t alignment, size_t size)
{
ASSERT_IS_WITHIN_LIMIT(size);
assertMallocRestrictionForCurrentThreadScope();
void* result = bmalloc::api::memalign(alignment, size, bmalloc::CompactAllocationMode::Compact);
#if ENABLE(MALLOC_HEAP_BREAKDOWN) && TRACK_MALLOC_CALLSTACK
if (!AvoidRecordingScope::avoidRecordingCount())
MallocCallTracker::singleton().recordMalloc(result, size);
#endif
BPROFILE_ALLOCATION(COMPACTIBLE, result, size);
return result;
}
void* tryFastCompactAlignedMalloc(size_t alignment, size_t size)
{
FAIL_IF_EXCEEDS_LIMIT(size);
assertMallocRestrictionForCurrentThreadScope();
void* result = bmalloc::api::tryMemalign(alignment, size, bmalloc::CompactAllocationMode::Compact);
#if ENABLE(MALLOC_HEAP_BREAKDOWN) && TRACK_MALLOC_CALLSTACK
if (!AvoidRecordingScope::avoidRecordingCount())
MallocCallTracker::singleton().recordMalloc(result, size);
#endif
BPROFILE_ALLOCATION(COMPACTIBLE, result, size);
return result;
}
TryMallocReturnValue tryFastCompactMalloc(size_t size)
{
FAIL_IF_EXCEEDS_LIMIT(size);
assertMallocRestrictionForCurrentThreadScope();
void* result = bmalloc::api::tryMalloc(size, bmalloc::CompactAllocationMode::Compact);
BPROFILE_ALLOCATION(COMPACTIBLE, result, size);
return result;
}
TryMallocReturnValue tryFastCompactCalloc(size_t numElements, size_t elementSize)
{
FAIL_IF_EXCEEDS_LIMIT(numElements * elementSize);
CheckedSize checkedSize = elementSize;
checkedSize *= numElements;
if (checkedSize.hasOverflowed())
return nullptr;
return tryFastCompactZeroedMalloc(checkedSize);
}
TryMallocReturnValue tryFastCompactRealloc(void* object, size_t newSize)
{
FAIL_IF_EXCEEDS_LIMIT(newSize);
assertMallocRestrictionForCurrentThreadScope();
void* result = bmalloc::api::tryRealloc(object, newSize, bmalloc::CompactAllocationMode::Compact);
BPROFILE_ALLOCATION(COMPACTIBLE, result, newSize);
return result;
}
void releaseFastMallocFreeMemoryForThisThread()
{
bmalloc::api::scavengeThisThread();
}
void releaseFastMallocFreeMemory()
{
bmalloc::api::scavenge();
}
FastMallocStatistics fastMallocStatistics()
{
// FIXME: Can bmalloc itself report the stats instead of relying on the OS?
FastMallocStatistics statistics;
statistics.freeListBytes = 0;
statistics.reservedVMBytes = 0;
#if OS(WINDOWS)
PROCESS_MEMORY_COUNTERS resourceUsage;
GetProcessMemoryInfo(GetCurrentProcess(), &resourceUsage, sizeof(resourceUsage));
statistics.committedVMBytes = resourceUsage.PeakWorkingSetSize;
#elif HAVE(RESOURCE_H)
struct rusage resourceUsage;
getrusage(RUSAGE_SELF, &resourceUsage);
#if OS(DARWIN)
statistics.committedVMBytes = resourceUsage.ru_maxrss;
#else
statistics.committedVMBytes = resourceUsage.ru_maxrss * 1024;
#endif // OS(DARWIN)
#endif // OS(WINDOWS)
return statistics;
}
void fastCommitAlignedMemory(void* ptr, size_t size)
{
bmalloc::api::commitAlignedPhysical(ptr, size);
}
void fastDecommitAlignedMemory(void* ptr, size_t size)
{
bmalloc::api::decommitAlignedPhysical(ptr, size);
}
void fastEnableMiniMode(bool forceMiniMode)
{
bmalloc::api::enableMiniMode(forceMiniMode);
}
void fastDisableScavenger()
{
bmalloc::api::disableScavenger();
}
void forceEnablePGM(uint16_t guardMallocRate)
{
bmalloc::api::forceEnablePGM(guardMallocRate);
}
} // namespace WTF
#endif // USE(SYSTEM_MALLOC)
|