bitops.h 2.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899
  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. #include <asm/barrier.h>
  17. /*
  18. * We are lucky, DSP is perfect for bitops: do it in 3 cycles
  19. */
  20. /**
  21. * __ffs - find first bit in word.
  22. * @word: The word to search
  23. *
  24. * Undefined if no bit exists, so code should check against 0 first.
  25. * Note __ffs(0) = undef, __ffs(1) = 0, __ffs(0x80000000) = 31.
  26. *
  27. */
  28. static inline unsigned long __ffs(unsigned long x)
  29. {
  30. asm (" bitr .M1 %0,%0\n"
  31. " nop\n"
  32. " lmbd .L1 1,%0,%0\n"
  33. : "+a"(x));
  34. return x;
  35. }
  36. /*
  37. * ffz - find first zero in word.
  38. * @word: The word to search
  39. *
  40. * Undefined if no zero exists, so code should check against ~0UL first.
  41. */
  42. #define ffz(x) __ffs(~(x))
  43. /**
  44. * fls - find last (most-significant) bit set
  45. * @x: the word to search
  46. *
  47. * This is defined the same way as ffs.
  48. * Note fls(0) = 0, fls(1) = 1, fls(0x80000000) = 32.
  49. */
  50. static inline int fls(int x)
  51. {
  52. if (!x)
  53. return 0;
  54. asm (" lmbd .L1 1,%0,%0\n" : "+a"(x));
  55. return 32 - x;
  56. }
  57. /**
  58. * ffs - find first bit set
  59. * @x: the word to search
  60. *
  61. * This is defined the same way as
  62. * the libc and compiler builtin ffs routines, therefore
  63. * differs in spirit from the above ffz (man ffs).
  64. * Note ffs(0) = 0, ffs(1) = 1, ffs(0x80000000) = 32.
  65. */
  66. static inline int ffs(int x)
  67. {
  68. if (!x)
  69. return 0;
  70. return __ffs(x) + 1;
  71. }
  72. #include <asm-generic/bitops/__fls.h>
  73. #include <asm-generic/bitops/fls64.h>
  74. #include <asm-generic/bitops/find.h>
  75. #include <asm-generic/bitops/sched.h>
  76. #include <asm-generic/bitops/hweight.h>
  77. #include <asm-generic/bitops/lock.h>
  78. #include <asm-generic/bitops/atomic.h>
  79. #include <asm-generic/bitops/non-atomic.h>
  80. #include <asm-generic/bitops/le.h>
  81. #include <asm-generic/bitops/ext2-atomic.h>
  82. #endif /* __KERNEL__ */
  83. #endif /* _ASM_C6X_BITOPS_H */