Displaying 20 results from an estimated 800 matches similar to: "[LLVMdev] How to unroll loop with non-constant boundary"
2012 Feb 27
2
[LLVMdev] How to unroll loop with non-constant boundary
On Mon, Feb 27, 2012 at 9:30 AM, Benjamin Kramer
<benny.kra at googlemail.com> wrote:
>
> On 27.02.2012, at 17:13, Николай Лихогруд wrote:
>
>> Dear LLVM,
>>
>> Consider two loops with one interation -
>> First with constant lower bound, second with usual non-constant lower bound:
>>
>> int main(int argc, char ** argv)
>> {
2012 Feb 27
0
[LLVMdev] How to unroll loop with non-constant boundary
On 27.02.2012, at 17:13, Николай Лихогруд wrote:
> Dear LLVM,
>
> Consider two loops with one interation -
> First with constant lower bound, second with usual non-constant lower bound:
>
> int main(int argc, char ** argv)
> {
> int numOfIterations= 1;
> int stride=1;
> int lowerBound = 1000; - 1st | int lowerBound =
2012 Feb 27
0
[LLVMdev] How to unroll loop with non-constant boundary
On 27.02.2012, at 18:49, Eli Friedman wrote:
> On Mon, Feb 27, 2012 at 9:30 AM, Benjamin Kramer
> <benny.kra at googlemail.com> wrote:
>>
>> On 27.02.2012, at 17:13, Николай Лихогруд wrote:
>>
>>> Dear LLVM,
>>>
>>> Consider two loops with one interation -
>>> First with constant lower bound, second with usual
2012 Feb 27
2
[LLVMdev] How to unroll loop with non-constant boundary
Hi Benjamin,
> LLVM misses this optimization because ScalarEvolution's ComputeExitLimitFromICmp doesn't handle signed<= (SLE) and thus can't compute the number of times the loop is executed. I wonder if there's a reason for this, it seems like something simple to add.
instsimplify could also be enhanced to clean it up in this particular case, but
it would be better to make
2012 Mar 07
2
[LLVMdev] How to unroll loop with non-constant boundary
Hi guys,
I attached the modified patch that handles cases with low==end and stride!=1.
Please find it for review.
-Stepan
28.02.2012, 17:41, "Benjamin Kramer" <benny.kra at googlemail.com>:
> On 27.02.2012, at 20:17, Duncan Sands wrote:
>
>> Hi Benjamin,
>>> LLVM misses this optimization because ScalarEvolution's ComputeExitLimitFromICmp doesn't
2012 Feb 28
0
[LLVMdev] How to unroll loop with non-constant boundary
On 27.02.2012, at 20:17, Duncan Sands wrote:
> Hi Benjamin,
>
>> LLVM misses this optimization because ScalarEvolution's ComputeExitLimitFromICmp doesn't handle signed<= (SLE) and thus can't compute the number of times the loop is executed. I wonder if there's a reason for this, it seems like something simple to add.
>
> instsimplify could also be enhanced
2012 Mar 07
0
[LLVMdev] How to unroll loop with non-constant boundary
Stepan Dyatkovskiy wrote:
> Hi guys,
> I attached the modified patch that handles cases with low==end and stride!=1.
I don't see how this could be correct. Your patch treats 'X s<= Y' as 'X
s< Y+1', which is incorrect when Y is INT_MAX. Wouldn't that turn an
infinite loop into a zero-trip loop?
To be clear, this is the flaw in Benjamin's patch which you
2012 Nov 26
2
[LLVMdev] RFC: change BoundsChecking.cpp to use address-based tests
I am investigating changing BoundsChecking to use address-based rather
than size- & offset-based tests.
To explain, here is a short code sample cribbed from one of the tests:
%mem = tail call i8* @calloc(i64 1, i64 %elements)
%memobj = bitcast i8* %mem to i64*
%ptr = getelementptr inbounds i64* %memobj, i64 %index
%4 = load i64* %ptr, align 8
Currently, the IR for bounds checking
2012 Nov 26
0
[LLVMdev] RFC: change BoundsChecking.cpp to use address-based tests
Hi Kevin,
Thanks for your interest and for your deep analysis.
Unfortunately, your approach doesn't catch all bugs and is vulnerable to an
attack.
Consider the following case:
...................... | ----- obj --- | |
end ^ ptr ^ ^ end-of-memory
The scenario is as follows:
- an object is allocated in the last page of the address space
- obj is byte
2017 Sep 05
1
BUILTIN\Administrators - failed to call wbcSidToUid: WBC_ERR_DOMAIN_NOT_FOUND
Well, we are getting somewere...;)
>It is probably 'greyed' out because no Windows tools use it or will
add it. You will probably need to use Unix tools (ldb or ldap) to
remove>them, but you can if you so wish ignore them. What you should
never do is to rely on them being there, because they may or may not be
there.Ok, I'll let it be there> You need to remove the gidNumber
2018 Nov 01
4
Fwd: RFC: Adding debug information to LLVM to support Fortran
*From:* flang-dev <flang-dev-bounces at lists.flang-compiler.org> *On Behalf
Of *Eric Schweitz (PGI)
*Sent:* Thursday, November 01, 2018 1:02 PM
*To:* flang-dev at lists.flang-compiler.org
*Subject:* [Flang-dev] RFC: Adding debug information to LLVM to support
Fortran
In order to support debugging in the Flang project, work has been done to
extend LLVM debug information for the Fortran
2012 Dec 04
2
[LLVMdev] RFC: change BoundsChecking.cpp to use address-based tests
Nuno,
Inspired by this email thread, I spent a bit of time today looking
through the implementation of BoundsChecking::instrument(..). Based on
my reading of prior work, it should be possible to do these checks in
two comparisons, or possibly even one if the right assumptions could be
made.
Could you provide a bit of background of the expected domains of Size
and Offset? In particular,
2006 Feb 01
1
Help with functions
Dear R-users
I intend to create a function which calls some smaller other functions in return. Some of these smaller functions all call some functions. I do not know a good way to do this. I tried using the source() function to include the smaller functions within the main functions before they are called. This does not work, or maybe i am not doing the right thing.
For example:
the
2012 Dec 04
0
[LLVMdev] RFC: change BoundsChecking.cpp to use address-based tests
Hi,
> Could you provide a bit of background of the expected domains of Size and
> Offset? In particular, are they signed or unsigned integers? A
> non-negative size doesn't seem to make much sense in this context, but
> depending on how it's calculated I could see it arising. Is a zero Size
> something that might arise here? I'm assuming the Offset comes from an
2016 Apr 09
0
[FORGED] Generating random data with non-linear correlation between two variables
The goal is to test a developed model against two sets of hypothetical data, where the relationship between on data set is linear whereas non-linear (e.g., polynomial) with another. However, the distributions of the v1 and v2 should not be other than normal or slightly positively skewed or slightly negatively skewed.
In Oracle, random data is generated with packaged function
2016 Oct 26
3
NT_STATUS_INVALID_SID
I have a brand-new install of Debian 8 without systemd and a
freshly-built Samba 4 install with issues. I created this as a
standalone AD DC, setup group policies, etc and then took it to the
client location. Now nothing works. I keep getting "RPC server
unavailable" on Windows machines and trying to list shares on the DC
itself results in NT_STATUS_INVALID_SID. I am lost as there are
2016 Apr 09
1
[FORGED] Generating random data with non-linear correlation between two variables
> On 09 Apr 2016, at 13:09 , Muhammad Bilal <Muhammad2.Bilal at live.uwe.ac.uk> wrote:
>
> The goal is to test a developed model against two sets of hypothetical data, where the relationship between on data set is linear whereas non-linear (e.g., polynomial) with another. However, the distributions of the v1 and v2 should not be other than normal or slightly positively skewed or
2010 Aug 07
1
Samba4 questions (idmap, forest, inter-domain trust)
Hello everyone,
I am trying to go after learning Samba4 from two directions. Code and
implementing it. (If you know Samba4, please help me answer the
questions after the brief explanation.)
I have used the following scenario before, it is real and a way for me
to learn things:
My siblings and I are setting up some family services (over VPN, etc.).
There are X of us, including 1 being
2016 Apr 09
3
[FORGED] Generating random data with non-linear correlation between two variables
Please specify your goal in the oracle/psql analytical functions you know or specify what you mean by nonlinear correlation
Sent from my iPhone
> On Apr 9, 2016, at 6:09 AM, Muhammad Bilal <Muhammad2.Bilal at live.uwe.ac.uk> wrote:
>
> No its not. I am doing all these experiments for my own learning purpose. I am Oracle SQL & PLSQL programmer and I can do these things with
2018 May 03
4
adding overall constraint in optim()
Hi ?
This is giving me a headache. I?m trying to do a relatively simple optimization ? actually trying to approximate the output from the Excel Solver function but at roughly 1000x the speed. ?
The optimization parameters look like this. The only trouble is that I want to add a constraint that sum(wgt.vect)=1, and I can?t figure out how to do that in optim.
Mo.vect <-