Annotation of OpenXM_contrib2/asir2018/fft/dft.h, Revision 1.2
1.1 noro 1: /*
2: * Copyright (c) 1994-2000 FUJITSU LABORATORIES LIMITED
3: * All rights reserved.
4: *
5: * FUJITSU LABORATORIES LIMITED ("FLL") hereby grants you a limited,
6: * non-exclusive and royalty-free license to use, copy, modify and
7: * redistribute, solely for non-commercial and non-profit purposes, the
8: * computer program, "Risa/Asir" ("SOFTWARE"), subject to the terms and
9: * conditions of this Agreement. For the avoidance of doubt, you acquire
10: * only a limited right to use the SOFTWARE hereunder, and FLL or any
11: * third party developer retains all rights, including but not limited to
12: * copyrights, in and to the SOFTWARE.
13: *
14: * (1) FLL does not grant you a license in any way for commercial
15: * purposes. You may use the SOFTWARE only for non-commercial and
16: * non-profit purposes only, such as academic, research and internal
17: * business use.
18: * (2) The SOFTWARE is protected by the Copyright Law of Japan and
19: * international copyright treaties. If you make copies of the SOFTWARE,
20: * with or without modification, as permitted hereunder, you shall affix
21: * to all such copies of the SOFTWARE the above copyright notice.
22: * (3) An explicit reference to this SOFTWARE and its copyright owner
23: * shall be made on your publication or presentation in any form of the
24: * results obtained by use of the SOFTWARE.
25: * (4) In the event that you modify the SOFTWARE, you shall notify FLL by
26: * e-mail at risa-admin@sec.flab.fujitsu.co.jp of the detailed specification
27: * for such modification or the source code of the modified part of the
28: * SOFTWARE.
29: *
30: * THE SOFTWARE IS PROVIDED AS IS WITHOUT ANY WARRANTY OF ANY KIND. FLL
31: * MAKES ABSOLUTELY NO WARRANTIES, EXPRESSED, IMPLIED OR STATUTORY, AND
32: * EXPRESSLY DISCLAIMS ANY IMPLIED WARRANTY OF MERCHANTABILITY, FITNESS
33: * FOR A PARTICULAR PURPOSE OR NONINFRINGEMENT OF THIRD PARTIES'
34: * RIGHTS. NO FLL DEALER, AGENT, EMPLOYEES IS AUTHORIZED TO MAKE ANY
35: * MODIFICATIONS, EXTENSIONS, OR ADDITIONS TO THIS WARRANTY.
36: * UNDER NO CIRCUMSTANCES AND UNDER NO LEGAL THEORY, TORT, CONTRACT,
37: * OR OTHERWISE, SHALL FLL BE LIABLE TO YOU OR ANY OTHER PERSON FOR ANY
38: * DIRECT, INDIRECT, SPECIAL, INCIDENTAL, PUNITIVE OR CONSEQUENTIAL
39: * DAMAGES OF ANY CHARACTER, INCLUDING, WITHOUT LIMITATION, DAMAGES
40: * ARISING OUT OF OR RELATING TO THE SOFTWARE OR THIS AGREEMENT, DAMAGES
41: * FOR LOSS OF GOODWILL, WORK STOPPAGE, OR LOSS OF DATA, OR FOR ANY
42: * DAMAGES, EVEN IF FLL SHALL HAVE BEEN INFORMED OF THE POSSIBILITY OF
43: * SUCH DAMAGES, OR FOR ANY CLAIM BY ANY OTHER PARTY. EVEN IF A PART
44: * OF THE SOFTWARE HAS BEEN DEVELOPED BY A THIRD PARTY, THE THIRD PARTY
45: * DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE,
46: * PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE.
47: *
1.2 ! noro 48: * $OpenXM: OpenXM_contrib2/asir2018/fft/dft.h,v 1.1 2018/09/19 05:45:07 noro Exp $
1.1 noro 49: */
50: #if SIZEOF_LONG == 8
51: typedef unsigned long UL;
52: #elif defined(HAVE_UNSIGNED_LONG_LONG)
53: typedef unsigned long long UL;
54: #elif defined(_MSC_VER)
55: typedef unsigned _int64 UL;
56: #endif
57:
58: struct PrimesS {
59: int prime, primroot;
60: int bitwid, d;
61: };
62:
63: #if defined(USE_FLOAT)
64: #define NPrimes 536
65: #else
66: #define NPrimes 13681
67: #endif
68:
69: #if defined(USE_FLOAT)
70: typedef float ModNum;
71:
72: #define AxBplusCmodP(ans,anstype,a,b,c,p,pinv) \
73: { double _w_ = ((double)(a))*((double)(b))+((double)(c)), \
74: _dp_ = (double)(p); \
75: if ( _w_ >= _dp_ ) _w_ -= (_dp_*(double)((int)(_w_*(pinv)))); \
76: ans = (anstype) (_w_>=_dp_?_w_-_dp_: _w_); }
77:
78: #define AxBmodP(ans,anstype,a,b,p,pinv) \
79: { double _w_ = ((double)(a))*((double)(b)), _dp_ = (double)(p); \
80: _dp_ = (double)(p); \
81: if ( _w_ >= _dp_ ) _w_ -= (_dp_*(double)((int)(_w_*(pinv)))); \
82: ans = (anstype) (_w_>=_dp_?_w_-_dp_: _w_); }
83:
84: #define AxBmodPnostrchk(ans,anstype,a,b,p,pinv) \
85: { double _w_ = ((double)(a))*((double)(b)), _dp_ = (double)(p); \
86: if ( _w_ >= _dp_ ) _w_ -= (_dp_*(double)((int)(_w_*(pinv)))); \
87: ans = (anstype) _w_; }
88:
89: #define AxBplusCmodPnostrchk(ans,anstype,a,b,c,p,pinv) \
90: { double _w_ = ((double)(a))*((double)(b))+((double)(c)), \
91: _dp_ = (double)(p); \
92: if ( _w_ >= _dp_ ) _w_ -= (_dp_*(double)((int)(_w_*(pinv)))); \
93: ans = (anstype) _w_; }
94: #else
95:
96: #include "inline.h"
1.2 ! noro 97: int dmar(int,int,int,int);
1.1 noro 98:
99: typedef unsigned int ModNum;
100:
101: /* XXX */
102: #if defined(__DARWIN__)
103: #undef DMAR
104: #define DMAR(a1,a2,a3,d,r) (r)=dmar(a1,a2,a3,d);
105: #endif
106:
107: #define AxBplusCmodP(ans,anstype,a,b,c,p,pinv) \
108: { DMAR(a,b,c,p,ans) }
109:
110: #define AxBmodP(ans,anstype,a,b,p,pinv) \
111: { DMAR(a,b,0,p,ans) }
112:
113: #define AxBmodPnostrchk(ans,anstype,a,b,p,pinv) \
114: { DMAR(a,b,0,p,ans) }
115:
116: #define AxBplusCmodPnostrchk(ans,anstype,a,b,c,p,pinv) \
117: { DMAR(a,b,c,p,ans) }
118: #endif
119:
120: #define AstrictmodP(a,p) ((a)>=(p)?((a)-(p)):(a))
121:
122: #define AplusBmodP(a,b,p) (((p)-(b))>(a)?((a)+(b)): ((a)-((p)-(b))))
123: #define A_BmodP(a,b,p) ((a)>=(b)?((a)-(b)): (((p)-(b))+(a)))
124:
125: void C_DFT_FORE(ModNum *,int,int,int,ModNum *,
126: #ifdef POWA_STRIDE
127: int
128: #else
129: ModNum *,int,ModNum,double,ModNum *
130: #endif
131: );
132:
133: void C_DFT_BACK(ModNum *,int,int,int,ModNum *,
134: #ifdef POWA_STRIDE
135: int
136: #else
137: ModNum *,int,int,int,ModNum,ModNum,double,ModNum *
138: #endif
139: );
140:
141: void C_PREP_ALPHA(ModNum,int,int,int,ModNum *,ModNum,double);
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>