Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: $Revision: 1.6.2.16 $; site pbear.UUCP
Path: utzoo!linus!decvax!cca!pbear!peterb
From: peterb@pbear.UUCP
Newsgroups: net.arch
Subject: Re: Orphaned Response
Message-ID: <600008@pbear.UUCP>
Date: Thu, 25-Jul-85 16:43:00 EDT
Article-I.D.: pbear.600008
Posted: Thu Jul 25 16:43:00 1985
Date-Received: Tue, 20-Aug-85 00:32:04 EDT
References: <476@mmintl.UUCP>
Lines: 12
Nf-ID: #R:mmintl:-47600:pbear:600008:177600:481
Nf-From: pbear!peterb    Jul 25 16:43:00 1985



	It is trivial to determine overflow in a word X word = word
operation. Just do the standard multiply producing 2*word bits and check the
high order word for non-zero(base 1) values. If this is so, then to result
has overflowed. This check can be built in and executed at the end of the
multiply as the resultant lower word result is placed in the destination.

	It is not that expensive, requiring a few clocks at best.

Peter Barada
{ihnp4!inmet|{harvard|cca}!ima}!pbear!peterb