-
Notifications
You must be signed in to change notification settings - Fork 211
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge pull request #645 from tea/ctz
Implement __ctz*i2 intrinsics
- Loading branch information
Showing
5 changed files
with
111 additions
and
6 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,64 @@ | ||
use crate::int::{CastInto, Int}; | ||
|
||
public_test_dep! { | ||
/// Returns number of trailing binary zeros in `x`. | ||
#[allow(dead_code)] | ||
pub(crate) fn trailing_zeros<T: Int + CastInto<u32> + CastInto<u16> + CastInto<u8>>(x: T) -> usize { | ||
let mut x = x; | ||
let mut r: u32 = 0; | ||
let mut t: u32; | ||
|
||
const { assert!(T::BITS <= 64) }; | ||
if T::BITS >= 64 { | ||
r += ((CastInto::<u32>::cast(x) == 0) as u32) << 5; // if (x has no 32 small bits) t = 32 else 0 | ||
x >>= r; // remove 32 zero bits | ||
} | ||
|
||
if T::BITS >= 32 { | ||
t = ((CastInto::<u16>::cast(x) == 0) as u32) << 4; // if (x has no 16 small bits) t = 16 else 0 | ||
r += t; | ||
x >>= t; // x = [0 - 0xFFFF] + higher garbage bits | ||
} | ||
|
||
const { assert!(T::BITS >= 16) }; | ||
t = ((CastInto::<u8>::cast(x) == 0) as u32) << 3; | ||
x >>= t; // x = [0 - 0xFF] + higher garbage bits | ||
r += t; | ||
|
||
let mut x: u8 = x.cast(); | ||
|
||
t = (((x & 0x0F) == 0) as u32) << 2; | ||
x >>= t; // x = [0 - 0xF] + higher garbage bits | ||
r += t; | ||
|
||
t = (((x & 0x3) == 0) as u32) << 1; | ||
x >>= t; // x = [0 - 0x3] + higher garbage bits | ||
r += t; | ||
|
||
x &= 3; | ||
|
||
r as usize + ((2 - (x >> 1) as usize) & (((x & 1) == 0) as usize).wrapping_neg()) | ||
} | ||
} | ||
|
||
intrinsics! { | ||
/// Returns the number of trailing binary zeros in `x` (32 bit version). | ||
pub extern "C" fn __ctzsi2(x: u32) -> usize { | ||
trailing_zeros(x) | ||
} | ||
|
||
/// Returns the number of trailing binary zeros in `x` (64 bit version). | ||
pub extern "C" fn __ctzdi2(x: u64) -> usize { | ||
trailing_zeros(x) | ||
} | ||
|
||
/// Returns the number of trailing binary zeros in `x` (128 bit version). | ||
pub extern "C" fn __ctzti2(x: u128) -> usize { | ||
let lo = x as u64; | ||
if lo == 0 { | ||
64 + __ctzdi2((x >> 64) as u64) | ||
} else { | ||
__ctzdi2(lo) | ||
} | ||
} | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters