1 files changed, 64 insertions, 0 deletions
diff --git a/libj2_ju_lrot_to_j2u.c b/libj2_ju_lrot_to_j2u.c
new file mode 100644
index 0000000..25df836
--- /dev/null
+++ b/libj2_ju_lrot_to_j2u.c
@@ -0,0 +1,64 @@
+/* See LICENSE file for copyright and license details. */
+#include "common.h"
+#ifndef TEST
+
+extern inline void libj2_ju_lrot_to_j2u(uintmax_t a, unsigned b, struct libj2_j2u *res);
+/* TODO Add man page */
+
+
+#else
+
+static void
+set(struct libj2_j2u *a, const char *pattern, unsigned shift)
+{
+	unsigned i, j = (LIBJ2_J2U_BIT - (shift % LIBJ2_J2U_BIT)) % LIBJ2_J2U_BIT;
+
+	a->high = 0;
+	a->low = 0;
+
+	for (i = 0; i < LIBJ2_JU_BIT; i++, j++)
+		if (pattern[j % LIBJ2_J2U_BIT] == '1')
+			a->low |= (uintmax_t)1 << i;
+
+	for (i = 0; i < LIBJ2_JU_BIT; i++, j++)
+		if (pattern[j % LIBJ2_J2U_BIT] == '1')
+			a->high |= (uintmax_t)1 << i;
+
+}
+
+
+int
+main(void)
+{
+	struct libj2_j2u a, r, expected;
+	char pattern[LIBJ2_J2U_BIT + 1U];
+	unsigned i, j, k;
+
+	srand((unsigned)time(NULL));
+
+	for (i = 0; i < 128U; i++) {
+		for (j = 0; j < LIBJ2_JU_BIT; j++)
+			pattern[j] = '0' + (rand() < rand());
+		memset(&pattern[LIBJ2_JU_BIT], '0', LIBJ2_JU_BIT);
+		pattern[LIBJ2_J2U_BIT] = '\0';
+		set(&a, pattern, 0);
+		EXPECT(a.high == 0);
+		for (j = 0; j <= 2U * LIBJ2_J2U_BIT; j++) {
+			set(&expected, pattern, j);
+
+			r = (struct libj2_j2u){111, 222};
+			libj2_ju_lrot_to_j2u(a.low, j, &r);
+			EXPECT(libj2_j2u_eq_j2u(&r, &expected));
+
+			k = 2U * LIBJ2_J2U_BIT - j;
+
+			r = (struct libj2_j2u){111, 222};
+			libj2_ju_rrot_to_j2u(a.low, k, &r);
+			EXPECT(libj2_j2u_eq_j2u(&r, &expected));
+		}
+	}
+
+	return 0;
+}
+
+#endif