Skip to content
Snippets Groups Projects
Select Git revision
  • 9fc89ec67cfb304d2416c045fa03a3790ce925fa
  • master default protected
  • 9.0
  • 8.0
  • nt-tools
  • 7.8
  • 7.6
  • 7.4
  • 7.2
  • 7.0
  • 0.6
  • rosuav/latex-markdown-renderer
  • rxnpatch/rxnpatch
  • marcus/gobject-introspection
  • rxnpatch/8.0
  • rosuav/pre-listening-ports
  • rosuav/async-annotations
  • rosuav/pgsql-ssl
  • rxnpatch/rxnpatch-broken/2023-10-06T094250
  • grubba/fdlib
  • grubba/wip/sakura/8.0
  • v8.0.2020
  • v8.0.2018
  • v8.0.2016
  • v8.0.2014
  • v8.0.2012
  • v8.0.2008
  • v8.0.2006
  • v8.0.2004
  • v8.0.2002
  • v8.0.2000
  • v8.0.1998
  • v8.0.1996
  • v8.0.1994
  • v8.0.1992
  • v8.0.1990
  • v8.0.1988
  • v8.0.1986
  • rxnpatch/clusters/8.0/2025-04-29T124414
  • rxnpatch/2025-04-29T124414
  • v8.0.1984
41 results

Array.pmod

  • yarrow-test.c 5.71 KiB
    #include "yarrow.h"
    
    #include "macros.h"
    #include "testutils.h"
    
    #include <assert.h>
    #include <errno.h>
    #include <stdio.h>
    #include <stdlib.h>
    #include <string.h>
    
    /* Lagged fibonacci sequence as described in Knuth 3.6 */
    
    #define KK 100
    #define LL 37
    #define MM (1UL << 30)
    #define TT 70
    
    uint32_t ran_x[KK];
    unsigned ran_index;
    
    static void
    ran_init(uint32_t seed)
    {
      uint32_t t,j;
      uint32_t x[2*KK - 1];
      uint32_t ss = (seed + 2) & (MM-2);
    
      for (j = 0; j<KK; j++)
        {
          x[j] = ss;
          ss <<= 1;  if (ss >= MM) ss -= (MM-2);
        }
      for (;j< 2*KK-1; j++)
        x[j] = 0;
    
      x[1]++;
    
      ss = seed & (MM-1);
      for (t = TT-1; t; )
        {
          for (j = KK-1; j>0; j--)
            x[j+j] = x[j];
          for (j = 2*KK-2; j > KK-LL; j-= 2)
            x[2*KK-1-j] = x[j] & ~1;
          for (j = 2*KK-2; j>=KK; j--)
            if (x[j] & 1)
              {
                x[j-(KK-LL)] = (x[j - (KK-LL)] - x[j]) & (MM-1);
                x[j-KK] = (x[j-KK] - x[j]) & (MM-1);
              }
          if (ss & 1)
            {
              for (j=KK; j>0; j--)
                x[j] = x[j-1];
              x[0] = x[KK];
              if (x[KK] & 1)
                x[LL] = (x[LL] - x[KK]) & (MM-1);
            }
          if (ss)
            ss >>= 1;
          else
            t--;
        }
      for (j=0; j<LL; j++)
        ran_x[j+KK-LL] = x[j];
      for (; j<KK; j++)
        ran_x[j-LL] = x[j];
    
      ran_index = 0;