|
|
|
template<class T , int depth> |
| __device__ void | binSearch_frag_mult (T *keyArraySmem, T *valueArraySmem, int offset, int &mid, T cmpValue, T testValue, int myAddress, int testGlobalIndex, T *globalPointerArray, T *globalStringArray, int bIndex, size_t numElements) |
| |
|
template<class T , int depth> |
| __device__ void | linearStringMerge (T *searchArray, T *pointerArray, T *A_values, T myKey, T myAddress, int &index, T &cmpValue, T *saveGlobalArray, T *savePointerArray, T *stringValues, int myStartIdxC, int myStartIdxA, int myStartIdxB, int localAPartSize, int localBPartSize, int localCPartSize, T localMaxB, T finalMaxB, T localMinB, int tid, int aIndex, int bIndex, int offset, int subPartitions, size_t numElements) |
| |
|
template<class T , int depth> |
| __device__ void | binSearch_fragment (T *binArray, T *pointerBinArray, int offset, int &mid, T cmpValue, T testValue, T myAddress, T *globalStringArray, T *globalStringArray2, size_t numElements) |
| |
|
template<class T , int depth> |
| __device__ void | lin_merge_simple (T &cmpValue, T myKey, T myAddress, int &index, T *BKeys, T *BValues, T *stringValues, T *A_values, T *A_keys_out, T *A_values_out, int myStartIdxA, int myStartIdxB, int myStartIdxC, T localMinB, T localMaxB, int aCont, int bCont, int totalSize, int sizePerPartition, int i, T *stringValues2, size_t numElements) |
| |
|
template<class T , int depth> |
| __device__ void | bin_search_block (T &cmpValue, T tmpVal, T *in, T *addressPad, const T *stringVals, int &j, int bump, T *stringVals2, size_t numElements) |
| |
|
template<class T , int depth> |
| __device__ void | lin_search_block (T &cmpValue, T &tmpVal, T *in, T *addressPad, const T *stringVals, int &j, int offset, int last, int startAddress, int addPart, T *stringVals2, size_t numElements) |
| |
|
template<class T > |
| __device__ void | compareSwapVal (T &A1, T &A2, const int index1, const int index2, T *scratch, const T *stringVals, T *stringVals2, size_t numElements) |
| |
|
__device__ void | BitArraySetBit (huffman_code *ba, unsigned int bit) |
| |
|
__device__ void | BitArrayShiftLeft (huffman_code *ba, unsigned int shifts) |
| |
|
__device__ void | BitArrayShiftRight (huffman_code *ba, unsigned int shifts) |
| |
|
__device__ int | FindMinimumCount (my_huffman_node_t *ht, int elements) |
| |
CUDPP CTA-level compress routines.
compress_cta.cu
1.8.5
