equal
deleted
inserted
replaced
973 return 0; |
973 return 0; |
974 } |
974 } |
975 insidx++; // Reset iterator to skip USE side split |
975 insidx++; // Reset iterator to skip USE side split |
976 continue; |
976 continue; |
977 } |
977 } |
|
978 |
|
979 if (UseFPUForSpilling && n->is_Call() && !uup && !dup ) { |
|
980 // The use at the call can force the def down so insert |
|
981 // a split before the use to allow the def more freedom. |
|
982 maxlrg = split_USE(def,b,n,inpidx,maxlrg,dup,false, splits,slidx); |
|
983 // If it wasn't split bail |
|
984 if (!maxlrg) { |
|
985 return 0; |
|
986 } |
|
987 insidx++; // Reset iterator to skip USE side split |
|
988 continue; |
|
989 } |
|
990 |
978 // Here is the logic chart which describes USE Splitting: |
991 // Here is the logic chart which describes USE Splitting: |
979 // 0 = false or DOWN, 1 = true or UP |
992 // 0 = false or DOWN, 1 = true or UP |
980 // |
993 // |
981 // Overlap | DEF | USE | Action |
994 // Overlap | DEF | USE | Action |
982 //------------------------------------------------------- |
995 //------------------------------------------------------- |