At 11:39 AM +0100 2/8/03, Leopold Toetsch wrote:
In perl.cvs.parrot, you wrote:
Log:
Long-delayed patches (my fault. D'oh! -Dan) from Bernhard Schmalhofer to
implement neg and abs.
inline op neg(inout NUM) {
- if($1 == 0.0)
-goto NEXT();
- $1 = -($1);
+ $1 = 0.0
Nicholas Clark wrote:
save $I0
all the "save $" are spam :-)
Syntax change for imcc? Save Euros?
Nicholas Clark
SCNR,
leo
- Forwarded message from Leopold Toetsch <[EMAIL PROTECTED]> -
Mailing-List: contact [EMAIL PROTECTED]; run by ezmlm
X-Spam-Status: No, hits=1.3 required=7.0
tests=CARRIAGE_RETURNS,SAVE_BUCKS,SPAM_PHRASE_00_01 version=2.43
save $I0
save $I1
saveall
@@ -44,7 +44,7 @@
[grr, reply all works better]
I'm not sure exactly what the cause of this is, but apache seems to be
"getting stuck." I rebooted it and it seems to be working fine now, but I'll
try to see if I can fix this permanently.
Zach
On 2/8/03 6:27 AM, "Leopold Toetsch" <[EMAIL PROTECTED]> wrote:
> Leop
Jason Gloudon wrote:
On Fri, Feb 07, 2003 at 05:49:35PM +0100, Leopold Toetsch wrote:
I don't know yet, how multi threading will be done. But when multiple
interpreters share the ->code data member (as newinterp/runinterp) do,
then they will use the same JIT/prederef or whatever data.
You
Nicholas Clark wrote:
I had a (possibly) impractical idea - computed goto / JIT
(or even computed goto / prederef / jit) core
I don't know whether this is possible:
Inside a cgoto core have 1 extra op - enter JITted section.
The bytecode is "compiled" by the JIT (at some point) - if there are
On Sat, Feb 08, 2003 at 03:10:58PM +, Nicholas Clark wrote:
> The bytecode is "compiled" by the JIT (at some point) - if there are a run
> of consecutive JIT-able ops, then issue a section (an isolated section) of
> machine code for those ops, and replace those ops in the bytecode with an op
>
On Thu, Feb 06, 2003 at 01:37:42PM +0100, Leopold Toetsch wrote:
> This is one thing I allways wanted to try ;-)
>
> fast_core MOps: 11
> Prederef: 17.5
> CGoto MOps: 19.4
> CGP MOps: 27.5
> CGP -O3 MOps: 65 !!!1
>
> This runloop combines the faster dispatch of opcodes via compu
On Fri, Feb 07, 2003 at 05:49:35PM +0100, Leopold Toetsch wrote:
> I don't know yet, how multi threading will be done. But when multiple
> interpreters share the ->code data member (as newinterp/runinterp) do,
> then they will use the same JIT/prederef or whatever data.
You can't do that for pr
Nicholas Clark wrote:
On Sat, Feb 08, 2003 at 10:47:00AM -, Leopold Toetsch wrote:
Modified:t/native_pbc number_1.pbc number_2.pbc
If these are going to need to change every time core ops changes, then I
think we're going to need to automate this process:
Yep. I have a script her
Leopold Toetsch wrote:
Again same problem:
Proxy Error
The proxy server received an invalid response from an upstream server.
The proxy server could not handle the request GET
/tinderbox/bdshowbuild.cgi.
Reason: Could not connect to remote machine: Operation timed out
Apache/1.3.26 Server at
On Sat, Feb 08, 2003 at 10:47:00AM -, Leopold Toetsch wrote:
> cvsuser 03/02/08 02:47:00
>
> Modified:t/native_pbc number_1.pbc number_2.pbc
> Log:
> native_pbc - update for core.ops change
>
> Revision ChangesPath
> 1.2 +1 -1 parrot/t/native_pbc/number_1.p
# New Ticket Created by Leon Brocard
# Please include the string: [perl #20786]
# in the subject line of all future correspondence about this issue.
# http://rt.perl.org/rt2/Ticket/Display.html?id=20786 >
Attached is a bf compiler for languages/bf/ and a patch to the
makefile to make and test
Steve Fink wrote:
bsr $I0
It will complain that it can't fixup the label '$I0'.
I can't imagine, how to get a correct CFG with these kind of register
jump instructions. They are too low level, lacking any hint where they
might jump to.
When we want these kind of branches, then they mus
In perl.cvs.parrot, you wrote:
> Log:
> Long-delayed patches (my fault. D'oh! -Dan) from Bernhard Schmalhofer to
> implement neg and abs.
>inline op neg(inout NUM) {
> - if($1 == 0.0)
> -goto NEXT();
> - $1 = -($1);
> + $1 = 0.0 - $1;
> goto NEXT();
>}
Not too lo
> From: [EMAIL PROTECTED]
> Date: Fri, 7 Feb 2003 16:28:43 -0500
>
> A4 gives this example of C:
>
> for @foo -> $a, $b { ... } # "for @foo into $a and $b..."
>
> but, this seems more natural to me (and, it turns out, closer to the P5
> syntax for ill or good):
>
> for $a, $b <- @foo {
All --
A4 gives this example of C:
for @foo -> $a, $b { ... } # "for @foo into $a and $b..."
but, this seems more natural to me (and, it turns out, closer to the P5
syntax for ill or good):
for $a, $b <- @foo { ... } # "for $a and $b from @foo..."
(heck, that even looks like shifting
0. PDD 3 says:
P1
Holds the continuation for the caller, assuming this sub was
called with callcc. Otherwise NULL.
and implies a similar possible absence for P2. How does one ensure
that a PMC register is 'NULL'? One other example language compiler
implies that there is no(t yet)
18 matches
Mail list logo