h48

A prototype for an optimal Rubik's cube solver, work in progress.
git clone https://git.tronto.net/h48
Download | Log | Files | Refs | README | LICENSE

commit 394c32ed8db5ef520117d19da573db9576e0c31e
parent c5a6ff0443fc9e5e890fe72cb13ea78d4fe2bbcb
Author: Sebastiano Tronto <sebastiano@tronto.net>
Date:   Wed,  2 Apr 2025 19:51:52 +0000

Fix compilation errors with GCC on ARM

Diffstat:
Msrc/arch/neon.h | 4++--
1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/src/arch/neon.h b/src/arch/neon.h @@ -69,7 +69,7 @@ equal(cube_t c1, cube_t c2) // convert the comparison vectors to 64-bit vectors and combine them cmp_corner_u64 = vreinterpretq_u64_u8( - vcombine_u64(cmp_corner, cmp_corner)); + vcombine_u8(cmp_corner, cmp_corner)); cmp_edge_u64 = vreinterpretq_u64_u8(cmp_edge); cmp_result = vandq_u64(cmp_corner_u64, cmp_edge_u64); @@ -130,7 +130,7 @@ compose_edges_slim(uint8x16_t edge1, uint8x16_t edge2) uint8x16_t ret = vorrq_u8(vandq_u8(piece1, p_bits), orien); // Mask to clear the last 32 bits of the result - uint8x16_t mask_last_32 = + uint32x4_t mask_last_32 = vsetq_lane_u32(0, vreinterpretq_u32_u8(ret), 3); ret = vreinterpretq_u8_u32(mask_last_32);