⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 check_graph.c

📁 fortran并行计算包
💻 C
字号:
/*   (C) 2004 by Argonne National Laboratory.       See COPYRIGHT in top-level directory.*/#include "collchk.h" int CollChk_check_graph(MPI_Comm comm, int nnodes, int *index, int* edges,                        char* call){    char err_str[COLLCHK_STD_STRLEN], check[COLLCHK_SM_STRLEN];    int idx, e;    e = -1;    if (    CollChk_same_int(comm, nnodes, call, "Nnodes", err_str)         != MPI_SUCCESS ) {        return CollChk_err_han(err_str, COLLCHK_ERR_GRAPH, call, comm);    }    for ( idx=0; idx<nnodes; idx++ ) {        sprintf(check, "Index Sub %d", idx);        if (    CollChk_same_int(comm, index[idx], call, check, err_str)             != MPI_SUCCESS) {            return CollChk_err_han(err_str, COLLCHK_ERR_GRAPH, call, comm);        }                e = index[idx];    }    /*        The e=index[idx] looks very suspicious in the following loop.        1) The loop does not modify the array index[] ??        2) if e is modified, so is the termination condition of the loop!???    */    for (idx=0; idx<e; idx++) {        sprintf(check, "Edges Sub %d", idx);                if(    CollChk_same_int(comm, edges[idx], call, check, err_str)            != MPI_SUCCESS) {            return CollChk_err_han(err_str, COLLCHK_ERR_GRAPH, call, comm);        }        e = index[idx];    }    return MPI_SUCCESS;}

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -