bitops.h 2.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105
  1. /*
  2. * Port on Texas Instruments TMS320C6x architecture
  3. *
  4. * Copyright (C) 2004, 2009, 2010 Texas Instruments Incorporated
  5. * Author: Aurelien Jacquiot (aurelien.jacquiot@jaluna.com)
  6. *
  7. * This program is free software; you can redistribute it and/or modify
  8. * it under the terms of the GNU General Public License version 2 as
  9. * published by the Free Software Foundation.
  10. */
  11. #ifndef _ASM_C6X_BITOPS_H
  12. #define _ASM_C6X_BITOPS_H
  13. #ifdef __KERNEL__
  14. #include <linux/bitops.h>
  15. #include <asm/byteorder.h>
  16. /*
  17. * clear_bit() doesn't provide any barrier for the compiler.
  18. */
  19. #define smp_mb__before_clear_bit() barrier()
  20. #define smp_mb__after_clear_bit() barrier()
  21. /*
  22. * We are lucky, DSP is perfect for bitops: do it in 3 cycles
  23. */
  24. /**
  25. * __ffs - find first bit in word.
  26. * @word: The word to search
  27. *
  28. * Undefined if no bit exists, so code should check against 0 first.
  29. * Note __ffs(0) = undef, __ffs(1) = 0, __ffs(0x80000000) = 31.
  30. *
  31. */
  32. static inline unsigned long __ffs(unsigned long x)
  33. {
  34. asm (" bitr .M1 %0,%0\n"
  35. " nop\n"
  36. " lmbd .L1 1,%0,%0\n"
  37. : "+a"(x));
  38. return x;
  39. }
  40. /*
  41. * ffz - find first zero in word.
  42. * @word: The word to search
  43. *
  44. * Undefined if no zero exists, so code should check against ~0UL first.
  45. */
  46. #define ffz(x) __ffs(~(x))
  47. /**
  48. * fls - find last (most-significant) bit set
  49. * @x: the word to search
  50. *
  51. * This is defined the same way as ffs.
  52. * Note fls(0) = 0, fls(1) = 1, fls(0x80000000) = 32.
  53. */
  54. static inline int fls(int x)
  55. {
  56. if (!x)
  57. return 0;
  58. asm (" lmbd .L1 1,%0,%0\n" : "+a"(x));
  59. return 32 - x;
  60. }
  61. /**
  62. * ffs - find first bit set
  63. * @x: the word to search
  64. *
  65. * This is defined the same way as
  66. * the libc and compiler builtin ffs routines, therefore
  67. * differs in spirit from the above ffz (man ffs).
  68. * Note ffs(0) = 0, ffs(1) = 1, ffs(0x80000000) = 32.
  69. */
  70. static inline int ffs(int x)
  71. {
  72. if (!x)
  73. return 0;
  74. return __ffs(x) + 1;
  75. }
  76. #include <asm-generic/bitops/__fls.h>
  77. #include <asm-generic/bitops/fls64.h>
  78. #include <asm-generic/bitops/find.h>
  79. #include <asm-generic/bitops/sched.h>
  80. #include <asm-generic/bitops/hweight.h>
  81. #include <asm-generic/bitops/lock.h>
  82. #include <asm-generic/bitops/atomic.h>
  83. #include <asm-generic/bitops/non-atomic.h>
  84. #include <asm-generic/bitops/le.h>
  85. #include <asm-generic/bitops/ext2-atomic.h>
  86. #endif /* __KERNEL__ */
  87. #endif /* _ASM_C6X_BITOPS_H */