Re: [not quite an RFC] shared bytecode/optree

2000-10-25 Thread Chaim Frenkel
> "BS" == Benjamin Stuhl <[EMAIL PROTECTED]> writes: BS> My primary goal (it may not have come accross strongly BS> enough) in this proposal was sharing bytecode between BS> threads even with an ithreadsish model (variables are BS> thread-private, except when explicitly shared). This BS> requ

Re: [not quite an RFC] shared bytecode/optree

2000-10-25 Thread Nicholas Clark
On Wed, Oct 25, 2000 at 06:23:20PM +0100, Tom Hughes wrote: > In message <[EMAIL PROTECTED]> > Nicholas Clark <[EMAIL PROTECTED]> wrote: > > > Specific example where you can't: > > on ARM, the branch instructions (B and BL) are PC relative, but only have > > a 24 bit offset field. The a

Re: [not quite an RFC] shared bytecode/optree

2000-10-25 Thread Tom Hughes
In message <[EMAIL PROTECTED]> Nicholas Clark <[EMAIL PROTECTED]> wrote: > Specific example where you can't: > on ARM, the branch instructions (B and BL) are PC relative, but only have > a 24 bit offset field. The address space is (now) 32 bit, so there's parts > you can't reach without

Re: [not quite an RFC] shared bytecode/optree

2000-10-25 Thread Benjamin Stuhl
--- Chaim Frenkel <[EMAIL PROTECTED]> wrote: > > "BS" == Benjamin Stuhl <[EMAIL PROTECTED]> writes: > > BS> 1. Bytecode can just be mmap'ed or read in, no > playing > BS> around with relocations on loading or games with RVAs > BS> (which can't be used anyway, since variable RVAs vary > based

Re: [not quite an RFC] shared bytecode/optree

2000-10-25 Thread Nicholas Clark
On Wed, Oct 25, 2000 at 09:45:55AM -0700, Steve Fink wrote: > Hey, it's finally a use for the 'use less space/use less time' pragma! > 'use less space' means share the bytecode and either do computed jumps > or unshared lookup tables; 'use less time' means fixup unshared bytecode > at load time (o

Re: [not quite an RFC] shared bytecode/optree

2000-10-25 Thread Steve Fink
Hey, it's finally a use for the 'use less space/use less time' pragma! 'use less space' means share the bytecode and either do computed jumps or unshared lookup tables; 'use less time' means fixup unshared bytecode at load time (or page fault time, or whatever). :-)

Re: [not quite an RFC] shared bytecode/optree

2000-10-25 Thread Dan Sugalski
At 05:21 PM 10/25/00 +0100, Nicholas Clark wrote: >On Wed, Oct 25, 2000 at 12:05:22PM -0400, Dan Sugalski wrote: > > At 05:02 PM 10/25/00 +0100, Nicholas Clark wrote: > > >On Wed, Oct 25, 2000 at 11:45:54AM -0400, Chaim Frenkel wrote: > > > > I vaguly can see a TIL that uses machine code linkage (

Re: [not quite an RFC] shared bytecode/optree

2000-10-25 Thread Nicholas Clark
On Wed, Oct 25, 2000 at 12:28:55PM -0400, Dan Sugalski wrote: > At 05:21 PM 10/25/00 +0100, Nicholas Clark wrote: > >"fixup sections" sound horribly like something I've read in association > >with a.out or ELF shared libraries. (I forget which) > > Both, though they may call it something else. As

Re: [not quite an RFC] shared bytecode/optree

2000-10-25 Thread Nicholas Clark
On Wed, Oct 25, 2000 at 12:05:22PM -0400, Dan Sugalski wrote: > At 05:02 PM 10/25/00 +0100, Nicholas Clark wrote: > >On Wed, Oct 25, 2000 at 11:45:54AM -0400, Chaim Frenkel wrote: > > > I vaguly can see a TIL that uses machine code linkage (real machine code > > > jumps) that perhaps could use rel

Re: [not quite an RFC] shared bytecode/optree

2000-10-25 Thread Dan Sugalski
At 05:02 PM 10/25/00 +0100, Nicholas Clark wrote: >On Wed, Oct 25, 2000 at 11:45:54AM -0400, Chaim Frenkel wrote: > > I vaguly can see a TIL that uses machine code linkage (real machine code > > jumps) that perhaps could use relative addressing as not needing > > relocation. But I'm not sure that

Re: [not quite an RFC] shared bytecode/optree

2000-10-25 Thread Nicholas Clark
On Wed, Oct 25, 2000 at 11:45:54AM -0400, Chaim Frenkel wrote: > I vaguly can see a TIL that uses machine code linkage (real machine code > jumps) that perhaps could use relative addressing as not needing > relocation. But I'm not sure that all architectures support long enough > relative jumps/ca

Re: [not quite an RFC] shared bytecode/optree

2000-10-25 Thread Chaim Frenkel
> "BS" == Benjamin Stuhl <[EMAIL PROTECTED]> writes: BS> 1. Bytecode can just be mmap'ed or read in, no playing BS> around with relocations on loading or games with RVAs BS> (which can't be used anyway, since variable RVAs vary based BS> on what's been allocated or freed earlier). (What is a

Re: [not quite an RFC] shared bytecode/optree

2000-10-24 Thread Simon Cozens
On Tue, Oct 24, 2000 at 04:41:38PM -0700, Benjamin Stuhl wrote: > It seems to me that one thing that the perl6 bytecode > implementation _should_ do (in the interests of being light > and fast, as well as meshing well with MT) is be > position-independant. Fancy offering a patch to RFC310? -- I

[not quite an RFC] shared bytecode/optree

2000-10-24 Thread Benjamin Stuhl
Firstly, by "bytecode" I mean a .pmc and by "optree" I mean the perl6 VM's internal form that it goes through executing. It seems to me that one thing that the perl6 bytecode implementation _should_ do (in the interests of being light and fast, as well as meshing well with MT) is be position-inde