Changeset b12a68 in git
- Timestamp:
- Mar 16, 2011, 10:22:03 AM (12 years ago)
- Branches:
- (u'jengelh-datetime', 'ceac47cbc86fe4a15902392bdbb9bd2ae0ea02c6')(u'spielwiese', 'a800fe4b3e9d37a38c5a10cc0ae9dfa0c15a4ee6')
- Children:
- 2f6ca63579dbf5195f7dbd177e9e67afbfb66dfa
- Parents:
- ddbc222c9c9055770463cb321791c38c081d78ef
- Location:
- kernel
- Files:
-
- 6 edited
Legend:
- Unmodified
- Added
- Removed
-
kernel/p_Minus_mm_Mult_qq__T.cc
rddbc22 rb12a68 67 67 Equal: // qm equals p 68 68 tb = n_Mult(pGetCoeff(q), tm, r); 69 #ifdef HAVE_ ZERODIVISORS69 #ifdef HAVE_RINGS 70 70 if (!nIsZero(tb)) { 71 71 #endif … … 86 86 p = p_LmFreeAndNext(p, r); 87 87 } 88 #ifdef HAVE_ ZERODIVISORS88 #ifdef HAVE_RINGS 89 89 } 90 90 else … … 101 101 102 102 Greater: 103 #ifdef HAVE_ ZERODIVISORS103 #ifdef HAVE_RINGS 104 104 tb = n_Mult(pGetCoeff(q), tneg, r); 105 105 if (!nIsZero(tb)) … … 108 108 pSetCoeff0(qm, n_Mult(pGetCoeff(q), tneg, r)); 109 109 a = pNext(a) = qm; // append qm to result and advance q 110 #ifdef HAVE_ ZERODIVISORS110 #ifdef HAVE_RINGS 111 111 } 112 112 else -
kernel/p_Mult_mm__T.cc
rddbc22 rb12a68 30 30 pAssume(!n_IsZero(ln,ri)); 31 31 32 #ifdef HAVE_ ZERODIVISORS32 #ifdef HAVE_RINGS 33 33 poly before = p; 34 34 #endif … … 37 37 pn = pGetCoeff(p); 38 38 number tmp = n_Mult(ln, pn, ri); 39 #ifdef HAVE_ ZERODIVISORS39 #ifdef HAVE_RINGS 40 40 if (n_IsZero(tmp, ri)) 41 41 { … … 60 60 p_MemAdd(p->exp, m_e, length); 61 61 p_MemAddAdjust(p, ri); 62 #ifdef HAVE_ ZERODIVISORS62 #ifdef HAVE_RINGS 63 63 before = p; 64 64 #endif -
kernel/p_Mult_nn__T.cc
rddbc22 rb12a68 23 23 24 24 poly q = p; 25 #ifdef HAVE_ ZERODIVISORS25 #ifdef HAVE_RINGS 26 26 poly old = NULL; 27 27 #endif 28 28 while (p != NULL) 29 29 { 30 #ifndef HAVE_ ZERODIVISORS30 #ifndef HAVE_RINGS 31 31 number nc = pGetCoeff(p); 32 32 pSetCoeff0(p, n_Mult(n, nc, r)); -
kernel/p_Procs_Generate.cc
rddbc22 rb12a68 120 120 } 121 121 #endif 122 #ifdef HAVE_RINGS123 if (strcmp(s_field, "RingGeneral") == 0)124 printf("#define HAVE_ZERODIVISORS\n");125 #endif126 122 i = 0; 127 123 while (macros_field[i] != NULL) … … 196 192 printf("#include <kernel/%s__T.cc>\n", s_what); 197 193 printf("#undef %s\n", s_what); 198 #ifdef HAVE_RINGS199 if (strcmp(s_field, "RingGeneral") == 0)200 printf("#undef HAVE_ZERODIVISORS\n");201 #endif202 194 #ifndef p_Procs_Static 203 195 printf("#endif // p_Procs_[Kernel|Field*]\n"); -
kernel/pp_Mult_mm__T.cc
rddbc22 rb12a68 26 26 } 27 27 spolyrec rp; 28 #ifdef HAVE_ ZERODIVISORS28 #ifdef HAVE_RINGS 29 29 rp.next = NULL; 30 30 #endif … … 41 41 { 42 42 tmp = n_Mult(ln, pGetCoeff(p), ri); 43 #ifdef HAVE_ ZERODIVISORS43 #ifdef HAVE_RINGS 44 44 if (! n_IsZero(tmp, ri)) 45 45 { … … 50 50 p_MemSum(q->exp, p->exp, m_e, length); 51 51 p_MemAddAdjust(q, ri); 52 #ifdef HAVE_ ZERODIVISORS52 #ifdef HAVE_RINGS 53 53 } 54 54 else n_Delete(&tmp, ri); -
kernel/pp_Mult_nn__T.cc
rddbc22 rb12a68 22 22 if (p == NULL) return NULL; 23 23 spolyrec rp; 24 #ifdef HAVE_ ZERODIVISORS24 #ifdef HAVE_RINGS 25 25 rp.next = NULL; 26 26 #endif … … 28 28 omBin bin = r->PolyBin; 29 29 DECLARE_LENGTH(const unsigned long length = r->ExpL_Size); 30 31 30 do 32 31 { 33 #ifndef HAVE_ ZERODIVISORS32 #ifndef HAVE_RINGS 34 33 p_AllocBin(pNext(q), bin, r); 35 34 pIter(q);
Note: See TracChangeset
for help on using the changeset viewer.