Displaying 20 results from an estimated 246 matches for "incr".
Did you mean:
inc
2019 Jul 03
3
optimisation issue in an llvm IR pass
Hi Craig,
On 03.07.19 17:33, Craig Topper wrote:
> Don't the CreateICmp calls return a Value* with an i1 type? But then
> they are added to an i8 type? Not sure that works.
I had that initially:
auto cf = IRB.CreateICmpULT(Incr, ConstantInt::get(Int8Ty, 1));
auto carry = IRB.CreateZExt(cf, Int8Ty);
Incr = IRB.CreateAdd(Incr, carry);
it makes no difference to the generated assembly
> Have you tried using the llvm.uadd.with.overflow.i8 intrinsic?
we have tried this:
CallInst *AddOv =
IRB.CreateBinaryIntrinsic(Intr...
2019 Jul 03
2
optimisation issue in an llvm IR pass
...PTR [rsi+rdi*1]
mov ecx,edx // <- not needed
add cl,0x1 // <- should be done to dl instead
adc dl,0x1
mov BYTE PTR [rsi+rdi*1],dl
Far below are both variants with the full code around it, however the
difference in both variants is this:
//variant1
auto cf = IRB.CreateICmpEQ(Incr, ConstantInt::get(Int8Ty, 0));
Incr = IRB.CreateAdd(Incr, cf);
//variant2
auto cf = IRB.CreateICmpULT(Incr, ConstantInt::get(Int8Ty, 1));
Incr = IRB.CreateAdd(Incr, cf);
//interestingly this totally different approach creates the same
instructions as variant2
CallInst *AddOv = IRB.CreateBinaryInt...
2014 Nov 28
2
[LLVMdev] ScalarEvolution: Suboptimal handling of globals
Hi,
For the program below, where "incr" and "Arr" are globals
=================================
int incr;
float Arr[1000];
int foo ()
{
float x = 0;
int newInc = incr+1;
for (int i = 0; i < 1000; i++) {
for (int j = 0; j < 1000; j += incr) {
x += (Arr[i] + Arr[j]);
}
}
return x;
}
========...
2009 May 20
3
qbinom (PR#13711)
Full_Name: Wolfgang Resch
Version: R 2.8.1 GUI 1.27
OS: OS X 10.4.11
Submission from: (NULL) (137.187.89.14)
Strange behavior of qbinom:
> qbinom(0.01, 5016279, 1e-07)
[1] 0
> qbinom(0.01, 5016279, 2e-07)
[1] 16
> qbinom(0.01, 5016279, 3e-07)
[1] 16
> qbinom(0.01, 5016279, 4e-07)
[1] 16
> qbinom(0.01, 5016279, 5e-07)
[1] 0
2010 Jun 19
1
[LLVMdev] Is alloca instruction allowed within the cycle?
...ain() {
for.init:
%i = alloca i32
store i32 0, i32* %i
br label %for.end
for.body:
%obj = alloca %object
%str = getelementptr inbounds [1 x i8]* @str2, i32 0, i32 0
call void @obj_constr(%object* noalias sret %obj, i8* %str)
call void @obj_destr(%object* %obj)
br label %for.incr
for.incr:
%incr = load i32* %i
%incr3 = add i32 %incr,
store i32 %incr3, i32* %i
br label %for.end
for.end:
%iload = load i32* %i
%xcmp = icmp sge i32 %iload, 100000000
br i1 %xcmp, label %xend, label %for.body
xend:
ret void
}
2009 Jul 17
2
Remembering a value in multiple calls of a function
Hello,
I tried this pseudo-generator style experiment (see below). The "<<-"
operator assigns to in the calling environment which would be the
environment of "getN".
Yet when the function incr is returned, isn't this environment lost?
Also the print displays GlobalEnv, yet the globalenv does not have any
mention of startgiven.
This code was inspired from and old issue of RJournal , but I'm not
sure how this works.
I'm not sure how this works and an explanation would be helpf...
2020 Aug 21
1
qnbinom with small size is slow
...thanks for verifying. I agree that the Cornish-Fisher seems to struggle
with the small size parameters, but I also don't have a good idea how to
replace it.
But I think fixing do_search() is possible:
I think the problem is that when searching to the left y is decremented
only if `pnbinom(y - incr, n, pr, /*l._t.*/TRUE, /*log_p*/FALSE)) < p` is
FALSE. I think the solution is to move the update of y before the if.
However, I need to make this slightly awkward check if incr == 1, so that
the return in line 123 and the do-while block at the end of qnbinom() do
not need to be modified.
diff...
2014 Aug 31
0
[PATCH envytools] nvamemtiming: Handle target < initial case when iterating values
...ff --git a/nva/set_timings.c b/nva/set_timings.c
index 6cd831c..7a8f845 100644
--- a/nva/set_timings.c
+++ b/nva/set_timings.c
@@ -408,7 +408,7 @@ static void
iterate_values(struct nvamemtiming_conf *conf, FILE *outf, uint8_t index, enum color color)
{
uint8_t initial, target;
- int v;
+ int v, incr;
if (conf->mode != MODE_DEEP)
return;
@@ -416,7 +416,8 @@ iterate_values(struct nvamemtiming_conf *conf, FILE *outf, uint8_t index, enum c
initial = conf->vbios.data[conf->vbios.timing_entry_offset + index];
target = conf->vbios.data[conf->deep.timing_entry_offset + index]...
2011 Apr 28
1
using lme4 with three nested random effects
Hi all,
I'm trying to fit models for data with three levels of nested random
effects: site/transect/plot. For example,
modelincrBS<-glmer(l.ru.ba.incr~shigo.av+pre.f.crwn.length+bark.thick.bh+Date+slope.pos.num+dens.T+dbh+leaf.area+can.pos.num+(1|site/transect/plot),
data=rws30.UL, family=gaussian, na.action=na.omit)
but I get the following error:
Error: length(f1) == length(f2) is not TRUE
In addition: Warning messages...
2020 Oct 16
1
[PATCH v4 09/10] dma-buf-map: Add memcpy and pointer-increment interfaces
Hi Thomas.
On Thu, Oct 15, 2020 at 02:38:05PM +0200, Thomas Zimmermann wrote:
> To do framebuffer updates, one needs memcpy from system memory and a
> pointer-increment function. Add both interfaces with documentation.
>
> Signed-off-by: Thomas Zimmermann <tzimmermann at suse.de>
Looks good.
Reviewed-by: Sam Ravnborg <sam at ravnborg.org>
> ---
> include/linux/dma-buf-map.h | 72 +++++++++++++++++++++++++++++++------
> 1 file ch...
2004 Jun 22
1
Multiple --compare-dest args again
...or --link-dest arguments, allowing
fetching of files not present in multiple trees. I never got any
feedback on it, though, so I'm picking it up again. :) Is there any
interest in such a patch at all?
Below is the usage example i outlined back then;
--start--
[...] Its primary usage is to do incremental
backups on top of eachother. (My current backup system stores each
incremental as a set of files that differ from the latest full.)
Example:
First full backup:
rsync -a somedir full-20040415/
First incremental:
rsync -a --compare-dest=../full-20040415 \
somedir incr-20040...
2016 Oct 19
4
Bacula Restore
Hi list,
another question about bacula, but this time about restoring backups.
I've a server that I must backup every day. My plan is:
from mon to sat incrimental backup
and on sunday full backup.
When I will perform a restore I must restore from last valid full
backup and then all valid incremental backup from last backup to
specific date.
This server has aweb managed application where user can update data or
delete data.
Suppose that after a...
2014 Aug 31
6
[PATCH envytools] nvbios: Add missing null byte to string read from file.
---
nvbios/nvbios.c | 5 +++--
1 file changed, 3 insertions(+), 2 deletions(-)
diff --git a/nvbios/nvbios.c b/nvbios/nvbios.c
index f7aafe3..28e62ad 100644
--- a/nvbios/nvbios.c
+++ b/nvbios/nvbios.c
@@ -774,11 +774,12 @@ int set_strap_from_string(const char* strap_s)
int set_strap_from_file(const char *path)
{
FILE *strapfile = NULL;
- char tmp[21];
+ char tmp[22];
strapfile =
2014 Sep 02
3
[LLVMdev] LICM promoting memory to scalar
...CM/scalar-promote-memmodel.ll
However, I have a sample code where GCC is able to promote the memory to scalar and hoist/sink load/store out of loop but LLVM cannot.
Is GCC being aggressive here or LLVM missing out an opportunity?
Here is my sample code:
extern int globalvar;
void foo(int n , int incr) {
unsigned int i;
for (i = 0 ; i < n; i += incr ) {
if (i < n/2)
globalvar += incr;
}
return;
}
GCC output:
$ aarch64-linux-gnu-g++ -S -o - -O3 -ffast-math -march=armv8-a+simd test.cpp
.arch armv8-a+fp+simd
.file "test.cpp"
.text...
2020 Aug 10
2
qnbinom with small size is slow
Thanks Ben for verifying the issue. It is always reassuring to hear
when others can reproduce the problem.
I wrote a small patch that fixes the issue
(https://github.com/r-devel/r-svn/pull/11):
diff --git a/src/nmath/qnbinom.c b/src/nmath/qnbinom.c
index b313ce56b2..d2e8d98759 100644
--- a/src/nmath/qnbinom.c
+++ b/src/nmath/qnbinom.c
@@ -104,6 +104,7 @@ double qnbinom(double p, double size,
2007 Aug 16
4
Linear models over large datasets
I'd like to fit linear models on very large datasets. My data frames
are about 2000000 rows x 200 columns of doubles and I am using an 64
bit build of R. I've googled about this extensively and went over the
"R Data Import/Export" guide. My primary issue is although my data
represented in ascii form is 4Gb in size (therefore much smaller
considered in binary), R consumes about
2002 Oct 04
2
spline bug ?
# Is this a bug or something I don't understand?
spline(date, stor, n=52, xmin=mind, xmax=maxd)
# gives length(x) of 53 ????, but y has the expected length of 52
# Shouldn't they be the same length? From help (spline):
# spline returns a list containing components x and y which give the
# ordinates where interpolation took place and the interpolated values
# xmin and xmax are inside
2016 Jan 27
2
NT_STATUS_CONNECTION_REFUSED
...lse
> dns_lookup_kdc = true
>
> Should only as I get it from a forgotten test platform where I set
> dns_lookup_realm = true
>
> Cheers,
>
> mathias
>
Hi Mathias, this is a member server not a DC.
>
> 2016-01-27 2:03 GMT+01:00 Henry McLaughlin <henry at incred.com.au>:
>
>> On 27 January 2016 at 08:24, Rowland penny <rpenny at samba.org> wrote:
>>
>> > On 26/01/16 20:54, Henry McLaughlin wrote:
>> >
>> >> [root at centos7member ~]# net rpc rights list accounts
>> >> -U'TESTING\admini...
2020 Oct 15
0
[PATCH v4 09/10] dma-buf-map: Add memcpy and pointer-increment interfaces
To do framebuffer updates, one needs memcpy from system memory and a
pointer-increment function. Add both interfaces with documentation.
Signed-off-by: Thomas Zimmermann <tzimmermann at suse.de>
---
include/linux/dma-buf-map.h | 72 +++++++++++++++++++++++++++++++------
1 file changed, 62 insertions(+), 10 deletions(-)
diff --git a/include/linux/dma-buf-map.h b/include/...
2014 Sep 02
2
[LLVMdev] LICM promoting memory to scalar
...e code where GCC is able to promote the memory to scalar and hoist/sink load/store out of loop but LLVM cannot.
>> Is GCC being aggressive here or LLVM missing out an opportunity?
>>
>> Here is my sample code:
>>
>> extern int globalvar;
>> void foo(int n , int incr) {
>> unsigned int i;
>> for (i = 0 ; i < n; i += incr ) {
>> if (i < n/2)
>> globalvar += incr;
>> }
>> return;
>> }
>>
>> GCC output:
>>
>> $ aarch64-linux-gnu-g++ -S -o - -O3 -ffast-math -march=armv8-a+si...