similar to: [LLVMdev] Greetings & Javascript -> LLVM...

Not necessarily looking for performance gains from LLVM. Instead, the value comes from having a common base platform which can gain language independence, address security concerns, support common tooling (debugging, editing, etc), and perhaps even introduce common language features (annotations / AOP). I'm envisioning a use case where browsers would utilize this runtime to execute not only

I think a good starting point for you would be the work that has gone into Native Client. On Sat, Aug 18, 2012 at 11:22 PM, Julian Klappenbach <jklappenbach at gmail.com> wrote: > Not necessarily looking for performance gains from LLVM. Instead, the value > comes from having a common base platform which can gain language > independence, address security concerns, support common

Most of the performance wins for dynamic languages are not from the kinds of optimizations that LLVM does; you basically gain performance by doing run-time specialization of dynamic language constructs to become static, which is something that LLVM really won't help you do, and which practically speaking is extremely language-specific. For example, in JavaScript, all numbers are officially

19.08.2012, 00:39, "Julian Klappenbach" <jklappenbach at gmail.com>: >With this approach, the community would gain language independence for browsers Browser community is strongly opposed to the idea of having multiple web-faced languages > The first language I'd like to tackle is ECMAScript / Javascript. You can tale a look at llvm-lua project. However, speed of JIT

On Aug 18, 2012, at 8:22 PM, Julian Klappenbach <jklappenbach at gmail.com> wrote: > > I'm envisioning a use case where browsers would utilize this runtime to execute not only javascript, but also python, ruby, etc. Language specific interpreters could be downloaded on the fly to support scripts, and security would be ensured due to the fact that it would be based within the LLVM

Hi, I was just reading on Adobe Flash<http://en.wikipedia.org/wiki/Adobe_Flash>and the components which make it up: SWF, ActionScript, and FLV. >From what I've read, SVG is competing with SWF as the format of vector graphics in web design, while ActionScript is an ECMAScript like JavaScript. Hence, SVG + Javascript can provide an interactive, animated, open, non-proprietary web

Does anyone know if this is a known xfail? I'm getting a failure for Mips on this but at the same time, ecmascript.y gets errors when running it through lemon for both gccx86 and llvm mips so I don't know if the output is supposed to really compare or not. (This test runs lemon on multiple input files and computes a hash of the result and diffs the hash). All inputs that are not

the stat() on which file? On Wed, Apr 04, 2001 at 02:06:56PM +0200, Jan Just Keijser wrote: > hmmm, I found the problem and managed to fix it, but I am not sure if this > isn't broken: > > using gdb, I found that sshd fails to stat the 'authorized_keys' files, > which was in /local/home/janjust/.ssh/authorized_keys. Here were the > permissions for the directories

I forgot to ask a few more. Is there a relation between the hashtable ID /(parent,handle) so that if I used 2: for a hash table I could or couldn''t use 2: for a (parent,handle)ID? I also noticed that you type the hashtables like 2:2: can you have more levels with this? like 2:2:2:1: ? and I guess the same question with the parent/handles. thanks again. -- When dealing with a slow

Great. I''m in the development environment and that is the error message I get?! What good does that do me? I''m trying to follow along with the examples in AWDWR(3rd.), and I have this method in a store controller: private def find_cart Cart.new end That works fine, except that every request(initiated by clicking on an ''add to cart'' button) will

On 6/3/2011 3:19 PM, Samuel Crow wrote: > Why not runtime checks? The constant folding and dead-code elimination passes would get rid of any redundant code in a later stage of compilation anyway. The important part, as I see it, is that LLVM already does constant folding and dead-code elimination. Meta-data might require more effort in the long run. > > --snip-- Less flexible for the

I'm trying to track down the problem with the assertion failure in SelectionDAGBuilder.cpp. This is the code: *case* *Intrinsic*::gcroot: *if* (GFI) { *const* Value *Alloca = I.getArgOperand(0); *const* Constant *TypeMap = cast<Constant>(I.getArgOperand(1)); * FrameIndexSDNode *FI = cast<FrameIndexSDNode>(getValue(Alloca).getNode());*

Hi Nikolay, I poked at src/lib/virtio/virtq.lua a bit - I was surprised to find no explicit CPU memory barriers in the virtq implementation. These are typically required when using virtio on smp machines - the spec actually mention where barriers are necessary. Are the barriers implicit somehow for lua? I'd be curious to learn. Thanks, -- MST

Hi Nikolay, I poked at src/lib/virtio/virtq.lua a bit - I was surprised to find no explicit CPU memory barriers in the virtq implementation. These are typically required when using virtio on smp machines - the spec actually mention where barriers are necessary. Are the barriers implicit somehow for lua? I'd be curious to learn. Thanks, -- MST

I have been working with Antti Kantee on running scripting languages directly on Xen, and have got LuaJIT running. Essentially this is a build of a modified version of the Xen "Mini-os" which provides a small stub to handle basic Xen functions like memory allocation, combined with NetBSD kernel components to provide networking and file system access if required, plus NetBSD libc to

Hi, can someone tell me how to use associative arrays in R? It can be a hashtable or some kind of tree, as long as the lookups aren't O(n). One way to do this is to use names, e.g. in: list(a=3, ...)[["a"]] presumably looking up "a" is very quick. (Can someone tell me offhand how that is implemented? Hashtable?) However, if I wanted to, say, memoize a numeric

Hi - I have a data frame with a large number of observations (62,000 rows, but only 2 columns - a character ID and a result list). Sample: > my.df <- data.frame(id=c("ID1", "ID2", "ID3"), result=1:3) > my.df id result 1 ID1 1 2 ID2 2 3 ID3 3 I have a list of ID vectors. This list will have anywhere from 100 to 1000 members, and

Thanks to help in a previous thread, I now have a working LLVM codegen for the MLton compiler. Currently the stack is managed explicitly on the heap. This way the LLVM codegen re-uses the runtime layout of the other codegens, simplifying the initial porting effort. In the next phase I plan to switch to using LLVM to manage the stack, but there is a sticking point: MLton switches stacks. It does

----- Original Message ----- > From: Nate Fries <nfries88 at yahoo.com> > To: Samuel Crow <samuraileumas at yahoo.com>; LLVM Developers Mailing List <llvmdev at cs.uiuc.edu> > Cc: > Sent: Friday, June 3, 2011 6:52 PM > Subject: Re: [LLVMdev] Thinking about "whacky" backends > > Most JVMs perform terribly. Even Sun's has had notable performance

Hi everyone, I''m Italian and sorry for my english mistakes... I''m developing a web-site using rubyonrails. It''s REALLY COOL! But I''m obliged to re-use some javascript functions. Do you know where I can get the right documentation (and examples) in order to integrate these two different environments? Thanks, Matteo. -- Posted via http://www.ruby-forum.com/.