udiv.rs 8.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320
  1. use core::{intrinsics, mem};
  2. use int::{Int, LargeInt};
  3. /// Returns `n / d`
  4. #[cfg(not(all(feature = "c", target_arch = "arm", not(target_os = "ios"), not(thumbv6m))))]
  5. #[cfg_attr(not(test), no_mangle)]
  6. pub extern "C" fn __udivsi3(n: u32, d: u32) -> u32 {
  7. // Special cases
  8. if d == 0 {
  9. // NOTE This should be unreachable in safe Rust because the program will panic before
  10. // this intrinsic is called
  11. unsafe {
  12. intrinsics::abort()
  13. }
  14. }
  15. if n == 0 {
  16. return 0;
  17. }
  18. let mut sr = d.leading_zeros().wrapping_sub(n.leading_zeros());
  19. // d > n
  20. if sr > u32::bits() - 1 {
  21. return 0;
  22. }
  23. // d == 1
  24. if sr == u32::bits() - 1 {
  25. return n;
  26. }
  27. sr += 1;
  28. // 1 <= sr <= u32::bits() - 1
  29. let mut q = n << (u32::bits() - sr);
  30. let mut r = n >> sr;
  31. let mut carry = 0;
  32. for _ in 0..sr {
  33. // r:q = ((r:q) << 1) | carry
  34. r = (r << 1) | (q >> (u32::bits() - 1));
  35. q = (q << 1) | carry;
  36. // carry = 0;
  37. // if r > d {
  38. // r -= d;
  39. // carry = 1;
  40. // }
  41. let s = (d.wrapping_sub(r).wrapping_sub(1)) as i32 >> (u32::bits() - 1);
  42. carry = (s & 1) as u32;
  43. r -= d & s as u32;
  44. }
  45. (q << 1) | carry
  46. }
  47. /// Returns `n % d`
  48. #[cfg(not(all(feature = "c", target_arch = "arm", not(target_os = "ios"))))]
  49. #[cfg_attr(not(test), no_mangle)]
  50. pub extern "C" fn __umodsi3(n: u32, d: u32) -> u32 {
  51. #[cfg(all(feature = "c", target_arch = "arm", not(target_os = "ios")))]
  52. extern "C" {
  53. fn __udivsi3(n: u32, d: u32) -> u32;
  54. }
  55. n - unsafe { __udivsi3(n, d) * d }
  56. }
  57. /// Returns `n / d` and sets `*rem = n % d`
  58. #[cfg(not(all(feature = "c", target_arch = "arm", not(target_os = "ios"), not(thumbv6m))))]
  59. #[cfg_attr(not(test), no_mangle)]
  60. pub extern "C" fn __udivmodsi4(n: u32, d: u32, rem: Option<&mut u32>) -> u32 {
  61. #[cfg(all(feature = "c", target_arch = "arm", not(target_os = "ios")))]
  62. extern "C" {
  63. fn __udivsi3(n: u32, d: u32) -> u32;
  64. }
  65. let q = unsafe { __udivsi3(n, d) };
  66. if let Some(rem) = rem {
  67. *rem = n - (q * d);
  68. }
  69. q
  70. }
  71. /// Returns `n / d`
  72. #[cfg_attr(not(test), no_mangle)]
  73. #[cfg(not(all(feature = "c", target_arch = "x86")))]
  74. pub extern "C" fn __udivdi3(n: u64, d: u64) -> u64 {
  75. __udivmoddi4(n, d, None)
  76. }
  77. /// Returns `n % d`
  78. #[cfg(not(all(feature = "c", target_arch = "x86")))]
  79. #[cfg_attr(not(test), no_mangle)]
  80. pub extern "C" fn __umoddi3(a: u64, b: u64) -> u64 {
  81. let mut rem = unsafe { mem::uninitialized() };
  82. __udivmoddi4(a, b, Some(&mut rem));
  83. rem
  84. }
  85. /// Returns `n / d` and sets `*rem = n % d`
  86. #[cfg_attr(not(test), no_mangle)]
  87. pub extern "C" fn __udivmoddi4(n: u64, d: u64, rem: Option<&mut u64>) -> u64 {
  88. // NOTE X is unknown, K != 0
  89. if n.high() == 0 {
  90. if d.high() == 0 {
  91. // 0 X
  92. // ---
  93. // 0 X
  94. if let Some(rem) = rem {
  95. *rem = u64::from(urem!(n.low(), d.low()));
  96. }
  97. return u64::from(udiv!(n.low(), d.low()));
  98. } else {
  99. // 0 X
  100. // ---
  101. // K X
  102. if let Some(rem) = rem {
  103. *rem = n;
  104. }
  105. return 0;
  106. };
  107. }
  108. let mut sr;
  109. let mut q;
  110. let mut r;
  111. if d.low() == 0 {
  112. if d.high() == 0 {
  113. // K X
  114. // ---
  115. // 0 0
  116. // NOTE This should be unreachable in safe Rust because the program will panic before
  117. // this intrinsic is called
  118. unsafe {
  119. intrinsics::abort()
  120. }
  121. }
  122. if n.low() == 0 {
  123. // K 0
  124. // ---
  125. // K 0
  126. if let Some(rem) = rem {
  127. *rem = u64::from_parts(0, urem!(n.high(), d.high()));
  128. }
  129. return u64::from(udiv!(n.high(), d.high()));
  130. }
  131. // K K
  132. // ---
  133. // K 0
  134. if d.high().is_power_of_two() {
  135. if let Some(rem) = rem {
  136. *rem = u64::from_parts(n.low(), n.high() & (d.high() - 1));
  137. }
  138. return u64::from(n.high() >> d.high().trailing_zeros());
  139. }
  140. sr = d.high().leading_zeros().wrapping_sub(n.high().leading_zeros());
  141. // D > N
  142. if sr > u32::bits() - 2 {
  143. if let Some(rem) = rem {
  144. *rem = n;
  145. }
  146. return 0;
  147. }
  148. sr += 1;
  149. // 1 <= sr <= u32::bits() - 1
  150. q = n << (u64::bits() - sr);
  151. r = n >> sr;
  152. } else {
  153. if d.high() == 0 {
  154. // K X
  155. // ---
  156. // 0 K
  157. if d.low().is_power_of_two() {
  158. if let Some(rem) = rem {
  159. *rem = u64::from(n.low() & (d.low() - 1));
  160. }
  161. if d.low() == 1 {
  162. return n;
  163. } else {
  164. let sr = d.low().trailing_zeros();
  165. return n >> sr;
  166. };
  167. }
  168. sr = 1 + u32::bits() + d.low().leading_zeros() - n.high().leading_zeros();
  169. // 2 <= sr <= u64::bits() - 1
  170. q = n << (u64::bits() - sr);
  171. r = n >> sr;
  172. } else {
  173. // K X
  174. // ---
  175. // K K
  176. sr = d.high().leading_zeros().wrapping_sub(n.high().leading_zeros());
  177. // D > N
  178. if sr > u32::bits() - 1 {
  179. if let Some(rem) = rem {
  180. *rem = n;
  181. }
  182. return 0;
  183. }
  184. sr += 1;
  185. // 1 <= sr <= u32::bits()
  186. q = n << (u64::bits() - sr);
  187. r = n >> sr;
  188. }
  189. }
  190. // Not a special case
  191. // q and r are initialized with
  192. // q = n << (u64::bits() - sr)
  193. // r = n >> sr
  194. // 1 <= sr <= u64::bits() - 1
  195. let mut carry = 0;
  196. for _ in 0..sr {
  197. // r:q = ((r:q) << 1) | carry
  198. r = (r << 1) | (q >> (u64::bits() - 1));
  199. q = (q << 1) | carry as u64;
  200. // carry = 0
  201. // if r >= d {
  202. // r -= d;
  203. // carry = 1;
  204. // }
  205. let s = (d.wrapping_sub(r).wrapping_sub(1)) as i64 >> (u64::bits() - 1);
  206. carry = (s & 1) as u32;
  207. r -= d & s as u64;
  208. }
  209. if let Some(rem) = rem {
  210. *rem = r;
  211. }
  212. (q << 1) | carry as u64
  213. }
  214. #[cfg(test)]
  215. mod tests {
  216. use qc::{U32, U64};
  217. check! {
  218. fn __udivdi3(f: extern fn(u64, u64) -> u64, n: U64, d: U64) -> Option<u64> {
  219. let (n, d) = (n.0, d.0);
  220. if d == 0 {
  221. None
  222. } else {
  223. Some(f(n, d))
  224. }
  225. }
  226. fn __umoddi3(f: extern fn(u64, u64) -> u64, n: U64, d: U64) -> Option<u64> {
  227. let (n, d) = (n.0, d.0);
  228. if d == 0 {
  229. None
  230. } else {
  231. Some(f(n, d))
  232. }
  233. }
  234. fn __udivmoddi4(f: extern fn(u64, u64, Option<&mut u64>) -> u64,
  235. n: U64,
  236. d: U64) -> Option<(u64, u64)> {
  237. let (n, d) = (n.0, d.0);
  238. if d == 0 {
  239. None
  240. } else {
  241. let mut r = 0;
  242. let q = f(n, d, Some(&mut r));
  243. Some((q, r))
  244. }
  245. }
  246. fn __udivsi3(f: extern fn(u32, u32) -> u32, n: U32, d: U32) -> Option<u32> {
  247. let (n, d) = (n.0, d.0);
  248. if d == 0 {
  249. None
  250. } else {
  251. Some(f(n, d))
  252. }
  253. }
  254. fn __umodsi3(f: extern fn(u32, u32) -> u32, n: U32, d: U32) -> Option<u32> {
  255. let (n, d) = (n.0, d.0);
  256. if d == 0 {
  257. None
  258. } else {
  259. Some(f(n, d))
  260. }
  261. }
  262. fn __udivmodsi4(f: extern fn(u32, u32, Option<&mut u32>) -> u32,
  263. n: U32,
  264. d: U32) -> Option<(u32, u32)> {
  265. let (n, d) = (n.0, d.0);
  266. if d == 0 {
  267. None
  268. } else {
  269. let mut r = 0;
  270. let q = f(n, d, Some(&mut r));
  271. Some((q, r))
  272. }
  273. }
  274. }
  275. }