Path: utzoo!attcan!uunet!cs.dal.ca!aucs!850031m
From: 850031m@aucs.uucp (Ross MacGregor)
Newsgroups: comp.sys.amiga.tech
Subject: Re: A REAL fork() function (was Re: SKsh weirdness)
Message-ID: <1990Mar1.181428.23541@aucs.uucp>
Date: 1 Mar 90 18:14:28 GMT
References: <DEVEN.90Feb22133919@netserv2.rpi.edu> <13920050@hpfelg.HP.COM> <22496@pasteur.Berkeley.EDU> <9814@batcomputer.tn.cornell.edu>
Reply-To: 850031m@aucs.UUCP (Ross MacGregor)
Organization: School of Computer Science, Acadia Univ., Nova Scotia
Lines: 14

In article <9814@batcomputer.tn.cornell.edu> riley@tcgould.tn.cornell.edu (Daniel S. Riley) writes:
[stuff on why malloc would be faster than AllocMem on average...deleted]

>This is all specific to the Lattice implimentation of malloc().  Manx does
>things differently.

So how does Manx go about doing this? 

>-Dan Riley (riley@tcgould.tn.cornell.edu, cornell!batcomputer!riley)
>-Wilson Lab, Cornell University
-- 
Ross MacGregor                                      | " Elvis Lives - I
E-mail: 850031m@AcadiaU.CA                          |   heard him on the   
UUCP:   {uunet|watmath|utai}!cs.dal.ca!aucs!850031m |   radio yesterday"