www.delorie.com/archives/browse.cgi | search |
From: | Nathan Phillips <nathan AT ug2 DOT sthughs DOT ox DOT ac DOT uk> |
Newsgroups: | comp.os.msdos.djgpp |
Subject: | Re: some advice required |
Date: | Thu, 27 Feb 1997 13:16:04 +0000 |
Organization: | Oxford University |
Message-ID: | <Pine.LNX.3.95.970227131444.329J-100000@ug2.sthughs.ox.ac.uk> |
References: | <Pine DOT LNX DOT 3 DOT 91 DOT 970227000104 DOT 2463A-100000 AT aditya DOT unigoa DOT ernet DOT in> <3315B014 DOT 3C8C AT cs DOT com> |
Reply-To: | Nathan DOT Phillips AT St-Hughs DOT ox DOT ac DOT uk |
NNTP-Posting-Host: | ug2.sthughs.ox.ac.uk |
Mime-Version: | 1.0 |
In-Reply-To: | <3315B014.3C8C@cs.com> |
Lines: | 14 |
To: | djgpp AT delorie DOT com |
DJ-Gateway: | from newsgroup comp.os.msdos.djgpp |
On Thu, 27 Feb 1997, John M. Aldrich wrote: > Gurunandan R. Bhat wrote: > > will a kind assembly guru pick this nit please: assuming that x+y > > and x|y give me the same result, which one is faster? > The logical OR is probably much faster I would have thought they took the same time. How many cycles on each then? | | | | |\ | _ |- |_ _. _ | \| (_| |_ | ) (_| | ) - Nathan DOT Phillips AT St-Hughs DOT oxford DOT ac DOT uk char *p="char *p=%c%s%c;main(){printf(p,34,p,34);}";main(){printf(p,34,p,34);}
webmaster | delorie software privacy |
Copyright © 2019 by DJ Delorie | Updated Jul 2019 |