mirror of
https://github.com/FEX-Emu/linux.git
synced 2024-12-29 04:45:05 +00:00
6f6d6a1a6a
Rename div64_64 to div64_u64 to make it consistent with the other divide functions, so it clearly includes the type of the divide. Move its definition to math64.h as currently no architecture overrides the generic implementation. They can still override it of course, but the duplicated declarations are avoided. Signed-off-by: Roman Zippel <zippel@linux-m68k.org> Cc: Avi Kivity <avi@qumranet.com> Cc: Russell King <rmk@arm.linux.org.uk> Cc: Geert Uytterhoeven <geert@linux-m68k.org> Cc: Ralf Baechle <ralf@linux-mips.org> Cc: David Howells <dhowells@redhat.com> Cc: Jeff Dike <jdike@addtoit.com> Cc: Ingo Molnar <mingo@elte.hu> Cc: "David S. Miller" <davem@davemloft.net> Cc: Patrick McHardy <kaber@trash.net> Signed-off-by: Andrew Morton <akpm@linux-foundation.org> Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
111 lines
2.3 KiB
C
111 lines
2.3 KiB
C
/*
|
|
* Copyright (C) 2000, 2004 Maciej W. Rozycki
|
|
* Copyright (C) 2003, 07 Ralf Baechle (ralf@linux-mips.org)
|
|
*
|
|
* 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
|
|
|
|
#include <linux/types.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 __quot32, __mod32; \
|
|
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" (__mod32), "=&r" (__tmp), \
|
|
"=&r" (__quot32), "=&r" (__cf), \
|
|
"=&r" (__i), "=&r" (__tmp2) \
|
|
: "Jr" (base), "0" (high), "1" (low)); \
|
|
\
|
|
(res) = __quot32; \
|
|
__mod32; })
|
|
|
|
#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)
|
|
|
|
/*
|
|
* 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 */
|