Searched refs:m_graph (Results 1 - 25 of 28) sorted by relevance

12

/macosx-10.9.5/JavaScriptCore-7537.78.1/dfg/
H A DDFGPhase.cpp41 m_graph.dump();
48 validate(m_graph, DumpGraph);
H A DDFGCFGSimplificationPhase.cpp57 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]
71 blockIndex, m_graph.successor(block, 0));
74 m_graph.dump();
75 m_graph.dethread();
76 mergeBlocks(blockIndex, m_graph
[all...]
H A DDFGPredictionInjectionPhase.cpp47 ASSERT(m_graph.m_form == ThreadedCPS);
48 ASSERT(m_graph.m_unificationState == GloballyUnified);
56 m_graph.m_arguments[arg]->variableAccessData()->predict(profile->computeUpdatedPrediction());
61 SpeculationDump(m_graph.m_arguments[arg]->variableAccessData()->prediction()), "\n");
65 for (BlockIndex blockIndex = 0; blockIndex < m_graph.m_blocks.size(); ++blockIndex) {
66 BasicBlock* block = m_graph.m_blocks[blockIndex].get();
71 if (block->bytecodeBegin != m_graph.m_osrEntryBytecodeIndex)
73 for (size_t i = 0; i < m_graph.m_mustHandleValues.size(); ++i) {
75 m_graph.m_mustHandleValues.operandForIndex(i));
80 speculationFromValue(m_graph
[all...]
H A DDFGPhase.h41 : m_graph(graph)
58 Graph& m_graph; member in class:JSC::DFG::Phase
60 VM& vm() { return m_graph.m_vm; }
61 CodeBlock* codeBlock() { return m_graph.m_codeBlock; }
62 CodeBlock* profiledBlock() { return m_graph.m_profiledBlock; }
H A DDFGUnificationPhase.cpp47 ASSERT(m_graph.m_form == ThreadedCPS);
48 ASSERT(m_graph.m_unificationState == LocallyUnified);
51 for (BlockIndex blockIndex = m_graph.m_blocks.size(); blockIndex--;) {
52 BasicBlock* block = m_graph.m_blocks[blockIndex].get();
70 for (unsigned i = 0; i < m_graph.m_variableAccessData.size(); ++i) {
71 VariableAccessData* data = &m_graph.m_variableAccessData[i];
79 m_graph.m_unificationState = GloballyUnified;
H A DDFGTypeCheckHoistingPhase.cpp52 ASSERT(m_graph.m_form == ThreadedCPS);
54 for (unsigned i = m_graph.m_variableAccessData.size(); i--;) {
55 VariableAccessData* variable = &m_graph.m_variableAccessData[i];
64 for (BlockIndex blockIndex = 0; blockIndex < m_graph.m_blocks.size(); ++blockIndex) {
65 BasicBlock* block = m_graph.m_blocks[blockIndex].get();
154 m_graph.voteChildren(node, VoteOther);
161 m_graph.voteChildren(node, VoteOther);
170 for (unsigned i = m_graph.m_variableAccessData.size(); i--;) {
171 VariableAccessData* variable = &m_graph.m_variableAccessData[i];
181 "Zeroing the structure to hoist for ", VariableAccessDataDump(m_graph, variabl
[all...]
H A DDFGVariableAccessDataDump.cpp37 : m_graph(graph)
45 for (unsigned i = 0; i < m_graph.m_variableAccessData.size(); ++i) {
46 if (&m_graph.m_variableAccessData[i] == m_data) {
H A DDFGCFAPhase.cpp48 ASSERT(m_graph.m_form == ThreadedCPS);
49 ASSERT(m_graph.m_unificationState == GloballyUnified);
50 ASSERT(m_graph.m_refCountState == EverythingIsLive);
67 AbstractState::initialize(m_graph);
80 BasicBlock* block = m_graph.m_blocks[blockIndex].get();
127 for (BlockIndex block = 0; block < m_graph.m_blocks.size(); ++block)
H A DDFGDCEPhase.cpp49 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();
69 DFG_NODE_DO_TO_CHILDREN(m_graph, node, findTypeCheckRoot);
81 DFG_NODE_DO_TO_CHILDREN(m_graph, node, countEdge);
84 for (BlockIndex blockIndex = 0; blockIndex < m_graph.m_blocks.size(); ++blockIndex) {
85 BasicBlock* block = m_graph.m_blocks[blockIndex].get();
89 InsertionSet insertionSet(m_graph);
127 Edge edge = m_graph
[all...]
H A DDFGVariableAccessDataDump.h47 Graph& m_graph; member in class:JSC::DFG::VariableAccessDataDump
H A DDFGPredictionPropagationPhase.cpp57 ASSERT(m_graph.m_form == ThreadedCPS);
58 ASSERT(m_graph.m_unificationState == GloballyUnified);
144 changed |= setPrediction(speculationFromValue(m_graph.valueOfJSConstant(node)));
217 if (m_graph.addSpeculationMode(node) != DontSpeculateInteger)
235 if (m_graph.addSpeculationMode(node) != DontSpeculateInteger)
248 if (m_graph.addSpeculationMode(node) != DontSpeculateInteger)
258 if (m_graph.negateShouldSpeculateInteger(node))
285 if (m_graph.mulShouldSpeculateInteger(node))
574 for (BlockIndex blockIndex = 0; blockIndex < m_graph.m_blocks.size(); ++blockIndex) {
575 BasicBlock* block = m_graph
[all...]
H A DDFGDisassembler.cpp37 : m_graph(graph)
62 stack = Profiler::OriginStack(*m_graph.m_vm.m_perBytecodeProfiler, m_graph.m_codeBlock, ops[i].codeOrigin);
70 out.print("Generated DFG JIT code for ", CodeBlockWithJITType(m_graph.m_codeBlock, JITCode::DFGJIT), ", instruction count = ", m_graph.m_codeBlock->instructionCount(), ":\n");
71 out.print(" Optimized with execution counter = ", m_graph.m_profiledBlock->jitExecuteCounter(), "\n");
72 out.print(" Source: ", m_graph.m_codeBlock->sourceCodeOnOneLine(), "\n");
92 m_graph.m_dominators.computeIfNecessary(m_graph);
99 for (size_t blockIndex = 0; blockIndex < m_graph
[all...]
H A DDFGVirtualRegisterAllocationPhase.cpp48 m_graph.m_preservedVars.dump(WTF::dataFile());
51 ScoreBoard scoreBoard(m_graph.m_preservedVars);
56 for (size_t blockIndex = 0; blockIndex < m_graph.m_blocks.size(); ++blockIndex) {
57 BasicBlock* block = m_graph.m_blocks[blockIndex].get();
92 scoreBoard.useIfHasResult(m_graph.m_varArgChildren[childIdx]);
124 unsigned calleeRegisters = scoreBoard.highWatermark() + m_graph.m_parameterSlots;
H A DDFGArgumentsSimplificationPhase.cpp120 if (!m_graph.m_hasArguments)
131 for (unsigned i = m_graph.m_variableAccessData.size(); i--;) {
132 VariableAccessData* variableAccessData = &m_graph.m_variableAccessData[i];
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();
193 m_graph.uncheckedArgumentsRegisterFor(node->codeOrigin);
351 for (BlockIndex blockIndex = 0; blockIndex < m_graph.m_blocks.size(); ++blockIndex) {
352 BasicBlock* block = m_graph
[all...]
H A DDFGCSEPhase.cpp50 ASSERT((cseMode == NormalCSE) == (m_graph.m_fixpointState == FixpointNotConverged));
51 ASSERT(m_graph.m_fixpointState != BeforeFixpoint);
55 for (unsigned block = 0; block < m_graph.m_blocks.size(); ++block)
56 performBlockCSE(m_graph.m_blocks[block].get());
210 if (!m_graph.byValIsPure(node))
217 if (m_graph.clobbersWorld(node))
240 if (m_graph.clobbersWorld(node))
273 if (m_graph.clobbersWorld(node))
295 if (m_graph.clobbersWorld(node))
320 if (m_graph
[all...]
H A DDFGValidate.cpp40 : m_graph(graph)
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();
102 for (unsigned j = 0; j < m_graph.numChildren(node); ++j) {
104 if (m_graph.m_form == LoadStore && block->isPhiIndex(i))
107 Edge edge = m_graph.child(node, j);
127 if (m_graph
359 Graph& m_graph; member in class:JSC::DFG::Validate
[all...]
H A DDFGBackwardsPropagationPhase.cpp47 for (BlockIndex blockIndex = 0; blockIndex < m_graph.m_blocks.size(); ++blockIndex) {
48 BasicBlock* block = m_graph.m_blocks[blockIndex].get();
66 if (!m_graph.isNumberConstant(node))
68 double value = m_graph.valueOfNumberConstant(node);
74 if (!m_graph.isNumberConstant(node))
76 double value = m_graph.valueOfNumberConstant(node);
154 if (!!m_graph.m_varArgChildren[childIdx])
155 changed |= m_graph.m_varArgChildren[childIdx]->mergeFlags(NodeUsedAsValue);
344 m_graph.varArgChild(node, 0)->mergeFlags(NodeUsedAsValue);
345 m_graph
[all...]
H A DDFGConstantFoldingPhase.cpp55 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();
89 m_graph.argumentsRegisterFor(node->codeOrigin)).m_type))
125 if (!node->arrayMode().alreadyChecked(m_graph, node, m_state.forNode(node->child1())))
197 node->convertToGetByOffset(m_graph.m_storageAccessData.size(), propertyStorage);
202 m_graph.m_storageAccessData.append(storageAccessData);
224 m_graph.globalObjectFor(codeOrigin),
254 transitionData = m_graph.addStructureTransitionData(
306 node->convertToPutByOffset(m_graph
[all...]
H A DDFGInsertionSet.h58 : m_graph(graph)
77 return insert(index, m_graph.addNode(type valueParamsComma valueArgs)); \
100 Graph& m_graph; member in class:JSC::DFG::InsertionSet
H A DDFGByteCodeParser.cpp128 , m_graph(graph)
201 m_graph.m_variableAccessData.append(VariableAccessData(static_cast<VirtualRegister>(operand), isCaptured));
202 return &m_graph.m_variableAccessData.last();
708 Node* result = m_graph.addNode(
716 Node* result = m_graph.addNode(
724 Node* result = m_graph.addNode(
732 Node* result = m_graph.addNode(
742 Node* result = m_graph.addNode(
744 m_graph.m_varArgChildren.size() - m_numPassedVarArgs, m_numPassedVarArgs);
755 m_graph
199 ASSERT(operand < FirstConstantRegisterIndex); m_graph.m_variableAccessData.append(VariableAccessData(static_cast<VirtualRegister>(operand), isCaptured)); return &m_graph.m_variableAccessData.last(); } Node* getDirect(int operand) { if (operand >= FirstConstantRegisterIndex) argument
[all...]
H A DDFGCPSRethreadingPhase.cpp47 if (m_graph.m_form == ThreadedCPS)
56 m_graph.m_form = ThreadedCPS;
64 for (unsigned i = 0; i < m_graph.m_variableAccessData.size(); ++i)
65 m_graph.m_variableAccessData[i].setIsLoadedFrom(false);
72 for (BlockIndex blockIndex = m_graph.m_blocks.size(); blockIndex--;) {
73 BasicBlock* block = m_graph.m_blocks[blockIndex].get();
113 m_graph.m_allocator.free(block->phis[phiIndex]);
133 Node* result = m_graph.addNode(SpecNone, Phi, codeOrigin, OpInfo(variable));
323 m_graph.performSubstitution(node);
390 for (m_blockIndex = m_graph
[all...]
H A DDFGFixupPhase.cpp50 ASSERT(m_graph.m_fixpointState == BeforeFixpoint);
51 ASSERT(m_graph.m_form == ThreadedCPS);
54 for (BlockIndex blockIndex = 0; blockIndex < m_graph.m_blocks.size(); ++blockIndex)
55 fixupBlock(m_graph.m_blocks[blockIndex].get());
60 for (unsigned i = m_graph.m_argumentPositions.size(); i--;)
61 m_graph.m_argumentPositions[i].mergeArgumentUnboxingAwareness();
63 for (BlockIndex blockIndex = 0; blockIndex < m_graph.m_blocks.size(); ++blockIndex)
64 fixupSetLocalsInBlock(m_graph.m_blocks[blockIndex].get());
196 if (m_graph.negateShouldSpeculateInteger(node)) {
205 if (m_graph
[all...]
H A DDFGJITCompiler.cpp46 , m_graph(dfg)
49 if (shouldShowDisassembly() || m_graph.m_vm.m_perBytecodeProfiler)
56 if (m_graph.m_compilation) {
226 if (m_graph.m_compilation) {
233 m_graph.m_compilation->addOSRExitSite(addresses);
238 codeBlock()->saveCompilation(m_graph.m_compilation);
270 if (m_graph.m_compilation)
271 m_disassembler->reportToProfiler(m_graph.m_compilation.get(), linkBuffer);
364 if (m_graph.m_compilation)
365 m_disassembler->reportToProfiler(m_graph
[all...]
H A DDFGAbstractState.cpp42 , m_graph(graph)
200 return mergeToSuccessors(m_graph, block);
253 DFG_NODE_DO_TO_CHILDREN(m_graph, node, filterEdgeByUse);
268 DFG_NODE_DO_TO_CHILDREN(m_graph, node, verifyEdge);
280 forNode(node).set(m_graph.valueOfJSConstant(node));
480 forNode(node).set(m_graph.m_vm.stringStructure.get());
784 forNode(node).set(m_graph.m_vm.stringStructure.get());
876 forNode(node).set(m_graph.m_vm.stringStructure.get());
895 forNode(node).set(m_graph.m_vm.stringStructure.get());
1094 forNode(node->child1()).filter(m_graph
[all...]
H A DDFGDisassembler.h90 Graph& m_graph; member in class:JSC::DFG::Disassembler

Completed in 94 milliseconds

12