Macros | Functions | Variables
p_Procs_Set.h File Reference
#include <reporter/reporter.h>

Go to the source code of this file.

Macros

#define CheckProc(which)
 

Functions

static p_Field p_FieldIs (ring r)
 
static p_Length p_LengthIs (ring r)
 
static int p_IsNomog (long *sgn, int l)
 
static int p_IsPomog (long *sgn, int l)
 
static p_Ord p_OrdIs (ring r)
 
void nc_p_ProcsSet (ring rGR, p_Procs_s *p_Procs)
 
void p_ProcsSet (ring r, p_Procs_s *p_Procs)
 
void p_Debug_GetSpecNames (const ring r, const char *&field, const char *&length, const char *&ord)
 
void p_Debug_GetProcNames (const ring r, p_Procs_s *p_Procs)
 

Variables

static p_Procs_s_p_procs
 
static int set_names = 0
 

Macro Definition Documentation

#define CheckProc (   which)
Value:
do \
{ \
if (p_Procs->which == NULL) \
{ \
dReportBug("p_Procs is NULL"); \
WarnS("Singular will work properly, but much slower"); \
WarnS("If you chose a coef ring, it may not work at all");\
p_Procs->which = (which##_Proc_Ptr)( \
which##__FieldGeneral_LengthGeneral_OrdGeneral); \
} \
} \
while (0);
if(0 > strat->sl)
Definition: myNF.cc:73
#define WarnS
Definition: emacs.cc:81
while(1)
Definition: libparse.cc:1442
#define dReportBug(s)
Definition: reporter.h:110
#define NULL
Definition: omList.c:10

Definition at line 122 of file p_Procs_Set.h.

Function Documentation

void nc_p_ProcsSet ( ring  rGR,
p_Procs_s p_Procs 
)

Definition at line 3264 of file old.gring.cc.

3265 {
3266  assume(rIsPluralRing(rGR));
3267  assume(p_Procs!=NULL);
3268 
3269  gnc_p_ProcsSet(rGR, p_Procs);
3270 
3271  if(rIsSCA(rGR) && ncExtensions(SCAMASK) )
3272  {
3273  sca_p_ProcsSet(rGR, p_Procs);
3274  }
3275 
3276  if( ncExtensions(NOPLURALMASK) )
3278 
3279  if(!rIsSCA(rGR) && !ncExtensions(NOFORMULAMASK))
3281 
3282 }
static bool rIsPluralRing(const ring r)
we must always have this test!
Definition: ring.h:361
#define assume(x)
Definition: mod2.h:405
void sca_p_ProcsSet(ring rGR, p_Procs_s *p_Procs)
Definition: sca.cc:1239
#define NULL
Definition: omList.c:10
const int SCAMASK
Definition: nc.h:355
static bool rIsSCA(const ring r)
Definition: nc.h:206
BOOLEAN ncInitSpecialPairMultiplication(ring r)
Definition: ncSAMult.cc:267
const int NOPLURALMASK
Definition: nc.h:369
bool ncInitSpecialPowersMultiplication(ring r)
Definition: ncSAFormula.cc:51
static void gnc_p_ProcsSet(ring rGR, p_Procs_s *p_Procs)
Definition: old.gring.cc:3200
const int NOFORMULAMASK
Definition: nc.h:370
bool ncExtensions(int iMask)
Definition: old.gring.cc:100
void p_Debug_GetProcNames ( const ring  r,
p_Procs_s p_Procs 
)

Definition at line 205 of file p_Procs_Set.h.

206 {
207  set_names = 1;
208  p_ProcsSet(r, p_Procs); // changes p_Procs!!!
209  set_names = 0;
210 }
void p_ProcsSet(ring r, p_Procs_s *p_Procs)
Definition: p_Procs_Set.h:139
static int set_names
Definition: p_Procs_Set.h:118
const ring r
Definition: syzextra.cc:208
void p_Debug_GetSpecNames ( const ring  r,
const char *&  field,
const char *&  length,
const char *&  ord 
)

Definition at line 194 of file p_Procs_Set.h.

195 {
196  /*p_Field e_field =*/ (void) p_FieldIs(r);
197  /*p_Length e_length =*/ (void) p_LengthIs(r);
198  /*p_Ord e_ord =*/ (void) p_OrdIs(r);
199 
200  field = p_FieldEnum_2_String(p_FieldIs(r));
202  ord = p_OrdEnum_2_String(p_OrdIs(r));
203 }
static p_Field p_FieldIs(ring r)
Definition: p_Procs_Set.h:19
static const char * p_OrdEnum_2_String(p_Ord ord)
Definition: p_Procs_Impl.h:244
static p_Length p_LengthIs(ring r)
Definition: p_Procs_Set.h:38
static p_Ord p_OrdIs(ring r)
Definition: p_Procs_Set.h:71
const ring r
Definition: syzextra.cc:208
static const char * p_LengthEnum_2_String(p_Length length)
Definition: p_Procs_Impl.h:226
static const char * p_FieldEnum_2_String(p_Field field)
Definition: p_Procs_Impl.h:203
static p_Field p_FieldIs ( ring  r)
inlinestatic

Definition at line 19 of file p_Procs_Set.h.

20 {
21  if (rField_is_Zp(r))
22  return FieldZp;
23  if (rField_is_R(r)) return FieldR;
24  if (rField_is_GF(r)) return FieldGF;
25  if (rField_is_Q(r)) return FieldQ;
26 #ifdef HAVE_MORE_FIELDS_IMPLEMENTED
27  if (rField_is_long_R(r)) return FieldLong_R;
28  if (rField_is_long_C(r)) return FieldLong_C;
29  if (rField_is_Zp_a(r)) return FieldZp_a;
30  if (rField_is_Q_a(r)) return FieldQ_a;
31 #endif
32 #ifdef HAVE_RINGS
33  if (rField_is_Ring(r)) return RingGeneral;
34 #endif
35  return FieldGeneral;
36 }
static BOOLEAN rField_is_Zp_a(const ring r)
Definition: ring.h:478
static BOOLEAN rField_is_R(const ring r)
Definition: ring.h:467
static BOOLEAN rField_is_Q_a(const ring r)
Definition: ring.h:488
static BOOLEAN rField_is_GF(const ring r)
Definition: ring.h:470
const ring r
Definition: syzextra.cc:208
static BOOLEAN rField_is_Q(const ring r)
Definition: ring.h:461
static BOOLEAN rField_is_long_C(const ring r)
Definition: ring.h:494
static BOOLEAN rField_is_Zp(const ring r)
Definition: ring.h:455
static BOOLEAN rField_is_Ring(const ring r)
Definition: ring.h:437
static BOOLEAN rField_is_long_R(const ring r)
Definition: ring.h:491
static int p_IsNomog ( long *  sgn,
int  l 
)
inlinestatic

Definition at line 54 of file p_Procs_Set.h.

55 {
56  int i;
57  for (i=0;i<l;i++)
58  if (sgn[i] > 0) return 0;
59 
60  return 1;
61 }
int sgn(const Rational &a)
Definition: GMPrat.cc:437
int i
Definition: cfEzgcd.cc:123
int l
Definition: cfEzgcd.cc:94
static int p_IsPomog ( long *  sgn,
int  l 
)
inlinestatic

Definition at line 63 of file p_Procs_Set.h.

64 {
65  int i;
66  for (i=0;i<l;i++)
67  if (sgn[i] < 0) return 0;
68  return 1;
69 }
int sgn(const Rational &a)
Definition: GMPrat.cc:437
int i
Definition: cfEzgcd.cc:123
int l
Definition: cfEzgcd.cc:94
static p_Length p_LengthIs ( ring  r)
inlinestatic

Definition at line 38 of file p_Procs_Set.h.

39 {
40  assume(r->ExpL_Size > 0);
41  // here is a quick hack to take care of p_MemAddAdjust
42  if (r->NegWeightL_Offset != NULL) return LengthGeneral;
43  if (r->ExpL_Size == 1) return LengthOne;
44  if (r->ExpL_Size == 2) return LengthTwo;
45  if (r->ExpL_Size == 3) return LengthThree;
46  if (r->ExpL_Size == 4) return LengthFour;
47  if (r->ExpL_Size == 5) return LengthFive;
48  if (r->ExpL_Size == 6) return LengthSix;
49  if (r->ExpL_Size == 7) return LengthSeven;
50  if (r->ExpL_Size == 8) return LengthEight;
51  return LengthGeneral;
52 }
const ring r
Definition: syzextra.cc:208
#define assume(x)
Definition: mod2.h:405
#define NULL
Definition: omList.c:10
static p_Ord p_OrdIs ( ring  r)
inlinestatic

Definition at line 71 of file p_Procs_Set.h.

72 {
73  long* sgn = r->ordsgn;
74  long l = r->ExpL_Size;
75  int zero = 0;
76 
77  if (sgn[l-1] == 0)
78  {
79  l--;
80  zero = 1;
81  }
82 
83  // we always favour the pomog cases
84  if (p_IsPomog(sgn,l)) return (zero ? OrdPomogZero : OrdPomog);
85  if (p_IsNomog(sgn,l)) return (zero ? OrdNomogZero : OrdNomog);
86 
87  assume(l > 1);
88 
89  if (sgn[0] == -1 && p_IsPomog(&sgn[1], l-1))
90  return (zero ? OrdNegPomogZero : OrdNegPomog);
91  if (sgn[l-1] == -1 && p_IsPomog(sgn, l-1))
92  return (zero ? OrdPomogNegZero : OrdPomogNeg);
93 
94  if (sgn[0] == 1 && p_IsNomog(&sgn[1], l-1))
95  return (zero ? OrdPosNomogZero : OrdPosNomog);
96  if (sgn[l-1] == 1 && p_IsNomog(sgn, l-1))
97  return (zero ? OrdNomogPosZero : OrdNomogPos);
98 
99  assume(l > 2);
100 
101  if (sgn[0] == 1 && sgn[1] == 1 && p_IsNomog(&sgn[2], l-2))
102  return (zero ? OrdPosPosNomogZero : OrdPosPosNomog);
103 
104  if (sgn[0] == 1 && sgn[l-1] == 1 && p_IsNomog(&sgn[1], l-2))
105  return (zero ? OrdPosNomogPosZero : OrdPosNomogPos);
106 
107  if (sgn[0] == -1 && sgn[1] == 1 && p_IsNomog(&sgn[2], l-2))
108  return (zero ? OrdNegPosNomogZero : OrdNegPosNomog);
109 
110  return OrdGeneral;
111 }
static int p_IsNomog(long *sgn, int l)
Definition: p_Procs_Set.h:54
static int p_IsPomog(long *sgn, int l)
Definition: p_Procs_Set.h:63
int sgn(const Rational &a)
Definition: GMPrat.cc:437
const ring r
Definition: syzextra.cc:208
#define assume(x)
Definition: mod2.h:405
int l
Definition: cfEzgcd.cc:94
void p_ProcsSet ( ring  r,
p_Procs_s p_Procs 
)

Definition at line 139 of file p_Procs_Set.h.

140 {
141  p_Field field = p_FieldIs(r);
142  p_Length length = p_LengthIs(r);
143  p_Ord ord = p_OrdIs(r);
144 
145  assume(p_Procs != NULL);
146  memset(p_Procs, 0, sizeof(p_Procs_s));
147  _p_procs = p_Procs;
148  assume(IsValidSpec(field, length, ord));
149 
150  SetProcs(field, length, ord);
151  extern poly p_Mult_nn_pthread(poly p, const number n, const ring r);
152  #ifdef NV_OPS
153  if ((field==FieldZp) && (r->cf->ch>NV_MAX_PRIME))
154  {
155  // set all (mult/div.) routines to FieldGeneral-variants
156  SetProcs(FieldGeneral, length,ord); // p_Mult_nn, ...
157  // set all non-mult/div. routines to FieldZp-variants
158  SetProcs_nv(FieldZp, length,ord); // p_Delete, p_ShallowCopyDelete...
159  }
160  #endif
161  CheckProc(p_Copy);
169  CheckProc(pp_Mult_mm_Noether);
171  CheckProc(p_Neg);
173  CheckProc(pp_Mult_Coeff_mm_DivSelectMult);
175  CheckProc(p_kBucketSetLm);
176 
177 /*
178  assume(p_Procs->pp_Mult_mm_Noether != pp_Mult_mm_Noether__FieldGeneral_LengthGeneral_OrdGeneral ||
179  p_Procs->p_Minus_mm_Mult_qq == p_Minus_mm_Mult_qq__FieldGeneral_LengthGeneral_OrdGeneral ||
180  r->OrdSgn == 1 || r->LexOrder);
181 */
182 #ifdef HAVE_PLURAL
183 #ifndef SING_NDEBUG
184  if (rIsPluralRing(r))
185  {
186  dReportError("Setting pProcs in p_ProcsSet (rDebugPrint!?)!!!");
187  nc_p_ProcsSet(r, _p_procs); // Setup non-commutative p_Procs table!
188  }
189 #endif
190 #endif
191 }
static p_Field p_FieldIs(ring r)
Definition: p_Procs_Set.h:19
return P p
Definition: myNF.cc:203
static poly p_Mult_mm(poly p, poly m, const ring r)
Definition: p_polys.h:973
struct p_Procs_s p_Procs_s
Definition: ring.h:29
#define SetProcs(field, length, ord)
Definition: p_Procs_Impl.h:667
static poly pp_Mult_nn(poly p, number n, const ring r)
Definition: p_polys.h:927
static poly pp_Mult_mm(poly p, poly m, const ring r)
Definition: p_polys.h:962
#define CheckProc(which)
Definition: p_Procs_Set.h:122
static p_Length p_LengthIs(ring r)
Definition: p_Procs_Set.h:38
static bool rIsPluralRing(const ring r)
we must always have this test!
Definition: ring.h:361
static p_Ord p_OrdIs(ring r)
Definition: p_Procs_Set.h:71
static poly p_Copy(poly p, const ring r)
returns a copy of p
Definition: p_polys.h:811
p_Length
Definition: p_Procs_Impl.h:127
const ring r
Definition: syzextra.cc:208
#define assume(x)
Definition: mod2.h:405
p_Field
Definition: p_Procs_Impl.h:109
static poly p_ShallowCopyDelete(poly p, const ring r, omBin bin)
Definition: p_polys.h:876
static poly p_Mult_nn(poly p, number n, const ring r)
Definition: p_polys.h:902
static int IsValidSpec(p_Field field, p_Length length, p_Ord ord)
Definition: p_Procs_Impl.h:573
#define NV_MAX_PRIME
Definition: modulop.h:21
static void p_Delete(poly *p, const ring r)
Definition: p_polys.h:850
p_Ord
Definition: p_Procs_Impl.h:140
#define NULL
Definition: omList.c:10
static poly p_Merge_q(poly p, poly q, const ring r)
Definition: p_polys.h:1140
static p_Procs_s * _p_procs
Definition: p_Procs_Set.h:114
void nc_p_ProcsSet(ring rGR, p_Procs_s *p_Procs)
Definition: old.gring.cc:3264
static poly p_Minus_mm_Mult_qq(poly p, const poly m, const poly q, int &lp, int lq, const poly spNoether, const ring r)
Definition: p_polys.h:981
int dReportError(const char *fmt,...)
Definition: dError.cc:45
static poly p_Neg(poly p, const ring r)
Definition: p_polys.h:1018
polyrec * poly
Definition: hilb.h:10
static poly p_Add_q(poly p, poly q, const ring r)
Definition: p_polys.h:884
static poly pp_Mult_Coeff_mm_DivSelect(poly p, const poly m, const ring r)
Definition: p_polys.h:1001

Variable Documentation

p_Procs_s* _p_procs
static

Definition at line 114 of file p_Procs_Set.h.

int set_names = 0
static

Definition at line 118 of file p_Procs_Set.h.