[35aab3] | 1 | /***************************************** |
---|
| 2 | * Computer Algebra System SINGULAR * |
---|
| 3 | *****************************************/ |
---|
[341696] | 4 | /* $Id$ */ |
---|
[35aab3] | 5 | |
---|
| 6 | /* |
---|
| 7 | * ABSTRACT: interface to coefficient aritmetics |
---|
| 8 | */ |
---|
| 9 | |
---|
| 10 | #include <string.h> |
---|
| 11 | #include <stdlib.h> |
---|
[599326] | 12 | #include <kernel/mod2.h> |
---|
| 13 | #include <kernel/structs.h> |
---|
| 14 | #include <kernel/febase.h> |
---|
| 15 | #include <kernel/kstd1.h> |
---|
| 16 | #include <kernel/numbers.h> |
---|
| 17 | #include <kernel/longrat.h> |
---|
| 18 | #include <kernel/longalg.h> |
---|
[b46956] | 19 | #include <kernel/longtrans.h> |
---|
[599326] | 20 | #include <kernel/modulop.h> |
---|
| 21 | #include <kernel/gnumpfl.h> |
---|
| 22 | #include <kernel/gnumpc.h> |
---|
| 23 | #include <kernel/ring.h> |
---|
| 24 | #include <kernel/ffields.h> |
---|
| 25 | #include <kernel/shortfl.h> |
---|
[c90b43] | 26 | #ifdef HAVE_RINGS |
---|
[599326] | 27 | #include <kernel/rmodulo2m.h> |
---|
| 28 | #include <kernel/rmodulon.h> |
---|
| 29 | #include <kernel/rintegers.h> |
---|
[3c3880b] | 30 | |
---|
| 31 | extern omBin gmp_nrz_bin; |
---|
[1e579c6] | 32 | #endif |
---|
[35aab3] | 33 | |
---|
| 34 | //static int characteristic = 0; |
---|
| 35 | extern int IsPrime(int p); |
---|
| 36 | |
---|
[a48078] | 37 | number (*nInit_bigint)(number i); |
---|
[35aab3] | 38 | number (*nPar)(int i); |
---|
| 39 | int (*nParDeg)(number n); |
---|
| 40 | int (*nSize)(number n); |
---|
[cf74cd6] | 41 | int (*n_Int)(number &n, const ring r); |
---|
[35aab3] | 42 | numberfunc nMult, nSub, nAdd, nDiv, nIntDiv, nIntMod, nExactDiv; |
---|
| 43 | number (*nNeg)(number a); |
---|
| 44 | number (*nInvers)(number a); |
---|
| 45 | void (*nNormalize)(number &a); |
---|
| 46 | number (*nCopy)(number a); |
---|
| 47 | number (*nRePart)(number a); |
---|
| 48 | number (*nImPart)(number a); |
---|
[009d80] | 49 | #ifdef HAVE_RINGS |
---|
| 50 | BOOLEAN (*nDivBy)(number a,number b); |
---|
[d351d8] | 51 | int (*nDivComp)(number a,number b); |
---|
[1e579c6] | 52 | BOOLEAN (*nIsUnit)(number a); |
---|
| 53 | number (*nGetUnit)(number a); |
---|
| 54 | number (*nExtGcd)(number a, number b, number *s, number *t); |
---|
[009d80] | 55 | #endif |
---|
[35aab3] | 56 | BOOLEAN (*nGreater)(number a,number b); |
---|
| 57 | BOOLEAN (*nEqual)(number a,number b); |
---|
| 58 | BOOLEAN (*nIsZero)(number a); |
---|
| 59 | BOOLEAN (*nIsOne)(number a); |
---|
| 60 | BOOLEAN (*nIsMOne)(number a); |
---|
| 61 | BOOLEAN (*nGreaterZero)(number a); |
---|
[85e68dd] | 62 | const char* (*nRead)(const char *s,number *a); |
---|
[35aab3] | 63 | void (*nPower)(number a, int i, number * result); |
---|
| 64 | number (*nGcd)(number a, number b, const ring r); |
---|
| 65 | number (*nLcm)(number a, number b, const ring r); |
---|
| 66 | char * (*nName)(number n); |
---|
| 67 | |
---|
| 68 | /*0 implementation*/ |
---|
| 69 | number nNULL; /* the 0 as constant */ |
---|
| 70 | |
---|
| 71 | n_Procs_s *cf_root=NULL; |
---|
| 72 | |
---|
[b19a41d] | 73 | void nNew(number* d) { *d=NULL; } |
---|
[35aab3] | 74 | void ndDelete(number* d, const ring r) { *d=NULL; } |
---|
| 75 | void ndInpMult(number &a, number b, const ring r) |
---|
| 76 | { |
---|
| 77 | number n=n_Mult(a,b,r); |
---|
| 78 | n_Delete(&a,r); |
---|
| 79 | a=n; |
---|
| 80 | } |
---|
[e8a0aa] | 81 | number ndInpAdd(number &a, number b, const ring r) |
---|
| 82 | { |
---|
| 83 | number n=n_Add(a,b,r); |
---|
| 84 | n_Delete(&a,r); |
---|
| 85 | a=n; |
---|
| 86 | return a; |
---|
| 87 | } |
---|
[35aab3] | 88 | |
---|
| 89 | #ifdef LDEBUG |
---|
| 90 | void nDBDummy1(number* d,char *f, int l) { *d=NULL; } |
---|
[85e68dd] | 91 | BOOLEAN ndDBTest(number a, const char *f, const int l) |
---|
| 92 | { |
---|
| 93 | return TRUE; |
---|
| 94 | } |
---|
[35aab3] | 95 | #endif |
---|
| 96 | |
---|
| 97 | void nDummy2(number& d) { } |
---|
| 98 | |
---|
| 99 | char * ndName(number n) { return NULL; } |
---|
| 100 | |
---|
| 101 | number ndPar(int i) { return nInit(0); } |
---|
| 102 | |
---|
| 103 | number ndReturn0(number n) { return nInit(0); } |
---|
| 104 | |
---|
| 105 | int ndParDeg(number n) { return 0; } |
---|
| 106 | |
---|
[8391d8] | 107 | number ndGcd(number a, number b, const ring r) { return n_Init(1,r); } |
---|
[35aab3] | 108 | |
---|
| 109 | number ndIntMod(number a, number b) { return nInit(0); } |
---|
| 110 | |
---|
| 111 | number ndGetDenom(number &n, const ring r) { return n_Init(1,r); } |
---|
[e803ec] | 112 | number ndGetNumerator(number &a,const ring r) { return r->cf->nCopy(a); } |
---|
[35aab3] | 113 | |
---|
| 114 | int ndSize(number a) { return (int)nIsZero(a)==FALSE; } |
---|
| 115 | |
---|
| 116 | number ndCopy(number a) { return a; } |
---|
| 117 | number nd_Copy(number a,const ring r) { return r->cf->nCopy(a); } |
---|
| 118 | |
---|
[009d80] | 119 | #ifdef HAVE_RINGS |
---|
[93ebe1] | 120 | BOOLEAN ndDivBy(number a, number b) { return TRUE; } // assume a,b !=0 |
---|
[91d286] | 121 | int ndDivComp(number a, number b) { return 2; } |
---|
[93ebe1] | 122 | BOOLEAN ndIsUnit(number a) { return !nIsZero(a); } |
---|
[1e579c6] | 123 | number ndExtGcd (number a, number b, number *s, number *t) { return nInit(1); } |
---|
[009d80] | 124 | #endif |
---|
| 125 | |
---|
[35aab3] | 126 | /*2 |
---|
| 127 | * init operations for characteristic c (complete==TRUE) |
---|
| 128 | * init nDelete for characteristic c (complete==FALSE) |
---|
| 129 | */ |
---|
| 130 | void nSetChar(ring r) |
---|
| 131 | { |
---|
| 132 | int c=rInternalChar(r); |
---|
| 133 | |
---|
[0b8bf7] | 134 | /*--------------------- Q -----------------*/ |
---|
| 135 | if (rField_is_Q(r)) |
---|
| 136 | { |
---|
| 137 | nInit_bigint=nlCopy; |
---|
| 138 | } |
---|
| 139 | /*--------------------- Q_a/ Zp_a -----------------*/ |
---|
| 140 | else if (rField_is_Extension(r)) |
---|
[35aab3] | 141 | { |
---|
[661c214] | 142 | if (r->minpoly != NULL) |
---|
[b46956] | 143 | { |
---|
| 144 | naSetChar(c,r); |
---|
| 145 | if (rField_is_Q_a()) nInit_bigint=naMap00; |
---|
| 146 | if (rField_is_Zp_a()) nInit_bigint=naMap0P; |
---|
| 147 | } |
---|
| 148 | else |
---|
| 149 | { |
---|
| 150 | ntSetChar(c,r); |
---|
| 151 | if (rField_is_Q_a()) nInit_bigint=ntMap00; |
---|
| 152 | if (rField_is_Zp_a()) nInit_bigint=ntMap0P; |
---|
| 153 | } |
---|
[35aab3] | 154 | } |
---|
[c90b43] | 155 | #ifdef HAVE_RINGS |
---|
[585bbcb] | 156 | /*----------------------ring Z / 2^m----------------*/ |
---|
| 157 | else if (rField_is_Ring_2toM(r)) |
---|
| 158 | { |
---|
| 159 | nr2mSetExp(c, r); |
---|
[a48078] | 160 | nInit_bigint=nr2mMapQ; |
---|
[585bbcb] | 161 | } |
---|
[1e579c6] | 162 | /*----------------------ring Z / 2^m----------------*/ |
---|
| 163 | else if (rField_is_Ring_Z(r)) |
---|
| 164 | { |
---|
| 165 | nrzSetExp(c, r); |
---|
[a48078] | 166 | nInit_bigint=nrzMapQ; |
---|
[1e579c6] | 167 | } |
---|
[994445] | 168 | /*----------------------ring Z / n----------------*/ |
---|
| 169 | else if (rField_is_Ring_ModN(r)) |
---|
| 170 | { |
---|
| 171 | nrnSetExp(c, r); |
---|
[a48078] | 172 | nInit_bigint=nrnMapQ; |
---|
[994445] | 173 | } |
---|
[12ea9d] | 174 | /*----------------------ring Z / n----------------*/ |
---|
| 175 | else if (rField_is_Ring_PtoM(r)) |
---|
| 176 | { |
---|
| 177 | nrnSetExp(c, r); |
---|
[a48078] | 178 | nInit_bigint=nrnMapQ; |
---|
[12ea9d] | 179 | } |
---|
[994445] | 180 | #endif |
---|
[35aab3] | 181 | else if (rField_is_Zp(r)) |
---|
| 182 | /*----------------------char. p----------------*/ |
---|
| 183 | { |
---|
| 184 | npSetChar(c, r); |
---|
[a48078] | 185 | nInit_bigint=npMap0; |
---|
[35aab3] | 186 | } |
---|
| 187 | /* -------------- GF(p^m) -----------------------*/ |
---|
| 188 | else if (rField_is_GF(r)) |
---|
| 189 | { |
---|
| 190 | nfSetChar(c,r->parameter); |
---|
[a48078] | 191 | nInit_bigint=ndReturn0; // not impl. |
---|
[35aab3] | 192 | } |
---|
| 193 | /* -------------- R -----------------------*/ |
---|
| 194 | //if (c==(-1)) |
---|
| 195 | else if (rField_is_R(r)) |
---|
| 196 | { |
---|
[a48078] | 197 | nInit_bigint=nrMapQ; |
---|
[35aab3] | 198 | } |
---|
| 199 | /* -------------- long R -----------------------*/ |
---|
| 200 | /* -------------- long C -----------------------*/ |
---|
| 201 | else if ((rField_is_long_R(r)) |
---|
| 202 | || (rField_is_long_C(r))) |
---|
| 203 | { |
---|
| 204 | setGMPFloatDigits(r->float_len,r->float_len2); |
---|
[a48078] | 205 | if (rField_is_long_R(r)) nInit_bigint=ngfMapQ; |
---|
| 206 | else nInit_bigint=ngcMapQ; |
---|
[35aab3] | 207 | } |
---|
| 208 | #ifdef TEST |
---|
| 209 | /* -------------- R -----------------------*/ |
---|
| 210 | //if (c==(-1)) |
---|
| 211 | else if (!rField_is_R(r) && !rField_is_Q(r)) |
---|
| 212 | { |
---|
| 213 | WerrorS("unknown field"); |
---|
| 214 | } |
---|
| 215 | #endif |
---|
| 216 | nNormalize=r->cf->nNormalize; |
---|
| 217 | nPar = r->cf->nPar; |
---|
| 218 | nParDeg= r->cf->nParDeg; |
---|
[cf74cd6] | 219 | n_Int = r->cf->n_Int; |
---|
[35aab3] | 220 | nAdd = r->cf->nAdd; |
---|
| 221 | nSub = r->cf->nSub; |
---|
| 222 | nMult = r->cf->nMult; |
---|
| 223 | nDiv = r->cf->nDiv; |
---|
| 224 | nExactDiv= r->cf->nExactDiv; |
---|
| 225 | nIntDiv= r->cf->nIntDiv; |
---|
| 226 | nIntMod= r->cf->nIntMod; |
---|
| 227 | nNeg = r->cf->nNeg; |
---|
| 228 | nInvers= r->cf->nInvers; |
---|
| 229 | nCopy = r->cf->nCopy; |
---|
[009d80] | 230 | #ifdef HAVE_RINGS |
---|
[d351d8] | 231 | nDivComp = r->cf->nDivComp; |
---|
[009d80] | 232 | nDivBy = r->cf->nDivBy; |
---|
[1e579c6] | 233 | nIsUnit = r->cf->nIsUnit; |
---|
| 234 | nGetUnit = r->cf->nGetUnit; |
---|
| 235 | nExtGcd = r->cf->nExtGcd; |
---|
[009d80] | 236 | #endif |
---|
[35aab3] | 237 | nGreater = r->cf->nGreater; |
---|
| 238 | nEqual = r->cf->nEqual; |
---|
| 239 | nIsZero = r->cf->nIsZero; |
---|
| 240 | nIsOne = r->cf->nIsOne; |
---|
| 241 | nIsMOne = r->cf->nIsMOne; |
---|
| 242 | nGreaterZero = r->cf->nGreaterZero; |
---|
| 243 | nRead = r->cf->nRead; |
---|
| 244 | nPower = r->cf->nPower; |
---|
| 245 | nGcd = r->cf->nGcd; |
---|
| 246 | nLcm = r->cf->nLcm; |
---|
| 247 | nName= r->cf->nName; |
---|
| 248 | nSize = r->cf->nSize; |
---|
| 249 | nRePart = r->cf->nRePart; |
---|
| 250 | nImPart = r->cf->nImPart; |
---|
[d257ae] | 251 | nNULL=r->cf->nNULL; |
---|
[35aab3] | 252 | } |
---|
| 253 | |
---|
| 254 | /*2 |
---|
| 255 | * init operations for ring r |
---|
| 256 | */ |
---|
| 257 | void nInitChar(ring r) |
---|
| 258 | { |
---|
| 259 | int c=rInternalChar(r); |
---|
| 260 | n_coeffType t=rFieldType(r); |
---|
| 261 | |
---|
| 262 | if (rField_is_Extension(r)) |
---|
| 263 | { |
---|
| 264 | if (r->algring==NULL) |
---|
| 265 | { |
---|
| 266 | int ch=-c; |
---|
| 267 | if (c==1) ch=0; |
---|
| 268 | r->algring=(ring) rDefault(ch,r->P,r->parameter); |
---|
| 269 | //r->algring->ShortOut=r->ShortOut; |
---|
| 270 | // includes: nInitChar(r->algring); |
---|
| 271 | } |
---|
| 272 | } |
---|
| 273 | |
---|
| 274 | n_Procs_s *n=cf_root; |
---|
| 275 | while((n!=NULL) |
---|
| 276 | && ((n->nChar!=c) || (n->type!=t))) |
---|
| 277 | n=n->next; |
---|
| 278 | if (n==NULL) |
---|
| 279 | { |
---|
| 280 | n=(n_Procs_s*)omAlloc0(sizeof(n_Procs_s)); |
---|
| 281 | n->next=cf_root; |
---|
| 282 | n->ref=1; |
---|
| 283 | n->nChar=c; |
---|
| 284 | n->type=t; |
---|
| 285 | cf_root=n; |
---|
| 286 | } |
---|
| 287 | else if ((n->nChar==c) && (n->type==t)) |
---|
| 288 | { |
---|
| 289 | n->ref++; |
---|
| 290 | r->cf=n; |
---|
| 291 | return; |
---|
| 292 | } |
---|
| 293 | else |
---|
| 294 | { |
---|
| 295 | WerrorS("nInitChar failed"); |
---|
| 296 | return; |
---|
| 297 | } |
---|
| 298 | r->cf=n; |
---|
| 299 | n->nChar = c; |
---|
| 300 | n->nPar = ndPar; |
---|
| 301 | n->nParDeg=ndParDeg; |
---|
| 302 | n->nSize = ndSize; |
---|
[e803ec] | 303 | n->cfGetDenom= ndGetDenom; |
---|
| 304 | n->cfGetNumerator= ndGetNumerator; |
---|
[35aab3] | 305 | n->nName = ndName; |
---|
| 306 | n->nImPart=ndReturn0; |
---|
| 307 | n->cfDelete= ndDelete; |
---|
| 308 | n->nInpMult=ndInpMult; |
---|
| 309 | n->cfCopy=nd_Copy; |
---|
| 310 | n->nIntMod=ndIntMod; /* dummy !! */ |
---|
| 311 | n->nNormalize=nDummy2; |
---|
| 312 | n->nGcd = ndGcd; |
---|
| 313 | n->nLcm = ndGcd; /* tricky, isn't it ?*/ |
---|
[009d80] | 314 | #ifdef HAVE_RINGS |
---|
[d351d8] | 315 | n->nDivComp = ndDivComp; |
---|
[009d80] | 316 | n->nDivBy = ndDivBy; |
---|
[1e579c6] | 317 | n->nIsUnit = ndIsUnit; |
---|
| 318 | n->nExtGcd = ndExtGcd; |
---|
[50be61] | 319 | n->nGetUnit = (nMapFunc)NULL; |
---|
[009d80] | 320 | #endif |
---|
[35aab3] | 321 | if (rField_is_Extension(r)) |
---|
| 322 | { |
---|
[661c214] | 323 | //ntInitChar(c,TRUE,r); |
---|
| 324 | n->cfDelete = ntDelete; |
---|
| 325 | n->nNormalize = ntNormalize; |
---|
| 326 | n->cfInit = ntInit; |
---|
| 327 | n->nPar = ntPar; |
---|
| 328 | n->nParDeg = ntParDeg; |
---|
| 329 | n->n_Int = ntInt; |
---|
| 330 | n->nAdd = ntAdd; |
---|
| 331 | n->nSub = ntSub; |
---|
| 332 | n->nMult = ntMult; |
---|
| 333 | n->nDiv = ntDiv; |
---|
| 334 | n->nExactDiv = ntDiv; |
---|
| 335 | n->nIntDiv = ntIntDiv; |
---|
| 336 | n->nNeg = ntNeg; |
---|
| 337 | n->nInvers = ntInvers; |
---|
| 338 | n->nCopy = ntCopy; |
---|
| 339 | n->cfCopy = nt_Copy; |
---|
| 340 | n->nGreater = ntGreater; |
---|
| 341 | n->nEqual = ntEqual; |
---|
| 342 | n->nIsZero = ntIsZero; |
---|
| 343 | n->nIsOne = ntIsOne; |
---|
| 344 | n->nIsMOne = ntIsMOne; |
---|
| 345 | n->nGreaterZero = ntGreaterZero; |
---|
| 346 | n->cfWrite = ntWrite; |
---|
| 347 | n->nRead = ntRead; |
---|
| 348 | n->nPower = ntPower; |
---|
| 349 | n->nGcd = ntGcd; |
---|
| 350 | n->nLcm = ntLcm; |
---|
| 351 | n->cfSetMap = ntSetMap; |
---|
| 352 | n->nName = ntName; |
---|
| 353 | n->nSize = ntSize; |
---|
| 354 | n->cfGetDenom = napGetDenom; |
---|
| 355 | n->cfGetNumerator = napGetNumerator; |
---|
[35aab3] | 356 | #ifdef LDEBUG |
---|
[661c214] | 357 | n->nDBTest = ntDBTest; |
---|
[35aab3] | 358 | #endif |
---|
| 359 | } |
---|
[c90b43] | 360 | #ifdef HAVE_RINGS |
---|
[585bbcb] | 361 | /* -------------- Z/2^m ----------------------- */ |
---|
| 362 | else if (rField_is_Ring_2toM(r)) |
---|
| 363 | { |
---|
| 364 | nr2mInitExp(c,r); |
---|
[8391d8] | 365 | n->cfInit = nr2mInit; |
---|
[585bbcb] | 366 | n->nCopy = ndCopy; |
---|
[cf74cd6] | 367 | n->n_Int = nr2mInt; |
---|
[585bbcb] | 368 | n->nAdd = nr2mAdd; |
---|
| 369 | n->nSub = nr2mSub; |
---|
| 370 | n->nMult = nr2mMult; |
---|
| 371 | n->nDiv = nr2mDiv; |
---|
[f92547] | 372 | n->nIntDiv = nr2mIntDiv; |
---|
[6ea941] | 373 | n->nIntMod=nr2mMod; |
---|
[585bbcb] | 374 | n->nExactDiv= nr2mDiv; |
---|
| 375 | n->nNeg = nr2mNeg; |
---|
| 376 | n->nInvers= nr2mInvers; |
---|
[009d80] | 377 | n->nDivBy = nr2mDivBy; |
---|
[d351d8] | 378 | n->nDivComp = nr2mDivComp; |
---|
[585bbcb] | 379 | n->nGreater = nr2mGreater; |
---|
| 380 | n->nEqual = nr2mEqual; |
---|
| 381 | n->nIsZero = nr2mIsZero; |
---|
| 382 | n->nIsOne = nr2mIsOne; |
---|
| 383 | n->nIsMOne = nr2mIsMOne; |
---|
| 384 | n->nGreaterZero = nr2mGreaterZero; |
---|
[493225] | 385 | n->cfWrite = nr2mWrite; |
---|
[585bbcb] | 386 | n->nRead = nr2mRead; |
---|
| 387 | n->nPower = nr2mPower; |
---|
| 388 | n->cfSetMap = nr2mSetMap; |
---|
| 389 | n->nNormalize = nDummy2; |
---|
[f92547] | 390 | n->nLcm = nr2mLcm; |
---|
| 391 | n->nGcd = nr2mGcd; |
---|
[1e579c6] | 392 | n->nIsUnit = nr2mIsUnit; |
---|
| 393 | n->nGetUnit = nr2mGetUnit; |
---|
| 394 | n->nExtGcd = nr2mExtGcd; |
---|
[585bbcb] | 395 | n->nName= ndName; |
---|
| 396 | #ifdef LDEBUG |
---|
[3332cc6] | 397 | n->nDBTest=nr2mDBTest; |
---|
[994445] | 398 | #endif |
---|
| 399 | } |
---|
| 400 | /* -------------- Z/n ----------------------- */ |
---|
[12ea9d] | 401 | else if (rField_is_Ring_ModN(r) || rField_is_Ring_PtoM(r) |
---|
| 402 | ) |
---|
[994445] | 403 | { |
---|
| 404 | nrnInitExp(c,r); |
---|
[8391d8] | 405 | n->cfInit = nrnInit; |
---|
[bac8611] | 406 | n->cfDelete= nrnDelete; |
---|
| 407 | n->nCopy = nrnCopy; |
---|
| 408 | n->cfCopy = cfrnCopy; |
---|
| 409 | n->nSize = nrnSize; |
---|
[cf74cd6] | 410 | n->n_Int = nrnInt; |
---|
[994445] | 411 | n->nAdd = nrnAdd; |
---|
| 412 | n->nSub = nrnSub; |
---|
| 413 | n->nMult = nrnMult; |
---|
| 414 | n->nDiv = nrnDiv; |
---|
[bac8611] | 415 | n->nIntDiv= nrnIntDiv; |
---|
[6ea941] | 416 | n->nIntMod= nrnMod; |
---|
[994445] | 417 | n->nExactDiv= nrnDiv; |
---|
| 418 | n->nNeg = nrnNeg; |
---|
| 419 | n->nInvers= nrnInvers; |
---|
[009d80] | 420 | n->nDivBy = nrnDivBy; |
---|
[d351d8] | 421 | n->nDivComp = nrnDivComp; |
---|
[994445] | 422 | n->nGreater = nrnGreater; |
---|
| 423 | n->nEqual = nrnEqual; |
---|
| 424 | n->nIsZero = nrnIsZero; |
---|
| 425 | n->nIsOne = nrnIsOne; |
---|
| 426 | n->nIsMOne = nrnIsMOne; |
---|
| 427 | n->nGreaterZero = nrnGreaterZero; |
---|
[493225] | 428 | n->cfWrite = nrnWrite; |
---|
[994445] | 429 | n->nRead = nrnRead; |
---|
| 430 | n->nPower = nrnPower; |
---|
| 431 | n->cfSetMap = nrnSetMap; |
---|
| 432 | n->nNormalize = nDummy2; |
---|
| 433 | n->nLcm = nrnLcm; |
---|
| 434 | n->nGcd = nrnGcd; |
---|
[1e579c6] | 435 | n->nIsUnit = nrnIsUnit; |
---|
| 436 | n->nGetUnit = nrnGetUnit; |
---|
| 437 | n->nExtGcd = nrnExtGcd; |
---|
[994445] | 438 | n->nName= ndName; |
---|
| 439 | #ifdef LDEBUG |
---|
[3332cc6] | 440 | n->nDBTest=nrnDBTest; |
---|
[585bbcb] | 441 | #endif |
---|
| 442 | } |
---|
[1e579c6] | 443 | /* -------------- Z ----------------------- */ |
---|
| 444 | else if (rField_is_Ring_Z(r)) |
---|
| 445 | { |
---|
[8391d8] | 446 | n->cfInit = nrzInit; |
---|
[bac8611] | 447 | n->cfDelete= nrzDelete; |
---|
| 448 | n->nCopy = nrzCopy; |
---|
| 449 | n->cfCopy = cfrzCopy; |
---|
| 450 | n->nSize = nrzSize; |
---|
[cf74cd6] | 451 | n->n_Int = nrzInt; |
---|
[1e579c6] | 452 | n->nAdd = nrzAdd; |
---|
| 453 | n->nSub = nrzSub; |
---|
| 454 | n->nMult = nrzMult; |
---|
| 455 | n->nDiv = nrzDiv; |
---|
[3231f3] | 456 | n->nIntDiv = nrzIntDiv; |
---|
| 457 | n->nIntMod = nrzIntMod; |
---|
[1e579c6] | 458 | n->nExactDiv= nrzDiv; |
---|
| 459 | n->nNeg = nrzNeg; |
---|
| 460 | n->nInvers= nrzInvers; |
---|
| 461 | n->nDivBy = nrzDivBy; |
---|
[d351d8] | 462 | n->nDivComp = nrzDivComp; |
---|
[1e579c6] | 463 | n->nGreater = nrzGreater; |
---|
| 464 | n->nEqual = nrzEqual; |
---|
| 465 | n->nIsZero = nrzIsZero; |
---|
| 466 | n->nIsOne = nrzIsOne; |
---|
| 467 | n->nIsMOne = nrzIsMOne; |
---|
| 468 | n->nGreaterZero = nrzGreaterZero; |
---|
[493225] | 469 | n->cfWrite = nrzWrite; |
---|
[1e579c6] | 470 | n->nRead = nrzRead; |
---|
| 471 | n->nPower = nrzPower; |
---|
| 472 | n->cfSetMap = nrzSetMap; |
---|
| 473 | n->nNormalize = nDummy2; |
---|
| 474 | n->nLcm = nrzLcm; |
---|
| 475 | n->nGcd = nrzGcd; |
---|
| 476 | n->nIsUnit = nrzIsUnit; |
---|
| 477 | n->nGetUnit = nrzGetUnit; |
---|
| 478 | n->nExtGcd = nrzExtGcd; |
---|
| 479 | n->nName= ndName; |
---|
| 480 | #ifdef LDEBUG |
---|
[85e68dd] | 481 | n->nDBTest=ndDBTest; // not yet implemented: nrzDBTest; |
---|
[1e579c6] | 482 | #endif |
---|
| 483 | } |
---|
[585bbcb] | 484 | #endif |
---|
[35aab3] | 485 | else if (rField_is_Q(r)) |
---|
| 486 | { |
---|
| 487 | n->cfDelete= nlDelete; |
---|
| 488 | n->nNormalize=nlNormalize; |
---|
[8391d8] | 489 | n->cfInit = nlInit; |
---|
[cf74cd6] | 490 | n->n_Int = nlInt; |
---|
[35aab3] | 491 | n->nAdd = nlAdd; |
---|
| 492 | n->nSub = nlSub; |
---|
| 493 | n->nMult = nlMult; |
---|
| 494 | n->nInpMult=nlInpMult; |
---|
| 495 | n->nDiv = nlDiv; |
---|
| 496 | n->nExactDiv= nlExactDiv; |
---|
| 497 | n->nIntDiv= nlIntDiv; |
---|
| 498 | n->nIntMod= nlIntMod; |
---|
| 499 | n->nNeg = nlNeg; |
---|
| 500 | n->nInvers= nlInvers; |
---|
| 501 | n->nCopy = nlCopy; |
---|
| 502 | n->nGreater = nlGreater; |
---|
| 503 | n->nEqual = nlEqual; |
---|
| 504 | n->nIsZero = nlIsZero; |
---|
| 505 | n->nIsOne = nlIsOne; |
---|
| 506 | n->nIsMOne = nlIsMOne; |
---|
| 507 | n->nGreaterZero = nlGreaterZero; |
---|
[493225] | 508 | n->cfWrite = nlWrite; |
---|
[35aab3] | 509 | n->nRead = nlRead; |
---|
| 510 | n->nPower = nlPower; |
---|
| 511 | n->nGcd = nlGcd; |
---|
| 512 | n->nLcm = nlLcm; |
---|
| 513 | n->cfSetMap = nlSetMap; |
---|
| 514 | n->nSize = nlSize; |
---|
[e803ec] | 515 | n->cfGetDenom = nlGetDenom; |
---|
| 516 | n->cfGetNumerator = nlGetNumerator; |
---|
[35aab3] | 517 | #ifdef LDEBUG |
---|
[3332cc6] | 518 | n->nDBTest=nlDBTest; |
---|
[35aab3] | 519 | #endif |
---|
| 520 | } |
---|
| 521 | else if (rField_is_Zp(r)) |
---|
| 522 | /*----------------------char. p----------------*/ |
---|
| 523 | { |
---|
| 524 | npInitChar(c,r); |
---|
[8391d8] | 525 | n->cfInit = npInit; |
---|
[cf74cd6] | 526 | n->n_Int = npInt; |
---|
[35aab3] | 527 | n->nAdd = npAdd; |
---|
| 528 | n->nSub = npSub; |
---|
| 529 | n->nMult = npMult; |
---|
| 530 | n->nDiv = npDiv; |
---|
| 531 | n->nExactDiv= npDiv; |
---|
| 532 | n->nNeg = npNeg; |
---|
| 533 | n->nInvers= npInvers; |
---|
| 534 | n->nCopy = ndCopy; |
---|
| 535 | n->nGreater = npGreater; |
---|
| 536 | n->nEqual = npEqual; |
---|
| 537 | n->nIsZero = npIsZero; |
---|
| 538 | n->nIsOne = npIsOne; |
---|
| 539 | n->nIsMOne = npIsMOne; |
---|
| 540 | n->nGreaterZero = npGreaterZero; |
---|
[493225] | 541 | n->cfWrite = npWrite; |
---|
[35aab3] | 542 | n->nRead = npRead; |
---|
| 543 | n->nPower = npPower; |
---|
| 544 | n->cfSetMap = npSetMap; |
---|
| 545 | /* nName= ndName; */ |
---|
| 546 | /*nSize = ndSize;*/ |
---|
| 547 | #ifdef LDEBUG |
---|
[3332cc6] | 548 | n->nDBTest=npDBTest; |
---|
[35aab3] | 549 | #endif |
---|
| 550 | #ifdef NV_OPS |
---|
| 551 | if (c>NV_MAX_PRIME) |
---|
| 552 | { |
---|
| 553 | n->nMult = nvMult; |
---|
| 554 | n->nDiv = nvDiv; |
---|
| 555 | n->nExactDiv= nvDiv; |
---|
| 556 | n->nInvers= nvInvers; |
---|
[9c8927] | 557 | n->nPower= nvPower; |
---|
[2e1b74] | 558 | n->nInpMult= nvInpMult; |
---|
[35aab3] | 559 | } |
---|
| 560 | #endif |
---|
| 561 | } |
---|
| 562 | /* -------------- GF(p^m) -----------------------*/ |
---|
| 563 | else if (rField_is_GF(r)) |
---|
| 564 | { |
---|
| 565 | //nfSetChar(c,r->parameter); |
---|
[8391d8] | 566 | n->cfInit = nfInit; |
---|
[35aab3] | 567 | n->nPar = nfPar; |
---|
| 568 | n->nParDeg= nfParDeg; |
---|
[cf74cd6] | 569 | n->n_Int = nfInt; |
---|
[35aab3] | 570 | n->nAdd = nfAdd; |
---|
| 571 | n->nSub = nfSub; |
---|
| 572 | n->nMult = nfMult; |
---|
| 573 | n->nDiv = nfDiv; |
---|
| 574 | n->nExactDiv= nfDiv; |
---|
| 575 | n->nNeg = nfNeg; |
---|
| 576 | n->nInvers= nfInvers; |
---|
| 577 | n->nCopy = ndCopy; |
---|
| 578 | n->nGreater = nfGreater; |
---|
| 579 | n->nEqual = nfEqual; |
---|
| 580 | n->nIsZero = nfIsZero; |
---|
| 581 | n->nIsOne = nfIsOne; |
---|
| 582 | n->nIsMOne = nfIsMOne; |
---|
| 583 | n->nGreaterZero = nfGreaterZero; |
---|
[493225] | 584 | n->cfWrite = nfWrite; |
---|
[35aab3] | 585 | n->nRead = nfRead; |
---|
| 586 | n->nPower = nfPower; |
---|
| 587 | n->cfSetMap = nfSetMap; |
---|
| 588 | n->nName= nfName; |
---|
| 589 | /*nSize = ndSize;*/ |
---|
| 590 | #ifdef LDEBUG |
---|
[3332cc6] | 591 | n->nDBTest=nfDBTest; |
---|
[35aab3] | 592 | #endif |
---|
| 593 | } |
---|
| 594 | /* -------------- R -----------------------*/ |
---|
| 595 | //if (c==(-1)) |
---|
| 596 | else if (rField_is_R(r)) |
---|
| 597 | { |
---|
[8391d8] | 598 | n->cfInit = nrInit; |
---|
[cf74cd6] | 599 | n->n_Int = nrInt; |
---|
[35aab3] | 600 | n->nAdd = nrAdd; |
---|
| 601 | n->nSub = nrSub; |
---|
| 602 | n->nMult = nrMult; |
---|
| 603 | n->nDiv = nrDiv; |
---|
| 604 | n->nExactDiv= nrDiv; |
---|
| 605 | n->nNeg = nrNeg; |
---|
| 606 | n->nInvers= nrInvers; |
---|
| 607 | n->nCopy = ndCopy; |
---|
| 608 | n->nGreater = nrGreater; |
---|
| 609 | n->nEqual = nrEqual; |
---|
| 610 | n->nIsZero = nrIsZero; |
---|
| 611 | n->nIsOne = nrIsOne; |
---|
| 612 | n->nIsMOne = nrIsMOne; |
---|
| 613 | n->nGreaterZero = nrGreaterZero; |
---|
[493225] | 614 | n->cfWrite = nrWrite; |
---|
[35aab3] | 615 | n->nRead = nrRead; |
---|
| 616 | n->nPower = nrPower; |
---|
| 617 | n->cfSetMap=nrSetMap; |
---|
| 618 | /* nName= ndName; */ |
---|
[12cca3] | 619 | n->nSize = nrSize; |
---|
[35aab3] | 620 | #ifdef LDEBUG |
---|
[85e68dd] | 621 | n->nDBTest=ndDBTest; // not yet implemented: nrDBTest; |
---|
[35aab3] | 622 | #endif |
---|
| 623 | } |
---|
| 624 | /* -------------- long R -----------------------*/ |
---|
| 625 | else if (rField_is_long_R(r)) |
---|
| 626 | { |
---|
| 627 | n->cfDelete= ngfDelete; |
---|
[8391d8] | 628 | n->cfInit = ngfInit; |
---|
[cf74cd6] | 629 | n->n_Int = ngfInt; |
---|
[35aab3] | 630 | n->nAdd = ngfAdd; |
---|
| 631 | n->nSub = ngfSub; |
---|
| 632 | n->nMult = ngfMult; |
---|
| 633 | n->nDiv = ngfDiv; |
---|
| 634 | n->nExactDiv= ngfDiv; |
---|
| 635 | n->nNeg = ngfNeg; |
---|
| 636 | n->nInvers= ngfInvers; |
---|
| 637 | n->nCopy = ngfCopy; |
---|
| 638 | n->nGreater = ngfGreater; |
---|
| 639 | n->nEqual = ngfEqual; |
---|
| 640 | n->nIsZero = ngfIsZero; |
---|
| 641 | n->nIsOne = ngfIsOne; |
---|
| 642 | n->nIsMOne = ngfIsMOne; |
---|
| 643 | n->nGreaterZero = ngfGreaterZero; |
---|
[493225] | 644 | n->cfWrite = ngfWrite; |
---|
[35aab3] | 645 | n->nRead = ngfRead; |
---|
| 646 | n->nPower = ngfPower; |
---|
| 647 | n->cfSetMap=ngfSetMap; |
---|
| 648 | n->nName= ndName; |
---|
[12cca3] | 649 | n->nSize = ngfSize; |
---|
[35aab3] | 650 | #ifdef LDEBUG |
---|
[85e68dd] | 651 | n->nDBTest=ndDBTest; // not yet implemented: ngfDBTest |
---|
[35aab3] | 652 | #endif |
---|
| 653 | } |
---|
| 654 | /* -------------- long C -----------------------*/ |
---|
| 655 | else if (rField_is_long_C(r)) |
---|
| 656 | { |
---|
| 657 | n->cfDelete= ngcDelete; |
---|
| 658 | n->nNormalize=nDummy2; |
---|
[8391d8] | 659 | n->cfInit = ngcInit; |
---|
[cf74cd6] | 660 | n->n_Int = ngcInt; |
---|
[35aab3] | 661 | n->nAdd = ngcAdd; |
---|
| 662 | n->nSub = ngcSub; |
---|
| 663 | n->nMult = ngcMult; |
---|
| 664 | n->nDiv = ngcDiv; |
---|
| 665 | n->nExactDiv= ngcDiv; |
---|
| 666 | n->nNeg = ngcNeg; |
---|
| 667 | n->nInvers= ngcInvers; |
---|
| 668 | n->nCopy = ngcCopy; |
---|
| 669 | n->nGreater = ngcGreater; |
---|
| 670 | n->nEqual = ngcEqual; |
---|
| 671 | n->nIsZero = ngcIsZero; |
---|
| 672 | n->nIsOne = ngcIsOne; |
---|
| 673 | n->nIsMOne = ngcIsMOne; |
---|
| 674 | n->nGreaterZero = ngcGreaterZero; |
---|
[493225] | 675 | n->cfWrite = ngcWrite; |
---|
[35aab3] | 676 | n->nRead = ngcRead; |
---|
| 677 | n->nPower = ngcPower; |
---|
| 678 | n->cfSetMap=ngcSetMap; |
---|
| 679 | n->nPar=ngcPar; |
---|
| 680 | n->nRePart=ngcRePart; |
---|
| 681 | n->nImPart=ngcImPart; |
---|
[12cca3] | 682 | n->nSize = ngcSize; |
---|
[35aab3] | 683 | #ifdef LDEBUG |
---|
[85e68dd] | 684 | n->nDBTest=ndDBTest; // not yet implemented: ngcDBTest |
---|
[35aab3] | 685 | #endif |
---|
| 686 | } |
---|
| 687 | #ifdef TEST |
---|
| 688 | else |
---|
| 689 | { |
---|
| 690 | WerrorS("unknown field"); |
---|
| 691 | } |
---|
[50be61] | 692 | #endif |
---|
| 693 | #ifdef HAVE_RINGS |
---|
| 694 | if (n->nGetUnit==(nMapFunc)NULL) n->nGetUnit=n->nCopy; |
---|
[35aab3] | 695 | #endif |
---|
| 696 | if (!errorreported) |
---|
| 697 | { |
---|
[8391d8] | 698 | n->nNULL=n->cfInit(0,r); |
---|
[35aab3] | 699 | if (n->nRePart==NULL) |
---|
| 700 | n->nRePart=n->nCopy; |
---|
| 701 | if (n->nIntDiv==NULL) |
---|
| 702 | n->nIntDiv=n->nDiv; |
---|
| 703 | } |
---|
| 704 | } |
---|
| 705 | |
---|
| 706 | void nKillChar(ring r) |
---|
| 707 | { |
---|
| 708 | if (r!=NULL) |
---|
| 709 | { |
---|
| 710 | if (r->cf!=NULL) |
---|
| 711 | { |
---|
| 712 | r->cf->ref--; |
---|
| 713 | if (r->cf->ref<=0) |
---|
| 714 | { |
---|
| 715 | n_Procs_s tmp; |
---|
| 716 | n_Procs_s* n=&tmp; |
---|
| 717 | tmp.next=cf_root; |
---|
| 718 | while((n->next!=NULL) && (n->next!=r->cf)) n=n->next; |
---|
| 719 | if (n->next==r->cf) |
---|
| 720 | { |
---|
| 721 | n->next=n->next->next; |
---|
| 722 | if (cf_root==r->cf) cf_root=n->next; |
---|
| 723 | r->cf->cfDelete(&(r->cf->nNULL),r); |
---|
| 724 | switch(r->cf->type) |
---|
| 725 | { |
---|
| 726 | case n_Zp: |
---|
| 727 | #ifdef HAVE_DIV_MOD |
---|
[c90b43] | 728 | if (r->cf->npInvTable!=NULL) |
---|
[35aab3] | 729 | omFreeSize( (ADDRESS)r->cf->npInvTable, |
---|
[900802] | 730 | r->cf->npPrimeM*sizeof(unsigned short) ); |
---|
[35aab3] | 731 | #else |
---|
[c90b43] | 732 | if (r->cf->npExpTable!=NULL) |
---|
| 733 | { |
---|
[35aab3] | 734 | omFreeSize( (ADDRESS)r->cf->npExpTable, |
---|
[900802] | 735 | r->cf->npPrimeM*sizeof(unsigned short) ); |
---|
[35aab3] | 736 | omFreeSize( (ADDRESS)r->cf->npLogTable, |
---|
[900802] | 737 | r->cf->npPrimeM*sizeof(unsigned short) ); |
---|
[c90b43] | 738 | } |
---|
[35aab3] | 739 | #endif |
---|
| 740 | break; |
---|
[c90b43] | 741 | case n_Zp_a: |
---|
| 742 | case n_Q_a: |
---|
| 743 | { |
---|
| 744 | number n=r->minpoly; |
---|
| 745 | if (n!=NULL) |
---|
| 746 | { |
---|
| 747 | r->minpoly=NULL; |
---|
| 748 | if (r==currRing) naMinimalPoly=NULL; |
---|
| 749 | naDelete(&n,r); |
---|
| 750 | } |
---|
| 751 | } |
---|
| 752 | break; |
---|
[35aab3] | 753 | |
---|
| 754 | default: |
---|
| 755 | break; |
---|
| 756 | } |
---|
| 757 | omFreeSize((ADDRESS)r->cf, sizeof(n_Procs_s)); |
---|
| 758 | r->cf=NULL; |
---|
| 759 | } |
---|
| 760 | else |
---|
| 761 | { |
---|
| 762 | WarnS("cf_root list destroyed"); |
---|
| 763 | } |
---|
| 764 | } |
---|
| 765 | } |
---|
| 766 | if (r->algring!=NULL) |
---|
| 767 | { |
---|
| 768 | rKill(r->algring); |
---|
| 769 | r->algring=NULL; |
---|
| 770 | } |
---|
| 771 | } |
---|
| 772 | } |
---|