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
|
/* Copyright (C) 2004-2013 Free Software Foundation, Inc.
Contributor: Joern Rennecke <joern.rennecke@embecosm.com>
on behalf of Synopsys Inc.
This file is free software; you can redistribute it and/or modify it
under the terms of the GNU General Public License as published by the
Free Software Foundation; either version 3, or (at your option) any
later version.
In addition to the permissions in the GNU General Public License, the
Free Software Foundation gives you unlimited permission to link the
compiled version of this file into combinations with other programs,
and to distribute those combinations without any restriction coming
from the use of this file. (The General Public License restrictions
do apply in other respects; for example, they cover modification of
the file, and distribution when not linked into a combine
executable.)
This file is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; see the file COPYING3. If not see
<http://www.gnu.org/licenses/>. */
/* Calculate division table for ARC700 integer division
Contributed by Joern Rennecke
joern.rennecke@arc.com */
#include <stdio.h>
#include <math.h>
int
main ()
{
int i, j;
unsigned x;
double q, r, err, max_err = -1;
puts("/* This table has been generated by divtab-arc700.c. */");
puts("\
/* 1/512 .. 1/256, normalized. There is a leading 1 in bit 31.\n\
For powers of two, we list unnormalized numbers instead. The values\n\
for powers of 2 are loaded, but not used. The value for 1 is actually\n\
the first instruction after .Lmuldiv. */\n\
.balign 4");
puts (".Ldivtab:\n");
for (i = 256; i >= 2; --i)
{
j = i < 0 ? -i : i;
if (j & (j-1))
while (j < 128)
j += j;
else
/* Power of two. */
j *= 128;
q = 4.*(1<<30)*128/j;
r = ceil (q);
printf ("\t.long\t0x%X\n", (unsigned) r);
err = r - q;
if (err > max_err)
max_err = err;
}
#if 0
printf ("\t/* maximum error: %f */\n", max_err);
#endif
exit (0);
}
|
