Displaying 20 results from an estimated 1000 matches similar to: "[LLVMdev] Listing all loops in a function"
2009 Oct 12
3
[LLVMdev] Accessing Loop Variables
Hi,
How do I access the loop variables in a loop.
for(i = 0; i < N; i++)
for(j = 0; j < M; j++)
A[i][j+k] = i + j;
Is there anyway for me to know that in A[i][j+k], i & j are loop variables
whereas k is not!
Regards,
Prasenjit Chakraborty
Performance Modeling and Analysis
IBM Systems & Technology Lab
2009 Oct 12
0
[LLVMdev] Accessing Loop Variables
On Oct 12, 2009, at 3:46 AM, Prasenjit Chakraborty wrote:
>
> Hi,
> How do I access the loop variables in a loop.
>
> for(i = 0; i < N; i++)
> for(j = 0; j < M; j++)
> A[i][j+k] = i + j;
>
> Is there anyway for me to know that in A[i][j+k], i & j are loop
> variables
> whereas k is not!
The ScalarEvolution analysis can help here.
2012 Dec 03
1
[LLVMdev] X86 rsqrt instruction generated
Hi,
Please find attached the modified patch and description. We have modified and retested the patch taking into consideration the comments and inputs provided earlier.
Thanks & Regards,
soham
-----Original Message-----
From: Eli Friedman [mailto:eli.friedman at gmail.com]
Sent: Thursday, November 15, 2012 12:59 PM
To: Chakraborty, Soham
Cc: llvmdev at cs.uiuc.edu
Subject: Re: [LLVMdev]
2012 Nov 15
0
[LLVMdev] X86 rsqrt instruction generated
On Wed, Nov 14, 2012 at 10:43 PM, Chakraborty, Soham
<Soham.Chakraborty at amd.com> wrote:
> Hi,
>
>
>
> We have implemented the rsqrt instruction generation for X86 target
> architecture. We have introduced a flag -fp-rsqrt flag which controls the
> generatation of X86 rsqrt instruction generation.
>
> We have observed minor effects on precision due to rsqrt and
2009 Jan 12
2
error messgae
Hello,
I am having problems getting one xlite clients to communicate through
asterisk. I am getting an error message:
chan_sip.c:15593 handle_request_register: Registration from '"chinmay
chakraborty"<sip:1234 at 10.44.32.193 <sip%3A1234 at 10.44.32.193>>' failed
for '10.44.32.193' - No matching peer found
sip show peers
Name/username Host
2011 Nov 30
0
[LLVMdev] Fwd: Problem getting LoopInfo inside non-LoopPass
The following code is causing an "UNREACHABLE executed!" and a stack dump,
any ideas?
namespace {
struct myPass : public CallGraphSCCPass {
static char ID;
myPass() : CallGraphSCCPass(ID) {}
virtual void getAnalysisUsage(AnalysisUsage &AU) const {
AU.setPreservesAll();
AU.addRequired<LoopInfo>();
}
virtual bool runOnSCC(CallGraphSCC &SCC)
2011 Nov 30
2
[LLVMdev] Fwd: Problem getting LoopInfo inside non-LoopPass
On Tue, Nov 29, 2011 at 6:59 PM, Ryan Taylor <ryta1203 at gmail.com> wrote:
> The following code is causing an "UNREACHABLE executed!" and a stack dump,
> any ideas?
The stack might be handy.
> namespace {
> struct myPass : public CallGraphSCCPass {
> static char ID;
> myPass() : CallGraphSCCPass(ID) {}
> virtual void getAnalysisUsage(AnalysisUsage
2011 Nov 30
0
[LLVMdev] Fwd: Problem getting LoopInfo inside non-LoopPass
UNREACHABLE executed!
0 opt 0x00000000008edc2f
1 opt 0x00000000008edfda
2 libpthread.so.0 0x00007f9c8e69bc60
3 libc.so.6 0x00007f9c8d986d05 gsignal + 53
4 libc.so.6 0x00007f9c8d98aab6 abort + 390
5 opt 0x00000000008da974 llvm::llvm_unreachable_internal(char
const*, char const*, unsigned int) + 356
6 opt 0x000000000087e046
7 opt
2010 Jul 27
2
lattice: option to sort x when type = l
Hi,
(please Cc me)
In xyplot (), type = "l" (or one that includes "l", *el*) is
(generally) meaningful only when the 'x' variable is sorted. In
practice, one either sorts the data frame before hand or writes a tiny
panel function which sorts the supplied x and then calls the default
panel.xyplot(). Trouble arises when there is a conditional variable as
well as a
2011 Dec 01
1
[LLVMdev] Problem getting LoopInfo inside non-LoopPass
In addition to the link below, please check for functions like "llvm.debug.declare", "llvm.debug.value", as you will not get LoopInfo for these.
Pankaj
________________________________
From: Devang Patel <dpatel at apple.com>
To: Ryan Taylor <ryta1203 at gmail.com>
Cc: llvmdev at cs.uiuc.edu
Sent: Wednesday, November 30, 2011 11:08 PM
Subject: Re: [LLVMdev]
2011 Dec 01
0
[LLVMdev] Problem getting LoopInfo inside non-LoopPass
Thanks for the info. Curious, do you know if there is an opt that will put
all loops, including nested ones, in functions (ie each loop in it's own
function)? What I'm trying to do is create a way for each loop to have only
one exit. I want all loops to be single exit loops?
I can write my own pass but I'd rather not. I think that if I can put
each loop into it's own function
2013 Aug 29
6
[PATCH 2/3 v3] Refactor MSI restore call-chain to drop unnecessary argument
Driver init call graph under baremetal:
driver_init->
msix_capability_init->
msix_program_entries->
msix_mask_irq->
entry->masked = 1
request_irq->
__setup_irq->
irq_startup->
unmask_msi_irq->
msix_mask_irq->
entry->masked = 0
So
2011 Jul 28
1
[RFC net-next PATCH 3/4] ethtool: Add new set commands
On Jul 28, 2011, at 1:38 PM, Rose, Gregory V wrote:
>
>> From: Anirban Chakraborty [mailto:anirban.chakraborty at qlogic.com]
>> Sent: Thursday, July 28, 2011 12:04 PM
>> To: Rose, Gregory V
>> Cc: David Miller; netdev; Ben Hutchings; Kirsher, Jeffrey T
>> Subject: Re: [RFC net-next PATCH 3/4] ethtool: Add new set commands
>>
>>
>> On Jul 28,
2011 Jul 28
1
[RFC net-next PATCH 3/4] ethtool: Add new set commands
On Jul 28, 2011, at 1:38 PM, Rose, Gregory V wrote:
>
>> From: Anirban Chakraborty [mailto:anirban.chakraborty at qlogic.com]
>> Sent: Thursday, July 28, 2011 12:04 PM
>> To: Rose, Gregory V
>> Cc: David Miller; netdev; Ben Hutchings; Kirsher, Jeffrey T
>> Subject: Re: [RFC net-next PATCH 3/4] ethtool: Add new set commands
>>
>>
>> On Jul 28,
2006 Jan 10
0
[LLVMdev] passmanager, significant rework idea...
On Mon, 9 Jan 2006, Saem Ghani wrote:
> The patch below basically hammers out some ideas as to where I'd like
> to take the passmanager in LLVM. I've tried thinking things through,
> but I'm still a n00b, so some criticism would be more than welcome. =)
>
> Starting from line 191 down. If you're wondering why I created a
> patch, well that's because I found
2012 Nov 27
2
order.max specification problem in the ar.ols function
Hello
I am facing a curious problem.I have a time series data with which i want to
fit auto-regressive model of order p, where p runs from 1:9.I am using a
for loop which will fit an AR(p) model for each value of p using the
*ar.ols* function.
I am using the following code
for ( p in 1:9){
a=ar.ols (x=data.ts, order.max=p, demean=T, intercept=T)
}
Specifying the *order.max* to be p, it gives me a
2007 May 07
1
Signaling tones in Speex
In case a system is incapable of fax relay or if it is disabled, one of the
easiest and safest options is to go for 40 kbps ADPCM compression (for fax
upto 14.4 kbps)..even am new to this problem and the fair bit of seraching
which i've done seems to suggest that the standard sloutions are to simply
'bypass' it else compress using ADPCM (40 k for fax upto 14.4 k, 32 k for
fax upto 9.6
2010 Apr 30
1
Trouble using Ecdf () from the Hmisc library
Hello:
[Kindly Cc when replying]
The question in a nutshell is this: Is there a more robust alternative
to Ecdf ()?
The details:
I've used Ecdf () _a lot_ over the past few years and I have learned
to live with its warnings. But I am running short on time and patience
now [*] Here is a reproducible example:
> library (Hmisc)
> x <- read.csv ( file =
2013 Jan 05
1
[LLVMdev] Compiler opt is turned off ?
I completely agree with you.
The source code I wrote here has the main function and is a complete code.
That's why I was expecting load/store analysis could have been incorporated
across the module. Thanks.
On Fri, Jan 4, 2013 at 10:43 PM, Daniel Berlin <dberlin at dberlin.org> wrote:
> I'm not sure what you mean by "use" check.
> If you compile this with LTO and
2006 Jan 10
1
[LLVMdev] Re: passmanager, significant rework idea...
On 1/10/06, Chris Lattner <sabre at nondot.org> wrote:
> Interesting approach. :)
Thanks.
> Comments below, with ***'s before the notes:
> +class LoopPass : public Pass {}; // Temporary.
>
> *** I wouldn't worry about loop passes yet.
Sure.
> +class PassUnit {
> + Pass *pass;
> +
> + enum Traversal {
> + LINEAR, // Standard top down