src/gpu/pannotia/color/kernel_maxmin.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_MAXMIN_H
 #define KERNEL_MAXMIN_H

 #include "hip/hip_runtime.h"

 #define BIG_NUM 999999

 /**
  * @brief   color kernel 1
  * @param   row         CSR pointer array
  * @param   col         CSR column array
  * @param   node_value  Vertex value array
  * @param   color_array Color value array
  * @param   stop        Termination variable
  * @param   max_d       Max array
  * @param   max_d       Min array
  * @param   color       Current color label
  * @param   num_nodes   Number of vertices
  * @param   num_edges   Number of edges
  */
 __global__ void color1(int *row, int *col, int *node_value, int *color_array,
                        int *stop, int *max_d, int *min_d, const int color,
                        const int num_nodes, const int num_edges)
 {
     // Get my workitem id
     int tid = blockIdx.x * blockDim.x + threadIdx.x;

     if (tid < num_nodes) {
         // If the vertex is not colored
         if (color_array[tid] == -1) {

             // Get the start and end pointers for the neighbor list
             int start = row[tid];
             int end;
             if (tid + 1 < num_nodes)
                 end = row[tid + 1];
             else
                 end = num_edges;

             int maximum = -1;
             int minimum = BIG_NUM;
             // Navigate the neighborlist
             for (int edge = start; edge < end; edge++) {
                 if (color_array[col[edge]] == -1 && start != end - 1) {
                     *stop = 1;
                     // Determine if the vertex value is the maximum/minimum in the neighborhood
                     if (node_value[col[edge]] > maximum)
                         maximum = node_value[col[edge]];
                     if (node_value[col[edge]] < minimum)
                         minimum = node_value[col[edge]];
                 }
             }
             // Assign the maximum/miminum value to max/min array
             max_d[tid] = maximum;
             min_d[tid] = minimum;
         }
     }
 }

 /**
  * @brief   color kernel 2
  * @param   node_value  Vertex value array
  * @param   color_array Color value array
  * @param   max_d       Max array
  * @param   min_d       Min array
  * @param   color       Current color label
  * @param   num_nodes   Number of vertices
  * @param   num_edges   Number of edges
  */
 __global__ void color2(int *node_value, int *color_array, int *max_d,
                        int *min_d, const int color, const int num_nodes,
                        const int num_edges)
 {
     // Get my workitem id
     int tid = blockIdx.x * blockDim.x + threadIdx.x;

     if (tid < num_nodes) {
         // If the vertex is still not colored
         if (color_array[tid] == -1) {
             // Assign a color
             if (node_value[tid] >= max_d[tid])
                 color_array[tid] = color;
             if (node_value[tid] <= min_d[tid])
                 color_array[tid] = color + 1;
         }
     }

 }

 /**
  * @brief   init kernel
  * @param   max_d       Max array
  * @param   min_d       Min array
  * @param   num_nodes   Number of vertices
  */
 __global__ void ini(int *max_d, int *min_d, const int num_nodes)
 {
     // Get my workitem id
     int tid = blockIdx.x * blockDim.x + threadIdx.x;

     // Initialize max: -1 and min: Big_num
     if (tid < num_nodes) {
         max_d[tid] = -1;
         min_d[tid] = BIG_NUM;
     }

 }

 #endif
	/************************************************************************************\
	* *
	* 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_MAXMIN_H
	#define KERNEL_MAXMIN_H

	#include "hip/hip_runtime.h"

	#define BIG_NUM 999999

	/**
	* @brief color kernel 1
	* @param row CSR pointer array
	* @param col CSR column array
	* @param node_value Vertex value array
	* @param color_array Color value array
	* @param stop Termination variable
	* @param max_d Max array
	* @param max_d Min array
	* @param color Current color label
	* @param num_nodes Number of vertices
	* @param num_edges Number of edges
	*/
	__global__ void color1(int row, int col, int node_value, int color_array,
	int stop, int max_d, int *min_d, const int color,
	const int num_nodes, const int num_edges)
	{
	// Get my workitem id
	int tid = blockIdx.x * blockDim.x + threadIdx.x;

	if (tid < num_nodes) {
	// If the vertex is not colored
	if (color_array[tid] == -1) {

	// Get the start and end pointers for the neighbor list
	int start = row[tid];
	int end;
	if (tid + 1 < num_nodes)
	end = row[tid + 1];
	else
	end = num_edges;

	int maximum = -1;
	int minimum = BIG_NUM;
	// Navigate the neighborlist
	for (int edge = start; edge < end; edge++) {
	if (color_array[col[edge]] == -1 && start != end - 1) {
	*stop = 1;
	// Determine if the vertex value is the maximum/minimum in the neighborhood
	if (node_value[col[edge]] > maximum)
	maximum = node_value[col[edge]];
	if (node_value[col[edge]] < minimum)
	minimum = node_value[col[edge]];
	}
	}
	// Assign the maximum/miminum value to max/min array
	max_d[tid] = maximum;
	min_d[tid] = minimum;
	}
	}
	}

	/**
	* @brief color kernel 2
	* @param node_value Vertex value array
	* @param color_array Color value array
	* @param max_d Max array
	* @param min_d Min array
	* @param color Current color label
	* @param num_nodes Number of vertices
	* @param num_edges Number of edges
	*/
	__global__ void color2(int node_value, int color_array, int *max_d,
	int *min_d, const int color, const int num_nodes,
	const int num_edges)
	{
	// Get my workitem id
	int tid = blockIdx.x * blockDim.x + threadIdx.x;

	if (tid < num_nodes) {
	// If the vertex is still not colored
	if (color_array[tid] == -1) {
	// Assign a color
	if (node_value[tid] >= max_d[tid])
	color_array[tid] = color;
	if (node_value[tid] <= min_d[tid])
	color_array[tid] = color + 1;
	}
	}

	}

	/**
	* @brief init kernel
	* @param max_d Max array
	* @param min_d Min array
	* @param num_nodes Number of vertices
	*/
	__global__ void ini(int max_d, int min_d, const int num_nodes)
	{
	// Get my workitem id
	int tid = blockIdx.x * blockDim.x + threadIdx.x;

	// Initialize max: -1 and min: Big_num
	if (tid < num_nodes) {
	max_d[tid] = -1;
	min_d[tid] = BIG_NUM;
	}

	}

	#endif