This patch fixes a infinite loop ('./test_prog --' for example) in the
switch
handling in test_prog and also modifies make_interpreter() to pass
interpreter
flags as constructor argument.
-Melvin
pass_flags.patch
Description: unknown/unknown
On Thu, 6 Dec 2001, Tom Hughes wrote:
> In message <[EMAIL PROTECTED]>
> James Mastros <[EMAIL PROTECTED]> wrote:
>
> > On Mon, 3 Dec 2001, Tom Hughes wrote:
> > > It's completely wrong I would have thought - the encoding layer
> > > cannot know that a given code point is a digit so it
Correction, they aren't physically passed to runops() but you get the idea..
-Melvin
---Original Message---
From: Melvin Smith
Date: Wednesday, December 05, 2001 08:49:30 PM
To: [EMAIL PROTECTED]
Subject: interpreter->flags
Guys/Dan/Simon,
While messing around tonight I noticed that inte
Guys/Dan/Simon,
While messing around tonight I noticed that interpreter flags
aren't visible to any subsystem initialization code because the flags
are passed to runops() instead of make_interpreter(). (I'm playing
with some IO stuff and I'd like access to the flags at the time of
the init code
G'day all.
On Wed, Dec 05, 2001 at 01:23:34PM -0500, Dan Sugalski wrote:
> Besides, the only p-code machine I could think of was UCSD Pascal running
> on the Apple IIs, and that seemed a bit old to reference.
FWIW, in the last days of Microsoft's 16-bit C compiler (at least V7
and V8), it used
On Wed, Dec 05, 2001 at 07:28:01PM -0500, [EMAIL PROTECTED] wrote:
> Here we go... Just adds the debug flag for test_prog.
Thank you. I've applied that; I like it particularly because it doesn't
actually add any more functionality. :)
--
Simon: `hello kitty' douche. If you are getting some and
Yipes lemme resend that, I was dinking around with a new mailer and it blew
the tab formatting.
-Melvin
add_debug1.patch
Description: unknown/unknown
On Wed, Dec 05, 2001 at 10:44:09PM +0200, Jaen Saul wrote:
> make distclean should clean everything so ignore my point about leaving the
> CVS directories :)
Uhm, it does clean everything. If I've coded it right, (cough cough) it
deletes everything that's not in MANIFEST.
--
``Perl is the succe
On Wed, Dec 05, 2001 at 02:57:04PM -0500, Dan Sugalski wrote:
> Seriously, I can't speak for Simon, but I expect Things Can Be Worked Out
> given sufficient stuff. (I am, while easy, not cheap, alas. That whole
> spouse/kids/rent/insurance/unpaid time off day job thing)
I am not sufficiently ar
Here we go... Just adds the debug flag for test_prog.
-Melvin
--- orig/parrot/test_main.c Mon Oct 22 21:00:01 2001
+++ parrot/test_main.c Wed Dec 5 18:13:03 2001
@@ -20,6 +20,7 @@
int bounds_checking;
int profiling;
int tracing;
+int debugging;
struct Parrot_Interp
In message <[EMAIL PROTECTED]>
James Mastros <[EMAIL PROTECTED]> wrote:
> On Mon, 3 Dec 2001, Tom Hughes wrote:
> > It's completely wrong I would have thought - the encoding layer
> > cannot know that a given code point is a digit so it can't possibly
> > do string to number conversion.
> > >Q: What about all the others?
> > >A: *What* others? That's it, unless you count perl, python, or ruby.
> >
> >I thought Pascal's (ancient) p-code was a stack VM... Yup, some web
> >pages that I can find in a hurry, confirm that.
>
> Right, but back then they called 'em "p-code interpreter"
> >And for my own personal edification, has anyone tried to work a deal
> >(through YAS perhaps) for Parrot like Damian Conway has for Perl?
>
> That's a good question. I'll punt it off to someone else. Nat? Damian?
YAS is on the very brink of announcing its 2002 funding drive.
See:
#
# eq.pasm
#
# A program to test and demonstrate eq
#
# Copyright (C) 2001 Yet Another Society. All rights reserved.
# This program is free software. It is subject to the same
# license as The Parrot Interpreter.
#
bsrwaLA
print " ok\n"
bsriSA
print " ok\n
This is a patch for eq and ne that supports more combinations of
I, N and S, including ones that may be considered redundant.
There is also default popping of the call stack if there is no
branch address specified. I understand that I can branch to an
intermediate label and call ret myself, but
make distclean should clean everything so ignore my point about leaving the
CVS directories :)
And please leave me a message when the makefiles are fixed so I can delete
my custom version of makefile.in.
-Jaen Saul
Here is a fixed tindermail that uses SMTP for those that are having problems
with "sendmail".
Modify the ### Configuration ### section before using.
Please tell me if you find any bugs :)
(file attached, CRLF newlines probably)
-Jaen Saul
Tindermail.pm
Description: Binary data
Argh. Win32 is quite f**ked. :(
1. "make" for Win32 is called "nmake" if you use the Visual C++ compiler.
You should introduce some platform specific variable in the hints file.
2. there is a problem with "cd".
IMPORTANT: Don't use semicolons for * sake! And maintain the current
directory, t
--- Dan Sugalski <[EMAIL PROTECTED]> wrote:
> At 10:28 AM 12/5/2001 -0500, Jason Gloudon wrote:
> >Using the aggregate's vtable is another way of getting
> the job done that
> >avoids all the extra reference PMCs. However, references
> will have to be
> >supported.
>
> References are interestin
At 01:46 PM 12/5/2001 -0600, Jonathan Scott Duff wrote:
>On Wed, Dec 05, 2001 at 11:02:34AM -0500, Dan Sugalski wrote:
> > >Q: How do Dan and Simon have enough time to work on this?
> >
> > A: We don't--why do you think this is taking so long?
>
>A related FAQable question ...
>
>Q: Is it possible
At 07:46 PM 12/5/2001 +, Nick Burch wrote:
> >Since 0.0.3 is exceptionally imminent, can I have a roll-call of systems
> >which are working and not working?
>
>OS/2 + EMX Working
>
>Tinderbox + internal lan with private dns + os/2 sendmail broke,
>hence its not in the tinder
>Since 0.0.3 is exceptionally imminent, can I have a roll-call of systems
>which are working and not working?
OS/2 + EMX Working
Tinderbox + internal lan with private dns + os/2 sendmail broke,
hence its not in the tinderbox...
Nick
On Wed, Dec 05, 2001 at 11:02:34AM -0500, Dan Sugalski wrote:
> >Q: How do Dan and Simon have enough time to work on this?
>
> A: We don't--why do you think this is taking so long?
A related FAQable question ...
Q: Is it possible to "buy" Dan's and Simon's time to work on nothing
but Parrot? I
On Wed, Dec 05, 2001 at 11:02:34AM -0500, Dan Sugalski wrote:
> At 06:29 PM 12/4/2001 -0800, Steve Fink wrote:
> >Q: What about incremental matching?
>
> A: What about it?
Is there any plan to support nonbuffered matching, as in, I have a
socket connection open that I want to scan for some patte
On Wed, Dec 05, 2001 at 01:32:32PM -0500, Dan Sugalski wrote:
> Right, but FORTH's not an interpreted language, generally speaking.
No, but PostScript is. :-)
(...as if that wasn't completely obvious...)
Z.
On Wed, 05 Dec 2001 13:32:32 -0500, Dan Sugalski wrote:
>Right, but FORTH's not an interpreted language, generally speaking.
The old FORTH's in the 80's worked pretty much like the p-copde
interpreter.
Nowadays, FORTH compilers are really optimizing compilers. There are
excellent commercial off
From: Dan Sugalski [mailto:[EMAIL PROTECTED]]
> At 12:29 PM 12/5/2001 -0500, Melvin Smith wrote:
>
> > >>A: VMS' QIO system. Sorta.
> >
> >Its been years since I worked on VMS. QIO is sorta
> >"async-IO", no?
>
> Completely async, yep, as are many of VMS' system calls.
>
> >Can someone point me
At 12:36 PM 12/5/2001 -0600, David M. Lloyd wrote:
>On Wed, 5 Dec 2001, Dan Sugalski wrote:
>
> > The Zork interpreter might be stack based, thinking about it, but it was
> > hardly geared for speed, so I don't know that it'd count if it was.
>
>FWIW, there are many MUDs and MUCKs out there (multi
On Wed, 5 Dec 2001, Dan Sugalski wrote:
> The Zork interpreter might be stack based, thinking about it, but it was
> hardly geared for speed, so I don't know that it'd count if it was.
FWIW, there are many MUDs and MUCKs out there (multiplayer text-based
role-playing gmaes for those not in the k
At 03:38 AM 12/5/2001 +0100, Bart Lateur wrote:
>On Tue, 04 Dec 2001 15:57:56 -0500, Dan Sugalski wrote:
>
> >Q: Don't you know that stack machines are the way to go in software?
> >A: No, in fact, I don't.
> >
> >Q: But look at all the successful stack-based VMs!
> >A: Like what? There's just the
At 04:25 AM 12/5/2001 -0500, James Mastros wrote:
>On Tue, 4 Dec 2001, Dan Sugalski wrote:
> > This also means no writing your own license terms for code you submit.
> > ("Licensed under the same terms as perl" counts as writing your own...)
>Umm, AFACS (Though AINAL, and ISGCBAP (I should get c
Oh, you technical people:
Dan Sugalski <[EMAIL PROTECTED]> wrote:
>>FreeBSD 4.4 / gcc
>>Irix6.5 / MIPSPro
>Would those be working or not working? :)
The answer is, obviously, "Yes."
Now get back to work.
Whoops--that was someone talking to me!
John A
At 12:52 AM 12/5/2001 -0500, Jeff G wrote:
>The fact that the S registers are in fact generic struct registers is
>not evident from outside the internal code. For those of us implementing
>instructions, it might be useful to explicitly cast values like $1 to
>the correct type, in order to make sur
On Wed, 5 Dec 2001, Simon Cozens wrote:
> I've finally got around to adding perlundef.pmc, which means that the
> classes/Makefile has changed; this means you'll all - and tinderbox people
> especially - have to rerun Configure. I suppose someone should add tests
> for perlundef.pmc, but I hate w
At 05:57 PM 12/5/2001 +, Alex Gough wrote:
>On Wed, 5 Dec 2001, Simon Cozens wrote:
>
> > Since 0.0.3 is exceptionally imminent, can I have a roll-call of systems
> > which are working and not working?
>
>FreeBSD 4.4 / gcc
>Irix6.5 / MIPSPro
Would those be working or not working? :)
At 05:42 PM 12/5/2001 +, Simon Cozens wrote:
>and tinderbox people
>especially - have to rerun Configure.
Doing a "make clean" looks to be required first to get tinderbox checkouts
happy again.
Dan
--"it's like thi
On Wed, 5 Dec 2001, Simon Cozens wrote:
> Since 0.0.3 is exceptionally imminent, can I have a roll-call of systems
> which are working and not working?
FreeBSD 4.4 / gcc
Irix6.5 / MIPSPro
Alex
At 10:28 AM 12/5/2001 -0500, Jason Gloudon wrote:
>Using the aggregate's vtable is another way of getting the job done that
>avoids all the extra reference PMCs. However, references will have to be
>supported.
References are interesting. I'm currently thinking that:
*) PMCs should have a get_r
At 12:18 AM 12/5/2001 -0800, Brent Dax wrote:
>Dan Sugalski:
># 'Kay, here's the preliminary assembly-level docs for keys,
># which is how
># we're going to be accessing entries in aggregates.
>
>I'm probably just inexperienced and idiotic, but what's wrong with
>simple 'get_from_aggregate target,
At 12:29 PM 12/5/2001 -0500, Melvin Smith wrote:
> >>A: VMS' QIO system. Sorta.
>
>Its been years since I worked on VMS. QIO is sorta "async-IO", no?
Completely async, yep, as are many of VMS' system calls.
>Can someone point me to some starting material for QIO and/or unimplemented
>wants/wish
I've finally got around to adding perlundef.pmc, which means that the
classes/Makefile has changed; this means you'll all - and tinderbox people
especially - have to rerun Configure. I suppose someone should add tests
for perlundef.pmc, but I hate writing tests. :) (Especially if I think
they migh
>>A: VMS' QIO system. Sorta.
Its been years since I worked on VMS. QIO is sorta "async-IO", no?
Can someone point me to some starting material for QIO and/or unimplemented
wants/wishes for Parrot's IO sybsys? I might like to wade in in this area.
I'll also start looking thru the archive.
Mel
Since PMCs are done, languages should start to come out again. Every good code
generator needs a backend, and here's a first stab at an optimizer for Parrot:
http://216.254.0.2/~jgoff/Files/optimizer.perl
It takes a file of Parrot code post-macro-expansion, although it's internally just a
modu
At 06:29 PM 12/4/2001 -0800, Steve Fink wrote:
>On Tue, Dec 04, 2001 at 04:11:58PM -0500, Dan Sugalski wrote:
> > Seriously, there are real answers to a whole lot of design questions. Ask
> > 'em and I'll get FAQable answers to 'em once and for all.
>
>Whee! Ok. Some of these are probably duplicat
On Wed, Dec 05, 2001 at 12:18:53AM -0800, Brent Dax wrote:
> I'm probably just inexperienced and idiotic, but what's wrong with
> simple 'get_from_aggregate target, aggregate, key' and maybe
> 'get_list_from_aggregate target_list, aggregate, key_list'? (Obviously
> we'd shorten the names, but yo
On Tue, 4 Dec 2001, Dan Sugalski wrote:
> Q: What about endianness?
> A: Native endianness. Byteswapping's easy enough.
Where in the packfile does it define the native endinaness of floats?
(Note "native endianess" has to include wheather the sign is the MSB or
the LSB, and the endianness of the e
On Tue, 4 Dec 2001, Dan Sugalski wrote:
> This also means no writing your own license terms for code you submit.
> ("Licensed under the same terms as perl" counts as writing your own...)
Umm, AFACS (Though AINAL, and ISGCBAP (I should get caught by the acronym
police) but "Under the same terms a
Dan Sugalski:
# 'Kay, here's the preliminary assembly-level docs for keys,
# which is how
# we're going to be accessing entries in aggregates.
I'm probably just inexperienced and idiotic, but what's wrong with
simple 'get_from_aggregate target, aggregate, key' and maybe
'get_list_from_aggregate t
On Tue, 04 Dec 2001 15:57:56 -0500, Dan Sugalski wrote:
>Q: Don't you know that stack machines are the way to go in software?
>A: No, in fact, I don't.
>
>Q: But look at all the successful stack-based VMs!
>A: Like what? There's just the JVM.
>
>Q: What about all the others?
>A: *What* others? Th
49 matches
Mail list logo
