From e291cbe16ec97b852770ebb70d40ca9fdece2d66 Mon Sep 17 00:00:00 2001
From: Mathieu Faverge <mathieu.faverge@inria.fr>
Date: Fri, 18 Dec 2015 14:30:11 +0100
Subject: [PATCH] Move to the attic unused files
---
z_csc_utils.c | 1508 -------------------
z_csc_utils.h | 275 ----
z_cscd_utils.c | 3237 ----------------------------------------
z_cscd_utils.h | 311 ----
z_cscd_utils_fortran.c | 281 ----
z_cscd_utils_intern.h | 194 ---
6 files changed, 5806 deletions(-)
delete mode 100644 z_csc_utils.c
delete mode 100644 z_csc_utils.h
delete mode 100644 z_cscd_utils.c
delete mode 100644 z_cscd_utils.h
delete mode 100644 z_cscd_utils_fortran.c
delete mode 100644 z_cscd_utils_intern.h
diff --git a/z_csc_utils.c b/z_csc_utils.c
deleted file mode 100644
index a1f75b18..00000000
--- a/z_csc_utils.c
+++ /dev/null
@@ -1,1508 +0,0 @@
-/**
- * PaStiX CSC management routines.
- *
- * PaStiX is a software package provided by Inria Bordeaux - Sud-Ouest,
- * LaBRI, University of Bordeaux 1 and IPB.
- *
- * @version 1.0.0
- * @author Mathieu Faverge
- * @author Pierre Ramet
- * @author Xavier Lacoste
- * @date 2011-11-11
- * @precisions normal z -> c d s
- *
- **/
-#include "common.h"
-#include "z_csc_utils.h"
-
-/* /\* */
-/* Function: cmp_colrow */
-
-/* Used for qsort to sort arrays of pastix_int_t following their first element. */
-
-/* Returns the difference between the first element of *p1* and */
-/* the first element of *p2* */
-
-/* Parameters: */
-/* p1 - the first array to compare */
-/* p2 - the second array to compare */
-/* *\/ */
-/* int */
-/* cmp_colrow(const void *p1, const void *p2) */
-/* { */
-/* return ((* (pastix_int_t * const *) p1) - (*(pastix_int_t * const *) p2)); */
-/* } */
-
-/*
- Function: z_csc_symgraph
-
-
- Modify the CSC to a symetric graph one.
- Don't use it on a lower symetric CSC
- it would give you all the CSC upper + lower.
-
- External function.
-
- Parameters:
- n - Number of columns/vertices
- ia - Starting index of each column in *ja* and *a*
- ja - Row index of each element
- a - Value of each element,can be NULL
- newn - New number of column
- newia - Starting index of each column in *ja* and *a*
- newja - Row index of each element
- newa - Value of each element,can be NULL
-
- */
-int z_csc_symgraph( pastix_int_t n,
- const pastix_int_t *ia,
- const pastix_int_t *ja,
- const pastix_complex64_t *a,
- pastix_int_t *newn,
- pastix_int_t **newia,
- pastix_int_t **newja,
- pastix_complex64_t **newa)
-{
- return z_csc_symgraph_int(n, ia, ja, a, newn, newia, newja, newa, API_NO);
-}
-
-/*
- Function: csc_symgraph_int
-
-
- Modify the CSC to a symetric graph one.
- Don't use it on a lower symetric CSC
- it would give you all the CSC upper + lower.
-
- Parameters:
- n - Number of columns/vertices
- ia - Starting index of each column in *ja* and *a*
- ja - Row index of each element
- a - Value of each element,can be NULL
- newn - New number of column
- newia - Starting index of each column in *ja* and *a*
- newja - Row index of each element
- newa - Value of each element,can be NULL
- malloc_flag - flag to indicate if function call is intern to pastix or extern.
- */
-int z_csc_symgraph_int (pastix_int_t n,
- const pastix_int_t *ia,
- const pastix_int_t *ja,
- const pastix_complex64_t *a,
- pastix_int_t *newn,
- pastix_int_t **newia,
- pastix_int_t **newja,
- pastix_complex64_t **newa,
- int malloc_flag)
-{
- pastix_int_t * nbrEltCol = NULL; /* nbrEltCol[i] = Number of elt to add in column i */
- pastix_int_t * cia = NULL; /* ia of diff between good CSC and bad CSC */
- pastix_int_t * cja = NULL; /* ja of diff between good CSC and bad CSC */
- pastix_int_t nbr2add; /* Number of elt to add */
- pastix_int_t itercol, iterrow, iterrow2; /* iterators */
- pastix_int_t l = ia[n] -1;
- pastix_int_t newl;
-
- /* Ncol=Nrow don't need change */
- *newn = n;
-
- MALLOC_INTERN(nbrEltCol, n, pastix_int_t);
- /* !! Need check for malloc */
-
- /* Init nbrEltCol */
- for (itercol=0; itercol<n; itercol++)
- {
- nbrEltCol[itercol]=0;
- }
-
- /* Compute number of element by col to add for correcting the CSC */
- for (itercol=0; itercol<n; itercol++)
- {
- for (iterrow=ia[itercol]-1; iterrow<ia[itercol+1]-1; iterrow++)
- {
- if (ja[iterrow] != (itercol+1))
- {
- /* Not diagonal elt */
- /* So we have a (i,j) and we are looking for a (j,i) elt */
- /* i = itercol+1, j=ja[iterrow] */
- int rowidx=ja[iterrow]-1;
- int flag=0;
-
- for (iterrow2=ia[rowidx]-1; iterrow2<ia[rowidx+1]-1; iterrow2++)
- {
- if (ja[iterrow2] == itercol+1)
- {
- /* Ok we found (j,i) so stop this madness */
- flag = 1;
- break;
- }
- }
-
- if (flag==0)
- {
- /* We never find (j,i) so increase nbrEltCol[j] */
- (nbrEltCol[ja[iterrow]-1])++;
- }
- }
- }
- }
-
- /* Compute number of element to add */
- /* And cia=ia part of csc of element to add */
- /* kind of a diff between the corrected one and the original CSC */
- MALLOC_INTERN(cia, n+1, pastix_int_t);
- /* !! Need checking good alloc) */
- nbr2add=0;
- for (itercol=0;itercol<n;itercol++)
- {
- cia[itercol]=nbr2add;
- nbr2add += nbrEltCol[itercol];
- }
- cia[n]=nbr2add;
- /*fprintf(stderr, "nbr of elt to add %ld\n", nbr2add);*/
-
- if (nbr2add != 0)
- {
- /* Build cja */
- /* like cia, cja is ja part of diff CSC */
- MALLOC_INTERN(cja, nbr2add, pastix_int_t);
- /* !! again we need check of memAlloc */
-
- /* We walkthrough again the csc */
- for (itercol=0;itercol<n;itercol++)
- {
- for (iterrow=ia[itercol]-1;iterrow<ia[itercol+1]-1;iterrow++)
- {
- if (ja[iterrow] != itercol+1)
- {
- /* we find (i,j) need to find (j,i) */
- int rowidx=ja[iterrow]-1;
- int flag=0;
-
- for (iterrow2=ia[rowidx]-1;iterrow2<ia[rowidx+1]-1;iterrow2++)
- {
- if (ja[iterrow2] == itercol+1)
- {
- /* find (j,i) */
- flag=1;
- break;
- }
- }
-
- if (flag==0)
- {
- /* We don't find (j,i) so put in diff CSC (cia,cja,0) */
- pastix_int_t index=ja[iterrow]-1;
- /* cia[index] = index to put in cja the elt */
- cja[cia[index]] = itercol+1;
- (cia[index])++;
- }
- }
- }
- }
-
- /* Restore cia */
- cia[0]=0;
- for (itercol=0;itercol<n;itercol++)
- {
- cia[itercol+1]=cia[itercol]+nbrEltCol[itercol];
- }
-
- memFree_null(nbrEltCol);
-
- /* Build corrected csc */
- newl = l+nbr2add;
-
- if (malloc_flag == API_NO)
- {
- /* Ici on a des malloc car le free est externe */
- MALLOC_EXTERN(*newia, n+1, pastix_int_t);
- MALLOC_EXTERN(*newja, newl, pastix_int_t);
- if (a != NULL)
- MALLOC_EXTERN(*newa, newl, pastix_complex64_t);
- }
- else
- {
- /* Ici on a des memAlloc car le free est interne */
- MALLOC_INTERN(*newia, n+1, pastix_int_t);
- MALLOC_INTERN(*newja, newl, pastix_int_t);
- if (a != NULL)
- MALLOC_INTERN(*newa, newl, pastix_complex64_t);
- }
- iterrow2 = 0; /* iterator of the CSC diff */
- for (itercol=0; itercol<n; itercol++)
- {
- (*newia)[itercol] = ia[itercol]+iterrow2;
- for (iterrow=ia[itercol]-1;iterrow<ia[itercol+1]-1;iterrow++)
- {
- /* we add the new elt with respect of order in row */
- while ((iterrow2<cia[itercol+1]) &&
- (ja[iterrow] > cja[iterrow2]))
- {
- /* we have elt(s) to add with a row lower than ja[iterrow] */
- (*newja)[iterrow+iterrow2]=cja[iterrow2];
- if (a != NULL)
- (*newa)[iterrow+iterrow2]=0.;
- iterrow2++;
- }
-
- /* Put the elt from the origin CSC */
- (*newja)[iterrow+iterrow2] = ja[iterrow];
- if (a != NULL)
- (*newa)[iterrow+iterrow2] = a[iterrow];
- }
-
- /* Since we put elt with a row lower than elt in the origin CSC */
- /* We could have some elt to add after the last elt in the column */
- while(iterrow2<cia[itercol+1])
- {
- (*newja)[iterrow+iterrow2]=cja[iterrow2];
- if (a != NULL)
- (*newa)[iterrow+iterrow2]=0.;
- iterrow2++;
- }
- }
-
- (*newia)[n]=ia[n]+iterrow2;
- memFree_null(cja);
-
- }
- else
- {
- /* No correction to do */
- memFree_null(nbrEltCol);
- newl = l;
- if (malloc_flag == API_NO)
- {
- /* ici on a des mallocs car le free est externe */
- MALLOC_EXTERN(*newia, n+1, pastix_int_t);
- MALLOC_EXTERN(*newja, l, pastix_int_t);
- if (a != NULL)
- MALLOC_EXTERN(*newa, l, pastix_complex64_t);
- }
- else
- {
- /* ici on a des memAllocs car le free est interne */
- MALLOC_INTERN(*newia, n+1, pastix_int_t);
- MALLOC_INTERN(*newja, l, pastix_int_t);
- if (a != NULL)
- MALLOC_INTERN(*newa, l, pastix_complex64_t);
- }
- memcpy((*newia), ia, (n+1)*sizeof(pastix_int_t));
- memcpy((*newja), ja, l * sizeof(pastix_int_t));
- if (a != NULL)
- memcpy((*newa) , a , l * sizeof(pastix_complex64_t));
- }
- memFree_null(cia);
-
- return EXIT_SUCCESS;
-}
-
-
-/**
- Function: z_csc_noDiag
-
- Supress diagonal term.
- After this call, *ja* can be reallocated to *ia[n] -1*.
-
- Parameters:
- n - size of the matrix.
- ia - Index in *ja* and *a* of the first element of each column
- ja - row of each element
- a - value of each element, can be set to NULL
-
- Returns:
- ia and ja tabulars modified.
-*/
-void z_csc_noDiag(pastix_int_t baseval,
- pastix_int_t n,
- pastix_int_t *ia,
- pastix_int_t *ja,
- pastix_complex64_t *a)
-{
- pastix_int_t i, j;
- pastix_int_t indj;
- pastix_int_t *old_ia = NULL;
-
- MALLOC_INTERN(old_ia, n+1, pastix_int_t);
- memcpy(old_ia, ia, sizeof(pastix_int_t)*(n+1));
-
- ASSERT(ia[0]==baseval,MOD_SOPALIN);
-
- indj = 0;
- /*fprintf(stdout, "NNZ with diag = %ld \n", ia[n]);*/
-
- for(i=0;i<n;i++)
- {
- /* ia[i] = number of column already counted */
- ia[i] = indj+baseval;
- /* for each row number in each column i */
- for(j=old_ia[i];j<old_ia[i+1];j++)
- /* if element is not diagonal
- we add it in ja and we count it */
- if(ja[j-baseval] != i+baseval)
- {
- ja[indj] = ja[j-baseval];
- if (a != NULL)
- a[indj] = a [j -baseval];
- indj++;
- }
- }
- ia[n] = indj+baseval;
-
- assert( ia[n] <= old_ia[n] );
-
- /*fprintf(stdout, "NNZ without diag = %ld \n", ia[n]);*/
- memFree_null(old_ia);
-}
-
-/*
- Function: z_csc_check_doubles
-
- Check if the csc contains doubles and if correct if asked
-
- Assumes that the CSC is sorted.
-
- Assumes that the CSC is Fortran numeroted (base 1)
-
- Parameters:
- n - Size of the matrix.
- colptr - Index in *rows* and *values* of the first element of each column
- rows - row of each element
- values - value of each element (Can be NULL)
- dof - Number of degrees of freedom
- flag - Indicate if user wants correction (<API_BOOLEAN>)
- flagalloc - indicate if allocation on CSC uses internal malloc.
-
- Returns:
- API_YES - If the matrix contained no double or was successfully corrected.
- API_NO - Otherwise.
-*/
-int z_csc_check_doubles(pastix_int_t n,
- pastix_int_t *colptr,
- pastix_int_t **rowptr,
- pastix_complex64_t **values,
- int dof,
- int flag,
- int flagalloc)
-{
- pastix_int_t i,j,k,d;
- int doubles = 0;
- pastix_int_t * tmprows = NULL;
- pastix_complex64_t * tmpvals = NULL;
- pastix_int_t index = 0;
- pastix_int_t lastindex = 0;
-
- ASSERT(values == NULL || dof > 0, MOD_SOPALIN);
- ASSERT(flag == API_NO || flag == API_YES, MOD_SOPALIN);
- ASSERT(colptr[0] == 1, MOD_SOPALIN);
- ASSERT(n >= 0, MOD_SOPALIN);
-
- for (i = 0; i < n; i++)
- {
- for (j = colptr[i]-1; j < colptr[i+1]-1; j = k)
- {
- (*rowptr)[index] = (*rowptr)[j];
- if (values != NULL)
- for (d = 0; d < dof*dof; d++)
- (*values)[index*dof*dof+d] = (*values)[j*dof*dof+d];
-
- k = j+1;
- while (k < colptr[i+1]-1 && (*rowptr)[j] == (*rowptr)[k])
- {
- if (flag == API_NO)
- return API_NO;
- if (values != NULL)
- for (d = 0; d < dof*dof; d++)
- (*values)[index*dof*dof+d] += (*values)[k*dof*dof+d];
- doubles++;
- k++;
- }
- index++;
- }
-
- colptr[i] = lastindex+1;
- lastindex = index;
- }
- if (flag == API_NO)
- return API_YES;
- ASSERT(index == colptr[n]-1-doubles, MOD_SOPALIN);
- if (doubles > 0)
- {
- colptr[n] = lastindex+1;
- if (flagalloc == API_NO)
- {
- MALLOC_EXTERN(tmprows, lastindex, pastix_int_t);
- if (values != NULL)
- MALLOC_EXTERN(tmpvals, lastindex*dof*dof, pastix_complex64_t);
- }
- else
- {
- MALLOC_INTERN(tmprows, lastindex, pastix_int_t);
- if (values != NULL)
- MALLOC_INTERN(tmpvals, lastindex*dof*dof, pastix_complex64_t);
- }
-
- memcpy(tmprows, *rowptr, lastindex*sizeof(pastix_int_t));
- if (values != NULL)
- memcpy(tmpvals, *values, lastindex*dof*dof*sizeof(pastix_complex64_t));
- if (flagalloc == API_NO)
- {
- free(*rowptr);
- if (values != NULL)
- free(*values);
- }
- else
- {
- memFree_null(*rowptr);
- if (values != NULL)
- memFree_null(*values);
- }
- *rowptr = tmprows;
- if (values != NULL)
- *values = tmpvals;
- }
- return API_YES;
-
-}
-
-/*
- Function: z_csc_checksym
-
- Check if the CSC graph is symetric.
-
- For all local column C,
-
- For all row R in the column C,
-
- We look in column R if we have the row number C.
-
- If we can correct we had missing non zeros.
-
- Assumes that the CSC is Fortran numbered (1 based).
-
- Assumes that the matrix is sorted.
-
- Parameters:
- n - Number of local columns
- colptr - Starting index of each columns in *ja*
- rows - Row of each element.
- values - Value of each element.
- correct - Flag indicating if we can correct the symmetry.
- alloc - indicate if allocation on CSC uses internal malloc.
- dof - Number of degrees of freedom.
-*/
-int z_csc_checksym(pastix_int_t n,
- pastix_int_t *colptr,
- pastix_int_t **rows,
- pastix_complex64_t **values,
- int correct,
- int alloc,
- int dof)
-{
- pastix_int_t i,j,k,l,d;
- pastix_int_t index1;
- pastix_int_t index2;
- int found;
- pastix_int_t toaddsize;
- pastix_int_t toaddcnt;
- pastix_int_t * toadd = NULL;
- pastix_int_t * tmpcolptr = NULL;
- pastix_int_t * tmprows = NULL;
- pastix_complex64_t * tmpvals = NULL;
-
- /* For all local column C,
- For all row R in the column C,
-
- If the row number R correspond to a local column,
- We look in column R if we have the row number C.
-
- Else,
- */
- toaddcnt = 0;
- toaddsize = 0;
- for (i = 0; i < n; i++)
- {
- for (j = (colptr)[i]-1; j < (colptr)[i+1]-1; j++)
- {
- if ((*rows)[j] != i+1)
- {
- /* not in diagonal */
- k = (*rows)[j];
- found = 0;
- for (l = (colptr)[k-1]-1; l < (colptr)[k-1+1]-1; l++)
- {
- if (i+1 == (*rows)[l])
- {
- found = 1;
- break;
- }
- if (i+1 < (*rows)[l])
- {
- /* The CSC is sorted */
- found = 0;
- break;
- }
- }
- if (found == 0)
- {
- if (correct == API_NO)
- return EXIT_FAILURE;
- else
- {
- if (toaddsize == 0)
- {
- toaddsize = n/2;
- MALLOC_INTERN(toadd, 2*toaddsize, pastix_int_t);
- }
- if (toaddcnt >= toaddsize)
- {
- toaddsize += toaddsize/2 + 1;
- if (NULL ==
- (toadd =
- (pastix_int_t*)memRealloc(toadd,
- 2*toaddsize*sizeof(pastix_int_t))))
- MALLOC_ERROR("toadd");
- }
- toadd[2*toaddcnt] = (*rows)[j];
- toadd[2*toaddcnt + 1] = i+1;
- /* fprintf(stdout, "Adding %ld, %ld\n", (long)(i+1), (long)(*rows)[j]); */
- toaddcnt++;
- }
- }
- }
- }
- }
-
- if (toaddcnt > 0)
- {
-
- intSort2asc1(toadd, toaddcnt);
- /* Correct here is API_YES, otherwise we would have return EXIT_FAILURE
- Or toaddcnt == 0*/
- MALLOC_INTERN(tmpcolptr, n + 1, pastix_int_t);
- if (alloc == API_NO)
- {
- MALLOC_EXTERN(tmprows, colptr[n]-1 + toaddcnt, pastix_int_t);
- if (values != NULL)
- {
- MALLOC_EXTERN(tmpvals, colptr[n]-1 + toaddcnt, pastix_complex64_t);
- }
- }
- else
- {
- MALLOC_INTERN(tmprows, colptr[n]-1 + toaddcnt, pastix_int_t);
- if (values != NULL)
- {
- MALLOC_INTERN(tmpvals, colptr[n]-1 + toaddcnt, pastix_complex64_t);
- }
- }
- /* Build tmpcolptr
-
- tmpcolptr[i+1] will contain the number of element of
- the column i
- */
- index1 = 0;
- index2 = 0;
- for (i = 0; i < n; i++)
- {
- tmpcolptr[i] = index2+1;
- for (j = colptr[i]-1; j < colptr[i+1]-1; j++)
- {
- if (index1 < toaddcnt &&
- (toadd[2*index1] == i+1) &&
- (toadd[2*index1+1] < (*rows)[j]))
- {
- tmprows[index2] = toadd[2*index1+1];
- if (values != NULL)
- {
- for (d = 0; d < dof*dof ; d++)
- tmpvals[index2*dof*dof+d] = 0.0;
- }
- index1++;
- j--; /* hack do not increment j this step of the loop */
- }
- else
- {
- tmprows[index2] = (*rows)[j];
- if (values != NULL)
- {
- for (d = 0; d < dof*dof ; d++)
- tmpvals[index2*dof*dof+d] = (*values)[j*dof*dof+d];
- }
- }
- index2++;
- }
-
- while(index1 < toaddcnt && toadd[2*index1] == i+1)
- {
- tmprows[index2] = toadd[2*index1+1];
- if (values != NULL)
- {
- for (d = 0; d < dof*dof ; d++)
- tmpvals[index2*dof*dof+d] = 0.0;
- }
- index1++;
- index2++;
- }
- }
- tmpcolptr[n] = index2+1;
- ASSERT((tmpcolptr[n] - 1) == (colptr[n] - 1 + toaddcnt), MOD_SOPALIN);
-
- memcpy(colptr, tmpcolptr, (n+1)*sizeof(pastix_int_t));
- memFree_null(tmpcolptr);
- memFree_null(toadd);
- if (alloc == API_NO)
- {
- free(*rows);
- if (values != NULL)
- {
- free(*values);
- }
- }
- else
- {
- memFree_null(*rows);
- if (values != NULL)
- {
- memFree_null(*values);
- }
- }
- *rows = tmprows;
- if (values != NULL)
- {
- *values = tmpvals;
- }
- }
- return EXIT_SUCCESS;
-}
-
-
-/*
- Function: z_csc_colPerm
-
- Performs column permutation on a CSC
-
- Parameters:
- n - Size of the matrix.
- ia - Index of first element of each column in *ia* and *a*
- ja - Rows of non zeros of the matrix.
- a - Values of non zeros of the matrix.
- cperm - Permutation to perform
-*/
-void z_csc_colPerm(pastix_int_t n, pastix_int_t *ia, pastix_int_t *ja, pastix_complex64_t *a, pastix_int_t *cperm)
-{
- pastix_int_t i, k;
- pastix_int_t *newja = NULL;
- pastix_int_t *newia = NULL;
- pastix_complex64_t *newa = NULL;
- int numflag, numflag2;
-
- numflag = ia[0];
- numflag2 = 1;
- for(i=0;i<n;i++)
- if(cperm[i] == 0)
- {
- numflag2 = 0;
- break;
- }
-
- if(numflag2 != numflag)
- {
- errorPrint("CSC_colPerm: rperm not in same numbering than the CSC.");
- exit(-1);
- }
-
-
- if(numflag == 1)
- {
- z_csc_Fnum2Cnum(ja, ia, n);
- for(i=0;i<n;i++)
- cperm[i]--;
- }
-
- MALLOC_INTERN(newia, n+1, pastix_int_t);
- MALLOC_INTERN(newja, ia[n], pastix_int_t);
- MALLOC_INTERN(newa, ia[n], pastix_complex64_t);
-
-
- newia[0] = 0;
- for(i=0;i<n;i++)
- {
-#ifdef DEBUG_KASS
- ASSERT(cperm[i]>=0 && cperm[i] < n, MOD_KASS);
-#endif
- newia[cperm[i]+1] = ia[i+1]-ia[i];
- }
-
-#ifdef DEBUG_KASS
- for(i=1;i<=n;i++)
- ASSERT(newia[i] >0, MOD_KASS);
-#endif
-
- for(i=1;i<=n;i++)
- newia[i] += newia[i-1];
-
-#ifdef DEBUG_KASS
- ASSERT(newia[n] == ia[n], MOD_KASS);
-#endif
-
-
- for(i=0;i<n;i++)
- {
- k = cperm[i];
-#ifdef DEBUG_KASS
- ASSERT(newia[k+1]-newia[k] == ia[i+1]-ia[i], MOD_KASS);
-#endif
- memcpy(newja + newia[k], ja + ia[i], sizeof(pastix_int_t)*(ia[i+1]-ia[i]));
- memcpy(newa + newia[k], a + ia[i], sizeof(pastix_complex64_t)*(ia[i+1]-ia[i]));
-
- }
-
- memcpy(ia, newia, sizeof(pastix_int_t)*(n+1));
- memcpy(ja, newja, sizeof(pastix_int_t)*ia[n]);
- memcpy(a, newa, sizeof(pastix_complex64_t)*ia[n]);
-
- memFree(newia);
- memFree(newja);
- memFree(newa);
- if(numflag == 1)
- {
- z_csc_Cnum2Fnum(ja, ia, n);
- for(i=0;i<n;i++)
- cperm[i]++;
- }
-}
-
-
-/*
- Function: z_csc_colScale
-
- Moved from kass, only used in MC64
-*/
-void z_csc_colScale(pastix_int_t n,
- pastix_int_t *ia,
- pastix_int_t *ja,
- pastix_complex64_t *a,
- pastix_complex64_t *dcol)
-{
- pastix_int_t i, j;
- int numflag;
- pastix_complex64_t d;
- numflag = ia[0];
-
- if(numflag == 1)
- z_csc_Fnum2Cnum(ja, ia, n);
-
- for(i=0;i<n;i++)
- {
- d = dcol[i];
- for(j=ia[i];j<ia[i+1];j++)
- {
- /***@@@ OIMBE DSCAL **/
- a[j] *= d;
- }
- }
-
- if(numflag == 1)
- z_csc_Cnum2Fnum(ja, ia, n);
-}
-
-/*
- Function: z_csc_rowScale
-
- Moved from kass, only used in MC64
-*/
-void z_csc_rowScale(pastix_int_t n,
- pastix_int_t *ia,
- pastix_int_t *ja,
- pastix_complex64_t *a,
- pastix_complex64_t *drow)
-{
- pastix_int_t i, j;
- int numflag;
- numflag = ia[0];
-
- if(numflag == 1)
- z_csc_Fnum2Cnum(ja, ia, n);
-
- for(i=0;i<n;i++)
- {
- for(j=ia[i];j<ia[i+1];j++)
- {
-#ifdef DEBUG_KASS
- ASSERT(ja[j]>0 && ja[j] <n, MOD_KASS);
-#endif
- a[j] *= drow[ja[j]];
- }
- }
-
- if(numflag == 1)
- z_csc_Cnum2Fnum(ja, ia, n);
-}
-
-/*
- * z_csc_sort:
- *
- * Sort CSC columns
- *
- * Parameters:
- * n - Number of columns
- * ia - Index of first element of each column in *ia*.
- * ja - Rows of each non zeros.
- * a - Values of each non zeros.
-*/
-void z_csc_sort(pastix_int_t n,
- pastix_int_t *ia,
- pastix_int_t *ja,
- pastix_complex64_t *a,
- pastix_int_t ndof)
-{
- pastix_int_t i;
- int numflag;
- pastix_int_t ndof2 = ndof * ndof;
- void * sortptr[3];
- numflag = ia[0];
- if(numflag == 1)
- z_csc_Fnum2Cnum(ja, ia, n);
- if (a != NULL)
- {
-
- for(i=0;i<n;i++)
- {
- sortptr[0] = &ja[ia[i]];
- sortptr[1] = &a[ia[i]*ndof2];
- sortptr[2] = &ndof2;
- z_qsortIntFloatAsc(sortptr, ia[i+1] - ia[i]);
- }
-
- }
- else
- {
- for(i=0;i<n;i++)
- intSort1asc1(&ja[ia[i]], ia[i+1] - ia[i]);
-
- }
- if(numflag == 1)
- z_csc_Cnum2Fnum(ja, ia, n);
-}
-
-/*
- Function: z_csc_Fnum2Cnum
-
- Convert CSC numbering from fortran numbering to C numbering.
-
- Parameters:
- ja - Rows of each element.
- ia - First index of each column in *ja*
- n - Number of columns
-*/
-void z_csc_Fnum2Cnum(pastix_int_t *ja,
- pastix_int_t *ia,
- pastix_int_t n)
-{
- pastix_int_t i, j;
- for(i=0;i<=n;i++)
- ia[i]--;
-
- for(i=0;i<n;i++)
- for(j=ia[i];j<ia[i+1];j++)
- ja[j]--;
-
-}
-
-/*
- Function: z_csc_Cnum2Fnum
-
- Convert CSC numbering from C numbering to Fortran numbering.
-
- Parameters:
- ja - Rows of each element.
- ia - First index of each column in *ja*
- n - Number of columns
-*/
-void z_csc_Cnum2Fnum(pastix_int_t *ja,
- pastix_int_t *ia,
- pastix_int_t n)
-{
- pastix_int_t i, j;
-
- for(i=0;i<n;i++)
- for(j=ia[i];j<ia[i+1];j++)
- ja[j]++;
-
- for(i=0;i<=n;i++)
- ia[i]++;
-}
-/*
- Function: z_csc_buildZerosAndNonZerosGraphs
-
- Separate a graph in two graphs, following
- wether the diagonal term of a column is null or not.
-
- Parameters:
- n, colptr, rows, values - The initial CSC
- n_nz, colptr_nz, rows_nz - The graph of the non-null diagonal part.
- n_z, colptr_z, rows_z - The graph of the null diagonal part.
- perm - Permutation to go from the first graph to
- the one composed of the two graph concatenated.
- revperm - Reverse permutation tabular.
- criteria - Value beside which a number is said null.
-*/
-int z_csc_buildZerosAndNonZerosGraphs(pastix_int_t n,
- pastix_int_t *colptr,
- pastix_int_t *rows,
- pastix_complex64_t *values,
- pastix_int_t *n_nz,
- pastix_int_t **colptr_nz,
- pastix_int_t **rows_nz,
- pastix_int_t *n_z,
- pastix_int_t **colptr_z,
- pastix_int_t **rows_z,
- pastix_int_t *perm,
- pastix_int_t *revperm,
- double criteria)
-{
- pastix_int_t itercol;
- pastix_int_t iterrow;
-
- pastix_int_t ncoefszeros = 0;
- pastix_int_t ncoefsnzeros = 0;
- pastix_int_t itercol_nz = 0;
- pastix_int_t itercol_z = 0;
- int seen;
- pastix_int_t cntrows;
-
- for (itercol = 0; itercol <n; itercol++)
- {
- seen = 0;
- for (iterrow = colptr[itercol]-1; iterrow < colptr[itercol+1]-1; iterrow++)
- {
- if (itercol == rows[iterrow] -1 )
- {
- if (ABS_FLOAT(values[iterrow]) < criteria)
- {
- (*n_z) ++;
- ncoefszeros += colptr[itercol+1] - colptr[itercol];
- seen = 1;
- }
- else
- {
- (*n_nz) ++;
- ncoefsnzeros += colptr[itercol+1] - colptr[itercol];
- seen = 1;
- }
- break;
- }
- }
- if (colptr[itercol+1] == colptr[itercol]) /* empty column */
- {
- (*n_z)++;
- seen = 1;
- }
- if (seen == 0)/* column without diag*/
- {
- (*n_z)++;
- ncoefszeros += colptr[itercol+1] - colptr[itercol];
- }
- }
- fprintf(stdout, "n_z %ld\n", (long)*n_z);
- fprintf(stdout, "n_nz %ld\n", (long)*n_nz);
- ASSERT(*n_z+*n_nz == n, MOD_SOPALIN);
- if (*n_z == 0 || *n_nz == 0)
- return PASTIX_SUCCESS;
-
- for (itercol = 0; itercol <n; itercol++)
- {
- seen = 0;
- for (iterrow = colptr[itercol]-1; iterrow < colptr[itercol+1]-1; iterrow++)
- {
- if (itercol == rows[iterrow] -1 )
- {
- if (ABS_FLOAT(values[iterrow]) < criteria)
- {
- perm[itercol] = (*n_nz) + itercol_z + 1;
- itercol_z++;
- seen = 1;
- }
- else
- {
- perm[itercol] = itercol_nz + 1;
- itercol_nz++;
- seen = 1;
- }
- }
- }
- if (colptr[itercol] == colptr[itercol+1])
- { /* empty column */
- perm[itercol] = (*n_nz) + itercol_z + 1;
- itercol_z++;
- seen =1;
- }
- if (seen == 0)/* column without diag*/
- {
- perm[itercol] = (*n_nz) + itercol_z + 1;
- itercol_z++;
- }
- }
-
- ASSERT(itercol_nz == *n_nz, MOD_SOPALIN);
- ASSERT(itercol_z == *n_z, MOD_SOPALIN);
- for(itercol = 0; itercol < n; itercol++)
- revperm[perm[itercol]-1] = itercol + 1;
-
- MALLOC_INTERN(*colptr_nz, *n_nz + 1, pastix_int_t);
- MALLOC_INTERN(*rows_nz, ncoefsnzeros, pastix_int_t);
- cntrows = 0;
- for (itercol = 0; itercol <*n_nz; itercol++)
- {
- (*colptr_nz)[itercol] = cntrows + 1;
- for (iterrow = colptr[revperm[itercol]-1]-1; iterrow < colptr[revperm[itercol]-1+1]-1; iterrow++)
- {
- if (perm[rows[iterrow]-1] - 1 < *n_nz )
- {
- (*rows_nz)[cntrows] = perm[rows[iterrow]-1];
- cntrows++;
- }
-
- }
-
- }
- (*colptr_nz)[*n_nz] = cntrows+1;
-
- MALLOC_INTERN(*colptr_z, *n_z + 1, pastix_int_t);
- MALLOC_INTERN(*rows_z, ncoefszeros, pastix_int_t);
- cntrows = 0;
- for (itercol = 0; itercol <*n_z; itercol++)
- {
- (*colptr_z)[itercol] = cntrows + 1;
- for (iterrow = colptr[revperm[itercol+*n_nz]-1]-1; iterrow < colptr[revperm[itercol+*n_nz]-1+1]-1; iterrow++)
- {
- if (perm[rows[iterrow]-1] > *n_nz )
- {
- (*rows_z)[cntrows] = perm[rows[iterrow]-1] - *n_nz;
- cntrows++;
- }
-
- }
-
- }
- (*colptr_z)[*n_z] = cntrows+1;
-
- return PASTIX_SUCCESS;
-}
-
-/*
- Function: z_csc_isolate
-
- Isolate a list of unknowns at the end of the CSC.
-
- Parameters:
- n - Number of columns.
- colptr - Index of first element of each column in *ia*.
- rows - Rows of each non zeros.
- n_isolate - Number of unknow to isolate.
- isolate_list - List of unknown to isolate.
- perm - permutation tabular.
- revperm - reverse permutation tabular.
-*/
-int z_csc_isolate(pastix_int_t n,
- pastix_int_t *colptr,
- pastix_int_t *rows,
- pastix_int_t n_isolate,
- pastix_int_t *isolate_list,
- pastix_int_t *perm,
- pastix_int_t *revperm)
-{
- pastix_int_t itercol;
- pastix_int_t iterrow;
-
- pastix_int_t iter_isolate = 0;
- pastix_int_t iter_non_isolate = 0;
- pastix_int_t *tmpcolptr = NULL;
- pastix_int_t *tmprows = NULL;
-
- if (n_isolate == 0)
- {
- errorPrintW("No schur complement\n");
- return PASTIX_SUCCESS;
- }
- intSort1asc1(isolate_list, n_isolate);
-
- for (itercol = 0; itercol <n; itercol++)
- {
- if (iter_isolate < n_isolate &&
- itercol == isolate_list[iter_isolate]-1)
- {
- revperm[n-n_isolate+iter_isolate] = itercol;
- iter_isolate++;
- }
- else
- {
- revperm[iter_non_isolate] = itercol;
- iter_non_isolate++;
- }
- }
- ASSERT(iter_non_isolate == n - n_isolate, MOD_SOPALIN);
- ASSERT(iter_isolate == n_isolate, MOD_SOPALIN);
-
- MALLOC_INTERN(tmpcolptr, n - n_isolate + 1, pastix_int_t);
- memset(tmpcolptr, 0, (n - n_isolate + 1)*sizeof(pastix_int_t));
-
- for(itercol = 0; itercol < n; itercol++)
- perm[revperm[itercol]] = itercol;
-
- for(itercol = 0; itercol < n; itercol++)
- {
- ASSERT(perm[itercol] < n, MOD_SOPALIN);
- ASSERT(perm[itercol] > -1, MOD_SOPALIN);
- }
-
- tmpcolptr[0] = 1;
- for (itercol = 0; itercol <n; itercol++)
- {
- if (perm[itercol] < n - n_isolate)
- {
- for (iterrow = colptr[itercol]-1; iterrow < colptr[itercol+1]-1; iterrow ++)
- {
- /* Count edges in each column of the new graph */
- if (perm[rows[iterrow]-1] < n-n_isolate)
- {
- tmpcolptr[perm[itercol]+1]++;
- }
- }
- }
- }
-
- for (itercol = 0; itercol <n - n_isolate; itercol++)
- tmpcolptr[itercol+1] += tmpcolptr[itercol];
-
- MALLOC_INTERN(tmprows, tmpcolptr[n- n_isolate]-1, pastix_int_t);
- for (itercol = 0; itercol <n; itercol++)
- {
- if (perm[itercol] < n - n_isolate)
- {
- for (iterrow = colptr[itercol]-1; iterrow < colptr[itercol+1]-1; iterrow ++)
- {
- /* Count edges in each column of the new graph */
- if (perm[rows[iterrow]-1] < n-n_isolate)
- {
- tmprows[tmpcolptr[perm[itercol]]-1] = perm[rows[iterrow]-1]+1;
- tmpcolptr[perm[itercol]]++;
- }
- }
- }
- }
-
-
- /* restore tmpcolptr */
-
- for (itercol = 1; itercol <n - n_isolate ; itercol++)
- {
- tmpcolptr[n - n_isolate - itercol] = tmpcolptr[n - n_isolate - itercol - 1];
- }
- tmpcolptr[0] = 1;
-
-
-
- ASSERT(colptr[n] >= tmpcolptr[n-n_isolate], MOD_SOPALIN);
- memcpy(colptr, tmpcolptr, (n-n_isolate + 1)*sizeof(pastix_int_t));
- memcpy(rows, tmprows, (colptr[n-n_isolate]-1)*sizeof(pastix_int_t));
-
- memFree_null(tmpcolptr);
- memFree_null(tmprows);
-
- return PASTIX_SUCCESS;
-}
-
-/*
- Function: csc_save
-
- Save a csc on disk.
-
- Parameters:
- n - number of columns
- colptr - First cscd starting index of each column in *ja* and *a*
- rows - Row of each element in first CSCD
- values - value of each cscd in first CSCD (can be NULL)
- dof - Number of degrees of freedom
- outfile - Output stream.
-
- Return:
- PASTIX_SUCCESS
-
-*/
-int z_csc_save(pastix_int_t n,
- pastix_int_t *colptr,
- pastix_int_t *rows,
- pastix_complex64_t *values,
- int dof,
- FILE *outfile)
-{
-
- pastix_int_t i;
- fprintf(outfile, "%ld %ld %d\n", (long)n, (long)dof, ((values == NULL)?0:1));
- /* Copie du colptr */
- for (i=0; i<n+1; i++)
- {
- fprintf(outfile, "%ld ", (long)colptr[i]);
- if (i%4 == 3) fprintf(outfile, "\n");
- }
- if ((i-1)%4 !=3) fprintf(outfile, "\n");
-
- /* Copie de JA */
- for (i=0; i<colptr[n]-1; i++)
- {
- fprintf(outfile, "%ld ", (long)rows[i]);
- if (i%4 == 3) fprintf(outfile, "\n");
- }
- if ((i-1)%4 !=3) fprintf(outfile, "\n");
-
- /* Copie de Avals */
-
- if (values != NULL)
- {
- for (i=0; i<(colptr[n]-1)*dof*dof; i++)
- {
-#ifdef TYPE_COMPLEX
- fprintf(outfile, "%lg %lg ", (double)(creal(values[i])), (double)(cimag(values[i])));
-#else
- fprintf(outfile, "%lg ", (double)(values[i]));
-#endif
- if (i%4 == 3) fprintf(outfile, "\n");
- }
- if ((i-1)%4 !=3) fprintf(outfile, "\n");
- }
- return PASTIX_SUCCESS;
-
-}
-
-/*
- Function: csc_load
-
- Load a csc from disk.
-
- Fill *n*, *colptr*, *rows*, *values* and *dof* from *infile*.
-
- Parameters:
- n - number of columns
- colptr - First cscd starting index of each column in *ja* and *a*
- rows - Row of each element in first CSCD
- values - value of each cscd in first CSCD (can be NULL)
- dof - Number of degrees of freedom
- outfile - Output stream.
-
- Return:
- PASTIX_SUCCESS
-
-*/
-int z_csc_load(pastix_int_t *n,
- pastix_int_t **colptr,
- pastix_int_t **rows,
- pastix_complex64_t **values,
- int *dof,
- FILE *infile)
-{
- int hasval;
- long tmp1, tmp2, tmp3, tmp4;
- double tmpflt1, tmpflt2, tmpflt3, tmpflt4;
-#ifdef TYPE_COMPLEX
- double tmpflt5, tmpflt6, tmpflt7, tmpflt8;
-#endif
- pastix_int_t i;
- if (3 != fscanf(infile, "%ld %ld %d\n", &tmp1, &tmp2, &hasval)){
- errorPrint("CSCD badly formated");
- return EXIT_FAILURE;
- }
- *n = (pastix_int_t)tmp1;
- *dof = (int)tmp2;
- /* Copie de IA */
- *colptr = NULL;
- MALLOC_INTERN(*colptr, *n+1, pastix_int_t);
- for (i=0; i<*n+1+1-4; i+=4)
- {
- if (4 != fscanf(infile, "%ld %ld %ld %ld", &tmp1, &tmp2, &tmp3, &tmp4)){
- errorPrint("CSCD badly formated");
- return EXIT_FAILURE;
- }
-
- (*colptr)[i ] = tmp1;
- (*colptr)[i+1] = tmp2;
- (*colptr)[i+2] = tmp3;
- (*colptr)[i+3] = tmp4;
- }
- switch (*n +1 - i)
- {
- case 3:
- if (3 != fscanf(infile, "%ld %ld %ld", &tmp1, &tmp2, &tmp3)){
- errorPrint("CSCD badly formated");
- return EXIT_FAILURE;
- }
-
- (*colptr)[i ] = tmp1;
- (*colptr)[i+1] = tmp2;
- (*colptr)[i+2] = tmp3;
- break;
- case 2:
- if (2 != fscanf(infile, "%ld %ld", &tmp1, &tmp2)){
- errorPrint("CSCD badly formated");
- return EXIT_FAILURE;
- }
-
- (*colptr)[i ] = tmp1;
- (*colptr)[i+1] = tmp2;
- break;
- case 1:
- if (1 != fscanf(infile, "%ld", &tmp1)){
- errorPrint("CSCD badly formated");
- return EXIT_FAILURE;
- }
-
- (*colptr)[i ] = tmp1;
- break;
- }
-
-
- /* Copie de JA */
- (*rows) = NULL;
- MALLOC_INTERN(*rows, (*colptr)[*n]-(*colptr)[0], pastix_int_t);
- for (i=0; i< (*colptr)[*n]-(*colptr)[0]+1-4; i+=4)
- {
- if (4 != fscanf(infile, "%ld %ld %ld %ld", &tmp1, &tmp2, &tmp3, &tmp4)){
- errorPrint("CSCD badly formated");
- return EXIT_FAILURE;
- }
-
- (*rows)[i ] = tmp1;
- (*rows)[i+1] = tmp2;
- (*rows)[i+2] = tmp3;
- (*rows)[i+3] = tmp4;
- }
-
- switch ( (*colptr)[*n]-(*colptr)[0] - i)
- {
- case 3:
- if (3 != fscanf(infile, "%ld %ld %ld", &tmp1, &tmp2, &tmp3)){
- errorPrint("CSCD badly formated");
- return EXIT_FAILURE;
- }
-
- (*rows)[i ] = tmp1;
- (*rows)[i+1] = tmp2;
- (*rows)[i+2] = tmp3;
- break;
- case 2:
- if (2 != fscanf(infile, "%ld %ld", &tmp1, &tmp2)){
- errorPrint("CSCD badly formated");
- return EXIT_FAILURE;
- }
-
- (*rows)[i ] = tmp1;
- (*rows)[i+1] = tmp2;
- break;
- case 1:
- if (1 != fscanf(infile, "%ld", &tmp1)){
- errorPrint("CSCD badly formated");
- return EXIT_FAILURE;
- }
-
- (*rows)[i ] = tmp1;
- break;
- }
-
- /* Copie de Avals */
- if (hasval)
- {
- (*values) = NULL;
-
- MALLOC_INTERN(*values, (*colptr)[*n]-(*colptr)[0], pastix_complex64_t);
-
- for (i=0; i< (*colptr)[*n]-(*colptr)[0]+1-4; i+=4)
- {
-#ifdef TYPE_COMPLEX
- if (8 != fscanf(infile, "%lg %lg %lg %lg %lg %lg %lg %lg",
- &tmpflt1, &tmpflt2, &tmpflt3, &tmpflt4,
- &tmpflt5, &tmpflt6, &tmpflt7, &tmpflt8)){
- errorPrint("CSCD badly formated");
- return EXIT_FAILURE;
- }
- (*values)[i ] = (pastix_complex64_t)(tmpflt1 + I * tmpflt2);
- (*values)[i+1] = (pastix_complex64_t)(tmpflt3 + I * tmpflt4);
- (*values)[i+2] = (pastix_complex64_t)(tmpflt5 + I * tmpflt6);
- (*values)[i+3] = (pastix_complex64_t)(tmpflt7 + I * tmpflt8);
-#else
- if (4 != fscanf(infile, "%lg %lg %lg %lg",
- &tmpflt1, &tmpflt2, &tmpflt3, &tmpflt4)){
- errorPrint("CSCD badly formated");
- return EXIT_FAILURE;
- }
- (*values)[i ] = (pastix_complex64_t)tmpflt1;
- (*values)[i+1] = (pastix_complex64_t)tmpflt2;
- (*values)[i+2] = (pastix_complex64_t)tmpflt3;
- (*values)[i+3] = (pastix_complex64_t)tmpflt4;
-#endif
- }
- switch ( (*colptr)[*n]-(*colptr)[0] - i )
- {
- case 3:
-#ifdef TYPE_COMPLEX
- if (6 != fscanf(infile, "%lg %lg %lg %lg %lg %lg",
- &tmpflt1, &tmpflt2, &tmpflt3, &tmpflt4,
- &tmpflt5, &tmpflt6)){
- errorPrint("CSCD badly formated");
- return EXIT_FAILURE;
- }
- (*values)[i ] = (pastix_complex64_t)(tmpflt1 + I * tmpflt2);
- (*values)[i+1] = (pastix_complex64_t)(tmpflt3 + I * tmpflt4);
- (*values)[i+2] = (pastix_complex64_t)(tmpflt5 + I * tmpflt6);
-#else
- if (3 != fscanf(infile, "%lg %lg %lg",
- &tmpflt1, &tmpflt2, &tmpflt3)){
- errorPrint("CSCD badly formated");
- return EXIT_FAILURE;
- }
- (*values)[i ] = (pastix_complex64_t)tmpflt1;
- (*values)[i+1] = (pastix_complex64_t)tmpflt2;
- (*values)[i+2] = (pastix_complex64_t)tmpflt3;
-#endif
- break;
- case 2:
-#ifdef TYPE_COMPLEX
- if (4 != fscanf(infile, "%lg %lg %lg %lg",
- &tmpflt1, &tmpflt2, &tmpflt3, &tmpflt4)){
- errorPrint("CSCD badly formated");
- return EXIT_FAILURE;
- }
- (*values)[i ] = (pastix_complex64_t)(tmpflt1 + I * tmpflt2);
- (*values)[i+1] = (pastix_complex64_t)(tmpflt3 + I * tmpflt4);
-#else
- if (2 != fscanf(infile, "%lg %lg",
- &tmpflt1, &tmpflt2)){
- errorPrint("CSCD badly formated");
- return EXIT_FAILURE;
- }
- (*values)[i ] = (pastix_complex64_t)tmpflt1;
- (*values)[i+1] = (pastix_complex64_t)tmpflt2;
-#endif
- break;
- case 1:
-#ifdef TYPE_COMPLEX
- if (2 != fscanf(infile, "%lg %lg",
- &tmpflt1, &tmpflt2)){
- errorPrint("CSCD badly formated");
- return EXIT_FAILURE;
- }
- (*values)[i ] = (pastix_complex64_t)(tmpflt1 + I * tmpflt2);
-#else
- if (1 != fscanf(infile, "%lg",
- &tmpflt1)){
- errorPrint("CSCD badly formated");
- return EXIT_FAILURE;
- }
- (*values)[i ] = (pastix_complex64_t)tmpflt1;
-#endif
- break;
- }
- }
- return PASTIX_SUCCESS;
-}
diff --git a/z_csc_utils.h b/z_csc_utils.h
deleted file mode 100644
index e28bcdee..00000000
--- a/z_csc_utils.h
+++ /dev/null
@@ -1,275 +0,0 @@
-/**
- * PaStiX CSC management routines.
- *
- * PaStiX is a software package provided by Inria Bordeaux - Sud-Ouest,
- * LaBRI, University of Bordeaux 1 and IPB.
- *
- * @version 1.0.0
- * @author Mathieu Faverge
- * @author Pierre Ramet
- * @author Xavier Lacoste
- * @date 2011-11-11
- * @precisions normal z -> c d s
- *
- **/
-#ifndef CSC_UTILS_H
-#define CSC_UTILS_H
-
-
-/**
- *
- * @ingroup csc_utils
- *
- * Modify the CSC to a symetric graph one.
- * Don't use it on a lower symetric CSC
- * it would give you all the CSC upper + lower.
- *
- * @param[in] n Number of columns/vertices
- * @param[in] ia Starting index of each column in *ja* and *a*
- * @param[in] ja Row index of each element
- * @param[in] a Value of each element,can be NULL
- * @param[out] newn New number of column
- * @param[out] newia Starting index of each column in *ja* and *a*
- * @param[out] newja Row index of each element
- * @param[out] newa Value of each element,can be NULL
- **/
-int z_csc_symgraph ( pastix_int_t n,
- const pastix_int_t *ia,
- const pastix_int_t *ja,
- const pastix_complex64_t *a,
- pastix_int_t *newn,
- pastix_int_t **newia,
- pastix_int_t **newja,
- pastix_complex64_t **newa);
-
-
-
-
-/**
- *
- * @ingroup csc_utils
- *
- * Modify the CSC to a symetric graph one.
- * Don't use it on a lower symetric CSC
- * it would give you all the CSC upper + lower.
- *
- * Internal function.
- *
- * @param[in] n Number of columns/vertices
- * @param[in] ia Starting index of each column in *ja* and *a*
- * @param[in] ja Row index of each element
- * @param[in] a Value of each element,can be NULL
- * @param[out] newn New number of column
- * @param[out] newia Starting index of each column in *ja* and *a*
- * @param[out] newja Row index of each element
- * @param[out] newa Value of each element,can be NULL
- * @param[in] malloc_flag flag to indicate if function call is intern to pastix
- * or extern.
- **/
-int z_csc_symgraph_int ( pastix_int_t n,
- const pastix_int_t *ia,
- const pastix_int_t *ja,
- const pastix_complex64_t *a,
- pastix_int_t *newn,
- pastix_int_t **newia,
- pastix_int_t **newja,
- pastix_complex64_t **newa,
- int malloc_flag);
-
-
-
-/**
- *
- * @ingroup csc_utils
- *
- * Supress diagonal term.
- * After this call, *ja* can be reallocated to *ia[n] -1*.
- *
- * @param[in] baseval Initial numbering value (0 or 1).
- * @param[in] n Number of columns/vertices
- * @param[in,out] ia Starting index of each column in *ja* and *a*
- * @param[in,out] ja Row index of each element
- * @param[in,out] a Value of each element,can be NULL
- **/
-void z_csc_noDiag( pastix_int_t baseval,
- pastix_int_t n,
- pastix_int_t *ia,
- pastix_int_t *ja,
- pastix_complex64_t *a);
-
-/**
- *
- * @ingroup csc_utils
- *
- * Check if the csc contains doubles and if correct if asked
- *
- * Assumes that the CSC is sorted.
- *
- * Assumes that the CSC is Fortran numeroted (base 1)
- *
- * @param[in] n Size of the matrix.
- * @param[in,out] colptr Index in *rows* and *values* of the first element
- * of each column
- * @param[in,out] rows row of each element
- * @param[in,out] values value of each element
- * @param[in] dof Number of degrees of freedom
- * @param[in] flag Indicate if user wants correction (<API_BOOLEAN>)
- * @param[in] flagalloc indicate if allocation on CSC uses internal malloc.
- *
- *
- * @Returns:
- * API_YES - If the matrix contained no double or was successfully corrected.
- * API_NO - Otherwise.
-*/
-
-int z_csc_check_doubles(pastix_int_t n,
- pastix_int_t *colptr,
- pastix_int_t **rows,
- pastix_complex64_t **values,
- int dof,
- int flag,
- int flagalloc);
-
-
-/**
- *
- * @ingroup csc_utils
- *
- * Check if the CSC graph is symetric.
- *
- * For all local column C,
- *
- * For all row R in the column C,
- *
- * We look in column R if we have the row number C.
- *
- * If we can correct we had missing non zeros.
- *
- * Assumes that the CSC is Fortran numbered (1 based).
- *
- * Assumes that the matrix is sorted.
- *
- * @param[in] n Number of local columns
- * @param[in,out] colptr Starting index of each columns in *ja*
- * @param[in,out] rows Row of each element.
- * @param[in,out] values Value of each element.
- * @param[in] correct Flag indicating if we can correct the symmetry.
- * @param[in] alloc indicate if allocation on CSC uses internal malloc.
- * @param[in] dof Number of degrees of freedom.
-*/
-int z_csc_checksym(pastix_int_t n,
- pastix_int_t *colptr,
- pastix_int_t **rows,
- pastix_complex64_t **values,
- int correct,
- int alloc,
- int dof);
-
-void z_csc_colPerm(pastix_int_t n, pastix_int_t *ia, pastix_int_t *ja, pastix_complex64_t *a, pastix_int_t *cperm);
-void z_csc_colScale(pastix_int_t n, pastix_int_t *ia, pastix_int_t *ja, pastix_complex64_t *a, pastix_complex64_t *dcol);
-void z_csc_rowScale(pastix_int_t n, pastix_int_t *ia, pastix_int_t *ja, pastix_complex64_t *a, pastix_complex64_t *drow);
-
-void z_csc_sort(pastix_int_t n, pastix_int_t *ia, pastix_int_t *ja, pastix_complex64_t *a, pastix_int_t ndof);
-void z_csc_Fnum2Cnum(pastix_int_t *ja, pastix_int_t *ia, pastix_int_t n);
-void z_csc_Cnum2Fnum(pastix_int_t *ja, pastix_int_t *ia, pastix_int_t n);
-
-/*
- Function: CSC_buildZerosAndNonZerosGraphs
-
- Separate a graph in two graphs, following
- wether the diagonal term of a column is null or not.
-
- Parameters:
- n, colptr, rows, values - The initial CSC
- n_nz, colptr_nz, rows_nz - The graph of the non-null diagonal part.
- n_z, colptr_z, rows_z - The graph of the null diagonal part.
- perm - Permutation to go from the first graph to
- the one composed of the two graph concatenated.
- revperm - Reverse permutation tabular.
- criteria - Value beside which a number is said null.
-*/
-int z_csc_buildZerosAndNonZerosGraphs(pastix_int_t n,
- pastix_int_t *colptr,
- pastix_int_t *rows,
- pastix_complex64_t *values,
- pastix_int_t *n_nz,
- pastix_int_t **colptr_nz,
- pastix_int_t **rows_nz,
- pastix_int_t *n_z,
- pastix_int_t **colptr_z,
- pastix_int_t **rows_z,
- pastix_int_t *perm,
- pastix_int_t *revperm,
- double criteria);
-
-/*
- Function: CSC_isolate
-
- Isolate a list of unknowns at the end of the CSC.
-
- Parameters:
- n - Number of columns.
- colptr - Index of first element of each column in *ia*.
- rows - Rows of each non zeros.
- n_isolate - Number of unknow to isolate.
- isolate_list - List of unknown to isolate.
-*/
-int z_csc_isolate(pastix_int_t n,
- pastix_int_t *colptr,
- pastix_int_t *rows,
- pastix_int_t n_isolate,
- pastix_int_t *isolate_list,
- pastix_int_t *perm,
- pastix_int_t *revperm);
-
-
-/*
- Function: csc_save
-
- Save a csc on disk.
-
- Parameters:
- n - number of columns
- colptr - First cscd starting index of each column in *ja* and *a*
- rows - Row of each element in first CSCD
- values - value of each cscd in first CSCD (can be NULL)
- dof - Number of degrees of freedom
- outfile - Output stream.
-
- Return:
- NO_ERR
-
-*/
-int z_csc_save(pastix_int_t n,
- pastix_int_t * colptr,
- pastix_int_t * rows,
- pastix_complex64_t * values,
- int dof,
- FILE * outfile);
-/*
- Function: csc_load
-
- Load a csc from disk.
-
- Fill *n*, *colptr*, *rows*, *values* and *dof* from *infile*.
-
- Parameters:
- n - number of columns
- colptr - First cscd starting index of each column in *ja* and *a*
- rows - Row of each element in first CSCD
- values - value of each cscd in first CSCD (can be NULL)
- dof - Number of degrees of freedom
- outfile - Output stream.
-
- Return:
- NO_ERR
-
-*/
-int z_csc_load(pastix_int_t * n,
- pastix_int_t ** colptr,
- pastix_int_t ** rows,
- pastix_complex64_t ** values,
- int * dof,
- FILE * infile);
-
-#endif /* CSC_UTILS_H */
diff --git a/z_cscd_utils.c b/z_cscd_utils.c
deleted file mode 100644
index bff199d6..00000000
--- a/z_cscd_utils.c
+++ /dev/null
@@ -1,3237 +0,0 @@
-/**
- * PaStiX CSC management routines.
- *
- * PaStiX is a software package provided by Inria Bordeaux - Sud-Ouest,
- * LaBRI, University of Bordeaux 1 and IPB.
- *
- * @version 1.0.0
- * @author Mathieu Faverge
- * @author Pierre Ramet
- * @author Xavier Lacoste
- * @date 2011-11-11
- * @precisions normal z -> c d s
- *
- **/
-#include "common.h"
-#include "z_tools.h"
-#include "z_cscd_utils.h"
-#include "z_cscd_utils_intern.h"
-
-#define TAG_SIZE 1
-#define TAG_COL 2
-#define TAG_ROW 3
-#define TAG_VAL 4
-#define TAG_L2G 5
-#define TAG_RHS 6
-#define TAG_SIZE2 7
-#define TAG_COUPLE 8
-
-/*
- Function: add_two_floats
-
- Adds two integers.
-
- Parameters :
- a - first integer
- b - second integer
-
- Returns: a + b
- */
-static
-pastix_complex64_t add_two_floats(pastix_complex64_t a, pastix_complex64_t b)
-{
- return a + b;
-}
-
-/*
- Function: keep_first
-
- Returns first integer.
-
- Parameters :
- a - first integer
- b - second integer
-
- Returns: a
- */
-static
-pastix_complex64_t keep_first(pastix_complex64_t a, pastix_complex64_t b)
-{
- (void)b;
- return a;
-}
-
-/*
- Function: keep_last
-
- Returns last integer.
-
- Parameters :
- a - first integer
- b - second integer
-
- Returns: b
- */
-static
-pastix_complex64_t keep_last(pastix_complex64_t a, pastix_complex64_t b)
-{
- (void)a;
- return b;
-}
-
-#ifndef TYPE_COMPLEX
-/*
- Function: get_max
-
- Returns maximum value from two integers.
-
- Parameters :
- a - first integer
- b - second integer
-
- Returns: MAX(a,b)
- */
-static
-pastix_complex64_t get_max(pastix_complex64_t a, pastix_complex64_t b) {
- return MAX(creal(a),creal(b));
-}
-
-/*
- Function: get_min
-
- Returns minimum value from two integers.
-
- Parameters :
- a - first integer
- b - second integer
-
- Returns: MIN(a,b)
- */
-static
-pastix_complex64_t get_min(pastix_complex64_t a, pastix_complex64_t b) {
- return MIN(creal(a),creal(b));
-}
-#endif
-
-/*
- * Function: csc_dispatch
- *
- * Distribute a CSC to a CSCD
- *
- * Parameters:
- * gN - global number of columns
- * gcolptr - global starting index of each column in *grows* and
- * *gavals*.
- * grows - global rows of each element.
- * gavals - global values of each element.
- * gperm - global permutation tabular.
- * ginvp - global reverse permutation tabular.
- * lN - local number of columns (output).
- * lcolptr - starting index of each local column (output).
- * lrowptr - row number of each local element (output).
- * lavals - values of each local element (output).
- * lrhs - local part of the right hand side (output).
- * lperm - local part of the permutation tabular (output).
- * loc2glob - global numbers of local columns (before permutation).
- * dispatch - choose how to dispatch the csc
- * pastix_comm - PaStiX MPI communicator.
- */
-void z_csc_dispatch(pastix_int_t gN, pastix_int_t * gcolptr, pastix_int_t * grow, pastix_complex64_t * gavals,
- pastix_complex64_t * grhs, pastix_int_t * gperm, pastix_int_t * ginvp,
- pastix_int_t *lN, pastix_int_t ** lcolptr, pastix_int_t ** lrow, pastix_complex64_t ** lavals,
- pastix_complex64_t ** lrhs, pastix_int_t ** lperm,
- pastix_int_t **loc2glob, int dispatch, MPI_Comm pastix_comm)
-{
- pastix_int_t i;
- int rank, comm_size;
- pastix_int_t index;
- pastix_int_t rowindex;
- (void)pastix_comm;
- (void)ginvp;
-
- MPI_Comm_rank(pastix_comm,&rank);
- MPI_Comm_size(pastix_comm,&comm_size);
-
- /* Split proportionnaly the columns number on each proc */
- *lN = gN / comm_size;
- if (rank < (gN%comm_size))
- (*lN)++;
-
- /* Ici on a des malloc parce que le free est externe */
- MALLOC_EXTERN((*lcolptr), (*lN + 1), pastix_int_t);
- MALLOC_EXTERN((*lrhs), (*lN), pastix_complex64_t);
- if (gperm != NULL)
- MALLOC_EXTERN((*lperm), (*lN), pastix_int_t);
-
- MALLOC_EXTERN((*loc2glob), (*lN), pastix_int_t);
-
- index = 0;
- rowindex = 1;
-
- switch (dispatch)
- {
- case CSC_DISP_CYCLIC:
- {
- for (i = rank; i < gN; i+=comm_size)
- {
- (*loc2glob)[index] = i+1;
- (*lcolptr )[index] = rowindex;
- (*lrhs )[index] = grhs[i];
- if (gperm != NULL)
- {
- (*lperm )[index] = gperm[i];
- /* (*linvp )[index] = ginvp[i]; */
- }
- rowindex += gcolptr[i+1] - gcolptr[i];
- index++;
- }
- }
- (*lcolptr )[index] = rowindex;
- break;
- case CSC_DISP_SIMPLE:
- default:
- {
- pastix_int_t ideb;
- pastix_int_t ifin;
- ideb = rank * (gN / comm_size) + MIN(gN%comm_size, rank);
- ifin = ideb + (*lN);
-
- for (i = ideb; i < ifin; i++)
- {
- (*loc2glob)[index] = i+1;
- (*lcolptr )[index] = rowindex;
- (*lrhs )[index] = grhs[i];
- if (gperm != NULL)
- {
- (*lperm )[index] = gperm[i];
- /* (*linvp )[index] = ginvp[i]; */
- }
- rowindex += gcolptr[i+1] - gcolptr[i];
- index++;
- }
- }
- }
-
- ASSERT(index == (*lN), MOD_UNKNOWN);
-
- (*lcolptr )[*lN] = rowindex;
- if ((*lcolptr)[(*lN)]-1 > 0)
- {
- MALLOC_EXTERN(*lrow, (*lcolptr)[(*lN)]-1, pastix_int_t);
- MALLOC_EXTERN(*lavals, (*lcolptr)[(*lN)]-1, pastix_complex64_t);
- }
- else
- {
- *lrow = NULL;
- *lavals = NULL;
- }
-
- for (i = 0; i < *lN; i++)
- {
- pastix_int_t iG = (*loc2glob)[i];
-
- memcpy(&(*lrow)[(*lcolptr)[i]-1],
- &grow[gcolptr[iG-1]-1],
- (gcolptr[iG] - gcolptr[iG-1])* sizeof(pastix_int_t));
- memcpy(&(*lavals)[(*lcolptr)[i]-1],
- &gavals[gcolptr[iG-1]-1],
- (gcolptr[iG] - gcolptr[iG-1])* sizeof(pastix_complex64_t));
- }
-}
-
-/*
- * Function: csc_cyclic_distribution
- *
- * Distribute the CSC cyclicaly.
- *
- * Parameters:
- * column - column number to distribute
- * columnnbr - Number of colmuns.
- * pastix_comm - PaStiX MPI communicator
- *
- * Return:
- * owner of the column (column%commSize)
- */
-pastix_int_t z_csc_cyclic_distribution(pastix_int_t column, pastix_int_t columnnbr, MPI_Comm pastix_comm)
-{
- int commSize;
- (void)pastix_comm;
- (void)columnnbr;
-
- MPI_Comm_size(pastix_comm,&commSize);
-
- return column%commSize;
-}
-
-/*
- * Function: z_cscsimple_distribution
- *
- * Distribute the CSC.
- * First columns are for first proc and so on.
- *
- * Parameters:
- * column - column number to distribute
- * columnnbr - Number of colmuns.
- * pastix_comm - PaStiX MPI communicator
- *
- * Return:
- * owner of the column (column*commSize/columnnbr)
- */
-pastix_int_t z_cscsimple_distribution(pastix_int_t column, pastix_int_t columnnbr, MPI_Comm pastix_comm)
-{
- int commSize;
- (void)pastix_comm;
-
- MPI_Comm_size(pastix_comm,&commSize);
-
- return (pastix_int_t)floor((double)column*(double)commSize/(double)columnnbr);
-}
-
-
-
-/*
- * Function: z_cscd_build_g2l
- *
- * Construct global to local tabular containing local number of global columns
- * if one column is local, and -owner if column is not local.
- *
- * For i in 0, gN
- * g2l[i] = i local number if i is local
- * g2l[i] = -p if p is the owner of the column i
- *
- * Parameters:
- * n - Number of local columns
- * colptr - Starting index of each columns in *ja*
- * rows - Row of each element.
- * values - Value of each element.
- * l2g - global number of each local column.
- * correct - Flag indicating if we can correct the symmetry.
- * dof - Number of degrees of freedom.
- * comm - MPI communicator
- */
-int z_cscd_build_g2l(pastix_int_t ncol,
- pastix_int_t *loc2glob,
- MPI_Comm comm,
- pastix_int_t *gN,
- pastix_int_t **g2l)
-{
- int commRank;
- int commSize;
- int i,j;
- pastix_int_t ig;
- pastix_int_t nrecv;
- pastix_int_t *l2grecv = NULL;
- (void)comm;
-
- MPI_Comm_rank(comm, &commRank);
- MPI_Comm_size(comm, &commSize);
-
- if (*gN == -1) /* Needed for MURGE_ProductSetGlobalNodeNbr */
- MPI_Allreduce(&ncol, gN, 1, PASTIX_MPI_INT, MPI_SUM, comm);
-
- MALLOC_INTERN(*g2l, *gN, pastix_int_t);
- for(ig=0; ig < *gN; ig++)
- (*g2l)[ig] = -commSize;
-
- for (i = 0; i < commSize; i++)
- {
- if (commRank == i)
- {
- nrecv = ncol;
- l2grecv = loc2glob;
-
- MPI_Bcast(&nrecv, 1, PASTIX_MPI_INT, i, comm);
- if (nrecv > 0)
- {
- MPI_Bcast(l2grecv, nrecv, PASTIX_MPI_INT, i, comm);
-
- for(j = 0; j < nrecv; j++)
- {
- (*g2l)[l2grecv[j]-1] = j+1;
- }
- }
- }
- else
- {
- MPI_Bcast(&nrecv, 1, PASTIX_MPI_INT, i, comm);
- if (nrecv > 0)
- {
- MALLOC_INTERN(l2grecv, nrecv, pastix_int_t);
- MPI_Bcast(l2grecv, nrecv, PASTIX_MPI_INT, i, comm);
-
- for(j = 0; j < nrecv; j++)
- {
- /* With Murge Product, one column can be on 2 processors
- * If so it's always marked in g2l as local on those processors.
- * On other processors we don't care who it belongs too.
- */
- if ((*g2l)[l2grecv[j]-1] == -commSize)
- (*g2l)[l2grecv[j]-1] = -i;
- }
- memFree_null(l2grecv);
- }
- }
- }
- for(ig=0; ig < *gN; ig++) {
- if ((*g2l)[ig] == -commSize)
- fprintf(stdout, "((*g2l)[%ld] = %ld\n", (long)ig, (long)((*g2l)[ig]));
- assert((*g2l)[ig] != -commSize);
- }
-
- return EXIT_SUCCESS;
-}
-
-/*
- * Function: z_cscd_checksym
- *
- * Check if the CSCD graph is symetric.
- *
- * For all local column C,
- *
- * For all row R in the column C,
- *
- * If the row number R correspond to a local column,
- * We look in column R if we have the row number C.
- *
- * Else, we verify the column R belong to one proc
- *
- * We had (ROW, l2g(COL)) (Fortran numbering) to
- * list of the couples to send to the owner.
- *
- * If we are not allowed to correct the matrix,
- * we check that we have a local symmetry and return EXIT_FAILURE
- * if it was not good on one processor.
- *
- * If Local symmetry is good, or we are allowed to correct the matrix,
- * we exchange couples (J,I) that processors should have and
- * we check that this couples are present.
- *
- * Parameters:
- * n - Number of local columns
- * colptr - Starting index of each columns in *ja*
- * rows - Row of each element.
- * values - Value of each element.
- * l2g - global number of each local column.
- * correct - Flag indicating if we can correct the symmetry.
- * alloc - indicate if allocation on CSC uses internal malloc.
- * dof - Number of degrees of freedom.
- * comm - MPI communicator
- */
-int z_cscd_checksym(pastix_int_t n,
- pastix_int_t *colptr,
- pastix_int_t **rows,
- pastix_complex64_t **values,
- pastix_int_t *l2g,
- int correct,
- int alloc,
- int dof,
- MPI_Comm comm)
-{
- int commSize;
- int proc;
- int commRank;
- pastix_int_t gN = -1;
- pastix_int_t i,j,k,l;
- int found;
- int sym;
- int all_sym;
- pastix_int_t * g2l = NULL;
- pastix_int_t * nbtosend = NULL;
- pastix_int_t toaddsize[2];
- pastix_int_t * toadd = NULL;
- pastix_int_t * tmpcolptr = NULL;
- pastix_int_t * tmprows = NULL;
- pastix_int_t * newcolptr = NULL;
- pastix_int_t * newrows = NULL;
- pastix_complex64_t * newvalues = NULL;
- pastix_int_t * tosendsize = NULL;
- pastix_int_t ** tosend = NULL;
- pastix_int_t * torecvsize = NULL;
- pastix_int_t ** torecv = NULL;
- MPI_Request * requests = NULL;
-
-#ifndef FORCE_NOMPI
- MPI_Status status;
-#endif
- pastix_int_t column;
-
- MPI_Comm_size(comm,&commSize);
- MPI_Comm_rank(comm,&commRank);
-
- /* Build the g2l vector */
- z_cscd_build_g2l(n, l2g, comm, &gN, &g2l);
-
- MALLOC_INTERN(nbtosend, commSize, pastix_int_t);
- MALLOC_INTERN(tosendsize, commSize, pastix_int_t);
- MALLOC_INTERN(tosend, commSize, pastix_int_t*);
- for (i = 0; i < commSize; i++)
- {
- nbtosend[i] = 0;
- tosendsize[i] = n / (2*commSize);
- if (i != commRank)
- MALLOC_INTERN(tosend[i], 2*tosendsize[i], pastix_int_t);
- }
-
- toaddsize[0] = 0;
- toaddsize[1] = 0;
-
- /* For all local column C,
- For all row R in the column C,
-
- If the row number R correspond to a local column,
- We look in column R if we have the row number C.
-
- Else, we verify the column R belong to one proc
-
- We had (ROW, l2g(COL)) (Fortran numbering) to
- list of the couples to send to the owner.
- */
- sym = 1;
- for (i = 0; i < n && sym == 1; i++)
- for (j = colptr[i]-1; (j < colptr[i+1]-1) && (sym == 1); j++)
- {
- /* look if *rows[j] column is local */
- k = g2l[(*rows)[j]-1];
- if (k > 0)
- {
- found = 0;
- for (l = (colptr)[k-1]-1; l < (colptr)[k-1+1]-1; l++)
- {
- if (l2g[i] == (*rows)[l])
- {
- found = 1;
- break;
- }
- }
- if (found == 0)
- {
- if (correct == API_NO)
- sym = 0;
- else
- {
- if (toaddsize[1] == 0)
- {
- toaddsize[1] = n/(2*commSize);
- MALLOC_INTERN(toadd, 2*toaddsize[1], pastix_int_t);
- }
- if (toaddsize[0] >= toaddsize[1])
- {
- toaddsize[1] += toaddsize[1]/2 + 1;
- if (NULL ==
- (toadd =
- (pastix_int_t*)memRealloc(toadd,
- 2*toaddsize[1]*sizeof(pastix_int_t))))
- MALLOC_ERROR("toadd");
-
- }
- toadd[2*toaddsize[0]] = (*rows)[j];
- toadd[2*toaddsize[0] + 1] = l2g[i];
- /* fprintf(stdout, "Adding %ld %ld %ld, %ld\n",
- (long)l2g[i], (long) i, (long) n, (long)(*rows)[j]); */
- toaddsize[0]++;
- }
- }
- }
- /* k is not local */
- else
- {
- proc = -k;
- if (proc >= commSize)
- errorPrint("Missing column in CSCD (%ld)", (long)((*rows)[j]));
-
- /* owner is processor proc */
- if (nbtosend[proc] >= tosendsize[proc])
- {
- tosendsize[proc] += tosendsize[proc]/2 +1;
- if (NULL ==
- (tosend[proc] =
- (pastix_int_t*)memRealloc(tosend[proc],
- 2*tosendsize[proc]*sizeof(pastix_int_t))))
- MALLOC_ERROR("tosend[proc]");
- if (nbtosend[proc] >= tosendsize[proc])
- errorPrint("z_cscd_checksym : should'nt happen");
- }
- tosend[proc][2*nbtosend[proc]] = (*rows)[j];
- tosend[proc][2*nbtosend[proc]+1] = l2g[i];
- nbtosend[proc]++;
- }
- }
-
- memFree_null(tosendsize);
- /*
- * We check that we have a local symmetry.
- */
- all_sym = 0;
- MPI_Allreduce(&sym,&all_sym,1,MPI_INT,MPI_SUM,comm);
- if (all_sym != commSize) {
- memFree_null(nbtosend);
- for (i = 0; i < commSize; i++) {
- if (i != commRank) {
- memFree_null(tosend[i]);
- }
- }
- memFree_null(tosend);
- return EXIT_FAILURE;
- }
- /*
- * If Local symmetry id good
- */
- MALLOC_INTERN(torecvsize, commSize, pastix_int_t);
- MALLOC_INTERN(requests, commSize, MPI_Request);
-
- /* We Send and receive list of couples each processor should have */
- for (i = 0; i < commSize; i++) {
- if (i != commRank) {
- MPI_Isend(&nbtosend[i], 1, PASTIX_MPI_INT, i, i+100*commRank,
- comm, &requests[i]);
- }
- }
- for (i = 0; i < commSize; i++) {
- if (i != commRank) {
- MPI_Recv(&torecvsize[i], 1, PASTIX_MPI_INT, i, commRank + i * 100,
- comm, &status);
- }
- }
- for (i = 0; i < commSize; i++) {
- if (i != commRank) {
- MPI_Wait(&requests[i], &status);
- }
- }
-
- MALLOC_INTERN(torecv, commSize, pastix_int_t*);
-
- for (i = 0; i < commSize; i++) {
- torecv[i] = NULL;
- if (i != commRank) {
- MALLOC_INTERN(torecv[i], torecvsize[i]*2, pastix_int_t);
- }
- }
- for (i = 0; i < commSize; i++) {
- if (i != commRank) {
- MPI_Isend(tosend[i], 2*nbtosend[i], PASTIX_MPI_INT, i , i+100*commRank,
- comm, &requests[i]);
- }
- }
- for (i = 0; i < commSize; i++) {
- if (i != commRank) {
- MPI_Recv(torecv[i], 2*torecvsize[i], PASTIX_MPI_INT, i, commRank + i * 100,
- comm, &status);
- }
- }
- for (i = 0; i < commSize; i++) {
- if (i != commRank) {
- MPI_Wait(&requests[i], &status);
- }
- }
-
- /* Free sent datas and requests */
- memFree_null(requests);
- memFree_null(nbtosend);
- for (i = 0; i < commSize; i++) {
- if (i != commRank) {
- memFree_null(tosend[i]);
- }
- }
- memFree_null(tosend);
-
- /* Check that received couples are present */
- for (i = 0; i < commSize && sym == 1; i++) {
- if (i != commRank && sym == 1)
- {
- for (j = 0; j < torecvsize[i]; j++)
- {
- /* look for column torecv[i][2*j] */
- column = g2l[torecv[i][2*j]-1];
- if (column < 0)
- {
- errorPrint("Shoulnd't happen");
- sym = 0;
- break;
- }
-
- /* look for row torecv[i][2*j+1] in column k */
- found = 0;
- k = column -1;
- for (l = (colptr)[k]-1; l < (colptr)[k+1]-1; l++)
- {
- if ((*rows)[l] == torecv[i][2*j+1])
- {
- found =1;
- break;
- }
- }
-
- if (found == 0)
- {
- if (correct == API_NO)
- {
- sym = 0;
- break;
- }
- else
- {
- if (toaddsize[1] == 0)
- {
- toaddsize[1] = n/(2*commSize);
- MALLOC_INTERN(toadd, 2*toaddsize[1], pastix_int_t);
- }
- if (toaddsize[0] >= toaddsize[1])
- {
- toaddsize[1] += toaddsize[1]/2 + 1;
- if (NULL ==
- (toadd =
- (pastix_int_t*)memRealloc(toadd,
- 2*toaddsize[1]*sizeof(pastix_int_t))))
- MALLOC_ERROR("toadd");
-
- }
- toadd[2*toaddsize[0]] = torecv[i][2*j];
- toadd[2*toaddsize[0] + 1] = torecv[i][2*j+1];
- toaddsize[0]++;
- }
-
- }
- }
- }
- }
- memFree_null(torecvsize);
- for (i = 0; i < commSize; i++)
- if (i != commRank && torecv[i] != NULL )
- memFree_null(torecv[i]);
- memFree_null(torecv);
-
-
- all_sym = 0;
- MPI_Allreduce(&sym,&all_sym,1,MPI_INT,MPI_SUM,comm);
- if (all_sym != commSize)
- return EXIT_FAILURE;
-
- if (correct == API_YES && toaddsize[0] > 0)
- {
-
- MALLOC_INTERN(tmpcolptr, n + 1, pastix_int_t);
-
- /* Build tmpcolptr
-
- tmpcolptr[i+1] will contain the number of element of
- the column i
- */
- for (i = 0; i < n+1; i++)
- tmpcolptr[i] = 0;
- for (i = 0; i < toaddsize[0]; i++)
- {
- tmpcolptr[g2l[toadd[2*i]-1]]++;
- }
-
- /* tmpcolptr[i] will contain the index of
- first element of column i
- */
- tmpcolptr[0] = 1;
- for (i = 0; i < n; i++)
- {
- tmpcolptr[i+1] = tmpcolptr[i] + tmpcolptr[i+1];
- }
-
- if (tmpcolptr[n] - 1 != toaddsize[0])
- {
- errorPrint("Wrong CSCd construction. %ld %ld",
- (long) tmpcolptr[n], (long)toaddsize[0]);
- return EXIT_FAILURE;
- }
-
- MALLOC_INTERN(tmprows, tmpcolptr[n] - 1, pastix_int_t);
- for (i = 0; i < toaddsize[0]; i++)
- {
- tmprows[tmpcolptr[g2l[toadd[2*i]-1]-1]-1] = toadd[2*i+1];
- tmpcolptr[g2l[toadd[2*i]-1]-1]++;
- }
-
- memFree_null(toadd);
- /* restore tmpcolptr */
- for (i = 0; i < n; i++)
- {
- tmpcolptr[n - i] = tmpcolptr[n - i - 1];
- }
- tmpcolptr[0] = 1;
-
- if (tmpcolptr[n] - 1 != toaddsize[0])
- {
- errorPrint("Wrong CSCd construction %ld %ld",
- (long) tmpcolptr[n], (long)toaddsize[0]);
- return EXIT_FAILURE;
- }
-
- /* On ajoute les 2 cscd, Allocation externe */
- if (values != NULL)
- {
- z_cscd_addlocal_int(n, colptr, *rows , *values , l2g,
- n, tmpcolptr, tmprows, NULL, l2g,
- &n, &newcolptr, &newrows, &newvalues,
- CSCD_ADD,
- dof, alloc);
- }
- else
- {
- z_cscd_addlocal_int(n, colptr, *rows , NULL, l2g,
- n, tmpcolptr, tmprows, NULL, l2g,
- &n, &newcolptr, &newrows, NULL,
- CSCD_ADD, dof, alloc);
- }
- memFree_null(tmpcolptr);
- memFree_null(tmprows);
- memcpy(colptr, newcolptr, (n+1)*sizeof(pastix_int_t));
- if (alloc == API_NO)
- {
- free(newcolptr);
- free(*rows);
- }
- else
- {
- memFree_null(newcolptr);
- memFree_null(*rows);
- }
- if (values != NULL)
- {
- if (alloc == API_NO)
- {
- free(*values);
- }
- else
- {
- memFree_null(*values);
- }
- }
- *rows = newrows;
- if (values != NULL)
- *values = newvalues;
-
- }
- memFree_null(g2l);
- return EXIT_SUCCESS;
-}
-
-
-/*
- * Function: z_cscd_symgraph
- *
- * Symetrize the graph of the given CSCD.
- *
- * External function.
- *
- * Parameters:
- * n - Number of local columns
- * ia - Starting index of each columns in *ja* and *a*
- * ja - Row of each element.
- * a - Values of each element.
- * newn - New number of local columns
- * newia - Starting index of each columns in *newja* and *newa*
- * newja - Row of each element.
- * newa - Values of each element.
- * l2g - global number of each local column.
- * comm - MPI communicator.
- */
-int z_cscd_symgraph(pastix_int_t n, const pastix_int_t *ia, const pastix_int_t *ja, const pastix_complex64_t * a,
- pastix_int_t * newn, pastix_int_t ** newia, pastix_int_t ** newja, pastix_complex64_t ** newa,
- pastix_int_t * l2g, MPI_Comm comm)
-{
- return z_cscd_symgraph_int(n, ia, ja, a,
- newn, newia, newja, newa,
- l2g, comm, API_NO);
-}
-
-/*
- * Function: z_cscd_symgraph_int
- *
- * Symetrize the graph of the given CSCD.
- *
- * Internal function.
- *
- * Parameters:
- * n - Number of local columns
- * ia - Starting index of each columns in *ja* and *a*
- * ja - Row of each element.
- * a - Values of each element.
- * newn - New number of local columns
- * newia - Starting index of each columns in *newja* and *newa*
- * newja - Row of each element.
- * newa - Values of each element.
- * l2g - global number of each local column.
- * comm - MPI communicator.
- * malloc_flag - flag to indicate if function call is intern to pastix
- * or extern.
- */
-
-int z_cscd_symgraph_int(pastix_int_t n, const pastix_int_t * ia, const pastix_int_t * ja, const pastix_complex64_t * a,
- pastix_int_t * newn, pastix_int_t ** newia, pastix_int_t ** newja, pastix_complex64_t ** newa,
- pastix_int_t * l2g, MPI_Comm comm, int malloc_flag)
-{
- int commSize;
- int proc;
- int commRank;
- pastix_int_t gN = -1;
- pastix_int_t i,j,k,l;
- int found;
- pastix_int_t * nbtosend = NULL;
- pastix_int_t * tosendsize = NULL;
- pastix_int_t ** tosend = NULL;
- pastix_int_t * torecvsize = NULL;
- pastix_int_t ** torecv = NULL;
- MPI_Request * requests = NULL;
-#ifndef FORCE_NOMPI
- MPI_Status status;
-#endif
- pastix_int_t * toadd = NULL;
- pastix_int_t * added = NULL;
- pastix_int_t tmpn;
- pastix_int_t * tmpia = NULL;
- pastix_int_t * tmpja = NULL;
- const pastix_int_t * tmpl2g = NULL;
- pastix_int_t * g2l = NULL;
- pastix_int_t colnum;
- pastix_int_t rownum;
-
- MPI_Comm_size(comm,&commSize);
- MPI_Comm_rank(comm,&commRank);
-
- print_debug(DBG_CSCD,"->z_cscd_symgraph\n");
-
- /* Build the g2l vector */
- z_cscd_build_g2l(n, l2g, comm, &gN, &g2l);
-
- MALLOC_INTERN(nbtosend, commSize, pastix_int_t);
- MALLOC_INTERN(tosendsize, commSize, pastix_int_t);
- MALLOC_INTERN(tosend, commSize, pastix_int_t*);
- for (i = 0; i < commSize; i++)
- {
- nbtosend[i] = 0;
- tosendsize[i] = n/(2*commSize);
- if (i != commRank)
- MALLOC_INTERN(tosend[i], 2*tosendsize[i], pastix_int_t);
- }
-
- MALLOC_INTERN(toadd, n, pastix_int_t);
- for (i = 0; i < n; i++)
- toadd[i] = 0;
-
- /* For all local column C,
- For all row R in the column C,
-
- If the row number R correspond to a local column,
- We look in column R if we have the row number C.
-
- Else, we verify the column R belong to one proc
-
- We had (ROW, l2g(COL)) (Fortran numbering) to
- list of the couples to send to the owner.
- */
- /* Pour chaque colonne i, pour chaque ligne ja[j]*/
- for (i = 0; i < n; i++)
- for (j = ia[i]-1; j < ia[i+1]-1; j++)
- {
- /* look if ja[j] column is local */
- k = g2l[ja[j]-1];
- if (k > 0) /* local */
- {
- /* si ja[j] correspond à une colonne locale
- on parcours les lignes de la colonne qui correspond à ja[j]
- si on ne trouve pas la colonne global[i], il faut l'ajouter.
- */
- k = k-1;
- found = 0;
-
- for (l = ia[k]-1; l < ia[k+1]-1; l++)
- {
- if (l2g[i] == ja[l])
- {
- found = 1;
- break; /* Back to the j loop */
- }
- }
- if (found == 0)
- {
- toadd[k] ++;
- }
- }
- else
- {
- /*
- si ja[j] n'est pas locale, on envoie
- ja[j], l2g[i] au processeur qui la possède.
- */
- proc = -k;
- if (proc >= commSize)
- errorPrint("Missing column in CSCD (%ld)", (long)(ja[j]));
-
- if (nbtosend[proc] >= tosendsize[proc])
- {
- tosendsize[proc] += tosendsize[proc]/2 +1;
- if (NULL ==
- (tosend[proc] =
- (pastix_int_t*)memRealloc(tosend[proc],
- 2*tosendsize[proc]*sizeof(pastix_int_t))))
- MALLOC_ERROR("tosend[proc]");
- if (nbtosend[proc] >= tosendsize[proc])
- errorPrint("z_cscd_checksym : should'nt happen");
- }
- tosend[proc][2*nbtosend[proc]] = ja[j];
- tosend[proc][2*nbtosend[proc]+1] = l2g[i];
- nbtosend[proc]++;
- }
- }
-
- memFree_null(tosendsize);
-
- MALLOC_INTERN(torecvsize, commSize, pastix_int_t);
- MALLOC_INTERN(requests, commSize, MPI_Request);
-
- for (i = 0; i < commSize; i++) {
- if (i != commRank) {
- MPI_Isend(&nbtosend[i], /* buffer */
- 1, PASTIX_MPI_INT, i, /* count, type, dest */
- TAG_SIZE2, /* tag */
- comm, &requests[i]); /* comm, request */
- }
- }
-
- for (i = 0; i < commSize; i++) {
- if (i != commRank) {
- MPI_Recv(&torecvsize[i], /* buffer */
- 1, PASTIX_MPI_INT, i, /* count, type, dest */
- TAG_SIZE2, /* tag */
- comm, &status); /* comm, request */
- }
- }
-
- for (i = 0; i < commSize; i++) {
- if (i != commRank) {
- MPI_Wait(&requests[i], &status);
- }
- }
-
- MALLOC_INTERN(torecv, commSize, pastix_int_t*);
-
- for (i = 0; i < commSize; i++) {
- if (i != commRank && torecvsize[i] > 0) {
- MALLOC_INTERN(torecv[i], torecvsize[i]*2, pastix_int_t);
- }
- }
-
- for (i = 0; i < commSize; i++) {
- if (i != commRank && nbtosend[i] > 0) {
- MPI_Isend(tosend[i], /* buffer */
- 2*nbtosend[i], /* count */
- PASTIX_MPI_INT, i , /* type, dest */
- TAG_COUPLE, /* tag */
- comm, &requests[i]); /* comm, request */
- }
- }
-
- for (i = 0; i < commSize; i++) {
- if (i != commRank && torecvsize[i] > 0) {
- MPI_Recv(torecv[i], /* buffer */
- 2*torecvsize[i], /* count */
- PASTIX_MPI_INT, i, /* type, dest */
- TAG_COUPLE, /* tag */
- comm, &status); /* comm, request */
- }
- }
-
- for (i = 0; i < commSize; i++) {
- if (i != commRank)
- {
- if (nbtosend[i] > 0)
- {
- MPI_Wait(&requests[i], &status);
- }
- memFree_null(tosend[i]);
- }
- }
- memFree_null(requests);
- /* on ajoute les elements recus dans les elements a ajouter */
- for (i = 0; i < commSize ; i++){
- if (i != commRank)
- for (j = 0; j < torecvsize[i]; j++)
- {
- colnum = g2l[torecv[i][2*j]-1];
- toadd[colnum-1] ++;
- }
- }
-
- memFree_null(nbtosend);
- memFree_null(tosend);
-
- tmpn = n;
- MALLOC_INTERN(tmpia, tmpn+1, pastix_int_t);
- tmpia[0] = 1;
- for (i = 0; i < n ; i++) {
- tmpia[i+1] = tmpia[i] + toadd[i];
- }
- memFree_null(toadd);
-
- MALLOC_INTERN(tmpja, tmpia[tmpn]-1, pastix_int_t);
-
- MALLOC_INTERN(added, n, pastix_int_t);
- for (i = 0; i < n; i++)
- added[i] = 0;
-
- /* On ajoute les elements recus */
- tmpl2g = l2g;
- for (i = 0; i < commSize ; i++){
- if (i != commRank) {
- for (j = 0; j < torecvsize[i]; j++)
- {
- colnum = g2l[torecv[i][2*j]-1];
- rownum = torecv[i][2*j+1];
- tmpja[tmpia[colnum-1]-1+added[colnum -1]] = rownum;
- added[colnum-1] ++;
- }
- }
- }
-
- for (i = 0; i < commSize; i++) {
- if (i != commRank && torecvsize[i] > 0) {
- memFree_null(torecv[i]);
- }
- }
- memFree_null(torecv);
- memFree_null(torecvsize);
-
- /* on ajoute les symetriques locaux */
- for (i = 0; i < n; i++) {
- for (j = ia[i]-1; j < ia[i+1]-1; j++)
- {
-
- /* look if ja[j] column is local */
- k = g2l[ja[j]-1];
-
- if (k > 0) /* local */
- {
- found = 0;
- for (l = ia[k-1]-1; l < ia[k]-1; l++)
- {
- if (l2g[i] == ja[l])
- {
- found = 1;
- break;
- }
- }
- if (found == 0)
- {
- colnum = k-1;
- rownum = l2g[i];
- tmpja[tmpia[colnum]-1+added[colnum]] = rownum;
- added[colnum] ++;
- }
- }
- }
- }
- memFree_null(g2l);
- memFree_null(added);
- /* On ajoute les 2 cscd */
- z_cscd_addlocal_int(n , ia , ja , a , l2g,
- tmpn, tmpia, tmpja, NULL, tmpl2g,
- newn, newia, newja, newa, CSCD_ADD, 1, malloc_flag);
- memFree_null(tmpia);
- memFree_null(tmpja);
-
- print_debug(DBG_CSCD,"<-z_cscd_symgraph\n");
-
- return EXIT_SUCCESS;
-}
-
-/*
- * Function: z_cscd_addlocal
- *
- * Interface to <z_cscd_addlocal_int>, for external usage.
- * Add second cscd to first cscd into third cscd (unallocated)
- * Only adds columns from the second CSCD which belongs to the first one.
- *
- * Parameters:
- * n - First cscd size
- * ia - First cscd starting index of each column in *ja* and *a*
- * ja - Row of each element in first CSCD
- * a - value of each cscd in first CSCD (can be NULL)
- * l2g - local 2 global column numbers for first cscd
- * addn - CSCD to add size
- * addia - CSCD to add starting index of each column in
- * *addja* and *adda*
- * addja - Row of each element in second CSCD
- * adda - value of each cscd in second CSCD (can be NULL -> add 0)
- * addl2g - local 2 global column numbers for second cscd
- * newn - new cscd size (same as first)
- * newia - CSCD to add starting index of each column in *newja*
- * and *newwa*
- * newja - Row of each element in third CSCD
- * newa - value of each cscd in third CSCD
- * OP - Operation to manage common CSCD coefficients.
- * dof - Number of degrees of freedom.
- */
-int z_cscd_addlocal(pastix_int_t n , pastix_int_t * ia , pastix_int_t * ja , pastix_complex64_t * a ,
- pastix_int_t * l2g,
- pastix_int_t addn, pastix_int_t * addia, pastix_int_t * addja, pastix_complex64_t * adda,
- pastix_int_t * addl2g,
- pastix_int_t * newn, pastix_int_t ** newia, pastix_int_t ** newja, pastix_complex64_t ** newa,
- CSCD_OPERATIONS_t OP, int dof)
-{
-
- return z_cscd_addlocal_int(n, ia, ja, a, l2g,
- addn, addia, addja, adda, addl2g,
- newn, newia, newja, newa,
- OP, dof, API_NO);
-}
-
-
-
-#define searchInList(n, list, list_size, index){ \
- pastix_int_t min = 0; \
- pastix_int_t max = list_size-1; \
- if (list_size == 0) { \
- index = -1; \
- } \
- else { \
- while (1) { \
- pastix_int_t cursor = (max +min)/2; \
- if ((list)[cursor] == n) \
- { \
- index = cursor; \
- break; \
- } \
- else { \
- if (max <= min) { \
- index = -1; \
- break; \
- } \
- if ((list)[cursor] > n) \
- { \
- max = cursor-1; \
- } \
- else { \
- if ((list)[cursor] < n) \
- { \
- min = cursor+1; \
- } \
- } \
- } \
- } \
- } \
- }
-
-
-
-/*
- * Function: z_cscd_addlocal_int
- *
- * Add second cscd to first cscd into third cscd (unallocated)
- * Only adds columns from the second CSCD which belongs to the first one.
- * All this work is localy done.
- *
- * Parameters:
- * n - First cscd size
- * ia - First cscd starting index of each column in *ja* and *a*
- * ja - Row of each element in first CSCD
- * a - value of each cscd in first CSCD (can be NULL)
- * l2g - local 2 global column numbers for first cscd
- * addn - CSCD to add size
- * addia - CSCD to add starting index of each column in *addja*
- * and *adda*
- * addja - Row of each element in second CSCD
- * adda - value of each cscd in second CSCD (can be NULL -> add 0)
- * addl2g - local 2 global column numbers for second cscd
- * newn - new cscd size (same as first)
- * newia - CSCD to add starting index of each column in *newja*
- * and *newwa*
- * newja - Row of each element in third CSCD
- * newa - value of each cscd in third CSCD
- * OP - Operation to manage common CSCD coefficients.
- * dof - Number of degrees of freedom.
- * malloc_flag - flag to indicate if function call is intern to pastix
- * or extern.
- */
-
-int z_cscd_addlocal_int(pastix_int_t n ,
- const pastix_int_t * ia ,
- const pastix_int_t * ja ,
- const pastix_complex64_t * a ,
- const pastix_int_t * l2g,
- pastix_int_t addn,
- const pastix_int_t * addia,
- pastix_int_t * addja,
- const pastix_complex64_t * adda,
- const pastix_int_t * addl2g,
- pastix_int_t * newn,
- pastix_int_t ** newia,
- pastix_int_t ** newja,
- pastix_complex64_t ** newa,
- CSCD_OPERATIONS_t OP, int dof,
- int malloc_flag)
-{
- pastix_int_t i,j,k,l;
- pastix_int_t i2;
- int baseval = ia[0];
- int iterdof;
- int val_flag;
- pastix_complex64_t (*add_fct)(pastix_complex64_t a, pastix_complex64_t b);
-
- switch(OP) {
- case CSCD_ADD:
- add_fct = &add_two_floats;
- break;
- case CSCD_KEEP:
- add_fct = &keep_first;
- break;
-#ifndef TYPE_COMPLEX
- case CSCD_MAX:
- add_fct = &get_max;
- break;
- case CSCD_MIN:
- add_fct = &get_min;
- break;
-#endif
- case CSCD_OVW:
- add_fct = &keep_last;
- break;
- default:
- return EXIT_FAILURE;
- }
-
-
- /* A can be null, Adda too but newa has to be filled with zeros...
- * => Test on newa
- */
- if (newa != NULL)
- val_flag = 1;
- else
- val_flag = 0;
-
- *newn = n;
- MALLOC_INTOREXTERN((*newia), (n+1), pastix_int_t, malloc_flag);
-
- i2 = 0;
- (*newia)[0]=baseval;
- /* Construction of newia */
- for (i = 0; i < n; i++)
- {
- (*newia)[i+1] = (*newia)[i] + ia[i+1] - ia[i];
- /* On cherche si la colonne l2g[i] existe aussi dans addl2g,
- si oui on la comptabilise */
- searchInList(l2g[i], addl2g, addn, i2);
- if (i2>=0)
- {
- /* Add coefficient from addia wich are not in ia */
- for (j = addia[i2] - baseval; j < addia[i2+1] - baseval; j++)
- {
- pastix_int_t index;
- const pastix_int_t *searchTab = &(ja[ia[i] - baseval]);
- pastix_int_t searchTabSize = ia[i+1] - ia[i];
- searchInList(addja[j], searchTab, searchTabSize, index);
- if (index < 0)
- {
- (*newia)[i+1]++;
- }
- }
-
- }
- }
-
- /* Allocation of newja */
- print_debug(DBG_CSCD, "allocation %ld\n", (long)(*newia)[n]-baseval);
- if (((*newia)[n]-baseval) > 0)
- MALLOC_INTOREXTERN((*newja), ((*newia)[n]-baseval), pastix_int_t, malloc_flag);
- if (val_flag == 1) {
- MALLOC_INTOREXTERN((*newa), ((*newia)[n]-baseval)*dof*dof, pastix_complex64_t,
- malloc_flag);
- }
- if (val_flag == 1) {
- memset(*newa, 0, ((*newia)[n]-baseval)*dof*dof*sizeof(pastix_complex64_t));
- }
- if (n > 0) {
- memset(*newja, 0, ((*newia)[n]-baseval)*sizeof(pastix_int_t));
- }
-
- pastix_int_t maxj,maxk,maxl;
- for (i = 0; i < addn; i++) {
- if(addia[i+1] - addia[i])
- intSort1asc1(&addja[addia[i]-baseval], addia[i+1] - addia[i]);
- }
-
- for (i = 0; i < n; i++)
- {
- searchInList(l2g[i], addl2g, addn, i2);
- if (i2>=0)
- {
- j = ia[i] - baseval;
- maxj = ia[i+1] - baseval;
- k = addia[i2] - baseval;
- maxk = addia[i2+1] - baseval;
- l = (*newia)[i] - baseval;
- maxl = (*newia)[i+1] - baseval;
- /* loop of size maxl <= maxk + makj */
- while (l < maxl)
- {
- /* while the new column is not filled */
- if ( j >= maxj ||
- ( k < maxk &&
- ja[j] > addja[k]))
- {
- /* If nothing in ja
- or addja is not empty and addja[k] must be before ja[j]
- */
-
- (*newja)[l] = addja[k];
- if (val_flag == 1)
- {
- if (adda != NULL)
- for (iterdof = 0; iterdof < dof*dof; iterdof ++)
- {
- (*newa)[l*dof*dof+iterdof] =
- adda[k*dof*dof+iterdof];
- }
- else
- for (iterdof = 0; iterdof < dof*dof; iterdof ++)
- {
- (*newa)[l*dof*dof+iterdof] = 0.0;
- }
- }
- l++;
- k++;
- }
- else
- {
-
- /* else, There are element in ja
- and addja is empty or ja[j] must
- be before addja[j]
- */
- (*newja)[l] = ja[j];
- if (val_flag == 1)
- for (iterdof = 0; iterdof < dof*dof; iterdof ++)
- {
- if (a != NULL)
- (*newa)[l*dof*dof+iterdof] = a[j*dof*dof+iterdof];
- else
- (*newa)[l*dof*dof+iterdof] = 0.0;
- }
- /* coef in both CSCs */
- if (addja != NULL && k < maxk && ja[j] == addja[k])
- {
- if (val_flag == 1)
- for (iterdof = 0; iterdof < dof*dof; iterdof ++)
- {
- (*newa)[l*dof*dof+iterdof] =
- add_fct((*newa)[l*dof*dof+iterdof],
- adda[k*dof*dof+iterdof]);
- }
- k++;
- }
- l++;
- j++;
- }
- }
- }
- else
- for (j = 0; j < ia[i+1] - ia[i]; j++)
- {
- (*newja)[(*newia)[i]-1+j] = ja[ia[i]-1+j];
- if (val_flag == 1)
- for (iterdof = 0; iterdof < dof*dof; iterdof ++)
- {
- if (a != NULL)
- (*newa)[((*newia)[i]-1+j)*dof*dof+iterdof] =
- a[(ia[i]-1+j)*dof*dof+iterdof];
- else
- (*newa)[((*newia)[i]-1+j)*dof*dof+iterdof] = 0.0;
- }
- }
- }
-
- return EXIT_SUCCESS;
-}
-
-
-/*
- * Function: z_cscd_redispatch_scotch
- *
- * Redistribute the columns to have first columns on first proc for Scotch
- *
- * - Checks if the matrix is not allready well ditributed.
- * - Build all new loc2globs on all processors.
- * - Create new CSC for each processor and send it.
- * - Merge all new CSC to the new local CSC with <z_cscd_addlocal_int>.
- *
- *
- * UNUSED
- *
- * Parameters:
- * n - Number of local columns
- * ia - First cscd starting index of each column in *ja* and *a*
- * ja - Row of each element in first CSCD
- * a - value of each cscd in first CSCD (can be NULL)
- * l2g - local 2 global column numbers for first cscd
- * dn - Number of local columns
- * dia - First cscd starting index of each column in *ja* and *a*
- * dja - Row of each element in first CSCD
- * da - value of each cscd in first CSCD (can be NULL)
- * l2g - local 2 global column numbers for first cscd
- * comm - MPI communicator
- *
- * Returns:
- * EXIT_SUCCESS if already well distributed, 2 if redistributed
- *
- */
-
-int z_cscd_redispatch_scotch(pastix_int_t n, pastix_int_t * ia, pastix_int_t * ja, pastix_complex64_t * a,
- pastix_int_t * l2g,
- pastix_int_t *dn, pastix_int_t ** dia, pastix_int_t ** dja, pastix_complex64_t ** da,
- pastix_int_t ** dl2g,
- MPI_Comm comm)
-{
-#ifdef FORCE_NOMPI
- (void)n; (void)ia; (void)ja; (void)a; (void)l2g;
- (void)dn; (void)dia; (void)dja; (void)da; (void)dl2g;
- (void)comm;
- return EXIT_SUCCESS;
-#else /* FORCE_NOMPI */
- pastix_int_t i,j;
- int OK = 0;
- int OKRecv = 0;
- pastix_int_t gn;
- pastix_int_t tmpn;
- pastix_int_t * tmpia = NULL;
- pastix_int_t * tmpja = NULL;
- pastix_complex64_t * tmpa = NULL;
- pastix_int_t * tmpia2 = NULL;
- pastix_int_t * tmpja2 = NULL;
- pastix_complex64_t * tmpa2 = NULL;
- pastix_int_t start;
- pastix_int_t end;
- pastix_int_t size;
- pastix_int_t * newloc2globssize = NULL;
- pastix_int_t ** newloc2globs = NULL;
- pastix_int_t ** colptr2send = NULL;
- pastix_int_t ** rows2send = NULL;
- pastix_complex64_t ** values2send = NULL;
- MPI_Request * requests_size = NULL;
- MPI_Request * requests_col = NULL;
- MPI_Request * requests_row = NULL;
- MPI_Request * requests_val = NULL;
- MPI_Status status;
- MPI_Status status2;
- pastix_int_t toreceive;
- int commSize;
- int rank;
-
- MPI_Comm_size(comm, &commSize);
- MPI_Comm_rank(comm, &rank);
- if (commSize == 1)
- goto simply_copy;
-
- /* Check if matrix is not allready correct for scotch */
- /* PT-Scotch needs consecutives column blocs */
- for (i = 0; i < n-1; i++)
- if (l2g[i] != l2g[i+1] -1)
- OK = 1;
-
- MPI_Allreduce(&OK, &OKRecv, 1, MPI_INT, MPI_SUM, comm);
- /* If it is correct, simply copy it */
- if (OKRecv == 0)
- {
- simply_copy:
- *dn = n;
- MALLOC_INTERN(*dia, n+1, pastix_int_t);
- memcpy(*dia,ia,(n+1)*sizeof(pastix_int_t));
- MALLOC_INTERN(*dl2g, n, pastix_int_t);
- memcpy(*dl2g,l2g,n*sizeof(pastix_int_t));
- MALLOC_INTERN(*dja, ia[n]-1, pastix_int_t);
- memcpy(*dja,ja,(ia[n]-1)*sizeof(pastix_int_t));
- if (NULL != a)
- {
- MALLOC_INTERN(*da, ia[n]-1, pastix_complex64_t);
- memcpy(*da,a,(ia[n]-1)*sizeof(pastix_complex64_t));
- }
-
- return EXIT_SUCCESS;
- }
-
- /* Build all newloc2globs on all processors */
- MALLOC_INTERN(newloc2globssize, commSize, pastix_int_t );
- MALLOC_INTERN(newloc2globs, commSize, pastix_int_t*);
- gn = 0;
- MPI_Allreduce(&n, &gn, 1, PASTIX_MPI_INT, MPI_SUM, comm);
- for (i = 0; i < commSize; i++)
- {
- start = (pastix_int_t)floor((double)i*(double)gn/(double)commSize)+1;
- end = (pastix_int_t)floor((double)(i+1)*(double)gn/(double)commSize);
- newloc2globssize[i] = end - start +1;
-
- MALLOC_INTERN(newloc2globs[i], newloc2globssize[i], pastix_int_t);
-
- for (j = 0; j < newloc2globssize[i]; j++)
- newloc2globs[i][j] = j+start;
- }
-
- /* Create one CSCD for each proc */
- MALLOC_INTERN(colptr2send, commSize, pastix_int_t*);
- MALLOC_INTERN(rows2send, commSize, pastix_int_t*);
- MALLOC_INTERN(values2send, commSize, pastix_complex64_t*);
-
- for (i = 0; i < commSize; i++)
- {
- colptr2send[i] = NULL;
- rows2send[i] = NULL;
- values2send[i] = NULL;
- }
-
- MALLOC_INTERN(requests_size, commSize, MPI_Request);
- MALLOC_INTERN(requests_col, commSize, MPI_Request);
- MALLOC_INTERN(requests_row, commSize, MPI_Request);
- MALLOC_INTERN(requests_val, commSize, MPI_Request);
-
-
- /* Sending informations to all proc */
- for (i = 0; i < commSize; i++)
- {
- MALLOC_INTERN(colptr2send[i], newloc2globssize[i]+1, pastix_int_t);
- for (j = 0; j < newloc2globssize[i]+1; j++)
- colptr2send[i][j] = 1;
-
- /* Adding old CSCD to the CSCD to send */
- z_cscd_addlocal_int(newloc2globssize[i], colptr2send[i], rows2send[i],
- values2send[i], newloc2globs[i],
- n , ia , ja ,
- a , l2g,
- &tmpn , &tmpia , &tmpja ,
- &tmpa , CSCD_ADD, 1, API_YES);
-
- if (newloc2globssize[i] != tmpn)
- errorPrint("newloc2globssize[i] != tmpn\n");
- memFree_null(colptr2send[i]);
- if (rows2send[i] != NULL)
- memFree_null(rows2send[i]);
- if (values2send[i] != NULL)
- memFree_null(values2send[i]);
-
- colptr2send[i] = tmpia;
- rows2send[i] = tmpja;
- values2send[i] = tmpa;
-
- tmpia = NULL;
- tmpja = NULL;
- tmpa = NULL;
-
- /* Sending the CSCD built */
- if (i != rank)
- {
- size = colptr2send[i][newloc2globssize[i]]-1;
- MPI_Isend(&size, 1, PASTIX_MPI_INT, i, TAG_SIZE, comm, &requests_size[i]);
- if (size > 0)
- {
- MPI_Isend(colptr2send[i], newloc2globssize[i]+1, PASTIX_MPI_INT, i,
- TAG_COL, comm, &requests_col[i]);
- MPI_Isend(rows2send[i], size, PASTIX_MPI_INT, i,
- TAG_ROW, comm, &requests_row[i]);
- if (a != NULL)
- MPI_Isend(values2send[i], size, COMM_FLOAT, i,
- TAG_VAL, comm, &requests_val[i]);
- }
- }
- }
-
- toreceive = commSize -1;
-
- while(toreceive > 0)
- {
- MPI_Recv(&size, 1, PASTIX_MPI_INT, MPI_ANY_SOURCE, TAG_SIZE, comm, &status);
- if (size > 0)
- {
- /* Adding contribution CSCD to local CSCD */
- MALLOC_INTERN(tmpia, newloc2globssize[rank]+1, pastix_int_t);
- MPI_Recv( tmpia, (int)(newloc2globssize[rank]+1), PASTIX_MPI_INT,
- status.MPI_SOURCE, TAG_COL, comm, &status2);
-
- MALLOC_INTERN(tmpja, size, pastix_int_t);
- MPI_Recv( tmpja, size, PASTIX_MPI_INT, status.MPI_SOURCE, TAG_ROW, comm,
- &status2);
- if (a != NULL)
- {
- MALLOC_INTERN(tmpa, size, pastix_complex64_t);
- MPI_Recv( tmpa, size, COMM_FLOAT, status.MPI_SOURCE, TAG_VAL,
- comm, &status2);
- }
- z_cscd_addlocal_int(newloc2globssize[rank], colptr2send[rank],
- rows2send[rank], values2send[rank],
- newloc2globs[rank],
- newloc2globssize[rank], tmpia ,
- tmpja , tmpa ,
- newloc2globs[rank],
- &newloc2globssize[rank],&tmpia2 ,
- &tmpja2 , &tmpa2 ,
- CSCD_ADD, 1, API_YES);
-
- memFree_null(colptr2send[rank]);
- memFree_null(tmpia);
- if (rows2send[rank] != NULL)
- memFree_null(rows2send[rank]);
- memFree_null(tmpja);
- if (values2send[rank] != NULL)
- memFree_null(values2send[rank]);
- if (NULL != tmpa)
- memFree_null(tmpa);
-
- colptr2send[rank] = tmpia2;
- rows2send[rank] = tmpja2;
- values2send[rank] = tmpa2;
- }
- toreceive--;
- }
- for (i = 0; i < commSize; i++)
- {
- if (i != rank)
- {
- size = colptr2send[i][newloc2globssize[i]]-1;
- memFree_null(newloc2globs[i]);
- MPI_Wait(&requests_size[i], &status);
- if (size > 0)
- {
- MPI_Wait(&requests_col[i], &status);
- MPI_Wait(&requests_row[i], &status);
- memFree_null(rows2send[i]);
- if (a != NULL)
- {
- MPI_Wait(&requests_val[i], &status);
- memFree_null(values2send[i]);
- }
- }
- memFree_null(colptr2send[i]);
- }
- }
- *dn = newloc2globssize[rank];
- *dl2g = newloc2globs[rank];
- *dia = colptr2send[rank];
- *dja = rows2send[rank];
- if ( a != NULL)
- *da = values2send[rank];
-
- memFree_null(newloc2globssize);
- memFree_null(newloc2globs);
- memFree_null(colptr2send);
- memFree_null(rows2send);
- memFree_null(values2send);
- memFree_null(requests_size);
- memFree_null(requests_col);
- memFree_null(requests_row);
- memFree_null(requests_val);
-
- return 2;
-#endif
-}
-
-
-/*
- * Function: z_cscd_redispatch
- *
- * Redistribute the first cscd into a new one using *dl2g*.
- *
- * - gather all new loc2globs on all processors.
- * - allocate *dia*, *dja* and *da*.
- * - Create new CSC for each processor and send it.
- * - Merge all new CSC to the new local CSC with <z_cscd_addlocal_int>.
- *
- * If communicator size is one, check that n = dn and
- * l2g = dl2g and simply create a copy of the first cscd.
- *
- * Parameters:
- * n - Number of local columns
- * ia - First cscd starting index of each column in *ja* and *a*
- * ja - Row of each element in first CSCD
- * a - value of each cscd in first CSCD (can be NULL)
- * rhs - right-hand-side member corresponding to the first CSCD
- * (can be NULL)
- * nrhs - number of right-hand-side.
- * l2g - local 2 global column numbers for first cscd
- * dn - Number of local columns
- * dia - New cscd starting index of each column in *ja* and *a*
- * dja - Row of each element in new CSCD
- * da - value of each cscd in new CSCD
- * rhs - right-hand-side member corresponding to the new CSCD
- * dl2g - local 2 global column numbers for new cscd
- * comm - MPI communicator
- *
- * Returns:
- * PASTIX_SUCCESS - If all goes well
- * BADPARAMETER_ERR - If commsize = 1 and *n* != *dn* or *l2g* != *dl2g*.
- */
-int z_cscd_redispatch(pastix_int_t n, pastix_int_t * ia, pastix_int_t * ja, pastix_complex64_t * a,
- pastix_complex64_t * rhs, pastix_int_t nrhs, pastix_int_t * l2g,
- pastix_int_t dn, pastix_int_t ** dia, pastix_int_t ** dja, pastix_complex64_t ** da,
- pastix_complex64_t ** drhs, pastix_int_t * dl2g,
- MPI_Comm comm, pastix_int_t dof)
-{
- return z_cscd_redispatch_int(n, ia, ja, a, rhs, nrhs, l2g,
- dn, dia, dja, da, drhs, dl2g,
- API_NO, comm, dof);
-}
-/*
- * Function: z_cscd_redispatch_int
- *
- * Redistribute the first cscd into a new one using *dl2g*.
- *
- * - gather all new loc2globs on all processors.
- * - allocate *dia*, *dja* and *da*.
- * - Create new CSC for each processor and send it.
- * - Merge all new CSC to the new local CSC with <z_cscd_addlocal_int>.
- *
- * If communicator size is one, check that n = dn and
- * l2g = dl2g and simply create a copy of the first cscd.
- *
- * Suppose that values and rhs are NOT NULL, or NULL on all processors.
- * Thus, it doesn't works if all matrix is on one pocessor and we want to
- * distribute it with values...
- *
- * Parameters:
- * n - Number of local columns
- * ia - First cscd starting index of each column in *ja* and *a*
- * ja - Row of each element in first CSCD
- * a - value of each cscd in first CSCD (can be NULL)
- * rhs - right-hand-side member corresponding to the first CSCD
- * (can be NULL)
- * nrhs - number of right-hand-side.
- * l2g - local 2 global column numbers for first cscd
- * dn - Number of local columns
- * dia - New cscd starting index of each column in *ja* and *a*
- * dja - Row of each element in new CSCD
- * da - value of each cscd in new CSCD
- * rhs - right-hand-side member corresponding to the new CSCD
- * dl2g - local 2 global column numbers for new cscd
- * malloc_flag - Internal (API_YES) or external (API_NO) malloc use.
- * comm - MPI communicator
- *
- * Returns:
- * EXIT_SUCCESS - If all goes well
- * EXIT_FAILURE - If commsize = 1 and *n* != *dn* or *l2g* != *dl2g*.
- */
-int z_cscd_redispatch_int(pastix_int_t n, pastix_int_t * ia, pastix_int_t * ja, pastix_complex64_t * a,
- pastix_complex64_t * rhs, pastix_int_t nrhs, pastix_int_t * l2g,
- pastix_int_t dn, pastix_int_t ** dia, pastix_int_t ** dja, pastix_complex64_t ** da,
- pastix_complex64_t ** drhs, pastix_int_t * dl2g,
- int malloc_flag, MPI_Comm comm, pastix_int_t dof)
-{
-#ifdef FORCE_NOMPI
- (void)n; (void)ia; (void)ja; (void)a; (void)rhs; (void)nrhs; (void)l2g;
- (void)dn; (void)dia; (void)dja; (void)da; (void)drhs; (void)dl2g;
- (void)malloc_flag; (void)comm; (void)dof;
- return PASTIX_SUCCESS;
-#else /* FORCE_NOMPI */
- pastix_int_t i,j;
- pastix_int_t globidx;
- pastix_int_t locidx;
- pastix_int_t tmpn;
- pastix_int_t * tmpia = NULL;
- pastix_int_t * tmpja = NULL;
- pastix_complex64_t * tmpa = NULL;
- pastix_complex64_t * tmprhs = NULL;
- pastix_int_t * tmpia2 = NULL;
- pastix_int_t * tmpja2 = NULL;
- pastix_complex64_t * tmpa2 = NULL;
- pastix_int_t size;
- pastix_int_t * sizep = NULL;
- pastix_int_t * newloc2globssize = NULL;
- pastix_int_t * newloc2globssize_recv = NULL;
- pastix_int_t ** newloc2globs = NULL;
- pastix_int_t ** colptr2send = NULL;
- pastix_int_t ** rows2send = NULL;
- pastix_complex64_t ** values2send = NULL;
- pastix_complex64_t ** rhs2send = NULL;
- MPI_Request * requests_size = NULL;
- MPI_Request * requests_col = NULL;
- MPI_Request * requests_row = NULL;
- MPI_Request * requests_val = NULL;
- MPI_Request * requests_rhs = NULL;
- MPI_Status status;
- MPI_Status status2;
- pastix_int_t toreceive;
- int commSize;
- int rank;
- int flags[2];
- int flags_recv[2];
-
- if (NULL != a)
- flags[0] = 1;
- else
- flags[0] = 0;
-
- if (NULL != rhs)
- flags[1] = 1;
- else
- flags[1] = 0;
-
- MPI_Allreduce(flags, flags_recv, 2, MPI_INT, MPI_LOR, comm);
- MPI_Comm_size(comm, &commSize);
- MPI_Comm_rank(comm, &rank);
- if (commSize == 1)
- {
- if (n != dn)
- {
- return BADPARAMETER_ERR;
- }
- for (i = 0; i < n; i++)
- if (dl2g[i] != l2g[i])
- {
- return BADPARAMETER_ERR;
- }
-
- MALLOC_INTOREXTERN(*dia, n+1, pastix_int_t, malloc_flag);
- memcpy(*dia,ia,(n+1)*sizeof(pastix_int_t));
- MALLOC_INTOREXTERN(*dja, ia[n]-1, pastix_int_t, malloc_flag);
- memcpy(*dja,ja,(ia[n]-1)*sizeof(pastix_int_t));
- if (flags_recv[0] == 1)
- {
- MALLOC_INTOREXTERN(*da, (ia[n]-1)*dof*dof, pastix_complex64_t, malloc_flag);
- memcpy(*da,a,(ia[n]-1)*sizeof(pastix_complex64_t)*dof*dof);
- }
- if (flags_recv[1] == 1)
- {
- MALLOC_INTOREXTERN(*drhs, n*nrhs*dof, pastix_complex64_t, malloc_flag);
- memcpy(*drhs,rhs,n*nrhs*sizeof(pastix_complex64_t)*dof);
- }
- return PASTIX_SUCCESS;
- }
-
- /* Build all newloc2globs on all processors */
- MALLOC_INTERN(newloc2globssize, commSize + 1, pastix_int_t );
-
- for (i = 0; i < rank+1; i++)
- newloc2globssize[i] = 0;
- for (i = rank+1; i < commSize+1; i++)
- newloc2globssize[i] = dn;
-
- /* Construct newloc2globssize
- * It will contain start of each dl2g in newloc2globs
- */
- MALLOC_INTERN(newloc2globssize_recv, commSize + 1, pastix_int_t );
- MPI_Allreduce(newloc2globssize, newloc2globssize_recv, commSize+1,
- PASTIX_MPI_INT, MPI_SUM, comm);
- memFree_null(newloc2globssize);
- newloc2globssize = newloc2globssize_recv;
-
- /* Construct newloc2globs
- * It will contains all dl2g in one tabular
- */
- MALLOC_INTERN(newloc2globs, commSize, pastix_int_t*);
- for (i = 0; i < commSize; i++)
- {
- if (rank != i)
- {
- newloc2globs[i] = NULL;
- MALLOC_INTERN(newloc2globs[i],
- newloc2globssize[i+1] - newloc2globssize[i], pastix_int_t);
- for (j = 0; j < newloc2globssize[i+1] - newloc2globssize[i]; j++)
- newloc2globs[i][j] = 0;
- }
- else
- {
- newloc2globs[i] = dl2g;
- }
- MPI_Bcast(newloc2globs[i], newloc2globssize[i+1] - newloc2globssize[i],
- PASTIX_MPI_INT, i, comm);
- }
- /* Create one CSCD for each proc */
- MALLOC_INTERN(colptr2send, commSize, pastix_int_t*);
- MALLOC_INTERN(rows2send, commSize, pastix_int_t*);
- if (flags_recv[0] == 1)
- MALLOC_INTERN(values2send, commSize, pastix_complex64_t*);
- if (flags_recv[1] == 1)
- MALLOC_INTERN(rhs2send, commSize, pastix_complex64_t*);
-
- for (i = 0; i < commSize; i++)
- {
- colptr2send[i] = NULL;
- rows2send[i] = NULL;
- if (flags_recv[0] == 1)
- values2send[i] = NULL;
- if (flags_recv[1] == 1)
- rhs2send[i] = NULL;
- }
-
- MALLOC_INTERN(sizep, commSize, pastix_int_t);
- MALLOC_INTERN(requests_size, commSize, MPI_Request);
- MALLOC_INTERN(requests_col, commSize, MPI_Request);
- MALLOC_INTERN(requests_row, commSize, MPI_Request);
- if (flags_recv[0] == 1)
- MALLOC_INTERN(requests_val, commSize, MPI_Request);
- if (flags_recv[1] == 1)
- MALLOC_INTERN(requests_rhs, commSize, MPI_Request);
-
- /* Sending informations to all proc */
- for (i = 0; i < commSize; i++)
- {
- MALLOC_INTERN(colptr2send[i],
- newloc2globssize[i+1] - newloc2globssize[i] + 1, pastix_int_t);
- for (j = 0; j < newloc2globssize[i+1] - newloc2globssize[i] + 1; j++)
- colptr2send[i][j] = 1;
-
- /* Adding old CSCD to the CSCD to send */
- if (i == rank) {
- z_cscd_addlocal_int(newloc2globssize[i+1] - newloc2globssize[i],
- colptr2send[i], rows2send[i],
- ((flags_recv[0]==0)?(NULL):(values2send[i])),
- newloc2globs[i],
- n, ia, ja, ((flags_recv[0]==0)?(NULL):(a)) , l2g,
- &tmpn, &tmpia, &tmpja,
- ((flags_recv[0]==0)?(NULL):(&tmpa)),
- CSCD_ADD,
- dof, malloc_flag);
- }
- else {
- z_cscd_addlocal_int(newloc2globssize[i+1] - newloc2globssize[i],
- colptr2send[i], rows2send[i],
- ((flags_recv[0]==0)?(NULL):(values2send[i])),
- newloc2globs[i],
- n, ia, ja, ((flags_recv[0]==0)?(NULL):(a)), l2g,
- &tmpn, &tmpia, &tmpja,
- ((flags_recv[0]==0)?(NULL):(&tmpa)),
- CSCD_ADD,
- dof, API_YES);
- }
- if (newloc2globssize[i+1] - newloc2globssize[i] != tmpn)
- errorPrint("newloc2globssize[i] != tmpn\n");
- memFree_null(colptr2send[i]);
-
- if (flags_recv[1] == 1 && i != rank)
- {
- pastix_int_t newrhs_size = (newloc2globssize[i+1] - newloc2globssize[i]);
- MALLOC_INTERN(rhs2send[i],
- dof*nrhs*newrhs_size,
- pastix_complex64_t);
- memset(rhs2send[i], 0,
- dof*nrhs*newrhs_size*sizeof(pastix_complex64_t));
- for (j = 0; j < newloc2globssize[i+1] - newloc2globssize[i]; j++)
- {
- int iter_rhs;
- for (iter_rhs = 0; iter_rhs < nrhs; iter_rhs++)
- {
- globidx = newloc2globs[i][j];
- searchInList(globidx, l2g, n, locidx);
- if (locidx >= 0)
- {
- pastix_int_t k;
- for (k = 0; k< dof; k++)
- rhs2send[i][dof*(j+iter_rhs*newrhs_size)+k] =
- rhs[dof*(locidx+iter_rhs*n)+k];
- }
- }
- }
- }
-
- colptr2send[i] = tmpia;
- rows2send[i] = tmpja;
- if (flags_recv[0] == 1)
- values2send[i] = tmpa;
-
- tmpia = NULL;
- tmpja = NULL;
- if (flags_recv[0] == 1)
- tmpa = NULL;
-
- /* Sending the CSCD built */
- if (i != rank)
- {
- size = newloc2globssize[i+1] - newloc2globssize[i];
- sizep[i] = colptr2send[i][size]-1;
- MPI_Isend(&sizep[i], 1, PASTIX_MPI_INT, i, TAG_SIZE, comm,
- &requests_size[i]);
- if (sizep[i] > 0)
- {
- MPI_Isend(colptr2send[i], size+1,
- PASTIX_MPI_INT, i, TAG_COL, comm, &requests_col[i]);
- MPI_Isend(rows2send[i], sizep[i],
- PASTIX_MPI_INT, i, TAG_ROW, comm, &requests_row[i]);
- if (flags_recv[0] == 1)
- MPI_Isend(values2send[i], sizep[i]*dof*dof,
- COMM_FLOAT, i, TAG_VAL, comm, &requests_val[i]);
- }
- if (flags_recv[1] == 1)
- {
- pastix_int_t newrhs_size = (newloc2globssize[i+1] - newloc2globssize[i]);
- MPI_Isend(rhs2send[i], nrhs*newrhs_size*dof,
- COMM_FLOAT, i, TAG_RHS, comm, &requests_rhs[i]);
- }
-
- }
- }
-
- toreceive = commSize -1;
- /* Receive and add to local CSCD */
- if (flags_recv[1] == 1)
- {
- pastix_int_t iter_rhs;
- MALLOC_INTOREXTERN(*drhs, dn*nrhs*dof, pastix_complex64_t, malloc_flag);
- MALLOC_INTERN(tmprhs, dn*nrhs*dof, pastix_complex64_t);
- for (i = 0; i < dn*nrhs*dof; i++)
- (*drhs)[i] = 0;
-
- /* Initialize local RHS */
- for (iter_rhs = 0; iter_rhs < nrhs; iter_rhs++)
- {
- for (j = 0; j < dn; j++)
- {
- globidx = newloc2globs[rank][j];
- searchInList(globidx, l2g, n, locidx);
- if (locidx >= 0)
- {
- pastix_int_t k;
- for (k = 0; k< dof; k++)
- (*drhs)[dof*(j + iter_rhs*dn)+k] = rhs[dof*(locidx + iter_rhs*n)+k];
- }
- }
- }
- }
- while(toreceive > 0)
- {
- size = 0;
- MPI_Recv( &size, 1, PASTIX_MPI_INT, MPI_ANY_SOURCE, TAG_SIZE, comm, &status);
- if (size > 0)
- {
- /* Adding contribution CSCD to local CSCD */
- MALLOC_INTERN(tmpia,
- newloc2globssize[rank+1] - newloc2globssize[rank]+1,
- pastix_int_t);
- MPI_Recv( tmpia, (newloc2globssize[rank+1] -
- newloc2globssize[rank] + 1),
- PASTIX_MPI_INT,
- status.MPI_SOURCE, TAG_COL, comm, &status2);
- MALLOC_INTERN(tmpja, size, pastix_int_t);
- MPI_Recv( tmpja, size, PASTIX_MPI_INT, status.MPI_SOURCE,
- TAG_ROW, comm, &status2);
- if (flags_recv[0] == 1)
- {
- MALLOC_INTERN(tmpa, dof*dof*size, pastix_complex64_t);
- MPI_Recv( tmpa, dof*dof*size, COMM_FLOAT, status.MPI_SOURCE,
- TAG_VAL, comm, &status2);
- }
- else
- {
- tmpa = NULL;
- }
-
- z_cscd_addlocal_int(newloc2globssize[rank+1] - newloc2globssize[rank],
- colptr2send[rank], rows2send[rank],
- ((flags_recv[0]==0)?(NULL):(values2send[rank])),
- newloc2globs[rank],
- newloc2globssize[rank+1] - newloc2globssize[rank],
- tmpia , tmpja ,
- tmpa , newloc2globs[rank],
- &tmpn , &tmpia2 ,
- &tmpja2 ,
- (flags_recv[0]==1)?(&tmpa2):NULL,
- CSCD_ADD, dof,
- malloc_flag);
-
-
- memFree_null(tmpia);
- memFree_null(tmpja);
- if (NULL != tmpa)
- memFree_null(tmpa);
- FREE_NULL_INTOREXT(colptr2send[rank], malloc_flag);
- if (rows2send[rank] != NULL)
- FREE_NULL_INTOREXT(rows2send[rank], malloc_flag);
- if (flags_recv[0]==1)
- if (values2send[rank] != NULL)
- FREE_NULL_INTOREXT(values2send[rank], malloc_flag);
- colptr2send[rank] = tmpia2;
- rows2send[rank] = tmpja2;
- if (flags_recv[0]==1)
- values2send[rank] = tmpa2;
- }
-
- if (flags_recv[1] == 1)
- {
- pastix_int_t iter_rhs;
- MPI_Recv(tmprhs, dof*dn*nrhs, COMM_FLOAT, MPI_ANY_SOURCE, TAG_RHS,
- comm, &status);
- for (iter_rhs = 0; iter_rhs < nrhs; iter_rhs++)
- {
- for (j = 0; j < dn; j++)
- {
- pastix_int_t k;
- for (k = 0; k< dof; k++)
- (*drhs)[dof*(j + iter_rhs*dn)+k] += tmprhs[dof*(j + iter_rhs*dn)+k];
- }
- }
- }
- toreceive--;
- }
-
- if (flags_recv[1] == 1)
- memFree_null(tmprhs);
-
- for (i = 0; i < commSize; i++)
- {
- if (i != rank)
- {
- size = colptr2send[i][newloc2globssize[i+1] - newloc2globssize[i]]-1;
- if (newloc2globs[i])
- memFree_null(newloc2globs[i]);
- MPI_Wait(&requests_size[i], &status);
- if (size > 0)
- {
- MPI_Wait(&requests_col[i], &status);
- MPI_Wait(&requests_row[i], &status);
- memFree_null(rows2send[i]);
- if (flags_recv[0] == 1)
- {
- MPI_Wait(&requests_val[i], &status);
- memFree_null(values2send[i]);
- }
- }
- memFree_null(colptr2send[i]);
- if (rows2send[i] != NULL)
- memFree_null(rows2send[i]);
- if (flags_recv[0] == 1)
- if (values2send[i] != NULL)
- memFree_null(values2send[i]);
-
- if (flags_recv[1] == 1)
- {
- MPI_Wait(&requests_rhs[i], &status);
- memFree_null(rhs2send[i]);
- }
-
- }
- }
-
- MPI_Barrier(comm);
-
- *dia = colptr2send[rank];
- *dja = rows2send[rank];
- if ( flags_recv[0] == 1)
- *da = values2send[rank];
-
- memFree_null(newloc2globssize);
- memFree_null(newloc2globs);
- memFree_null(colptr2send);
- memFree_null(rows2send);
- if (flags_recv[0] == 1)
- memFree_null(values2send);
- if (flags_recv[1] == 1)
- memFree_null(rhs2send);
- memFree_null(sizep);
- memFree_null(requests_size);
- memFree_null(requests_col);
- memFree_null(requests_row);
- if (flags_recv[0] == 1)
- memFree_null(requests_val);
- if (flags_recv[1] == 1)
- memFree_null(requests_rhs);
-
- return PASTIX_SUCCESS;
-#endif
-}
-
-
-/*
- Function: cscd2csc
-
- Transform a cscd to a csc.
- colptr2, row2, avals2, rhs2, perm2, invp2 are allocated here.
-
- External function, allocation are not of the internal type.
-
- Parameters:
- lN - number of local column.
- lcolptr - starting index of each local column in row and avals.
- lrow _ row number of each local element.
- lavals - values of each local element.
- lrhs - local part of the right hand side.
- lperm - local part of the permutation tabular.
- linvp - Means nothing, to suppress.
- gN - global number of columns (output).
- gcolptr - starting index of each column in row2 and avals2 (output).
- grow - row number of each element (output).
- gavals - values of each element (output).
- grhs - global right hand side (output).
- gperm - global permutation tabular (output).
- ginvp - global reverse permutation tabular (output).
- loc2glob - global number of each local column.
- pastix_comm - PaStiX MPI communicator.
-
-*/
-void z_cscd2csc(pastix_int_t lN, pastix_int_t * lcolptr, pastix_int_t * lrow, pastix_complex64_t * lavals,
- pastix_complex64_t * lrhs, pastix_int_t * lperm, pastix_int_t * linvp,
- pastix_int_t *gN, pastix_int_t ** gcolptr, pastix_int_t **grow, pastix_complex64_t **gavals,
- pastix_complex64_t **grhs, pastix_int_t **gperm, pastix_int_t **ginvp,
- pastix_int_t *loc2glob, MPI_Comm pastix_comm, pastix_int_t ndof)
-{
- z_cscd2csc_int(lN, lcolptr, lrow, lavals,
- lrhs, lperm, linvp,
- gN, gcolptr, grow, gavals,
- grhs, gperm, ginvp,
- loc2glob, pastix_comm, ndof, API_NO);
-}
-/*
- * Function: cscd2csc_int
- *
- * Transform a cscd to a csc.
- * colptr2, row2, avals2, rhs2, perm2, invp2 are allocated here.
- *
- * Parameters:
- * lN - number of local column.
- * lcolptr - starting index of each local column in row and avals.
- * lrow _ row number of each local element.
- * lavals - values of each local element.
- * lrhs - local part of the right hand side.
- * lperm - local part of the permutation tabular.
- * linvp - Means nothing, to suppress.
- * gN - global number of columns (output).
- * gcolptr - starting index of each column in row2 and avals2 (output).
- * grow - row number of each element (output).
- * gavals - values of each element (output).
- * grhs - global right hand side (output).
- * gperm - global permutation tabular (output).
- * ginvp - global reverse permutation tabular (output).
- * loc2glob - global number of each local column.
- * pastix_comm - PaStiX MPI communicator.
- * intern_flag - Decide if malloc will use internal or external macros.
- *
- */
-void z_cscd2csc_int(pastix_int_t lN, pastix_int_t * lcolptr, pastix_int_t * lrow, pastix_complex64_t * lavals,
- pastix_complex64_t * lrhs, pastix_int_t * lperm, pastix_int_t * linvp,
- pastix_int_t *gN, pastix_int_t ** gcolptr, pastix_int_t **grow, pastix_complex64_t **gavals,
- pastix_complex64_t **grhs, pastix_int_t **gperm, pastix_int_t **ginvp,
- pastix_int_t *loc2glob, MPI_Comm pastix_comm, pastix_int_t ndof, int intern_flag)
-{
- pastix_int_t i,j;
- int rank;
- int commSize;
- pastix_int_t index;
- pastix_int_t * AllLocalN = NULL;
- pastix_int_t ** AllColptr = NULL;
- pastix_int_t ** AllRow = NULL;
- pastix_int_t ** AllLoc2glob = NULL;
- pastix_complex64_t ** AllAvals = NULL;
- pastix_complex64_t ** AllRhs = NULL;
- pastix_int_t ** AllPerm = NULL;
- /* pastix_int_t ** AllInvp; */
- int proc;
- (void)pastix_comm; (void)linvp;
-
- MPI_Comm_rank(pastix_comm,&rank);
- MPI_Comm_size(pastix_comm,&commSize);
-
- MALLOC_INTERN(AllLocalN, commSize, pastix_int_t );
- MALLOC_INTERN(AllColptr, commSize, pastix_int_t*);
- MALLOC_INTERN(AllRow, commSize, pastix_int_t*);
- MALLOC_INTERN(AllLoc2glob, commSize, pastix_int_t*);
-
- if (gavals != NULL)
- MALLOC_INTERN(AllAvals, commSize, pastix_complex64_t*);
-
- if (grhs != NULL)
- MALLOC_INTERN(AllRhs, commSize, pastix_complex64_t*);
-
- if (gperm != NULL)
- MALLOC_INTERN(AllPerm, commSize, pastix_int_t*);
-
- for (i = 0; i < commSize; i++)
- {
- if (i == rank)
- {
- AllLocalN[i] = lN;
- AllColptr[i] = lcolptr;
- AllRow[i] = lrow;
- if (gavals != NULL)
- AllAvals[i] = lavals;
- if (grhs != NULL)
- AllRhs[i] = lrhs;
- if (gperm != NULL)
- AllPerm[i] = lperm;
- AllLoc2glob[i] = loc2glob;
- }
-
- MPI_Bcast(&AllLocalN[i] , 1, PASTIX_MPI_INT, i, pastix_comm);
- if (rank != i)
- {
- MALLOC_INTERN(AllColptr[i], AllLocalN[i]+1, pastix_int_t);
- MALLOC_INTERN(AllLoc2glob[i], AllLocalN[i], pastix_int_t);
- if (grhs != NULL)
- MALLOC_INTERN(AllRhs[i], ndof*AllLocalN[i], pastix_complex64_t);
-
- if (gperm != NULL)
- MALLOC_INTERN(AllPerm[i], AllLocalN[i], pastix_int_t);
- }
-
- MPI_Bcast(AllColptr[i], AllLocalN[i]+1, PASTIX_MPI_INT , i, pastix_comm);
- if (rank != i)
- {
- MALLOC_INTERN(AllRow[i], AllColptr[i][AllLocalN[i]]-1, pastix_int_t);
- if (gavals != NULL)
- MALLOC_INTERN(AllAvals[i], ndof*ndof*(AllColptr[i][AllLocalN[i]]-1), pastix_complex64_t);
- }
-
- MPI_Bcast(AllRow[i], AllColptr[i][AllLocalN[i]]-1,
- PASTIX_MPI_INT, i, pastix_comm);
- MPI_Bcast(AllLoc2glob[i], AllLocalN[i], PASTIX_MPI_INT, i, pastix_comm);
- if (gperm != NULL) {
- MPI_Bcast(AllPerm[i], AllLocalN[i], PASTIX_MPI_INT, i, pastix_comm);
- }
-
- if (grhs != NULL) {
- MPI_Bcast(AllRhs[i], ndof*AllLocalN[i], COMM_FLOAT, i, pastix_comm);
- }
- if (gavals != NULL) {
- MPI_Bcast(AllAvals[i], ndof*ndof*(AllColptr[i][AllLocalN[i]]-1),
- COMM_FLOAT, i, pastix_comm);
- }
- }
-
-
- *gN = 0;
- for (i = 0; i < commSize; i++)
- {
- *gN += AllLocalN[i];
- }
-
- MALLOC_INTOREXTERN(*gcolptr, ((*gN)+1), pastix_int_t, intern_flag);
- /* Fill in gcolptr */
- (*gcolptr)[0] = 1;
- for (i = 0; i < (*gN); i++)
- {
- for (proc = 0; proc < commSize; proc++)
- {
- searchInList(i+1, AllLoc2glob[proc], AllLocalN[proc], index);
- if ( index >= 0 )
- {
- (*gcolptr)[i+1] = (*gcolptr)[i] +
- AllColptr[proc][index+1] -
- AllColptr[proc][index];
- break;
- }
-
- }
- }
- MALLOC_INTOREXTERN(*grow, (*gcolptr)[(*gN)]-1, pastix_int_t, intern_flag);
- if (gavals != NULL)
- MALLOC_INTOREXTERN(*gavals, ndof*ndof*((*gcolptr)[(*gN)]-1), pastix_complex64_t, intern_flag);
- if (grhs != NULL)
- MALLOC_INTOREXTERN(*grhs, *gN*ndof, pastix_complex64_t, intern_flag);
- if (gperm != NULL)
- {
- MALLOC_INTOREXTERN(*gperm, *gN, pastix_int_t, intern_flag);
- MALLOC_INTOREXTERN(*ginvp, *gN, pastix_int_t, intern_flag);
- }
-
- /* Fill-in grow, gavals, grhs, gperm and ginvp*/
- for (proc = 0; proc < commSize; proc++)
- {
- for (i = 0; i < AllLocalN[proc]; i++)
- {
- memcpy(&(*grow)[(*gcolptr)[AllLoc2glob[proc][i]-1]-1],
- &AllRow[proc][AllColptr[proc][i]-1],
- (AllColptr[proc][i+1] - AllColptr[proc][i])*sizeof(pastix_int_t));
- if (gavals != NULL)
- memcpy(&(*gavals)[(*gcolptr)[AllLoc2glob[proc][i]-1]-1],
- &AllAvals[proc][AllColptr[proc][i]-1],
- ndof*ndof*(AllColptr[proc][i+1] - AllColptr[proc][i])*sizeof(pastix_complex64_t));
- if (grhs != NULL)
- for (j = 0; j < ndof; j++)
- (*grhs)[ndof*(AllLoc2glob[proc][i]-1)+j] = AllRhs[proc][ndof*i+j];
- if (gperm != NULL)
- {
- (*gperm)[AllLoc2glob[proc][i]-1] = AllPerm[proc][i];
- /* (*ginvp)[AllLoc2glob[proc][i]-1] = AllInvp[proc][i]; */
-
- }
- }
- }
- if (gperm != NULL)
- {
- for (i = 0; i < *gN; i++)
- (*ginvp)[(*gperm)[i]] = i;
- }
- for (i = 0; i < commSize; i++)
- {
- if (rank != i)
- {
- memFree_null(AllColptr[i]);
- memFree_null(AllRow[i]);
- if (gavals != NULL)
- memFree_null(AllAvals[i]);
- if (grhs != NULL)
- memFree_null(AllRhs[i]);
- memFree_null(AllLoc2glob[i]);
- if (gperm != NULL)
- {
- memFree_null(AllPerm[i]);
- /* memFree_null(AllInvp[i]); */
- }
- }
- }
- memFree_null(AllLocalN);
- memFree_null(AllColptr);
- memFree_null(AllRow);
- if (gavals != NULL)
- memFree_null(AllAvals);
- if (grhs != NULL)
- memFree_null(AllRhs);
- memFree_null(AllLoc2glob);
- if (gperm != NULL)
- {
- memFree_null(AllPerm);
- /* memFree_null(AllInvp); */
- }
-
-}
-
-/*
- * Function: csc2cscd
- *
- * Transform a csc to a cscd.
- * Allocate the CSCD.
- * If grhs == NULL forget right hand side part.
- * If gperm == NULL forget permutation and reverse permutation part.
- *
- *
- * TODO: USE_EXTERNAL MALLOCS
- *
- * Parameters:
- * gN - global number of columns
- * gcolptr - global starting index of each column in grows ans gavals.
- * grows - global rows of each element.
- * gavals - global values of each element.
- * gperm - global permutation tabular.
- * ginvp - global reverse permutation tabular.
- * lN - local number of columns.
- * lcolptr - starting index of each local column.
- * lrowptr - row number of each local element.
- * lavals - values of each local element.
- * lrhs - local part of the right hand side (output).
- * lperm - local part of the permutation tabular (output).
- * linvp - local part of the reverse permutation tabular (output).
- * loc2glob - global numbers of local columns (before permutation).
- */
-void z_csc2cscd(pastix_int_t gN, pastix_int_t * gcolptr, pastix_int_t * grow,
- pastix_complex64_t * gavals, pastix_complex64_t * grhs, pastix_int_t * gperm, pastix_int_t * ginvp,
- pastix_int_t lN, pastix_int_t ** lcolptr, pastix_int_t ** lrow,
- pastix_complex64_t ** lavals, pastix_complex64_t ** lrhs, pastix_int_t ** lperm, pastix_int_t ** linvp,
- pastix_int_t *loc2glob)
-{
- pastix_int_t i;
- (void)gN; (void)ginvp; (void)linvp;
-
- if (grhs != NULL)
- {
- MALLOC_INTERN(*lrhs, lN, pastix_complex64_t);
- for (i = 0; i < lN; i++)
- (*lrhs )[i] = grhs [loc2glob[i]];
- }
- if (gperm != NULL)
- {
- MALLOC_INTERN(*lperm, lN, pastix_int_t);
- for (i = 0; i < lN; i++)
- {
- (*lperm)[i] = gperm[loc2glob[i]];
- }
- }
-
- MALLOC_INTERN(*lcolptr, lN+1, pastix_int_t);
- (*lcolptr)[0] = 1;
- for (i = 0; i < lN; i++)
- {
- (*lcolptr)[i+1] = (*lcolptr)[i] +
- gcolptr[loc2glob[i]] - gcolptr[loc2glob[i]-1];
- }
-
- MALLOC_INTERN(*lrow, (*lcolptr)[lN]-1, pastix_int_t);
- if (gavals != NULL)
- MALLOC_INTERN(*lavals, (*lcolptr)[lN]-1, pastix_complex64_t);
-
- for (i = 0; i < lN; i++)
- {
- memcpy(&((*lrow) [(*lcolptr)[i]-1]),
- &( grow [gcolptr[loc2glob[i]-1]-1]),
- (gcolptr[loc2glob[i]] - gcolptr[loc2glob[i]-1])*sizeof (pastix_int_t));
- if (gavals != NULL)
- memcpy(&((*lavals)[(*lcolptr)[i]-1]),
- &( gavals[gcolptr[loc2glob[i]-1]]),
- (gcolptr[loc2glob[i]] - gcolptr[loc2glob[i]-1])*sizeof(pastix_complex64_t));
- }
-
-
-}
-
-/*
- * Function: z_cscd_noDiag
- *
- * Removes diagonal elements from a CSCD.
- * *ja* and *a* can be reallocated to
- * ia[n]-1 elements after this call.
- *
- *
- * Parameters:
- * n - Number of local columns
- * ia - First cscd starting index of each column in *ja* and *a*
- * ja - Row of each element in first CSCD
- * a - value of each cscd in first CSCD (can be NULL)
- * l2g - local 2 global column numbers for first cscd
- *
- */
-int z_cscd_noDiag(pastix_int_t n, pastix_int_t *ia, pastix_int_t *ja, pastix_complex64_t * a, const pastix_int_t * l2g)
-{
- pastix_int_t i;
- pastix_int_t j;
- pastix_int_t previous_index = 0;
- pastix_int_t index = 0;
-
- print_debug(DBG_CSCD, "->z_cscd_noDiag\n");
- /* for all local column i */
- for(i = 0; i < n; i++)
- {
- /* for all line in the colupmn */
- for (j = ia[i]; j < ia[i+1]; j++)
- {
- /* if the element is not on diag */
- if (ja[j-1] != l2g[i] )
- {
- /* we add it to ja */
- ja[index] = ja[j-1];
- if (NULL != a)
- a[index] = a[j-1];
- index++;
- }
- }
- /* we change ia[i] to it's new value */
- ia[i] = previous_index+1;
- previous_index = index;
- }
- ia[n] = index+1;
- print_debug(DBG_CSCD, "<-z_cscd_noDiag\n");
- return EXIT_SUCCESS;
-}
-
-
-/*
- * Function: z_cscd_save
- *
- * save a distributed csc to disk.
- * files are called $(filename) and $(filename)$(RANK)
- * if filename is NULL then filename = cscd_matrix.
- *
- * file filename contains the number of processors/files
- * on first line. Then each line contain the name of each file
- * (here $(filename)$(RANK)).
- *
- *
- *
- * Parameters:
- * n - Number of local columns
- * ia - First cscd starting index of each column in *ja* and *a*
- * ja - Row of each element in first CSCD
- * a - value of each cscd in first CSCD (can be NULL)
- * rhs - Right hand side.
- * l2g - local 2 global column numbers for first cscd
- * dof - Number of degrees of freedom
- * filename - name of the files.
- * comm - MPI communicator
- */
-int z_cscd_save(pastix_int_t n,
- pastix_int_t * ia,
- pastix_int_t * ja,
- pastix_complex64_t * a,
- pastix_complex64_t * rhs,
- pastix_int_t * l2g,
- int dof,
- const char * filename,
- MPI_Comm comm)
-{
- FILE * outfile;
- char file[64];
- char file2[64];
- int myrank, nbproc;
- pastix_int_t i, j, k, l, vertglb = 0;
- (void)comm;
-
- MPI_Comm_rank(comm, &myrank);
- MPI_Comm_size(comm, &nbproc);
-
- MPI_Allreduce(&n, &vertglb, 1, PASTIX_MPI_INT, MPI_SUM, comm);
-
- if (filename == NULL)
- sprintf(file, "cscd_matrix");
- else
- sprintf(file, "%s", filename);
-
- if (myrank == 0)
- {
- outfile = fopen(file, "w+");
- fprintf(outfile, "%d %d %d\n", (int)nbproc, (a != NULL)?1:0,
- (rhs != NULL)?1:0);
- for(i=0; i<nbproc; i++)
- fprintf(outfile, "%s%d\n", file, (int)i);
- fclose(outfile);
- }
-
- sprintf(file2, "%s%d", file, myrank);
-
- outfile = fopen(file2, "w+");
- fprintf(outfile, "%ld %ld\n", (long)vertglb, (long)n);
- fprintf(outfile, "%ld\n", (long)ia[n]-1);
-
- /* Copie de Loc2Glob */
- if (l2g != NULL)
- {
- for (i=0; i<n; i++)
- {
- fprintf(outfile, "%ld ", (long)l2g[i]);
- if (i%4 == 3) fprintf(outfile, "\n");
- }
- if ((i-1)%4 !=3) fprintf(outfile, "\n");
- }
-
- /* Copie de IA */
- for (i=0; i<n+1; i++)
- {
- fprintf(outfile, "%ld ", (long)ia[i]);
- if (i%4 == 3) fprintf(outfile, "\n");
- }
- if ((i-1)%4 !=3) fprintf(outfile, "\n");
-
- /* Copie de JA */
- for (i=0; i<ia[n]-1; i++)
- {
- fprintf(outfile, "%ld ", (long)ja[i]);
- if (i%4 == 3) fprintf(outfile, "\n");
- }
- if ((i-1)%4 !=3) fprintf(outfile, "\n");
-
- /* Copie de Avals */
-
- if (a != NULL)
- {
- for (i=0; i<(ia[n]-1)*dof*dof; i++)
- {
-#ifdef TYPE_COMPLEX
- fprintf(outfile, "%lg %lg ", creal(a[i]), cimag(a[i]));
- if (i%2 == 1) fprintf(outfile, "\n");
-#else
- fprintf(outfile, "%lg ", a[i]);
- if (i%4 == 3) fprintf(outfile, "\n");
-#endif
- }
-#ifdef TYPE_COMPLEX
- if ((i-1)%2 !=3) fprintf(outfile, "\n");
-#else
- if ((i-1)%4 !=3) fprintf(outfile, "\n");
-#endif
- }
- /* Copie de RHS */
- if (rhs != NULL)
- {
- for (i=0; i<n*dof; i++)
- {
-#ifdef TYPE_COMPLEX
- fprintf(outfile, "%lg %lg ", creal(rhs[i]), cimag(rhs[i]));
- if (i%2 == 1) fprintf(outfile, "\n");
-#else
- fprintf(outfile, "%lg ", rhs[i]);
- if (i%4 == 3) fprintf(outfile, "\n");
-#endif
- }
-#ifdef TYPE_COMPLEX
- if ((i-1)%2 !=3) fprintf(outfile, "\n");
-#else
- if ((i-1)%4 !=3) fprintf(outfile, "\n");
-#endif
- }
- else
- {
- fprintf(outfile, "rhs vaut NULL\n");
- }
-
- fclose(outfile);
-
- sprintf(file2, "%s_ijv%d", file, myrank);
- outfile = fopen(file2, "w+");
-
- for (i = 0; i < n; i++)
- for (j = ia[i]-1; j < ia[i+1]-1; j++)
- {
- for (k = 0; k < dof; k++)/* column dof */
- {
- for(l = 0; l < dof; l++) /* line dof */
- {
- if (l2g != NULL)
- {
- if (a != NULL)
- {
-#ifdef TYPE_COMPLEX
-#ifdef DUMP_BY_NODE
- fprintf(outfile, "%ld (%ld)\t%ld (%ld)\t%.12lg\t%.12lg\n",
- (long)l2g[i], (long)(k+1),
- (long)ja[j], (long)(l+1),
- (double)creal(a[j*dof*dof+k*dof+l]),
- (double)cimag(a[j*dof*dof+k*dof+l]));
-#else
- fprintf(outfile, "%ld\t%ld\t%.12lg\t%.12lg\n",
- (long)(l2g[i]-1)*dof + (k+1),
- (long)(ja[j]-1)*dof + (l+1),
- (double)creal(a[j*dof*dof+k*dof+l]),
- (double)cimag(a[j*dof*dof+k*dof+l]));
-#endif
-#else
-
-#ifdef DUMP_BY_NODE
- fprintf(outfile, "%ld (%ld)\t%ld (%ld)\t%.12lg\n",
- (long)l2g[i], (long)(k+1),
- (long)ja[j], (long)(l+1),
- (double)a[j*dof*dof+k*dof+l]);
-#else
- fprintf(outfile, "%ld\t%ld\t%.12lg\n",
- (long)(l2g[i]-1)*dof + (k+1),
- (long)(ja[j]-1)*dof + (l+1),
- (double)a[j*dof*dof+k*dof+l]);
-#endif
-#endif
- }
- else
- {
- fprintf(outfile, "%ld\t%ld\n",
- (long)((l2g[i]-1)*dof+k+1),
- (long)((ja[j]-1)*dof+l+1));
- }
- }
- else
- {
- if (a != NULL)
- {
-#ifdef TYPE_COMPLEX
- fprintf(outfile, "%ld\t%ld\t%.12lg\t%.12lg\n",
- (long)((i)*dof+k+1),
- (long)((ja[j]-1)*dof+l+1),
- (double)creal(a[j*dof*dof+k*dof+l]),
- (double)cimag(a[j*dof*dof+k*dof+l]));
-#else
- fprintf(outfile, "%ld\t%ld\t%.12lg\n",
- (long)((i)*dof+k+1),
- (long)((ja[j]-1)*dof+l+1),
- (double)a[j*dof*dof+k*dof+l]);
-#endif
- }
- else
- {
- fprintf(outfile, "%ld\t%ld\n",
- (long)((i)*dof+k+1),
- (long)((ja[j]-1)*dof+l+1));
- }
- }
- }
- }
-
- }
- fclose(outfile);
- if (rhs != NULL)
- {
- sprintf(file2, "%s_rhs%d", file, myrank);
- outfile = fopen(file2, "w");
- for (i=0; i<n; i++)
- {
-
- for (j = 0; j < dof; j++)
- {
- if (l2g != NULL)
- {
-#ifdef TYPE_COMPLEX
- fprintf(outfile, "%ld %lg %lg\n", (long)((l2g[i]-1)*dof+j+1),
- (double)creal(rhs[i*dof+j]),
- (double)cimag(rhs[i*dof+j]));
-#else
- fprintf(outfile, "%ld %lg\n", (long)((l2g[i]-1)*dof+j+1),
- (double)rhs[i*dof+j]);
-#endif
- }
- else
- {
-#ifdef TYPE_COMPLEX
- fprintf(outfile, "%ld %lg %lg\n", (long)(i*dof+j+1),
- (double)creal(rhs[i*dof+j]),
- (double)cimag(rhs[i*dof+j]));
-#else
- fprintf(outfile, "%ld %lg\n", (long)(i*dof+j+1),
- (double)rhs[i*dof+j]);
-#endif
- }
- }
- }
-
- fclose(outfile);
- }
-
- return 0;
-}
-
-/*
- * Function: z_cscd_load
- *
- * Loads a distributed csc from disk.
- * if filename is NULL then filename = cscd_matrix.
- *
- * Parameters:
- * n - Number of local columns
- * ia - First cscd starting index of each column in *ja* and *a*
- * ja - Row of each element in first CSCD
- * a - value of each cscd in first CSCD (can be NULL)
- * rhs - Right hand side.
- * l2g - local 2 global column numbers for first cscd
- * filename - name of the files.
- * comm - MPI communicator
- */
-int z_cscd_load(pastix_int_t *n, pastix_int_t ** ia, pastix_int_t ** ja, pastix_complex64_t ** a, pastix_complex64_t ** rhs,
- pastix_int_t ** l2g, const char * filename, MPI_Comm mpi_comm)
-{
- FILE * infile;
- char file[64];
- int myrank, nbproc;
- int nbprocexpected;
- pastix_int_t i;
- int valbool = 0;
- int rhsbool = 0;
- long tmp1,tmp2,tmp3,tmp4;
- double tmpflt1,tmpflt2,tmpflt3,tmpflt4;
-#ifdef TYPE_COMPLEX
- double tmpflt5,tmpflt6,tmpflt7,tmpflt8;
-#endif
- long nnz;
- (void)mpi_comm;
-
- MPI_Comm_rank(mpi_comm, &myrank);
- MPI_Comm_size(mpi_comm, &nbproc);
-
- if (filename == NULL)
- sprintf(file, "cscd_matrix");
- else
- sprintf(file, "%s", filename);
-
- if (myrank == 0)
- {
- infile = fopen(file, "r");
- if (3 != fscanf(infile, "%ld %ld %ld\n", &tmp1, &tmp2, &tmp3)){
- errorPrint("CSCD badly formated");
- return EXIT_FAILURE;
- }
- nbprocexpected = tmp1;
- valbool = tmp2;
- rhsbool = tmp3;
- if (nbprocexpected != nbproc)
- {
- errorPrint("Number of processors should be %d\n",nbprocexpected);
- return EXIT_FAILURE;
- }
- for(i=0; i<myrank; i++)
- if (1 != fscanf(infile, "%s\n", file)){
- errorPrint("CSCD badly formated");
- return EXIT_FAILURE;
- }
-
- fclose(infile);
- }
- fprintf(stdout,"%s", file);
- infile = fopen(file, "r");
- if (2 != fscanf(infile, "%ld %ld\n", &tmp1, &tmp2)){
- errorPrint("CSCD badly formated");
- return EXIT_FAILURE;
- }
-
- *n = tmp2;
- if (1 != fscanf(infile, "%ld\n", &nnz)){
- errorPrint("CSCD badly formated");
- return EXIT_FAILURE;
- }
-
-
- /* Copie de Loc2Glob */
- *l2g = NULL;
- MALLOC_INTERN(*l2g, *n, pastix_int_t);
- for (i=0; i<*n-4+1; i+=4)
- {
- if (4 != fscanf(infile, "%ld %ld %ld %ld", &tmp1, &tmp2, &tmp3, &tmp4)){
- errorPrint("CSCD badly formated");
- return EXIT_FAILURE;
- }
-
- (*l2g)[i ] = tmp1;
- (*l2g)[i+1] = tmp2;
- (*l2g)[i+2] = tmp3;
- (*l2g)[i+3] = tmp4;
- }
- switch (*n - i )
- {
- case 3:
- if (3 != fscanf(infile, "%ld %ld %ld", &tmp1, &tmp2, &tmp3)){
- errorPrint("CSCD badly formated");
- return EXIT_FAILURE;
- }
-
- (*l2g)[i ] = tmp1;
- (*l2g)[i+1] = tmp2;
- (*l2g)[i+2] = tmp3;
- break;
- case 2:
- if (2 != fscanf(infile, "%ld %ld", &tmp1, &tmp2)){
- errorPrint("CSCD badly formated");
- return EXIT_FAILURE;
- }
-
- (*l2g)[i ] = tmp1;
- (*l2g)[i+1] = tmp2;
- break;
- case 1:
- if (1 != fscanf(infile, "%ld", &tmp1)){
- errorPrint("CSCD badly formated");
- return EXIT_FAILURE;
- }
-
- (*l2g)[i ] = tmp1;
- break;
- }
-
- /* Copie de IA */
- *ia = NULL;
- MALLOC_INTERN(*ia, *n+1, pastix_int_t);
- for (i=0; i<*n+1+1-4; i+=4)
- {
- if (4 != fscanf(infile, "%ld %ld %ld %ld", &tmp1, &tmp2, &tmp3, &tmp4)){
- errorPrint("CSCD badly formated");
- return EXIT_FAILURE;
- }
-
- (*ia)[i ] = tmp1;
- (*ia)[i+1] = tmp2;
- (*ia)[i+2] = tmp3;
- (*ia)[i+3] = tmp4;
- }
- switch (*n +1 - i)
- {
- case 3:
- if (3 != fscanf(infile, "%ld %ld %ld", &tmp1, &tmp2, &tmp3)){
- errorPrint("CSCD badly formated");
- return EXIT_FAILURE;
- }
-
- (*ia)[i ] = tmp1;
- (*ia)[i+1] = tmp2;
- (*ia)[i+2] = tmp3;
- break;
- case 2:
- if (2 != fscanf(infile, "%ld %ld", &tmp1, &tmp2)){
- errorPrint("CSCD badly formated");
- return EXIT_FAILURE;
- }
-
- (*ia)[i ] = tmp1;
- (*ia)[i+1] = tmp2;
- break;
- case 1:
- if (1 != fscanf(infile, "%ld", &tmp1)){
- errorPrint("CSCD badly formated");
- return EXIT_FAILURE;
- }
-
- (*ia)[i ] = tmp1;
- break;
- }
-
-
- /* Copie de JA */
- (*ja) = NULL;
- MALLOC_INTERN(*ja, nnz, pastix_int_t);
- for (i=0; i<nnz+1-4; i+=4)
- {
- if (4 != fscanf(infile, "%ld %ld %ld %ld", &tmp1, &tmp2, &tmp3, &tmp4)){
- errorPrint("CSCD badly formated");
- return EXIT_FAILURE;
- }
-
- (*ja)[i ] = tmp1;
- (*ja)[i+1] = tmp2;
- (*ja)[i+2] = tmp3;
- (*ja)[i+3] = tmp4;
- }
-
- switch (nnz - i)
- {
- case 3:
- if (3 != fscanf(infile, "%ld %ld %ld", &tmp1, &tmp2, &tmp3)){
- errorPrint("CSCD badly formated");
- return EXIT_FAILURE;
- }
-
- (*ja)[i ] = tmp1;
- (*ja)[i+1] = tmp2;
- (*ja)[i+2] = tmp3;
- break;
- case 2:
- if (2 != fscanf(infile, "%ld %ld", &tmp1, &tmp2)){
- errorPrint("CSCD badly formated");
- return EXIT_FAILURE;
- }
-
- (*ja)[i ] = tmp1;
- (*ja)[i+1] = tmp2;
- break;
- case 1:
- if (1 != fscanf(infile, "%ld", &tmp1)){
- errorPrint("CSCD badly formated");
- return EXIT_FAILURE;
- }
-
- (*ja)[i ] = tmp1;
- break;
- }
-
- /* Copie de Avals */
- if (valbool)
- {
- (*a) = NULL;
- MALLOC_INTERN(*a, nnz, pastix_complex64_t);
-
- for (i=0; i<nnz+1-4; i+=4)
- {
-#ifdef TYPE_COMPLEX
- if (8 != fscanf(infile, "%lg %lg %lg %lg %lg %lg %lg %lg",
- &tmpflt1, &tmpflt2, &tmpflt3, &tmpflt4,
- &tmpflt5, &tmpflt6, &tmpflt7, &tmpflt8)){
- errorPrint("CSCD badly formated");
- return EXIT_FAILURE;
- }
- (*a)[i ] = (pastix_complex64_t)(tmpflt1 + I * tmpflt2);
- (*a)[i+1] = (pastix_complex64_t)(tmpflt3 + I * tmpflt4);
- (*a)[i+2] = (pastix_complex64_t)(tmpflt5 + I * tmpflt6);
- (*a)[i+3] = (pastix_complex64_t)(tmpflt7 + I * tmpflt8);
-#else
- if (4 != fscanf(infile, "%lg %lg %lg %lg",
- &tmpflt1, &tmpflt2, &tmpflt3, &tmpflt4)){
- errorPrint("CSCD badly formated");
- return EXIT_FAILURE;
- }
- (*a)[i ] = (pastix_complex64_t)tmpflt1;
- (*a)[i+1] = (pastix_complex64_t)tmpflt2;
- (*a)[i+2] = (pastix_complex64_t)tmpflt3;
- (*a)[i+3] = (pastix_complex64_t)tmpflt4;
-#endif
- }
- switch (nnz - i )
- {
- case 3:
-#ifdef TYPE_COMPLEX
- if (6 != fscanf(infile, "%lg %lg %lg %lg %lg %lg",
- &tmpflt1, &tmpflt2, &tmpflt3, &tmpflt4,
- &tmpflt5, &tmpflt6)){
- errorPrint("CSCD badly formated");
- return EXIT_FAILURE;
- }
- (*a)[i ] = (pastix_complex64_t)(tmpflt1 + I * tmpflt2);
- (*a)[i+1] = (pastix_complex64_t)(tmpflt3 + I * tmpflt4);
- (*a)[i+2] = (pastix_complex64_t)(tmpflt5 + I * tmpflt6);
-#else
- if (3 != fscanf(infile, "%lg %lg %lg",
- &tmpflt1, &tmpflt2, &tmpflt3)){
- errorPrint("CSCD badly formated");
- return EXIT_FAILURE;
- }
- (*a)[i ] = (pastix_complex64_t)tmpflt1;
- (*a)[i+1] = (pastix_complex64_t)tmpflt2;
- (*a)[i+2] = (pastix_complex64_t)tmpflt3;
-#endif
- break;
- case 2:
-#ifdef TYPE_COMPLEX
- if (4 != fscanf(infile, "%lg %lg %lg %lg",
- &tmpflt1, &tmpflt2, &tmpflt3, &tmpflt4)){
- errorPrint("CSCD badly formated");
- return EXIT_FAILURE;
- }
- (*a)[i ] = (pastix_complex64_t)(tmpflt1 + I * tmpflt2);
- (*a)[i+1] = (pastix_complex64_t)(tmpflt3 + I * tmpflt4);
-#else
- if (2 != fscanf(infile, "%lg %lg",
- &tmpflt1, &tmpflt2)){
- errorPrint("CSCD badly formated");
- return EXIT_FAILURE;
- }
- (*a)[i ] = (pastix_complex64_t)tmpflt1;
- (*a)[i+1] = (pastix_complex64_t)tmpflt2;
-#endif
- break;
- case 1:
-#ifdef TYPE_COMPLEX
- if (2 != fscanf(infile, "%lg %lg",
- &tmpflt1, &tmpflt2)){
- errorPrint("CSCD badly formated");
- return EXIT_FAILURE;
- }
- (*a)[i ] = (pastix_complex64_t)(tmpflt1 + I * tmpflt2);
-#else
- if (1 != fscanf(infile, "%lg",
- &tmpflt1)){
- errorPrint("CSCD badly formated");
- return EXIT_FAILURE;
- }
- (*a)[i ] = (pastix_complex64_t)tmpflt1;
-#endif
- break;
- }
- }
- /* Copie de RHS */
- if (rhsbool)
- {
- (*rhs) = NULL;
- MALLOC_INTERN(*rhs, *n, pastix_complex64_t);
- for (i=0; i<*n+1-4; i+=4)
- {
- if (4 != fscanf(infile, "%lg %lg %lg %lg",
- &tmpflt1, &tmpflt2, &tmpflt3, &tmpflt4)){
- errorPrint("CSCD badly formated");
- return EXIT_FAILURE;
- }
-
- (*rhs)[i ] = (pastix_complex64_t)tmpflt1;
- (*rhs)[i+1] = (pastix_complex64_t)tmpflt2;
- (*rhs)[i+2] = (pastix_complex64_t)tmpflt3;
- (*rhs)[i+3] = (pastix_complex64_t)tmpflt4;
- }
-
- switch (*n - i)
- {
- case 3:
- if (3 != fscanf(infile, "%lg %lg %lg",
- &tmpflt1, &tmpflt2, &tmpflt3)){
- errorPrint("CSCD badly formated");
- return EXIT_FAILURE;
- }
-
- (*rhs)[i ] = (pastix_complex64_t)tmpflt1;
- (*rhs)[i+1] = (pastix_complex64_t)tmpflt2;
- (*rhs)[i+2] = (pastix_complex64_t)tmpflt3;
- break;
- case 2:
- if (2 != fscanf(infile, "%lg %lg", &tmpflt1, &tmpflt2)){
- errorPrint("CSCD badly formated");
- return EXIT_FAILURE;
- }
-
- (*rhs)[i ] = (pastix_complex64_t)tmpflt1;
- (*rhs)[i+1] = (pastix_complex64_t)tmpflt2;
- break;
- case 1:
- if (1 != fscanf(infile, "%lg", &tmpflt1)){
- errorPrint("CSCD badly formated");
- return EXIT_FAILURE;
- }
-
- (*rhs)[i ] = (pastix_complex64_t)tmpflt1;
- break;
- }
-
- }
- fclose(infile);
-
- return 0;
-}
diff --git a/z_cscd_utils.h b/z_cscd_utils.h
deleted file mode 100644
index d0042609..00000000
--- a/z_cscd_utils.h
+++ /dev/null
@@ -1,311 +0,0 @@
-/**
- * PaStiX distributed CSC management routines.
- *
- * PaStiX is a software package provided by Inria Bordeaux - Sud-Ouest,
- * LaBRI, University of Bordeaux 1 and IPB.
- *
- * @version 1.0.0
- * @author Mathieu Faverge
- * @author Pierre Ramet
- * @author Xavier Lacoste
- * @date 2011-11-11
- * @precisions normal z -> c d s
- *
- **/
-#ifndef Z_CSCD_UTILS_H
-#define Z_CSCD_UTILS_H
-
-
-/*
- * Enum: CSCD_OPERATIONS
- *
- * Operation when adding CSCD
- *
- * CSCD_ADD - Add coefficient values.
- * CSCD_KEEP - Keep value from first CSCD.
- * CSCD_MAX - Keep maximum of first and second CSCD.
- * CSCD_MIN - Keep minimum of first and second CSCD.
- * CSCD_OVW - Overwrite with second CSCD value.
- */
-enum CSCD_OPERATIONS {
- CSCD_ADD,
- CSCD_KEEP,
- CSCD_MAX,
- CSCD_MIN,
- CSCD_OVW
-};
-typedef enum CSCD_OPERATIONS CSCD_OPERATIONS_t;
-
-/*
- * Enum: CSC_DISPATCH_OP
- *
- * Operation when dispatching the csc into a cscd
- *
- * CSC_DISP_SIMPLE - Reparts linearly the columns over the proc.
- * CSC_DISP_CYCLIC - Reparts cyclicly the columns over the proc.
- *
- */
-enum CSC_DISPATCH_OP {
- CSC_DISP_SIMPLE,
- CSC_DISP_CYCLIC
-};
-typedef enum CSC_DISPATCH_OP CSCD_DISPATCH_OP_t;
-
-/* Section: Functions */
-/*
- * Function: z_csc_dispatch
- *
- * Distribute a CSC to a CSCD
- *
- * Parameters:
- * gN - global number of columns
- * gcolptr - global starting index of each column in grows ans gavals.
- * grows - global rows of each element.
- * gavals - global values of each element.
- * gperm - global permutation tabular.
- * ginvp - global reverse permutation tabular.
- * lN - local number of columns (output).
- * lcolptr - starting index of each local column (output).
- * lrowptr - row number of each local element (output).
- * lavals - values of each local element (output).
- * lrhs - local part of the right hand side (output).
- * lperm - local part of the permutation tabular (output).
- * loc2glob - global numbers of local columns (before permutation).
- * dispatch - choose how to dispatch the csc
- * pastix_comm - PaStiX MPI communicator.
- */
-void z_csc_dispatch(pastix_int_t gN, pastix_int_t * gcolptr, pastix_int_t * grow, pastix_complex64_t * gavals,
- pastix_complex64_t * grhs, pastix_int_t * gperm, pastix_int_t * ginvp,
- pastix_int_t *lN, pastix_int_t ** lcolptr, pastix_int_t ** lrow, pastix_complex64_t ** lavals,
- pastix_complex64_t ** lrhs, pastix_int_t ** lperm,
- pastix_int_t **loc2glob, int dispatch, MPI_Comm pastix_comm);
-
-/*
- * Function: csc_cyclic_distribution
- *
- * Distribute the CSC cyclicaly.
- *
- * Parameters:
- * column - column number to distribute
- * columnnbr - Number of colmuns.
- * pastix_comm - PaStiX MPI communicator
- *
- * Return:
- * owner of the column (column%commSize)
- */
-pastix_int_t z_csc_cyclic_distribution(pastix_int_t column, pastix_int_t columnnbr, MPI_Comm pastix_comm);
-
-/*
- * Function: csc_simple_distribution
- *
- * Distribute the CSC.
- * First columns are for first proc and so on.
- *
- * Parameters:
- * column - column number to distribute
- * columnnbr - Number of colmuns.
- * pastix_comm - PaStiX MPI communicator
- *
- * Return:
- * owner of the column (column/commSize)
- */
-pastix_int_t z_csc_simple_distribution(pastix_int_t column, pastix_int_t columnnbr, MPI_Comm pastix_comm);
-
-/*
- * Function: cscd_symgraph
- *
- * Check if the CSCD graph is symetric.
- *
- * Parameters:
- * n - Number of local columns
- * ia - Starting index of each columns in *ja* and *a*
- * ja - Row of each element.
- * a - Values of each element.
- * newn - New number of local columns
- * newia - Starting index of each columns in *newja* and *newa*
- * newja - Row of each element.
- * newa - Values of each element.
- * l2g - global number of each local column.
- * malloc_flag - flag to indicate if function call is intern to pastix or extern.
- */
-int z_cscd_symgraph(pastix_int_t n, const pastix_int_t *ia, const pastix_int_t *ja, const pastix_complex64_t *a,
- pastix_int_t * newn, pastix_int_t ** newia, pastix_int_t ** newja, pastix_complex64_t ** newa,
- pastix_int_t * l2g, MPI_Comm comm);
-/*
- * Function: cscd_addlocal
- *
- * Add second cscd to first cscd into third cscd (unallocated)
- *
- * Parameters:
- * n - First cscd size
- * ia - First cscd starting index of each column in *ja* and *a*
- * ja - Row of each element in first CSCD
- * a - value of each cscd in first CSCD (can be NULL)
- * l2g - local 2 global column numbers for first cscd
- * addn - CSCD to add size
- * addia - CSCD to add starting index of each column in *addja* and *adda*
- * addja - Row of each element in second CSCD
- * adda - value of each cscd in second CSCD (can be NULL -> add 0)
- * addl2g - local 2 global column numbers for second cscd
- * newn - new cscd size (same as first)
- * newia - CSCD to add starting index of each column in *newja* and *newwa*
- * newja - Row of each element in third CSCD
- * newa - value of each cscd in third CSCD
- * OP - Operation to manage common CSCD coefficients.
- * dof - Number of degrees of freedom.
- */
-
-int z_cscd_addlocal(pastix_int_t n , pastix_int_t * ia , pastix_int_t * ja , pastix_complex64_t * a , pastix_int_t * l2g,
- pastix_int_t addn, pastix_int_t * addia, pastix_int_t * addja, pastix_complex64_t * adda, pastix_int_t * addl2g,
- pastix_int_t * newn, pastix_int_t ** newia, pastix_int_t ** newja, pastix_complex64_t ** newa, CSCD_OPERATIONS_t OP, int dof);
-
-/**
- * Function: csc2cscd
- *
- * Transform a csc to a cscd.
- * Allocate the CSCD.
- * If grhs == NULL forget right hand side part.
- * If gperm == NULL forget permutation and reverse permutation part.
- *
- * Parameters:
- * gN - global number of columns
- * gcolptr - global starting index of each column in grows ans gavals.
- * grows - global rows of each element.
- * gavals - global values of each element.
- * gperm - global permutation tabular.
- * ginvp - global reverse permutation tabular.
- * lN - local number of columns.
- * lcolptr - starting index of each local column.
- * lrowptr - row number of each local element.
- * lavals - values of each local element.
- * lrhs - local part of the right hand side (output).
- * lperm - local part of the permutation tabular (output).
- * linvp - local part of the reverse permutation tabular (output).
- * loc2glob - global numbers of local columns (before permutation).
- */
-void z_csc2cscd(pastix_int_t gN, pastix_int_t * gcolptr, pastix_int_t * grow, pastix_complex64_t * gavals,
- pastix_complex64_t * grhs, pastix_int_t * gperm, pastix_int_t * ginvp,
- pastix_int_t lN, pastix_int_t ** lcolptr, pastix_int_t ** lrow, pastix_complex64_t ** lavals,
- pastix_complex64_t ** lrhs, pastix_int_t ** lperm, pastix_int_t ** linvp,
- pastix_int_t *loc2glob);
-
-/**
- * Function: cscd2csc
- *
- * Transform a cscd to a csc.
- * colptr2, row2, avals2, rhs2, perm2, invp2 are allocated here.
- *
- * Parameters:
- * lN - number of local column.
- * lcolptr - starting index of each local column in row and avals.
- * lrow _ row number of each local element.
- * lavals - values of each local element.
- * lrhs - local part of the right hand side.
- * lperm - local part of the permutation tabular.
- * linvp - local part of the reverse permutation tabular.
- * gN - global number of columns (output).
- * gcolptr - starting index of each column in row2 and avals2 (output).
- * grow - row number of each element (output).
- * gavals - values of each element (output).
- * grhs - global right hand side (output).
- * gperm - global permutation tabular (output).
- * ginvp - global reverse permutation tabular (output).
- * loc2glob - global number of each local column.
- * pastix_comm - PaStiX MPI communicator.
- * ndof - Number of degree f freedom by node.
- *
- */
-
-void z_cscd2csc(pastix_int_t lN, pastix_int_t * lcolptr, pastix_int_t * lrow, pastix_complex64_t * lavals,
- pastix_complex64_t * lrhs, pastix_int_t * lperm, pastix_int_t * linvp,
- pastix_int_t *gN, pastix_int_t ** gcolptr, pastix_int_t **grow, pastix_complex64_t **gavals,
- pastix_complex64_t **grhs, pastix_int_t **gperm, pastix_int_t **ginvp,
- pastix_int_t *loc2glob, MPI_Comm pastix_comm, pastix_int_t ndof);
-
-/*
- * Function: cscd_redispatch
- *
- * Redistribute the first cscd into a new one using *dl2g*.
- *
- * - gather all new loc2globs on all processors.
- * - allocate *dia*, *dja* and *da*.
- * - Create new CSC for each processor and send it.
- * - Merge all new CSC to the new local CSC with <cscd_addlocal_int>.
- *
- * If communicator size is one, check that n = dn and
- * l2g = dl2g and simply create a copy of the first cscd.
- *
- * Parameters:
- * n - Number of local columns
- * ia - First cscd starting index of each column in *ja* and *a*
- * ja - Row of each element in first CSCD
- * a - value of each cscd in first CSCD (can be NULL)
- * rhs - right-hand-side member corresponding to the first CSCD
- * (can be NULL)
- * nrhs - number of right-hand-side.
- * l2g - local 2 global column numbers for first cscd
- * dn - Number of local columns
- * dia - New cscd starting index of each column in *ja* and *a*
- * dja - Row of each element in new CSCD
- * da - value of each cscd in new CSCD
- * rhs - right-hand-side member corresponding to the new CSCD
- * dl2g - local 2 global column numbers for new cscd
- * comm - MPI communicator
- *
- * Returns:
- * EXIT_SUCCESS - If all goes well
- * EXIT_FAILURE - If commsize = 1 and *n* != *dn* or *l2g* != *dl2g*.
- */
-int z_cscd_redispatch(pastix_int_t n, pastix_int_t * ia, pastix_int_t * ja, pastix_complex64_t * a,
- pastix_complex64_t * rhs, pastix_int_t nrhs, pastix_int_t * l2g,
- pastix_int_t dn, pastix_int_t ** dia, pastix_int_t ** dja, pastix_complex64_t ** da,
- pastix_complex64_t ** drhs, pastix_int_t * dl2g,
- MPI_Comm comm, pastix_int_t dof);
-
-/*
- * Function: cscd_save
- *
- * save a distributed csc to disk.
- * files are called $(filename) and $(filename)$(RANK)
- * if filename is NULL then filename = cscd_matrix.
- *
- * file filename contains the number of processors/files
- * on first line. Then each line contain the name of each file
- * (here $(filename)$(RANK)).
- *
- *
- *
- * Parameters:
- * n - Number of local columns
- * ia - First cscd starting index of each column in *ja* and *a*
- * ja - Row of each element in first CSCD
- * a - value of each cscd in first CSCD (can be NULL)
- * rhs - Right hand side.
- * l2g - local 2 global column numbers for first cscd
- * dof - Number of degrees of freedom
- * filename - name of the files.
- * comm - MPI communicator
- */
-int z_cscd_save(pastix_int_t n, pastix_int_t *ia, pastix_int_t *ja, pastix_complex64_t * a, pastix_complex64_t * rhs, pastix_int_t* l2g,
- int dof, const char * filename, MPI_Comm comm);
-
-/*
- * Function: cscd_load
- *
- * Loads a distributed csc from disk.
- * if filename is NULL then filename = cscd_matrix.
- *
- * Parameters:
- * n - Number of local columns
- * ia - First cscd starting index of each column in *ja* and *a*
- * ja - Row of each element in first CSCD
- * a - value of each cscd in first CSCD (can be NULL)
- * rhs - Right hand side.
- * l2g - local 2 global column numbers for first cscd
- * filename - name of the files.
- * comm - MPI communicator
- */
-int z_cscd_load(pastix_int_t *n, pastix_int_t ** ia, pastix_int_t ** ja, pastix_complex64_t ** a, pastix_complex64_t ** rhs, pastix_int_t ** l2g,
- const char * filename, MPI_Comm mpi_comm);
-
-#endif /* Z_CSCD_UTILS_H */
diff --git a/z_cscd_utils_fortran.c b/z_cscd_utils_fortran.c
deleted file mode 100644
index 9826d650..00000000
--- a/z_cscd_utils_fortran.c
+++ /dev/null
@@ -1,281 +0,0 @@
-/**
- * PaStiX CSC management routines.
- *
- * PaStiX is a software package provided by Inria Bordeaux - Sud-Ouest,
- * LaBRI, University of Bordeaux 1 and IPB.
- *
- * @version 1.0.0
- * @author Mathieu Faverge
- * @author Pierre Ramet
- * @author Xavier Lacoste
- * @date 2011-11-11
- * @precisions normal z -> c d s
- *
- **/
-/*
- File: pastix_fortran.c
-
- Interface to the PaStiX API functions.
-
- */
-#include "common.h"
-#include "z_cscd_utils.h"
-
-
-#define FORTRAN_NAME(nu,nl,pl,pc) \
- void nl pl; \
- void nu pl \
- { nl pc; } \
- void nl ## _ pl \
- { nl pc; } \
- void nl ## __ pl \
- { nl pc; }
-/*
- Struct: csc_data_
-
- Contains the new CSCD
-
-*/
-struct csc_data_ {
- pastix_int_t n;
- pastix_int_t *colptr;
- pastix_int_t *rows;
- pastix_complex64_t *values;
- pastix_complex64_t *rhs;
- pastix_int_t nrhs;
- pastix_int_t *perm;
- pastix_int_t *l2g;
- pastix_int_t dof;
-};
-
-/*
- Typedef: csc_data_t
-
- Type coresponding to the struct <csc_data_>
-*/
-typedef struct csc_data_ csc_data_t;
-
-FORTRAN_NAME(Z_CSC_DISPATCH_FORTRAN,
- z_csc_dispatch_fortran,
- (csc_data_t **csc_data,
- pastix_int_t *gN,
- pastix_int_t *gcolptr,
- pastix_int_t *grow,
- pastix_complex64_t *gavals,
- pastix_complex64_t *grhs,
- pastix_int_t *gperm,
- pastix_int_t *ginvp,
- int *dispatch,
- pastix_int_t *newn,
- pastix_int_t *newnnz,
- MPI_Fint *fortran_comm),
- (csc_data,
- gN,
- gcolptr,
- grow,
- gavals,
- grhs,
- gperm,
- ginvp,
- dispatch,
- newn,
- newnnz,
- fortran_comm))
-
-void z_csc_dispatch_fortran(csc_data_t **csc_data,
- pastix_int_t *gN,
- pastix_int_t *gcolptr,
- pastix_int_t *grow,
- pastix_complex64_t *gavals,
- pastix_complex64_t *grhs,
- pastix_int_t *gperm,
- pastix_int_t *ginvp,
- int *dispatch,
- pastix_int_t *newn,
- pastix_int_t *newnnz,
- MPI_Fint *fortran_comm)
-{
- MPI_Comm pastix_comm;
- (void)fortran_comm;
-
- pastix_comm = MPI_Comm_f2c(*fortran_comm);
- MALLOC_INTERN(*csc_data, 1, struct csc_data_);
- (*csc_data)->n = 0;
- (*csc_data)->colptr = NULL;
- (*csc_data)->rows = NULL;
- (*csc_data)->values = NULL;
- (*csc_data)->rhs = NULL;
- (*csc_data)->perm = NULL;
- (*csc_data)->l2g = NULL;
-
- z_csc_dispatch(*gN, gcolptr, grow, gavals, grhs, gperm, ginvp,
- &((*csc_data)->n), &((*csc_data)->colptr), &((*csc_data)->rows), &((*csc_data)->values),
- &((*csc_data)->rhs), &((*csc_data)->perm),
- &((*csc_data)->l2g), *dispatch, pastix_comm);
-
- *newn = (*csc_data)->n;
- *newnnz = (*csc_data)->colptr[(*csc_data)->n]-1;
-
-}
-
-
-
-FORTRAN_NAME(Z_CSC_DISPATCH_FORTRAN_END,
- z_csc_dispatch_fortran_end,
- (csc_data_t **csc_data,
- pastix_int_t *lcolptr,
- pastix_int_t *lrow,
- pastix_complex64_t *lavals,
- pastix_complex64_t *lrhs,
- pastix_int_t *lperm,
- pastix_int_t *l2g),
- (csc_data,
- lcolptr,
- lrow,
- lavals,
- lrhs,
- lperm,
- l2g))
-void z_csc_dispatch_fortran_end(csc_data_t **csc_data,
- pastix_int_t *lcolptr,
- pastix_int_t *lrow,
- pastix_complex64_t *lavals,
- pastix_complex64_t *lrhs,
- pastix_int_t *lperm,
- pastix_int_t *l2g)
-{
- pastix_int_t nnz = 0;
- if ((*csc_data)->colptr != NULL) {
- nnz = (*csc_data)->colptr[(*csc_data)->n]-1;
- memcpy(lcolptr, (*csc_data)->colptr, (1+(*csc_data)->n)*sizeof(pastix_int_t));
- free((*csc_data)->colptr);
- }
- if ((*csc_data)->rows != NULL) {
- memcpy(lrow, (*csc_data)->rows, nnz*sizeof(pastix_int_t));
- free((*csc_data)->rows);
- }
- if ((*csc_data)->values != NULL) {
- memcpy(lavals, (*csc_data)->values, nnz*sizeof(pastix_complex64_t));
- free((*csc_data)->values);
- }
- if ((*csc_data)->rhs != NULL) {
- memcpy(lrhs, (*csc_data)->rhs, (*csc_data)->n*sizeof(pastix_complex64_t));
- free((*csc_data)->rhs);
- }
- if ((*csc_data)->perm != NULL) {
- memcpy(lperm, (*csc_data)->perm, (*csc_data)->n*sizeof(pastix_int_t));
- free((*csc_data)->perm);
- }
- if ((*csc_data)->l2g != NULL) {
- memcpy(l2g, (*csc_data)->l2g, (*csc_data)->n*sizeof(pastix_int_t));
- free((*csc_data)->l2g);
- }
-}
-
-FORTRAN_NAME(Z_CSCD_REDISPATCH_FORTRAN,
- z_cscd_redispatch_fortran,
- (csc_data_t **csc_data,
- pastix_int_t *n,
- pastix_int_t *ia,
- pastix_int_t *ja,
- pastix_complex64_t *a,
- pastix_complex64_t *rhs,
- pastix_int_t *nrhs,
- pastix_int_t *l2g,
- pastix_int_t *newn,
- pastix_int_t *newl2g,
- pastix_int_t *newnnz,
- MPI_Fint *fortran_comm,
- pastix_int_t *dof,
- int *ierr),
- (csc_data,
- n,
- ia,
- ja,
- a,
- rhs,
- nrhs,
- l2g,
- newn,
- newl2g,
- newnnz,
- fortran_comm,
- dof,
- ierr))
-void z_cscd_redispatch_fortran(csc_data_t **csc_data,
- pastix_int_t *n,
- pastix_int_t *ia,
- pastix_int_t *ja,
- pastix_complex64_t *a,
- pastix_complex64_t *rhs,
- pastix_int_t *nrhs,
- pastix_int_t *l2g,
- pastix_int_t *newn,
- pastix_int_t *newl2g,
- pastix_int_t *newnnz,
- MPI_Fint *fortran_comm,
- pastix_int_t *dof,
- int *ierr)
-{
-
- MPI_Comm pastix_comm;
- (void)newnnz; (void)fortran_comm;
-
- pastix_comm = MPI_Comm_f2c(*fortran_comm);
- MALLOC_INTERN(*csc_data, 1, struct csc_data_);
- (*csc_data)->n = 0;
- (*csc_data)->colptr = NULL;
- (*csc_data)->rows = NULL;
- (*csc_data)->values = NULL;
- (*csc_data)->rhs = NULL;
- (*csc_data)->nrhs = *nrhs;
- (*csc_data)->perm = NULL;
- (*csc_data)->l2g = NULL;
- (*csc_data)->dof = *dof;
-
- *ierr = z_cscd_redispatch(*n, ia, ja, a, rhs, *nrhs, l2g,
- *newn, &((*csc_data)->colptr), &((*csc_data)->rows), &((*csc_data)->values), &((*csc_data)->rhs), newl2g,
- pastix_comm, (*csc_data)->dof);
-}
-
-FORTRAN_NAME(Z_CSCD_REDISPATCH_FORTRAN_END,
- z_cscd_redispatch_fortran_end,
- (csc_data_t **csc_data,
- pastix_int_t *dcolptr,
- pastix_int_t *drow,
- pastix_complex64_t *davals,
- pastix_complex64_t *drhs),
- (csc_data,
- dcolptr,
- drow,
- davals,
- drhs))
-
-
-void z_cscd_redispatch_fortran_end(csc_data_t **csc_data,
- pastix_int_t *dcolptr,
- pastix_int_t *drow,
- pastix_complex64_t *davals,
- pastix_complex64_t *drhs)
-{
- pastix_int_t nnz = 0;
- if ((*csc_data)->colptr != NULL) {
- nnz = (*csc_data)->colptr[(*csc_data)->n]-1;
- memcpy(dcolptr, (*csc_data)->colptr, (1+(*csc_data)->n)*sizeof(pastix_int_t));
- free((*csc_data)->colptr);
- }
- if ((*csc_data)->rows != NULL) {
- memcpy(drow, (*csc_data)->rows, nnz*sizeof(pastix_int_t));
- free((*csc_data)->rows);
- }
- if ((*csc_data)->values != NULL) {
- memcpy(davals, (*csc_data)->values,
- (*csc_data)->dof*(*csc_data)->dof*nnz*sizeof(pastix_complex64_t));
- free((*csc_data)->values);
- }
- if ((*csc_data)->rhs != NULL) {
- memcpy(drhs, (*csc_data)->rhs, (*csc_data)->nrhs*(*csc_data)->n*sizeof(pastix_complex64_t));
- free((*csc_data)->rhs);
- }
- memFree_null(*csc_data);
-}
diff --git a/z_cscd_utils_intern.h b/z_cscd_utils_intern.h
deleted file mode 100644
index 0c44bbc9..00000000
--- a/z_cscd_utils_intern.h
+++ /dev/null
@@ -1,194 +0,0 @@
-/**
- * PaStiX distributed CSC management routines.
- *
- * PaStiX is a software package provided by Inria Bordeaux - Sud-Ouest,
- * LaBRI, University of Bordeaux 1 and IPB.
- *
- * @version 1.0.0
- * @author Mathieu Faverge
- * @author Pierre Ramet
- * @author Xavier Lacoste
- * @date 2011-11-11
- * @precisions normal z -> c d s
- *
- **/
-#include "z_cscd_utils.h"
-#ifndef CSCD_UTILS_INTERN_H
-#define CSCD_UTILS_INTERN_H
-int z_cscd_addlocal_int(pastix_int_t n , const pastix_int_t * ia , const pastix_int_t * ja , const pastix_complex64_t * a , const pastix_int_t * l2g,
- pastix_int_t addn, const pastix_int_t * addia, pastix_int_t * addja, const pastix_complex64_t * adda, const pastix_int_t * addl2g,
- pastix_int_t * newn, pastix_int_t ** newia, pastix_int_t ** newja, pastix_complex64_t ** newa,
- CSCD_OPERATIONS_t OP, int dof, int malloc_flag);
-
-/*
- * Function: cscd_redispatch_int
- *
- * Redistribute the first cscd into a new one using *dl2g*.
- *
- * - gather all new loc2globs on all processors.
- * - allocate *dia*, *dja* and *da*.
- * - Create new CSC for each processor and send it.
- * - Merge all new CSC to the new local CSC with <cscd_addlocal_int>.
- *
- * If communicator size is one, check that n = dn and
- * l2g = dl2g and simply create a copy of the first cscd.
- *
- * Parameters:
- * n - Number of local columns
- * ia - First cscd starting index of each column in *ja* and *a*
- * ja - Row of each element in first CSCD
- * a - value of each cscd in first CSCD (can be NULL)
- * rhs - right-hand-side member corresponding to the first CSCD (can be NULL)
- * nrhs - number of right-hand-side.
- * l2g - local 2 global column numbers for first cscd
- * dn - Number of local columns
- * dia - New cscd starting index of each column in *ja* and *a*
- * dja - Row of each element in new CSCD
- * da - value of each cscd in new CSCD
- * rhs - right-hand-side member corresponding to the new CSCD
- * dl2g - local 2 global column numbers for new cscd
- * malloc_flag - Internal (API_YES) or external (API_NO) malloc use.
- * comm - MPI communicator
- *
- * Returns:
- * EXIT_SUCCESS - If all goes well
- * EXIT_FAILURE - If commsize = 1 and *n* != *dn* or *l2g* != *dl2g*.
- */
-int z_cscd_redispatch_int(pastix_int_t n, pastix_int_t * ia, pastix_int_t * ja, pastix_complex64_t * a, pastix_complex64_t * rhs, pastix_int_t nrhs, pastix_int_t * l2g,
- pastix_int_t dn, pastix_int_t ** dia, pastix_int_t ** dja, pastix_complex64_t ** da, pastix_complex64_t ** drhs, pastix_int_t * dl2g,
- int malloc_flag, MPI_Comm comm, pastix_int_t dof);
-
-int z_cscd_symgraph_int(pastix_int_t n, const pastix_int_t *ia, const pastix_int_t *ja, const pastix_complex64_t *a,
- pastix_int_t * newn, pastix_int_t ** newia, pastix_int_t ** newja, pastix_complex64_t ** newa,
- pastix_int_t * l2g, MPI_Comm comm, int malloc_flag);
-
-
-/*
- Function: cscd_build_g2l
-
- Construct global to local tabular containing local number of global columns
- if one column is local, and -owner if column is not local.
-
- For i in 0, gN
- g2l[i] = i local number if i is local
- g2l[i] = -p if p is the owner of the column i
-
- Parameters:
- n - Number of local columns
- colptr - Starting index of each columns in *ja*
- rows - Row of each element.
- values - Value of each element.
- l2g - global number of each local column.
- correct - Flag indicating if we can correct the symmetry.
- dof - Number of degrees of freedom.
- comm - MPI communicator
- */
-int z_cscd_build_g2l( pastix_int_t ncol,
- pastix_int_t *loc2glob,
- MPI_Comm comm,
- pastix_int_t *gN,
- pastix_int_t **g2l);
-/*
- Function: cscd_noDiag
-
- Removes diagonal elements from a CSCD.
- *ja* and *a* can be reallocated to
- ia[n]-1 elements after this call.
-
- Parameters:
- n - Number of local columns
- ia - First cscd starting index of each column in *ja* and *a*
- ja - Row of each element in first CSCD
- a - value of each cscd in first CSCD (can be NULL)
- l2g - local 2 global column numbers for first cscd
-
-*/
-int z_cscd_noDiag(pastix_int_t n, pastix_int_t *ia, pastix_int_t *ja, pastix_complex64_t * a, const pastix_int_t * l2g);
-
-
-/*
- Function: cscd_checksym
-
- Check if the CSCD graph is symetric.
-
- Parameters:
- n - Number of local columns
- ia - Starting index of each columns in *ja*
- ja - Row of each element.
- l2g - global number of each local column.
- correct - Flag indicating if we can correct the symmetry.
- alloc - indicate if allocation on CSC uses internal malloc.
- dof - Number of degrees of freedom.
- comm - MPI communicator
-*/
-int z_cscd_checksym(pastix_int_t n,
- pastix_int_t *colptr,
- pastix_int_t **rows,
- pastix_complex64_t **values,
- pastix_int_t *l2g,
- int correct,
- int alloc,
- int dof,
- MPI_Comm comm);
-
-
-/**
- * Function: cscd2csc_int
- *
- * Transform a cscd to a csc.
- * colptr2, row2, avals2, rhs2, perm2, invp2 are allocated here.
- *
- * External function, allocation are not of the internal type.
- *
- * Parameters:
- * lN - number of local column.
- * lcolptr - starting index of each local column in row and avals.
- * lrow _ row number of each local element.
- * lavals - values of each local element.
- * lrhs - local part of the right hand side.
- * lperm - local part of the permutation tabular.
- * linvp - Means nothing, to suppress.
- * gN - global number of columns (output).
- * gcolptr - starting index of each column in row2 and avals2 (output).
- * grow - row number of each element (output).
- * gavals - values of each element (output).
- * grhs - global right hand side (output).
- * gperm - global permutation tabular (output).
- * ginvp - global reverse permutation tabular (output).
- * loc2glob - global number of each local column.
- * pastix_comm - PaStiX MPI communicator.
- * ndof - Number of degree of freedom per node.
- * intern_flag - Decide if malloc will use internal or external macros.
- */
-void z_cscd2csc_int(pastix_int_t lN, pastix_int_t * lcolptr, pastix_int_t * lrow, pastix_complex64_t * lavals,
- pastix_complex64_t * lrhs, pastix_int_t * lperm, pastix_int_t * linvp,
- pastix_int_t *gN, pastix_int_t ** gcolptr, pastix_int_t **grow, pastix_complex64_t **gavals,
- pastix_complex64_t **grhs, pastix_int_t **gperm, pastix_int_t **ginvp,
- pastix_int_t *loc2glob, MPI_Comm pastix_comm, pastix_int_t ndof, int intern_flag);
-
-/*
- Function: cscd_redispatch_scotch
-
- Renumber the columns to have first columns on first proc for Scotch
-
- Parameters:
- n - Number of local columns
- ia - First cscd starting index of each column in *ja* and *a*
- ja - Row of each element in first CSCD
- a - value of each cscd in first CSCD (can be NULL)
- l2g - local 2 global column numbers for first cscd
- dn - Number of local columns
- dia - First cscd starting index of each column in *ja* and *a*
- dja - Row of each element in first CSCD
- da - value of each cscd in first CSCD (can be NULL)
- l2g - local 2 global column numbers for first cscd
- comm - MPI communicator
-
- Returns:
- EXIT_SUCCESS if already well distributed, 2 if redistributed
-
- */
-int z_cscd_redispatch_scotch(pastix_int_t n, pastix_int_t * ia, pastix_int_t * ja, pastix_complex64_t * a, pastix_int_t * l2g,
- pastix_int_t *dn, pastix_int_t ** dia, pastix_int_t ** dja, pastix_complex64_t ** da, pastix_int_t ** dl2g,
- MPI_Comm comm);
-#endif /* CSCD_UTILS_INTERN_H */
--
GitLab