Home
last modified time | relevance | path

Searched refs:m_blocks (Results 1 – 10 of 10) sorted by relevance

/external/webkit/Source/JavaScriptCore/wtf/
DBlockStack.h48 Vector<T*> m_blocks;
61 for (size_t i = 0; i < m_blocks.size(); ++i) in ~BlockStack()
62 free(m_blocks[i]); in ~BlockStack()
67 return m_blocks; in blocks()
75 m_blocks.append(block); in grow()
81 ASSERT(newEnd != m_blocks.last() + blockLength); in shrink()
82 m_spareBlock = m_blocks.last(); in shrink()
83 m_blocks.removeLast(); in shrink()
85 while (m_blocks.last() + blockLength != newEnd) { in shrink()
86 free(m_blocks.last()); in shrink()
[all …]
/external/webkit/Source/JavaScriptCore/heap/
DMarkedSpace.cpp58 m_blocks.add(block); in allocateBlock()
70 m_blocks.remove(block); in freeBlocks()
95 BlockIterator end = m_blocks.end(); in shrink()
96 for (BlockIterator it = m_blocks.begin(); it != end; ++it) { in shrink()
112 BlockIterator end = m_blocks.end(); in clearMarks()
113 for (BlockIterator it = m_blocks.begin(); it != end; ++it) in clearMarks()
119 BlockIterator end = m_blocks.end(); in sweep()
120 for (BlockIterator it = m_blocks.begin(); it != end; ++it) in sweep()
127 BlockIterator end = m_blocks.end(); in objectCount()
128 for (BlockIterator it = m_blocks.begin(); it != end; ++it) in objectCount()
[all …]
DMarkedSpace.h114 HashSet<MarkedBlock*> m_blocks; variable
146 if (!block || !m_blocks.contains(block)) in contains()
154 BlockIterator end = m_blocks.end(); in forEach()
155 for (BlockIterator it = m_blocks.begin(); it != end; ++it) in forEach()
/external/webkit/Source/JavaScriptCore/dfg/
DDFGGraph.h92 Vector<BasicBlock> m_blocks; variable
96 BasicBlock* begin = m_blocks.begin(); in blockIndexForBytecodeOffset()
97 …binarySearch<BasicBlock, unsigned, BasicBlock::getBytecodeBegin>(begin, m_blocks.size(), bytecodeB… in blockIndexForBytecodeOffset()
98 ASSERT(block >= m_blocks.begin() && block < m_blocks.end()); in blockIndexForBytecodeOffset()
DDFGGraph.cpp127 for (size_t b = 0; b < m_blocks.size(); ++b) { in dump()
129 BasicBlock& block = m_blocks[b]; in dump()
DDFGNonSpeculativeJIT.cpp681 Vector<BasicBlock> blocks = m_jit.graph().m_blocks; in compile()
DDFGJITCodeGenerator.h154 , m_blockHeads(jit.graph().m_blocks.size()) in JITCodeGenerator()
DDFGSpeculativeJIT.cpp813 Vector<BasicBlock> blocks = m_jit.graph().m_blocks; in compile()
DDFGByteCodeParser.cpp1025 m_graph.m_blocks.append(BasicBlock(bytecodeBegin, begin, end)); in parse()
/external/emma/core/java12/com/vladium/emma/instr/
DInstrVisitor.java979 blocks.m_blocks.add (block); in visit()
1034 final Block [] _blocks = (Block []) blocks.m_blocks.toArray (new Block [blockCount]); in visit()
1401 m_blocks = new ArrayList (); in BlockList()
1406 m_blocks = new ArrayList (capacity); in BlockList()
1409 final List /* Block */ m_blocks; // TODO: might as well use an array here? field in InstrVisitor.BlockList
1467 m_blocks = blocks; in EmitCtx()
1473 final BlockList m_blocks; field in InstrVisitor.EmitCtx
1506 … final int jumpOffset = ((Block) ctx.m_blocks.m_blocks.get (targetBlockID)).m_first - ip; in emitJumpOffset2()
1530 … final int jumpOffset = ((Block) ctx.m_blocks.m_blocks.get (targetBlockID)).m_first - ip; in emitJumpOffset4()