Newsgroups: comp.lang.lisp,comp.lang.scheme,comp.arch
Path: cantaloupe.srv.cs.cmu.edu!das-news.harvard.edu!news2.near.net!MathWorks.Com!europa.eng.gtefsd.com!howland.reston.ans.net!pipex!uknet!festival!edcogsci!richard
From: richard@cogsci.ed.ac.uk (Richard Tobin)
Subject: Re: Validating/using all 2^lgn address bits
Message-ID: <CvpIo5.87M@cogsci.ed.ac.uk>
Organization: HCRC, University of Edinburgh
References: <Cvntov.9B1@dcs.gla.ac.uk> <Cvo20o.I01@cogsci.ed.ac.uk> <Cvo8xv.7vr@dcs.gla.ac.uk>
Date: Tue, 6 Sep 1994 12:00:05 GMT
Lines: 17
Xref: glinda.oz.cs.cmu.edu comp.lang.lisp:14478 comp.lang.scheme:9711 comp.arch:52786

In article <Cvo8xv.7vr@dcs.gla.ac.uk> bos@dcs.gla.ac.uk (Bryan O'Sullivan) writes:
>Did it use BIBOP under versions of BSD prior to those that had NFS (and
>hence mmap) folded in, do you know?

Yes.  It doesn't use mmap even now.

You don't need to be able to choose addresses in order to use BIBOP.
You can just allocate a page (not necessarily a VM page; just an area
whose size is a power of two and aligned to the same size) and record
it in a table mapping high-order bits to types.

-- Richard
-- 
Richard Tobin, HCRC, Edinburgh University                 R.Tobin@ed.ac.uk

Ooooh!  I didn't know we had a king.  I thought we were an
autonomous collective.
