A good register allocation algorithm will always have problems with
big subs, there is nothing that we can do about it.
I think that what "real compilers" do to solve this problem is
implement two different algorithms: one for normal subs which tries
to generate optimal code, and a naive one f
Monday 14 July 2003 05:56, Robert Spier wrote:
> > Sorry for a slightly off-topic post, but will Larry's State of
> > the Onion be posted online soon?
>
> Yes.
>
> http://dev.perl.org/perl6/talks/
>
> -R
Really? I can't find anything about TPC7 in this page..
-angel
> [ you seem to be living some hors ahead in time ]
Yep, sorry about that.
> The problem stays the same: spilling processors to parrot's or
> parrots to array.
>
Thinking a bit more about it, now I believe that the best way to do it
would be:
(1) First, do a register allocation for machine re
I explained very badly. The issue is not spilling (at the parrot
level)
The problem is: if you only pick the highest priority parrot registers
and put them in real registers you are losing oportunities where
copying the date once will save you from copying it many times. You
are, in some sense
Saturday 22 February 2003 16:28, Leopold Toetsch wrote:
> Gopal V wrote:
> > If memory serves me right, Leopold Toetsch wrote:
> >
> >
> > Ok .. well I sort of understood that the first N registers will
> > be the ones MAPped ?. So I thought re-ordering/sorting was the
> > operation performed.
>
>
>
> The best partial solution to early finalization is compile-time
> tracing of possible references by the compiler which can explicitly
> generate the appropriate DESTROY calls.
>
What about refcounting + real GC?
refcounting will free most of the objects as soon as possible, and the
real GC s
> Hmm wouldn't the JIT benifit from a pre knowledge of basic
> blocks and types or some information ? ... (I seem to think so
> ...).
I would think so, because if, for example, the JIT wants to do a full
register allocation to map parrot registers to machine registers, it
would certainly nee
Dan Sugalski wrote:
> At 7:40 AM -0400 9/4/02, John Porter wrote:
> >
> >Some folks seem to think that sufficient reason exists now.
>
> That's fine. You don't have to convince some folks. You have to
> convince me.
Being ultra-pragmatic, the name change:
- costs nothing
- might make some folks
Hi Leo,
>
> This should be - from my (imcc) POV - reflected by these IN/OUT
> settings:
>
> op set(in PMC, in INT)
> op set(in PMC, in STR)
> op set(in PMC, in NUM)
> op set(out PMC, in PMC) # ok, $1 points to $2 now
>
> # P[i] = x
> op set(in PMC, in intkey, in x)
> # P[KEY] = x
>
Hi,
Now that we've got ICU in, I thought it may be time to revisit the
encodings implementation. I am a clamorous ignorant is
unicode/encodings issues, so please be patient with me. :)
>From what I have asked people at IRC, and what's on the list archives,
my understanding of how parrot will
> c) imcc becomes a "middle" level language.
> I never meant it to be an assembler. In practice
> intermediate languages provide other constructs
> such as aggregate type definition that are not
> available in the assembler.
>
> type i : packed int[32]
> type r : record { foo : int, bar : string }
>
> Sure, I have no problem with it. At one
> time someone suggested making a separate
> list for Parrot compilers, so I took it as
> a hint that maybe we were spamming.
>
I am all for the creation of a new list for stuff such as imcc, and perl6
compilers. ([EMAIL PROTECTED]?)
So people interes
> I still prefer infix notation to prefix notation for an intermediate
> language. I don't understand why it is so hard to adopt. imcc is supposed
> to be a step closer to higher level languages, which is why I went that
> way.
Hi,
I think we all agree that since parrot can have dynamic oplibs
Sunday 18 August 2002 00:38, Simon Cozens wrote:
> [EMAIL PROTECTED] (Dan Sugalski) writes:
> > Has someone looked at and maybe committed this?
>
> The reason I asked which pieces of Parrot were prototypes was
> because optimizing the hell out of something that's only a
> prototype is nothing shor
Sunday 21 July 2002 21:34, Dan Sugalski wrote:
>
> No. They are not. You're missing the important case where the data
> structure is inherently and intrinsically multidimensional.
>
>my int Array @foo : dimensions(3);
>@foo[1;2;3] = 12;
>
> Or whatever the syntax is in perl to declare a 3
Hello,
>If people have different opinions on intermediate code generation, I'd
>like to hear them, since I've only done toy compilers in school which
>always used 3address or quadruples.
I have been working in a compiler for an intermediate language that I call
P-- (obviously inspired in C--) fo
Dan wrote:
>Yep, I've seen their plans. It's less an issue for us, at least as
>far as globals are concerned, since we'll be doing that with
>lexicals. (Python not having lexicals, after all) Globals are a bit
>more interesting, since bytecode-loaded modules can't guarantee
>global positions, sin
Simon said:
> > I see. ?But what's the rational to have Bigints / Bigfloat be native
types
> > instead of PMCs?
>
> They're useful and predictable. And also, you may want to automatically
> promote integers to bigints; you probably don't want to automatically
> promote integers to complex types.
>
> These methods are provided so that we can play with "native" types in our
> bytecode then send them to our pmc, as otherwise every constant in our
> code would have to be a PMC, which is a little excessive.
>
> Things like a complex number will be represented by either a PMC class
> (very lik
r Parrot, (I am
particulary interested in the third one) I would volunteer to contribute a
patch attempt for it.
Angel Faus
[EMAIL PROTECTED]
ur perfomance.
And using too much stacks (as the usage of exceptions would probably
require), will also be too slow (as Brent Dax showed me when we
where discussing our two regex opcodes designs).
Just my 2 cents (of euros) :)
---
Angel faus
[EMAIL PROTECTED]
gt; and the like working.
This patch should make it. I have not included STRING arguments, because I
don't know which multimethod should be called (native, unicode or other).
Tests are updated too.
Sincerly,
----
Angel Faus
[EMAIL PROTECTED]
Vtable.p
ws us to add new methods in vtable.tbl, without worrying about old
..pmc files.
btw, sorry for that silly Text::Balanced dependency. I stupidly assumed it
was a standard module without checking.
Sincerly,
---
Angel Faus
[EMAIL PROTECTED]
pmc2c.pl
Description: Binary data
t.
>
Cool. ¿Could you send it to me? I would like to make a try to speed my
proposal... Probably there is no way to catch up, but I would like to see it
anyway.
Meanwhile, I'll shut up my mouth and update regex.pod to reflect your
proposal.
Sincerly,
---
Angel Faus
[EMAIL PROTECTED]
http://homepages.ulb.ac.be/~arigo/psyco/ ; they have some very
nice documents that explain all with a great detail.
I wonder whether Parrot could stole some ideas of this..
Just mi half a cent.
-Angel Faus
[EMAIL PROTECTED]
ession to lower case on compile time, and
then converting the string to lower case just at the begining of the match.
(The former is actually propsed by Jeffrey Friedl in the Mastering Regexs
book claiming that it would be much faster)
How agressive are we going to be with this kind of optimi
Brent Dax :
> Okay, this bunch of ops is a serious attempt at regular expressions. I
> had a discussion with japhy on this in the Monastery
> (http://www.perlmonks.org/index.pl?node_id=122784), and I've come up
> with something flexible enough to actually (maybe) work. Attached is a
> patch to
>next->id();
}
}
sub BabyRegex::close::pasm {
my $self = shift;
my $id = $self->id;
my $cnt = $self->{GROUP}->{COUNT};
cry $id, "#end of group $cnt";
if ($self->{GROUP}->quant eq "*" or $self->{GROUP}->quant eq "+") {
Sincerly,
-------
Angel Faus
[EMAIL PROTECTED]
1814a1815,1882
>
>
> AUTO_OP matchexactly(sc, s, i, ic){
>
> STRING* temp;
>
>
> if (string_length($2) <= $3) {
> RETREL($4);
> }
>
> temp = str
something very similar to what we would
need for parrot/perl6.
Just my half a cent,
Angel Faus
[EMAIL PROTECTED]
vLex.com
, i18n ("Error #43: Can't stat file\n") )
Prints just "ERR43\n" when language var is set to, say, "CODES".
--
Angel Faus
Director Técnico
vLex.com
-
[EMAIL PROTECTED]
31 matches
Mail list logo
