similar to: [LLVMdev] New LLVM Tutorial Available

Hi everyone, This Fall has been busy, busy, busy. In addition to the usual LLVM hacking, our developers have been moving all over the country, starting classes, ending internships, getting married, and traveling the world. Despite all of the non-LLVM fun we've been having, we've managed to get some work done, too. :) Here is my traditional distillation of llvm-commits: New High-Level

Hi all, The slides we used on "CGO MCLinker and LLVM Tutorial" are now available on the MCLinker website: http://code.google.com/p/mclinker/wiki/2013CGOTutorial Enjoy! - The CGO Tutorial on MCLinker and LLVM 2013 committee

Very nice. Here's a couple comments on the first 6 chapters: http://llvm.org/docs/tutorial/LangImpl1.html "We handle comments by skipping to the end of the line and then returning the next comment." Shouldn't this say "returning the next comment"? http://llvm.org/docs/tutorial/LangImpl2.html I was a bit confused at first because the AST node classes are called ASTs.

On Mon, 5 Nov 2007, Vikram S. Adve wrote: > -- It would be helpful to add some navigation links at the top and bottom of > the pages. I added a TOC to each chapter, thanks. > -- Not clear why PrototypeAST::Codegen returns a Function* instead of a > Value* like the other CodeGen methods? I clarified this in the text. The short version is that PrototypeAST doesn't correspond

Almost exactly two years ago, I released the first tutorial for building an HA platform for KVM VMs. In that time, I have learned a lot, created some tools to simplify management and refined the design to handle corner-cases seen in the field. Today, the culmination of that learning is summed up in the "2nd Edition" of that tutorial, now called "AN!Cluster Tutorial 2".

Hi, I would like to know how much effect these stoppoint calls have on the optimization of the bytecode? DOes insertion of debugging info cause opportunities for optimization (especially interprocedural dead code elimination and interprocedural constant propogation) to be reduced? The -g code is not very readable, so I am not able to confirm this by my own experiment. Thanks! Nikhil On Sat,

Hi, A new release of RArcInfo is out, together with a draft of the tutorial. You can get both from http://matheron.estadi.uv.es/~virgil/Rpackages/RArcInfo Windows binaries are also available and package source can also be downloaded from CRAN. I 'd like to encourage users of the package to read the tutorial and report ideas. Besides, I would like to keep a web page on works where RArcInfo is

On Wed, 4 Aug 2004, Reid Spencer wrote: > On Wed, 2004-08-04 at 12:23, Misha Brukman wrote: > > On Wed, Aug 04, 2004 at 12:16:12PM -0700, Reid Spencer wrote: > > > So I propose: > > > > > [snip] > > > -O3 = aggressive optimization, regardless of computation time with the > > > effect of producing the fastest executable > > > >

On Mon, 5 Nov 2007, Aaron Gray wrote: >> Anyone have thoughts or feedback? :) > > Nice job. The only bit that is not immediately clear is the 'Proto' > variable, but is clear when looking through the code at the end of the page. Where in the tutorial? What would you suggest that I say? > Could do with a link to the LLVMBuilder class reference material. I added a link

On Wed, 15 Mar 2006, Vikram S. Adve wrote: > [I've changed the subject to make this a new thread.] > > While all of this makes sense to me, note that Markus and John were asking > about different situations. Markus was asking about user-written source > code. John was asking about a compiler pass or tool written by a compiler > developer, not a user. > > These

Hello friendly Rails community, I''m sorry for this OT post, I''ve just switched to Mac and as I see there are so many friendly mac users here, may I ask is there another good/nice Subversion installation tutorial instead of this one: http://developer.apple.com/tools/subversionxcode.html? Is there another way to install it without compiling Subversion by myself? For example via

For those that missed out joining the amazing turnout of ~70 people here in Vancouver for the mini-workshop I did on the 27th last month, I am making available the 30 slides I used for the presentation. The slides were used in conjunction with me demonstrating it via command line. Alot was learned by both attendees, and quite possibly even more so by myself while teaching the material. I created

(Sorry about the wall of text, it ended up as a brain dump of a bunch of backend-related documentation that I know about/have bookmarked in the past. Hopefully there's something useful in there.) If you haven't stumbled across them already, these might be helpful: http://llvm.org/devmtg/2009-10/Korobeynikov_BackendTutorial.pdf http://jonathan2251.github.io/lbd/

On Thu, 15 Jul 2004, Reid Spencer wrote: > On Thu, 15 Jul 2004 17:43:27 -0500 (CDT) > Chris Lattner <sabre at nondot.org> wrote: > > Sorry! LLVM 1.3 will probably be out in a few weeks... > > Speaking of which, what are your intentions for 1.3? Are you waiting on CPR? > Anything else? We're starting to get some traction with more developers and > I think doing

When I registered for dev conference, there was a field asking what I was particularly interested in learning. I didn't fill it out then , but it occurs to me now that I'd really enjoy a tutorial on how to develop a new back end. I spent some time recently reviewing existing material (documentation and code) and not making a lot of progress. Indeed, under some time pressure, I'm

On Mon, 5 Nov 2007, Kelly Wilson wrote: > I edited "The basic language, with its lexer" somewhat and I am > attaching a .html file. This is simply spelling/grammar editing and not > content. Thanks, I merged them in! > A simple diff should show the changes. Please let me know if this format > (ie. html file) is acceptable for your use. I don't think I changed >

On Tue, 7 Mar 2006, Vikram S. Adve wrote: > Changing the heuristics directly would have to be a custom change (i.e., > couldn't be checked in). Is there a way for a client pass or tool to > influence the heuristics? If not, does it make sense to add such a > mechanism? To be clear, I'll restate my position here, then follow up with more specifics of such a mechanism to

Ryan's second question should be more generally phrased for the entire AliasAnalysis interface, not just DSA: will it work to ask alias queries or mod/ref queries for a pair of pointers or a pair of instructions in two different functions? --Vikram http://www.cs.uiuc.edu/~vadve http://llvm.cs.uiuc.edu/ On Oct 16, 2006, at 1:45 PM, Chris Lattner wrote: > On Mon, 16 Oct 2006, Ryan

Hi, A new release of RArcInfo is avaialable from CRAN and http://matheron.uv.es/~virgil/Rpackages/RArcInfo/ The changes made are: *V 0.4-2 - 'index' argument added to plotarc to select the arcs to plot. - 'index' argument added to plotpal to select the polygons to plot. - New function 'get.nb', which, given a set of polygons, returns the neighbouring polygons of

On Mon, 16 Oct 2006, Ryan M. Lefever wrote: > Since Data Structure alias analysis inherits from ModulePass rather than > FunctionPass, does that mean that it performs interprocedural alias > analysis? yes. > Further, if I compare pointers from two different functions, > will I sometimes get a NoAlias response. Don't do that :). That's probably a bug in DSA, but fixing it