DXR is a code search and navigation tool aimed at making sense of large projects. It supports full-text and regex searches as well as structural queries.

Untracked file

Line Code
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351
;
;  mpi_x86.asm - assembly language implementation of s_mpv_ functions.
; 
;  The contents of this file are subject to the Mozilla Public
;  License Version 1.1 (the "License"); you may not use this file
;  except in compliance with the License. You may obtain a copy of
;  the License at http://www.mozilla.org/MPL/
;  
;  Software distributed under the License is distributed on an "AS
;  IS" basis, WITHOUT WARRANTY OF ANY KIND, either express or
;  implied. See the License for the specific language governing
;  rights and limitations under the License.
;  
;  The Original Code is the Netscape security libraries.
;  
;  The Initial Developer of the Original Code is Netscape
;  Communications Corporation.	Portions created by Netscape are 
;  Copyright (C) 2000 Netscape Communications Corporation.  All
;  Rights Reserved.
;  
;  Contributor(s):
;  
;  Alternatively, the contents of this file may be used under the
;  terms of the GNU General Public License Version 2 or later (the
;  "GPL"), in which case the provisions of the GPL are applicable 
;  instead of those above.	If you wish to allow use of your 
;  version of this file only under the terms of the GPL and not to
;  allow others to use your version of this file under the MPL,
;  indicate your decision by deleting the provisions above and
;  replace them with the notice and other provisions required by
;  the GPL.  If you do not delete the provisions above, a recipient
;  may use your version of this file under either the MPL or the
;  GPL.
;   $Id: mpi_x86.asm,v 1.1 2000/09/02 05:33:15 nelsonb%netscape.com Exp $
; 

	.386p
	.MODEL	FLAT
	ASSUME  CS: FLAT, DS: FLAT, SS: FLAT
_TEXT   SEGMENT

;   ebp - 36:	caller's esi
;   ebp - 32:	caller's edi
;   ebp - 28:	
;   ebp - 24:	
;   ebp - 20:	
;   ebp - 16:	
;   ebp - 12:	
;   ebp - 8:	
;   ebp - 4:	
;   ebp + 0:	caller's ebp
;   ebp + 4:	return address
;   ebp + 8:	a	argument
;   ebp + 12:	a_len	argument
;   ebp + 16:	b	argument
;   ebp + 20:	c	argument
;   registers:
;  	eax:
; 	ebx:	carry
; 	ecx:	a_len
; 	edx:
; 	esi:	a ptr
; 	edi:	c ptr

public	_s_mpv_mul_d
_s_mpv_mul_d PROC NEAR
    push   ebp
    mov    ebp,esp
    sub    esp,28
    push   edi
    push   esi
    push   ebx
    mov    ebx,0		; carry = 0
    mov    ecx,[ebp+12]		; ecx = a_len
    mov    edi,[ebp+20]
    cmp    ecx,0
    je     L_2			; jmp if a_len == 0
    mov    esi,[ebp+8]		; esi = a
    cld
L_1:
    lodsd			; eax = [ds:esi]; esi += 4
    mov    edx,[ebp+16]		; edx = b
    mul    edx			; edx:eax = Phi:Plo = a_i * b

    add    eax,ebx		; add carry (ebx) to edx:eax
    adc    edx,0
    mov    ebx,edx		; high half of product becomes next carry

    stosd			; [es:edi] = ax; edi += 4;
    dec    ecx			; --a_len
    jnz    L_1			; jmp if a_len != 0
L_2:
    mov    [edi],ebx		; *c = carry
    pop    ebx
    pop    esi
    pop    edi
    leave  
    ret    
    nop
_s_mpv_mul_d ENDP

;   ebp - 36:	caller's esi
;   ebp - 32:	caller's edi
;   ebp - 28:	
;   ebp - 24:	
;   ebp - 20:	
;   ebp - 16:	
;   ebp - 12:	
;   ebp - 8:	
;   ebp - 4:	
;   ebp + 0:	caller's ebp
;   ebp + 4:	return address
;   ebp + 8:	a	argument
;   ebp + 12:	a_len	argument
;   ebp + 16:	b	argument
;   ebp + 20:	c	argument
;   registers:
;  	eax:
; 	ebx:	carry
; 	ecx:	a_len
; 	edx:
; 	esi:	a ptr
; 	edi:	c ptr
public	_s_mpv_mul_d_add
_s_mpv_mul_d_add PROC NEAR
    push   ebp
    mov    ebp,esp
    sub    esp,28
    push   edi
    push   esi
    push   ebx
    mov    ebx,0		; carry = 0
    mov    ecx,[ebp+12]		; ecx = a_len
    mov    edi,[ebp+20]
    cmp    ecx,0
    je     L_4			; jmp if a_len == 0
    mov    esi,[ebp+8]		; esi = a
    cld
L_3:
    lodsd			; eax = [ds:esi]; esi += 4
    mov    edx,[ebp+16]		; edx = b
    mul    edx			; edx:eax = Phi:Plo = a_i * b

    add    eax,ebx		; add carry (ebx) to edx:eax
    adc    edx,0
    mov    ebx,[edi]		; add in current word from *c
    add    eax,ebx		
    adc    edx,0
    mov    ebx,edx		; high half of product becomes next carry

    stosd			; [es:edi] = ax; edi += 4;
    dec    ecx			; --a_len
    jnz    L_3			; jmp if a_len != 0
L_4:
    mov    [edi],ebx		; *c = carry
    pop    ebx
    pop    esi
    pop    edi
    leave  
    ret    
    nop
_s_mpv_mul_d_add ENDP

;   ebp - 36:	caller's esi
;   ebp - 32:	caller's edi
;   ebp - 28:	
;   ebp - 24:	
;   ebp - 20:	
;   ebp - 16:	
;   ebp - 12:	
;   ebp - 8:	
;   ebp - 4:	
;   ebp + 0:	caller's ebp
;   ebp + 4:	return address
;   ebp + 8:	a	argument
;   ebp + 12:	a_len	argument
;   ebp + 16:	b	argument
;   ebp + 20:	c	argument
;   registers:
;  	eax:
; 	ebx:	carry
; 	ecx:	a_len
; 	edx:
; 	esi:	a ptr
; 	edi:	c ptr
public	_s_mpv_mul_d_add_prop
_s_mpv_mul_d_add_prop PROC NEAR
    push   ebp
    mov    ebp,esp
    sub    esp,28
    push   edi
    push   esi
    push   ebx
    mov    ebx,0		; carry = 0
    mov    ecx,[ebp+12]		; ecx = a_len
    mov    edi,[ebp+20]
    cmp    ecx,0
    je     L_6			; jmp if a_len == 0
    cld
    mov    esi,[ebp+8]		; esi = a
L_5:
    lodsd			; eax = [ds:esi]; esi += 4
    mov    edx,[ebp+16]		; edx = b
    mul    edx			; edx:eax = Phi:Plo = a_i * b

    add    eax,ebx		; add carry (ebx) to edx:eax
    adc    edx,0
    mov    ebx,[edi]		; add in current word from *c
    add    eax,ebx		
    adc    edx,0
    mov    ebx,edx		; high half of product becomes next carry

    stosd			; [es:edi] = ax; edi += 4;
    dec    ecx			; --a_len
    jnz    L_5			; jmp if a_len != 0
L_6:
    cmp    ebx,0		; is carry zero?
    jz     L_8
    mov    eax,[edi]		; add in current word from *c
    add    eax,ebx
    stosd			; [es:edi] = ax; edi += 4;
    jnc    L_8
L_7:
    mov    eax,[edi]		; add in current word from *c
    adc    eax,0
    stosd			; [es:edi] = ax; edi += 4;
    jc     L_7
L_8:
    pop    ebx
    pop    esi
    pop    edi
    leave  
    ret    
    nop
_s_mpv_mul_d_add_prop ENDP

;   ebp - 20:	caller's esi
;   ebp - 16:	caller's edi
;   ebp - 12:	
;   ebp - 8:	carry
;   ebp - 4:	a_len	local
;   ebp + 0:	caller's ebp
;   ebp + 4:	return address
;   ebp + 8:	pa	argument
;   ebp + 12:	a_len	argument
;   ebp + 16:	ps	argument
;   ebp + 20:	
;   registers:
;  	eax:
; 	ebx:	carry
; 	ecx:	a_len
; 	edx:
; 	esi:	a ptr
; 	edi:	c ptr

public	_s_mpv_sqr_add_prop
_s_mpv_sqr_add_prop PROC NEAR
     push   ebp
     mov    ebp,esp
     sub    esp,12
     push   edi
     push   esi
     push   ebx
     mov    ebx,0		; carry = 0
     mov    ecx,[ebp+12]	; a_len
     mov    edi,[ebp+16]	; edi = ps
     cmp    ecx,0
     je     L_11		; jump if a_len == 0
     cld
     mov    esi,[ebp+8]		; esi = pa
L_10:
     lodsd			; eax = [ds:si]; si += 4;
     mul    eax

     add    eax,ebx		; add "carry"
     adc    edx,0
     mov    ebx,[edi]
     add    eax,ebx		; add low word from result
     mov    ebx,[edi+4]
     stosd			; [es:di] = eax; di += 4;
     adc    edx,ebx		; add high word from result
     mov    ebx,0
     mov    eax,edx
     adc    ebx,0
     stosd			; [es:di] = eax; di += 4;
     dec    ecx			; --a_len
     jnz    L_10		; jmp if a_len != 0
L_11:
    cmp    ebx,0		; is carry zero?
    jz     L_14
    mov    eax,[edi]		; add in current word from *c
    add    eax,ebx
    stosd			; [es:edi] = ax; edi += 4;
    jnc    L_14
L_12:
    mov    eax,[edi]		; add in current word from *c
    adc    eax,0
    stosd			; [es:edi] = ax; edi += 4;
    jc     L_12
L_14:
    pop    ebx
    pop    esi
    pop    edi
    leave  
    ret    
    nop
_s_mpv_sqr_add_prop ENDP

; 
;  Divide 64-bit (Nhi,Nlo) by 32-bit divisor, which must be normalized
;  so its high bit is 1.   This code is from NSPR.
; 
;  mp_err s_mpv_div_2dx1d(mp_digit Nhi, mp_digit Nlo, mp_digit divisor,
;  		          mp_digit *qp, mp_digit *rp)

;  Dump of assembler code for function s_mpv_div_2dx1d:
;  
;   esp +  0:   Caller's ebx
;   esp +  4:	return address
;   esp +  8:	Nhi	argument
;   esp + 12:	Nlo	argument
;   esp + 16:	divisor	argument
;   esp + 20:	qp	argument
;   esp + 24:   rp	argument
;   registers:
;  	eax:
; 	ebx:	carry
; 	ecx:	a_len
; 	edx:
; 	esi:	a ptr
; 	edi:	c ptr
;  
public	_s_mpv_div_2dx1d
_s_mpv_div_2dx1d PROC NEAR
       push   ebx
       mov    edx,[esp+8]
       mov    eax,[esp+12]
       mov    ebx,[esp+16]
       div    ebx
       mov    ebx,[esp+20]
       mov    [ebx],eax
       mov    ebx,[esp+24]
       mov    [ebx],edx
       xor    eax,eax		; return zero
       pop    ebx
       ret    
       nop
_s_mpv_div_2dx1d ENDP

_TEXT	ENDS
END