Cross Reference: /frameworks/compile/libbcc/runtime/lib/udivmodti4.c

Lines Matching defs:sr
36     unsigned sr;
104         sr = __builtin_clzll(d.s.high) - __builtin_clzll(n.s.high);
105         /* 0 <= sr <= n_udword_bits - 2 or sr large */
106         if (sr > n_udword_bits - 2)
112         ++sr;
113         /* 1 <= sr <= n_udword_bits - 1 */
114         /* q.all = n.all << (n_utword_bits - sr); */
116         q.s.high = n.s.low << (n_udword_bits - sr);
117         /* r.all = n.all >> sr; */
118         r.s.high = n.s.high >> sr;
119         r.s.low = (n.s.high << (n_udword_bits - sr)) | (n.s.low >> sr);
135                 unsigned sr = __builtin_ctzll(d.s.low);
136                 q.s.high = n.s.high >> sr;
137                 q.s.low = (n.s.high << (n_udword_bits - sr)) | (n.s.low >> sr);
144             sr = 1 + n_udword_bits + __builtin_clzll(d.s.low)
146             /* 2 <= sr <= n_utword_bits - 1
147              * q.all = n.all << (n_utword_bits - sr);
148              * r.all = n.all >> sr;
149              * if (sr == n_udword_bits)
156              * else if (sr < n_udword_bits)  // 2 <= sr <= n_udword_bits - 1
159              *     q.s.high = n.s.low << (n_udword_bits - sr);
160              *     r.s.high = n.s.high >> sr;
161              *     r.s.low = (n.s.high << (n_udword_bits - sr)) | (n.s.low >> sr);
163              * else              // n_udword_bits + 1 <= sr <= n_utword_bits - 1
165              *     q.s.low = n.s.low << (n_utword_bits - sr);
166              *     q.s.high = (n.s.high << (n_utword_bits - sr)) |
167              *              (n.s.low >> (sr - n_udword_bits));
169              *     r.s.low = n.s.high >> (sr - n_udword_bits);
172             q.s.low =  (n.s.low << (n_utword_bits - sr)) &
173                      ((di_int)(int)(n_udword_bits - sr) >> (n_udword_bits-1));
174             q.s.high = ((n.s.low << ( n_udword_bits - sr))                        &
175                      ((di_int)(int)(sr - n_udword_bits - 1) >> (n_udword_bits-1))) |
176                      (((n.s.high << (n_utword_bits - sr))                       |
177                      (n.s.low >> (sr - n_udword_bits)))                         &
178                      ((di_int)(int)(n_udword_bits - sr) >> (n_udword_bits-1)));
179             r.s.high = (n.s.high >> sr) &
180                      ((di_int)(int)(sr - n_udword_bits) >> (n_udword_bits-1));
181             r.s.low =  ((n.s.high >> (sr - n_udword_bits))                        &
182                      ((di_int)(int)(n_udword_bits - sr - 1) >> (n_udword_bits-1))) |
183                      (((n.s.high << (n_udword_bits - sr))                       |
184                      (n.s.low >> sr))                                           &
185                      ((di_int)(int)(sr - n_udword_bits) >> (n_udword_bits-1)));
193             sr = __builtin_clzll(d.s.high) - __builtin_clzll(n.s.high);
194             /*0 <= sr <= n_udword_bits - 1 or sr large */
195             if (sr > n_udword_bits - 1)
201             ++sr;
202             /* 1 <= sr <= n_udword_bits */
203             /* q.all = n.all << (n_utword_bits - sr); */
205             q.s.high = n.s.low << (n_udword_bits - sr);
206             /* r.all = n.all >> sr;
207              * if (sr < n_udword_bits)
209              *     r.s.high = n.s.high >> sr;
210              *     r.s.low = (n.s.high << (n_udword_bits - sr)) | (n.s.low >> sr);
218             r.s.high = (n.s.high >> sr) &
219                      ((di_int)(int)(sr - n_udword_bits) >> (n_udword_bits-1));
220             r.s.low = (n.s.high << (n_udword_bits - sr)) |
221                     ((n.s.low >> sr)                   &
222                     ((di_int)(int)(sr - n_udword_bits) >> (n_udword_bits-1)));
227      * q.all = n.all << (n_utword_bits - sr);
228      * r.all = n.all >> sr;
229      * 1 <= sr <= n_utword_bits - 1
232     for (; sr > 0; --sr)