forked from Kitware/VTK
-
Notifications
You must be signed in to change notification settings - Fork 0
/
vtkMersenneTwister_Private.cxx
1800 lines (1504 loc) · 45.9 KB
/
vtkMersenneTwister_Private.cxx
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/*=========================================================================
Program: Visualization Toolkit
Module: vtkMersenneTwister_Private.cxx
Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
All rights reserved.
See Copyright.txt or http://www.kitware.com/Copyright.htm for details.
This software is distributed WITHOUT ANY WARRANTY; without even
the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
PURPOSE. See the above copyright notice for more information.
=========================================================================*/
/* Many thanks to M. Matsumoto, T. Nishimura and M. Saito for the following */
/* implementation of their algorithm, the Mersenne Twister, taken from */
/* http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/DC/dc.html */
/* Dynamic Creation (DC) of Mersenne Twister generators */
/* */
/* Reference: */
/* Makoto Matsumoto and Takuji Nishimura, */
/* "Dynamic Creation of Pseudorandom Number Generators", */
/* Monte Carlo and Quasi-Monte Carlo Methods 1998, */
/* Springer, 2000, pp 56--69. */
/*
Copyright (C) 2001-2009 Makoto Matsumoto and Takuji Nishimura.
Copyright (C) 2009 Mutsuo Saito
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above
copyright notice, this list of conditions and the following
disclaimer in the documentation and/or other materials provided
with the distribution.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
/* A C-program for MT19937: Integer version (1999/10/28) */
/* genrand() generates one pseudorandom unsigned integer (32bit) */
/* which is uniformly distributed among 0 to 2^32-1 for each */
/* call. sgenrand(seed) sets initial values to the working area */
/* of 624 words. Before genrand(), sgenrand(seed) must be */
/* called once. (seed is any 32-bit integer.) */
/* Coded by Takuji Nishimura, considering the suggestions by */
/* Topher Cooper and Marc Rieffel in July-Aug. 1997. */
/* When you use this, send an email to: matumoto@math.keio.ac.jp */
/* with an appropriate reference to your work. */
/* REFERENCE */
/* M. Matsumoto and T. Nishimura, */
/* "Mersenne Twister: A 623-Dimensionally Equidistributed Uniform */
/* Pseudo-Random Number Generator", */
/* ACM Transactions on Modeling and Computer Simulation, */
/* Vol. 8, No. 1, January 1998, pp 3--30. */
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include "vtkType.h"
typedef vtkTypeUInt32 uint32_t;
typedef vtkTypeUInt8 uint8_t;
#ifndef UINT32_C
#ifndef UINT32_MAX
#define UINT32_MAX 0xffffffff
#endif
#define UINT32_C(x) ((x) + (UINT32_MAX - UINT32_MAX))
#endif
// dc.h
typedef struct {
uint32_t aaa;
int mm,nn,rr,ww;
uint32_t wmask,umask,lmask;
int shift0, shift1, shiftB, shiftC;
uint32_t maskB, maskC;
int i;
uint32_t *state;
}mt_struct;
/* old interface */
void init_dc(uint32_t seed);
mt_struct *get_mt_parameter(int w, int p);
mt_struct *get_mt_parameter_id(int w, int p, int id);
mt_struct **get_mt_parameters(int w, int p, int max_id, int *count);
/* new interface */
mt_struct *get_mt_parameter_st(int w, int p, uint32_t seed);
mt_struct *get_mt_parameter_id_st(int w, int p, int id, uint32_t seed);
mt_struct **get_mt_parameters_st(int w, int p, int start_id, int max_id,
uint32_t seed, int *count);
/* common */
void free_mt_struct(mt_struct *mts);
void free_mt_struct_array(mt_struct **mtss, int count);
void sgenrand_mt(uint32_t seed, mt_struct *mts);
uint32_t genrand_mt(mt_struct *mts);
// mt19937.h
#define N 624
typedef struct _ORG_STATE {
uint32_t mt[N];
int mti;
} _org_state;
void _sgenrand_dc(_org_state *st, uint32_t seed);
uint32_t _genrand_dc(_org_state *st);
// dci.h
#define NOT_REJECTED 1
#define REJECTED 0
#define REDU 0
#define IRRED 1
#define NONREDU 1
extern _org_state global_mt19937;
typedef struct {int *x; int deg;} Polynomial;
typedef struct PRESCR_T {
int sizeofA; /* parameter size */
uint32_t **modlist;
Polynomial **preModPolys;
} prescr_t;
typedef struct CHECK32_T {
uint32_t upper_mask;
uint32_t lower_mask;
uint32_t word_mask;
} check32_t;
typedef struct EQDEG_T {
uint32_t bitmask[32];
uint32_t mask_b;
uint32_t mask_c;
uint32_t upper_v_bits;
int shift_0;
int shift_1;
int shift_s;
int shift_t;
int mmm;
int nnn;
int rrr;
int www;
uint32_t aaa[2];
uint32_t gupper_mask; /** most significant (WWW - RRR) bits **/
uint32_t glower_mask; /** least significant RRR bits **/
uint32_t greal_mask; /** upper WWW bitmask **/
int ggap; /** difference between machine wordsize and dest wordsize **/
int gcur_maxlengs[32]; /** for optimize_v_hard **/
uint32_t gmax_b, gmax_c;
} eqdeg_t;
int _prescreening_dc(prescr_t *pre, uint32_t aaa);
void _InitPrescreening_dc(prescr_t *pre, int m, int n, int r, int w);
void _EndPrescreening_dc(prescr_t *pre);
int _CheckPeriod_dc(check32_t *ck, _org_state *st,
uint32_t a, int m, int n, int r, int w);
void _get_tempering_parameter_dc(mt_struct *mts);
void _get_tempering_parameter_hard_dc(mt_struct *mts);
void _InitCheck32_dc(check32_t *ck, int r, int w);
// eqdeg.c
/**************************************/
#define SSS 7
#define TTT 15
/* #define S00 11 */
#define S00 12
#define S01 18
/**************************************/
/** for get_tempering_parameter_hard **/
#define LIMIT_V_BEST_OPT 15
/**************************************/
#define WORD_LEN 32
#define MIN_INFINITE (-2147483647-1)
typedef struct {
uint32_t *cf; /* fraction part */ // status
int start; /* beginning of fraction part */ // idx
int count; /* maximum (degree) */
uint32_t next; /* (bp) rm (shifted&bitmasked) at the maximum degree */
} Vector;
typedef struct mask_node{
uint32_t b,c;
int v,leng;
struct mask_node *next;
} MaskNode;
static inline uint32_t trnstmp(eqdeg_t *eq, uint32_t tmp) {
tmp ^= (tmp >> eq->shift_0) & eq->greal_mask;
return tmp;
}
static inline uint32_t masktmp(eqdeg_t *eq, uint32_t tmp) {
tmp ^= (tmp << eq->shift_s) & eq->mask_b;
tmp ^= (tmp << eq->shift_t) & eq->mask_c;
return tmp;
}
static inline uint32_t lsb(eqdeg_t *eq, uint32_t x) {
return (x >> eq->ggap) & 1;
}
static const uint8_t pivot_calc_tbl[256] = {
0, 8, 7, 8, 6, 8, 7, 8, 5, 8, 7, 8, 6, 8, 7, 8,
4, 8, 7, 8, 6, 8, 7, 8, 5, 8, 7, 8, 6, 8, 7, 8,
3, 8, 7, 8, 6, 8, 7, 8, 5, 8, 7, 8, 6, 8, 7, 8,
4, 8, 7, 8, 6, 8, 7, 8, 5, 8, 7, 8, 6, 8, 7, 8,
2, 8, 7, 8, 6, 8, 7, 8, 5, 8, 7, 8, 6, 8, 7, 8,
4, 8, 7, 8, 6, 8, 7, 8, 5, 8, 7, 8, 6, 8, 7, 8,
3, 8, 7, 8, 6, 8, 7, 8, 5, 8, 7, 8, 6, 8, 7, 8,
4, 8, 7, 8, 6, 8, 7, 8, 5, 8, 7, 8, 6, 8, 7, 8,
1, 8, 7, 8, 6, 8, 7, 8, 5, 8, 7, 8, 6, 8, 7, 8,
4, 8, 7, 8, 6, 8, 7, 8, 5, 8, 7, 8, 6, 8, 7, 8,
3, 8, 7, 8, 6, 8, 7, 8, 5, 8, 7, 8, 6, 8, 7, 8,
4, 8, 7, 8, 6, 8, 7, 8, 5, 8, 7, 8, 6, 8, 7, 8,
2, 8, 7, 8, 6, 8, 7, 8, 5, 8, 7, 8, 6, 8, 7, 8,
4, 8, 7, 8, 6, 8, 7, 8, 5, 8, 7, 8, 6, 8, 7, 8,
3, 8, 7, 8, 6, 8, 7, 8, 5, 8, 7, 8, 6, 8, 7, 8,
4, 8, 7, 8, 6, 8, 7, 8, 5, 8, 7, 8, 6, 8, 7, 8,
};
static int calc_pivot(uint32_t v);
static int push_stack(eqdeg_t *eq, uint32_t b, uint32_t c,
int v, uint32_t *bbb, uint32_t *ccc);
static int push_mask(eqdeg_t * eq, int l, int v,
uint32_t b, uint32_t c, uint32_t *bbb, uint32_t *ccc);
static int pivot_reduction(eqdeg_t *eq, int v);
static void init_tempering(eqdeg_t *eq, mt_struct *mts);
static void free_Vector( Vector *v );
static void free_lattice( Vector **lattice, int v);
static void add(int nnn, Vector *u, Vector *v);
static void optimize_v(eqdeg_t *eq, uint32_t b, uint32_t c, int v);
static MaskNode *optimize_v_hard(eqdeg_t *eq, int v, MaskNode *prev);
static Vector *new_Vector(int nnn);
static Vector **make_lattice(eqdeg_t *eq, int v);
static void delete_MaskNodes(MaskNode *head);
static MaskNode *delete_lower_MaskNodes(MaskNode *head, int l);
static MaskNode *cons_MaskNode(MaskNode *head, uint32_t b, uint32_t c, int leng);
/* static void count_MaskNodes(MaskNode *head); */
static void next_state(eqdeg_t *eq, Vector *v, int *count);
void _get_tempering_parameter_dc(mt_struct *mts)
{
eqdeg_t eq;
init_tempering(&eq, mts);
optimize_v(&eq, 0, 0, 0);
mts->shift0 = eq.shift_0;
mts->shift1 = eq.shift_1;
mts->shiftB = eq.shift_s;
mts->shiftC = eq.shift_t;
mts->maskB = eq.mask_b >> eq.ggap;
mts->maskC = eq.mask_c >> eq.ggap;
}
void _get_tempering_parameter_hard_dc(mt_struct *mts)
{
int i;
MaskNode mn0, *cur, *next;
eqdeg_t eq;
init_tempering(&eq, mts);
for (i=0; i<eq.www; i++)
eq.gcur_maxlengs[i] = -1;
mn0.b = mn0.c = mn0.leng = 0;
mn0.next = NULL;
cur = &mn0;
for (i=0; i<LIMIT_V_BEST_OPT; i++) {
next = optimize_v_hard(&eq, i, cur);
if (i > 0)
delete_MaskNodes(cur);
cur = next;
}
delete_MaskNodes(cur);
optimize_v(&eq, eq.gmax_b, eq.gmax_c,i);
mts->shift0 = eq.shift_0;
mts->shift1 = eq.shift_1;
mts->shiftB = eq.shift_s;
mts->shiftC = eq.shift_t;
mts->maskB = eq.mask_b >> eq.ggap;
mts->maskC = eq.mask_c >> eq.ggap;
/* show_distrib(mts); */
}
static int calc_pivot(uint32_t v) {
int p1, p2, p3, p4;
p1 = pivot_calc_tbl[v & 0xff];
if (p1) {
return p1 + 24 - 1;
}
p2 = pivot_calc_tbl[(v >> 8) & 0xff];
if (p2) {
return p2 + 16 - 1;
}
p3 = pivot_calc_tbl[(v >> 16) & 0xff];
if (p3) {
return p3 + 8 - 1;
}
p4 = pivot_calc_tbl[(v >> 24) & 0xff];
if (p4) {
return p4 - 1;
}
return -1;
}
static int is_zero(int size, Vector *v) {
if (v->cf[0] != 0) {
return 0;
} else {
return (memcmp(v->cf, v->cf + 1, sizeof(uint32_t) * (size - 1)) == 0);
}
}
static void init_tempering(eqdeg_t *eq, mt_struct *mts)
{
int i;
eq->mmm = mts->mm;
eq->nnn = mts->nn;
eq->rrr = mts->rr;
eq->www = mts->ww;
eq->shift_0 = S00;
eq->shift_1 = S01;
eq->shift_s = SSS;
eq->shift_t = TTT;
eq->ggap = WORD_LEN - eq->www;
/* bits are filled in mts->aaa from MSB */
eq->aaa[0] = 0; eq->aaa[1] = (mts->aaa) << eq->ggap;
for( i=0; i<WORD_LEN; i++)
eq->bitmask[i] = UINT32_C(0x80000000) >> i;
for( i=0, eq->glower_mask=0; i<eq->rrr; i++)
eq->glower_mask = (eq->glower_mask<<1)| 0x1;
eq->gupper_mask = ~eq->glower_mask;
eq->gupper_mask <<= eq->ggap;
eq->glower_mask <<= eq->ggap;
eq->greal_mask = (eq->gupper_mask | eq->glower_mask);
}
/* (v-1) bitmasks of b,c */
static MaskNode *optimize_v_hard(eqdeg_t *eq, int v, MaskNode *prev_masks)
{
int i, ll, t;
uint32_t bbb[8], ccc[8];
MaskNode *cur_masks;
cur_masks = NULL;
while (prev_masks != NULL) {
ll = push_stack(eq, prev_masks->b,prev_masks->c,v,bbb,ccc);
for (i=0; i<ll; ++i) {
eq->mask_b = bbb[i];
eq->mask_c = ccc[i];
t = pivot_reduction(eq, v+1);
if (t >= eq->gcur_maxlengs[v]) {
eq->gcur_maxlengs[v] = t;
eq->gmax_b = eq->mask_b;
eq->gmax_c = eq->mask_c;
cur_masks = cons_MaskNode(cur_masks, eq->mask_b, eq->mask_c, t);
}
}
prev_masks = prev_masks->next;
}
cur_masks = delete_lower_MaskNodes(cur_masks, eq->gcur_maxlengs[v]);
return cur_masks;
}
/* (v-1) bitmasks of b,c */
static void optimize_v(eqdeg_t *eq, uint32_t b, uint32_t c, int v)
{
int i, max_len, max_i, ll, t;
uint32_t bbb[8], ccc[8];
ll = push_stack(eq, b,c,v,bbb,ccc);
max_len = max_i = 0;
if (ll > 1) {
for (i=0; i<ll; ++i) {
eq->mask_b = bbb[i];
eq->mask_c = ccc[i];
t = pivot_reduction(eq, v+1);
if (t > max_len) {
max_len = t;
max_i = i;
}
}
}
if ( v >= eq->www-1 ) {
eq->mask_b = bbb[max_i];
eq->mask_c = ccc[max_i];
return;
}
optimize_v(eq, bbb[max_i], ccc[max_i], v+1);
}
static int push_stack(eqdeg_t *eq, uint32_t b, uint32_t c, int v,
uint32_t *bbb, uint32_t *ccc)
{
int i, ll, ncv;
uint32_t cv_buf[2];
ll = 0;
if( (v+eq->shift_t) < eq->www ){
ncv = 2; cv_buf[0] = c | eq->bitmask[v]; cv_buf[1] = c;
}
else {
ncv = 1; cv_buf[0] = c;
}
for( i=0; i<ncv; ++i)
ll += push_mask(eq, ll, v, b, cv_buf[i], bbb, ccc);
return ll;
}
static int push_mask(eqdeg_t *eq, int l, int v, uint32_t b, uint32_t c,
uint32_t *bbb, uint32_t *ccc)
{
int i, j, k, nbv, nbvt;
uint32_t bmask, bv_buf[2], bvt_buf[2];
k = l;
if( (eq->shift_s+v) >= eq->www ){
nbv = 1; bv_buf[0] = 0;
}
else if( (v>=eq->shift_t) && (c&eq->bitmask[v-eq->shift_t] ) ){
nbv = 1; bv_buf[0] = b&eq->bitmask[v];
}
else {
nbv = 2; bv_buf[0] = eq->bitmask[v]; bv_buf[1] = 0;
}
if( ((v+eq->shift_t+eq->shift_s) < eq->www) && (c&eq->bitmask[v]) ){
nbvt = 2; bvt_buf[0] = eq->bitmask[v+eq->shift_t]; bvt_buf[1] = 0;
}
else {
nbvt = 1; bvt_buf[0] = 0;
}
bmask = eq->bitmask[v];
if( (v+eq->shift_t) < eq->www )
bmask |= eq->bitmask[v+eq->shift_t];
bmask = ~bmask;
for( i=0; i<nbvt; ++i){
for( j=0; j<nbv; ++j){
bbb[k] = (b&bmask) | bv_buf[j] | bvt_buf[i];
ccc[k] = c;
++k;
}
}
return k-l;
}
/**********************************/
/**** subroutines for lattice ****/
/**********************************/
static int pivot_reduction(eqdeg_t *eq, int v)
{
Vector **lattice, *ltmp;
int i;
int pivot;
int count;
int min;
eq->upper_v_bits = 0;
for( i=0; i<v; i++) {
eq->upper_v_bits |= eq->bitmask[i];
}
lattice = make_lattice(eq, v );
for (;;) {
pivot = calc_pivot(lattice[v]->next);
if (lattice[pivot]->count < lattice[v]->count) {
ltmp = lattice[pivot];
lattice[pivot] = lattice[v];
lattice[v] = ltmp;
}
add(eq->nnn, lattice[v], lattice[pivot]);
if (lattice[v]->next == 0) {
count = 0;
next_state(eq, lattice[v], &count);
if (lattice[v]->next == 0) {
if (is_zero(eq->nnn, lattice[v])) {
break;
}
while (lattice[v]->next == 0) {
count++;
next_state(eq, lattice[v], &count);
if (count > eq->nnn * (eq->www-1) - eq->rrr) {
break;
}
}
if (lattice[v]->next == 0) {
break;
}
}
}
}
min = lattice[0]->count;
for (i = 1; i < v; i++) {
if (min > lattice[i]->count) {
min = lattice[i]->count;
}
}
free_lattice( lattice, v );
return min;
}
/********************************/
/** allocate momory for Vector **/
/********************************/
static Vector *new_Vector(int nnn)
{
Vector *v;
v = (Vector *)malloc( sizeof( Vector ) );
if( v == NULL ){
printf("malloc error in \"new_Vector()\"\n");
exit(1);
}
v->cf = (uint32_t *)calloc( nnn, sizeof( uint32_t ) );
if( v->cf == NULL ){
printf("calloc error in \"new_Vector()\"\n");
exit(1);
}
v->start = 0;
return v;
}
/************************************************/
/* frees *v which was allocated by new_Vector() */
/************************************************/
static void free_Vector( Vector *v )
{
if( NULL != v->cf ) free( v->cf );
if( NULL != v ) free( v );
}
static void free_lattice( Vector **lattice, int v)
{
int i;
for( i=0; i<=v; i++)
free_Vector( lattice[i] );
free( lattice );
}
/* adds v to u (then u will change) */
static void add(int nnn, Vector *u, Vector *v)
{
int i;
int diff = (v->start - u->start + nnn) % nnn;
for (i = 0; i < nnn - diff; i++) {
u->cf[i] ^= v->cf[i + diff];
}
diff = diff - nnn;
for (; i < nnn; i++) {
u->cf[i] ^= v->cf[i + diff];
}
u->next ^= v->next;
}
/* makes a initial lattice */
static Vector **make_lattice(eqdeg_t *eq, int v)
{
int i;
int count;
Vector **lattice, *bottom;
lattice = (Vector **)malloc( (v+1) * sizeof( Vector *) );
if( NULL == lattice ){
printf("malloc error in \"make_lattice\"\n");
exit(1);
}
for( i=0; i<v; i++){ /* from 0th row to v-1-th row */
lattice[i] = new_Vector(eq->nnn);
lattice[i]->next = eq->bitmask[i];
lattice[i]->start = 0;
lattice[i]->count = 0;
}
bottom = new_Vector(eq->nnn); /* last row */
for(i=0; i< eq->nnn; i++) {
bottom->cf[i] = 0;
}
bottom->cf[eq->nnn -1] = 0xc0000000 & eq->greal_mask;
bottom->start = 0;
bottom->count = 0;
count = 0;
do {
next_state(eq, bottom, &count);
} while (bottom->next == 0);
// degree_of_vector(eq, top );
lattice[v] = bottom;
return lattice;
}
static void next_state(eqdeg_t *eq, Vector *v, int *count) {
uint32_t tmp;
do {
tmp = ( v->cf[v->start] & eq->gupper_mask )
| ( v->cf[(v->start + 1) % eq->nnn] & eq->glower_mask );
v->cf[v->start] = v->cf[(v->start + eq->mmm) % eq->nnn]
^ ( (tmp>>1) ^ eq->aaa[lsb(eq, tmp)] );
v->cf[v->start] &= eq->greal_mask;
tmp = v->cf[v->start];
v->start = (v->start + 1) % eq->nnn;
v->count++;
tmp = trnstmp(eq, tmp);
tmp = masktmp(eq, tmp);
v->next = tmp & eq->upper_v_bits;
(*count)++;
if (*count > eq->nnn * (eq->www-1) - eq->rrr) {
break;
}
} while (v->next == 0);
}
/***********/
static MaskNode *cons_MaskNode(MaskNode *head, uint32_t b, uint32_t c, int leng)
{
MaskNode *t;
t = (MaskNode*)malloc(sizeof(MaskNode));
if (t == NULL) {
printf("malloc error in \"cons_MaskNode\"\n");
exit(1);
}
t->b = b;
t->c = c;
t->leng = leng;
t->next = head;
return t;
}
static void delete_MaskNodes(MaskNode *head)
{
MaskNode *t;
while(head != NULL) {
t = head->next;
free(head);
head = t;
}
}
static MaskNode *delete_lower_MaskNodes(MaskNode *head, int l)
{
MaskNode *s, *t, *tail;
s = head;
for(;;) { /* heading */
if (s == NULL)
return NULL;
if (s->leng >= l)
break;
t = s->next;
free(s);
s = t;
}
head = tail = s;
while (head != NULL) {
t = head->next;
if (head->leng < l) {
free(head);
}
else {
tail->next = head;
tail = head;
}
head = t;
}
tail->next = NULL;
return s;
}
// mt19937.c
/* Period parameters */
/* #define N 624 */
#define M 397
#define MATRIX_A UINT32_C(0x9908b0df) /* constant vector a */
#define UPPER_MASK UINT32_C(0x80000000) /* most significant w-r bits */
#define LOWER_MASK UINT32_C(0x7fffffff) /* least significant r bits */
/* Tempering parameters */
#define TEMPERING_MASK_B UINT32_C(0x9d2c5680)
#define TEMPERING_MASK_C UINT32_C(0xefc60000)
#define TEMPERING_SHIFT_U(y) (y >> 11)
#define TEMPERING_SHIFT_S(y) (y << 7)
#define TEMPERING_SHIFT_T(y) (y << 15)
#define TEMPERING_SHIFT_L(y) (y >> 18)
/* Initializing the array with a seed */
void _sgenrand_dc(_org_state *st, uint32_t seed)
{
int i;
for (i=0;i<N;i++) {
st->mt[i] = seed;
seed = (UINT32_C(1812433253) * (seed ^ (seed >> 30))) + i + 1;
/* See Knuth TAOCP Vol2. 3rd Ed. P.106 for multiplier. */
/* In the previous versions, MSBs of the seed affect */
/* only MSBs of the array mt[]. */
}
st->mti = N;
}
uint32_t _genrand_dc(_org_state *st)
{
uint32_t y;
static const uint32_t mag01[2]={0x0, MATRIX_A};
/* mag01[x] = x * MATRIX_A for x=0,1 */
if (st->mti >= N) { /* generate N words at one time */
int kk;
for (kk=0;kk<N-M;kk++) {
y = (st->mt[kk]&UPPER_MASK)|(st->mt[kk+1]&LOWER_MASK);
st->mt[kk] = st->mt[kk+M] ^ (y >> 1) ^ mag01[y & 0x1];
}
for (;kk<N-1;kk++) {
y = (st->mt[kk]&UPPER_MASK)|(st->mt[kk+1]&LOWER_MASK);
st->mt[kk] = st->mt[kk+(M-N)] ^ (y >> 1) ^ mag01[y & 0x1];
}
y = (st->mt[N-1]&UPPER_MASK)|(st->mt[0]&LOWER_MASK);
st->mt[N-1] = st->mt[M-1] ^ (y >> 1) ^ mag01[y & 0x1];
st->mti = 0;
}
y = st->mt[st->mti++];
y ^= TEMPERING_SHIFT_U(y);
y ^= TEMPERING_SHIFT_S(y) & TEMPERING_MASK_B;
y ^= TEMPERING_SHIFT_T(y) & TEMPERING_MASK_C;
y ^= TEMPERING_SHIFT_L(y);
return y;
}
// seive.c
#define WORDLEN 32
#define LSB 0x1
#define MAX_SEARCH 10000
_org_state global_mt19937;
/*******************************************************************/
static uint32_t nextA(_org_state *org, int w);
static uint32_t nextA_id(_org_state *org, int w, int id, int idw);
static void make_masks(int r, int w, mt_struct *mts);
static int get_irred_param(check32_t *ck, prescr_t *pre, _org_state *org,
mt_struct *mts,int id, int idw);
static mt_struct *alloc_mt_struct(int n);
static mt_struct *init_mt_search(check32_t *ck, prescr_t *pre, int w, int p);
static void end_mt_search(prescr_t *pre);
static void copy_params_of_mt_struct(mt_struct *src, mt_struct *dst);
static int proper_mersenne_exponent(int p);
/*******************************************************************/
/* When idw==0, id is not embedded into "a" */
#define FOUND 1
#define NOT_FOUND 0
static int get_irred_param(check32_t *ck, prescr_t *pre, _org_state *org,
mt_struct *mts, int id, int idw)
{
int i;
uint32_t a;
for (i=0; i<MAX_SEARCH; i++) {
if (idw == 0)
a = nextA(org, mts->ww);
else
a = nextA_id(org, mts->ww, id, idw);
if (NOT_REJECTED == _prescreening_dc(pre, a) ) {
if (IRRED
== _CheckPeriod_dc(ck, org, a,mts->mm,mts->nn,mts->rr,mts->ww)) {
mts->aaa = a;
break;
}
}
}
if (MAX_SEARCH == i) return NOT_FOUND;
return FOUND;
}
static uint32_t nextA(_org_state *org, int w)
{
uint32_t x, word_mask;
word_mask = 0xFFFFFFFF;
word_mask <<= WORDLEN - w;
word_mask >>= WORDLEN - w;
x = _genrand_dc(org);
x &= word_mask;
x |= (LSB << (w-1));
return x;
}
static uint32_t nextA_id(_org_state *org, int w, int id, int idw)
{
uint32_t x, word_mask;
word_mask = 0xFFFFFFFF;
word_mask <<= WORDLEN - w;
word_mask >>= WORDLEN - w;
word_mask >>= idw;
word_mask <<= idw;
x = _genrand_dc(org);
x &= word_mask;
x |= (LSB << (w-1));
x |= (uint32_t)id; /* embedding id */
return x;
}
static void make_masks(int r, int w, mt_struct *mts)
{
int i;
uint32_t ut, wm, um, lm;
wm = 0xFFFFFFFF;
wm >>= (WORDLEN - w);
ut = 0;
for (i=0; i<r; i++) {
ut <<= 1;
ut |= LSB;
}
lm = ut;
um = (~ut) & wm;
mts->wmask = wm;
mts->umask = um;
mts->lmask = lm;
}
static mt_struct *init_mt_search(check32_t *ck, prescr_t *pre, int w, int p)
{
int n, m, r;
mt_struct *mts;
if ( (w>32) || (w<31) ) {
printf ("Sorry, currently only w = 32 or 31 is allowded.\n");
return NULL;
}
if ( !proper_mersenne_exponent(p) ) {
if (p<521) {
printf ("\"p\" is too small.\n");
return NULL;
}
else if (p>44497){
printf ("\"p\" is too large.\n");
return NULL;
}
else {
printf ("\"p\" is not a Mersenne exponent.\n");
return NULL;
}
}
n = p/w + 1; /* since p is Mersenne Exponent, w never divids p */
mts = alloc_mt_struct(n);
if (NULL == mts) return NULL;
m = n/2;
if (m < 2) m = n-1;
r = n * w - p;
make_masks(r, w, mts);
_InitPrescreening_dc(pre, m, n, r, w);
_InitCheck32_dc(ck, r, w);
mts->mm = m;
mts->nn = n;
mts->rr = r;
mts->ww = w;
return mts;
}
static void end_mt_search(prescr_t *pre)
{
_EndPrescreening_dc(pre);
}
/*
w -- word size
p -- Mersenne Exponent
seed -- seed for original mt19937 to generate parameter.
*/
mt_struct *get_mt_parameter_st(int w, int p, uint32_t seed)
{
mt_struct *mts;
prescr_t pre;
_org_state org;
check32_t ck;
_sgenrand_dc(&org, seed);
mts = init_mt_search(&ck, &pre, w, p);
if (mts == NULL) return NULL;
if ( NOT_FOUND == get_irred_param(&ck, &pre, &org, mts,0,0) ) {
free_mt_struct(mts);
return NULL;
}
_get_tempering_parameter_hard_dc(mts);
end_mt_search(&pre);
return mts;
}
/*
w -- word size
p -- Mersenne Exponent
*/
mt_struct *get_mt_parameter(int w, int p)
{
mt_struct *mts;
prescr_t pre;
check32_t ck;
mts = init_mt_search(&ck, &pre, w, p);
if (mts == NULL) return NULL;
if ( NOT_FOUND == get_irred_param(&ck, &pre, &global_mt19937, mts,0,0) ) {
free_mt_struct(mts);
return NULL;