cvs.gedasymbols.org/archives/browse.cgi   search  
Mail Archives: djgpp/1997/10/01/06:05:40

Date: Wed, 1 Oct 1997 13:03:23 +0300 (EET DST)
From: Esa A E Peuha <peuha AT cc DOT helsinki DOT fi>
Reply-To: Esa DOT Peuha AT Helsinki DOT FI
To: DJ Delorie <dj AT delorie DOT com>
cc: djgpp AT delorie DOT com
Subject: Re: Segments vs Selectors
In-Reply-To: <199709302258.SAA18761@delorie.com>
Message-ID: <Pine.SOL.3.96.971001130021.27742A-100000@kruuna.Helsinki.FI>
MIME-Version: 1.0

On Tue, 30 Sep 1997, DJ Delorie wrote:
> Yes, but you can't control large segments that finely.  You have to
> round it to at least a 4K boundary.
> 
True. I didn't remember that.

> Besides, the limit is 1M+64-16+3, since you can do a 32-bit access
> starting at the last byte in the segment, and it will go past the end
> of the segment.
> 
Actually, you can reach 1M+64K-16+7 with a suitable `bound' instruction.

Esa Peuha
student of mathematics at the University of Helsinki
http://www.helsinki.fi/~peuha/

- Raw text -


  webmaster     delorie software   privacy  
  Copyright © 2019   by DJ Delorie     Updated Jul 2019