is the proc recursive?
Ney.
It's recurrent but not recursive. Means that it uses previous results but doesn't call itself.
Posted on 2004-07-09 15:40:46 by The Svin
PascalD PROC lpMemory, dCount 

mov edi, lpMemory
mov esi, edi

xor edx, edx
inc edx
_1: mov eax, edx
stosd
mov ebp, edi
_2: stosd
lodsd
xadd eax, edx
cmp ebp, esi
jnc _2

dec dCount
jne _1

retn 8
This one almost creates the oringinal table.
Maybe someone can fix this?
Posted on 2004-07-09 20:43:55 by bitRAKE
It is longer than I'd like:
	mov edi, lpMemory

lea esi, [edi+4]
xor edx, edx
inc edx
jmp _3

_2: lodsd
xadd eax, edx
_1: cmp ebp, esi
stosd
jnc _2

_3: mov eax, edx
mov ebp, edi
dec dCount
jns _1
stosd
retn 8
Implements: 1,1,2,1,3,3,1,4,6,...(35 bytes + 2 for popad/pushad)
Posted on 2004-07-11 18:51:27 by bitRAKE
Where is our freind Poimander? :)
Posted on 2004-07-14 17:58:24 by The Svin

Show me how LOOP makes the code smaller?
It is easy to get under 32 bytes with following:
	pop edx

pop eax ; lpMemory
pop ecx ; dCount
pushad

xchg eax, edi
_0:

; (your favorite algo) :)

loop _0 ; Thx [b]mark_larson[/b]!

popad
jmp edx
Posted on 2004-07-14 20:14:35 by bitRAKE
Well, interesting but it's not the same, 3 regs trashed.
Posted on 2004-07-17 14:16:50 by The Svin