ddd & multidimensional dynamic arrays

[Jason Crosswhite]

Hello,

I am trying to find a bug in some finite difference code that is very
important for my research.  I need to examine large matrices in order to
find the bug(s), hence DDD.

Unfortunately, I must deal with dynamically allocated multidimensional
arrays, i.e., something like:

array = (double **) malloc( 100 * sizeof(double *) );
 for ( i = 0; i < 100; i++ )
  array[i] = (double *) malloc( 100 * sizeof(double) );

(Actually it is a bit more complicated, as the code does 3D as well as
2D calculations, hence it would be (double ***) where the first pointer
is an array of size one and just points straight to the second pointer,
collapsing the dimensions to two.)

I've tried everything I can think of... while loops in gdb, clustered
variables, etc.  Does anybody have a solution?  I am becoming really
desperate, and could really use some help.

Thanks

-- 
-Jason Crosswhite
 Geophysical Research Assistant
 University of Oregon