//This file is take from caffe/crfasrnn


#define modHash(n) ((n)%(2*table_capacity));

namespace caffe {
  template<int kd>
  __device__ __host__ static unsigned int hash(signed short *key) {
    unsigned int k = 0;
    for (int i = 0; i < kd; i++) {
      k += key[i];
      k  = k * 1664525;
    }
    return k;
  }
  template<int kd>
  __device__ __host__ static unsigned int has(int *key) {
    unsigned int k = 0;
    for (int i = 0; i < kd; i++) {
      k += key[i];
      k  = k * 1664525;
    }
    return k;
  }
  template<int kd>
  __device__ static int hashTableInsert(unsigned int fh, signed short *key,
    signed short * table_keys,
    int* table_entries,
    int table_capacity,
    unsigned int slot)
    {
      int h = modHash(fh);
      while (1) {
        int *e = &table_entries[h];
        // if the cell is empty (-1), lock it (-2)
        int contents = atomicCAS(e, -1, -2);

        if (contents == -2) {
          // If it was locked already, move on the next cell

        } else if (contents == -1) {
          // If it was empty, we successfully locked it, write our key
          for (int i = 0; i < kd; i++) {
            table_keys[slot*kd+i] = key[i];
          }
          // Unlock
          atomicExch(e, slot);

          return h;
        } else {
          // The cell is unlocked and has a key in it, check if it matches
          bool match = true;
          for (int i = 0; i < kd && match; i++) {
            match  = (table_keys[contents*kd+i] == key[i]);
          }
          if (match) return h;
        }
        // increment the bucket with wraparound
        h++;
        if (h == table_capacity*2) h = 0;
      }
    }

    template<int kd>
    __device__ static int hashTableInsert(signed short *key,
    signed short* table_keys,
    int* table_entries,
    int table_capacity,
    unsigned int slot) {
      unsigned int myHash = hash<kd>(key);
      return hashTableInsert<kd>(myHash, key, table_keys, table_entries, table_capacity, slot);
    }

    template<int kd>
    __device__ static int hashTableRetrieve(signed short*key,
      const int * table_entries,
      const signed short* table_keys,
      const int table_capacity) {
        int h = modHash(hash<kd>(key));
        while (1) {
          const int *e = table_entries + h;
          if (*e == -1) return -1;
          bool match = true;
          for (int i = 0; i < kd && match; i++) {
            match = (table_keys[(*e)*kd+i] == key[i]);
          }
          if (match) return *e;

          h++;
          if (h == table_capacity*2) h = 0;
        }
      }

} //namespace caffe


	.file	"tmpxft_0021510c_00000000-6_hash_helper.cudafe1.cpp"
	.text
#APP

#NO_APP
	.type	_ZL26__cudaUnregisterBinaryUtilv, @function
_ZL26__cudaUnregisterBinaryUtilv:
.LFB2015:
	.cfi_startproc
	endbr64
	movq	_ZL20__cudaFatCubinHandle(%rip), %rdi
	jmp	__cudaUnregisterFatBinary@PLT
	.cfi_endproc
.LFE2015:
	.size	_ZL26__cudaUnregisterBinaryUtilv, .-_ZL26__cudaUnregisterBinaryUtilv
	.section	.text.startup,"ax",@progbits
	.type	_ZL24__sti____cudaRegisterAllv, @function
_ZL24__sti____cudaRegisterAllv:
.LFB2038:
	.cfi_startproc
	endbr64
	pushq	%rax
	.cfi_def_cfa_offset 16
	leaq	_ZL15__fatDeviceText(%rip), %rdi
	call	__cudaRegisterFatBinary@PLT
	movq	%rax, %rdi
	movq	%rax, _ZL20__cudaFatCubinHandle(%rip)
	call	__cudaRegisterFatBinaryEnd@PLT
	leaq	_ZL26__cudaUnregisterBinaryUtilv(%rip), %rdi
	popq	%rdx
	.cfi_def_cfa_offset 8
	jmp	atexit@PLT
	.cfi_endproc
.LFE2038:
	.size	_ZL24__sti____cudaRegisterAllv, .-_ZL24__sti____cudaRegisterAllv
	.section	.init_array,"aw"
	.align 8
	.quad	_ZL24__sti____cudaRegisterAllv
	.section	.nvFatBinSegment,"aw"
	.align 8
	.type	_ZL15__fatDeviceText, @object
	.size	_ZL15__fatDeviceText, 24
_ZL15__fatDeviceText:
	.long	1180844977
	.long	1
	.quad	fatbinData
	.quad	0
	.local	_ZL20__cudaFatCubinHandle
	.comm	_ZL20__cudaFatCubinHandle,8,8
	.ident	"GCC: (Ubuntu 13.3.0-6ubuntu2~24.04) 13.3.0"
	.section	.note.GNU-stack,"",@progbits
	.section	.note.gnu.property,"a"
	.align 8
	.long	1f - 0f
	.long	4f - 1f
	.long	5
0:
	.string	"GNU"
1:
	.align 8
	.long	0xc0000002
	.long	3f - 2f
2:
	.long	0x3
3:
	.align 8
4:


#include <hip/hip_runtime.h>
//This file is take from caffe/crfasrnn


#define modHash(n) ((n)%(2*table_capacity));

namespace caffe {
  template<int kd>
  __device__ __host__ static unsigned int hash(signed short *key) {
    unsigned int k = 0;
    for (int i = 0; i < kd; i++) {
      k += key[i];
      k  = k * 1664525;
    }
    return k;
  }
  template<int kd>
  __device__ __host__ static unsigned int has(int *key) {
    unsigned int k = 0;
    for (int i = 0; i < kd; i++) {
      k += key[i];
      k  = k * 1664525;
    }
    return k;
  }
  template<int kd>
  __device__ static int hashTableInsert(unsigned int fh, signed short *key,
    signed short * table_keys,
    int* table_entries,
    int table_capacity,
    unsigned int slot)
    {
      int h = modHash(fh);
      while (1) {
        int *e = &table_entries[h];
        // if the cell is empty (-1), lock it (-2)
        int contents = atomicCAS(e, -1, -2);

        if (contents == -2) {
          // If it was locked already, move on the next cell

        } else if (contents == -1) {
          // If it was empty, we successfully locked it, write our key
          for (int i = 0; i < kd; i++) {
            table_keys[slot*kd+i] = key[i];
          }
          // Unlock
          atomicExch(e, slot);

          return h;
        } else {
          // The cell is unlocked and has a key in it, check if it matches
          bool match = true;
          for (int i = 0; i < kd && match; i++) {
            match  = (table_keys[contents*kd+i] == key[i]);
          }
          if (match) return h;
        }
        // increment the bucket with wraparound
        h++;
        if (h == table_capacity*2) h = 0;
      }
    }

    template<int kd>
    __device__ static int hashTableInsert(signed short *key,
    signed short* table_keys,
    int* table_entries,
    int table_capacity,
    unsigned int slot) {
      unsigned int myHash = hash<kd>(key);
      return hashTableInsert<kd>(myHash, key, table_keys, table_entries, table_capacity, slot);
    }

    template<int kd>
    __device__ static int hashTableRetrieve(signed short*key,
      const int * table_entries,
      const signed short* table_keys,
      const int table_capacity) {
        int h = modHash(hash<kd>(key));
        while (1) {
          const int *e = table_entries + h;
          if (*e == -1) return -1;
          bool match = true;
          for (int i = 0; i < kd && match; i++) {
            match = (table_keys[(*e)*kd+i] == key[i]);
          }
          if (match) return *e;

          h++;
          if (h == table_capacity*2) h = 0;
        }
      }

} //namespace caffe


	.text
	.file	"hash_helper.hip"
	.type	__hip_cuid_,@object             # @__hip_cuid_
	.bss
	.globl	__hip_cuid_
__hip_cuid_:
	.byte	0                               # 0x0
	.size	__hip_cuid_, 1

	.ident	"AMD clang version 18.0.0git (https://github.com/RadeonOpenCompute/llvm-project roc-6.3.2 25012 e5bf7e55c91490b07c49d8960fa7983d864936c4)"
	.section	".note.GNU-stack","",@progbits
	.addrsig
	.addrsig_sym __hip_cuid_

	.text
	.p2alignl 7, 3214868480
	.fill 96, 4, 3214868480
	.type	__hip_cuid_,@object             ; @__hip_cuid_
	.section	.bss,"aw",@nobits
	.globl	__hip_cuid_
__hip_cuid_:
	.byte	0                               ; 0x0
	.size	__hip_cuid_, 1

	.ident	"AMD clang version 18.0.0git (https://github.com/RadeonOpenCompute/llvm-project roc-6.3.2 25012 e5bf7e55c91490b07c49d8960fa7983d864936c4)"
	.section	".note.GNU-stack","",@progbits
	.addrsig
	.addrsig_sym __hip_cuid_
	.amdgcn_target "amdgcn-amd-amdhsa--gfx1100"
	.amdgpu_metadata
---
amdhsa.kernels:  []
amdhsa.target:   amdgcn-amd-amdhsa--gfx1100
amdhsa.version:
  - 1
  - 2
...

	.end_amdgpu_metadata
