News for hackers. Stuff that matters.

A comment on Infinite complexity in 4096 bytes. Parent comment

Re:Infinite complexity in 4096 bytes by inoop on Friday May 11, 2012 @08:24AM (#3958839) 

    mov ax, 13h
    int 10h
[ Parent | on HN ]
Re:Infinite complexity in 4096 bytes by exDM69 on Friday May 11, 2012 @08:31AM (#3958851)
You are correct. And using a mov to ax rather than xor+mov to al is counter-intuitively one byte smaller (there's one more byte of immediate value in the former). Every byte counts!

(I tested using "nasm -f bin")

[ Parent | on HN ]
Re:Infinite complexity in 4096 bytes by gliptic on Friday May 11, 2012 @11:04AM (#3959534)
However, in .coms you could assume that AX was 0 upon entry and skip the XOR.
[ Parent | on HN ]