lsd_mkb/lsd_mkb_superlu/superlu_seq/dmemory.c File Reference

Memory details. More...

#include "slu_ddefs.h"

Include dependency graph for dmemory.c:

Defines
#define	StackFull(x)   ( x + Glu->stack.used >= Glu->stack.size )
#define	NotDoubleAlign(addr)   ( (intptr_t)addr & 7 )
#define	DoubleAlign(addr)   ( ((intptr_t)addr + 7) & ~7L )
#define	TempSpace(m, w)
#define	Reduce(alpha)   ((alpha + 1) / 2)
Functions
void *	dexpand (int *prev_len,MemType type,int len_to_copy,int keep_prev,GlobalLU_t *Glu)
	Expand the existing storage to accommodate more fill-ins.
int	dLUWorkInit (int m, int n, int panel_size, int **iworkptr, double **dworkptr, GlobalLU_t *Glu)
	Allocate known working storage. Returns 0 if success, otherwise returns the number of bytes allocated so far when failure occurred.
void	copy_mem_double (int, void *, void *)
void	dStackCompress (GlobalLU_t *Glu)
	Compress the work[] array to remove fragmentation.
void	dSetupSpace (void *work, int lwork, GlobalLU_t *Glu)
	Setup the memory model to be used for factorization.
void *	duser_malloc (int, int, GlobalLU_t *)
void	duser_free (int, int, GlobalLU_t *)
void	copy_mem_int (int, void *, void *)
void	user_bcopy (char *, char *, int)
int	dQuerySpace (SuperMatrix *L, SuperMatrix *U, mem_usage_t *mem_usage)
int	ilu_dQuerySpace (SuperMatrix *L, SuperMatrix *U, mem_usage_t *mem_usage)
int	dLUMemInit (fact_t fact, void *work, int lwork, int m, int n, int annz, int panel_size, double fill_ratio, SuperMatrix *L, SuperMatrix *U, GlobalLU_t *Glu, int **iwork, double **dwork)
	Allocate storage for the data structures common to all factor routines.
void	dSetRWork (int m, int panel_size, double *dworkptr, double **dense, double **tempv)
	Set up pointers for real working arrays.
void	dLUWorkFree (int *iwork, double *dwork, GlobalLU_t *Glu)
	Free the working storage used by factor routines.
int	dLUMemXpand (int jcol, int next, MemType mem_type, int *maxlen, GlobalLU_t *Glu)
	Expand the data structures for L and U during the factorization.
void	dallocateA (int n, int nnz, double **a, int **asub, int **xa)
	Allocate storage for original matrix A.
double *	doubleMalloc (int n)
double *	doubleCalloc (int n)
int	dmemory_usage (const int nzlmax, const int nzumax, const int nzlumax, const int n)

---

Detailed Description

Memory details.

 -- SuperLU routine (version 4.0) --
 Lawrence Berkeley National Laboratory.
 June 30, 2009
 

---

Define Documentation

#define DoubleAlign

(

addr

)

( ((intptr_t)addr + 7) & ~7L )

#define NotDoubleAlign

(

addr

)

( (intptr_t)addr & 7 )

#define Reduce

(

alpha

)

((alpha + 1) / 2)

#define StackFull

(

x

)

( x + Glu->stack.used >= Glu->stack.size )

#define TempSpace	(	m,
		w		)

Value:

( (2*w + 4 + NO_MARKER) * m * sizeof(int) + \
                  (w + 1) * m * sizeof(double) )

---

Function Documentation

void copy_mem_double	(	int	howmany,
		void *	old,
		void *	new
	)

Here is the caller graph for this function:

void copy_mem_int	(	int	,
		void *	,
		void *
	)

Here is the caller graph for this function:

void dallocateA	(	int	n,
		int	nnz,
		double **	a,
		int **	asub,
		int **	xa
	)

Allocate storage for original matrix A.

Here is the call graph for this function:

Here is the caller graph for this function:

void * dexpand	(	int *	prev_len,
		MemType	type,
		int	len_to_copy,
		int	keep_prev,
		GlobalLU_t *	Glu
	)

Expand the existing storage to accommodate more fill-ins.

Here is the call graph for this function:

Here is the caller graph for this function:

int dLUMemInit	(	fact_t	fact,
		void *	work,
		int	lwork,
		int	m,
		int	n,
		int	annz,
		int	panel_size,
		double	fill_ratio,
		SuperMatrix *	L,
		SuperMatrix *	U,
		GlobalLU_t *	Glu,
		int **	iwork,
		double **	dwork
	)

Allocate storage for the data structures common to all factor routines.

Memory-related.

 For those unpredictable size, estimate as fill_ratio * nnz(A).
 Return value:
     If lwork = -1, return the estimated amount of space required, plus n;
     otherwise, return the amount of space actually allocated when
     memory allocation failure occurred.
 

Here is the call graph for this function:

Here is the caller graph for this function:

int dLUMemXpand	(	int	jcol,
		int	next,
		MemType	mem_type,
		int *	maxlen,
		GlobalLU_t *	Glu
	)

Expand the data structures for L and U during the factorization.

 Return value:   0 - successful return
               > 0 - number of bytes allocated when run out of space
 

Here is the call graph for this function:

Here is the caller graph for this function:

void dLUWorkFree	(	int *	iwork,
		double *	dwork,
		GlobalLU_t *	Glu
	)

Free the working storage used by factor routines.

Here is the caller graph for this function:

int dLUWorkInit	(	int	m,
		int	n,
		int	panel_size,
		int **	iworkptr,
		double **	dworkptr,
		GlobalLU_t *	Glu
	)

Allocate known working storage. Returns 0 if success, otherwise returns the number of bytes allocated so far when failure occurred.

Here is the call graph for this function:

Here is the caller graph for this function:

int dmemory_usage	(	const int	nzlmax,
		const int	nzumax,
		const int	nzlumax,
		const int	n
	)

Here is the call graph for this function:

Here is the caller graph for this function:

double* doubleCalloc

(

int

n

)

Here is the call graph for this function:

Here is the caller graph for this function:

double* doubleMalloc

(

int

n

)

Here is the call graph for this function:

Here is the caller graph for this function:

int dQuerySpace	(	SuperMatrix *	L,
		SuperMatrix *	U,
		mem_usage_t *	mem_usage
	)

 mem_usage consists of the following fields:


for_lu (float)
      The amount of space used in bytes for the L data structures.
total_needed (float)
      The amount of space needed in bytes to perform factorization.
 

Here is the call graph for this function:

Here is the caller graph for this function:

void dSetRWork	(	int	m,
		int	panel_size,
		double *	dworkptr,
		double **	dense,
		double **	tempv
	)

Set up pointers for real working arrays.

Here is the call graph for this function:

Here is the caller graph for this function:

void dSetupSpace	(	void *	work,
		int	lwork,
		GlobalLU_t *	Glu
	)

Setup the memory model to be used for factorization.

lwork = 0: use system malloc; lwork > 0: use user-supplied work[] space.

Here is the caller graph for this function:

void dStackCompress

(

GlobalLU_t *

Glu

)

Compress the work[] array to remove fragmentation.

Here is the call graph for this function:

void duser_free	(	int	bytes,
		int	which_end,
		GlobalLU_t *	Glu
	)

Here is the caller graph for this function:

void * duser_malloc	(	int	bytes,
		int	which_end,
		GlobalLU_t *	Glu
	)

Here is the caller graph for this function:

int ilu_dQuerySpace	(	SuperMatrix *	L,
		SuperMatrix *	U,
		mem_usage_t *	mem_usage
	)

 mem_usage consists of the following fields:


for_lu (float)
      The amount of space used in bytes for the L data structures.
total_needed (float)
      The amount of space needed in bytes to perform factorization.
 

Here is the call graph for this function:

Here is the caller graph for this function:

void user_bcopy	(	char *	,
		char *	,
		int
	)

Here is the caller graph for this function: