Skip to main content

Bad luck

This is a program that simply extracts numbers from buffered input. I do not have any idea why this didn’t work. I got a zero.



input:
        mov ah, 0ah		; buffered input sys call
        lea dx, strptr		; load effective address
        int 21h			; call kernel
	
        mov ah, 02h		; write character to stdout sys call
        mov dl, 0ah		; issue carriage-return
        int 21h			; call kernel
	
        lea si, string		; set source index to start of string
        mov cl, [strlen]	; set loop counter
	
here:
        mov dl, [si]		; place current character in dl
        cmp dl, '0'		; compare if below '0'
        jb traverse
        cmp dl, '9'		; compare if above '9'
        ja traverse
	
        mov ah, 02h		; write character to stdout sys call
        int 21h			; call kernel
        cmp dl, '$'		; check end-of-string sentinel
        je exit			
	
traverse:
        inc si			; increment source index pointer
	
loop here
	
exit:
        int 20h			; terminate
	
strptr  label byte
maxlen  db 49
strlen  db ?
string  db 50 dup ('$')

It runs smoothly on my machine. Damn it.

Labels:

Comments

Post a Comment

Popular posts from this blog

Architecture Complexity

Here are the items to consider: Coding to an interface Service Oriented Architecture Automated Testing Domain Driven Design Custom Data Access Layer Layered architecture Complexity is relatively equal the number of lines of code. Note that complexity is not bad. It must be justified.
Post a Comment
Read more

Moving on

So I bought my self a 2.5″ hard drive enclosure for about 750 bucks. I wish I have my own tools for constructing a device as such. Instead of going for a 2GB USB flash drive, I chose to salvage the 30GB hard drive of an incapacitated laptop. Cool isn’t it? Though relatively slower than a typical USB flash drive, the storage capacity outweighs it. [To God] Thanks for being there always.
Post a Comment
Read more

Bin to hex converter in 16-bit DOS assembly

Just a quick code like putting your keyboard where your brain is. There should be another way of doing this. I hate this code. start: xor al, al xor bl, bl xor cl, cl mov dl, 4 ; use dl as counter input: mov ah, 00 int 16h cmp ah, 1ch je exit cmp al, '0' jb input cmp al, '1' ja input convert: mov cl, dl dec cl ; dl - 1 sub al, 30h ; get original value shl al, cl ; place in the appropriate bit position or bl, al ; save in bl dec dl ; prepare for the next bit jnz input ; must be 4 bits cmp bl, 9 ja letter jbe number letter: add bl, 37h ; because 'A' - 37h is 0Ah jmp here number: add bl, 30h ; because '0' - 30h is 00h here: call display jmp start display: mov ah, 02h ...
Post a Comment
Read more