summaryrefslogtreecommitdiff
path: root/target/linux/coldfire/files-2.6.31/arch/m68k/include/asm/cf_bitops.h
blob: 6f9e9c09908fb504e96f1c58256e4c75dbbab057 (plain)
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
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
/* 
 * Copyright 2007-2009 Freescale Semiconductor, Inc. All Rights Reserved.
 *
 * This file is subject to the terms and conditions of the GNU General Public
 * License.  See the file COPYING in the main directory of this archive
 * for more details.
 */
#ifndef __CF_BITOPS__
#define __CF_BITOPS__

#ifndef _LINUX_BITOPS_H
#error only <linux/bitops.h> can be included directly
#endif

#include <linux/compiler.h>

#define test_and_set_bit(nr,vaddr)			\
  (__builtin_constant_p(nr) ?				\
   __constant_coldfire_test_and_set_bit(nr, vaddr) :	\
   __generic_coldfire_test_and_set_bit(nr, vaddr))

static __inline__ int __constant_coldfire_test_and_set_bit(int nr,
	volatile void *vaddr)
{
	char retval;
	volatile char *p = &((volatile char *)vaddr)[(nr^31) >> 3];
	__asm__ __volatile__ ("bset %2,(%4); sne %0"
	     : "=d" (retval), "=m" (*p)
	     : "di" (nr & 7), "m" (*p), "a" (p));
	return retval;
}

static __inline__ int __generic_coldfire_test_and_set_bit(int nr,
	volatile void *vaddr)
{
	char retval;

	__asm__ __volatile__ ("bset %2,%1; sne %0"
	     : "=d" (retval), "=m" (((volatile char *)vaddr)[(nr^31) >> 3])
	     : "d" (nr)
	     : "memory");
	return retval;
}
#define __test_and_set_bit(nr, vaddr) test_and_set_bit(nr, vaddr)

#define set_bit(nr,vaddr)			\
  (__builtin_constant_p(nr) ?			\
   __constant_coldfire_set_bit(nr, vaddr) :	\
   __generic_coldfire_set_bit(nr, vaddr))

static __inline__ void __constant_coldfire_set_bit(int nr,
	volatile void *vaddr)
{
	volatile char *p = &((volatile char *)vaddr)[(nr^31) >> 3];
	__asm__ __volatile__ ("bset %1,(%3)"
	     : "=m" (*p) : "di" (nr & 7), "m" (*p), "a" (p));
}

static __inline__ void __generic_coldfire_set_bit(int nr,
	volatile void *vaddr)
{
	__asm__ __volatile__ ("bset %1,%0"
	     : "=m" (((volatile char *)vaddr)[(nr^31) >> 3])
	     : "d" (nr)
	     : "memory");
}
#define __set_bit(nr, vaddr) set_bit(nr, vaddr)

#define test_and_clear_bit(nr, vaddr)			\
  (__builtin_constant_p(nr) ?				\
   __constant_coldfire_test_and_clear_bit(nr, vaddr) :	\
   __generic_coldfire_test_and_clear_bit(nr, vaddr))

static __inline__ int __constant_coldfire_test_and_clear_bit(int nr,
	volatile void *vaddr)
{
	char retval;
	volatile char *p = &((volatile char *)vaddr)[(nr^31) >> 3];

	__asm__ __volatile__ ("bclr %2,(%4); sne %0"
	     : "=d" (retval), "=m" (*p)
	     : "id" (nr & 7), "m" (*p), "a" (p));

	return retval;
}

static __inline__ int __generic_coldfire_test_and_clear_bit(int nr,
	volatile void *vaddr)
{
	char retval;

	__asm__ __volatile__ ("bclr %2,%1; sne %0"
	     : "=d" (retval), "=m" (((volatile char *)vaddr)[(nr^31) >> 3])
	     : "d" (nr & 7)
	     : "memory");

	return retval;
}
#define __test_and_clear_bit(nr, vaddr) test_and_clear_bit(nr, vaddr)

/*
 * clear_bit() doesn't provide any barrier for the compiler.
 */
#define smp_mb__before_clear_bit()	barrier()
#define smp_mb__after_clear_bit()	barrier()

#define clear_bit(nr,vaddr)			\
  (__builtin_constant_p(nr) ?			\
   __constant_coldfire_clear_bit(nr, vaddr) :	\
   __generic_coldfire_clear_bit(nr, vaddr))

static __inline__ void __constant_coldfire_clear_bit(int nr,
	volatile void *vaddr)
{
	volatile char *p = &((volatile char *)vaddr)[(nr^31) >> 3];
	__asm__ __volatile__ ("bclr %1,(%3)"
	     : "=m" (*p) : "id" (nr & 7), "m" (*p), "a" (p));
}

static __inline__ void __generic_coldfire_clear_bit(int nr,
	volatile void *vaddr)
{
	__asm__ __volatile__ ("bclr %1,%0"
	     : "=m" (((volatile char *)vaddr)[(nr^31) >> 3])
	     : "d" (nr)
	     : "memory");
}
#define __clear_bit(nr, vaddr) clear_bit(nr, vaddr)

#define test_and_change_bit(nr, vaddr)			\
  (__builtin_constant_p(nr) ?				\
   __constant_coldfire_test_and_change_bit(nr, vaddr) :	\
   __generic_coldfire_test_and_change_bit(nr, vaddr))

static __inline__ int __constant_coldfire_test_and_change_bit(int nr,
	volatile void *vaddr)
{
	char retval;
	volatile char *p = &((volatile char *)vaddr)[(nr^31) >> 3];

	__asm__ __volatile__ ("bchg %2,(%4); sne %0"
	     : "=d" (retval), "=m" (*p)
	     : "id" (nr & 7), "m" (*p), "a" (p));

	return retval;
}

static __inline__ int __generic_coldfire_test_and_change_bit(int nr,
	volatile void *vaddr)
{
	char retval;

	__asm__ __volatile__ ("bchg %2,%1; sne %0"
	     : "=d" (retval), "=m" (((volatile char *)vaddr)[(nr^31) >> 3])
	     : "id" (nr)
	     : "memory");

	return retval;
}
#define __test_and_change_bit(nr, vaddr) test_and_change_bit(nr, vaddr)
#define __change_bit(nr, vaddr) change_bit(nr, vaddr)

#define change_bit(nr,vaddr)			\
  (__builtin_constant_p(nr) ?			\
   __constant_coldfire_change_bit(nr, vaddr) :	\
   __generic_coldfire_change_bit(nr, vaddr))

static __inline__ void __constant_coldfire_change_bit(int nr,
	volatile void *vaddr)
{
	volatile char *p = &((volatile char *)vaddr)[(nr^31) >> 3];
	__asm__ __volatile__ ("bchg %1,(%3)"
	     : "=m" (*p) : "id" (nr & 7), "m" (*p), "a" (p));
}

static __inline__ void __generic_coldfire_change_bit(int nr,
	volatile void *vaddr)
{
	__asm__ __volatile__ ("bchg %1,%0"
	     : "=m" (((volatile char *)vaddr)[(nr^31) >> 3])
	     : "d" (nr)
	     : "memory");
}

static inline int test_bit(int nr, const unsigned long *vaddr)
{
	return (vaddr[nr >> 5] & (1UL << (nr & 31))) != 0;
}

static __inline__ unsigned long ffz(unsigned long word)
{
	unsigned long result = 0;

	while (word & 1) {
		result++;
		word >>= 1;
	}
	return result;
}

/* find_next_zero_bit() finds the first zero bit in a bit string of length
 * 'size' bits, starting the search at bit 'offset'.  This is largely based
 * on Linus's ALPHA routines.
 */
static __inline__ unsigned long find_next_zero_bit(void *addr,
	unsigned long size, unsigned long offset)
{
	unsigned long *p = ((unsigned long *) addr) + (offset >> 5);
	unsigned long result = offset & ~31UL;
	unsigned long tmp;

	if (offset >= size)
		return size;
	size -= result;
	offset &= 31UL;
	if (offset) {
		tmp = *(p++);
		tmp |= ~0UL >> (32-offset);
		if (size < 32)
			goto found_first;
		if (~tmp)
			goto found_middle;
		size -= 32;
		result += 32;
	}
	while (size & ~31UL) {
		tmp = *(p++);
		if (~tmp)
			goto found_middle;
		result += 32;
		size -= 32;
	}
	if (!size)
		return result;
	tmp = *p;

found_first:
	tmp |= ~0UL >> size;
found_middle:
	return result + ffz(tmp);
}

#define find_first_zero_bit(addr, size) find_next_zero_bit(((void *)addr), \
		(size), 0)

/* Ported from included/linux/bitops.h  */
static __inline__ int ffs(int x)
{
	int r = 1;

	if (!x)
		return 0;
	if (!(x & 0xffff)) {
		x >>= 16;
		r += 16;
	}
	if (!(x & 0xff)) {
		x >>= 8;
		r += 8;
	}
	if (!(x & 0xf)) {
		x >>= 4;
		r += 4;
	}
	if (!(x & 3)) {
		x >>= 2;
		r += 2;
	}
	if (!(x & 1)) {
		x >>= 1;
		r += 1;
	}
	return r;
}
#define __ffs(x) (ffs(x) - 1)

/* find_next_bit - find the next set bit in a memory region
 * (from asm-ppc/bitops.h)
 */
static __inline__ unsigned long find_next_bit(const unsigned long *addr,
	unsigned long size, unsigned long offset)
{
	unsigned int *p = ((unsigned int *) addr) + (offset >> 5);
	unsigned int result = offset & ~31UL;
	unsigned int tmp;

	if (offset >= size)
		return size;
	size -= result;
	offset &= 31UL;
	if (offset) {
		tmp = *p++;
		tmp &= ~0UL << offset;
		if (size < 32)
			goto found_first;
		if (tmp)
			goto found_middle;
		size -= 32;
		result += 32;
	}
	while (size >= 32) {
		tmp = *p++;
		if (tmp != 0)
			goto found_middle;
		result += 32;
		size -= 32;
	}
	if (!size)
		return result;
	tmp = *p;

found_first:
	tmp &= ~0UL >> (32 - size);
	if (tmp == 0UL)        /* Are any bits set? */
		return result + size; /* Nope. */
found_middle:
	return result + __ffs(tmp);
}

#define find_first_bit(addr, size) find_next_bit((addr), (size), 0)

#ifdef __KERNEL__

/* Ported from include/linux/bitops.h */
static  __inline__ int fls(int x)
{
	int r = 32;

	if (!x)
		return 0;
	if (!(x & 0xffff0000u)) {
		x <<= 16;
		r -= 16;
	}
	if (!(x & 0xff000000u)) {
		x <<= 8;
		r -= 8;
	}
	if (!(x & 0xf0000000u)) {
		x <<= 4;
		r -= 4;
	}
	if (!(x & 0xc0000000u)) {
		x <<= 2;
		r -= 2;
	}
	if (!(x & 0x80000000u)) {
		x <<= 1;
		r -= 1;
	}
	return r;
}

static inline int __fls(int x)
{
	return fls(x) - 1;
}

#include <asm-generic/bitops/fls64.h>
#include <asm-generic/bitops/sched.h>
#include <asm-generic/bitops/hweight.h>
#include <asm-generic/bitops/lock.h>

#define minix_find_first_zero_bit(addr, size)	find_next_zero_bit((addr), \
							(size), 0)
#define minix_test_and_set_bit(nr, addr)	test_and_set_bit((nr), \
							(unsigned long *)(addr))
#define minix_set_bit(nr, addr)			set_bit((nr), \
							(unsigned long *)(addr))
#define minix_test_and_clear_bit(nr, addr)	test_and_clear_bit((nr), \
							(unsigned long *)(addr))

static inline int minix_test_bit(int nr, const volatile unsigned long *vaddr)
{
	int 	*a = (int *)vaddr;
	int	mask;

	a += nr >> 5;
	mask = 1 << (nr & 0x1f);
	return ((mask & *a) != 0);
}

#define ext2_set_bit(nr, addr)			test_and_set_bit((nr) ^ 24, \
							(unsigned long *)(addr))
#define ext2_set_bit_atomic(lock, nr, addr)	test_and_set_bit((nr) ^ 24, \
							(unsigned long *)(addr))
#define ext2_clear_bit(nr, addr)		test_and_clear_bit((nr) ^ 24, \
							(unsigned long *)(addr))
#define ext2_clear_bit_atomic(lock, nr, addr)	test_and_clear_bit((nr) ^ 24, \
							(unsigned long *)(addr))

static inline int ext2_test_bit(int nr, const void *vaddr)
{
	const unsigned char *p = vaddr;
	return (p[nr >> 3] & (1U << (nr & 7))) != 0;
}

static inline int ext2_find_first_zero_bit(const void *vaddr, unsigned size)
{
	const unsigned long *p = vaddr, *addr = vaddr;
	int res;

	if (!size)
		return 0;

	size = (size >> 5) + ((size & 31) > 0);
	while (*p++ == ~0UL) {
		if (--size == 0)
			return (p - addr) << 5;
	}

	--p;
	for (res = 0; res < 32; res++)
		if (!ext2_test_bit (res, p))
			break;
	return (p - addr) * 32 + res;
}

static inline int ext2_find_next_zero_bit(const void *vaddr, unsigned size,
					  unsigned offset)
{
	const unsigned long *addr = vaddr;
	const unsigned long *p = addr + (offset >> 5);
	int bit = offset & 31UL, res;

	if (offset >= size)
		return size;

	if (bit) {
		/* Look for zero in first longword */
		for (res = bit; res < 32; res++)
			if (!ext2_test_bit (res, p))
				return (p - addr) * 32 + res;
		p++;
	}
	/* No zero yet, search remaining full bytes for a zero */
	res = ext2_find_first_zero_bit(p, size - 32 * (p - addr));
	return (p - addr) * 32 + res;
}

#endif /* KERNEL */

#endif /* __CF_BITOPS__ */