Simple and fast enough. The algo does not need the 1000 iterations, 5 or 10 would do but its fast enough to run a high count.
; ¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤
include \masm32\include64\masm64rt.inc
.code
; ¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤
entry_point proc
LOCAL lcnt :QWORD
mov lcnt, 20
lbl:
call reseed
conout str$(rax),lf
sub lcnt, 1
jnz lbl
waitkey
.exit
entry_point endp
; ¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤
NOSTACKFRAME
reseed proc
; --------------------------------------
; random algorithm random seed generator
; --------------------------------------
LOCAL var1 :QWORD
lea r10, var1 ; load the address
mov r9, 1000 ; set the counter
mov r11, 12345678 ; put something in r11
@@:
invoke QueryPerformanceCounter, r10 ; call the API
mov rax, [r10] ; write value in var1 to rax
bswap rax ; byte swap rax
xor r11, rax ; xor combine with r11
sub r9, 1 ; decrement counter
jnz @B ; loop again if not 0
mov rax, r11 ; return xorred content in rax
ret
reseed endp
STACKFRAME
; ¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤
end
