Skip to content
Snippets Groups Projects
Select Git revision
  • ffec6637e0297eb2cc97f8f7ffbb34af184b8f11
  • master default
  • wip-slh-dsa-sha2-128s
  • master-updates
  • release-3.10-fixes
  • getopt-prototype
  • fix-bcrypt-warning
  • refactor-hmac
  • wip-use-alignas
  • trim-sha3-context
  • fix-gitlab-ci
  • check-fat-emulate
  • delete-digest_func-size
  • slh-dsa-shake-128f-nettle
  • slh-dsa-shake-128s-nettle
  • slh-dsa-shake-128s
  • delete-openpgp
  • ppc64-sha512
  • delete-md5-compat
  • cleanup-hmac-tests
  • ppc64-sha256
  • nettle_3.10.2_release_20250626
  • nettle_3.10.1_release_20241230
  • nettle_3.10_release_20240616
  • nettle_3.10rc2
  • nettle_3.10rc1
  • nettle_3.9.1_release_20230601
  • nettle_3.9_release_20230514
  • nettle_3.8.1_release_20220727
  • nettle_3.8_release_20220602
  • nettle_3.7.3_release_20210606
  • nettle_3.7.2_release_20210321
  • nettle_3.7.1_release_20210217
  • nettle_3.7_release_20210104
  • nettle_3.7rc1
  • nettle_3.6_release_20200429
  • nettle_3.6rc3
  • nettle_3.6rc2
  • nettle_3.6rc1
  • nettle_3.5.1_release_20190627
  • nettle_3.5_release_20190626
41 results

nettle-internal.c

Blame
  • 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);
      }
    };