[llvm] support save/restore point splitting in shrink-wrap

This patch introduces "-enable-shrink-wrap-into-multiple-points"
option, which enables splitting Save and Restore points during ShrinkWrap pass, i.e.
insert registers saves and restores as close as possible to their usage.

Current algorithm disables Save / Restore point splitting for
functions with instructions with FrameIndex operands,
with EHPads and with any Stack accesses beacuse it is difficult to prove the safety of it.

This patch also add support for multiple Save / Restore points only for RISCV.

Now ShrinkWrap produces:
- list of SavePoint + Registers
- list of RestorePoint + Registers
- Prolog (NCD of Save points)
- Epilog (NCPD of Restore points)

Author: enoskova-sc

llvm/include/llvm/CodeGen/TargetFrameLowering.h

@@ -201,6 +201,10 @@ class LLVM_ABI TargetFrameLowering {
     return false;
   }
 
+  /// enableCSRSaveRestorePointsSplit - Returns true if the target support
+  /// multiple save/restore points in shrink wrapping.
+  virtual bool enableCSRSaveRestorePointsSplit() const { return false; }
+
   /// Returns true if the stack slot holes in the fixed and callee-save stack
   /// area should be used when allocating other stack locations to reduce stack
   /// size.

llvm/lib/CodeGen/PrologEpilogInserter.cpp

@@ -458,19 +458,19 @@ void PEIImpl::calculateSaveRestoreBlocks(MachineFunction &MF) {
 
   // Use the points found by shrink-wrapping, if any.
   if (!MFI.getSavePoints().empty()) {
-    assert(MFI.getSavePoints().size() == 1 &&
-           "Multiple save points are not yet supported!");
-    const auto &SavePoint = *MFI.getSavePoints().begin();
-    SaveBlocks.push_back(SavePoint.first);
-    assert(MFI.getRestorePoints().size() == 1 &&
-           "Multiple restore points are not yet supported!");
-    const auto &RestorePoint = *MFI.getRestorePoints().begin();
-    MachineBasicBlock *RestoreBlock = RestorePoint.first;
-    // If RestoreBlock does not have any successor and is not a return block
-    // then the end point is unreachable and we do not need to insert any
-    // epilogue.
-    if (!RestoreBlock->succ_empty() || RestoreBlock->isReturnBlock())
-      RestoreBlocks.push_back(RestoreBlock);
+    assert(!MFI.getRestorePoints().empty() &&
+           "Both restore and save must be set");
+    for (auto &item : MFI.getSavePoints())
+      SaveBlocks.push_back(item.first);
+
+    for (auto &item : MFI.getRestorePoints()) {
+      MachineBasicBlock *RestoreBlock = item.first;
+      // If RestoreBlock does not have any successor and is not a return block
+      // then the end point is unreachable and we do not need to insert any
+      // epilogue.
+      if (!RestoreBlock->succ_empty() || RestoreBlock->isReturnBlock())
+        RestoreBlocks.push_back(RestoreBlock);
+    }
     return;
   }
 
@@ -767,7 +767,7 @@ void PEIImpl::spillCalleeSavedRegs(MachineFunction &MF) {
     for (auto &CS : CSI)
       RegToInfo.insert({CS.getReg(), &CS});
 
-    if (MFI.getSavePoints().size() > 1) {
+    if (!MFI.getSavePoints().empty()) {
       fillCSInfoPerBB(MFI, RegToInfo, PrologBlocks, /*isSave=*/true);
       fillCSInfoPerBB(MFI, RegToInfo, EpilogBlocks, /*isSave=*/false);
     } else {
@@ -801,7 +801,7 @@ void PEIImpl::spillCalleeSavedRegs(MachineFunction &MF) {
         updateLiveness(MF, Save, Restore, CS);
       }
 
-      if (MFI.getRestorePoints().size() <= 1) {
+      if (MFI.getRestorePoints().empty()) {
         SaveRestorePoints RestorePts;
         for (MachineBasicBlock *EpilogBlock : EpilogBlocks)
           RestorePts.insert({EpilogBlock, MFI.getCalleeSavedInfo()});