| 1 | #ifndef MODULOP_H |
|---|
| 2 | #define MODULOP_H |
|---|
| 3 | /**************************************** |
|---|
| 4 | * Computer Algebra System SINGULAR * |
|---|
| 5 | ****************************************/ |
|---|
| 6 | /* $Id: modulop.h,v 1.10 2000-03-02 18:44:39 Singular Exp $ */ |
|---|
| 7 | /* |
|---|
| 8 | * ABSTRACT: numbers modulo p (<=32003) |
|---|
| 9 | */ |
|---|
| 10 | #include "structs.h" |
|---|
| 11 | |
|---|
| 12 | extern int npPrimeM; |
|---|
| 13 | extern int npGen; |
|---|
| 14 | extern int npMapPrime; |
|---|
| 15 | |
|---|
| 16 | BOOLEAN npGreaterZero (number k); |
|---|
| 17 | number npMult (number a, number b); |
|---|
| 18 | number npInit (int i); |
|---|
| 19 | int npInt (number &n); |
|---|
| 20 | number npAdd (number a, number b); |
|---|
| 21 | number npSub (number a, number b); |
|---|
| 22 | void npPower (number a, int i, number * result); |
|---|
| 23 | BOOLEAN npIsZero (number a); |
|---|
| 24 | BOOLEAN npIsOne (number a); |
|---|
| 25 | BOOLEAN npIsMOne (number a); |
|---|
| 26 | number npDiv (number a, number b); |
|---|
| 27 | number npNeg (number c); |
|---|
| 28 | number npInvers (number c); |
|---|
| 29 | BOOLEAN npGreater (number a, number b); |
|---|
| 30 | BOOLEAN npEqual (number a, number b); |
|---|
| 31 | void npWrite (number &a); |
|---|
| 32 | char * npRead (char *s, number *a); |
|---|
| 33 | #ifdef LDEBUG |
|---|
| 34 | BOOLEAN npDBTest (number a, char *f, int l); |
|---|
| 35 | #endif |
|---|
| 36 | void npSetChar(int c); |
|---|
| 37 | //int npGetChar(); |
|---|
| 38 | |
|---|
| 39 | BOOLEAN npSetMap(ring r); |
|---|
| 40 | number npMapP(number from); |
|---|
| 41 | /*-------specials for spolys, do NOT use otherwise--------------------------*/ |
|---|
| 42 | /* for npMultM, npSubM, npNegM, npEqualM : */ |
|---|
| 43 | extern int npPminus1M; |
|---|
| 44 | extern CARDINAL *npExpTable; |
|---|
| 45 | extern CARDINAL *npLogTable; |
|---|
| 46 | |
|---|
| 47 | inline number npMultM(number a, number b) |
|---|
| 48 | { |
|---|
| 49 | int x = npLogTable[(int)a]+npLogTable[(int)b]; |
|---|
| 50 | return (number)npExpTable[x<npPminus1M ? x : x-npPminus1M]; |
|---|
| 51 | } |
|---|
| 52 | |
|---|
| 53 | #if 0 |
|---|
| 54 | inline number npAddAsm(number a, number b, int m) |
|---|
| 55 | { |
|---|
| 56 | number r; |
|---|
| 57 | asm ("addl %2, %1; cmpl %3, %1; jb 0f; subl %3, %1; 0:" |
|---|
| 58 | : "=&r" (r) |
|---|
| 59 | : "%0" (a), "g" (b), "g" (m) |
|---|
| 60 | : "cc"); |
|---|
| 61 | return r; |
|---|
| 62 | } |
|---|
| 63 | inline number npSubAsm(number a, number b, int m) |
|---|
| 64 | { |
|---|
| 65 | number r; |
|---|
| 66 | asm ("subl %2, %1; jnc 0f; addl %3, %1; 0:" |
|---|
| 67 | : "=&r" (r) |
|---|
| 68 | : "%0" (a), "g" (b), "g" (m) |
|---|
| 69 | : "cc"); |
|---|
| 70 | return r; |
|---|
| 71 | } |
|---|
| 72 | #endif |
|---|
| 73 | |
|---|
| 74 | inline number npAddM(number a, number b) |
|---|
| 75 | { |
|---|
| 76 | int r = (int)a + (int)b; |
|---|
| 77 | return (number)(r >= npPrimeM ? r - npPrimeM : r); |
|---|
| 78 | } |
|---|
| 79 | |
|---|
| 80 | inline BOOLEAN npIsZeroM (number a) |
|---|
| 81 | { |
|---|
| 82 | return 0 == (int)a; |
|---|
| 83 | } |
|---|
| 84 | |
|---|
| 85 | /* |
|---|
| 86 | *inline number npMultM(number a, number b) |
|---|
| 87 | *{ |
|---|
| 88 | * return (number)(((int)a*(int)b) % npPrimeM); |
|---|
| 89 | *} |
|---|
| 90 | */ |
|---|
| 91 | |
|---|
| 92 | #define npSubM(a,b) (number)((int)a<(int)b ?\ |
|---|
| 93 | npPrimeM-(int)b+(int)a : (int)a-(int)b) |
|---|
| 94 | |
|---|
| 95 | #define npNegM(A) (number)(npPrimeM-(int)(A)) |
|---|
| 96 | #define npEqualM(A,B) ((int)A==(int)B) |
|---|
| 97 | #define npIsZeroM(a) (0 == (int)a) |
|---|
| 98 | #endif |
|---|
| 99 | |
|---|
