search for: parroted

This is just an idea for comment. Perl6, the upcoming version of Perl has separated out the runtime into a virtual machine called Parrot. There are already several small languages (one is C-like, one is Java-like and one is BASIC-like) that target Parrot and given the popularity of Perl its likely that others may attempt to target it too. If R could interface easily with Parrot then it might be

Hi, I have a Parrot Asteroid car media receiver that uses an Android based operating system to function. Is there anything the development crew can do to make the Asteroid stream FLAC audio? the system does have an installer for 3rd party .APK files Best regards, Rob. -------------- next part -------------- An HTML attachment was scrubbed... URL:

I have made available three patches for OpenSSH 2.5.1p1 (and 2.3.0p1), two of which may be of general interest. They are described in detail at http://www.ex-parrot.com/~chris/openssh-patches/ but a brief description-- http://www.ex-parrot.com/~chris/openssh-patches/openssh-2.5.1p1-keepalives.patch modifies the code in clientloop.c to periodically send a null packet as a keepalive; this is

I'm curious if any of the core R developers have considered the possibility of hosting R (v2?) on the parrot common runtime environment. Perl6 will generate byte-code for parrot, as will some future version of python. I can imagine both drawbacks and advantages. Some advantages would be fast byte-code execution and freely mixing perl, python and R modules. Anyone looked into this? Tim

Hi Arnaud, I'm glad to hear that your test case is working. I however still get my wrong allocation in some non trivial cases : the > pairing constraint is not fulfilled. > > I have tried to modify the 'ensure pairable' pass (the pass undoing some > of the coalescer's work) to always insert register copies for > instructions with the pairable constraint, instead of

Hi, Use offset variables if count occurrences of an event and you want to model the observation time. glm(count ~ predictors + offset(log(observation_time)), family=poisson) If you want to compare durations, look at library(survival), ?coxph If tnoise_sqrt is the square root of tourist noise, your example seems incorrect, because it is a predictor, not the dependent variable tnoise_sqrt ~

Hi Lang, Thanks a lot for taking time to look into this. I will test the fix soon and let you know the results. Cheers, -- Arnaud de Grandmaison On Tuesday, April 03, 2012 17:30:33 Lang Hames wrote: > Hi Arnaud, > > Apologies for the delayed reply. > > Thank you for the excellent test case - it exposed a subtle bug in the > colorability heuristic. This has been fixed in

First off, I like the look of this project. I am considering retargeting my language from .NET & Parrot to LLVM. Its either this, or add a Java backend. I'm probably going to scrap the Parrot support, but it will still leave me with 2 backends. The only reason I am considering LLVM is as a compiler / code generator, not as a VM. Immediately I have several questions regarding

Great lists, I always find them useful, thank you to everyone who contributes to them. My question is regarding non-integer values from some data I collected on parrots when using the poisson GLM. I observed the parrots on a daily basis to see if they were affected by tourist presence. My key predictors are tourist noise (averaged over a day period so decimal value, square root to adjust for

Hi Lang, I have reduced the testcase as much as possible. The log of the run and the dumped graphes are attached. Cheers, -- Arnaud de Grandmaison On Tuesday, March 27, 2012 01:20:35 Lang Hames wrote: > Hi Arnaud, > > Thanks for attaching those files. I'll take a look at them. > > Commit r153483 adds an option to the PBQP allocator, > "-pbqp-dump-graphs", to

Hi Arnaud, Apologies for the delayed reply. Thank you for the excellent test case - it exposed a subtle bug in the colorability heuristic. This has been fixed in r153958. In case you are curious, the bug was as follows: the PBQP solver applies applies a simplification step to each matrix. When all elements of a matrix row or column are equal, the value for those elements is "pushed

Hi Lang, The assert is not triggered any longer on my testcases :) I however still get my wrong allocation in some non trivial cases : the pairing constraint is not fulfilled. I have tried to modify the 'ensure pairable' pass (the pass undoing some of the coalescer's work) to always insert register copies for instructions with the pairable constraint, instead of being smart and

Hi Lang, > From memory your target is not public, so I won't be able to reproduce > the crash myself. Is that correct? Correct. > If that's the case, I could add functionality to dump the PBQP graphs > during allocation. I think they should give me enough information to > debug the issue. Would you be able to share the PBQP graphs? I can share the pbqp graph if you send

http://bugzilla.mindrot.org/show_bug.cgi?id=85 chris at ex-parrot.com changed: What |Removed |Added ---------------------------------------------------------------------------- CC| |chris at ex-parrot.com ------- Comment #4 from chris at ex-parrot.com 2006-06-22 08:50 ------- I see this bug has now been open for

Hi ls the if top package availblale in Centos? http://www.ex-parrot.com/~pdw/iftop/ Thank you

Although I've never used ARM's compiler, I admit I'm very surprised that it's not compatible with the NEON intrinsics. Given that and M. Zanelli's speed tests, it seems clear that M. Zanelli's code is the way to go. I look forward to its inclusion in the opus GIT. --John On 6/10/2013 1:00 PM, opus-request at xiph.org wrote: > Date: Mon, 10 Jun 2013 10:36:34 +0100

Hi Arnaud, Thanks for attaching those files. I'll take a look at them. Commit r153483 adds an option to the PBQP allocator, "-pbqp-dump-graphs", to dump the PBQP graph for each round of each function in a compilation unit. The generated files are named "<module id>.<function>.<round>.pbqpgraph", and contain a simple text representation of the PBQP graph.

I've been tossing around some ideas about high-level backends. Say, have LLVM emit Perl code. Sounds whacky but isn't. It's good for the first bootstrapping phase in environments where you don't have a C compiler, where you don't have a cross-compiled binary for download, but you can execute Perl. It also makes a great inspect-the-sources-with-an-editor stage for aspiring

I doubt you needed to add cfe-dev here. Sorry I hadn't seen this, this seems like an easy and simple deficiency in the IR intrinsic for memcpy. See below. On Sun, Jan 20, 2013 at 1:42 PM, Arnaud de Grandmaison < arnaud.allarddegrandmaison at parrot.com> wrote: > define void @test(i16 zeroext %a) nounwind uwtable { > %r.sroa.0 = alloca i16, align 2 > %r.sroa.1 = alloca i16,

On 01/20/2013 10:56 PM, Chandler Carruth wrote: > I doubt you needed to add cfe-dev here. Sorry I hadn't seen this, this > seems like an easy and simple deficiency in the IR intrinsic for > memcpy. See below. > > On Sun, Jan 20, 2013 at 1:42 PM, Arnaud de Grandmaison > <arnaud.allarddegrandmaison at parrot.com > <mailto:arnaud.allarddegrandmaison at