Blame view

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