clcg4.h File Reference

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Defines
#define	Maxgen   100
Enumerations
enum	SeedType { InitialSeed, LastSeed, NewSeed }
Functions
int	set_seed_clcg4 (int g, double s0, double s1, double s2, double s3)
void	get_state_clcg4 (int g, double s[4])
void	init_generator_clcg4 (int g, SeedType Where)
void	advance_state_clcg4 (int g, int k)
int	set_initial_seed_clcg4 (double s0, double s1, double s2, double s3)
unsigned long	clcg4 (int g)

---

Define Documentation

#define Maxgen   100

Definition at line 4 of file clcg4.h.

Referenced by RandI(), and set_initial_seed_clcg4().

---

Enumeration Type Documentation

enum SeedType

Enumerator:

InitialSeed
LastSeed
NewSeed

Definition at line 6 of file clcg4.h.

{InitialSeed, LastSeed, NewSeed}  SeedType;

---

Function Documentation

void advance_state_clcg4	(	int	g,
		int	k
	)

Definition at line 219 of file clcg4.c.

References a, b, Cg, i, Ig, init_clcg4(), init_generator_clcg4(), InitialSeed, is_init, j, m, MultModM(), v_default, and w_default.

Referenced by RandI().

{
  long int b[4];
  int i, j;

  if (! is_init ) {init_clcg4(v_default,w_default); is_init = 1; };

  for ( j = 0 ; j < 4 ; j++ )
    {
      b[j] = a[j];
      for ( i = 1 ; i <= k ; i++ )
        b[j] = MultModM( b[j], b[j], m[j]);
      Ig[j][g] = MultModM ( b[j], Cg[j][g], m[j] );
    }
  init_generator_clcg4(g, InitialSeed);
}

Here is the call graph for this function:

Here is the caller graph for this function:

unsigned long clcg4

(

int

g

)

Definition at line 263 of file clcg4.c.

References Cg, init_clcg4(), is_init, s, v_default, and w_default.

Referenced by clcg4_with_gen().

{
  /* Modif Bruno : the generator have now the form (1) in place of (2) */

  long k,s;
  double u;

  if (! is_init ) {init_clcg4(v_default,w_default); is_init = 1; };

  /*  advance the 4 LCG */
  s = Cg [0][g];  k = s / 46693;
  s = 45991 * (s - k * 46693) - k * 25884;
  if (s < 0) s = s + 2147483647;  Cg [0][g] = s;
 
  s = Cg [1][g];  k = s / 10339;
  s = 207707 * (s - k * 10339) - k * 870;
  if (s < 0) s = s + 2147483543;  Cg [1][g] = s;

  s = Cg [2][g];  k = s / 15499;
  s = 138556 * (s - k * 15499) - k * 3979;
  if (s < 0) s = s + 2147483423;  Cg [2][g] = s;

  s = Cg [3][g];  k = s / 43218;
  s = 49689 * (s - k * 43218) - k * 24121;
  if (s < 0) s = s + 2147483323;  Cg [3][g] = s;

  /*  final step */
  u = (double)(Cg[0][g] - Cg[1][g]) + (double)(Cg[2][g] - Cg[3][g]);
  /*  we must do  u mod 2147483647 with u in [- 4294966863 ; 4294967066 ] : */
  if (u < 0) u += 2147483647;
  if (u < 0) u += 2147483647;
  if (u >= 2147483647) u -= 2147483647;
  if (u >= 2147483647) u -= 2147483647;

  return ((unsigned long) u );

}

Here is the call graph for this function:

Here is the caller graph for this function:

void get_state_clcg4	(	int	g,
		double	s[4]
	)

Definition at line 193 of file clcg4.c.

References Cg, init_clcg4(), is_init, j, v_default, and w_default.

Referenced by RandI().

{
  int j;
  if (! is_init ) {init_clcg4(v_default,w_default); is_init = 1; };
  for (j = 0; j < 4; j++)  s [j] = (double) Cg [j][g];
}

Here is the call graph for this function:

Here is the caller graph for this function:

void init_generator_clcg4	(	int	g,
		SeedType	Where
	)

Definition at line 200 of file clcg4.c.

References aw, Cg, Ig, init_clcg4(), InitialSeed, is_init, j, LastSeed, Lg, m, MultModM(), NewSeed, v_default, and w_default.

Referenced by advance_state_clcg4(), RandI(), set_initial_seed_clcg4(), and set_seed_clcg4().

{
  int j;
  if (! is_init ) {init_clcg4(v_default,w_default); is_init = 1; };
  for (j = 0; j < 4; j++)
    {
      switch (Where)
        {
        case InitialSeed :
          Lg [j][g] = Ig [j][g];   break;
        case NewSeed :
          Lg [j][g] = MultModM (aw [j], Lg [j][g], m [j]);   break;
        case LastSeed :
          break;
        }
      Cg [j][g] = Lg [j][g];
    }
}

Here is the call graph for this function:

Here is the caller graph for this function:

int set_initial_seed_clcg4	(	double	s0,
		double	s1,
		double	s2,
		double	s3
	)

Definition at line 236 of file clcg4.c.

References avw, comp_aw_and_avw(), display_info_clcg4(), g, Ig, init_generator_clcg4(), InitialSeed, is_init, j, long, m, Maxgen, MultModM(), v_default, verif_seeds_clcg4(), and w_default.

Referenced by init_clcg4(), and RandI().

{
  int g, j;

  if (! is_init )  comp_aw_and_avw(v_default,w_default);

  if ( ! verif_seeds_clcg4(s0, s1, s2, s3) )
    {
      display_info_clcg4();
      return ( 0 );
    };

  is_init = 1;
  Ig [0][0] = (long) s0;
  Ig [1][0] = (long) s1;
  Ig [2][0] = (long) s2;
  Ig [3][0] = (long) s3;
  init_generator_clcg4(0, InitialSeed);
  for (g = 1; g <= Maxgen; g++)
    {
      for (j = 0; j < 4; j++)
        Ig [j][g] = MultModM (avw [j], Ig [j][g-1], m [j]);
      init_generator_clcg4(g, InitialSeed);
    }
  return ( 1 );
}

Here is the call graph for this function:

Here is the caller graph for this function:

int set_seed_clcg4	(	int	g,
		double	s0,
		double	s1,
		double	s2,
		double	s3
	)

Definition at line 172 of file clcg4.c.

References display_info_clcg4(), Ig, init_clcg4(), init_generator_clcg4(), InitialSeed, is_init, long, sciprint(), v_default, verif_seeds_clcg4(), and w_default.

Referenced by RandI().

{
  if (! is_init ) {init_clcg4(v_default,w_default); is_init = 1; };

  if ( verif_seeds_clcg4(s0, s1, s2, s3) )
    {
      Ig [0][g] = (long) s0; Ig [1][g] = (long) s1;
      Ig [2][g] = (long) s2; Ig [3][g] = (long) s3;
      init_generator_clcg4(g, InitialSeed);
      sciprint("\n\r => be aware that you have may lost synchronization");
      sciprint("\n\r    between the virtual gen %d and the others !", g);
      sciprint("\n\r    use grand(\"setall\", s1, s2, s3, s4) if you want recover it.");
      return ( 1 );
    }
  else
    {
      display_info_clcg4();
      return ( 0 );
    }
}

Here is the call graph for this function:

Here is the caller graph for this function:

---