xref: /freebsd/contrib/llvm-project/llvm/lib/CodeGen/AllocationOrder.cpp (revision 19fae0f66023a97a9b464b3beeeabb2081f575b3)
1 //===-- llvm/CodeGen/AllocationOrder.cpp - Allocation Order ---------------===//
2 //
3 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4 // See https://llvm.org/LICENSE.txt for license information.
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6 //
7 //===----------------------------------------------------------------------===//
8 //
9 // This file implements an allocation order for virtual registers.
10 //
11 // The preferred allocation order for a virtual register depends on allocation
12 // hints and target hooks. The AllocationOrder class encapsulates all of that.
13 //
14 //===----------------------------------------------------------------------===//
15 
16 #include "AllocationOrder.h"
17 #include "llvm/CodeGen/MachineFunction.h"
18 #include "llvm/CodeGen/MachineRegisterInfo.h"
19 #include "llvm/CodeGen/RegisterClassInfo.h"
20 #include "llvm/CodeGen/VirtRegMap.h"
21 #include "llvm/Support/Debug.h"
22 #include "llvm/Support/raw_ostream.h"
23 
24 using namespace llvm;
25 
26 #define DEBUG_TYPE "regalloc"
27 
28 // Compare VirtRegMap::getRegAllocPref().
29 AllocationOrder AllocationOrder::create(unsigned VirtReg, const VirtRegMap &VRM,
30                                         const RegisterClassInfo &RegClassInfo,
31                                         const LiveRegMatrix *Matrix) {
32   const MachineFunction &MF = VRM.getMachineFunction();
33   const TargetRegisterInfo *TRI = &VRM.getTargetRegInfo();
34   auto Order = RegClassInfo.getOrder(MF.getRegInfo().getRegClass(VirtReg));
35   SmallVector<MCPhysReg, 16> Hints;
36   bool HardHints =
37       TRI->getRegAllocationHints(VirtReg, Order, Hints, MF, &VRM, Matrix);
38 
39   LLVM_DEBUG({
40     if (!Hints.empty()) {
41       dbgs() << "hints:";
42       for (unsigned I = 0, E = Hints.size(); I != E; ++I)
43         dbgs() << ' ' << printReg(Hints[I], TRI);
44       dbgs() << '\n';
45     }
46   });
47 #ifndef NDEBUG
48   for (unsigned I = 0, E = Hints.size(); I != E; ++I)
49     assert(is_contained(Order, Hints[I]) &&
50            "Target hint is outside allocation order.");
51 #endif
52   return AllocationOrder(std::move(Hints), Order, HardHints);
53 }
54