|
39 | 39 | * int nodes_full(mask) Is mask full (all bits sets)?
|
40 | 40 | * int nodes_weight(mask) Hamming weight - number of set bits
|
41 | 41 | *
|
42 |
| - * void nodes_shift_right(dst, src, n) Shift right |
43 |
| - * void nodes_shift_left(dst, src, n) Shift left |
44 |
| - * |
45 | 42 | * unsigned int first_node(mask) Number lowest set bit, or MAX_NUMNODES
|
46 | 43 | * unsigend int next_node(node, mask) Next node past 'node', or MAX_NUMNODES
|
47 | 44 | * 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
|
247 | 244 | return bitmap_weight(srcp->bits, nbits);
|
248 | 245 | }
|
249 | 246 |
|
250 |
| -#define nodes_shift_right(dst, src, n) \ |
251 |
| - __nodes_shift_right(&(dst), &(src), (n), MAX_NUMNODES) |
252 |
| -static __always_inline void __nodes_shift_right(nodemask_t *dstp, |
253 |
| - const nodemask_t *srcp, int n, int nbits) |
254 |
| -{ |
255 |
| - bitmap_shift_right(dstp->bits, srcp->bits, n, nbits); |
256 |
| -} |
257 |
| - |
258 |
| -#define nodes_shift_left(dst, src, n) \ |
259 |
| - __nodes_shift_left(&(dst), &(src), (n), MAX_NUMNODES) |
260 |
| -static __always_inline void __nodes_shift_left(nodemask_t *dstp, |
261 |
| - const nodemask_t *srcp, int n, int nbits) |
262 |
| -{ |
263 |
| - bitmap_shift_left(dstp->bits, srcp->bits, n, nbits); |
264 |
| -} |
265 |
| - |
266 | 247 | /* FIXME: better would be to fix all architectures to never return
|
267 | 248 | > MAX_NUMNODES, then the silly min_ts could be dropped. */
|
268 | 249 |
|
|
0 commit comments