WebSVN – Kolibri OS – Diff – /programs/fs/kfar/trunk/zlib/trees.asm

 		cmp word[eax],0
 		jne @f ;while (..==0) bits--
 			dec dword[bits]
 			sub eax,2
 			jmp @b
+align 4
 		@@:
 		dec word[eax]     ;move one leaf down the tree
 		add word[eax+2],2 ;move one overflow item as its brother
 		mov eax,[max_length]
 		dec word[edi+deflate_state.bl_count+2*eax]
 			dec dword[h]
 			mov eax,[h]
 			movzx eax,word[edi+deflate_state.heap+2*eax]
 			mov [m],eax ;m = s.heap[--h]
 			cmp eax,[max_code]
-			jle @f ;if (..>..) continue
+			jg .cycle4 ;if (..>..) continue
-				dec ecx
-				jmp .cycle4
-			@@:
 			mov esi,[m]
 			imul esi,sizeof.ct_data
 			add esi,[tree] ;esi = &tree[m]
 			mov eax,[bits]
 			cmp word[esi+Len],ax
 				mov eax,[bits]
 				mov word[esi+Len],ax
 			@@:
 			dec ecx
 			jmp .cycle4
+align 4
 		.cycle4end:
 		dec dword[bits]
 		jmp .cycle3
+align 4
 .end_f:
 popad
 	ret
 endp
 	zlib_debug 'build_tree cycle0 ecx = %d',ecx
 	mov dword[edi+deflate_state.heap_len],0
 	mov dword[edi+deflate_state.heap_max],HEAP_SIZE
-	cmp ecx,0
-	jle .cycle0end
+	mov edx,[tree]
-	xor edx,edx
+	xor ecx,ecx
-	.cycle0: ;for (..;..<..;..)
-		mov eax,edx
+	.cycle0: ;for (..;..<..;..)
-		imul eax,sizeof.ct_data
+	cmp ecx,[elems]
-		add eax,[tree]
+	jge .cycle0end
-		cmp word[eax+Freq],0
+		cmp word[edx+Freq],0
 		je @f ;if (..!=0)
 			inc dword[edi+deflate_state.heap_len]
 			mov eax,[edi+deflate_state.heap_len]
-			mov [max_code],edx
-			mov [edi+deflate_state.heap+2*eax],dx
-			mov eax,edx
+			mov [max_code],ecx
-			add eax,edi
-			add eax,deflate_state.depth
+			mov [edi+deflate_state.heap+2*eax],cx
-			mov byte[eax],0
+			mov byte[edi+deflate_state.depth+ecx],0
 			jmp .end0
 align 4
 		@@: ;else
+			mov word[edx+Len],0
-			mov word[eax+Len],0
+		.end0:
-		.end0:
+		add edx,sizeof.ct_data
-		inc edx
+		inc ecx
-		loop .cycle0
+		jmp .cycle0
 align 4
 	.cycle0end:
 		add edx,[tree]
 		mov word[edx+Freq],ax
 		mov eax,ecx
 		add eax,edi
-		add eax,deflate_state.depth
-		mov al,byte[eax]
+		mov al,byte[eax+deflate_state.depth]
 		mov edx,[m]
 		add edx,edi
-		add edx,deflate_state.depth
-		mov ah,byte[edx]
+		mov ah,byte[edx+deflate_state.depth]
 		cmp al,ah
 		jl @f ;if (al>=ah) al=al : al=ah
 			mov al,ah
 		@@:
 		inc al
 		mov edx,[node]
 		add edx,edi
-		add edx,deflate_state.depth
-		mov byte[edx],al
+		mov byte[edx+deflate_state.depth],al
 		mov eax,[node]
 		mov edx,[m]
 		cmp ebx,[min_count]
 		jge .end1 ;else if (..<..)
 			mov eax,[curlen]
 			imul eax,sizeof.ct_data
 			add eax,edi
-			add eax,deflate_state.bl_tree+Freq
+			add word[eax+deflate_state.bl_tree+Freq],bx
-			add word[eax],bx
 			jmp .end4
 		.end1:
 		cmp dword[curlen],0
 		je .end2 ;else if (..!=0)
 			mov eax,[curlen]
 			cmp eax,[prevlen]
 			je @f ;if (..!=..)
 				imul eax,sizeof.ct_data
 				add eax,edi
-				add eax,deflate_state.bl_tree+Freq
+				inc word[eax+deflate_state.bl_tree+Freq]
-				inc word[eax]
 			@@:
 			mov eax,REP_3_6
 			imul eax,sizeof.ct_data
 			add eax,edi
-			add eax,deflate_state.bl_tree+Freq
+			inc word[eax+deflate_state.bl_tree+Freq]
-			inc word[eax]
 			jmp .end4
 		.end2:
 		cmp ebx,10
 		jg .end3 ;else if (..<=..)
 			mov eax,REPZ_3_10
 			imul eax,sizeof.ct_data
 			add eax,edi
-			add eax,deflate_state.bl_tree+Freq
+			inc word[eax+deflate_state.bl_tree+Freq]
-			inc word[eax]
 			jmp .end4
 		.end3: ;else
 			mov eax,REPZ_11_138
 			imul eax,sizeof.ct_data
 			add eax,edi
-			add eax,deflate_state.bl_tree+Freq
+			inc word[eax+deflate_state.bl_tree+Freq]
-			inc word[eax]
 		.end4:
 		mov dword[curlen],0
 		mov eax,[curlen]
 		mov [prevlen],eax
 		mov [nextlen],eax
 	zlib_debug 'send_tree'
 	; *** tree[max_code+1].Len = -1 ;guard already set
 	mov eax,[tree]
 	movzx eax,word[eax+Len]
 	mov [nextlen],eax
+	xor ecx,ecx
-	cmp eax,0
+	test eax,eax
-	jne @f ;if (..==0)
+	jnz .cycle0 ;if (..==0)
 		mov dword[max_count],138
 		mov dword[min_count],3
-	@@:
-	xor ecx,ecx
+align 4
 	.cycle0: ;for (..;..<=..;..)
 	cmp ecx,[max_code]
 	jg .cycle0end
 		mov eax,[nextlen]
 		mov eax,[nextlen]
 		cmp [curlen],eax
 		jne .end0 ;if (..<.. && ..==..)
 			inc ecx
 			jmp .cycle0 ;continue
+align 4
 		.end0:
 		cmp ebx,[min_count]
 		jge .end1 ;else if (..<..)
 			@@: ;do
 				mov ebx,edi
 				add ebx,deflate_state.bl_tree
 				send_code edi, [curlen], ebx
 				dec dword[count]
-				cmp dword[count],0
-				jne @b ;while (..!=0)
+				jnz @b ;while (..!=0)
 			jmp .end4
 align 4
 		.end1:
 		cmp dword[curlen],0
 		je .end2 ;else if (..!=0)
 		mov eax,[max_blindex]
 		add eax,bl_order
 		movzx eax,byte[eax]
 		imul eax,sizeof.ct_data
 		add eax,edi
-		add eax,deflate_state.bl_tree+Len
+		cmp word[eax+deflate_state.bl_tree+Len],0
-		cmp word[eax],0
 		jne .cycle0end ;if (..!=0) break
 		jmp .cycle0
+align 4
 	.cycle0end:
 	; Update opt_len to include the bit length tree and counts
 	mov eax,[max_blindex]
 	inc eax
 	imul eax,3
 ;        Tracev((stderr, "\nbl code %2d ", bl_order[ecx]));
 		mov eax,ecx
 		add eax,bl_order
 		movzx eax,byte[eax]
 		imul eax,sizeof.ct_data
-		mov ebx,edi
+		add eax,edi
-		add ebx,deflate_state.bl_tree+Len
+		movzx eax,word[eax+deflate_state.bl_tree+Len]
-		add ebx,eax
-		stdcall send_bits, edi, ebx, 3
+		stdcall send_bits, edi, eax, 3
 		inc ecx
 		jmp .cycle0
 align 4
 	.cycle0end:
 ;    Tracev((stderr, "\nbl tree: sent %ld", s->bits_sent));
 		shr dword[p1code],1
 		shl eax,1
 		dec dword[len]
 		cmp dword[len],0
 		jg @b ;while (..>..)
-	shl eax,1
+	shr eax,1
 	ret
 endp
 ; ===========================================================================

Subversion Repositories Kolibri OS

(root)/programs/fs/kfar/trunk/zlib/trees.asm – Rev 6799 → 6813