Book a Demo!
CoCalc Logo Icon
StoreFeaturesDocsShareSupportNewsAboutPoliciesSign UpSign In
awilliam
GitHub Repository: awilliam/linux-vfio
 Path: blob/master/arch/sh/include/asm/bitops.h
15125 views
1
#ifndef __ASM_SH_BITOPS_H

2
#define __ASM_SH_BITOPS_H

3


4
#ifdef __KERNEL__

5


6
#ifndef _LINUX_BITOPS_H

7
#error only <linux/bitops.h> can be included directly

8
#endif

9


10
#include <asm/system.h>

11
/* For __swab32 */

12
#include <asm/byteorder.h>

13


14
#ifdef CONFIG_GUSA_RB

15
#include <asm/bitops-grb.h>

16
#elif defined(CONFIG_CPU_SH2A)

17
#include <asm-generic/bitops/atomic.h>

18
#include <asm/bitops-op32.h>

19
#elif defined(CONFIG_CPU_SH4A)

20
#include <asm/bitops-llsc.h>

21
#else

22
#include <asm-generic/bitops/atomic.h>

23
#include <asm-generic/bitops/non-atomic.h>

24
#endif

25


26
/*

27
 * clear_bit() doesn't provide any barrier for the compiler.

28
 */

29
#define smp_mb__before_clear_bit()	smp_mb()

30
#define smp_mb__after_clear_bit()	smp_mb()

31


32
#ifdef CONFIG_SUPERH32

33
static inline unsigned long ffz(unsigned long word)

34
{

35
	unsigned long result;

36


37
	__asm__("1:\n\t"

38
		"shlr	%1\n\t"

39
		"bt/s	1b\n\t"

40
		" add	#1, %0"

41
		: "=r" (result), "=r" (word)

42
		: "0" (~0L), "1" (word)

43
		: "t");

44
	return result;

45
}

46


47
/**

48
 * __ffs - find first bit in word.

49
 * @word: The word to search

50
 *

51
 * Undefined if no bit exists, so code should check against 0 first.

52
 */

53
static inline unsigned long __ffs(unsigned long word)

54
{

55
	unsigned long result;

56


57
	__asm__("1:\n\t"

58
		"shlr	%1\n\t"

59
		"bf/s	1b\n\t"

60
		" add	#1, %0"

61
		: "=r" (result), "=r" (word)

62
		: "0" (~0L), "1" (word)

63
		: "t");

64
	return result;

65
}

66
#else

67
static inline unsigned long ffz(unsigned long word)

68
{

69
	unsigned long result, __d2, __d3;

70


71
        __asm__("gettr  tr0, %2\n\t"

72
                "pta    $+32, tr0\n\t"

73
                "andi   %1, 1, %3\n\t"

74
                "beq    %3, r63, tr0\n\t"

75
                "pta    $+4, tr0\n"

76
                "0:\n\t"

77
                "shlri.l        %1, 1, %1\n\t"

78
                "addi   %0, 1, %0\n\t"

79
                "andi   %1, 1, %3\n\t"

80
                "beqi   %3, 1, tr0\n"

81
                "1:\n\t"

82
                "ptabs  %2, tr0\n\t"

83
                : "=r" (result), "=r" (word), "=r" (__d2), "=r" (__d3)

84
                : "0" (0L), "1" (word));

85


86
	return result;

87
}

88


89
#include <asm-generic/bitops/__ffs.h>

90
#endif

91


92
#include <asm-generic/bitops/find.h>

93
#include <asm-generic/bitops/ffs.h>

94
#include <asm-generic/bitops/hweight.h>

95
#include <asm-generic/bitops/lock.h>

96
#include <asm-generic/bitops/sched.h>

97
#include <asm-generic/bitops/le.h>

98
#include <asm-generic/bitops/ext2-atomic.h>

99
#include <asm-generic/bitops/fls.h>

100
#include <asm-generic/bitops/__fls.h>

101
#include <asm-generic/bitops/fls64.h>

102


103
#endif /* __KERNEL__ */

104


105
#endif /* __ASM_SH_BITOPS_H */

106


107