summaryrefslogtreecommitdiff
path: root/gnulib/tests/test-ffsll.c
diff options
context:
space:
mode:
Diffstat (limited to 'gnulib/tests/test-ffsll.c')
m---------gnulib0
-rw-r--r--gnulib/tests/test-ffsll.c68
2 files changed, 68 insertions, 0 deletions
diff --git a/gnulib b/gnulib
deleted file mode 160000
-Subproject 443bc5ffcf7429e557f4a371b0661abe98ddbc1
diff --git a/gnulib/tests/test-ffsll.c b/gnulib/tests/test-ffsll.c
new file mode 100644
index 0000000..37ce88e
--- /dev/null
+++ b/gnulib/tests/test-ffsll.c
@@ -0,0 +1,68 @@
+/*
+ * Copyright (C) 2011 Free Software Foundation, Inc.
+ *
+ * This program is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation; either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program. If not, see <http://www.gnu.org/licenses/>. */
+
+/* Written by Eric Blake. */
+#include <config.h>
+
+#include <string.h>
+
+#include "signature.h"
+SIGNATURE_CHECK (ffsll, int, (long long int));
+
+#include <limits.h>
+
+#include "macros.h"
+
+#define NBITS (sizeof (long long int) * CHAR_BIT)
+
+static int
+naive (long long int i)
+{
+ unsigned long long int j;
+ for (j = 0; j < NBITS; j++)
+ if (i & (1ULL << j))
+ return j + 1;
+ return 0;
+}
+
+int
+main (int argc, char *argv[])
+{
+ long long int x;
+ int i;
+
+ for (x = -128; x <= 128; x++)
+ ASSERT (ffsll (x) == naive (x));
+ for (i = 0; i < NBITS; i++)
+ {
+ ASSERT (ffsll (1ULL << i) == naive (1ULL << i));
+ ASSERT (ffsll (1ULL << i) == i + 1);
+ ASSERT (ffsll (-1ULL << i) == i + 1);
+ }
+ for (i = 0; i < NBITS - 1; i++)
+ {
+ ASSERT (ffsll (3ULL << i) == i + 1);
+ ASSERT (ffsll (-3ULL << i) == i + 1);
+ }
+ for (i = 0; i < NBITS - 2; i++)
+ {
+ ASSERT (ffsll (5ULL << i) == i + 1);
+ ASSERT (ffsll (-5ULL << i) == i + 1);
+ ASSERT (ffsll (7ULL << i) == i + 1);
+ ASSERT (ffsll (-7ULL << i) == i + 1);
+ }
+ return 0;
+}