63 for(
int i=1;
i<=strat->
sl;
i++)
70 for(
int i=1;
i<=strat->
sl;
i++)
79 for(
int i=strat->
Ll;
i>=0;
i--)
84 strat->
P = strat->
L[
i];
95 if ((strat->
P.p ==
NULL) && (strat->
P.t_p ==
NULL))
118 if (
p==
NULL) red_result=0;
181 for(
int i=1;
i<=strat->
sl;
i++)
188 for(
int i=1;
i<=strat->
sl;
i++)
196 for(
int i=strat->
Ll;
i>=0;
i--)
216 int parent_pid=getpid();
222 for(
int i=strat->
Ll;
i>=0;
i--)
226 for(
int i=cpus;
i>=0;
i--)
231 for (
int i=0;
i<cpus;
i++)
236 if (parent_pid!=getpid())
240 int ind=queue->dequeue();
263 if ((P.p ==
NULL) && (P.t_p ==
NULL))
273 if (
p==
NULL) red_result=0;
299 int remaining_children=cpus;
300 while(remaining_children>0)
302 res=rqueue->dequeue();
306 si_waitpid(-1,
NULL,0);
307 remaining_children--;
312 remaining_children--;
318 dummy=queue->dequeue();
static void * feOptValue(feOptIndex opt)
KINLINE TObject ** initR()
KINLINE unsigned long * initsevT()
void ksCreateSpoly(LObject *Pair, poly spNoether, int use_buckets, ring tailRing, poly m1, poly m2, TObject **R)
void initBba(kStrategy strat)
poly redNF(poly h, int &max_ind, int nonorm, kStrategy strat)
void initBuchMora(ideal F, ideal Q, kStrategy strat)
void initBuchMoraPos(kStrategy strat)
void initenterpairs(poly h, int k, int ecart, int isFromQ, kStrategy strat, int atR)
void initS(ideal F, ideal Q, kStrategy strat)
BOOLEAN kCheckSpolyCreation(LObject *L, kStrategy strat, poly &m1, poly &m2)
void deleteInL(LSet set, int *length, int j, kStrategy strat)
void initBuchMoraCrit(kStrategy strat)
void messageSets(kStrategy strat)
static LSet initL(int nr=setmaxL)
BOOLEAN kVerify2(ideal F, ideal Q)
BOOLEAN kVerify1(ideal F, ideal Q)
static const int MAX_PROCESS
static void vmem_deinit()
static Status vmem_init()
#define TEST_OPT_DEGBOUND
void p_wrp(poly p, ring lmRing, ring tailRing)
VAR ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
Compatibility layer for legacy polynomial operations (over currRing)
static void pLmFree(poly p)
frees the space of the monomial m, assumes m != NULL coef is not freed, m is not advanced
#define pInit()
allocates a new monomial and initializes everything to 0
static BOOLEAN rIsNCRing(const ring r)
long id_RankFreeModule(ideal s, ring lmRing, ring tailRing)
return the maximal component number found in any polynomial in s