1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
|
//! parity - if number of bits set is even => 0, else => 1
//! - pariytXi2_generic for big and little endian
const std = @import("std");
const builtin = @import("builtin");
const common = @import("common.zig");
pub const panic = common.panic;
comptime {
@export(&__paritysi2, .{ .name = "__paritysi2", .linkage = common.linkage, .visibility = common.visibility });
@export(&__paritydi2, .{ .name = "__paritydi2", .linkage = common.linkage, .visibility = common.visibility });
@export(&__parityti2, .{ .name = "__parityti2", .linkage = common.linkage, .visibility = common.visibility });
}
pub fn __paritysi2(a: i32) callconv(.c) i32 {
return parityXi2(i32, a);
}
pub fn __paritydi2(a: i64) callconv(.c) i32 {
return parityXi2(i64, a);
}
pub fn __parityti2(a: i128) callconv(.c) i32 {
return parityXi2(i128, a);
}
inline fn parityXi2(comptime T: type, a: T) i32 {
var x: std.meta.Int(.unsigned, @typeInfo(T).int.bits) = @bitCast(a);
// Bit Twiddling Hacks: Compute parity in parallel
comptime var shift: u8 = @bitSizeOf(T) / 2;
inline while (shift > 2) {
x ^= x >> shift;
shift = shift >> 1;
}
x &= 0xf;
return (@as(u16, 0x6996) >> @intCast(x)) & 1; // optimization for >>2 and >>1
}
test {
_ = @import("paritysi2_test.zig");
_ = @import("paritydi2_test.zig");
_ = @import("parityti2_test.zig");
}
|
