16 #include <sys/types.h>
61 for(
int i=1;
i<=strat->
sl;
i++)
68 for(
int i=1;
i<=strat->
sl;
i++)
77 for(
int i=strat->
Ll;
i>=0;
i--)
82 strat->
P = strat->
L[
i];
93 if ((strat->
P.p ==
NULL) && (strat->
P.t_p ==
NULL))
116 if (
p==
NULL) red_result=0;
178 for(
int i=1;
i<=strat->
sl;
i++)
185 for(
int i=1;
i<=strat->
sl;
i++)
193 for(
int i=strat->
Ll;
i>=0;
i--)
210 int parent_pid=getpid();
216 for(
int i=strat->
Ll;
i>=0;
i--)
220 for(
int i=cpus;
i>=0;
i--)
225 for (
int i=0;
i<cpus;
i++)
230 if (parent_pid!=getpid())
234 int ind=queue->dequeue();
257 if ((P.p ==
NULL) && (P.t_p ==
NULL))
267 if (
p==
NULL) red_result=0;
293 int remaining_children=cpus;
294 while(remaining_children>0)
296 res=rqueue->dequeue();
301 remaining_children--;
306 remaining_children--;
312 dummy=queue->dequeue();
static void * feOptValue(feOptIndex opt)
KINLINE unsigned long * initsevT()
KINLINE TObject ** initR()
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 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 ...
Compatiblity 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