Annotation of OpenXM_contrib2/asir2000/include/b.h, Revision 1.4
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
1.3 noro 26: * e-mail at risa-admin@sec.flab.fujitsu.co.jp of the detailed specification
1.2 noro 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.4 ! ohara 48: * $OpenXM: OpenXM_contrib2/asir2000/include/b.h,v 1.3 2000/08/22 05:04:14 noro Exp $
1.2 noro 49: */
1.1 noro 50: #ifdef FBASE
51: #define D_ADDP(x,y,z,u) addp(x,y,z,u)
52: #define D_SUBP(x,y,z,u) subp(x,y,z,u)
53: #define D_MULP(x,y,z,u) mulp(x,y,z,u)
54: #define D_PWRP(x,y,z,u) pwrp(x,y,z,u)
55: #define D_DIVSRP(x,y,z,u,v) divsrp(x,y,z,u,v)
56: #define D_DIVSRDCP(x,y,z,u,v) divsrdcp(x,y,z,u,v)
57: #define D_DIVSP(x,y,z,u) divsp(x,y,z,u)
58: #define D_DIVSDCP(x,y,z,u) divsdcp(x,y,z,u)
59: #define D_CHSGNP(x,y) chsgnp(x,y)
60: #define D_ADDPQ(x,y,z) addpq(x,y,z)
61: #define D_ADDPTOC(x,y,z,u) addptoc(x,y,z,u)
62: #define D_MULPQ(x,y,z) mulpq(x,y,z)
63: #define D_MULPC(x,y,z,u) mulpc(x,y,z,u)
64:
65: #define ADDP(x,y,z,u) addp(x,y,z,u)
66: #define SUBP(x,y,z,u) subp(x,y,z,u)
67: #define MULP(x,y,z,u) mulp(x,y,z,u)
68: #define PWRP(x,y,z,u) pwrp(x,y,z,u)
69: #define DIVSRP(x,y,z,u,v) divsrp(x,y,z,u,v)
70: #define DIVSRDCP(x,y,z,u,v) divsrdcp(x,y,z,u,v)
71: #define DIVSP(x,y,z,u) divsp(x,y,z,u)
72: #define DIVSDCP(x,y,z,u) divsdcp(x,y,z,u)
73: #define CHSGNP(x,y) chsgnp(x,y)
74: #define ADDPQ(x,y,z) addpq(x,y,z)
75: #define ADDPTOC(x,y,z,u) addptoc(x,y,z,u)
76: #define MULPQ(x,y,z) mulpq(x,y,z)
77: #define MULPC(x,y,z,u) mulpc(x,y,z,u)
78: #define ADDNUM(x,y,z) (*addnumt[MAX(NID((Q)x),NID((Q)y))])(x,y,z)
79: #define SUBNUM(x,y,z) (*subnumt[MAX(NID((Q)x),NID((Q)y))])(x,y,z)
80: #define MULNUM(x,y,z) (*mulnumt[MAX(NID((Q)x),NID((Q)y))])(x,y,z)
81: #define DIVNUM(x,y,z) (*divnumt[MAX(NID((Q)x),NID((Q)y))])(x,y,z)
82: #define PWRNUM(x,y,z) (*pwrnumt[NID((Q)x)])(x,y,z)
1.4 ! ohara 83: #define CHSGNNUM(x,y) { \
! 84: if (NID((Q)x)==N_Q) { \
! 85: Q t; DUPQ((Q)(x),t); SGN((Q)t)= -SGN(t); (y)= t; } \
! 86: else if (NID((Q)x)==N_R) { \
! 87: Real t; NEWReal(t); BDY(t)= -BDY((Real)x); (y) = t; } \
! 88: else {P t; (*chsgnnumt[NID((Q)x)])(x,&t); (y) = t; } }
1.1 noro 89: #define ADDQ(x,y,z) addq(x,y,z)
90: #define SUBQ(x,y,z) subq(x,y,z)
91: #define MULQ(x,y,z) mulq(x,y,z)
92: #define DIVQ(x,y,z) divq(x,y,z)
93: #define PWRQ(x,y,z) pwrq(x,y,z)
94: #define INVQ(x,y) invq(x,y)
95: #define REMQ(x,y,z) remq(x,y,z)
96: #define CMPQ(x,y) cmpq(x,y)
97: #define MKBC(x,y) mkbc(x,(Q *)y)
98:
99: #define One ONE
100: #define Uniq(x) UNIQ((Q)x)
101: #define Base BASE
102: #define Dm(x,y,z,u) DM(x,y,z,u)
103: #define Dma(x,y,z,u,v,w) DMA(x,y,z,u,v,w)
104: #endif
105:
106: #ifdef MODULAR
107: #define D_ADDP(x,y,z,u) addmp(x,mod,y,z,u) int mod;
108: #define D_SUBP(x,y,z,u) submp(x,mod,y,z,u) int mod;
109: #define D_MULP(x,y,z,u) mulmp(x,mod,y,z,u) int mod;
110: #define D_PWRP(x,y,z,u) pwrmp(x,mod,y,z,u) int mod;
111: #define D_DIVSRP(x,y,z,u,v) divsrmp(x,mod,y,z,u,v) int mod;
112: #define D_DIVSRDCP(x,y,z,u,v) divsrdcmp(x,mod,y,z,u,v) int mod;
113: #define D_DIVSP(x,y,z,u) divsmp(x,mod,y,z,u) int mod;
114: #define D_DIVSDCP(x,y,z,u) divsdcmp(x,mod,y,z,u) int mod;
115: #define D_CHSGNP(x,y) chsgnmp(mod,x,y) int mod;
116: #define D_ADDPQ(x,y,z) addmpq(mod,x,y,z) int mod;
117: #define D_ADDPTOC(x,y,z,u) addmptoc(x,mod,y,z,u) int mod;
118: #define D_MULPQ(x,y,z) mulmpq(mod,x,y,z) int mod;
119: #define D_MULPC(x,y,z,u) mulmpc(x,mod,y,z,u) int mod;
120:
121: #define ADDP(x,y,z,u) addmp(x,mod,y,z,u)
122: #define SUBP(x,y,z,u) submp(x,mod,y,z,u)
123: #define MULP(x,y,z,u) mulmp(x,mod,y,z,u)
124: #define PWRP(x,y,z,u) pwrmp(x,mod,y,z,u)
125: #define DIVSRP(x,y,z,u,v) divsrmp(x,mod,y,z,u,v)
126: #define DIVSRDCP(x,y,z,u,v) divsrdcmp(x,mod,y,z,u,v)
127: #define DIVSP(x,y,z,u) divsmp(x,mod,y,z,u)
128: #define DIVSDCP(x,y,z,u) divsdcmp(x,mod,y,z,u)
129: #define CHSGNP(x,y) chsgnmp(mod,x,y)
130: #define ADDPQ(x,y,z) addmpq(mod,x,y,z)
131: #define ADDPTOC(x,y,z,u) addmptoc(x,mod,y,z,u)
132: #define MULPQ(x,y,z) mulmpq(mod,x,y,z)
133: #define MULPC(x,y,z,u) mulmpc(x,mod,y,z,u)
134: #define ADDNUM(x,y,z) addmq(mod,(MQ)x,(MQ)y,(MQ *)z)
135: #define SUBNUM(x,y,z) submq(mod,(MQ)x,(MQ)y,(MQ *)z)
136: #define MULNUM(x,y,z) mulmq(mod,(MQ)x,(MQ)y,(MQ *)z)
137: #define DIVNUM(x,y,z) divmq(mod,(MQ)x,(MQ)y,(MQ *)z)
138: #define PWRNUM(x,y,z) pwrmq(mod,(MQ)x,y,(MQ *)z)
1.4 ! ohara 139: #define CHSGNNUM(x,y) {MQ t; NEWMQ(t),CONT(t)=mod-CONT((MQ)(x)); (y)=t; }
1.1 noro 140: #define ADDQ(x,y,z) addmq(mod,x,y,z)
141: #define SUBQ(x,y,z) submq(mod,x,y,z)
142: #define MULQ(x,y,z) mulmq(mod,x,y,z)
143: #define DIVQ(x,y,z) divmq(mod,x,y,z)
144: #define PWRQ(x,y,z) pwrmq(mod,x,y,z)
145: #define MKBC(x,y) mkbcm(mod,x,(MQ *)y)
146:
147: #define One ONEM
148: #define Uniq(x) UNIMQ((MQ)x)
149: #endif
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>
![[BACK]](/icons/cvsweb/back.gif){kind=icon}
Return to b.h CVS log ![[TXT]](/icons/cvsweb/text.gif){kind=icon}
![[DIR]](/icons/cvsweb/dir.gif){kind=icon}
Up to [local] / OpenXM_contrib2 / asir2000 / include