1 /* Unsigned 32 bit division optimized for Epiphany.
2 Copyright (C) 2009-2018 Free Software Foundation, Inc.
3 Contributed by Embecosm on behalf of Adapteva, Inc.
5 This file is part of GCC.
7 This file is free software; you can redistribute it and/or modify it
8 under the terms of the GNU General Public License as published by the
9 Free Software Foundation; either version 3, or (at your option) any
12 This file is distributed in the hope that it will be useful, but
13 WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 General Public License for more details.
17 Under Section 7 of GPL version 3, you are granted additional
18 permissions described in the GCC Runtime Library Exception, version
19 3.1, as published by the Free Software Foundation.
21 You should have received a copy of the GNU General Public License and
22 a copy of the GCC Runtime Library Exception along with this program;
23 see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
24 <http://www.gnu.org/licenses/>. */
26 #include "epiphany-asm.h"
28 FSTAB (__udivsi3,T_UINT)
29 .global SYM(__udivsi3)
31 HIDDEN_FUNC(__udivsi3)
36 mov TMP1,%low(0xb0800000) ; ??? this would be faster with small data
38 movt TMP1,%high(0xb0800000)
41 movt TMP1,%high(0x00810000)
57 .Lsub_loop:; More than two iterations are rare, so it makes sense to leave
58 ; this label here to reduce average branch penalties.
66 movt r1,%high(.L0step)
75 .L0step:sub r1,TMP0,1 ; mask result bits from steps ...
77 orr r0,r0,TMP3 ; ... and combine with first bits.