source: git/kernel/GBEngine/kutil.h @ 85d7d3

spielwiese
Last change on this file since 85d7d3 was 85d7d3, checked in by Karim Abou Zeid <karim23697@…>, 6 years ago
Merge branch 'spielwiese' into letterplace_kernel_multiplication
  • Property mode set to 100644
File size: 31.6 KB
Line 
1#ifndef KUTIL_H
2#define KUTIL_H
3/****************************************
4*  Computer Algebra System SINGULAR     *
5****************************************/
6/*
7* ABSTRACT: kernel: utils for kStd
8*/
9
10
11#include <string.h>
12
13#ifdef HAVE_OMALLOC
14#include "omalloc/omalloc.h"
15#include "omalloc/omallocClass.h"
16#else
17#include "xalloc/omalloc.h"
18#endif
19
20#include "misc/mylimits.h"
21
22#include "kernel/polys.h"
23#include "polys/operations/pShallowCopyDelete.h"
24
25#include "kernel/structs.h"
26#include "kernel/GBEngine/kstd1.h"   /* for s_poly_proc_t */
27
28// define if tailrings should be used
29#define HAVE_TAIL_RING
30
31#define setmax 128
32#define setmaxL ((4096-12)/sizeof(LObject))
33#define setmaxLinc ((4096)/sizeof(LObject))
34
35#define setmaxT ((4096-12)/sizeof(TObject))
36#define setmaxTinc ((4096)/sizeof(TObject))
37
38// if you want std computations as in Singular version < 2:
39// This disables RedThrough, tailReductions against T (bba),
40// sets posInT = posInT15 (bba, strat->honey), and enables redFirst with LDeg
41// NOTE: can be achieved with option(oldStd)
42
43#undef NO_KINLINE
44#if !defined(KDEBUG) && !defined(NO_INLINE)
45#define KINLINE inline
46#else
47#define KINLINE
48#define NO_KINLINE 1
49#endif
50
51typedef int* intset;
52typedef int64  wlen_type;
53typedef wlen_type* wlen_set;
54
55typedef class sTObject TObject;
56typedef class sLObject LObject;
57typedef TObject * TSet;
58typedef LObject * LSet;
59
60typedef struct denominator_list_s denominator_list_s;
61typedef denominator_list_s *denominator_list;
62
63struct denominator_list_s{number n; denominator_list next;};
64extern denominator_list DENOMINATOR_LIST;
65
66class sTObject
67{
68public:
69  unsigned long sevSig;
70  poly sig;   // the signature of the element
71  poly p;       // Lm(p) \in currRing Tail(p) \in tailRing
72  poly t_p;     // t_p \in tailRing: as monomials Lm(t_p) == Lm(p)
73  poly max_exp;     // p_GetMaxExpP(pNext(p))
74  ring tailRing;
75  long FDeg;    // pFDeg(p)
76  int ecart,
77    length,     // as of pLDeg
78    pLength,    // either == 0, or == pLength(p)
79    i_r;        // index of TObject in R set, or -1 if not in T
80  /*BOOLEAN*/ char is_normalized; // true, if pNorm was called on p, false otherwise
81  // used in incremental sba() with F5C:
82  // we know some of the redundant elements in
83  // strat->T beforehand, so we can just discard
84  // them and do not need to consider them in the
85  // interreduction process
86  /*BOOLEAN*/ char is_redundant;
87  // used in sba's sig-safe reduction:
88  // sometimes we already know that a reducer
89  // is sig-safe, so no need for a real
90  // sig-safeness check
91  /*BOOLEAN*/ char is_sigsafe;
92
93
94#ifdef HAVE_PLURAL
95  /*BOOLEAN*/ char is_special; // true, it is a new special S-poly (e.g. for SCA)
96#endif
97
98  // letterplace
99  int shift;
100
101  // initialization
102  KINLINE void Init(ring r = currRing);
103  KINLINE sTObject(ring tailRing = currRing);
104  KINLINE sTObject(poly p, ring tailRing = currRing);
105  KINLINE sTObject(poly p, ring c_r, ring tailRing);
106  KINLINE sTObject(sTObject* T, int copy);
107
108  KINLINE void Set(ring r=currRing);
109  KINLINE void Set(poly p_in, ring r=currRing);
110  KINLINE void Set(poly p_in, ring c_r, ring t_r);
111
112  // Frees the polys of T
113  KINLINE void Delete();
114  // Sets polys to NULL
115  KINLINE void Clear();
116  // makes a copy of the poly of T
117  KINLINE void Copy();
118
119  // ring-dependent Lm access: these might result in allocation of monomials
120  KINLINE poly GetLmCurrRing();
121  KINLINE poly GetLmTailRing();
122  KINLINE poly GetLm(ring r);
123  // this returns Lm and ring r (preferably from tailRing), but does not
124  // allocate a new poly
125  KINLINE void GetLm(poly &p, ring &r) const;
126
127#ifdef OLIVER_PRIVAT_LT
128  // routines for calc. with rings
129  KINLINE poly GetLtCurrRing();
130  KINLINE poly GetLtTailRing();
131  KINLINE poly GetLt(ring r);
132  KINLINE void GetLt(poly &p, ring &r) const;
133#endif
134
135  KINLINE BOOLEAN IsNull() const;
136
137  KINLINE int GetpLength();
138
139  // makes sure that T.p exists
140  KINLINE void SetLmCurrRing();
141
142  // Iterations
143  // simply get the next monomial
144  KINLINE poly Next();
145  KINLINE void LmDeleteAndIter();
146
147  // deg stuff
148  // compute pTotalDegree
149  KINLINE long pTotalDeg() const;
150  // computes pFDeg
151  KINLINE long pFDeg() const;
152  // computes and sets FDeg
153  KINLINE long SetpFDeg();
154  // gets stored FDeg
155  KINLINE long GetpFDeg() const;
156
157  // computes pLDeg
158  KINLINE long pLDeg();
159  // sets length, FDeg, returns LDeg
160  KINLINE long SetDegStuffReturnLDeg();
161
162  // arithmetic
163  KINLINE void Mult_nn(number n);
164  KINLINE void ShallowCopyDelete(ring new_tailRing, omBin new_tailBin,
165                                 pShallowCopyDeleteProc p_shallow_copy_delete,
166                                 BOOLEAN set_max = TRUE);
167  // manipulations
168  KINLINE void pNorm();
169  KINLINE void pCleardenom();
170
171#ifdef KDEBUG
172  void wrp();
173#endif
174};
175
176extern int strat_nr;
177
178class sLObject : public sTObject
179{
180
181public:
182  unsigned long sev;
183  poly  p1,p2; /*- the pair p comes from,
184                 lm(pi) in currRing, tail(pi) in tailring -*/
185
186  poly  lcm;   /*- the lcm of p1,p2 -*/
187  kBucket_pt bucket;
188  int   i_r1, i_r2;
189  unsigned checked; // this is the index of S up to which
190                      // the corresponding LObject was already checked in
191                      // critical pair creation => when entering the
192                      // reduction process it is enough to start a second
193                      // rewritten criterion check from checked+1 onwards
194  BOOLEAN prod_crit;
195                      // NOTE: If prod_crit = TRUE then the corresponding pair is
196                      // detected by Buchberger's Product Criterion and can be
197                      // deleted
198
199  // initialization
200  KINLINE void Init(ring tailRing = currRing);
201  KINLINE sLObject(ring tailRing = currRing);
202  KINLINE sLObject(poly p, ring tailRing = currRing);
203  KINLINE sLObject(poly p, ring c_r, ring tailRing);
204
205  // Frees the polys of L
206  KINLINE void Delete();
207  KINLINE void Clear();
208
209  // Iterations
210  KINLINE void LmDeleteAndIter();
211  KINLINE poly LmExtractAndIter();
212
213  // spoly related things
214  // preparation for reduction if not spoly
215  KINLINE void PrepareRed(BOOLEAN use_bucket);
216  KINLINE void SetLmTail(poly lm, poly new_p, int length,
217                         int use_bucket, ring r);
218  KINLINE void Tail_Minus_mm_Mult_qq(poly m, poly qq, int lq, poly spNoether);
219  KINLINE void Tail_Mult_nn(number n);
220  // deletes bucket, makes sure that p and t_p exists
221  KINLINE poly GetP(omBin lmBin = (omBin)NULL);
222  // similar, except that only t_p exists
223  KINLINE poly GetTP();
224
225  // does not delete bucket, just canonicalizes it
226  // returned poly is such that Lm(p) \in currRing, Tail(p) \in tailRing
227  KINLINE void CanonicalizeP();
228
229  // makes a copy of the poly of L
230  KINLINE void Copy();
231
232  KINLINE int GetpLength();
233  KINLINE long pLDeg(BOOLEAN use_last);
234  KINLINE long pLDeg();
235  KINLINE int SetLength(BOOLEAN lengt_pLength = FALSE);
236  KINLINE long SetDegStuffReturnLDeg();
237  KINLINE long SetDegStuffReturnLDeg(BOOLEAN use_last);
238
239  // returns minimal component of p
240  KINLINE long MinComp();
241  // returns component of p
242  KINLINE long Comp();
243
244  KINLINE void ShallowCopyDelete(ring new_tailRing,
245                                 pShallowCopyDeleteProc p_shallow_copy_delete);
246
247  // sets sev
248  KINLINE void SetShortExpVector();
249
250  // enable assignment from TObject
251  KINLINE sLObject& operator=(const sTObject&);
252
253  // get T's corresponding to p1, p2: they might return NULL
254  KINLINE TObject* T_1(const skStrategy* strat);
255  KINLINE TObject* T_2(const skStrategy* strat);
256  KINLINE void     T_1_2(const skStrategy* strat,
257                         TObject* &T_1, TObject* &T_2);
258
259  // simplify coefficients
260  KINLINE void Normalize();
261  KINLINE void HeadNormalize();
262};
263
264
265extern int HCord;
266
267class skStrategy
268#ifdef HAVE_OMALLOC
269                 : public omallocClass
270#endif
271{
272public:
273  kStrategy next;
274  int (*red)(LObject * L,kStrategy strat);
275  int (*red2)(LObject * L,kStrategy strat);
276  void (*initEcart)(TObject * L);
277  int (*posInT)(const TSet T,const int tl,LObject &h);
278  int (*posInLSba)(const LSet set, const int length,
279                LObject* L,const kStrategy strat);
280  int (*posInL)(const LSet set, const int length,
281                LObject* L,const kStrategy strat);
282  void (*enterS)(LObject &h, int pos,kStrategy strat, int atR/* =-1*/ );
283  void (*initEcartPair)(LObject * h, poly f, poly g, int ecartF, int ecartG);
284  int (*posInLOld)(const LSet Ls,const int Ll,
285                   LObject* Lo,const kStrategy strat);
286  void (*enterOnePair) (int i,poly p,int ecart, int isFromQ,kStrategy strat, int atR /*= -1*/);
287  void (*chainCrit) (poly p,int ecart,kStrategy strat);
288  BOOLEAN (*syzCrit) (poly sig, unsigned long not_sevSig, kStrategy strat);
289  BOOLEAN (*rewCrit1) (poly sig, unsigned long not_sevSig, poly lm, kStrategy strat, int start /*= 0*/);
290  BOOLEAN (*rewCrit2) (poly sig, unsigned long not_sevSig, poly lm, kStrategy strat, int start /*= 0*/);
291  BOOLEAN (*rewCrit3) (poly sig, unsigned long not_sevSig, poly lm, kStrategy strat, int start /*= 0*/);
292  pFDegProc pOrigFDeg;
293  pLDegProc pOrigLDeg;
294  pFDegProc pOrigFDeg_TailRing;
295  pLDegProc pOrigLDeg_TailRing;
296  s_poly_proc_t s_poly;
297
298  LObject P;
299  ideal Shdl;
300  ideal D; /*V(S) is in D(D)*/
301  ideal M; /*set of minimal generators*/
302  polyset S;
303  polyset syz;
304  polyset sig;
305  intset ecartS;
306  intset fromS; // from which S[i] S[j] comes from
307                // this is important for signature-based
308                // algorithms
309  intset syzIdx;// index in the syz array at which the first
310                // syzygy of component i comes up
311                // important for signature-based algorithms
312  unsigned sbaOrder;
313  int currIdx;
314  int max_lower_index;
315  intset lenS;
316  wlen_set lenSw; /* for tgb.ccc */
317  intset fromQ;
318  unsigned long* sevS;
319  unsigned long* sevSyz;
320  unsigned long* sevSig;
321  unsigned long* sevT;
322  TSet T;
323  LSet L;
324  LSet    B;
325  poly    kHEdge;
326  poly    kNoether;
327  poly    t_kHEdge; // same polys in tailring
328  KINLINE poly    kNoetherTail();
329  poly    t_kNoether;
330  BOOLEAN * NotUsedAxis;
331  BOOLEAN * pairtest;/*used for enterOnePair*/
332  poly tail;
333  intvec * kModW;
334  intvec * kHomW;
335  // procedure for ShalloCopy from tailRing  to currRing
336  pShallowCopyDeleteProc p_shallow_copy_delete;
337  // pointers to Tobjects R[i] is ith Tobject which is generated
338  TObject**  R;
339  // S_2_R[i] yields Tobject which corresponds to S[i]
340  int*      S_2_R;
341  ring tailRing;
342  omBin lmBin;
343  omBin tailBin;
344  int nr;
345  int cp,c3;
346  int sl,mu;
347  int syzl,syzmax,syzidxmax;
348  int tl,tmax;
349  int Ll,Lmax;
350  int Bl,Bmax;
351  int ak,LazyDegree,LazyPass;
352  int syzComp;
353  int HCord;
354  int lastAxis;
355  int newIdeal;
356  int minim;
357  #ifdef HAVE_RINGS
358  bool sigdrop; //This is used to check sigdrop in sba over Z
359  int nrsyzcrit; // counts how many pairs are deleted by SyzCrit
360  int nrrewcrit; // counts how many pairs are deleted by FaugereRewCrit
361  int sbaEnterS; // sba over Z strategy: if sigdrop element has _*gen(sbaEnterS+1), then
362                 // add directly sbaEnterS elements into S
363  int blockred;  // counter for blocked reductions in redSig
364  int blockredmax;
365  #endif
366  #ifdef HAVE_SHIFTBBA
367  int cv; // in shift bases: counting V criterion
368  #endif
369  /*BOOLEAN*/ char interpt;
370  /*BOOLEAN*/ char homog;
371#ifdef HAVE_PLURAL
372  /*BOOLEAN*/ char z2homog; // Z_2 - homogeneous input allows product criterion in commutative and SCA cases!
373#endif
374  /*BOOLEAN*/ char kHEdgeFound;
375  /*BOOLEAN*/ char honey,sugarCrit;
376  /*BOOLEAN*/ char Gebauer,noTailReduction;
377  /*BOOLEAN*/ char fromT;
378  /*BOOLEAN*/ char noetherSet;
379  /*BOOLEAN*/ char update;
380  /*BOOLEAN*/ char posInLOldFlag;
381  /*BOOLEAN*/ char use_buckets;
382  // if set, pLDeg(p, l) == (pFDeg(pLast(p), pLength)
383  /*BOOLEAN*/ char LDegLast;
384  // if set, then L.length == L.pLength
385  /*BOOLEAN*/ char length_pLength;
386  // if set, then posInL does not depend on L.length
387  /*BOOLEAN*/ char posInLDependsOnLength;
388  /*FALSE, if posInL == posInL10*/
389#ifdef HAVE_PLURAL
390  // set this flag to 1 to stop the product criteria
391  // use ALLOW_PROD_CRIT(strat) to test
392  /*BOOLEAN*/ char no_prod_crit;
393#define ALLOW_PROD_CRIT(A) (!(A)->no_prod_crit)
394#else
395#define ALLOW_PROD_CRIT(A) (1)
396#endif
397  char    redTailChange;
398  char    news;
399  char    newt;/*used for messageSets*/
400  char    noClearS;
401  char    completeReduce_retry;
402  char    overflow;
403
404  skStrategy();
405  ~skStrategy();
406
407  // return TObject corresponding to S[i]: assume that it exists
408  // i.e. no error checking is done
409  KINLINE TObject* S_2_T(int i);
410  // like S_2_T, except that NULL is returned if it can not be found
411  KINLINE TObject* s_2_t(int i);
412};
413
414void deleteHC(poly *p, int *e, int *l, kStrategy strat);
415void deleteHC(LObject* L, kStrategy strat, BOOLEAN fromNext = FALSE);
416void deleteInS (int i,kStrategy strat);
417void deleteInSSba (int i,kStrategy strat);
418void cleanT (kStrategy strat);
419static inline LSet initL (int nr=setmaxL)
420{ return (LSet)omAlloc(nr*sizeof(LObject)); }
421void deleteInL(LSet set, int *length, int j,kStrategy strat);
422void enterL (LSet *set,int *length, int *LSetmax, LObject p,int at);
423void enterSBba (LObject &p,int atS,kStrategy strat, int atR = -1);
424void enterSSba (LObject &p,int atS,kStrategy strat, int atR = -1);
425void initEcartPairBba (LObject* Lp,poly f,poly g,int ecartF,int ecartG);
426void initEcartPairMora (LObject* Lp,poly f,poly g,int ecartF,int ecartG);
427int posInS (const kStrategy strat, const int length, const poly p,
428            const int ecart_p);
429int posInSMonFirst (const kStrategy strat, const int length, const poly p);
430int posInIdealMonFirst (const ideal F, const poly p,int start = 0,int end = -1);
431int posInT0 (const TSet set,const int length,LObject &p);
432int posInT1 (const TSet set,const int length,LObject &p);
433int posInT2 (const TSet set,const int length,LObject &p);
434int posInT11 (const TSet set,const int length,LObject &p);
435int posInTSig (const TSet set,const int length,LObject &p);
436int posInT110 (const TSet set,const int length,LObject &p);
437int posInT13 (const TSet set,const int length,LObject &p);
438int posInT15 (const TSet set,const int length,LObject &p);
439int posInT17 (const TSet set,const int length,LObject &p);
440int posInT17_c (const TSet set,const int length,LObject &p);
441int posInT19 (const TSet set,const int length,LObject &p);
442int posInT_EcartpLength(const TSet set,const int length,LObject &p);
443int posInT_EcartFDegpLength(const TSet set,const int length,LObject &p);
444int posInT_FDegpLength(const TSet set,const int length,LObject &p);
445int posInT_pLength(const TSet set,const int length,LObject &p);
446
447#ifdef HAVE_MORE_POS_IN_T
448int posInT_EcartFDegpLength(const TSet set,const int length,LObject &p);
449int posInT_FDegpLength(const TSet set,const int length,LObject &p);
450int posInT_pLength(const TSet set,const int length,LObject &p);
451#endif
452
453
454void reorderS (int* suc,kStrategy strat);
455int posInLF5C (const LSet set, const int length,
456               LObject* L,const kStrategy strat);
457int posInLSig (const LSet set, const int length,
458               LObject* L,const kStrategy strat);
459int posInLSigRing (const LSet set, const int length,
460               LObject* L,const kStrategy strat);
461int posInLRing (const LSet set, const int length,
462               LObject* L,const kStrategy strat);
463int posInSyz (const kStrategy strat, const poly sig);
464int posInL0 (const LSet set, const int length,
465             LObject* L,const kStrategy strat);
466int posInL11 (const LSet set, const int length,
467             LObject* L,const kStrategy strat);
468int posInL11Ring (const LSet set, const int length,
469             LObject* L,const kStrategy strat);
470int posInLF5CRing (const LSet set, int start , const int length,
471             LObject* L,const kStrategy strat);
472int posInL11Ringls (const LSet set, const int length,
473             LObject* L,const kStrategy strat);
474int posInL13 (const LSet set, const int length,
475             LObject* L,const kStrategy strat);
476int posInL15 (const LSet set, const int length,
477             LObject* L,const kStrategy strat);
478int posInL15Ring (const LSet set, const int length,
479             LObject* L,const kStrategy strat);
480int posInL17 (const LSet set, const int length,
481             LObject* L,const kStrategy strat);
482int posInL10 (const LSet set, const int length,
483             LObject* L,const kStrategy strat);
484int posInL10Ring (const LSet set, const int length,
485             LObject* L,const kStrategy strat);
486int posInL110 (const LSet set, const int length,
487             LObject* L,const kStrategy strat);
488KINLINE poly redtailBba (poly p,int end_pos,kStrategy strat,BOOLEAN normalize=FALSE);
489KINLINE poly redtailBbaBound (poly p,int end_pos,kStrategy strat,int bound,BOOLEAN normalize=FALSE);
490#ifdef HAVE_RINGS
491KINLINE poly redtailBba_Z (poly p,int end_pos,kStrategy strat);
492poly redtailBba_Z (LObject* L, int end_pos, kStrategy strat );
493#endif
494poly redtailBba (LObject *L, int end_pos,kStrategy strat,
495                 BOOLEAN withT = FALSE,BOOLEAN normalize=FALSE);
496poly redtailBbaBound (LObject *L, int end_pos,kStrategy strat,int bound,
497                 BOOLEAN withT = FALSE,BOOLEAN normalize=FALSE);
498poly redtailSba (LObject *L, int end_pos,kStrategy strat,
499                 BOOLEAN withT = FALSE,BOOLEAN normalize=FALSE);
500poly redtailBba (TObject *T, int end_pos,kStrategy strat);
501poly redtail (poly p,int end_pos,kStrategy strat);
502poly redtail (LObject *L,int end_pos,kStrategy strat);
503poly redNF (poly h,int & max_ind,int nonorm,kStrategy strat);
504int redNF0 (LObject *P,kStrategy strat);
505poly redNFTail (poly h,const int sl,kStrategy strat);
506int redHoney (LObject* h, kStrategy strat);
507#ifdef HAVE_RINGS
508int redRing (LObject* h,kStrategy strat);
509int redRing_Z (LObject* h,kStrategy strat);
510int redRiloc (LObject* h,kStrategy strat);
511void enterExtendedSpoly(poly h,kStrategy strat);
512void enterExtendedSpolySig(poly h,poly hSig,kStrategy strat);
513void superenterpairs (poly h,int k,int ecart,int pos,kStrategy strat, int atR = -1);
514void superenterpairsSig (poly h,poly hSig,int hFrom,int k,int ecart,int pos,kStrategy strat, int atR = -1);
515poly kCreateZeroPoly(long exp[], long cabsind, poly* t_p, ring leadRing, ring tailRing);
516long ind2(long arg);
517
518long ind_fact_2(long arg);
519long twoPow(long arg);
520ideal createG0();
521#endif
522int redLazy (LObject* h,kStrategy strat);
523int redHomog (LObject* h,kStrategy strat);
524int redSig (LObject* h,kStrategy strat);
525int redSigRing (LObject* h,kStrategy strat);
526//adds hSig to be able to check with F5's criteria when entering pairs!
527void enterpairsSig (poly h, poly hSig, int from, int k, int ec, int pos,kStrategy strat, int atR = -1);
528void enterpairs (poly h, int k, int ec, int pos,kStrategy strat, int atR = -1);
529void entersets (LObject h);
530void pairs ();
531BOOLEAN sbaCheckGcdPair (LObject* h,kStrategy strat);
532void message (int i,int* reduc,int* olddeg,kStrategy strat,int red_result);
533void messageStat (int hilbcount,kStrategy strat);
534void messageStatSBA (int hilbcount,kStrategy strat);
535#ifdef KDEBUG
536void messageSets (kStrategy strat);
537#else
538#define messageSets(s)  do {} while (0)
539#endif
540
541void initEcartNormal (TObject* h);
542void initEcartBBA (TObject* h);
543void initS (ideal F, ideal Q,kStrategy strat);
544void initSL (ideal F, ideal Q,kStrategy strat);
545void initSLSba (ideal F, ideal Q,kStrategy strat);
546/*************************************************
547 * when initializing a new bunch of principal
548 * syzygies at the beginning of a new iteration
549 * step in a signature-based algorithm we
550 * compute ONLY the leading elements of those
551 * syzygies, NOT the whole syzygy
552 * NOTE: this needs to be adjusted for a more
553 * general approach on signature-based algorithms
554 ***********************************************/
555void initSyzRules (kStrategy strat);
556void updateS(BOOLEAN toT,kStrategy strat);
557void enterSyz (LObject &p,kStrategy strat, int atT);
558void enterT (LObject &p,kStrategy strat, int atT = -1);
559#ifdef HAVE_RINGS
560void enterT_strong (LObject &p,kStrategy strat, int atT = -1);
561#endif
562void cancelunit (LObject* p,BOOLEAN inNF=FALSE);
563void HEckeTest (poly pp,kStrategy strat);
564void initBuchMoraCrit(kStrategy strat);
565void initSbaCrit(kStrategy strat);
566void initHilbCrit(ideal F, ideal Q, intvec **hilb,kStrategy strat);
567void initBuchMoraPos(kStrategy strat);
568void initBuchMoraPosRing(kStrategy strat);
569void initSbaPos(kStrategy strat);
570void initBuchMora (ideal F, ideal Q,kStrategy strat);
571void initSbaBuchMora (ideal F, ideal Q,kStrategy strat);
572void exitBuchMora (kStrategy strat);
573void exitSba (kStrategy strat);
574void updateResult(ideal r,ideal Q,kStrategy strat);
575void completeReduce (kStrategy strat, BOOLEAN withT=FALSE);
576void kFreeStrat(kStrategy strat);
577void enterOnePairNormal (int i,poly p,int ecart, int isFromQ,kStrategy strat, int atR);
578void pairLcmCriterion(kStrategy strat);
579void chainCritNormal (poly p,int ecart,kStrategy strat);
580void chainCritOpt_1 (poly,int,kStrategy strat);
581void chainCritSig (poly p,int ecart,kStrategy strat);
582BOOLEAN homogTest(polyset F, int Fmax);
583BOOLEAN newHEdge(kStrategy strat);
584BOOLEAN syzCriterion(poly sig, unsigned long not_sevSig, kStrategy strat);
585BOOLEAN syzCriterionInc(poly sig, unsigned long not_sevSig, kStrategy strat);
586KINLINE BOOLEAN arriRewDummy(poly sig, unsigned long not_sevSig, poly lm, kStrategy strat, int start);
587BOOLEAN arriRewCriterion(poly sig, unsigned long not_sevSig, poly lm, kStrategy strat, int start);
588BOOLEAN arriRewCriterionPre(poly sig, unsigned long not_sevSig, poly lm, kStrategy strat, int start);
589BOOLEAN faugereRewCriterion(poly sig, unsigned long not_sevSig, poly lm, kStrategy strat, int start);
590BOOLEAN findMinLMPair(poly sig, unsigned long not_sevSig, kStrategy strat, int start);
591
592/// returns index of p in TSet, or -1 if not found
593int kFindInT(poly p, TSet T, int tlength);
594
595/// return -1 if no divisor is found
596///        number of first divisor in T, otherwise
597int kFindDivisibleByInT(const kStrategy strat, const LObject* L, const int start=0);
598int kFindDivisibleByInT_Z(const kStrategy strat, const LObject* L, const int start=0);
599
600/// return -1 if no divisor is found
601///        number of first divisor in S, otherwise
602int kFindDivisibleByInS(const kStrategy strat, int *max_ind, LObject* L);
603
604int kFindNextDivisibleByInS(const kStrategy strat, int start,int max_ind, LObject* L);
605TObject* kFindDivisibleByInS_T(kStrategy strat, int end_pos, LObject* L, TObject *T, long ecart = LONG_MAX);
606
607/***************************************************************
608 *
609 * stuff to be inlined
610 *
611 ***************************************************************/
612
613KINLINE TSet initT ();
614KINLINE TObject** initR();
615KINLINE unsigned long* initsevT();
616KINLINE poly k_LmInit_currRing_2_tailRing(poly p, ring tailRing, omBin bin);
617KINLINE poly k_LmInit_tailRing_2_currRing(poly p, ring tailRing, omBin bin);
618KINLINE poly k_LmShallowCopyDelete_currRing_2_tailRing(poly p, ring tailRing, omBin bin);
619KINLINE poly k_LmShallowCopyDelete_tailRing_2_currRing(poly p, ring tailRing,  omBin bin);
620
621KINLINE poly k_LmInit_currRing_2_tailRing(poly p, ring tailRing);
622KINLINE poly k_LmInit_tailRing_2_currRing(poly p, ring tailRing);
623KINLINE poly k_LmShallowCopyDelete_currRing_2_tailRing(poly p, ring tailRing);
624KINLINE poly k_LmShallowCopyDelete_tailRing_2_currRing(poly p, ring tailRing);
625
626// if exp bound is not violated, return TRUE and
627//                               get m1 = LCM(LM(p1), LM(p2))/LM(p1)
628//                                   m2 = LCM(LM(p1), LM(p2))/LM(p2)
629// return FALSE and m1 == NULL, m2 == NULL     , otherwise
630KINLINE BOOLEAN k_GetLeadTerms(const poly p1, const poly p2, const ring p_r,
631                               poly &m1, poly &m2, const ring m_r);
632#ifdef HAVE_RINGS
633KINLINE void k_GetStrongLeadTerms(const poly p1, const poly p2, const ring leadRing,
634                               poly &m1, poly &m2, poly &lcm, const ring taiRing);
635#endif
636#ifdef KDEBUG
637// test strat
638BOOLEAN kTest(kStrategy strat);
639// test strat, and test that S is contained in T
640BOOLEAN kTest_TS(kStrategy strat);
641// test LObject
642BOOLEAN kTest_L(LObject* L, ring tailRing = NULL,
643                 BOOLEAN testp = FALSE, int lpos = -1,
644                 TSet T = NULL, int tlength = -1);
645// test TObject
646BOOLEAN kTest_T(TObject* T, ring tailRing = NULL, int tpos = -1, char TN = '?');
647// test set strat->SevS
648BOOLEAN kTest_S(kStrategy strat);
649#else
650#define kTest(A)        (TRUE)
651#define kTest_TS(A)     (TRUE)
652#define kTest_T(T)      (TRUE)
653#define kTest_S(T)      (TRUE)
654#define kTest_L(T)      (TRUE)
655#endif
656
657
658/***************************************************************
659 *
660 * From kstd2.cc
661 *
662 ***************************************************************/
663poly kFindZeroPoly(poly input_p, ring leadRing, ring tailRing);
664ideal bba (ideal F, ideal Q,intvec *w,intvec *hilb,kStrategy strat);
665ideal sba (ideal F, ideal Q,intvec *w,intvec *hilb,kStrategy strat);
666poly kNF2 (ideal F, ideal Q, poly q, kStrategy strat, int lazyReduce);
667ideal kNF2 (ideal F,ideal Q,ideal q, kStrategy strat, int lazyReduce);
668poly kNF2Bound (ideal F, ideal Q, poly q,int bound, kStrategy strat, int lazyReduce);
669ideal kNF2Bound (ideal F,ideal Q,ideal q,int bound, kStrategy strat, int lazyReduce);
670void initBba(kStrategy strat);
671void initSba(ideal F,kStrategy strat);
672void f5c (kStrategy strat, int& olddeg, int& minimcnt, int& hilbeledeg,
673          int& hilbcount, int& srmax, int& lrmax, int& reduc, ideal Q,
674          intvec *w,intvec *hilb );
675
676/***************************************************************
677 *
678 * From kspoly.cc
679 *
680 ***************************************************************/
681// Reduces PR with PW
682// Assumes PR != NULL, PW != NULL, Lm(PW) divides Lm(PR)
683// Changes: PR
684// Const:   PW
685// If coef != NULL, then *coef is a/gcd(a,b), where a = LC(PR), b = LC(PW)
686// If strat != NULL, tailRing is changed if reduction would violate exp bound
687// of tailRing
688// Returns: 0 everything ok, no tailRing change
689//          1 tailRing has successfully changed (strat != NULL)
690//          2 no reduction performed, tailRing needs to be changed first
691//            (strat == NULL)
692//         -1 tailRing change could not be performed due to exceeding exp
693//            bound of currRing
694int ksReducePoly(LObject* PR,
695                 TObject* PW,
696                 poly spNoether = NULL,
697                 number *coef = NULL,
698                 kStrategy strat = NULL);
699
700int ksReducePolyLC(LObject* PR,
701                 TObject* PW,
702                 poly spNoether = NULL,
703                 number *coef = NULL,
704                 kStrategy strat = NULL);
705
706int ksReducePolyBound(LObject* PR,
707                 TObject* PW,
708                 int bound,
709                 poly spNoether = NULL,
710                 number *coef = NULL,
711                 kStrategy strat = NULL);
712
713// Reduces PR with PW
714// Assumes PR != NULL, PW != NULL, Lm(PW) divides Lm(PR)
715// Changes: PR
716// Const:   PW
717// If coef != NULL, then *coef is a/gcd(a,b), where a = LC(PR), b = LC(PW)
718// If strat != NULL, tailRing is changed if reduction would violate exp bound
719// of tailRing
720// Returns: 0 everything ok, no tailRing change
721//          1 tailRing has successfully changed (strat != NULL)
722//          2 no reduction performed, tailRing needs to be changed first
723//            (strat == NULL)
724//          3 no reduction performed, not sig-safe!!!
725//         -1 tailRing change could not be performed due to exceeding exp
726//            bound of currRing
727int ksReducePolySig(LObject* PR,
728                 TObject* PW,
729                 long idx,
730                 poly spNoether = NULL,
731                 number *coef = NULL,
732                 kStrategy strat = NULL);
733
734int ksReducePolySigRing(LObject* PR,
735                 TObject* PW,
736                 long idx,
737                 poly spNoether = NULL,
738                 number *coef = NULL,
739                 kStrategy strat = NULL);
740
741// Reduces PR at Current->next with PW
742// Assumes PR != NULL, Current contained in PR
743//         Current->next != NULL, LM(PW) devides LM(Current->next)
744// Changes: PR
745// Const:   PW
746// Return: see ksReducePoly
747int ksReducePolyTail(LObject* PR,
748                     TObject* PW,
749                     poly Current,
750                     poly spNoether = NULL);
751
752KINLINE int ksReducePolyTail(LObject* PR, TObject* PW, LObject* Red);
753
754// Creates S-Poly of Pair
755// Const:   Pair->p1, Pair->p2
756// Changes: Pair->p == S-Poly of p1, p2
757// Assume:  Pair->p1 != NULL && Pair->p2
758void ksCreateSpoly(LObject* Pair, poly spNoether = NULL,
759                   int use_buckets=0, ring tailRing=currRing,
760                   poly m1 = NULL, poly m2 = NULL, TObject** R = NULL);
761
762/*2
763* creates the leading term of the S-polynomial of p1 and p2
764* do not destroy p1 and p2
765* remarks:
766*   1. the coefficient is 0 (nNew)
767*   2. pNext is undefined
768*/
769poly ksCreateShortSpoly(poly p1, poly p2, ring tailRing);
770
771
772// old stuff
773KINLINE poly ksOldSpolyRed(poly p1, poly p2, poly spNoether = NULL);
774KINLINE poly ksOldSpolyRedNew(poly p1, poly p2, poly spNoether = NULL);
775KINLINE poly ksOldCreateSpoly(poly p1, poly p2, poly spNoether = NULL, ring r = currRing);
776KINLINE void ksOldSpolyTail(poly p1, poly q, poly q2, poly spNoether, ring r = currRing);
777
778/***************************************************************
779 *
780 * Routines related for ring changes during std computations
781 *
782 ***************************************************************/
783// return TRUE and set m1, m2 to k_GetLcmTerms,
784//             if spoly creation of strat->P does not violate
785//             exponent bound of strat->tailRing
786//      FALSE, otherwise
787BOOLEAN kCheckSpolyCreation(LObject* L, kStrategy strat, poly &m1, poly &m2);
788#ifdef HAVE_RINGS
789// return TRUE if gcdpoly creation of R[atR] and S[atS] does not violate
790//             exponent bound of strat->tailRing
791//      FALSE, otherwise
792BOOLEAN kCheckStrongCreation(int atR, poly m1, int atS, poly m2, kStrategy strat);
793poly preIntegerCheck(ideal F, ideal Q);
794void postReduceByMon(LObject* h, kStrategy strat);
795void postReduceByMonSig(LObject* h, kStrategy strat);
796void finalReduceByMon(kStrategy strat);
797#endif
798// change strat->tailRing and adjust all data in strat, L, and T:
799// new tailRing has larger exponent bound
800// do nothing and return FALSE if exponent bound increase would result in
801// larger exponent bound that that of currRing
802BOOLEAN kStratChangeTailRing(kStrategy strat,
803                             LObject* L = NULL, TObject* T = NULL,
804                             // take this as new_expbound: if 0
805                             // new expbound is 2*expbound of tailRing
806                             unsigned long new_expbound = 0);
807// initiate a change of the tailRing of strat -- should be called
808// right before main loop in bba
809void kStratInitChangeTailRing(kStrategy strat);
810
811/// Output some debug info about a given strategy
812void kDebugPrint(kStrategy strat);
813
814// getting sb order for sba computations
815ring sbaRing(kStrategy strat, const ring r=currRing, BOOLEAN complete=TRUE, int sgn=1);
816
817KINLINE void clearS (poly p, unsigned long p_sev, int* at, int* k,
818  kStrategy strat);
819
820#include "kernel/GBEngine/kInline.h"
821
822/* shiftgb stuff */
823#include "kernel/GBEngine/shiftgb.h"
824
825poly pMove2CurrTail(poly p, kStrategy strat);
826
827poly pMoveCurrTail2poly(poly p, kStrategy strat);
828
829poly pCopyL2p(LObject h, kStrategy strat);
830
831void enterTShift(LObject p, kStrategy strat, int atT = -1);
832
833void initBuchMoraShift (ideal F,ideal Q,kStrategy strat);
834
835void enterOnePairSelfShifts (poly qq, poly p, int ecart, int isFromQ, kStrategy strat, int atR);
836
837void enterOnePairShift (poly q, poly p, int ecart, int isFromQ, kStrategy strat, int atR, int ecartq, int qisFromQ, int shiftcount, int ifromS);
838
839void enterpairsShift (poly h,int k,int ecart,int pos,kStrategy strat, int atR);
840
841void updateSShift(kStrategy strat);
842
843void initBbaShift(kStrategy strat);
844
845poly redtailBbaShift (LObject* L, int pos, kStrategy strat, BOOLEAN withT, BOOLEAN normalize);
846
847int redFirstShift (LObject* h,kStrategy strat); // ok
848
849ideal freegb(ideal I);
850
851ideal bbaShift(ideal F, ideal Q,intvec *w,intvec *hilb,kStrategy strat);
852// test syz strategy: // will be removed soon
853extern  int (*test_PosInT)(const TSet T,const int tl,LObject &h);
854extern  int (*test_PosInL)(const LSet set, const int length,
855                LObject* L,const kStrategy strat);
856
857static inline void kDeleteLcm(LObject *P)
858{
859 if (P->lcm!=NULL)
860 {
861 #ifdef HAVE_RINGS
862   if (rField_is_Ring(currRing))
863     pLmDelete(P->lcm);
864   else
865 #endif
866     pLmFree(P->lcm);
867   P->lcm=NULL;
868 }
869}
870#endif
Note: See TracBrowser for help on using the repository browser.