nodemask: drop nodes_shift

nodes_shift_{left,right} are not used. Drop them.

Signed-off-by: Yury Norov [NVIDIA] <yury.norov@gmail.com>

diff --git a/include/linux/nodemask.h b/include/linux/nodemask.h
index f0ac0633366b9070739f432177c5887d4983414e..0aa6b63aa747dc58655311b5a53a41ad6a26c0d3 100644 (file)
--- a/include/linux/nodemask.h
+++ b/include/linux/nodemask.h
@@ -39,9 +39,6 @@
  * int nodes_full(mask)                        Is mask full (all bits sets)?
  * int nodes_weight(mask)              Hamming weight - number of set bits
  *
- * void nodes_shift_right(dst, src, n) Shift right
- * void nodes_shift_left(dst, src, n)  Shift left
- *
  * unsigned int first_node(mask)       Number lowest set bit, or MAX_NUMNODES
  * unsigend int next_node(node, mask)  Next node past 'node', or MAX_NUMNODES
  * unsigned int next_node_in(node, mask) Next node past 'node', or wrap to first,
@@ -247,22 +244,6 @@ static __always_inline int __nodes_weight(const nodemask_t *srcp, unsigned int n
        return bitmap_weight(srcp->bits, nbits);
 }
 
-#define nodes_shift_right(dst, src, n) \
-                       __nodes_shift_right(&(dst), &(src), (n), MAX_NUMNODES)
-static __always_inline void __nodes_shift_right(nodemask_t *dstp,
-                                       const nodemask_t *srcp, int n, int nbits)
-{
-       bitmap_shift_right(dstp->bits, srcp->bits, n, nbits);
-}
-
-#define nodes_shift_left(dst, src, n) \
-                       __nodes_shift_left(&(dst), &(src), (n), MAX_NUMNODES)
-static __always_inline void __nodes_shift_left(nodemask_t *dstp,
-                                       const nodemask_t *srcp, int n, int nbits)
-{
-       bitmap_shift_left(dstp->bits, srcp->bits, n, nbits);
-}
-
 /* FIXME: better would be to fix all architectures to never return
           > MAX_NUMNODES, then the silly min_ts could be dropped. */