HomeSort by relevance Sort by last modified time
    Searched defs:m_blocks (Results 1 - 5 of 5) sorted by null

  /external/webkit/Source/JavaScriptCore/dfg/
DFGGraph.h 92 Vector<BasicBlock> m_blocks; member in class:JSC::DFG::Graph
96 BasicBlock* begin = m_blocks.begin();
97 BasicBlock* block = binarySearch<BasicBlock, unsigned, BasicBlock::getBytecodeBegin>(begin, m_blocks.size(), bytecodeBegin);
98 ASSERT(block >= m_blocks.begin() && block < m_blocks.end());
  /external/webkit/Source/JavaScriptCore/wtf/
BlockStack.h 48 Vector<T*> m_blocks; member in class:WTF::BlockStack
61 for (size_t i = 0; i < m_blocks.size(); ++i)
62 free(m_blocks[i]);
67 return m_blocks;
75 m_blocks.append(block);
81 ASSERT(newEnd != m_blocks.last() + blockLength);
82 m_spareBlock = m_blocks.last();
83 m_blocks.removeLast();
85 while (m_blocks.last() + blockLength != newEnd) {
86 free(m_blocks.last())
    [all...]
  /external/webkit/Source/JavaScriptCore/heap/
MarkedSpace.h 114 HashSet<MarkedBlock*> m_blocks; member in class:JSC::MarkedSpace
146 if (!block || !m_blocks.contains(block))
154 BlockIterator end = m_blocks.end();
155 for (BlockIterator it = m_blocks.begin(); it != end; ++it)
  /external/emma/core/java12/com/vladium/emma/instr/
InstrVisitor.java 1409 final List \/* Block *\/ m_blocks; \/\/ TODO: might as well use an array here? field in class:InstrVisitor.BlockList
1473 final BlockList m_blocks; field in class:InstrVisitor.EmitCtx
    [all...]
  /external/emma/lib/
emma.jar 

Completed in 110 milliseconds