Move c_src dirs back to toplevel

[bcachefs-tools-debian] / c_src / raid / memory.c

diff --git a/c_src/raid/memory.c b/c_src/raid/memory.c
deleted file mode 100644 (file)
index 02a5a92..0000000
--- a/c_src/raid/memory.c
+++ /dev/null
@@ -1,154 +0,0 @@
-/*
- * Copyright (C) 2013 Andrea Mazzoleni
- *
- * 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 2 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.
- */
-
-#include "internal.h"
-#include "memory.h"
-
-void *raid_malloc_align(size_t size, size_t align_size, void **freeptr)
-{
-       unsigned char *ptr;
-       uintptr_t offset;
-
-       ptr = malloc(size + align_size);
-       if (!ptr) {
-               /* LCOV_EXCL_START */
-               return 0;
-               /* LCOV_EXCL_STOP */
-       }
-
-       *freeptr = ptr;
-
-       offset = ((uintptr_t)ptr) % align_size;
-
-       if (offset != 0)
-               ptr += align_size - offset;
-
-       return ptr;
-}
-
-void *raid_malloc(size_t size, void **freeptr)
-{
-    return raid_malloc_align(size, RAID_MALLOC_ALIGN, freeptr);
-}
-
-void **raid_malloc_vector_align(int nd, int n, size_t size, size_t align_size, size_t displacement_size, void **freeptr)
-{
-       void **v;
-       unsigned char *va;
-       int i;
-
-       BUG_ON(n <= 0 || nd < 0);
-
-       v = malloc(n * sizeof(void *));
-       if (!v) {
-               /* LCOV_EXCL_START */
-               return 0;
-               /* LCOV_EXCL_STOP */
-       }
-
-       va = raid_malloc_align(n * (size + displacement_size), align_size, freeptr);
-       if (!va) {
-               /* LCOV_EXCL_START */
-               free(v);
-               return 0;
-               /* LCOV_EXCL_STOP */
-       }
-
-       for (i = 0; i < n; ++i) {
-               v[i] = va;
-               va += size + displacement_size;
-       }
-
-       /* reverse order of the data blocks */
-       /* because they are usually accessed from the last one */
-       for (i = 0; i < nd / 2; ++i) {
-               void *ptr = v[i];
-
-               v[i] = v[nd - 1 - i];
-               v[nd - 1 - i] = ptr;
-       }
-
-       return v;
-}
-
-void **raid_malloc_vector(int nd, int n, size_t size, void **freeptr)
-{
-    return raid_malloc_vector_align(nd, n, size, RAID_MALLOC_ALIGN, RAID_MALLOC_DISPLACEMENT, freeptr);
-}
-
-void raid_mrand_vector(unsigned seed, int n, size_t size, void **vv)
-{
-       unsigned char **v = (unsigned char **)vv;
-       int i;
-       size_t j;
-
-       for (i = 0; i < n; ++i)
-               for (j = 0; j < size; ++j) {
-                       /* basic C99/C11 linear congruential generator */
-                       seed = seed * 1103515245U + 12345U;
-
-                       v[i][j] = seed >> 16;
-               }
-}
-
-int raid_mtest_vector(int n, size_t size, void **vv)
-{
-       unsigned char **v = (unsigned char **)vv;
-       int i;
-       size_t j;
-       unsigned k;
-       unsigned char d;
-       unsigned char p;
-
-       /* fill with 0 */
-       d = 0;
-       for (i = 0; i < n; ++i)
-               for (j = 0; j < size; ++j)
-                       v[i][j] = d;
-
-       /* test with all the byte patterns */
-       for (k = 1; k < 256; ++k) {
-               p = d;
-               d = k;
-
-               /* forward fill */
-               for (i = 0; i < n; ++i) {
-                       for (j = 0; j < size; ++j) {
-                               if (v[i][j] != p) {
-                                       /* LCOV_EXCL_START */
-                                       return -1;
-                                       /* LCOV_EXCL_STOP */
-                               }
-                               v[i][j] = d;
-                       }
-               }
-
-               p = d;
-               d = ~p;
-               /* backward fill with complement */
-               for (i = 0; i < n; ++i) {
-                       for (j = size; j > 0; --j) {
-                               if (v[i][j - 1] != p) {
-                                       /* LCOV_EXCL_START */
-                                       return -1;
-                                       /* LCOV_EXCL_STOP */
-                               }
-                               v[i][j - 1] = d;
-                       }
-               }
-       }
-
-       return 0;
-}
-