arch/m68k/include/asm/bitops_mm.h

   1 #ifndef _M68K_BITOPS_H
   2 #define _M68K_BITOPS_H
   3 /*
   4  * Copyright 1992, Linus Torvalds.
   5  *
   6  * This file is subject to the terms and conditions of the GNU General Public
   7  * License.  See the file COPYING in the main directory of this archive
   8  * for more details.
   9  */
  10
  11 #ifndef _LINUX_BITOPS_H
  12 #error only <linux/bitops.h> can be included directly
  13 #endif
  14
  15 #include <linux/compiler.h>
  16
  17 /*
  18  * Require 68020 or better.
  19  *
  20  * They use the standard big-endian m680x0 bit ordering.
  21  */
  22
  23 #define test_and_set_bit(nr,vaddr) \
  24   (__builtin_constant_p(nr) ? \
  25    __constant_test_and_set_bit(nr, vaddr) : \
  26    __generic_test_and_set_bit(nr, vaddr))
  27
  28 #define __test_and_set_bit(nr,vaddr) test_and_set_bit(nr,vaddr)
  29
  30 static inline int __constant_test_and_set_bit(int nr, unsigned long *vaddr)
  31 {
  32         char *p = (char *)vaddr + (nr ^ 31) / 8;
  33         char retval;
  34
  35         __asm__ __volatile__ ("bset %2,%1; sne %0"
  36                         : "=d" (retval), "+m" (*p)
  37                         : "di" (nr & 7));
  38
  39         return retval;
  40 }
  41
  42 static inline int __generic_test_and_set_bit(int nr, unsigned long *vaddr)
  43 {
  44         char retval;
  45
  46         __asm__ __volatile__ ("bfset %2{%1:#1}; sne %0"
  47                         : "=d" (retval) : "d" (nr^31), "o" (*vaddr) : "memory");
  48
  49         return retval;
  50 }
  51
  52 #define set_bit(nr,vaddr) \
  53   (__builtin_constant_p(nr) ? \
  54    __constant_set_bit(nr, vaddr) : \
  55    __generic_set_bit(nr, vaddr))
  56
  57 #define __set_bit(nr,vaddr) set_bit(nr,vaddr)
  58
  59 static inline void __constant_set_bit(int nr, volatile unsigned long *vaddr)
  60 {
  61         char *p = (char *)vaddr + (nr ^ 31) / 8;
  62         __asm__ __volatile__ ("bset %1,%0"
  63                         : "+m" (*p) : "di" (nr & 7));
  64 }
  65
  66 static inline void __generic_set_bit(int nr, volatile unsigned long *vaddr)
  67 {
  68         __asm__ __volatile__ ("bfset %1{%0:#1}"
  69                         : : "d" (nr^31), "o" (*vaddr) : "memory");
  70 }
  71
  72 #define test_and_clear_bit(nr,vaddr) \
  73   (__builtin_constant_p(nr) ? \
  74    __constant_test_and_clear_bit(nr, vaddr) : \
  75    __generic_test_and_clear_bit(nr, vaddr))
  76
  77 #define __test_and_clear_bit(nr,vaddr) test_and_clear_bit(nr,vaddr)
  78
  79 static inline int __constant_test_and_clear_bit(int nr, unsigned long *vaddr)
  80 {
  81         char *p = (char *)vaddr + (nr ^ 31) / 8;
  82         char retval;
  83
  84         __asm__ __volatile__ ("bclr %2,%1; sne %0"
  85                         : "=d" (retval), "+m" (*p)
  86                         : "di" (nr & 7));
  87
  88         return retval;
  89 }
  90
  91 static inline int __generic_test_and_clear_bit(int nr, unsigned long *vaddr)
  92 {
  93         char retval;
  94
  95         __asm__ __volatile__ ("bfclr %2{%1:#1}; sne %0"
  96                         : "=d" (retval) : "d" (nr^31), "o" (*vaddr) : "memory");
  97
  98         return retval;
  99 }
 100
 101 /*
 102  * clear_bit() doesn't provide any barrier for the compiler.
 103  */
 104 #define smp_mb__before_clear_bit()      barrier()
 105 #define smp_mb__after_clear_bit()       barrier()
 106
 107 #define clear_bit(nr,vaddr) \
 108   (__builtin_constant_p(nr) ? \
 109    __constant_clear_bit(nr, vaddr) : \
 110    __generic_clear_bit(nr, vaddr))
 111 #define __clear_bit(nr,vaddr) clear_bit(nr,vaddr)
 112
 113 static inline void __constant_clear_bit(int nr, volatile unsigned long *vaddr)
 114 {
 115         char *p = (char *)vaddr + (nr ^ 31) / 8;
 116         __asm__ __volatile__ ("bclr %1,%0"
 117                         : "+m" (*p) : "di" (nr & 7));
 118 }
 119
 120 static inline void __generic_clear_bit(int nr, volatile unsigned long *vaddr)
 121 {
 122         __asm__ __volatile__ ("bfclr %1{%0:#1}"
 123                         : : "d" (nr^31), "o" (*vaddr) : "memory");
 124 }
 125
 126 #define test_and_change_bit(nr,vaddr) \
 127   (__builtin_constant_p(nr) ? \
 128    __constant_test_and_change_bit(nr, vaddr) : \
 129    __generic_test_and_change_bit(nr, vaddr))
 130
 131 #define __test_and_change_bit(nr,vaddr) test_and_change_bit(nr,vaddr)
 132 #define __change_bit(nr,vaddr) change_bit(nr,vaddr)
 133
 134 static inline int __constant_test_and_change_bit(int nr, unsigned long *vaddr)
 135 {
 136         char *p = (char *)vaddr + (nr ^ 31) / 8;
 137         char retval;
 138
 139         __asm__ __volatile__ ("bchg %2,%1; sne %0"
 140                         : "=d" (retval), "+m" (*p)
 141                         : "di" (nr & 7));
 142
 143         return retval;
 144 }
 145
 146 static inline int __generic_test_and_change_bit(int nr, unsigned long *vaddr)
 147 {
 148         char retval;
 149
 150         __asm__ __volatile__ ("bfchg %2{%1:#1}; sne %0"
 151                         : "=d" (retval) : "d" (nr^31), "o" (*vaddr) : "memory");
 152
 153         return retval;
 154 }
 155
 156 #define change_bit(nr,vaddr) \
 157   (__builtin_constant_p(nr) ? \
 158    __constant_change_bit(nr, vaddr) : \
 159    __generic_change_bit(nr, vaddr))
 160
 161 static inline void __constant_change_bit(int nr, unsigned long *vaddr)
 162 {
 163         char *p = (char *)vaddr + (nr ^ 31) / 8;
 164         __asm__ __volatile__ ("bchg %1,%0"
 165                         : "+m" (*p) : "di" (nr & 7));
 166 }
 167
 168 static inline void __generic_change_bit(int nr, unsigned long *vaddr)
 169 {
 170         __asm__ __volatile__ ("bfchg %1{%0:#1}"
 171                         : : "d" (nr^31), "o" (*vaddr) : "memory");
 172 }
 173
 174 static inline int test_bit(int nr, const unsigned long *vaddr)
 175 {
 176         return (vaddr[nr >> 5] & (1UL << (nr & 31))) != 0;
 177 }
 178
 179 static inline int find_first_zero_bit(const unsigned long *vaddr,
 180                                       unsigned size)
 181 {
 182         const unsigned long *p = vaddr;
 183         int res = 32;
 184         unsigned int words;
 185         unsigned long num;
 186
 187         if (!size)
 188                 return 0;
 189
 190         words = (size + 31) >> 5;
 191         while (!(num = ~*p++)) {
 192                 if (!--words)
 193                         goto out;
 194         }
 195
 196         __asm__ __volatile__ ("bfffo %1{#0,#0},%0"
 197                               : "=d" (res) : "d" (num & -num));
 198         res ^= 31;
 199 out:
 200         res += ((long)p - (long)vaddr - 4) * 8;
 201         return res < size ? res : size;
 202 }
 203
 204 static inline int find_next_zero_bit(const unsigned long *vaddr, int size,
 205                                      int offset)
 206 {
 207         const unsigned long *p = vaddr + (offset >> 5);
 208         int bit = offset & 31UL, res;
 209
 210         if (offset >= size)
 211                 return size;
 212
 213         if (bit) {
 214                 unsigned long num = ~*p++ & (~0UL << bit);
 215                 offset -= bit;
 216
 217                 /* Look for zero in first longword */
 218                 __asm__ __volatile__ ("bfffo %1{#0,#0},%0"
 219                                       : "=d" (res) : "d" (num & -num));
 220                 if (res < 32) {
 221                         offset += res ^ 31;
 222                         return offset < size ? offset : size;
 223                 }
 224                 offset += 32;
 225
 226                 if (offset >= size)
 227                         return size;
 228         }
 229         /* No zero yet, search remaining full bytes for a zero */
 230         return offset + find_first_zero_bit(p, size - offset);
 231 }
 232
 233 static inline int find_first_bit(const unsigned long *vaddr, unsigned size)
 234 {
 235         const unsigned long *p = vaddr;
 236         int res = 32;
 237         unsigned int words;
 238         unsigned long num;
 239
 240         if (!size)
 241                 return 0;
 242
 243         words = (size + 31) >> 5;
 244         while (!(num = *p++)) {
 245                 if (!--words)
 246                         goto out;
 247         }
 248
 249         __asm__ __volatile__ ("bfffo %1{#0,#0},%0"
 250                               : "=d" (res) : "d" (num & -num));
 251         res ^= 31;
 252 out:
 253         res += ((long)p - (long)vaddr - 4) * 8;
 254         return res < size ? res : size;
 255 }
 256
 257 static inline int find_next_bit(const unsigned long *vaddr, int size,
 258                                 int offset)
 259 {
 260         const unsigned long *p = vaddr + (offset >> 5);
 261         int bit = offset & 31UL, res;
 262
 263         if (offset >= size)
 264                 return size;
 265
 266         if (bit) {
 267                 unsigned long num = *p++ & (~0UL << bit);
 268                 offset -= bit;
 269
 270                 /* Look for one in first longword */
 271                 __asm__ __volatile__ ("bfffo %1{#0,#0},%0"
 272                                       : "=d" (res) : "d" (num & -num));
 273                 if (res < 32) {
 274                         offset += res ^ 31;
 275                         return offset < size ? offset : size;
 276                 }
 277                 offset += 32;
 278
 279                 if (offset >= size)
 280                         return size;
 281         }
 282         /* No one yet, search remaining full bytes for a one */
 283         return offset + find_first_bit(p, size - offset);
 284 }
 285
 286 /*
 287  * ffz = Find First Zero in word. Undefined if no zero exists,
 288  * so code should check against ~0UL first..
 289  */
 290 static inline unsigned long ffz(unsigned long word)
 291 {
 292         int res;
 293
 294         __asm__ __volatile__ ("bfffo %1{#0,#0},%0"
 295                               : "=d" (res) : "d" (~word & -~word));
 296         return res ^ 31;
 297 }
 298
 299 #ifdef __KERNEL__
 300
 301 /*
 302  * ffs: find first bit set. This is defined the same way as
 303  * the libc and compiler builtin ffs routines, therefore
 304  * differs in spirit from the above ffz (man ffs).
 305  */
 306
 307 static inline int ffs(int x)
 308 {
 309         int cnt;
 310
 311         asm ("bfffo %1{#0:#0},%0" : "=d" (cnt) : "dm" (x & -x));
 312
 313         return 32 - cnt;
 314 }
 315 #define __ffs(x) (ffs(x) - 1)
 316
 317 /*
 318  * fls: find last bit set.
 319  */
 320
 321 static inline int fls(int x)
 322 {
 323         int cnt;
 324
 325         asm ("bfffo %1{#0,#0},%0" : "=d" (cnt) : "dm" (x));
 326
 327         return 32 - cnt;
 328 }
 329
 330 static inline int __fls(int x)
 331 {
 332         return fls(x) - 1;
 333 }
 334
 335 #include <asm-generic/bitops/fls64.h>
 336 #include <asm-generic/bitops/sched.h>
 337 #include <asm-generic/bitops/hweight.h>
 338 #include <asm-generic/bitops/lock.h>
 339
 340 /* Bitmap functions for the little endian bitmap. */
 341
 342 static inline void __set_bit_le(int nr, void *addr)
 343 {
 344         __set_bit(nr ^ 24, addr);
 345 }
 346
 347 static inline void __clear_bit_le(int nr, void *addr)
 348 {
 349         __clear_bit(nr ^ 24, addr);
 350 }
 351
 352 static inline int __test_and_set_bit_le(int nr, void *addr)
 353 {
 354         return __test_and_set_bit(nr ^ 24, addr);
 355 }
 356
 357 static inline int test_and_set_bit_le(int nr, void *addr)
 358 {
 359         return test_and_set_bit(nr ^ 24, addr);
 360 }
 361
 362 static inline int __test_and_clear_bit_le(int nr, void *addr)
 363 {
 364         return __test_and_clear_bit(nr ^ 24, addr);
 365 }
 366
 367 static inline int test_and_clear_bit_le(int nr, void *addr)
 368 {
 369         return test_and_clear_bit(nr ^ 24, addr);
 370 }
 371
 372 static inline int test_bit_le(int nr, const void *vaddr)
 373 {
 374         const unsigned char *p = vaddr;
 375         return (p[nr >> 3] & (1U << (nr & 7))) != 0;
 376 }
 377
 378 static inline int find_first_zero_bit_le(const void *vaddr, unsigned size)
 379 {
 380         const unsigned long *p = vaddr, *addr = vaddr;
 381         int res = 0;
 382         unsigned int words;
 383
 384         if (!size)
 385                 return 0;
 386
 387         words = (size >> 5) + ((size & 31) > 0);
 388         while (*p++ == ~0UL) {
 389                 if (--words == 0)
 390                         goto out;
 391         }
 392
 393         --p;
 394         for (res = 0; res < 32; res++)
 395                 if (!test_bit_le(res, p))
 396                         break;
 397 out:
 398         res += (p - addr) * 32;
 399         return res < size ? res : size;
 400 }
 401
 402 static inline unsigned long find_next_zero_bit_le(const void *addr,
 403                 unsigned long size, unsigned long offset)
 404 {
 405         const unsigned long *p = addr;
 406         int bit = offset & 31UL, res;
 407
 408         if (offset >= size)
 409                 return size;
 410
 411         p += offset >> 5;
 412
 413         if (bit) {
 414                 offset -= bit;
 415                 /* Look for zero in first longword */
 416                 for (res = bit; res < 32; res++)
 417                         if (!test_bit_le(res, p)) {
 418                                 offset += res;
 419                                 return offset < size ? offset : size;
 420                         }
 421                 p++;
 422                 offset += 32;
 423
 424                 if (offset >= size)
 425                         return size;
 426         }
 427         /* No zero yet, search remaining full bytes for a zero */
 428         return offset + find_first_zero_bit_le(p, size - offset);
 429 }
 430
 431 static inline int find_first_bit_le(const void *vaddr, unsigned size)
 432 {
 433         const unsigned long *p = vaddr, *addr = vaddr;
 434         int res = 0;
 435         unsigned int words;
 436
 437         if (!size)
 438                 return 0;
 439
 440         words = (size >> 5) + ((size & 31) > 0);
 441         while (*p++ == 0UL) {
 442                 if (--words == 0)
 443                         goto out;
 444         }
 445
 446         --p;
 447         for (res = 0; res < 32; res++)
 448                 if (test_bit_le(res, p))
 449                         break;
 450 out:
 451         res += (p - addr) * 32;
 452         return res < size ? res : size;
 453 }
 454
 455 static inline unsigned long find_next_bit_le(const void *addr,
 456                 unsigned long size, unsigned long offset)
 457 {
 458         const unsigned long *p = addr;
 459         int bit = offset & 31UL, res;
 460
 461         if (offset >= size)
 462                 return size;
 463
 464         p += offset >> 5;
 465
 466         if (bit) {
 467                 offset -= bit;
 468                 /* Look for one in first longword */
 469                 for (res = bit; res < 32; res++)
 470                         if (test_bit_le(res, p)) {
 471                                 offset += res;
 472                                 return offset < size ? offset : size;
 473                         }
 474                 p++;
 475                 offset += 32;
 476
 477                 if (offset >= size)
 478                         return size;
 479         }
 480         /* No set bit yet, search remaining full bytes for a set bit */
 481         return offset + find_first_bit_le(p, size - offset);
 482 }
 483
 484 /* Bitmap functions for the ext2 filesystem. */
 485
 486 #define ext2_set_bit_atomic(lock, nr, addr)     \
 487         test_and_set_bit_le(nr, addr)
 488 #define ext2_clear_bit_atomic(lock, nr, addr)   \
 489         test_and_clear_bit_le(nr, addr)
 490
 491 #endif /* __KERNEL__ */
 492
 493 #endif /* _M68K_BITOPS_H */