Displaying 20 results from an estimated 5000 matches similar to: "Loop splitting as a special case of unswitch"
2018 Feb 22
0
Loop splitting as a special case of unswitch
On Fri, Feb 23, 2018 at 12:15 AM, Jun Lim via llvm-dev
<llvm-dev at lists.llvm.org> wrote:
> For the example code below,
> int L = M + 10;
> for (k = 1 ; k <=L; k++) {
> dummy();
> if (k < M)
> dummy2();
> }
> , we can split the loop into two parts like :
>
> for (k = 1 ; k != M; k++) {
> dummy();
> dummy2();
> }
2018 Feb 22
1
Loop splitting as a special case of unswitch
On 2018-02-22 16:21, Roman Lebedev wrote:
> On Fri, Feb 23, 2018 at 12:15 AM, Jun Lim via llvm-dev
> <llvm-dev at lists.llvm.org> wrote:
>> For the example code below,
>> int L = M + 10;
>> for (k = 1 ; k <=L; k++) {
>> dummy();
>> if (k < M)
>> dummy2();
>> }
>> , we can split the loop into two parts like :
2017 Jul 16
2
A bug related with undef value when bootstrap MemorySSA.cpp
This is a bug found by internal compiler bootstrap, and possibly it is
the root cause of https://bugs.llvm.org/show_bug.cgi?id=33652 and
https://bugs.llvm.org/show_bug.cgi?id=33626.
Here is the testcase 1.c. The original code is at MemorySSA.cpp:586
for rL307764.
------------------------- 1.c ---------------------------
long a, c, d, e, f, m, cnt, i_hasval;
volatile long b;
void goo(long);
void
2011 Jan 11
5
A question on dummy variable
Dear all, I would like to ask one question related to statistics, for
specifically on defining dummy variables. As of now, I have come across 3
different kind of dummy variables (assuming I am working with Seasonal
dummy, and number of season is 4):
> dummy1 <- diag(4)
> for(i in 1:3) dummy1 <- rbind(dummy1, diag(4))
> dummy1 <- dummy1[,-4]
>
> dummy2 <- dummy1
>
2011 Jan 03
1
Formatted output with alternating format at different rows
Dear all,
I have a simple question. I couldn't find a solution in the
forums/R-user manual; I have also asked to my friends who use R, but
couldn't get any answer from them either. I would appreciate any
solutions.
I want to write formatted text file like in Fortran. More specifically
with the format choice of mine for any given line (more specifics are
given below).
The R function
2013 Mar 21
4
easy way of paste
Hello,
Is there a better way to use paste such as:
a = paste(colnames(list.indep)[1],colnames(list.indep)[2],colnames(list.indep)[3],colnames(list.indep)[4],colnames(list.indep)[5],sep="+")
> a
[1] "aa+dummy1+dummy2+bb+cc"
I tried
a = paste(colnames(list.indep)[1:5],sep="+")
> a
[1] "aa" "dummy1" "dummy2"
2018 Apr 29
0
FYI, planning to enable nontrivial loop unswitch in the new PM at O3
Is there any written description of what "non trivialness" is there?
On Sun, Apr 29, 2018, 2:49 PM Chandler Carruth via llvm-dev <
llvm-dev at lists.llvm.org> wrote:
> One of the last big missing pieces for the new PM is enabling non-trivial
> loop unswitch at O3.
>
> The pass is now working well and passing all the testing I have done as
> well as some others'
2018 Apr 29
2
FYI, planning to enable nontrivial loop unswitch in the new PM at O3
One of the last big missing pieces for the new PM is enabling non-trivial
loop unswitch at O3.
The pass is now working well and passing all the testing I have done as
well as some others' testing (thanks Fedor!) so it should be ready to be
enabled.
I've done preliminary benchmarking on the test suite and SPEC and haven't
seen any interesting regressions and quite a few improvements.
2001 Mar 13
1
.C-calls
Dear all,
(sorry I got the wrong button for subscribing a minute ago)
At the moment I'm writing on a package for random field
simulation that I'd like to make publically availabe
in near future.
To this end I've asked Martin Maechler to have a look
at my R-code. He was very surprised about how
I perform the ".C"-calls, and encouraged me to
make this request for comments.
2015 May 27
2
dummy interface shenanigans - CentOS6
tl;dr - a renamed dummy interface is not persisting across reboots on Cent6.
I have a situation where I need to rename a dummy interface on my system.
I have a total of 3 dummy interfaces:
dummy0
dummy1
adummy0
I've been doing some puppet testing in a vbox VM to get this all
sorted out to deploy to a group of boxes. Every time I reboot my VM,
it comes up WITHOUT adummy0, but I notice
2013 Mar 21
2
How to store data frames into pdf file and csv file.
Hello,
I have a data frame
> mdl.summary
est.coef std.err t.stat
intercept 0.0011625517 0.0002671437 4.351784
aa -0.0813727439 0.0163727943 -4.969997
dummy1 -0.0002534873 0.0001204000 -2.105376
dummy2 -0.0007784864 0.0001437537 -5.415417
bb -0.0002856727
2015 May 27
1
dummy interface shenanigans - CentOS6
Frank Even wrote:
> On Wed, May 27, 2015 at 1:37 AM, Frank Even
> <lists+centos.org at elitists.org> wrote:
>> tl;dr - a renamed dummy interface is not persisting across reboots on
>> Cent6.
>>
>> I have a situation where I need to rename a dummy interface on my
>> system.
>>
>> I have a total of 3 dummy interfaces:
>>
>> dummy0
2013 Feb 24
2
[LLVMdev] How to measure the overhead of instrumented code
Hello all,
I have developed a instrumented pass which insert some variables between
the original variables,
as well as insert some code into the original source code. just like:
============= original source code =============
int a[10];
void fun1 () {
// some source code here
}
=========================================
============= instrumented source code =============
int
2017 Jul 18
2
A bug related with undef value when bootstrap MemorySSA.cpp
On 07/18/2017 06:03 PM, David Majnemer via llvm-dev wrote:
> I doubt it is possible for us to try and make any fix which is
> predicated on eagerly treating undef in a particular way, refinement
> will always cause these problems to come about...
>
> Given what I've seen in LLVM (and what I've learned from other
> compilers), we probably have two choices:
> 1.
2015 Jun 17
1
Re: [PATCH v4 1/3] do_btrfs_qgroup_show: fix a bad return value
On Wednesday 17 June 2015 16:19:31 Chen Hanxiao wrote:
> We should not use tmp lines buffer as return value,
> for lines buffer will be freed.
s/tmp/temporary/
> Signed-off-by: Chen Hanxiao <chenhanxiao@cn.fujitsu.com>
> ---
> v4: take advantage of sscanf's '%m'.
> v3: fix test case failure
>
> daemon/btrfs.c | 40
2013 Nov 03
0
[LLVMdev] loop vectorizer issue
Hi Sarah,
the loop vectorizer runs not on the C code but on LLVM IR this c code was lowered to. Before the loop vectorizer runs many other optimization change the shape of this IR.
You can see in the LLVM IR you referenced below, a preceding LLVM IR transformation has change your loop from:
> for(int k=20;k<50;k++)
> dataY[k] = dataY[k-1];
to
> int a = d[19];
>
2013 Nov 03
3
[LLVMdev] loop vectorizer issue
Actually what I meant in my original loop, that there is a dependency
between every two consecutive iterations. So, how the loop vectorizer says
'we can vectorize this loop'?
for(int k=20;k<50;k++)
dataY[k] = dataY[k-1];
From: Henrique Santos [mailto:henrique.nazare.santos at gmail.com]
Sent: Sunday, November 03, 2013 4:28 PM
To: Sara Elshobaky
Cc: <llvmdev at
2015 Feb 05
2
Invalid read of size 8
Hi,
I have a R program that call a C function. I define a vector of pointer as
int nLC=3;
int pownLC = nLC*nLC
double *MatCovExtra[nT+1];
for(k=0;k<K+1;k++)
{
MatCovExtra[k] = (double*)R_alloc(pownLC, sizeof(double));
}
where nT>K. Then i put some values on the vector associated with the
pointer:
for(k=0;k<K+1;k++)
{
for(i=0;i<nLC;i++)
2019 Dec 06
2
[DWARF5][SplitDwarf] question on using fsplit-dwarf-inlining option
Hi DebugInfo folks,
I have a question on using fsplit-dwarf-inlining option:
"-fsplit-dwarf-inlining, -fno-split-dwarf-inlining
Provide minimal debug info in the object/executable to facilitate online
symbolication/stack traces in the absence of .dwo/.dwp files when using
Split DWARF"
i.e. it puts some debug info into compilation unit from First
partition(with Skeleton unit).
At
2017 Jul 01
2
Jacobi 5 Point Stencil Code not Vectorizing
I am able to vectorize it with the following code;
#include <stdio.h>
#define N 100351
// This function computes 2D-5 point Jacobi stencil
void stencil(int a[][N], int b[][N])
{
int i, j, k;
for (k = 0; k < N; k++) {
for (i = 1; i <= N-2; i++)
for (j = 1; j <= N-2; j++)
b[i][j] = 0.25 * (a[i][j] + a[i-1][j] + a[i+1][j] + a[i][j-1] +
a[i][j+1]);
for