1//=== MC/MCRegisterInfo.cpp - Target Register Description -------*- C++ -*-===//
2//
3//                     The LLVM Compiler Infrastructure
4//
5// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//
9//
10// This file implements MCRegisterInfo functions.
11//
12//===----------------------------------------------------------------------===//
13
14#include "llvm/MC/MCRegisterInfo.h"
15
16using namespace llvm;
17
18unsigned MCRegisterInfo::getMatchingSuperReg(unsigned Reg, unsigned SubIdx,
19                                             const MCRegisterClass *RC) const {
20  for (MCSuperRegIterator Supers(Reg, this); Supers.isValid(); ++Supers)
21    if (RC->contains(*Supers) && Reg == getSubReg(*Supers, SubIdx))
22      return *Supers;
23  return 0;
24}
25
26unsigned MCRegisterInfo::getSubReg(unsigned Reg, unsigned Idx) const {
27  assert(Idx && Idx < getNumSubRegIndices() &&
28         "This is not a subregister index");
29  // Get a pointer to the corresponding SubRegIndices list. This list has the
30  // name of each sub-register in the same order as MCSubRegIterator.
31  const uint16_t *SRI = SubRegIndices + get(Reg).SubRegIndices;
32  for (MCSubRegIterator Subs(Reg, this); Subs.isValid(); ++Subs, ++SRI)
33    if (*SRI == Idx)
34      return *Subs;
35  return 0;
36}
37
38unsigned MCRegisterInfo::getSubRegIndex(unsigned Reg, unsigned SubReg) const {
39  assert(SubReg && SubReg < getNumRegs() && "This is not a register");
40  // Get a pointer to the corresponding SubRegIndices list. This list has the
41  // name of each sub-register in the same order as MCSubRegIterator.
42  const uint16_t *SRI = SubRegIndices + get(Reg).SubRegIndices;
43  for (MCSubRegIterator Subs(Reg, this); Subs.isValid(); ++Subs, ++SRI)
44    if (*Subs == SubReg)
45      return *SRI;
46  return 0;
47}
48
49unsigned MCRegisterInfo::getSubRegIdxSize(unsigned Idx) const {
50  assert(Idx && Idx < getNumSubRegIndices() &&
51         "This is not a subregister index");
52  return SubRegIdxRanges[Idx].Size;
53}
54
55unsigned MCRegisterInfo::getSubRegIdxOffset(unsigned Idx) const {
56  assert(Idx && Idx < getNumSubRegIndices() &&
57         "This is not a subregister index");
58  return SubRegIdxRanges[Idx].Offset;
59}
60
61int MCRegisterInfo::getDwarfRegNum(unsigned RegNum, bool isEH) const {
62  const DwarfLLVMRegPair *M = isEH ? EHL2DwarfRegs : L2DwarfRegs;
63  unsigned Size = isEH ? EHL2DwarfRegsSize : L2DwarfRegsSize;
64
65  DwarfLLVMRegPair Key = { RegNum, 0 };
66  const DwarfLLVMRegPair *I = std::lower_bound(M, M+Size, Key);
67  if (I == M+Size || I->FromReg != RegNum)
68    return -1;
69  return I->ToReg;
70}
71
72int MCRegisterInfo::getLLVMRegNum(unsigned RegNum, bool isEH) const {
73  const DwarfLLVMRegPair *M = isEH ? EHDwarf2LRegs : Dwarf2LRegs;
74  unsigned Size = isEH ? EHDwarf2LRegsSize : Dwarf2LRegsSize;
75
76  DwarfLLVMRegPair Key = { RegNum, 0 };
77  const DwarfLLVMRegPair *I = std::lower_bound(M, M+Size, Key);
78  assert(I != M+Size && I->FromReg == RegNum && "Invalid RegNum");
79  return I->ToReg;
80}
81
82int MCRegisterInfo::getSEHRegNum(unsigned RegNum) const {
83  const DenseMap<unsigned, int>::const_iterator I = L2SEHRegs.find(RegNum);
84  if (I == L2SEHRegs.end()) return (int)RegNum;
85  return I->second;
86}
87