home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!stanford.edu!bcm!tamsun.tamu.edu!zeus.tamu.edu!jle9162
- From: jle9162@zeus.tamu.edu (ECKHARDT, JASON LEE)
- Newsgroups: comp.unix.sysv386
- Subject: optimization
- Message-ID: <15SEP199221024888@zeus.tamu.edu>
- Date: 16 Sep 1992 02:02:00 GMT
- Sender: news@tamsun.tamu.edu (Read News)
- Distribution: usa
- Organization: Texas A&M University, Academic Computing Services
- Lines: 13
- News-Software: VAX/VMS VNEWS 1.41
-
-
- I am writing some code that needs to be extremely fast in x86 assembly.
- A bottleneck I'm running into is this:
- (cx=num1, dx=num2)
- mov ax,640
- mul dx
- add ax,cx
- This sequence simply takes too long. Can anybody think of a faster way
- of doing this address calculation? Possibly shifting is the answer?
-
- Thanks for your help.
- Jason.
- reply by email to jle9162@venus.tamu.edu
-