int zm_get_vars(int m, int n, ...) {
va_list ap;
int i = 0;
ZMAT **par;
va_start(ap, n);
while ((par = va_arg(ap, ZMAT **))) { /* NULL ends the list*/
*par = zm_get(m, n);
i++;
}
va_end(ap);
return i;
}
ZMAT *zm_resize(ZMAT *A, int new_m, int new_n)
#endif
{
unsigned int i, new_max_m, new_max_n, new_size, old_m, old_n;
if (new_m < 0 || new_n < 0)
error(E_NEG,"zm_resize");
if ( ! A )
return zm_get(new_m,new_n);
if (new_m == A->m && new_n == A->n)
return A;
old_m = A->m; old_n = A->n;
if ( new_m > A->max_m )
{ /* re-allocate A->me */
if (mem_info_is_on()) {
mem_bytes(TYPE_ZMAT,A->max_m*sizeof(complex *),
new_m*sizeof(complex *));
}
A->me = RENEW(A->me,new_m,complex *);
if ( ! A->me )
error(E_MEM,"zm_resize");
}
new_max_m = max(new_m,A->max_m);
new_max_n = max(new_n,A->max_n);
#ifndef SEGMENTED
new_size = new_max_m*new_max_n;
if ( new_size > A->max_size )
{ /* re-allocate A->base */
if (mem_info_is_on()) {
mem_bytes(TYPE_ZMAT,A->max_m*A->max_n*sizeof(complex),
new_size*sizeof(complex));
}
A->base = RENEW(A->base,new_size,complex);
if ( ! A->base )
error(E_MEM,"zm_resize");
A->max_size = new_size;
}
/* now set up A->me[i] */
for ( i = 0; i < new_m; i++ )
A->me[i] = &(A->base[i*new_n]);
/* now shift data in matrix */
if ( old_n > new_n )
{
for ( i = 1; i < min(old_m,new_m); i++ )
MEM_COPY((char *)&(A->base[i*old_n]),
(char *)&(A->base[i*new_n]),
sizeof(complex)*new_n);
}
else if ( old_n < new_n )
{
for ( i = min(old_m,new_m)-1; i > 0; i-- )
{ /* copy & then zero extra space */
MEM_COPY((char *)&(A->base[i*old_n]),
(char *)&(A->base[i*new_n]),
sizeof(complex)*old_n);
__zzero__(&(A->base[i*new_n+old_n]),(new_n-old_n));
}
__zzero__(&(A->base[old_n]),(new_n-old_n));
A->max_n = new_n;
}
/* zero out the new rows.. */
for ( i = old_m; i < new_m; i++ )
__zzero__(&(A->base[i*new_n]),new_n);
#else
if ( A->max_n < new_n )
{
complex *tmp;
for ( i = 0; i < A->max_m; i++ )
{
if (mem_info_is_on()) {
mem_bytes(TYPE_ZMAT,A->max_n*sizeof(complex),
new_max_n*sizeof(complex));
}
if ( (tmp = RENEW(A->me[i],new_max_n,complex)) == NULL )
error(E_MEM,"zm_resize");
else {
A->me[i] = tmp;
}
}
for ( i = A->max_m; i < new_max_m; i++ )
{
if ( (tmp = NEW_A(new_max_n,complex)) == NULL )
error(E_MEM,"zm_resize");
else {
A->me[i] = tmp;
if (mem_info_is_on()) {
mem_bytes(TYPE_ZMAT,0,new_max_n*sizeof(complex));
}
}
}
}
else if ( A->max_m < new_m )
{
for ( i = A->max_m; i < new_m; i++ )
if ( (A->me[i] = NEW_A(new_max_n,complex)) == NULL )
error(E_MEM,"zm_resize");
else if (mem_info_is_on()) {
mem_bytes(TYPE_ZMAT,0,new_max_n*sizeof(complex));
}
}
if ( old_n < new_n )
{
for ( i = 0; i < old_m; i++ )
__zzero__(&(A->me[i][old_n]),new_n-old_n);
}
/* zero out the new rows.. */
for ( i = old_m; i < new_m; i++ )
__zzero__(A->me[i],new_n);
#endif
A->max_m = new_max_m;
A->max_n = new_max_n;
A->max_size = A->max_m*A->max_n;
A->m = new_m; A->n = new_n;
return A;
}