My Project
Data Structures | Typedefs | Functions
fast_maps.h File Reference

Go to the source code of this file.

Data Structures

class  mapoly_s
 
class  macoeff_s
 
class  maideal_s
 

Typedefs

typedef class mapoly_smapoly
 
typedef class macoeff_smacoeff
 
typedef class maideal_smaideal
 

Functions

void maMonomial_Out (mapoly monomial, ring src_r, ring dest_r=NULL)
 
void maPoly_Out (mapoly mpoly, ring src_ring, ring dest_r=NULL)
 
mapoly maMonomial_Create (poly p, ring, sBucket_pt bucket=NULL)
 
void maMonomial_Destroy (mapoly monomial, ring src_r, ring dest_r=NULL)
 
mapoly maMonomial_Free (mapoly monomial, ring src_r, ring dest_r=NULL)
 
mapoly maPoly_InsertMonomial (mapoly &into, mapoly what, ring src_r)
 
mapoly maPoly_InsertMonomial (mapoly &into, poly p, ring src_r, sBucket_pt bucket=NULL)
 
void maPoly_Optimize (mapoly mpoly, ring src_r)
 
void maPoly_Eval (mapoly mpoly, ring src_r, ideal dest_id, ring dest_r, int total_cost)
 
void maMap_CreatePolyIdeal (ideal map_id, ring map_r, ring src_r, ring dest_r, mapoly &mp, maideal &mideal)
 
void maMap_CreateRings (ideal map_id, ring map_r, ideal image_id, ring image_r, ring &src_r, ring &dest_r, BOOLEAN &no_sort)
 
ideal maIdeal_2_Ideal (maideal ideal, ring dest_r)
 
ideal fast_map_common_subexp (const ideal map_id, const ring map_r, const ideal image_id, const ring image_r)
 

Data Structure Documentation

◆ mapoly_s

class mapoly_s

Definition at line 25 of file fast_maps.h.

Data Fields
macoeff coeff
poly dest
mapoly f1
mapoly f2
mapoly next
int ref
poly src

◆ macoeff_s

class macoeff_s

Definition at line 36 of file fast_maps.h.

Data Fields
sBucket_pt bucket
number n
macoeff next

◆ maideal_s

class maideal_s

Definition at line 44 of file fast_maps.h.

Data Fields
sBucket_pt * buckets
int n

Typedef Documentation

◆ macoeff

typedef class macoeff_s* macoeff

Definition at line 22 of file fast_maps.h.

◆ maideal

typedef class maideal_s* maideal

Definition at line 23 of file fast_maps.h.

◆ mapoly

typedef class mapoly_s* mapoly

Definition at line 21 of file fast_maps.h.

Function Documentation

◆ fast_map_common_subexp()

ideal fast_map_common_subexp ( const ideal  map_id,
const ring  map_r,
const ideal  image_id,
const ring  image_r 
)

Definition at line 353 of file fast_maps.cc.

354 {
355  ring src_r, dest_r;
356  ideal dest_id/*, res_id*/;
357  int length = 0;
358  BOOLEAN no_sort;
359 
360  // construct rings we work in:
361  // src_r: Wp with Weights set to length of poly in image_id
362  // dest_r: Simple ring without degree ordering and short exponents
363  maMap_CreateRings(map_id, map_r, image_id, image_r, src_r, dest_r, no_sort);
364 
365  // construct dest_id
366  if (dest_r != image_r)
367  {
368  dest_id = idrShallowCopyR(image_id, image_r, dest_r);
369  }
370  else
371  dest_id = image_id;
372 
373  // construct mpoly and mideal
374  mapoly mp;
375  maideal mideal;
376  maMap_CreatePolyIdeal(map_id, map_r, src_r, dest_r, mp, mideal);
377 
378  if (TEST_OPT_PROT)
379  {
381  Print("map[%ld:%d]{%d:", dest_r->bitmask, dest_r->ExpL_Size, length);
382  }
383 
384  // do the optimization step
385 #if HAVE_MAP_OPTIMIZE > 0
386  if (mp!=NULL) maPoly_Optimize(mp, src_r);
387 #endif
388  if (TEST_OPT_PROT)
389  {
391  Print("%d}", length);
392  }
393 
394  // do the actual evaluation
395  maPoly_Eval(mp, src_r, dest_id, dest_r, length);
396  if (TEST_OPT_PROT) PrintS(".");
397 
398  // collect the results back into an ideal
399  ideal res_dest_id = maIdeal_2_Ideal(mideal, dest_r);
400  if (TEST_OPT_PROT) PrintS(".");
401 
402  // convert result back to image_r
403  ideal res_image_id;
404  if (dest_r != image_r)
405  {
406  //if (no_sort) see Old/m134si.tst
407  // res_image_id = idrShallowCopyR_NoSort(res_dest_id, dest_r, image_r);
408  //else
409  res_image_id = idrShallowCopyR(res_dest_id, dest_r, image_r);
410  id_ShallowDelete(&res_dest_id, dest_r);
411  id_ShallowDelete(&dest_id,dest_r);
412  }
413  else
414  res_image_id = res_dest_id;
415 
416  if (TEST_OPT_PROT) PrintS(".");
417 
418  // clean-up the rings
419  maMap_KillRings(map_r, image_r, src_r, dest_r);
420 
421  if (TEST_OPT_PROT)
422  PrintLn();
423 
424  idTest(res_image_id);
425  return res_image_id;
426 }
int BOOLEAN
Definition: auxiliary.h:87
#define Print
Definition: emacs.cc:80
void maMap_CreateRings(ideal map_id, ring map_r, ideal image_id, ring image_r, ring &src_r, ring &dest_r, BOOLEAN &simple)
Definition: fast_maps.cc:280
void maMap_CreatePolyIdeal(ideal map_id, ring map_r, ring src_r, ring dest_r, mapoly &mp, maideal &mideal)
Definition: fast_maps.cc:254
void maPoly_GetLength(mapoly mp, int &length)
Definition: fast_maps.cc:337
ideal maIdeal_2_Ideal(maideal m_id, ring)
Definition: fast_maps.cc:322
void maPoly_Eval(mapoly root, ring src_r, ideal dest_id, ring dest_r, int total_cost)
Definition: fast_maps.cc:494
static void maMap_KillRings(ring map_r, ring image_r, ring src_r, ring dest_r)
Definition: fast_maps.cc:309
void maPoly_Optimize(mapoly mpoly, ring src_r)
Definition: fast_maps.cc:709
class maideal_s * maideal
Definition: fast_maps.h:23
class mapoly_s * mapoly
Definition: fast_maps.h:21
#define idTest(id)
Definition: ideals.h:47
static BOOLEAN length(leftv result, leftv arg)
Definition: interval.cc:257
#define NULL
Definition: omList.c:12
#define TEST_OPT_PROT
Definition: options.h:102
ideal idrShallowCopyR(ideal id, ring src_r, ring dest_r)
Definition: prCopy.cc:219
void PrintS(const char *s)
Definition: reporter.cc:284
void PrintLn()
Definition: reporter.cc:310
void id_ShallowDelete(ideal *h, ring r)
Shallowdeletes an ideal/matrix.

◆ maIdeal_2_Ideal()

ideal maIdeal_2_Ideal ( maideal  ideal,
ring  dest_r 
)

Definition at line 322 of file fast_maps.cc.

323 {
324  ideal res = idInit(m_id->n, 1);
325  int l;
326 
327  for (int i= 0; i < m_id->n; i++)
328  {
329  if (m_id->buckets[i]!=NULL)
330  sBucketDestroyAdd(m_id->buckets[i], &(res->m[i]), &l);
331  }
332  omFreeSize(m_id->buckets,m_id->n*sizeof(sBucket_pt));
333  omFree(m_id);
334  return res;
335 }
int l
Definition: cfEzgcd.cc:100
int i
Definition: cfEzgcd.cc:132
CanonicalForm res
Definition: facAbsFact.cc:60
#define omFreeSize(addr, size)
Definition: omAllocDecl.h:260
#define omFree(addr)
Definition: omAllocDecl.h:261
void sBucketDestroyAdd(sBucket_pt bucket, poly *p, int *length)
Definition: sbuckets.h:68
ideal idInit(int idsize, int rank)
initialise an ideal / module
Definition: simpleideals.cc:35

◆ maMap_CreatePolyIdeal()

void maMap_CreatePolyIdeal ( ideal  map_id,
ring  map_r,
ring  src_r,
ring  dest_r,
mapoly mp,
maideal mideal 
)

Definition at line 254 of file fast_maps.cc.

256 {
257  mideal = (maideal) omAlloc0(sizeof(maideal_s));
258  mideal->n = IDELEMS(map_id);
259  mideal->buckets = (sBucket_pt*) omAlloc0(mideal->n*sizeof(sBucket_pt));
260  int i;
261  mp = NULL;
262 
263  for (i=0; i<mideal->n; i++)
264  {
265  if (map_id->m[i] != NULL)
266  {
267  mideal->buckets[i] = sBucketCreate(dest_r);
269 #ifdef PDEBUG
270  prShallowCopyR(map_id->m[i], map_r, src_r),
271 #else
272  prShallowCopyR_NoSort(map_id->m[i], map_r, src_r),
273 #endif
274  src_r,
275  mideal->buckets[i]);
276  }
277  }
278 }
#define PDEBUG
Definition: auxiliary.h:170
static void maPoly_InsertPoly(mapoly &into, poly what, ring src_r, sBucket_pt bucket)
Definition: fast_maps.cc:237
#define omAlloc0(size)
Definition: omAllocDecl.h:211
poly prShallowCopyR(poly p, ring r, ring dest_r)
Definition: prCopy.cc:116
poly prShallowCopyR_NoSort(poly p, ring r, ring dest_r)
Definition: prCopy.cc:111
sBucket_pt sBucketCreate(const ring r)
Definition: sbuckets.cc:96
#define IDELEMS(i)
Definition: simpleideals.h:23

◆ maMap_CreateRings()

void maMap_CreateRings ( ideal  map_id,
ring  map_r,
ideal  image_id,
ring  image_r,
ring &  src_r,
ring &  dest_r,
BOOLEAN no_sort 
)

Definition at line 280 of file fast_maps.cc.

283 {
284 #if HAVE_SRC_R > 0
285  int* weights = (int*) omAlloc0(map_r->N*sizeof(int));
286  int i;
287  int n = si_min(map_r->N, IDELEMS(image_id));
288 
289  for (i=0; i<n; i++)
290  {
291  weights[i] = pLength(image_id->m[i])+1;
292  }
293  src_r = rModifyRing_Wp(map_r, weights);
294 #else
295  src_r = map_r;
296 #endif
297 
298 #if HAVE_DEST_R > 0
299  unsigned long maxExp = maGetMaxExp(map_id, map_r, image_id, image_r);
300  if (maxExp <= 1) maxExp = 2;
301  else if (maxExp > (unsigned long) image_r->bitmask)
302  maxExp = (unsigned long) image_r->bitmask;
303  dest_r = rModifyRing_Simple(image_r, TRUE, TRUE, maxExp, simple);
304 #else
305  dest_r = image_r;
306 #endif
307 }
#define TRUE
Definition: auxiliary.h:100
static int si_min(const int a, const int b)
Definition: auxiliary.h:125
static unsigned long maGetMaxExp(ideal pi_id, ring pi_r, ideal map_id, ring map_r)
Definition: fast_maps.cc:63
static unsigned pLength(poly a)
Definition: p_polys.h:191
ring rModifyRing_Wp(ring r, int *weights)
construct Wp, C ring
Definition: ring.cc:2893
ring rModifyRing_Simple(ring r, BOOLEAN ommit_degree, BOOLEAN ommit_comp, unsigned long exp_limit, BOOLEAN &simple)
Definition: ring.cc:2941

◆ maMonomial_Create()

mapoly maMonomial_Create ( poly  p,
ring  ,
sBucket_pt  bucket = NULL 
)

Definition at line 137 of file fast_maps.cc.

138 {
140  //p_wrp(p,r_p);printf(" (%x) created\n",mp);
141  mp->src = p;
142  p->next = NULL;
143 
144  if (bucket != NULL)
145  {
146  mp->coeff = (macoeff) omAlloc0Bin(macoeffBin);
147  mp->coeff->bucket = bucket;
148  mp->coeff->n = pGetCoeff(p);
149  }
150  mp->ref = 1;
151  return mp;
152 }
int p
Definition: cfModGcd.cc:4080
STATIC_VAR omBin macoeffBin
Definition: fast_maps.cc:135
STATIC_VAR omBin mapolyBin
Definition: fast_maps.cc:134
class macoeff_s * macoeff
Definition: fast_maps.h:22
static number & pGetCoeff(poly p)
return an alias to the leading coefficient of p assumes that p != NULL NOTE: not copy
Definition: monomials.h:44
#define omAlloc0Bin(bin)
Definition: omAllocDecl.h:206

◆ maMonomial_Destroy()

void maMonomial_Destroy ( mapoly  monomial,
ring  src_r,
ring  dest_r = NULL 
)

Definition at line 154 of file fast_maps.cc.

155 {
156  if (mp != NULL)
157  {
158  p_LmFree(mp->src, src_r);
159  if (mp->coeff != NULL)
160  {
161  macoeff coeff, next = mp->coeff;
162  do
163  {
164  coeff = next;
165  next = coeff->next;
166  omFreeBin(coeff, macoeffBin);
167  }
168  while (next != NULL);
169  if (mp->dest != NULL)
170  {
171  assume(dest_r != NULL);
172  p_Delete(&(mp->dest), dest_r);
173  }
174  }
175  }
176  omFreeBin(mp, mapolyBin);
177 }
ListNode * next
Definition: janet.h:31
#define assume(x)
Definition: mod2.h:387
#define omFreeBin(addr, bin)
Definition: omAllocDecl.h:259
static void p_Delete(poly *p, const ring r)
Definition: p_polys.h:861
static void p_LmFree(poly p, ring)
Definition: p_polys.h:683

◆ maMonomial_Free()

mapoly maMonomial_Free ( mapoly  monomial,
ring  src_r,
ring  dest_r = NULL 
)
inline

Definition at line 67 of file fast_maps.h.

68 {
69  monomial->ref--;
70  if (monomial->ref <= 0)
71  { maMonomial_Destroy(monomial, src_r, dest_r); return NULL;}
72  return monomial;
73 }
void maMonomial_Destroy(mapoly monomial, ring src_r, ring dest_r=NULL)
Definition: fast_maps.cc:154

◆ maMonomial_Out()

void maMonomial_Out ( mapoly  monomial,
ring  src_r,
ring  dest_r = NULL 
)

◆ maPoly_Eval()

void maPoly_Eval ( mapoly  mpoly,
ring  src_r,
ideal  dest_id,
ring  dest_r,
int  total_cost 
)

Definition at line 494 of file fast_maps.cc.

495 {
496  // invert the list rooted at root:
497  if ((root!=NULL) && (root->next!=NULL))
498  {
499  mapoly q=root->next;
500  mapoly qn;
501  root->next=NULL;
502  do
503  {
504  qn=q->next;
505  q->next=root;
506  root=q;
507  q=qn;
508  }
509  while (qn !=NULL);
510  }
511 
512  total_cost /= 10;
513  int next_print_cost = total_cost;
514 
515  // the evaluation -----------------------------------------
516  mapoly p=root;
517  int cost = 0;
518 
519  while (p!=NULL)
520  {
521  // look at each mapoly: compute its value in ->dest
522  assume (p->dest==NULL);
523  {
524  if ((p->f1!=NULL)&&(p->f2!=NULL))
525  {
526  poly f1=p->f1->dest;
527  poly f2=p->f2->dest;
528  if (p->f1->ref>0) f1=p_Copy(f1,dest_r);
529  else
530  {
531  // we own p->f1->dest now (in f1)
532  p->f1->dest=NULL;
533  }
534  if (p->f2->ref>0) f2=p_Copy(f2,dest_r);
535  else
536  {
537  // we own p->f2->dest now (in f2)
538  p->f2->dest=NULL;
539  }
540  maMonomial_Free(p->f1,src_r, dest_r);
541  maMonomial_Free(p->f2,src_r, dest_r);
542  p->dest=p_Mult_q(f1,f2,dest_r);
543  } /* factors : 2 */
544  else
545  {
546  assume((p->f1==NULL) && (p->f2==NULL));
547  // no factorization provided, use the classical method:
548  p->dest=maPoly_EvalMon(p->src,src_r,dest_id->m,dest_r);
549  }
550  } /* p->dest==NULL */
551  // substitute the monomial: go through macoeff
552  p->ref -= maPoly_Substitute(p->coeff, p->dest, dest_r);
553  //printf("subst done\n");
554  if (total_cost)
555  {
557  cost++;
558  if (cost > next_print_cost)
559  {
560  PrintS("-");
561  next_print_cost += total_cost;
562  }
563  }
564 
565  mapoly pp=p;
566  p=p->next;
567  //p_wrp(pp->src, src_r);
568  if (pp->ref<=0)
569  {
570  //printf(" (%x) killed\n",pp);
571  maMonomial_Destroy(pp, src_r, dest_r);
572  }
573  //else
574  // printf(" (%x) not killed, ref=%d\n",pp,pp->ref);
575  }
576 }
CanonicalForm pp(const CanonicalForm &)
CanonicalForm pp ( const CanonicalForm & f )
Definition: cf_gcd.cc:676
void maMonomial_Destroy(mapoly mp, ring src_r, ring dest_r)
Definition: fast_maps.cc:154
static poly maPoly_EvalMon(poly src, ring src_r, poly *dest_id, ring dest_r)
Definition: fast_maps.cc:455
static int maPoly_Substitute(macoeff c, poly p, ring dest_r)
Definition: fast_maps.cc:435
mapoly maMonomial_Free(mapoly monomial, ring src_r, ring dest_r=NULL)
Definition: fast_maps.h:67
static poly p_Mult_q(poly p, poly q, const ring r)
Definition: p_polys.h:1074
static poly p_Copy(poly p, const ring r)
returns a copy of p
Definition: p_polys.h:812

◆ maPoly_InsertMonomial() [1/2]

mapoly maPoly_InsertMonomial ( mapoly into,
mapoly  what,
ring  src_r 
)

Definition at line 183 of file fast_maps.cc.

184 {
185  if (into == NULL)
186  {
187  into = what;
188  return what;
189  }
190 
191  mapoly iter = into;
192  mapoly prev = NULL;
193 
194  Top:
195  p_LmCmpAction(iter->src, what->src, src_r, goto Equal, goto Greater, goto Smaller);
196 
197  Greater:
198  if (iter->next == NULL)
199  {
200  iter->next = what;
201  return what;
202  }
203  prev = iter;
204  iter = iter->next;
205  goto Top;
206 
207  Smaller:
208  if (prev == NULL)
209  {
210  into = what;
211  what->next = iter;
212  return what;
213  }
214  prev->next = what;
215  what->next = iter;
216  return what;
217 
218  Equal:
219  iter->ref += what->ref;
220  macoeff coeff = what->coeff;
221  if (coeff != NULL)
222  {
223  while (coeff->next != NULL) coeff = coeff->next;
224  coeff->next = iter->coeff;
225  iter->coeff = what->coeff;
226  what->coeff = NULL;
227  }
228  maMonomial_Free(what, src_r);
229  return iter;
230 }
CFFListIterator iter
Definition: facAbsBiFact.cc:53
static BOOLEAN Equal(number a, number b, const coeffs)
Definition: flintcf_Q.cc:324
static bool Greater(mono_type m1, mono_type m2)
#define p_LmCmpAction(p, q, r, actionE, actionG, actionS)
Definition: p_polys.h:1687

◆ maPoly_InsertMonomial() [2/2]

mapoly maPoly_InsertMonomial ( mapoly into,
poly  p,
ring  src_r,
sBucket_pt  bucket = NULL 
)

Definition at line 232 of file fast_maps.cc.

233 {
234  return maPoly_InsertMonomial(into, maMonomial_Create(p, src_r, bucket), src_r);
235 }
mapoly maPoly_InsertMonomial(mapoly &into, mapoly what, ring src_r)
Definition: fast_maps.cc:183
mapoly maMonomial_Create(poly p, ring, sBucket_pt bucket)
Definition: fast_maps.cc:137

◆ maPoly_Optimize()

void maPoly_Optimize ( mapoly  mpoly,
ring  src_r 
)

Definition at line 709 of file fast_maps.cc.

710 {
711  assume(mpoly!=NULL && mpoly->src!=NULL);
712  mapoly iter = mpoly;
713  mapoly choice;
714  mapoly ggT=NULL;
715  mapoly fp=NULL;
716  mapoly fq=NULL;
717  while (iter->next!=NULL)
718  {
719  choice=iter->next;
720  if ( /*(*/ iter->f1==NULL /*)*/ )
721  {
722  ggT=maFindBestggT(iter, choice, fp, fq,src_r);
723  if (choice!=NULL)
724  {
725  assume(iter->f1==NULL);
726  assume(iter->f2==NULL);
727  iter->f1=fp;
728  iter->f2=ggT;
729  if (fq!=NULL)
730  {
731  ggT->ref++;
732  choice->f1=fq;
733  choice->f2=ggT;
734  }
735  }
736  else assume(ggT==NULL);
737  }
738  iter=iter->next;
739  }
740 }
CanonicalForm fp
Definition: cfModGcd.cc:4104
static mapoly maFindBestggT(mapoly mp, mapoly &choice, mapoly &fp, mapoly &fq, const ring r)
Definition: fast_maps.cc:634

◆ maPoly_Out()

void maPoly_Out ( mapoly  mpoly,
ring  src_ring,
ring  dest_r = NULL 
)