/macosx-10.10.1/JavaScriptCore-7600.1.17/dfg/ |
H A D | DFGDCEPhase.cpp | 128 void findTypeCheckRoot(Node*, Edge edge) 145 void countEdge(Node*, Edge edge) 200 node->child1() = Edge(); 215 Edge edge = m_graph.m_varArgChildren[childIdx]; 242 Edge edge = node->children.child(i);
|
H A D | DFGOSREntrypointCreationPhase.cpp | 106 Edge(locals[local])); 128 m_graph, SpecNone, SetLocal, origin, OpInfo(variable), Edge(node));
|
H A D | DFGScoreBoard.h | 113 void use(Edge child) 118 void useIfHasResult(Edge child)
|
H A D | DFGInPlaceAbstractState.h | 52 AbstractValue& forNode(Edge edge)
|
H A D | DFGSSAConversionPhase.cpp | 146 Edge edge = node->children.justOneChild(); 169 OpInfo(node), Edge(predecessor->variablesAtTail[i], useKind)); 414 Edge& edge = node->children.child(i); 426 Edge edge = node->children.justOneChild(); 444 bool forwardPhiEdge(Edge& edge) 456 Edge edge = node->children.child(i);
|
H A D | DFGGraph.h | 84 void changeChild(Edge& edge, Node* newNode) 89 void changeEdge(Edge& edge, Edge newEdge) 94 void compareAndSwap(Edge& edge, Node* oldNode, Node* newNode) 101 void compareAndSwap(Edge& edge, Edge oldEdge, Edge newEdge) 120 void performSubstitutionForEdge(Edge& child) 185 void dump(PrintStream&, Edge); 707 Edge [all...] |
H A D | DFGTypeCheckHoistingPhase.cpp | 134 OpInfo(variable), Edge(node)); 139 Edge(getLocal, CellUse)); 145 Edge(getLocal, CellUse)); 167 Edge child1 = node->child1(); 173 Edge(child1.node(), CellUse)); 179 Edge(child1.node(), CellUse));
|
H A D | DFGValidate.cpp | 114 Edge edge = m_graph.child(node, j); 248 Edge edge = m_graph.child(node, j); 265 Edge edge = m_graph.child(node, j); 358 Edge edge = m_graph.child(node, j); 479 void reportValidationContext(Node* node, Edge edge) 517 Node* node, BasicBlock* block, Node* expectedNode, Edge incomingEdge)
|
H A D | DFGCSEPhase.cpp | 129 Edge child1 = node->child1().sanitized(); 130 Edge child2 = node->child2().sanitized(); 131 Edge child3 = node->child3().sanitized(); 141 Edge otherChild = otherNode->child1().sanitized(); 1069 Edge edge = node->children.child(i); 1381 Edge child1 = m_graph.varArgChild(node, 0); 1382 Edge child2 = m_graph.varArgChild(node, 1);
|
H A D | DFGArgumentsSimplificationPhase.cpp | 471 node->child2() = Edge(); 488 node->child1() = Edge(); 688 void observeProperArgumentsUse(Node* node, Edge edge) 763 Edge edge = node->children.child(edgeIndex);
|
H A D | DFGSafeToExecute.h | 44 void operator()(Node*, Edge edge)
|
H A D | DFGWatchpointCollectionPhase.cpp | 150 void handleEdge(Node*, Edge edge)
|
H A D | DFGSpeculativeJIT.cpp | 162 OSRExitJumpPlaceholder SpeculativeJIT::speculationCheck(ExitKind kind, JSValueSource jsValueSource, Edge nodeUse) 168 void SpeculativeJIT::speculationCheck(ExitKind kind, JSValueSource jsValueSource, Edge nodeUse, MacroAssembler::Jump jumpToFail) 174 void SpeculativeJIT::speculationCheck(ExitKind kind, JSValueSource jsValueSource, Edge nodeUse, const MacroAssembler::JumpList& jumpsToFail) 190 void SpeculativeJIT::speculationCheck(ExitKind kind, JSValueSource jsValueSource, Edge nodeUse, MacroAssembler::Jump jumpToFail, const SpeculationRecovery& recovery) 220 void SpeculativeJIT::terminateSpeculativeExecution(ExitKind kind, JSValueRegs jsValueRegs, Edge nodeUse) 226 void SpeculativeJIT::typeCheck(JSValueSource source, Edge edge, SpeculatedType typesPassedThrough, MacroAssembler::Jump jumpToFail) 796 GPRReg SpeculativeJIT::fillStorage(Edge edge) 834 Edge child1 = node->child1(); 841 Edge child2 = node->child2(); 848 Edge child [all...] |
H A D | DFGPredictionPropagationPhase.cpp | 780 Edge child1 = m_graph.varArgChild(node, 0); 781 Edge child2 = m_graph.varArgChild(node, 1); 782 Edge child3 = m_graph.varArgChild(node, 2);
|
/macosx-10.10.1/llvmCore-3425.0.34/lib/Analysis/ |
H A D | ProfileDataLoaderPass.cpp | 65 virtual void readEdge(unsigned, ProfileData&, ProfileData::Edge, 94 ProfileData &PB, ProfileData::Edge e, 102 DEBUG(dbgs() << "-- Read Edge Counter for " << e 152 ProfileData::Edge edge = PB.getEdge(BB, TI->getSuccessor(s)); 154 DEBUG(dbgs() << "---- Edge '" << edge << "' has weight "
|
H A D | ProfileVerifierPass.cpp | 85 double ReadOrAssert(typename ProfileInfoT<FType, BType>::Edge); 104 typename ProfileInfoT<FType, BType>::Edge E = PI->getEdge(*bbi,BB); 119 typename ProfileInfoT<FType, BType>::Edge E = PI->getEdge(BB,*bbi); 200 double ProfileVerifierPassT<FType, BType>::ReadOrAssert(typename ProfileInfoT<FType, BType>::Edge E) { 203 dbgs() << "Edge " << E << " in Function " 205 ASSERTMESSAGE("Edge has missing value"); 209 dbgs() << "Edge " << E << " in Function " 211 ASSERTMESSAGE("Edge has negative value");
|
/macosx-10.10.1/llvmCore-3425.0.34/lib/Transforms/Instrumentation/ |
H A D | OptimalEdgeProfiling.cpp | 11 // Edge profiling can give a reasonable approximation of the hot paths through a 49 return "Optimal Edge Profiler"; 68 inline static void printEdgeCounter(ProfileInfo::Edge e, 71 DEBUG(dbgs() << "--Edge Counter for " << (e) << " in " \ 150 ProfileInfo::Edge edge = ProfileInfo::getEdge(0, entry); 173 ProfileInfo::Edge edge = ProfileInfo::getEdge(BB, 0); 184 ProfileInfo::Edge edge = ProfileInfo::getEdge(BB,Succ);
|
H A D | GCOVProfiling.cpp | 457 unsigned Edge = 0; local 466 Edge); 474 ConstantInt::get(Type::getInt64Ty(*Ctx), Edge), 475 ConstantInt::get(Type::getInt64Ty(*Ctx), Edge + 1)); 489 Edge += Successors; 552 unsigned Edge = 0; local 561 Edge + i); 566 Edge += Successors;
|
/macosx-10.10.1/llvmCore-3425.0.34/include/llvm/Analysis/ |
H A D | SparsePropagation.h | 131 typedef std::pair<BasicBlock*,BasicBlock*> Edge; typedef in class:llvm::SparseSolver 132 std::set<Edge> KnownFeasibleEdges;
|
/macosx-10.10.1/BerkeleyDB-21/db/java/src/com/sleepycat/asm/ |
H A D | Label.java | 82 * stores the list of it successors in the graph, as a linked list of Edge 103 * are stored in a linked list of {@link Edge Edge} objects, linked to each 104 * other by their {@link Edge#next} field. 106 Edge successors;
|
/macosx-10.10.1/JavaScriptCore-7600.1.17/tests/exceptionFuzz/ |
H A D | 3d-cube.js | 310 Q.Edge = [[0,1,2],[3,2,6],[7,6,5],[4,5,1],[4,0,3],[1,5,6]]; 314 for (var i = 0; i < Q.Edge.length; i++) Q.Normal[i] = CalcNormal(Q[Q.Edge[i][0]].V, Q[Q.Edge[i][1]].V, Q[Q.Edge[i][2]].V);
|
/macosx-10.10.1/JavaScriptCore-7600.1.17/ftl/ |
H A D | FTLLowerDFGToLLVM.cpp | 59 Edge _ftc_highValue = (highValue); \ 1873 Edge edge = m_node->child1(); 2196 Edge child1 = m_graph.varArgChild(m_node, 0); 2197 Edge child2 = m_graph.varArgChild(m_node, 1); 2198 Edge child3 = m_graph.varArgChild(m_node, 2); 2199 Edge child4 = m_graph.varArgChild(m_node, 3); 2200 Edge child5 = m_graph.varArgChild(m_node, 4); 2626 Edge edge = m_graph.varArgChild(m_node, operandIndex); 2670 Edge edge = m_graph.varArgChild(m_node, operandIndex); 3495 Edge leftEdg [all...] |
/macosx-10.10.1/llvmCore-3425.0.34/lib/CodeGen/ |
H A D | CriticalAntiDepBreaker.cpp | 523 if (const SDep *Edge = CriticalPathStep(CriticalPathSU)) { 524 const SUnit *NextSU = Edge->getSUnit(); 527 if (Edge->getKind() == SDep::Anti) { 528 AntiDepReg = Edge->getReg();
|
H A D | AggressiveAntiDepBreaker.cpp | 811 const SDep *Edge = Edges[i]; 812 SUnit *NextSU = Edge->getSUnit(); 814 if ((Edge->getKind() != SDep::Anti) && 815 (Edge->getKind() != SDep::Output)) continue; 817 unsigned AntiDepReg = Edge->getReg();
|
/macosx-10.10.1/llvmCore-3425.0.34/tools/llvm-prof/ |
H A D | llvm-prof.cpp | 105 std::vector<std::pair<ProfileInfo::Edge, double> > SuccCounts; 152 std::map<ProfileInfo::Edge, unsigned> EdgeFreqs;
|