Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!mnetor!seismo!rutgers!clyde!ima!johnl
From: johnl@ima.UUCP (John R. Levine)
Newsgroups: comp.lang.c,comp.sys.ibm.pc,comp.sys.intel
Subject: Re: C compilers that can access more memory
Message-ID: <588@ima.UUCP>
Date: Sat, 6-Jun-87 11:30:43 EDT
Article-I.D.: ima.588
Posted: Sat Jun  6 11:30:43 1987
Date-Received: Wed, 10-Jun-87 05:40:10 EDT
References: <496@tahoe.UUCP>
Reply-To: johnl@ima.UUCP (John R. Levine)
Organization: Javelin Software Corporation
Lines: 17
Keywords: More C Memory
Summary: rtfm
Xref: mnetor comp.lang.c:2376 comp.sys.ibm.pc:4660 comp.sys.intel:259

In article <496@tahoe.UUCP> malc@tahoe.UUCP (Malcolm L. Carlock) writes:
>I'm looking for a C compiler to run on '286 AT's or AT clones that can
>access more than 64K of program and 64K of data memory.  Microsoft C and
>MIX C both seem to be unable to access more than 64K of either.  ...

Most C compilers on the market now are entirely able to fill your computer's
entire memory with code or data.  You have to tell them to compile code in
the medium or large addressing model, so it generates code and data addresses
that are not all in the same 64K segment.  I've personally used MS C, Lattice,
and Turbo (nee Wizard) to compile programs that ended up with about 600K of
code and 150K of data.  (In case you were wondering, we overlay the code.)
The manuals that come with the compilers usually explain the addressing in
gruesome detail, consult them for more info.
-- 
John R. Levine, Javelin Software Corp., Cambridge MA +1 617 494 1400
{ ihnp4 | decvax | cbosgd | harvard | yale }!ima!johnl, Levine@YALE.something
U.S. out of New Mexico!