Lines Matching defs:sr
34 unsigned sr;
102 sr = __builtin_clz(d.s.high) - __builtin_clz(n.s.high);
103 /* 0 <= sr <= n_uword_bits - 2 or sr large */
104 if (sr > n_uword_bits - 2)
110 ++sr;
111 /* 1 <= sr <= n_uword_bits - 1 */
112 /* q.all = n.all << (n_udword_bits - sr); */
114 q.s.high = n.s.low << (n_uword_bits - sr);
115 /* r.all = n.all >> sr; */
116 r.s.high = n.s.high >> sr;
117 r.s.low = (n.s.high << (n_uword_bits - sr)) | (n.s.low >> sr);
133 sr = __builtin_ctz(d.s.low);
134 q.s.high = n.s.high >> sr;
135 q.s.low = (n.s.high << (n_uword_bits - sr)) | (n.s.low >> sr);
142 sr = 1 + n_uword_bits + __builtin_clz(d.s.low) - __builtin_clz(n.s.high);
143 /* 2 <= sr <= n_udword_bits - 1
144 * q.all = n.all << (n_udword_bits - sr);
145 * r.all = n.all >> sr;
146 * if (sr == n_uword_bits)
153 * else if (sr < n_uword_bits) // 2 <= sr <= n_uword_bits - 1
156 * q.s.high = n.s.low << (n_uword_bits - sr);
157 * r.s.high = n.s.high >> sr;
158 * r.s.low = (n.s.high << (n_uword_bits - sr)) | (n.s.low >> sr);
160 * else // n_uword_bits + 1 <= sr <= n_udword_bits - 1
162 * q.s.low = n.s.low << (n_udword_bits - sr);
163 * q.s.high = (n.s.high << (n_udword_bits - sr)) |
164 * (n.s.low >> (sr - n_uword_bits));
166 * r.s.low = n.s.high >> (sr - n_uword_bits);
169 q.s.low = (n.s.low << (n_udword_bits - sr)) &
170 ((si_int)(n_uword_bits - sr) >> (n_uword_bits-1));
171 q.s.high = ((n.s.low << ( n_uword_bits - sr)) &
172 ((si_int)(sr - n_uword_bits - 1) >> (n_uword_bits-1))) |
173 (((n.s.high << (n_udword_bits - sr)) |
174 (n.s.low >> (sr - n_uword_bits))) &
175 ((si_int)(n_uword_bits - sr) >> (n_uword_bits-1)));
176 r.s.high = (n.s.high >> sr) &
177 ((si_int)(sr - n_uword_bits) >> (n_uword_bits-1));
178 r.s.low = ((n.s.high >> (sr - n_uword_bits)) &
179 ((si_int)(n_uword_bits - sr - 1) >> (n_uword_bits-1))) |
180 (((n.s.high << (n_uword_bits - sr)) |
181 (n.s.low >> sr)) &
182 ((si_int)(sr - n_uword_bits) >> (n_uword_bits-1)));
190 sr = __builtin_clz(d.s.high) - __builtin_clz(n.s.high);
191 /* 0 <= sr <= n_uword_bits - 1 or sr large */
192 if (sr > n_uword_bits - 1)
198 ++sr;
199 /* 1 <= sr <= n_uword_bits */
200 /* q.all = n.all << (n_udword_bits - sr); */
202 q.s.high = n.s.low << (n_uword_bits - sr);
203 /* r.all = n.all >> sr;
204 * if (sr < n_uword_bits)
206 * r.s.high = n.s.high >> sr;
207 * r.s.low = (n.s.high << (n_uword_bits - sr)) | (n.s.low >> sr);
215 r.s.high = (n.s.high >> sr) &
216 ((si_int)(sr - n_uword_bits) >> (n_uword_bits-1));
217 r.s.low = (n.s.high << (n_uword_bits - sr)) |
218 ((n.s.low >> sr) &
219 ((si_int)(sr - n_uword_bits) >> (n_uword_bits-1)));
224 * q.all = n.all << (n_udword_bits - sr);
225 * r.all = n.all >> sr;
226 * 1 <= sr <= n_udword_bits - 1
229 for (; sr > 0; --sr)
