Lines Matching defs:paths

51 // decided to be C. It then enumerates through all paths in the loop and labels
54 // Using this information it creates new paths that unconditionally branch to
91 STATISTIC(NumPaths, "Number of individual paths threaded");
109     "dfa-max-num-visited-paths",
111         "Max number of blocks visited while enumerating paths around a switch"),
115     MaxNumPaths("dfa-max-num-paths",
116                 cl::desc("Max number of paths enumerated around a switch"),
493         // paths have been enumerated (in function getStateDefMap).
496         // likely that it will also be on the enumerated paths, causing us to
497         // exit after we have enumerated all the paths. This heuristic save
498         // compile time because a search for all the paths can become expensive.
584     // Get paths from the determinator BBs to SwitchPhiDefBB
592     // Find and append paths from SwitchPhiDefBB to SwitchBlock.
594         paths(SwitchPhiDefBB, SwitchBlock, VB, /* PathDepth = */ 1);
665       // Not a direct predecessor, find intermediate paths to append to the
672           paths(IncomingPhiDefBB, IncomingBB, VB, /* PathDepth = */ 1);
691   PathsType paths(BasicBlock *BB, BasicBlock *ToBB, VisitedBlocks &Visited,
695     // Stop exploring paths after visiting MaxPathLength blocks
741       PathsType SuccPaths = paths(Succ, ToBB, Visited, PathDepth + 1);
968     // After all paths are cloned, now update the last successor of the cloned
1240     // Note multiple paths can end at the same block so check that it is not