mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-10-19 11:02:59 +02:00
3ad0317ae0
The current heuristic in isProfitableToIfCvt assumes we have a branch predictor, and so gives the wrong answer in some cases when we don't. This patch adds a subtarget feature to indicate that a subtarget has no branch predictor, and changes the heuristic in isProfitableToiIfCvt when it's present. This gives a slight overall improvement in a set of embedded benchmarks on Cortex-M4 and Cortex-M33. Differential Revision: https://reviews.llvm.org/D34398 llvm-svn: 306547
22 lines
829 B
TableGen
22 lines
829 B
TableGen
//=- ARMScheduleM3.td - ARM Cortex-M3 Scheduling Definitions -*- tablegen -*-=//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is distributed under the University of Illinois Open Source
|
|
// License. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
//
|
|
// This file defines the machine model for the ARM Cortex-M3 processor.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
def CortexM3Model : SchedMachineModel {
|
|
let IssueWidth = 1; // Only IT can be dual-issued, so assume single-issue
|
|
let MicroOpBufferSize = 0; // In-order
|
|
let LoadLatency = 2; // Latency when not pipelined, not pc-relative
|
|
let MispredictPenalty = 2; // Best case branch taken cost
|
|
|
|
let CompleteModel = 0;
|
|
}
|