Re: data storage and representation when designing bytecode (and VM)

2000-10-03 Thread Dan Sugalski
At 08:25 PM 10/3/00 +0100, Nicholas Clark wrote: >On Tue, Oct 03, 2000 at 02:38:01PM -0400, Dan Sugalski wrote: > > At 06:42 PM 10/3/00 +0100, Nicholas Clark wrote: > > >But I seem to remember someone who should know (Tom Christiansen?) at > > >YAPC::Europe being confident that bytecode would neve

Re: data storage and representation when designing bytecode (and VM)

2000-10-03 Thread Dan Sugalski
At 03:18 PM 10/3/00 -0400, Joshua N Pritikin wrote: >On Tue, Oct 03, 2000 at 02:37:13PM -0400, [EMAIL PROTECTED] wrote: > > At 12:27 PM 10/3/00 -0500, Jarkko Hietaniemi wrote: > > >Serializing an optree is rather tricky especially if one wants to > > >deserialize it on a different platform. Becau

Re: data storage and representation when designing bytecode (and VM)

2000-10-03 Thread Nicholas Clark
On Tue, Oct 03, 2000 at 02:38:01PM -0400, Dan Sugalski wrote: > At 06:42 PM 10/3/00 +0100, Nicholas Clark wrote: > >But I seem to remember someone who should know (Tom Christiansen?) at > >YAPC::Europe being confident that bytecode would never be faster. > > Really? I think we shall have to prove

Re: data storage and representation when designing bytecode (and VM)

2000-10-03 Thread Joshua N Pritikin
On Tue, Oct 03, 2000 at 02:37:13PM -0400, [EMAIL PROTECTED] wrote: > At 12:27 PM 10/3/00 -0500, Jarkko Hietaniemi wrote: > >Serializing an optree is rather tricky especially if one wants to > >deserialize it on a different platform. Because of icky things like > >structure padding one effectively

Re: data storage and representation when designing bytecode (and VM)

2000-10-03 Thread Dan Sugalski
At 06:42 PM 10/3/00 +0100, Nicholas Clark wrote: >But I seem to remember someone who should know (Tom Christiansen?) at >YAPC::Europe being confident that bytecode would never be faster. Really? I think we shall have to prove him wrong. (And not by slowing down the parsing, either--that's cheati

Re: data storage and representation when designing bytecode (and VM)

2000-10-03 Thread Dan Sugalski
At 05:32 PM 10/3/00 +0100, Nicholas Clark wrote: >On Mon, Oct 02, 2000 at 07:21:46AM -0500, Jarkko Hietaniemi wrote: > > Having such bytecodes available is essential for the proposed > > functionality of dumping the state of a live and running Perl virtual > > machine and breathing life into that

Re: data storage and representation when designing bytecode (and VM)

2000-10-03 Thread Dan Sugalski
At 12:27 PM 10/3/00 -0500, Jarkko Hietaniemi wrote: >Serializing an optree is rather tricky especially if one wants to >deserialize it on a different platform. Because of icky things like >structure padding one effectively really needs to go the way of >*byte*codes which makes for one sssllloooww

Re: data storage and representation when designing bytecode (and VM)

2000-10-03 Thread Nicholas Clark
On Tue, Oct 03, 2000 at 12:27:03PM -0500, Jarkko Hietaniemi wrote: > On Tue, Oct 03, 2000 at 05:32:48PM +0100, Nicholas Clark wrote: > > Were you thinking that p6 bytecode has 2 functions > > > > 1: putting a perl virtual machine into suspended animation (or cloning it) > > 2: producing a "preco

Re: data storage and representation when designing bytecode (and VM)

2000-10-03 Thread Jarkko Hietaniemi
On Tue, Oct 03, 2000 at 05:32:48PM +0100, Nicholas Clark wrote: > On Mon, Oct 02, 2000 at 07:21:46AM -0500, Jarkko Hietaniemi wrote: > > Having such bytecodes available is essential for the proposed > > functionality of dumping the state of a live and running Perl virtual > > machine and breathing

Re: data storage and representation when designing bytecode (and VM)

2000-10-03 Thread Nicholas Clark
On Mon, Oct 02, 2000 at 07:21:46AM -0500, Jarkko Hietaniemi wrote: > Having such bytecodes available is essential for the proposed > functionality of dumping the state of a live and running Perl virtual > machine and breathing life into that later. Were you thinking that p6 bytecode has 2 functio

Re: Accessing a variable's attributes (was Re: RFC 241 (v1) ...)

2000-10-03 Thread John Porter
> Michael G Schwern wrote: > > > Also, just being able to tack flags onto a variable means each > > variable (that has a flag) would have to carry around a hash! No; it has to carry around a vtbl (or vtbl-like thing). User-level attributes are (or should be :-) accessor methods to some underlyin