HomeSort by: relevance | last modified time | path
    Searched refs:Fused (Results 1 - 2 of 2) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
LoopFuse.cpp 20 /// loops and test whether they can be fused. The necessary conditions for
37 /// requirements for fusion are met, the two candidates are fused, creating a
38 /// new (fused) candidate which is then added back into the set to consider for
75 STATISTIC(FuseCounter, "Loops fused");
317 /// fusion. Note that this only checks whether a single loop can be fused - it
830 /// of fusion candidates passes all legality checks, they are fused together
835 bool Fused = false;
997 "Fused candidate should be eligible for fusion!");
1010 // Reset FC0 and FC1 the new (fused) candidate. Subsequent iterations
1011 // of the FC1 loop will attempt to fuse the new (fused) loop with th
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/
DAGCombiner.cpp 13598 if (SDValue Fused = visitFADDForFMACombine(N)) {
13599 AddToWorklist(Fused.getNode());
13600 return Fused;
13708 if (SDValue Fused = visitFSUBForFMACombine(N)) {
13709 AddToWorklist(Fused.getNode());
13710 return Fused;
13844 if (SDValue Fused = visitFMULForFMADistributiveCombine(N)) {
13845 AddToWorklist(Fused.getNode());
13846 return Fused;

Completed in 33 milliseconds