Article View: comp.sys.ibm.pc
Article #42353Re: Need help with Turbo C "farmalloc"
From: Ralf.Brown
Date: Sat, 10 Feb 1990 22:11
Date: Sat, 10 Feb 1990 22:11
25 lines
1543 bytes
1543 bytes
In article <2521@leah.Albany.Edu>, rds95@leah.Albany.Edu (Robert Seals) wrote:
}In article <25d2b215@ralf>, Ralf.Brown@B.GP.CS.CMU.EDU writes:
}> Here is some code which I use for small permanent allocations, which virtually
}> eliminates memory management overhead (16-32 bytes overhead for 8192 bytes of
}> allocation, assuming 16-byte or smaller allocations). You may want to use
}> farmalloc() instead of malloc() to allocate the blocks which get parceled
}> out.
}
}[ code deleted ]
}
}Ralf's code is probably terrific, but remember to
}
}#include <alloc.h>
}
}or you'll probably have problems in the larger memory models.
<blush> I missed that line when I ripped the code out of another program....
--
UUCP: {ucbvax,harvard}!cs.cmu.edu!ralf -=- 412-268-3053 (school) -=- FAX: ask
ARPA: ralf@cs.cmu.edu BIT: ralf%cs.cmu.edu@CMUCCVMA FIDO: Ralf Brown 1:129/46
"How to Prove It" by Dana Angluin Disclaimer? I claimed something?
14. proof by importance:
A large body of useful consequences all follow from the proposition in
question.
Technical Details
Message-ID:
<25d49faa@ralf>Path:
arc1-ca.pugleaf.net!utzoo!attcan!uunet!jarthur!usc!cs.utexas.edu!tut.cis.ohio-state.edu!pt.cs.cmu.edu!b.gp.cs.cmu.edu!Ralf.Brown@B.GP.CS.CMU.EDUShow Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!utzoo!attcan!uunet!jarthur!usc!cs.utexas.edu!tut.cis.ohio-state.edu!pt.cs.cmu.edu!b.gp.cs.cmu.edu!Ralf.Brown@B.GP.CS.CMU.EDU From: Ralf.Brown@B.GP.CS.CMU.EDU Newsgroups: comp.sys.ibm.pc Subject: Re: Need help with Turbo C "farmalloc" Message-ID: <25d49faa@ralf> Date: 10 Feb 90 22:11:38 GMT Sender: ralf@b.gp.cs.cmu.edu Organization: Carnegie Mellon University School of Computer Science Lines: 25 In-Reply-To: <2521@leah.Albany.Edu>