Displaying 2 results from an estimated 2 matches for "movhlpscost".
2009 May 01
0
[LLVMdev] RFC: AVX Pattern Specification [LONG]
...movddup) {
unsigned movddupcost = ... // can be either constant, or
callback into subtarget info
if (LowestCost > movddupcost)
LowestCost = movddupcost;
operands = [whatever]
opcode = X86::MOVDDUP;
}
}
if (N can be matched by movhlps) {
unsigned movhlpscost = ...
if (LowestCost > movhlpscost)
LowestCost = movhlpscost;
operands = [whatever]
opcode = X86::MOVHLPS;
}
}
...
}
The advantage of doing this is that it moves the current heuristics
for match ordering (which is a poor way to model costs) into a
declar...
2009 May 01
4
[LLVMdev] RFC: AVX Pattern Specification [LONG]
On Friday 01 May 2009 13:46, Chris Lattner wrote:
> Right, a lot of these problems can be solved by some nice refactoring
> stuff. I'm also hoping that some of the complexity in defining
> shuffle matching code can be helped by making the definition of the
> shuffle patterns more declarative within the td file. It would be
> really nice to say that "this shuffle does a