Lines Matching +full:1 +full:v
18 * define(TOPBITS, eval( WORDSIZE - N*((WORDSIZE-1)/N) ) )
25 * V -- the current comparand -- initially divisor*2ˆ(ITER*N-1)
40 define(V, `%o5') macro
47 * $1 -- the current depth, 1<=$1<=N
54 * V -- current comparand
57 * R', Q', V', cc'
63 ` !depth $1, accumulated bits $2
64 bl L.$1.eval(TWOSUPN+$2)
65 srl V,1,V
67 subcc R,V,R
68 ifelse( $1, N,
70 add Q, ($2*2+1), Q
71 ',` DEVELOP_QUOTIENT_BITS( incr($1), `eval(2*$2+1)')
73 L.$1.eval(TWOSUPN+$2):
75 addcc R,V,R
76 ifelse( $1, N,
78 add Q, ($2*2-1), Q
79 ',` DEVELOP_QUOTIENT_BITS( incr($1), `eval(2*$2-1)')
81 ifelse( $1, 1, `9:')
131 orcc divisor,%g0,V ! movcc divisor,V
135 sethi %hi(1<<(WORDSIZE-TOPBITS-1)),T
144 ! Compute ITER in an unorthodox manner: know we need to Shift V into
146 1:
147 cmp V,T
149 mov 1,SC
150 sll V,N,V
151 b 1b
154 2: addcc V,V,V
156 add SC,1,SC
159 ! Restore V and subtract from R.
161 srl V,1,V ! rest of V
162 add V,T,V
166 3: cmp V,R
171 ! V > R: went too far: back up 1 step
172 ! srl V,1,V
176 ! We have to be careful here. We know that R >= V, so we can do the
178 ! and are only done if R >= 0. Because both R and V may have the high-
186 sub R,V,R
187 mov 1,Q
191 sll Q,1,Q
192 bl 1f
193 srl V,1,V
195 sub R,V,R
198 1: ! R < 0
199 add R,V,R
210 1:
211 sll V,N,V
212 cmp V,R
213 bleu 1b
223 DEVELOP_QUOTIENT_BITS( 1, 0 )
237 bl,a 1f
243 1: