Displaying 2 results from an estimated 2 matches for "aesencryptdecrypt".
2009 Oct 07
0
[LLVMdev] What opt pass attempts implements this optimization?
On Oct 6, 2009, at 4:28 PM, Villmow, Micah wrote:
> I have a very simple kernel that is generating very very bad code.
>
> The basic kernel pseudo-code is as follows:
> forloop(1 to n) {
> forloop(0 to j) {
> A
> }
> B
> }
> C
>
> It is generating very ugly and inefficient code for a vector system
> similar to the following pseudo-code:
> if (n >
2009 Oct 06
2
[LLVMdev] What opt pass attempts implements this optimization?
I have a very simple kernel that is generating very very bad code.
The basic kernel pseudo-code is as follows:
forloop(1 to n) {
forloop(0 to j) {
A
}
B
}
C
It is generating very ugly and inefficient code for a vector system
similar to the following pseudo-code:
if (n > 1) {
if (j) {
forloop(1 to n) {
forloop(0 to j) {