home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!zaphod.mps.ohio-state.edu!wupost!csus.edu!netcom.com!netcomsv!ulogic!hartman
- From: hartman@ulogic.UUCP (Richard M. Hartman)
- Newsgroups: comp.lang.c
- Subject: Re: Problem with string processing.
- Message-ID: <823@ulogic.UUCP>
- Date: 7 Jan 93 23:28:12 GMT
- References: <MCGLK.93Jan5005833@yang.cpac.washington.edu> <811@ulogic.UUCP> <1993Jan6.162841.5570@taumet.com>
- Distribution: usa
- Organization: negligable
- Lines: 28
-
- What I was after was the rough equivilent difference between (Intel)
-
- MOVSW src,dst
-
- and a loop w/
-
- MOV ax,src
- MOV dstax
-
- (so sue me if my assembly is wrong...) The thing is that, yes
- each byte does have to get moved, but the one instruction moves
- 'em a heck of a lot quicker than the loop of separate instructions.
-
- I was postulating a similarly enhanced "search for byte from here"
- instruction.
-
- OF COURSE all the bytes have to be looked at, but if the CPU
- "knows" how to do this in microcode, then you don't have to
- waste CPU time loading all those instructions in the loop
- over and over again, you just have to load the data.
-
-
- =-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
- And the men who hold high places |
- must be the ones who start | -Richard Hartman
- to mold a new reality | hartman@uLogic.COM
- closer to the heart! |
-
-