/macosx-10.9.5/JavaScriptCore-7537.78.1/heap/ |
H A D | WeakSet.h | 64 DoublyLinkedList<WeakBlock> m_blocks; member in class:JSC::WeakSet 82 for (WeakBlock* block = m_blocks.head(); block; block = block->next()) { 97 for (WeakBlock* block = m_blocks.head(); block; block = block->next()) 103 for (WeakBlock* block = m_blocks.head(); block; block = block->next()) 109 for (WeakBlock* block = m_blocks.head(); block; block = block->next()) 116 for (WeakBlock* block = m_blocks.head(); block; block = next) { 129 m_nextAllocator = m_blocks.head();
|
H A D | WeakSet.cpp | 37 for (WeakBlock* block = m_blocks.head(); block; block = next) { 41 m_blocks.clear(); 46 for (WeakBlock* block = m_blocks.head(); block; block = block->next()) 78 m_blocks.append(block); 86 m_blocks.remove(block);
|
H A D | ConservativeRoots.cpp | 43 , m_blocks(blocks) 74 ASSERT(!candidate || !m_blocks->set().contains(candidate)); 81 if (!m_blocks->set().contains(candidate)) 101 TinyBloomFilter filter = m_blocks->filter(); // Make a local copy of filter to show the compiler it won't alias, and can be register-allocated.
|
H A D | MarkedSpace.h | 86 MarkedBlockSet& blocks() { return m_blocks; } 138 MarkedBlockSet m_blocks; member in class:JSC::MarkedSpace 145 BlockIterator end = m_blocks.set().end(); 146 for (BlockIterator it = m_blocks.set().begin(); it != end; ++it) 161 BlockIterator end = m_blocks.set().end(); 162 for (BlockIterator it = m_blocks.set().begin(); it != end; ++it) 247 m_blocks.add(block);
|
H A D | ConservativeRoots.h | 67 const MarkedBlockSet* m_blocks; member in class:JSC::ConservativeRoots
|
H A D | MarkedSpace.cpp | 47 DoublyLinkedList<MarkedBlock> m_blocks; member in class:JSC::Free 66 return m_blocks.head(); 198 m_blocks.remove(block);
|
H A D | Heap.h | 276 , m_blocks(blocks) 280 void operator()(MarkedBlock* block) { m_blocks[m_index++] = block; } 283 Vector<MarkedBlock*>& m_blocks; member in struct:JSC::MarkedBlockSnapshotFunctor
|
/macosx-10.9.5/JavaScriptCore-7537.78.1/dfg/ |
H A D | DFGDominators.cpp | 48 ASSERT(graph.m_blocks[0]->m_predecessors.isEmpty()); 50 unsigned numBlocks = graph.m_blocks.size(); 64 if (!graph.m_blocks[i]) 70 if (!graph.m_blocks[i] || graph.m_blocks[i]->m_predecessors.isEmpty()) 94 BasicBlock* block = graph.m_blocks[i].get();
|
H A D | DFGCFGSimplificationPhase.cpp | 57 for (BlockIndex blockIndex = 0; blockIndex < m_graph.m_blocks.size(); ++blockIndex) { 58 BasicBlock* block = m_graph.m_blocks[blockIndex].get(); 66 if (m_graph.m_blocks[m_graph.successor(block, 0)]->m_predecessors.size() == 1) { 67 ASSERT(m_graph.m_blocks[m_graph.successor(block, 0)]->m_predecessors[0] 83 for (unsigned i = 0; i < m_graph.m_blocks[m_graph.successor(block, 0)]->m_predecessors.size(); ++i) { 86 dataLogF("#%u", m_graph.m_blocks[m_graph.successor(block, 0)]->m_predecessors[i]); 106 BasicBlock* targetBlock = m_graph.m_blocks[ 152 BasicBlock* targetBlock = m_graph.m_blocks[targetBlockIndex].get(); 231 for (BlockIndex blockIndex = 0; blockIndex < m_graph.m_blocks.size(); ++blockIndex) { 232 BasicBlock* block = m_graph.m_blocks[blockInde [all...] |
H A D | DFGDCEPhase.cpp | 49 for (BlockIndex blockIndex = 0; blockIndex < m_graph.m_blocks.size(); ++blockIndex) { 50 BasicBlock* block = m_graph.m_blocks[blockIndex].get(); 63 for (BlockIndex blockIndex = 0; blockIndex < m_graph.m_blocks.size(); ++blockIndex) { 64 BasicBlock* block = m_graph.m_blocks[blockIndex].get(); 84 for (BlockIndex blockIndex = 0; blockIndex < m_graph.m_blocks.size(); ++blockIndex) { 85 BasicBlock* block = m_graph.m_blocks[blockIndex].get();
|
H A D | DFGPredictionInjectionPhase.cpp | 65 for (BlockIndex blockIndex = 0; blockIndex < m_graph.m_blocks.size(); ++blockIndex) { 66 BasicBlock* block = m_graph.m_blocks[blockIndex].get();
|
H A D | DFGUnificationPhase.cpp | 51 for (BlockIndex blockIndex = m_graph.m_blocks.size(); blockIndex--;) { 52 BasicBlock* block = m_graph.m_blocks[blockIndex].get();
|
H A D | DFGCFAPhase.cpp | 80 BasicBlock* block = m_graph.m_blocks[blockIndex].get(); 127 for (BlockIndex block = 0; block < m_graph.m_blocks.size(); ++block)
|
H A D | DFGGraph.cpp | 279 BasicBlock* block = m_blocks[blockIndex].get(); 288 for (size_t i = 0; i < m_blocks.size(); ++i) { 295 for (size_t i = 0; i < m_blocks.size(); ++i) { 334 for (size_t b = 0; b < m_blocks.size(); ++b) { 335 BasicBlock* block = m_blocks[b].get(); 375 for (BlockIndex blockIndex = m_blocks.size(); blockIndex--;) { 376 BasicBlock* block = m_blocks[blockIndex].get(); 390 BasicBlock* successor = m_blocks[successorIndex].get(); 403 m_blocks[0]->isReachable = true; 408 BasicBlock* block = m_blocks[inde [all...] |
H A D | DFGTypeCheckHoistingPhase.cpp | 64 for (BlockIndex blockIndex = 0; blockIndex < m_graph.m_blocks.size(); ++blockIndex) { 65 BasicBlock* block = m_graph.m_blocks[blockIndex].get(); 191 for (BlockIndex blockIndex = 0; blockIndex < m_graph.m_blocks.size(); ++blockIndex) { 192 BasicBlock* block = m_graph.m_blocks[blockIndex].get(); 253 for (BlockIndex blockIndex = 0; blockIndex < m_graph.m_blocks.size(); ++blockIndex) { 254 BasicBlock* block = m_graph.m_blocks[blockIndex].get();
|
H A D | DFGVirtualRegisterAllocationPhase.cpp | 56 for (size_t blockIndex = 0; blockIndex < m_graph.m_blocks.size(); ++blockIndex) { 57 BasicBlock* block = m_graph.m_blocks[blockIndex].get();
|
H A D | DFGDisassembler.cpp | 39 m_labelForBlockIndex.resize(graph.m_blocks.size()); 99 for (size_t blockIndex = 0; blockIndex < m_graph.m_blocks.size(); ++blockIndex) { 100 BasicBlock* block = m_graph.m_blocks[blockIndex].get(); 120 if (blockIndex + 1 < m_graph.m_blocks.size())
|
H A D | DFGArgumentsSimplificationPhase.cpp | 142 for (BlockIndex blockIndex = 0; blockIndex < m_graph.m_blocks.size(); ++blockIndex) { 143 BasicBlock* block = m_graph.m_blocks[blockIndex].get(); 164 for (BlockIndex blockIndex = 0; blockIndex < m_graph.m_blocks.size(); ++blockIndex) { 165 BasicBlock* block = m_graph.m_blocks[blockIndex].get(); 351 for (BlockIndex blockIndex = 0; blockIndex < m_graph.m_blocks.size(); ++blockIndex) { 352 BasicBlock* block = m_graph.m_blocks[blockIndex].get(); 427 for (BlockIndex blockIndex = 0; blockIndex < m_graph.m_blocks.size(); ++blockIndex) { 428 BasicBlock* block = m_graph.m_blocks[blockIndex].get(); 659 for (BlockIndex blockIndex = 0; blockIndex < m_graph.m_blocks.size(); ++blockIndex) { 660 BasicBlock* block = m_graph.m_blocks[blockInde [all...] |
H A D | DFGValidate.cpp | 79 BasicBlock* root = m_graph.m_blocks[0].get(); 85 for (BlockIndex blockIndex = 0; blockIndex < m_graph.m_blocks.size(); ++blockIndex) { 86 BasicBlock* block = m_graph.m_blocks[blockIndex].get(); 93 for (BlockIndex blockIndex = 0; blockIndex < m_graph.m_blocks.size(); ++blockIndex) { 94 BasicBlock* block = m_graph.m_blocks[blockIndex].get(); 160 for (BlockIndex blockIndex = 0; blockIndex < m_graph.m_blocks.size(); ++blockIndex) { 161 BasicBlock* block = m_graph.m_blocks[blockIndex].get(); 229 BasicBlock* prevBlock = m_graph.m_blocks[block->m_predecessors[k]].get(); 371 BasicBlock* block = m_graph.m_blocks[blockIndex].get();
|
H A D | DFGCPSRethreadingPhase.cpp | 72 for (BlockIndex blockIndex = m_graph.m_blocks.size(); blockIndex--;) { 73 BasicBlock* block = m_graph.m_blocks[blockIndex].get(); 390 for (m_blockIndex = m_graph.m_blocks.size(); m_blockIndex--;) { 391 m_block = m_graph.m_blocks[m_blockIndex].get(); 418 BasicBlock* predecessorBlock = m_graph.m_blocks[predecessors[i]].get();
|
H A D | DFGByteCodeParser.cpp | 1316 for (size_t i = 0; i < m_graph.m_blocks.size(); ++i) 1317 m_graph.m_blocks[i]->ensureLocals(newNumLocals); 1323 this, codeBlock, codeBlock, m_graph.m_blocks.size() - 1, 1346 if (inlineStackEntry.m_callsiteBlockHead != m_graph.m_blocks.size() - 1) { 1350 linkBlock(m_graph.m_blocks[inlineStackEntry.m_callsiteBlockHead].get(), inlineStackEntry.m_blockLinkingTargets); 1352 ASSERT(m_graph.m_blocks[inlineStackEntry.m_callsiteBlockHead]->isLinked); 1373 BasicBlock* lastBlock = m_graph.m_blocks.last().get(); 1389 m_inlineStackTop->m_caller->m_unlinkedBlocks.append(UnlinkedBlock(m_graph.m_blocks.size() - 1)); 1392 m_currentBlock = m_graph.m_blocks.last().get(); 1407 BasicBlock* block = m_graph.m_blocks[inlineStackEntr [all...] |
H A D | DFGPredictionPropagationPhase.cpp | 574 for (BlockIndex blockIndex = 0; blockIndex < m_graph.m_blocks.size(); ++blockIndex) { 575 BasicBlock* block = m_graph.m_blocks[blockIndex].get(); 591 for (BlockIndex blockIndex = m_graph.m_blocks.size(); blockIndex--;) { 592 BasicBlock* block = m_graph.m_blocks[blockIndex].get(); 716 for (BlockIndex blockIndex = 0; blockIndex < m_graph.m_blocks.size(); ++blockIndex) { 717 BasicBlock* block = m_graph.m_blocks[blockIndex].get();
|
H A D | DFGConstantFoldingPhase.cpp | 55 for (BlockIndex blockIndex = 0; blockIndex < m_graph.m_blocks.size(); ++blockIndex) { 56 BasicBlock* block = m_graph.m_blocks[blockIndex].get(); 74 BasicBlock* block = m_graph.m_blocks[blockIndex].get(); 426 BasicBlock* block = m_graph.m_blocks[blockIndex].get();
|
H A D | DFGBackwardsPropagationPhase.cpp | 47 for (BlockIndex blockIndex = 0; blockIndex < m_graph.m_blocks.size(); ++blockIndex) { 48 BasicBlock* block = m_graph.m_blocks[blockIndex].get();
|
H A D | DFGAbstractState.cpp | 86 BasicBlock* root = graph.m_blocks[0].get(); 118 for (BlockIndex blockIndex = 1 ; blockIndex < graph.m_blocks.size(); ++blockIndex) { 119 BasicBlock* block = graph.m_blocks[blockIndex].get(); 1765 return merge(basicBlock, graph.m_blocks[terminal->takenBlockIndex()].get()); 1775 changed |= merge(basicBlock, graph.m_blocks[terminal->takenBlockIndex()].get()); 1780 changed |= merge(basicBlock, graph.m_blocks[terminal->notTakenBlockIndex()].get());
|