Changeset 6f1610 in git
- Timestamp:
- Nov 17, 1999, 1:09:27 PM (24 years ago)
- Branches:
- (u'spielwiese', '0d6b7fcd9813a1ca1ed4220cfa2b104b97a0a003')
- Children:
- d6b035db0aca74c2dfaa450b41b81d9ef4adfe0b
- Parents:
- 59f0d2fa7d5c7132b992bffd6be3a4a07eeb4b9b
- Location:
- Singular
- Files:
-
- 7 edited
Legend:
- Unmodified
- Added
- Removed
-
Singular/ideals.cc
r59f0d2f r6f1610 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: ideals.cc,v 1.7 4 1999-11-16 12:39:27obachman Exp $ */4 /* $Id: ideals.cc,v 1.75 1999-11-17 12:09:24 obachman Exp $ */ 5 5 /* 6 6 * ABSTRACT - all basic methods to manipulate ideals … … 2918 2918 if (syz_ring != orig_ring) 2919 2919 { 2920 s_temp = idr CopyR_NoSort(temp, orig_ring);2920 s_temp = idrMoveR_NoSort(temp, orig_ring); 2921 2921 } 2922 2922 else … … 2925 2925 } 2926 2926 2927 idTest(s_temp); 2927 2928 ideal s_temp1 = kStd(s_temp,currQuotient,testHomog,&w,NULL,length); 2928 2929 if (w!=NULL) delete w; … … 2946 2947 { 2947 2948 rChangeCurrRing(orig_ring,TRUE); 2948 s_temp = idrMoveR_NoSort(s_temp, syz_ring); 2949 s_temp1 = idrMoveR_NoSort(s_temp1, syz_ring); 2950 rKill(syz_ring); 2951 } 2952 else 2953 { 2949 2954 idDelete(&temp); 2950 rKill(syz_ring);2951 }2955 } 2956 idTest(s_temp1); 2952 2957 return s_temp1; 2953 2958 } -
Singular/kstd2.cc
r59f0d2f r6f1610 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: kstd2.cc,v 1. 39 1999-11-15 17:20:15 obachman Exp $ */4 /* $Id: kstd2.cc,v 1.40 1999-11-17 12:09:25 obachman Exp $ */ 5 5 /* 6 6 * ABSTRACT - Kernel: alg. of Buchberger … … 582 582 reduc = olddeg = lrmax = 0; 583 583 /* compute------------------------------------------------------- */ 584 kTest_TS(strat); 584 585 while (strat->Ll >= 0) 585 586 { … … 617 618 &olddeg,&reduc,strat); 618 619 620 kTest_TS(strat); 619 621 /* reduction of the element choosen from L */ 620 622 red_result = strat->red(&strat->P,strat); … … 623 625 if (red_result == 1) 624 626 { 627 kTest_TS(strat); 625 628 /* statistic */ 626 629 if (TEST_OPT_PROT) PrintS("s"); -
Singular/kstdfac.cc
r59f0d2f r6f1610 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: kstdfac.cc,v 1.3 0 1999-11-15 17:20:15 obachman Exp $ */4 /* $Id: kstdfac.cc,v 1.31 1999-11-17 12:09:25 obachman Exp $ */ 5 5 /* 6 6 * ABSTRACT - Kernel: factorizing alg. of Buchberger … … 102 102 if(i>o->tl) 103 103 { 104 PrintS("poly p1 not found in T:");wrp(p);PrintLn();104 Warn("poly p1 not found in T:");wrp(p);PrintLn(); 105 105 l[j].p1=pCopy(p); 106 106 break; … … 122 122 if(i>o->tl) 123 123 { 124 PrintS("poly p2 not found in T:");wrp(p);PrintLn();124 Warn("poly p2 not found in T:");wrp(p);PrintLn(); 125 125 l[j].p2=pCopy(p); 126 126 break; … … 149 149 kStrategy kStratCopy(kStrategy o) 150 150 { 151 kTest_TS(o); 151 152 kStrategy s=(kStrategy)Alloc0SizeOf(skStrategy); 152 153 s->next=NULL; … … 220 221 s->fromT=o->fromT; 221 222 s->noetherSet=o->noetherSet; 223 kTest_TS(s); 222 224 return s; 223 225 } … … 251 253 int facdeg=pFDeg(strat->S[si]); 252 254 253 kTest(strat);254 255 ideal fac=singclap_factorize(strat->S[si],NULL,1); 255 kTest(strat);256 256 #ifndef HAVE_LIBFAC_P 257 257 if (fac==NULL) … … 462 462 if (TEST_OPT_REDSB) completeReduceFac(strat,FL); 463 463 } 464 kTest_TS(strat); 464 465 while (strat->Ll >= 0) 465 466 { … … 484 485 strat->P = strat->L[strat->Ll]; 485 486 strat->Ll--; 486 kTest(strat);487 487 if (pNext(strat->P.p) == strat->tail) 488 488 { … … 741 741 } 742 742 } /* for */ 743 kTest(strat);744 743 for(i=0;i<IDELEMS(fac);i++) fac->m[i]=NULL; 745 744 idDelete(&fac); … … 753 752 if (TEST_OPT_REDSB) completeReduceFac(strat,FL); 754 753 } 755 kTest (strat);754 kTest_TS(strat); 756 755 } 757 756 if (TEST_OPT_DEBUG) messageSets(strat); -
Singular/kutil.cc
r59f0d2f r6f1610 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: kutil.cc,v 1. 49 1999-11-15 17:20:16 obachman Exp $ */4 /* $Id: kutil.cc,v 1.50 1999-11-17 12:09:26 obachman Exp $ */ 5 5 /* 6 6 * ABSTRACT: kernel: utils for kStd … … 309 309 BOOLEAN ret = TRUE; 310 310 // test P 311 #ifdef MDEBUG312 if (pref >= 2) mmStartReferenceWatch();313 #endif314 311 ret = K_Test_L(f, l, &(strat->P), 315 312 (strat->P.p != NULL && pNext(strat->P.p) != strat->tail), … … 324 321 if (strat->T != NULL) 325 322 { 326 #ifdef MDEBUG327 if (pref && pref <= 1) mmStartReferenceWatch();328 #endif329 323 for (i=0; i<=strat->tl; i++) 330 324 { … … 335 329 } 336 330 } 337 #ifdef MDEBUG338 if (pref) mmStopReferenceWatch();339 #endif340 331 // test L 341 332 if (strat->L != NULL) … … 403 394 404 395 396 int kFindInT(poly p, TSet T, int tlength) 397 { 398 int i; 399 400 for (i=0; i<=tlength; i++) 401 { 402 if (T[i].p == p) return i; 403 } 404 return -1; 405 } 406 405 407 406 408 BOOLEAN K_Test_TS(char *f, int l, kStrategy strat) … … 415 417 for (i=0; i<=strat->sl; i++) 416 418 { 417 for (j=0; j<=strat->tl; j++) 418 if (strat->S[i] == strat->T[j].p) break; 419 if (j > strat->tl) 419 if (kFindInT(strat->S[i], strat->T, strat->tl) < 0) 420 420 { 421 421 Warn("S[%d] not in T", i); … … 593 593 void enterOnePair (int i,poly p,int ecart, int isFromQ,kStrategy strat) 594 594 { 595 assume(i<=strat->sl); 596 595 597 int l,j,compare; 596 598 LObject Lp; … … 601 603 /*- computes the lcm(s[i],p) -*/ 602 604 Lp.lcm = pInit(); 605 603 606 pLcm(p,strat->S[i],Lp.lcm); 604 607 pSetm(Lp.lcm); … … 2706 2709 h.sev = pGetShortExpVector(h.p); 2707 2710 strat->enterS(h,pos,strat); 2711 enterT(h, strat); 2708 2712 strat->fromQ[pos]=1; 2709 2713 } -
Singular/kutil.h
r59f0d2f r6f1610 4 4 * Computer Algebra System SINGULAR * 5 5 ****************************************/ 6 /* $Id: kutil.h,v 1.2 2 1999-11-15 17:20:17 obachman Exp $ */6 /* $Id: kutil.h,v 1.23 1999-11-17 12:09:27 obachman Exp $ */ 7 7 /* 8 8 * ABSTRACT: kernel: utils for kStd … … 179 179 #ifdef KDEBUG 180 180 #define kTest(A) K_Test(__FILE__,__LINE__,A) 181 #define kTest_TS(A) K_Test (__FILE__,__LINE__,A)181 #define kTest_TS(A) K_Test_TS(__FILE__,__LINE__,A) 182 182 #define kTest_T(T) K_Test_T(__FILE__,__LINE__,T) 183 183 #define kTest_L(L) K_Test_L(__FILE__,__LINE__,L) -
Singular/mmbt.c
r59f0d2f r6f1610 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: mmbt.c,v 1.2 1 1999-11-15 17:20:23obachman Exp $ */4 /* $Id: mmbt.c,v 1.22 1999-11-17 12:09:27 obachman Exp $ */ 5 5 /* 6 6 * ABSTRACT: backtrace: part of memory subsystem (for linux/elf) … … 111 111 } 112 112 113 int mm_no_mtrack = 0; 114 113 115 void mmTrack (unsigned long *bt_stack) 114 116 { … … 121 123 122 124 if (mm_lowpc==0) mmTrackInit(); 123 124 while ((fp!=NULL) && ((unsigned long)fp>4095) 125 && ((unsigned long)fp < ((unsigned long)0xff000000)) 126 && *fp && (pc = getpc (fp)) 127 && !entrypc (pc) && (i<BT_MAXSTACK)) 128 { 129 if ( mmTrack_sig11_caught) break; 130 bt_stack[i]=pc; i++; 131 fp = (unsigned long *) *fp; 125 126 if (! mm_no_mtrack) 127 { 128 while ((fp!=NULL) && ((unsigned long)fp>4095) 129 && ((unsigned long)fp < ((unsigned long)0xff000000)) 130 && *fp && (pc = getpc (fp)) 131 && !entrypc (pc) && (i<BT_MAXSTACK)) 132 { 133 if ( mmTrack_sig11_caught) break; 134 bt_stack[i]=pc; i++; 135 fp = (unsigned long *) *fp; 136 } 132 137 } 133 138 /* signal(SIGSEGV, (si_hdl_typ) sig11_handler); */ -
Singular/mminit.cc
r59f0d2f r6f1610 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: mminit.cc,v 1.1 7 1999-11-15 17:20:25obachman Exp $ */4 /* $Id: mminit.cc,v 1.18 1999-11-17 12:09:27 obachman Exp $ */ 5 5 /* 6 6 * ABSTRACT: init of memory management … … 29 29 { 30 30 #ifdef MDEBUG 31 return mmDBAlloc( size, "new",0); 31 extern int mm_no_mtrack; 32 void* addr; 33 mm_no_mtrack = 1; 34 addr = mmDBAlloc( size, "new",0); 35 mm_no_mtrack = 0; 36 return addr; 32 37 #else 33 38 return AllocL( size );
Note: See TracChangeset
for help on using the changeset viewer.