Annotation of OpenXM_contrib2/asir2000/fft/dft.h, Revision 1.2
1.2 ! 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@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: *
! 48: * $OpenXM: OpenXM_contrib2/asir2000/fft/dft.h,v 1.1.1.1 1999/12/03 07:39:08 noro Exp $
! 49: */
1.1 noro 50: #if LONG_IS_32BIT
51: #if defined(VISUAL)
52: typedef unsigned _int64 UL;
53: #else
54: typedef unsigned long long UL;
55: #endif
56: #else
57: typedef unsigned long UL;
58: #endif
59:
60: struct PrimesS {
61: int prime, primroot;
62: int bitwid, d;
63: };
64:
65: #if USE_FLOAT
66: #define NPrimes 536
67: #else
68: #define NPrimes 13681
69: #endif
70:
71: #if USE_FLOAT
72: typedef float ModNum;
73:
74: #define AxBplusCmodP(ans,anstype,a,b,c,p,pinv) \
75: { double _w_ = ((double)(a))*((double)(b))+((double)(c)), \
76: _dp_ = (double)(p); \
77: if ( _w_ >= _dp_ ) _w_ -= (_dp_*(double)((int)(_w_*(pinv)))); \
78: ans = (anstype) (_w_>=_dp_?_w_-_dp_: _w_); }
79:
80: #define AxBmodP(ans,anstype,a,b,p,pinv) \
81: { double _w_ = ((double)(a))*((double)(b)), _dp_ = (double)(p); \
82: _dp_ = (double)(p); \
83: if ( _w_ >= _dp_ ) _w_ -= (_dp_*(double)((int)(_w_*(pinv)))); \
84: ans = (anstype) (_w_>=_dp_?_w_-_dp_: _w_); }
85:
86: #define AxBmodPnostrchk(ans,anstype,a,b,p,pinv) \
87: { double _w_ = ((double)(a))*((double)(b)), _dp_ = (double)(p); \
88: if ( _w_ >= _dp_ ) _w_ -= (_dp_*(double)((int)(_w_*(pinv)))); \
89: ans = (anstype) _w_; }
90:
91: #define AxBplusCmodPnostrchk(ans,anstype,a,b,c,p,pinv) \
92: { double _w_ = ((double)(a))*((double)(b))+((double)(c)), \
93: _dp_ = (double)(p); \
94: if ( _w_ >= _dp_ ) _w_ -= (_dp_*(double)((int)(_w_*(pinv)))); \
95: ans = (anstype) _w_; }
96: #else
97:
98: #include "inline.h"
99:
100: typedef unsigned int ModNum;
101:
102: #define AxBplusCmodP(ans,anstype,a,b,c,p,pinv) \
103: { DMAR(a,b,c,p,ans) }
104:
105: #define AxBmodP(ans,anstype,a,b,p,pinv) \
106: { DMAR(a,b,0,p,ans) }
107:
108: #define AxBmodPnostrchk(ans,anstype,a,b,p,pinv) \
109: { DMAR(a,b,0,p,ans) }
110:
111: #define AxBplusCmodPnostrchk(ans,anstype,a,b,c,p,pinv) \
112: { DMAR(a,b,c,p,ans) }
113: #endif
114:
115: #define AstrictmodP(a,p) ((a)>=(p)?((a)-(p)):(a))
116:
117: #define AplusBmodP(a,b,p) (((p)-(b))>(a)?((a)+(b)): ((a)-((p)-(b))))
118: #define A_BmodP(a,b,p) ((a)>=(b)?((a)-(b)): (((p)-(b))+(a)))
119:
120: void C_DFT_FORE(ModNum *,int,int,int,ModNum *,
121: #ifdef POWA_STRIDE
122: int
123: #else
124: ModNum *,int,ModNum,double,ModNum *
125: #endif
126: );
127:
128: void C_DFT_BACK(ModNum *,int,int,int,ModNum *,
129: #ifdef POWA_STRIDE
130: int
131: #else
132: ModNum *,int,int,int,ModNum,ModNum,double,ModNum *
133: #endif
134: );
135:
136: void C_PREP_ALPHA(ModNum,int,int,int,ModNum *,ModNum,double);
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>