| 791 |
|
#define bmop(r,c, op) (bmbyte(r,c) op bmbit(r,c)) |
| 792 |
|
#define bmtest(r,c) bmop(r,c,&) |
| 793 |
|
#define bmset(r,c) bmop(r,c,|=) |
| 794 |
< |
/* create completion bitmap */ |
| 794 |
> |
/* loop completion bitmap */ |
| 795 |
|
bmap = (uby8 *)calloc(((size_t)rm->nrows*rm->ncols+7)>>3, 1); |
| 796 |
|
if (!bmap) |
| 797 |
|
return(0); |
| 798 |
|
dold = *rm; |
| 799 |
|
rm->ncols = dold.nrows; rm->nrows = dold.ncols; |
| 800 |
< |
for (i = rm->nrows; i--; ) |
| 800 |
> |
for (i = rm->nrows; i--; ) /* try every starting point */ |
| 801 |
|
for (j = rm->ncols; j--; ) { |
| 802 |
|
int i0, j0; |
| 803 |
|
int i1 = i; |
| 804 |
|
size_t j1 = j; |
| 805 |
|
if (bmtest(i, j)) |
| 806 |
< |
continue; |
| 806 |
> |
continue; /* traversed loop earlier */ |
| 807 |
|
memcpy(val, rmx_val(rm,i,j), |
| 808 |
|
sizeof(rmx_dtype)*rm->ncomp); |
| 809 |
< |
bmset(i, j); |
| 810 |
< |
for ( ; ; ) { /* value transpose loop */ |
| 809 |
> |
for ( ; ; ) { /* new transpose loop */ |
| 810 |
|
const rmx_dtype *ds; |
| 811 |
|
i0 = i1; j0 = j1; |
| 812 |
|
ds = rmx_val(&dold, j0, i0); |
| 813 |
|
j1 = (ds - dold.mtx)/dold.ncomp; |
| 814 |
|
i1 = j1 / rm->ncols; |
| 815 |
|
j1 -= (size_t)i1*rm->ncols; |
| 816 |
+ |
bmset(i1, j1); /* mark as done */ |
| 817 |
|
if ((i1 == i) & (j1 == j)) |
| 818 |
< |
break; /* back to start */ |
| 818 |
> |
break; /* back at start */ |
| 819 |
|
memcpy(rmx_lval(rm,i0,j0), ds, |
| 820 |
|
sizeof(rmx_dtype)*rm->ncomp); |
| 821 |
– |
bmset(i1, j1); |
| 821 |
|
} /* complete the loop */ |
| 822 |
|
memcpy(rmx_lval(rm,i0,j0), val, |
| 823 |
|
sizeof(rmx_dtype)*rm->ncomp); |
