[mirror_ubuntu-artful-kernel.git] / include / asm-mips / div64.h

/*
 * Copyright (C) 2000, 2004  Maciej W. Rozycki
 * Copyright (C) 2003 Ralf Baechle
 *
 * 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 _ASM_DIV64_H
#define _ASM_DIV64_H

#if (_MIPS_SZLONG == 32)

#include <asm/compiler.h>

/*
 * No traps on overflows for any of these...
 */

#define do_div64_32(res, high, low, base) ({ \
	unsigned long __quot, __mod; \
	unsigned long __cf, __tmp, __tmp2, __i; \
	\
	__asm__(".set	push\n\t" \
		".set	noat\n\t" \
		".set	noreorder\n\t" \
		"move	%2, $0\n\t" \
		"move	%3, $0\n\t" \
		"b	1f\n\t" \
		" li	%4, 0x21\n" \
		"0:\n\t" \
		"sll	$1, %0, 0x1\n\t" \
		"srl	%3, %0, 0x1f\n\t" \
		"or	%0, $1, %5\n\t" \
		"sll	%1, %1, 0x1\n\t" \
		"sll	%2, %2, 0x1\n" \
		"1:\n\t" \
		"bnez	%3, 2f\n\t" \
		" sltu	%5, %0, %z6\n\t" \
		"bnez	%5, 3f\n" \
		"2:\n\t" \
		" addiu	%4, %4, -1\n\t" \
		"subu	%0, %0, %z6\n\t" \
		"addiu	%2, %2, 1\n" \
		"3:\n\t" \
		"bnez	%4, 0b\n\t" \
		" srl	%5, %1, 0x1f\n\t" \
		".set	pop" \
		: "=&r" (__mod), "=&r" (__tmp), "=&r" (__quot), "=&r" (__cf), \
		  "=&r" (__i), "=&r" (__tmp2) \
		: "Jr" (base), "0" (high), "1" (low)); \
	\
	(res) = __quot; \
	__mod; })

#define do_div(n, base) ({ \
	unsigned long long __quot; \
	unsigned long __mod; \
	unsigned long long __div; \
	unsigned long __upper, __low, __high, __base; \
	\
	__div = (n); \
	__base = (base); \
	\
	__high = __div >> 32; \
	__low = __div; \
	__upper = __high; \
	\
	if (__high) \
		__asm__("divu	$0, %z2, %z3" \
			: "=h" (__upper), "=l" (__high) \
			: "Jr" (__high), "Jr" (__base) \
			: GCC_REG_ACCUM); \
	\
	__mod = do_div64_32(__low, __upper, __low, __base); \
	\
	__quot = __high; \
	__quot = __quot << 32 | __low; \
	(n) = __quot; \
	__mod; })
#endif /* (_MIPS_SZLONG == 32) */

#if (_MIPS_SZLONG == 64)

/*
 * Don't use this one in new code
 */
#define do_div64_32(res, high, low, base) ({ \
	unsigned int __quot, __mod; \
	unsigned long __div; \
	unsigned int __low, __high, __base; \
	\
	__high = (high); \
	__low = (low); \
	__div = __high; \
	__div = __div << 32 | __low; \
	__base = (base); \
	\
	__mod = __div % __base; \
	__div = __div / __base; \
	\
	__quot = __div; \
	(res) = __quot; \
	__mod; })

/*
 * Hey, we're already 64-bit, no
 * need to play games..
 */
#define do_div(n, base) ({ \
	unsigned long __quot; \
	unsigned int __mod; \
	unsigned long __div; \
	unsigned int __base; \
	\
	__div = (n); \
	__base = (base); \
	\
	__mod = __div % __base; \
	__quot = __div / __base; \
	\
	(n) = __quot; \
	__mod; })

#endif /* (_MIPS_SZLONG == 64) */

#endif /* _ASM_DIV64_H */
Commit	Line	Data
1da177e4 LT	1	/*
	2	* Copyright (C) 2000, 2004 Maciej W. Rozycki
	3	* Copyright (C) 2003 Ralf Baechle
	4	*
	5	* This file is subject to the terms and conditions of the GNU General Public
	6	* License. See the file "COPYING" in the main directory of this archive
	7	* for more details.
	8	*/
	9	#ifndef _ASM_DIV64_H
	10	#define _ASM_DIV64_H
	11
	12	#if (_MIPS_SZLONG == 32)
	13
	14	#include <asm/compiler.h>
	15
	16	/*
	17	* No traps on overflows for any of these...
	18	*/
	19
	20	#define do_div64_32(res, high, low, base) ({ \
	21	unsigned long __quot, __mod; \
	22	unsigned long __cf, __tmp, __tmp2, __i; \
	23	\
	24	__asm__(".set push\n\t" \
	25	".set noat\n\t" \
	26	".set noreorder\n\t" \
	27	"move %2, $0\n\t" \
	28	"move %3, $0\n\t" \
	29	"b 1f\n\t" \
	30	" li %4, 0x21\n" \
	31	"0:\n\t" \
	32	"sll $1, %0, 0x1\n\t" \
	33	"srl %3, %0, 0x1f\n\t" \
	34	"or %0, $1, %5\n\t" \
	35	"sll %1, %1, 0x1\n\t" \
	36	"sll %2, %2, 0x1\n" \
	37	"1:\n\t" \
	38	"bnez %3, 2f\n\t" \
	39	" sltu %5, %0, %z6\n\t" \
	40	"bnez %5, 3f\n" \
	41	"2:\n\t" \
	42	" addiu %4, %4, -1\n\t" \
	43	"subu %0, %0, %z6\n\t" \
	44	"addiu %2, %2, 1\n" \
	45	"3:\n\t" \
	46	"bnez %4, 0b\n\t" \
	47	" srl %5, %1, 0x1f\n\t" \
	48	".set pop" \
	49	: "=&r" (__mod), "=&r" (__tmp), "=&r" (__quot), "=&r" (__cf), \
	50	"=&r" (__i), "=&r" (__tmp2) \
	51	: "Jr" (base), "0" (high), "1" (low)); \
	52	\
	53	(res) = __quot; \
	54	__mod; })
	55
	56	#define do_div(n, base) ({ \
	57	unsigned long long __quot; \
	58	unsigned long __mod; \
	59	unsigned long long __div; \
	60	unsigned long __upper, __low, __high, __base; \
	61	\
	62	__div = (n); \
	63	__base = (base); \
	64	\
65	__high = __div >> 32; \
66	__low = __div; \
67	__upper = __high; \
68	\
69	if (__high) \
70	__asm__("divu $0, %z2, %z3" \
71	: "=h" (__upper), "=l" (__high) \
72	: "Jr" (__high), "Jr" (__base) \
73	: GCC_REG_ACCUM); \
74	\
75	__mod = do_div64_32(__low, __upper, __low, __base); \
76	\
77	__quot = __high; \
78	__quot = __quot << 32 \| __low; \
79	(n) = __quot; \
80	__mod; })
81	#endif /* (_MIPS_SZLONG == 32) */
82
83	#if (_MIPS_SZLONG == 64)
84
85	/*
86	* Don't use this one in new code
87	*/
88	#define do_div64_32(res, high, low, base) ({ \
89	unsigned int __quot, __mod; \
90	unsigned long __div; \
91	unsigned int __low, __high, __base; \
92	\
93	__high = (high); \
94	__low = (low); \
95	__div = __high; \
96	__div = __div << 32 \| __low; \
97	__base = (base); \
98	\
99	__mod = __div % __base; \
100	__div = __div / __base; \
101	\
102	__quot = __div; \
103	(res) = __quot; \
104	__mod; })
105
106	/*
107	* Hey, we're already 64-bit, no
108	* need to play games..
109	*/
110	#define do_div(n, base) ({ \
111	unsigned long __quot; \
112	unsigned int __mod; \
113	unsigned long __div; \
114	unsigned int __base; \
115	\
116	__div = (n); \
117	__base = (base); \
118	\
119	__mod = __div % __base; \
120	__quot = __div / __base; \
121	\
122	(n) = __quot; \
123	__mod; })
124
125	#endif /* (_MIPS_SZLONG == 64) */
126
127	#endif /* _ASM_DIV64_H */