SRC/dmemory.c File Reference

Memory details. More...

#include "slu_ddefs.h"

Data Structures

struct  e_node
 Headers for 4 types of dynamatically managed memory. More...
struct  LU_stack_t

Defines

#define NO_MEMTYPE   4
#define GluIntArray(n)   (5 * (n) + 5)
#define StackFull(x)   ( x + stack.used >= stack.size )
#define NotDoubleAlign(addr)   ( (long int)addr & 7 )
#define DoubleAlign(addr)   ( ((long int)addr + 7) & ~7L )
#define TempSpace(m, w)
#define Reduce(alpha)   ((alpha + 1) / 2)

Typedefs

typedef e_node ExpHeader
 Headers for 4 types of dynamatically managed memory.

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, LU_space_t MemModel)
 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, LU_space_t *MemModel)
 Setup the memory model to be used for factorization.
void * duser_malloc (int, int)
void duser_free (int, int)
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 dLUMemInit (fact_t fact, void *work, int lwork, int m, int n, int annz, int panel_size, SuperMatrix *L, SuperMatrix *U, GlobalLU_t *Glu, int **iwork, double **dwork)
 Memory-related.
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)

Variables

static ExpHeader * expanders = 0
static LU_stack_t stack
static int no_expand

Detailed Description

 -- SuperLU routine (version 3.0) --
 Univ. of California Berkeley, Xerox Palo Alto Research Center,
 and Lawrence Berkeley National Lab.
 October 15, 2003

Define Documentation

#define DoubleAlign (  addr   )     ( ((long int)addr + 7) & ~7L )
 

#define GluIntArray (  n   )     (5 * (n) + 5)
 

#define NO_MEMTYPE   4
 

#define NotDoubleAlign (  addr   )     ( (long int)addr & 7 )
 

#define Reduce (  alpha   )     ((alpha + 1) / 2)
 

#define StackFull (  x   )     ( x + stack.used >= stack.size )
 

#define TempSpace (  m,
w   ) 
 

Value:

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

Typedef Documentation

typedef struct e_node ExpHeader
 

Function Documentation

void copy_mem_double (  int  ,
void *  ,
void * 
) 
 

void copy_mem_int (  int  ,
void *  ,
void * 
) 
 

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

void * dexpand (  int *  ,
MemType  ,
int  ,
int  ,
GlobalLU_t * 
) 
 

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

 For those unpredictable size, make a guess as FILL * 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.

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

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

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

int dLUWorkInit (  int  ,
int  ,
int  ,
int **  ,
double **  ,
LU_space_t 
) 
 

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

double* doubleCalloc (  int  n  ) 
 

double* doubleMalloc (  int  n  ) 
 

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.
  • expansions (int)
      Number of memory expansions during the LU factorization.

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

void dSetupSpace (  void *  work,
int  lwork,
LU_space_t *  MemModel
) 
 

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

void dStackCompress (  GlobalLU_t *   ) 
 

void duser_free (  int  ,
int 
) 
 

void * duser_malloc (  int  ,
int 
) 
 

void user_bcopy (  char *  ,
char *  ,
int 
) 
 

Variable Documentation

ExpHeader* expanders = 0 [static]
 

int no_expand [static]
 

LU_stack_t stack [static]
 

Generated on Fri Aug 1 22:40:40 2008 for SuperLU by  doxygen 1.4.6