Lab 10 (2)

Source: Internet
Author: User
; Experiment 10; solve the problem of Division overflow assume Cs: code, SS: stackstack segment dd 0, 0, 0, 0 stack endscode segmentstart: mov ax, stack mov SS, ax mov sp, 16; define stack segment mov ax, 4240 H mov dx, 000fh mov CX, 0ah call divdw mov ax, 4c00h int 21 hdivdw: Push BX mov BX, ax; save low data mov ax, DX mov dx, 0 Div cx push ax; the storage provider push DX; the remainder pop ax; the remainder mov dx, ax mov ax, BX Div CX, DX; remainder pop DX; high-end pop BX retcode endsend start

 

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.