/************************************************************************************\
 *                                                                                  *
 * 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_SPMV_H
#define KERNEL_SPMV_H

#include "hip/hip_runtime.h"

/**
 * @brief   inibuffer
 * @param   page_rank1   PageRank array 1
 * @param   page_rank2   PageRank array 2
 * @param   num_nodes    number of vertices
 */
__global__ void
inibuffer(float *page_rank1, float *page_rank2, const int num_nodes)
{
    // Get my workitem id
    int tid = blockDim.x * blockIdx.x + threadIdx.x;
    // Initialize two pagerank arrays
    if (tid < num_nodes) {
        page_rank1[tid] = 1 / (float)num_nodes;
        page_rank2[tid] = 0.0f;
    }
}

/**
 * @brief   inicsr
 * @param   row        csr pointer array
 * @param   col        csr col array
 * @param   data       csr weigh array
 * @param   col_cnt    array for #. out-going edges
 * @param   num_nodes  number of vertices
 * @param   num_edges  number of edges
 */
__global__ void
inicsr(int *row, int *col, float *data, int *col_cnt, int num_nodes,
       int num_edges)
{
    // Get my workitem id
    int tid = blockDim.x * blockIdx.x + threadIdx.x;
    if (tid < num_nodes) {
        // Get the starting and ending pointers
        int start = row[tid];
        int end;
        if (tid + 1 < num_nodes) {
            end = row[tid + 1] ;
        } else {
            end = num_edges;
        }

        int nid;
        // Navigate one row of data
        for (int edge = start; edge < end; edge++) {
            nid = col[edge];
            // Each neighbor will get equal amount of pagerank
            data[edge] = 1.0 / (float)col_cnt[nid];
        }
    }
}

/**
 * @brief   spmv_csr_scalar_kernel (simple spmv)
 * @param   num_nodes  number of vertices
 * @param   row        csr pointer array
 * @param   col        csr col array
 * @param   data       csr weigh array
 * @param   x          input vector
 * @param   y          output vector
 */
__global__ void
spmv_csr_scalar_kernel(const int num_nodes, int *row, int *col, float *data,
                       float *x, float *y)
{
    // Get my workitem id
    int tid = blockDim.x * blockIdx.x + threadIdx.x;
    if (tid < num_nodes) {
        // Get the start and end pointers
        int row_start = row[tid];
        int row_end = row[tid + 1];
        float sum = 0;
        //navigate one row and sum all the elements
        for (int j = row_start; j < row_end; j++) {
            sum += data[j] * x[col[j]];
        }
        y[tid] += sum;
    }
}

/**
 * @brief   pagerank2
 * @param   page_rank1   PageRank array 1
 * @param   page_rank2   PageRank array 2
 * @param   num_nodes    number of vertices
 */
__global__ void
pagerank2(float *page_rank1, float *page_rank2, const int num_nodes)
{
    // Get my workitem id
    int tid = blockDim.x * blockIdx.x + threadIdx.x;
    // Update pagerank value with damping factor
    if (tid < num_nodes) {
        page_rank1[tid]	= 0.15f / (float)num_nodes + 0.85f * page_rank2[tid];
        page_rank2[tid] = 0.0f;
    }
}

#endif // KERNEL_SPMV_H