double GetCleanCase(char pre, enum CLEAN_WHICH which, int icase, int imul,
int mb, int nb, int kb)
{
char cwh[3] = {'M', 'N', 'K'};
char outf[ROUTLEN], fnam[ROUTLEN], *MCC, *MMFLAGS;
int ld=kb, NB[3], NB1[3], NBs[3], nb0;
int iflag, mb1, nb1, kb1, muladd, lat, mu, nu, ku;
assert(GetUserCase(pre, icase, &iflag, NB1, NB1+1, NB1+2, &muladd, &lat,
&mu, &nu, &ku, fnam, outf, &MCC, &MMFLAGS));
if (ATL_MMNoClean(iflag)) return(-1.0);
NBs[0] = mb;
NBs[1] = nb;
NBs[2] = kb;
nb0 = kb;
if (which == CleanK)
{
nb0 = nb;
if (ATL_MMVarLda(iflag)) ld = 0;
}
NB[0] = NB[1] = NB[2] = nb0;
if (NB1[which]) NB[which] = NBs[which];
else NB[which] = 0;
sprintf(outf, "res/%cup%cB%d_%d_%dx%dx%d", pre, cwh[which], icase, imul,
mb, nb, kb);
return(ummcase0(pre, mb, nb, kb, NB[0], NB[1], NB[2], ld, ld, 0, muladd, lat,
mu, nu, ku, fnam, MCC, MMFLAGS, outf));
}
MULTHEAD *BuildTable(char pre, enum CLEAN_WHICH which, int nb)
/*
* Builds table of possible cleanup codes, depending on which:
* 0 : pMB
* 1 : pNB
* 2 : pKB
*/
{
ROUTNODE *rn;
int i, n, ID, NB[3];
int iin, io1, io2, iflag, muladd, lat, mu, nu, ku;
char *MCC, *MMFLAGS;
char rout[ROUTLEN], auth[AUTHLEN];
switch(which)
{
case CleanM:
iin = 0;
io1 = 1;
io2 = 2;
break;
case CleanN:
iin = 1;
io1 = 0;
io2 = 2;
break;
case CleanK:
iin = 2;
io1 = 0;
io2 = 1;
break;
case CleanNot:
exit(-1);
}
n = NumUserCases(pre);
for (i=0; i < n; i++)
{
rn = NULL;
ID = GetUserCase(pre, -i, &iflag, NB, NB+1, NB+2, &muladd, &lat,
&mu, &nu, &ku, rout, auth, &MCC, &MMFLAGS);
if (ATL_MMNoClean(iflag)) continue;
if (NB[io1] < 0 && NB[io1] != -nb) continue;
if (NB[io2] < 0 && NB[io2] != -nb) continue;
if (NB[io1] && (nb % NB[io1])) continue;
if (NB[io2] && (nb % NB[io2])) continue;
if (NB[iin] < 0)
{
if (-NB[iin] < nb) rn = GetRoutNode(-NB[iin], rout, ID, NOTIMED);
}
else if (NB[iin] == 0) rn = GetRoutNode(1, rout, ID, NOTIMED);
else if (NB[iin] < nb) rn = GetRoutNode(NB[iin], rout, ID, NOTIMED);
if (rn) rn->fixed = IsCaseFixed(pre, ID, which);
}
return(imhead);
}