Skip to content
Snippets Groups Projects
Select Git revision
  • 60f3e6778c6b690ca627012f92df27b0eb0f32f3
  • master default protected
  • streebog
  • gost28147
  • master-updates
  • ed448
  • shake256
  • curve448
  • ecc-sqrt
  • gosthash94cp
  • cmac64
  • block16-refactor
  • siv-mode
  • cmac-layout
  • delete-des-compat
  • delete-rsa_blind
  • aes-struct-layout
  • release-3.4-fixes
  • struct-layout
  • attribute-deprecated
  • rename-data-symbols
  • nettle_3.5.1_release_20190627
  • nettle_3.5_release_20190626
  • nettle_3.5rc1
  • nettle_3.4.1_release_20181204
  • nettle_3.4.1rc1
  • nettle_3.4_release_20171119
  • nettle_3.4rc2
  • nettle_3.4rc1
  • nettle_3.3_release_20161001
  • nettle_3.2_release_20160128
  • nettle_3.1.1_release_20150424
  • nettle_3.1_release_20150407
  • nettle_3.1rc3
  • nettle_3.1rc2
  • nettle_3.1rc1
  • nettle_3.0_release_20140607
  • nettle_2.7.1_release_20130528
  • nettle_2.7_release_20130424
  • nettle_2.6_release_20130116
  • nettle_2.5_release_20120707
41 results

nettle-benchmark.c

Blame
  • Forked from Nettle / nettle
    Source project has a limited visibility.
    Stack.pmod 1.17 KiB
    #define error(X) throw( ({ (X), backtrace()[0..sizeof(backtrace())-2] }) )
    
    class stack {
      int ptr;
      array arr;
    
      void push(mixed val)
      {
        if(ptr == sizeof(arr)) {
          arr += allocate(ptr);
        }
        arr[ptr++] = val;
      }
    
      mixed top()
      {
        if (ptr) {
          return(arr[ptr-1]);
        }
        error("Stack underflow\n");
      }
    
      void quick_pop(void|int val)
      {
        if (val) {
          if (ptr < val) {
    	ptr = 0;
          } else {
    	ptr -= val;
          }
        } else {
          if (ptr > 0) {
    	ptr--;
          }
        }
      }
    
      mixed pop(void|int val)
      {
        mixed foo;
    
        if (val) {
          if (ptr <= 0) {
    	error("Stack underflow\n");
          }
    
          if (ptr < val) {
            val = ptr;
          }
          ptr -= val;
          foo = arr[ptr..ptr + val - 1];
     
          for (int i=0; i < val; i++) {
            arr[ptr + i] = 0;       /* Don't waste references */
          }
        } else {
          if(--ptr < 0)
    	error("Stack underflow\n");
        
          foo=arr[ptr];
          arr[ptr]=0; /* Don't waste references */
        }
        return foo;
      }
    
      void reset(int|void initial_size)
      {
        arr = allocate(initial_size || 32);
        ptr = 0;
      }
    
      void create(int|void initial_size)
      {
        arr = allocate(initial_size || 32);
      }
    };