2012-11-02 22:48:17 +01:00
|
|
|
; RUN: opt < %s -cost-model -analyze | FileCheck %s
|
|
|
|
|
|
[PM] Change the core design of the TTI analysis to use a polymorphic
type erased interface and a single analysis pass rather than an
extremely complex analysis group.
The end result is that the TTI analysis can contain a type erased
implementation that supports the polymorphic TTI interface. We can build
one from a target-specific implementation or from a dummy one in the IR.
I've also factored all of the code into "mix-in"-able base classes,
including CRTP base classes to facilitate calling back up to the most
specialized form when delegating horizontally across the surface. These
aren't as clean as I would like and I'm planning to work on cleaning
some of this up, but I wanted to start by putting into the right form.
There are a number of reasons for this change, and this particular
design. The first and foremost reason is that an analysis group is
complete overkill, and the chaining delegation strategy was so opaque,
confusing, and high overhead that TTI was suffering greatly for it.
Several of the TTI functions had failed to be implemented in all places
because of the chaining-based delegation making there be no checking of
this. A few other functions were implemented with incorrect delegation.
The message to me was very clear working on this -- the delegation and
analysis group structure was too confusing to be useful here.
The other reason of course is that this is *much* more natural fit for
the new pass manager. This will lay the ground work for a type-erased
per-function info object that can look up the correct subtarget and even
cache it.
Yet another benefit is that this will significantly simplify the
interaction of the pass managers and the TargetMachine. See the future
work below.
The downside of this change is that it is very, very verbose. I'm going
to work to improve that, but it is somewhat an implementation necessity
in C++ to do type erasure. =/ I discussed this design really extensively
with Eric and Hal prior to going down this path, and afterward showed
them the result. No one was really thrilled with it, but there doesn't
seem to be a substantially better alternative. Using a base class and
virtual method dispatch would make the code much shorter, but as
discussed in the update to the programmer's manual and elsewhere,
a polymorphic interface feels like the more principled approach even if
this is perhaps the least compelling example of it. ;]
Ultimately, there is still a lot more to be done here, but this was the
huge chunk that I couldn't really split things out of because this was
the interface change to TTI. I've tried to minimize all the other parts
of this. The follow up work should include at least:
1) Improving the TargetMachine interface by having it directly return
a TTI object. Because we have a non-pass object with value semantics
and an internal type erasure mechanism, we can narrow the interface
of the TargetMachine to *just* do what we need: build and return
a TTI object that we can then insert into the pass pipeline.
2) Make the TTI object be fully specialized for a particular function.
This will include splitting off a minimal form of it which is
sufficient for the inliner and the old pass manager.
3) Add a new pass manager analysis which produces TTI objects from the
target machine for each function. This may actually be done as part
of #2 in order to use the new analysis to implement #2.
4) Work on narrowing the API between TTI and the targets so that it is
easier to understand and less verbose to type erase.
5) Work on narrowing the API between TTI and its clients so that it is
easier to understand and less verbose to forward.
6) Try to improve the CRTP-based delegation. I feel like this code is
just a bit messy and exacerbating the complexity of implementing
the TTI in each target.
Many thanks to Eric and Hal for their help here. I ended up blocked on
this somewhat more abruptly than I expected, and so I appreciate getting
it sorted out very quickly.
Differential Revision: http://reviews.llvm.org/D7293
llvm-svn: 227669
2015-01-31 04:43:40 +01:00
|
|
|
; The cost model does not have any target information so it just makes boring
|
|
|
|
|
; assumptions.
|
2012-11-02 22:48:17 +01:00
|
|
|
|
2013-01-01 09:00:32 +01:00
|
|
|
; -- No triple in this module --
|
2012-11-02 22:48:17 +01:00
|
|
|
|
2015-07-26 21:10:03 +02:00
|
|
|
; CHECK-LABEL: function 'no_info'
|
|
|
|
|
; CHECK: cost of 1 {{.*}} add
|
|
|
|
|
; CHECK: cost of 1 {{.*}} ret
|
2012-11-02 22:48:17 +01:00
|
|
|
define i32 @no_info(i32 %arg) {
|
|
|
|
|
%e = add i32 %arg, %arg
|
|
|
|
|
ret i32 %e
|
|
|
|
|
}
|
2015-07-26 21:10:03 +02:00
|
|
|
|
|
|
|
|
define i8 @addressing_mode_reg_reg(i8* %a, i32 %b) {
|
|
|
|
|
; CHECK-LABEL: function 'addressing_mode_reg_reg'
|
|
|
|
|
%p = getelementptr i8, i8* %a, i32 %b ; NoTTI accepts reg+reg addressing.
|
|
|
|
|
; CHECK: cost of 0 {{.*}} getelementptr
|
|
|
|
|
%v = load i8, i8* %p
|
|
|
|
|
ret i8 %v
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
; CHECK-LABEL: function 'addressing_mode_scaled_reg'
|
|
|
|
|
define i32 @addressing_mode_scaled_reg(i32* %a, i32 %b) {
|
|
|
|
|
; NoTTI rejects reg+scale*reg addressing.
|
|
|
|
|
%p = getelementptr i32, i32* %a, i32 %b
|
|
|
|
|
; CHECK: cost of 1 {{.*}} getelementptr
|
|
|
|
|
%v = load i32, i32* %p
|
|
|
|
|
ret i32 %v
|
|
|
|
|
}
|
