src/gpu/pannotia/sssp/kernel.h - public/gem5-resources - Git at Google

 /************************************************************************************\
  *                                                                                  *
  * Copyright � 2014 Advanced Micro Devices, Inc.                                    *
  * Copyright (c) 2015 Mark D. Hill and David A. Wood                                *
  * Copyright (c) 2021 Gaurav Jain and Matthew D. Sinclair                           *
  * All rights reserved.                                                             *
  *                                                                                  *
  * Redistribution and use in source and binary forms, with or without               *
  * modification, are permitted provided that the following are met:                 *
  *                                                                                  *
  * You must reproduce the above copyright notice.                                   *
  *                                                                                  *
  * Neither the name of the copyright holder nor the names of its contributors       *
  * may be used to endorse or promote products derived from this software            *
  * without specific, prior, written permission from at least the copyright holder.  *
  *                                                                                  *
  * You must include the following terms in your license and/or other materials      *
  * provided with the software.                                                      *
  *                                                                                  *
  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"      *
  * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE        *
  * IMPLIED WARRANTIES OF MERCHANTABILITY, NON-INFRINGEMENT, AND FITNESS FOR A       *
  * PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER        *
  * OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,         *
  * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT  *
  * OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS      *
  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN          *
  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING  *
  * IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY   *
  * OF SUCH DAMAGE.                                                                  *
  *                                                                                  *
  * Without limiting the foregoing, the software may implement third party           *
  * technologies for which you must obtain licenses from parties other than AMD.     *
  * You agree that AMD has not obtained or conveyed to you, and that you shall       *
  * be responsible for obtaining the rights to use and/or distribute the applicable  *
  * underlying intellectual property rights related to the third party technologies. *
  * These third party technologies are not licensed hereunder.                       *
  *                                                                                  *
  * If you use the software (in whole or in part), you shall adhere to all           *
  * applicable U.S., European, and other export laws, including but not limited to   *
  * the U.S. Export Administration Regulations ("EAR") (15 C.F.R Sections 730-774),  *
  * and E.U. Council Regulation (EC) No 428/2009 of 5 May 2009.  Further, pursuant   *
  * to Section 740.6 of the EAR, you hereby certify that, except pursuant to a       *
  * license granted by the United States Department of Commerce Bureau of Industry   *
  * and Security or as otherwise permitted pursuant to a License Exception under     *
  * the U.S. Export Administration Regulations ("EAR"), you will not (1) export,     *
  * re-export or release to a national of a country in Country Groups D:1, E:1 or    *
  * E:2 any restricted technology, software, or source code you receive hereunder,   *
  * or (2) export to Country Groups D:1, E:1 or E:2 the direct product of such       *
  * technology or software, if such foreign produced direct product is subject to    *
  * national security controls as identified on the Commerce Control List (currently *
  * found in Supplement 1 to Part 774 of EAR).  For the most current Country Group   *
  * listings, or for additional information about the EAR or your obligations under  *
  * those regulations, please refer to the U.S. Bureau of Industry and Security's    *
  * website at http://www.bis.doc.gov/.                                              *
  *                                                                                  *
 \************************************************************************************/

 #ifndef KERNEL_H
 #define KERNEL_H

 #include "hip/hip_runtime.h"
 #define BIG_NUM 99999999

 /**
  * @brief   min.+
  * @param   num_nodes  Number of vertices
  * @param   row        CSR pointer array
  * @param   col        CSR column array
  * @param   data       Weight array
  * @param   x          Input vector
  * @param   y          Output vector
  */
 __global__ void
 spmv_min_dot_plus_kernel(const int num_rows, int *row, int *col, int *data,
                          int *x, int *y)
 {
     // Get my workitem id
     int tid = hipBlockDim_x * hipBlockIdx_x + hipThreadIdx_x;

     if (tid < num_rows) {
         // Get the start and end pointers
         int row_start = row[tid];
         int row_end = row[tid + 1];

         // Perform + for each pair of elements and a reduction with min
         int min = x[tid];
         for (int i = row_start; i < row_end; i++) {
             if (data[i] + x[col[i]] < min) {
                 min = data[i] + x[col[i]];
             }
         }
         y[tid] = min;
     }
 }

 /**
  * @brief   min.+
  * @param   num_nodes  number of vertices
  * @param   height     the height of the adjacency matrix (col-major)
  * @param   col        the col array
  * @param   data       the data array
  * @param   x          the input vector
  * @param   y          the output vector
  */
 __global__ void
 ell_min_dot_plus_kernel(const int num_nodes, const int height, int *col,
                         int *data, int *x, int *y)
 {
     // Get workitem id
     int tid = hipBlockDim_x * hipBlockIdx_x + hipThreadIdx_x;

     if (tid < num_nodes) {
         int mat_offset = tid;
         int min = x[tid];

         // The vertices process a row of matrix (col-major)
         for (int i = 0; i < height; i++) {
             int mat_elem = data[mat_offset];
             int vec_elem = x[col[mat_offset]];
             if (mat_elem + vec_elem < min) {
                 min = mat_elem + vec_elem;
             }
             mat_offset += num_nodes;
         }
         y[tid] = min;
     }
 }

 /**
  * @brief   vector_init
  * @param   vector1      vector1
  * @param   vector2      vector2
  * @param   i            source vertex id
  * @param   num_nodes    number of vertices
  */
 __global__ void
 vector_init(int *vector1, int *vector2, const int i, const int num_nodes)
 {
     int tid = hipBlockDim_x * hipBlockIdx_x + hipThreadIdx_x;

     if (tid < num_nodes) {
         if (tid == i) {
             // If it is the source vertex
             vector1[tid] = 0;
             vector2[tid] = 0;
         } else {
             // If it a non-source vertex
             vector1[tid] = BIG_NUM;
             vector2[tid] = BIG_NUM;
         }
     }
 }

 /**
  * @brief   vector_assign
  * @param   vector1      vector1
  * @param   vector2      vector2
  * @param   num_nodes    number of vertices
  */
 __global__ void
 vector_assign(int *vector1, int *vector2, const int num_nodes)
 {
     int tid = hipBlockDim_x * hipBlockIdx_x + hipThreadIdx_x;

     if (tid < num_nodes) {
         vector1[tid] = vector2[tid];
     }
 }

 /**
  * @brief   vector_diff
  * @param   vector1      vector1
  * @param   vector2      vector2
  * @param   stop         termination variable
  * @param   num_nodes    number of vertices
  */
 __global__ void
 vector_diff(int *vector1, int *vector2, int *stop, const int num_nodes)
 {
     int tid = hipBlockDim_x * hipBlockIdx_x + hipThreadIdx_x;

     if (tid < num_nodes) {
         if (vector2[tid] != vector1[tid]) {
             *stop = 1;
         }
     }
 }

 #endif // KERNEL_H
	/************************************************************************************\
	* *
	* Copyright � 2014 Advanced Micro Devices, Inc. *
	* Copyright (c) 2015 Mark D. Hill and David A. Wood *
	* Copyright (c) 2021 Gaurav Jain and Matthew D. Sinclair *
	* All rights reserved. *
	* *
	* Redistribution and use in source and binary forms, with or without *
	* modification, are permitted provided that the following are met: *
	* *
	* You must reproduce the above copyright notice. *
	* *
	* Neither the name of the copyright holder nor the names of its contributors *
	* may be used to endorse or promote products derived from this software *
	* without specific, prior, written permission from at least the copyright holder. *
	* *
	* You must include the following terms in your license and/or other materials *
	* provided with the software. *
	* *
	* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" *
	* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE *
	* IMPLIED WARRANTIES OF MERCHANTABILITY, NON-INFRINGEMENT, AND FITNESS FOR A *
	* PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER *
	* OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, *
	* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT *
	* OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS *
	* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN *
	* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING *
	* IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY *
	* OF SUCH DAMAGE. *
	* *
	* Without limiting the foregoing, the software may implement third party *
	* technologies for which you must obtain licenses from parties other than AMD. *
	* You agree that AMD has not obtained or conveyed to you, and that you shall *
	* be responsible for obtaining the rights to use and/or distribute the applicable *
	* underlying intellectual property rights related to the third party technologies. *
	* These third party technologies are not licensed hereunder. *
	* *
	* If you use the software (in whole or in part), you shall adhere to all *
	* applicable U.S., European, and other export laws, including but not limited to *
	* the U.S. Export Administration Regulations ("EAR") (15 C.F.R Sections 730-774), *
	* and E.U. Council Regulation (EC) No 428/2009 of 5 May 2009. Further, pursuant *
	* to Section 740.6 of the EAR, you hereby certify that, except pursuant to a *
	* license granted by the United States Department of Commerce Bureau of Industry *
	* and Security or as otherwise permitted pursuant to a License Exception under *
	* the U.S. Export Administration Regulations ("EAR"), you will not (1) export, *
	* re-export or release to a national of a country in Country Groups D:1, E:1 or *
	* E:2 any restricted technology, software, or source code you receive hereunder, *
	* or (2) export to Country Groups D:1, E:1 or E:2 the direct product of such *
	* technology or software, if such foreign produced direct product is subject to *
	* national security controls as identified on the Commerce Control List (currently *
	* found in Supplement 1 to Part 774 of EAR). For the most current Country Group *
	* listings, or for additional information about the EAR or your obligations under *
	* those regulations, please refer to the U.S. Bureau of Industry and Security's *
	* website at http://www.bis.doc.gov/. *
	* *
	\************************************************************************************/

	#ifndef KERNEL_H
	#define KERNEL_H

	#include "hip/hip_runtime.h"
	#define BIG_NUM 99999999

	/**
	* @brief min.+
	* @param num_nodes Number of vertices
	* @param row CSR pointer array
	* @param col CSR column array
	* @param data Weight array
	* @param x Input vector
	* @param y Output vector
	*/
	__global__ void
	spmv_min_dot_plus_kernel(const int num_rows, int row, int col, int *data,
	int x, int y)
	{
	// Get my workitem id
	int tid = hipBlockDim_x * hipBlockIdx_x + hipThreadIdx_x;

	if (tid < num_rows) {
	// Get the start and end pointers
	int row_start = row[tid];
	int row_end = row[tid + 1];

	// Perform + for each pair of elements and a reduction with min
	int min = x[tid];
	for (int i = row_start; i < row_end; i++) {
	if (data[i] + x[col[i]] < min) {
	min = data[i] + x[col[i]];
	}
	}
	y[tid] = min;
	}
	}

	/**
	* @brief min.+
	* @param num_nodes number of vertices
	* @param height the height of the adjacency matrix (col-major)
	* @param col the col array
	* @param data the data array
	* @param x the input vector
	* @param y the output vector
	*/
	__global__ void
	ell_min_dot_plus_kernel(const int num_nodes, const int height, int *col,
	int data, int x, int *y)
	{
	// Get workitem id
	int tid = hipBlockDim_x * hipBlockIdx_x + hipThreadIdx_x;

	if (tid < num_nodes) {
	int mat_offset = tid;
	int min = x[tid];

	// The vertices process a row of matrix (col-major)
	for (int i = 0; i < height; i++) {
	int mat_elem = data[mat_offset];
	int vec_elem = x[col[mat_offset]];
	if (mat_elem + vec_elem < min) {
	min = mat_elem + vec_elem;
	}
	mat_offset += num_nodes;
	}
	y[tid] = min;
	}
	}

	/**
	* @brief vector_init
	* @param vector1 vector1
	* @param vector2 vector2
	* @param i source vertex id
	* @param num_nodes number of vertices
	*/
	__global__ void
	vector_init(int vector1, int vector2, const int i, const int num_nodes)
	{
	int tid = hipBlockDim_x * hipBlockIdx_x + hipThreadIdx_x;

	if (tid < num_nodes) {
	if (tid == i) {
	// If it is the source vertex
	vector1[tid] = 0;
	vector2[tid] = 0;
	} else {
	// If it a non-source vertex
	vector1[tid] = BIG_NUM;
	vector2[tid] = BIG_NUM;
	}
	}
	}

	/**
	* @brief vector_assign
	* @param vector1 vector1
	* @param vector2 vector2
	* @param num_nodes number of vertices
	*/
	__global__ void
	vector_assign(int vector1, int vector2, const int num_nodes)
	{
	int tid = hipBlockDim_x * hipBlockIdx_x + hipThreadIdx_x;

	if (tid < num_nodes) {
	vector1[tid] = vector2[tid];
	}
	}

	/**
	* @brief vector_diff
	* @param vector1 vector1
	* @param vector2 vector2
	* @param stop termination variable
	* @param num_nodes number of vertices
	*/
	__global__ void
	vector_diff(int vector1, int vector2, int *stop, const int num_nodes)
	{
	int tid = hipBlockDim_x * hipBlockIdx_x + hipThreadIdx_x;

	if (tid < num_nodes) {
	if (vector2[tid] != vector1[tid]) {
	*stop = 1;
	}
	}
	}

	#endif // KERNEL_H