Return to QM.c CVS log

Up to [local] / OpenXM_contrib2 / asir2018 / engine

Annotation of OpenXM_contrib2/asir2018/engine/QM.c, Revision 1.1

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:  *
        !            48:  * $OpenXM$
        !            49: */
        !            50: #include "ca.h"
        !            51:
        !            52: void addmq(m,n1,n2,nr)
        !            53: int m;
        !            54: MQ n1,n2,*nr;
        !            55: {
        !            56:   int a;
        !            57:
        !            58:   if ( !n1 )
        !            59:     *nr = n2;
        !            60:   else if ( !n2 )
        !            61:     *nr = n1;
        !            62:   else {
        !            63:     a = (CONT(n1) + CONT(n2)) % m; STOMQ(a,*nr);
        !            64:   }
        !            65: }
        !            66:
        !            67: void submq(m,n1,n2,nr)
        !            68: int m;
        !            69: MQ n1,n2,*nr;
        !            70: {
        !            71:   int a;
        !            72:
        !            73:   if ( !n1 ) {
        !            74:     a = (m - CONT(n2)) % m; STOMQ(a,*nr);
        !            75:   } else if ( !n2 )
        !            76:     *nr = n1;
        !            77:   else {
        !            78:     a = (CONT(n1) - CONT(n2) + m) % m; STOMQ(a,*nr);
        !            79:   }
        !            80: }
        !            81:
        !            82: void mulmq(m,n1,n2,nr)
        !            83: int m;
        !            84: MQ n1,n2,*nr;
        !            85: {
        !            86:   int a,b;
        !            87:
        !            88:   if ( !n1 || !n2 )
        !            89:     *nr = 0;
        !            90:   else {
        !            91:     a = dmb(m,CONT(n1),CONT(n2),&b); STOMQ(a,*nr);
        !            92:   }
        !            93: }
        !            94:
        !            95: void divmq(m,n1,n2,nq)
        !            96: int m;
        !            97: MQ n1,n2,*nq;
        !            98: {
        !            99:   int a,b;
        !           100:
        !           101:   if ( !n2 )
        !           102:     error("divmq : division by 0");
        !           103:   else if ( !n1 )
        !           104:     *nq = 0;
        !           105:   else if ( n1 == n2 )
        !           106:     *nq = ONEM;
        !           107:   else {
        !           108:     a = dmb(m,CONT(n1),invm(CONT(n2),m),&b); STOMQ(a,*nq);
        !           109:   }
        !           110: }
        !           111:
        !           112: void invmq(m,n1,nq)
        !           113: int m;
        !           114: MQ n1,*nq;
        !           115: {
        !           116:   int a;
        !           117:
        !           118:   if ( !n1 )
        !           119:     error("invmq : division by 0");
        !           120:   else {
        !           121:     a = invm(CONT(n1),m); STOMQ(a,*nq);
        !           122:   }
        !           123: }
        !           124:
        !           125: void pwrmq(m,n1,n,nr)
        !           126: int m;
        !           127: MQ n1;
        !           128: Q n;
        !           129: MQ *nr;
        !           130: {
        !           131:   int a;
        !           132:
        !           133:   if ( n == 0 )
        !           134:     *nr = ONEM;
        !           135:   else if ( !n1 )
        !           136:     *nr = 0;
        !           137:   else {
        !           138:     a = pwrm(m,CONT(n1),QTOS(n)); STOMQ(a,*nr);
        !           139:   }
        !           140: }
        !           141:
        !           142: void mkbcm(m,n,t)
        !           143: int m,n;
        !           144: MQ *t;
        !           145: {
        !           146:   int i,j;
        !           147:   int *a,*b,*c;
        !           148:
        !           149:   W_CALLOC(n,int,a); W_CALLOC(n,int,b);
        !           150:   for ( i = 1, a[0] = 1; i <= n; i++ ) {
        !           151:     for ( j = 1, b[0] = b[i] = 1; j < i; j++ )
        !           152:       b[j] = (a[j-1] + a[j]) % m;
        !           153:     c = a; a = b; b = c;
        !           154:   }
        !           155:   for ( i = 0; i <= n; i++ )
        !           156:     STOMQ(a[i],t[i]);
        !           157: }