Skip to content

[Mips] Support llvm.readcyclecounter intrinsic #127553

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Feb 18, 2025
Merged

[Mips] Support llvm.readcyclecounter intrinsic #127553

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
44 changes: 44 additions & 0 deletions llvm/lib/Target/Mips/MipsISelLowering.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -359,6 +359,10 @@ MipsTargetLowering::MipsTargetLowering(const MipsTargetMachine &TM,
setOperationAction(ISD::FCOPYSIGN, MVT::f64, Custom);
setOperationAction(ISD::FP_TO_SINT, MVT::i32, Custom);

if (Subtarget.hasMips32r2() ||
getTargetMachine().getTargetTriple().isOSLinux())
setOperationAction(ISD::READCYCLECOUNTER, MVT::i64, Custom);

// Lower fmin/fmax/fclass operations for MIPS R6.
if (Subtarget.hasMips32r6()) {
setOperationAction(ISD::FMINNUM_IEEE, MVT::f32, Legal);
Expand Down Expand Up @@ -1311,6 +1315,8 @@ LowerOperation(SDValue Op, SelectionDAG &DAG) const
case ISD::STORE: return lowerSTORE(Op, DAG);
case ISD::EH_DWARF_CFA: return lowerEH_DWARF_CFA(Op, DAG);
case ISD::FP_TO_SINT: return lowerFP_TO_SINT(Op, DAG);
case ISD::READCYCLECOUNTER:
return lowerREADCYCLECOUNTER(Op, DAG);
}
return SDValue();
}
Expand Down Expand Up @@ -2092,6 +2098,44 @@ MachineBasicBlock *MipsTargetLowering::emitAtomicCmpSwapPartword(
return exitMBB;
}

SDValue MipsTargetLowering::lowerREADCYCLECOUNTER(SDValue Op,
SelectionDAG &DAG) const {
SmallVector<SDValue, 3> Results;
SDLoc DL(Op);
MachineFunction &MF = DAG.getMachineFunction();
unsigned RdhwrOpc, DestReg;
EVT PtrVT = getPointerTy(DAG.getDataLayout());

if (PtrVT == MVT::i64) {
RdhwrOpc = Mips::RDHWR64;
DestReg = MF.getRegInfo().createVirtualRegister(getRegClassFor(MVT::i64));
SDNode *Rdhwr = DAG.getMachineNode(RdhwrOpc, DL, MVT::i64, MVT::Glue,
DAG.getRegister(Mips::HWR2, MVT::i32),
DAG.getTargetConstant(0, DL, MVT::i32));
SDValue Chain = DAG.getCopyToReg(DAG.getEntryNode(), DL, DestReg,
SDValue(Rdhwr, 0), SDValue(Rdhwr, 1));
SDValue ResNode =
DAG.getCopyFromReg(Chain, DL, DestReg, MVT::i64, Chain.getValue(1));
Results.push_back(ResNode);
Results.push_back(ResNode.getValue(1));
} else {
RdhwrOpc = Mips::RDHWR;
DestReg = MF.getRegInfo().createVirtualRegister(getRegClassFor(MVT::i32));
SDNode *Rdhwr = DAG.getMachineNode(RdhwrOpc, DL, MVT::i32, MVT::Glue,
DAG.getRegister(Mips::HWR2, MVT::i32),
DAG.getTargetConstant(0, DL, MVT::i32));
SDValue Chain = DAG.getCopyToReg(DAG.getEntryNode(), DL, DestReg,
SDValue(Rdhwr, 0), SDValue(Rdhwr, 1));
SDValue ResNode =
DAG.getCopyFromReg(Chain, DL, DestReg, MVT::i32, Chain.getValue(1));
Results.push_back(DAG.getNode(ISD::BUILD_PAIR, DL, MVT::i64, ResNode,
DAG.getConstant(0, DL, MVT::i32)));
Results.push_back(ResNode.getValue(1));
}

return DAG.getMergeValues(Results, DL);
}

SDValue MipsTargetLowering::lowerBRCOND(SDValue Op, SelectionDAG &DAG) const {
// The first operand is the chain, the second is the condition, the third is
// the block to branch to if the condition is true.
Expand Down
1 change: 1 addition & 0 deletions llvm/lib/Target/Mips/MipsISelLowering.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -560,6 +560,7 @@ class TargetRegisterClass;
bool IsSRA) const;
SDValue lowerEH_DWARF_CFA(SDValue Op, SelectionDAG &DAG) const;
SDValue lowerFP_TO_SINT(SDValue Op, SelectionDAG &DAG) const;
SDValue lowerREADCYCLECOUNTER(SDValue Op, SelectionDAG &DAG) const;

/// isEligibleForTailCallOptimization - Check whether the call is eligible
/// for tail call optimization.
Expand Down
45 changes: 45 additions & 0 deletions llvm/test/CodeGen/Mips/readcyclecounter.ll
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,45 @@
;RUN: llc -mtriple=mipsel-linux-gnu -mcpu=mips32r2 < %s | FileCheck %s --check-prefix=MIPSEL
;RUN: llc -mtriple=mips64el-linux-gnuabi64 -mcpu=mips64r2 < %s | FileCheck %s --check-prefix=MIPS64EL
;RUN: llc -mtriple=mipsel-linux-gnu -mcpu=mips2 < %s | FileCheck %s --check-prefix=MIPSEL
;RUN: llc -mtriple=mips64el-linux-gnuabi64 -mcpu=mips3 < %s | FileCheck %s --check-prefix=MIPS64EL
;RUN: llc -mtriple=mipsel -mcpu=mips32r2 < %s | FileCheck %s --check-prefix=MIPSEL
;RUN: llc -mtriple=mips64el -mcpu=mips64r2 < %s | FileCheck %s --check-prefix=MIPS64EL
;RUN: llc -mtriple=mipsel -mcpu=mips2 < %s | FileCheck %s --check-prefix=MIPSEL_NOT_SUPPORTED
;RUN: llc -mtriple=mips64el -mcpu=mips3 < %s | FileCheck %s --check-prefix=MIPS64EL_NOT_SUPPORTED

declare i64 @llvm.readcyclecounter() nounwind readnone

define i64 @test_readcyclecounter() nounwind {
; MIPSEL-LABEL: test_readcyclecounter:
; MIPSEL: # %bb.0: # %entry
; MIPSEL-NEXT: .set push
; MIPSEL-NEXT: .set mips32r2
; MIPSEL-NEXT: rdhwr $2, $hwr_cc
; MIPSEL-NEXT: .set pop
; MIPSEL-NEXT: jr $ra
; MIPSEL-NEXT: addiu $3, $zero, 0
;
; MIPSEL_NOT_SUPPORTED-LABEL: test_readcyclecounter:
; MIPSEL_NOT_SUPPORTED: # %bb.0: # %entry
; MIPSEL_NOT_SUPPORTED-NEXT: addiu $2, $zero, 0
; MIPSEL_NOT_SUPPORTED-NEXT: jr $ra
; MIPSEL_NOT_SUPPORTED-NEXT: addiu $3, $zero, 0
;
; MIPS64EL-LABEL: test_readcyclecounter:
; MIPS64EL: # %bb.0: # %entry
; MIPS64EL-NEXT: .set push
; MIPS64EL-NEXT: .set mips32r2
; MIPS64EL-NEXT: rdhwr $2, $hwr_cc
; MIPS64EL-NEXT: .set pop
; MIPS64EL-NEXT: jr $ra
; MIPS64EL-NEXT: nop
;
; MIPS64EL_NOT_SUPPORTED-LABEL: test_readcyclecounter:
; MIPS64EL_NOT_SUPPORTED: # %bb.0: # %entry
; MIPS64EL_NOT_SUPPORTED-NEXT: jr $ra
; MIPS64EL_NOT_SUPPORTED-NEXT: daddiu $2, $zero, 0
entry:
%tmp0 = tail call i64 @llvm.readcyclecounter()
ret i64 %tmp0
}