Displaying 20 results from an estimated 10000 matches similar to: "[LLVMdev] function instead of 'goto' in C backend"
2004 Jul 22
0
[LLVMdev] GC questions.
On Thu, 22 Jul 2004, Tobias Nurmiranta wrote:
> > Unfortunately this won't really work. It might be reasonable to include
> > something like this in the front-end that you're working on, but including
> > this at the LLVM level is a bad idea. The basic idea of the alloca model
> > is that it directly exposes to the optimizer the fact that GC pointers may
> >
2009 Feb 24
0
[LLVMdev] Profiling in LLVM
Hi all,
I plan to improve the existing profiling support in LLVM for my master
thesis. The goal is threefold:
a) Implement more efficient instrumentation along the lines of [Ball94].
b) Implement and experiment with heuristic estimators as proposed in
[Wu94].
c) Make profile information available in the backend machinery. We
have a preliminary patch that achieves this by maintaining
2009 Feb 13
1
[LLVMdev] Incremental SSA update
Hi,
does LLVM have a mechanism to automatically update SSA form, e.g. after
insertion of additional definitions of a variable? This would
recursively traverse the dominance tree of all uses of the definition
backwards and insert phi-functions where ever they are needed.
http://portal.acm.org/citation.cfm?id=277656&dl=GUIDE, (Paragraph 4.5)
provides an algorithm for such an incremental SSA
2008 Apr 10
2
[LLVMdev] Newbie
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html>
<head>
<meta content="text/html;charset=ISO-8859-1" http-equiv="Content-Type">
</head>
<body bgcolor="#ffffff" text="#000000">
Tilmann Scheller wrote:
<blockquote
2004 Jul 25
1
[LLVMdev] GC questions.
On Thu, 22 Jul 2004, Chris Lattner wrote:
> On Thu, 22 Jul 2004, Tobias Nurmiranta wrote:
> > Hmm, it felt nicer to mark raw LLVM pointers as roots and then transform
> > them, since I then didn't have to see the overhead in my frontend :).
>
> I'm not sure what overhead you mean.
I think I should have emphasized "felt", since it only would make me
produce
2008 Oct 29
3
[LLVMdev] A new project proposal for LLVM and calling help from a chinese student
Mingxing,
Your project sounds interesting and if it significantly improves over
the live variable analysis that is in LLVM right now, I think it could
be a useful contribution. I'm copying the 'llvmdev at cs.uiuc.edu'
mailing list, which you should join. Send all related messages to
this list to get feedback on your goals and also to get help with any
problems you face.
2004 Jul 22
2
[LLVMdev] GC questions.
On Thu, 22 Jul 2004, Chris Lattner wrote:
> > While I was editing LowerGC.cpp I made a little test (not part of this
> > patch, but the diff with LowerGC.cpp in cvs is attached). I've added a new
> > intrinsic called llvm.gcroot_value(sbyte*, sbyte*), which takes a pointer
> > directly instead and transforms it into an alloca. The idea is the
> ...
> > In this
2009 Jul 06
0
[LLVMdev] Profiling in LLVM Patch Followup 4
Hi,
this is the fourth in a series of patches to cleanup and improve the
LLVM Profiling Infrastructure. It depends on the previous patches from
http://lists.cs.uiuc.edu/pipermail/llvmdev/2009-July/023569.html
http://lists.cs.uiuc.edu/pipermail/llvmdev/2009-July/023602.html
http://lists.cs.uiuc.edu/pipermail/llvmdev/2009-July/023642.html
This patch introduces an implementation of the ProfileInfo
2010 Nov 04
1
[LLVMdev] Making Flow graphs reducible
Duncan Sands wrote:
>
> Is there any pass in LLVM 2.6/2.7/2.8 that makes an irreducible flow
> graph
> reducible?
>
Do you mean something like this?
http://portal.acm.org/citation.cfm?id=977393
--
View this message in context: http://old.nabble.com/Making-Flow-graphs-reducible-tp30110882p30134979.html
Sent from the LLVM - Dev mailing list archive at Nabble.com.
2009 Oct 09
2
[LLVMdev] Detecting reduction operations
I want to be able to detect reduction operations using a method
similar to that described here:
http://portal.acm.org/citation.cfm?id=237578.237581
(I am open to other suggestions if there is a better technique).
I am curious if anyone has done this with LLVM or if there are and
recommendations for where to start with my implementation. I am only
interested in identifying the reductions -- I
2009 Oct 12
0
[LLVMdev] Detecting reduction operations
To be more specific, it would be helpful to have some utilities for
finding dependencies (true, output, and anti-). Where is a good place
to start for this kind of analysis?
Thanks,
Scott
On Fri, Oct 9, 2009 at 11:06 AM, Scott Ricketts <sricketts at maxentric.com> wrote:
> I want to be able to detect reduction operations using a method
> similar to that described here:
>
>
2016 Oct 20
2
Publication: A paper related to LLVM
To whom it may concern,
Hi, this is Yousun Ko at the Computer Lab., University of Cambridge.
I would like to propose a paper of mine which has been published at
PLDI'15 to be listed in the ``LLVM Related Publications.''
The paper presents a new intermediate representation, LaminarIR, to
enhance SSA form promotions in structured stream programs. The LLVM
compiler infrastructure is used
2016 Sep 14
2
[RFC] Register Rematerialization (remat) Extension
> On Sep 12, 2016, at 10:14 AM, Andrew Trick via llvm-dev <llvm-dev at lists.llvm.org> wrote:
>
>
>> On Sep 12, 2016, at 8:51 AM, vivek pandya via llvm-dev <llvm-dev at lists.llvm.org <mailto:llvm-dev at lists.llvm.org>> wrote:
>>
>>
>> 1 ) As LLVM MI is already in SSA form before reg allocation so for LLVM I think it does not require to build
2008 Oct 29
0
[LLVMdev] A new project proposal for LLVM and calling help from a chinese student
Hello,
> On Oct 28, 2008, at 10:10 AM, 谭明星 wrote:
>>
>> PS: The following are links about this paper:
>> http://portal.acm.org/citation.cfm?id=1356064
>> http://www.if.insa-lyon.fr/chercheurs/jpbabau/emsoc/presentations/EmSoC07_Boissinot.pdf
>>
I've put the slides from CGO online:
2013 Jun 25
1
[LLVMdev] Publication
LLVM developers,
Can you add the following paper to the publication list?
"Formal Verification of SSA Optimizations for LLVM"
Jianzhou Zhao, Santosh Nagarakatte, Milo M K Martin and Steve Zdancewic
Proceedings of the 34th ACM SIGPLAN Conference on Programming Language
Design and Implementation (PLDI) 2013
link to ACM DL:
2010 Jan 26
0
[LLVMdev] question on instruction selection
On Jan 25, 2010, at 2:18 PM, Nuno Lopes wrote:
> Hi,
>
> I was wondering how exactly instruction selection works in LLVM. As I'm not
> aware of any document describing it, I'll ask here :)
>
> So, the tablegen files that each backend implements describe the mapping
> between selection DAG nodes and assembly instructions (and optionally? their
> binary
2008 Apr 09
4
[LLVMdev] Bitwidth analysis?
Hi, LLVMers,
has someone implemented bitwidth analysis for LLVM? I was looking for
something similar to the bitwise compiler described in
"Bidwidth analysis with application to silicon compilation, by Mark
Stephenson, Jonathan Babb and Saman Amarasinghe"
e.g.: http://portal.acm.org/citation.cfm?id=349299.349317
all the best,
Fernando
2008 Nov 09
1
[Rd] Re Bessel functions of complex argument
Dear all,
I'm writing a code that requires Bessel functions with complex argument.
Searching the list, I found the continuation of a thread I initiated a few
months ago:
http://tolstoy.newcastle.edu.au/R/e4/devel/08/03/0746.html
As I understand, the most promising option would be to use the fortran or C
implementation of Amos,
2009 May 22
0
[LLVMdev] Reusing CFG structures
Ball Larus path profiling requires temporarily changing the CFG by
replacing backedges (such as those caused by loops) in order to
determine instrumentation placement, and attaching increments to edges
[Ball96]. As far as I understand the CFG available through the
BasicBlock class directly corresponds to the IR. I would rather not
change the IR except to insert the profiling code. So, is
2009 Jan 20
0
[LLVMdev] if-conversion
Ralf Karrenberg wrote:
>> If you write a separate pass, we'd like to integrate it in mainline
>> llvm sources.
>>
>
> Thank you for your answers. I will do my best to develop something which
> could be useful for more people :).
>
If you're looking for sources on how to do if-conversion, there's an
algorithm for it in the book "Optimizing