| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 2013 Google Inc. All rights reserved. | 2 * Copyright (C) 2013 Google Inc. All rights reserved. |
| 3 * | 3 * |
| 4 * Redistribution and use in source and binary forms, with or without | 4 * Redistribution and use in source and binary forms, with or without |
| 5 * modification, are permitted provided that the following conditions are | 5 * modification, are permitted provided that the following conditions are |
| 6 * met: | 6 * met: |
| 7 * | 7 * |
| 8 * * Redistributions of source code must retain the above copyright | 8 * * Redistributions of source code must retain the above copyright |
| 9 * notice, this list of conditions and the following disclaimer. | 9 * notice, this list of conditions and the following disclaimer. |
| 10 * * Redistributions in binary form must reproduce the above | 10 * * Redistributions in binary form must reproduce the above |
| (...skipping 550 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 561 state->visitPersistents(visitor); | 561 state->visitPersistents(visitor); |
| 562 } | 562 } |
| 563 | 563 |
| 564 void ThreadHeap::visitStackRoots(Visitor* visitor) { | 564 void ThreadHeap::visitStackRoots(Visitor* visitor) { |
| 565 ASSERT(ThreadState::current()->isInGC()); | 565 ASSERT(ThreadState::current()->isInGC()); |
| 566 TRACE_EVENT0("blink_gc", "ThreadHeap::visitStackRoots"); | 566 TRACE_EVENT0("blink_gc", "ThreadHeap::visitStackRoots"); |
| 567 for (ThreadState* state : m_threads) | 567 for (ThreadState* state : m_threads) |
| 568 state->visitStack(visitor); | 568 state->visitStack(visitor); |
| 569 } | 569 } |
| 570 | 570 |
| 571 void ThreadHeap::checkAndPark(ThreadState* threadState, | |
| 572 SafePointAwareMutexLocker* locker) { | |
| 573 m_safePointBarrier->checkAndPark(threadState, locker); | |
| 574 } | |
| 575 | |
| 576 void ThreadHeap::enterSafePoint(ThreadState* threadState) { | 571 void ThreadHeap::enterSafePoint(ThreadState* threadState) { |
| 577 m_safePointBarrier->enterSafePoint(threadState); | 572 m_safePointBarrier->enterSafePoint(threadState); |
| 578 } | 573 } |
| 579 | 574 |
| 580 void ThreadHeap::leaveSafePoint(ThreadState* threadState, | 575 void ThreadHeap::leaveSafePoint(ThreadState* threadState, |
| 581 SafePointAwareMutexLocker* locker) { | 576 SafePointAwareMutexLocker* locker) { |
| 582 m_safePointBarrier->leaveSafePoint(threadState, locker); | 577 m_safePointBarrier->leaveSafePoint(threadState, locker); |
| 583 } | 578 } |
| 584 | 579 |
| 585 BasePage* ThreadHeap::lookupPageForAddress(Address address) { | 580 BasePage* ThreadHeap::lookupPageForAddress(Address address) { |
| (...skipping 13 matching lines...) Expand all Loading... |
| 599 ProcessHeap::decreaseTotalMarkedObjectSize(m_stats.markedObjectSize()); | 594 ProcessHeap::decreaseTotalMarkedObjectSize(m_stats.markedObjectSize()); |
| 600 | 595 |
| 601 m_stats.reset(); | 596 m_stats.reset(); |
| 602 for (ThreadState* state : m_threads) | 597 for (ThreadState* state : m_threads) |
| 603 state->resetHeapCounters(); | 598 state->resetHeapCounters(); |
| 604 } | 599 } |
| 605 | 600 |
| 606 ThreadHeap* ThreadHeap::s_mainThreadHeap = nullptr; | 601 ThreadHeap* ThreadHeap::s_mainThreadHeap = nullptr; |
| 607 | 602 |
| 608 } // namespace blink | 603 } // namespace blink |
| OLD | NEW |