int main(int argc, char **argv)
{
int i = 0;
int blen = 512;
int blocking = BLOCKING_WARN;
while (++i < argc) {
if (strcmp(argv[i], "-b") == 0){
if (++i == argc)
usage();
blen = atoi(argv[i]);
if (blen <= 0)
usage();
continue;
} else if (strcmp(argv[i], "-bw") == 0){
blocking = BLOCKING_WARN;
continue;
} else if (strcmp(argv[i], "-bp") == 0){
blocking = BLOCKING_PAD;
continue;
} else if (strcmp(argv[i], "-bs") == 0){
blocking = BLOCKING_SILENT;
continue;
}
fblock(argv[i], blen, blocking);
wl(0);
}
wl(0);
return 0;
}
TEST(BlockTest, FindEdgeRecursive)
{
// To recurse, need two entries in block map, no instructions in
// the block that have a name, a branch instruction to the second
// block and a named instruction in the second block. When
// calling findEdge with the first block, the id of the
// instruction with a name in the second block should be returned.
llvm::LLVMContext context;
llvm::BasicBlock* fbblock = llvm::BasicBlock::Create(context);
llvm::BasicBlock* sbblock = llvm::BasicBlock::Create(context);
llvm::BranchInst* finstruction = llvm::BranchInst::Create(sbblock);
llvm::BranchInst* sinstruction = llvm::BranchInst::Create(fbblock);
pBlock fblock(new Block(0));
pBlock sblock(new Block(1));
pNode fnode(new Node(0));
pNode snode(new Node(1));
fbblock->getInstList().push_back(finstruction);
sbblock->getInstList().push_back(sinstruction);
fblock->appendNode(fnode);
sblock->appendNode(snode);
fnode->setInstruction(finstruction);
snode->setInstruction(sinstruction);
snode->setNodeLabel("test_label");
std::map<llvm::BasicBlock*, pBlock> blocks;
blocks.insert(std::pair<llvm::BasicBlock*, pBlock>(fbblock, fblock));
blocks.insert(std::pair<llvm::BasicBlock*, pBlock>(sbblock, sblock));
ASSERT_EQ(1, fblock->findEdge(fbblock, blocks));
}
/*
This routine generates the block-diagonal part of the Jacobian
corresponding to the interaction rates, multiplies by -gamma, adds
the identity matrix, and calls denseGETRF to do the LU decomposition of
each diagonal block. The computation of the diagonal blocks uses
the preset block and grouping information. One block per group is
computed. The Jacobian elements are generated by difference
quotients using calls to the routine fblock.
This routine can be regarded as a prototype for the general case
of a block-diagonal preconditioner. The blocks are of size mp, and
there are ngrp=ngx*ngy blocks computed in the block-grouping scheme.
*/
static int Precond(realtype t, N_Vector c, N_Vector fc,
booleantype jok, booleantype *jcurPtr, realtype gamma,
void *user_data, N_Vector vtemp1, N_Vector vtemp2,
N_Vector vtemp3)
{
realtype ***P;
long int **pivot, ier;
int i, if0, if00, ig, igx, igy, j, jj, jx, jy;
int *jxr, *jyr, ngrp, ngx, ngy, mxmp, flag;
long int mp;
realtype uround, fac, r, r0, save, srur;
realtype *f1, *fsave, *cdata, *rewtdata;
WebData wdata;
void *cvode_mem;
N_Vector rewt;
wdata = (WebData) user_data;
cvode_mem = wdata->cvode_mem;
cdata = NV_DATA_S(c);
rewt = wdata->rewt;
flag = CVodeGetErrWeights(cvode_mem, rewt);
if(check_flag(&flag, "CVodeGetErrWeights", 1)) return(1);
rewtdata = NV_DATA_S(rewt);
uround = UNIT_ROUNDOFF;
P = wdata->P;
pivot = wdata->pivot;
jxr = wdata->jxr;
jyr = wdata->jyr;
mp = wdata->mp;
srur = wdata->srur;
ngrp = wdata->ngrp;
ngx = wdata->ngx;
ngy = wdata->ngy;
mxmp = wdata->mxmp;
fsave = wdata->fsave;
/* Make mp calls to fblock to approximate each diagonal block of Jacobian.
Here, fsave contains the base value of the rate vector and
r0 is a minimum increment factor for the difference quotient. */
f1 = NV_DATA_S(vtemp1);
fac = N_VWrmsNorm (fc, rewt);
r0 = RCONST(1000.0)*ABS(gamma)*uround*NEQ*fac;
if (r0 == ZERO) r0 = ONE;
for (igy = 0; igy < ngy; igy++) {
jy = jyr[igy];
if00 = jy*mxmp;
for (igx = 0; igx < ngx; igx++) {
jx = jxr[igx];
if0 = if00 + jx*mp;
ig = igx + igy*ngx;
/* Generate ig-th diagonal block */
for (j = 0; j < mp; j++) {
/* Generate the jth column as a difference quotient */
jj = if0 + j;
save = cdata[jj];
r = MAX(srur*ABS(save),r0/rewtdata[jj]);
cdata[jj] += r;
fac = -gamma/r;
fblock (t, cdata, jx, jy, f1, wdata);
for (i = 0; i < mp; i++) {
P[ig][j][i] = (f1[i] - fsave[if0+i])*fac;
}
cdata[jj] = save;
}
}
}
/* Add identity matrix and do LU decompositions on blocks. */
for (ig = 0; ig < ngrp; ig++) {
denseAddIdentity(P[ig], mp);
ier = denseGETRF(P[ig], mp, mp, pivot[ig]);
if (ier != 0) return(1);
}
*jcurPtr = TRUE;
return(0);
}
static int PrecondB(realtype t, N_Vector c,
N_Vector cB, N_Vector fcB, booleantype jok,
booleantype *jcurPtr, realtype gamma,
void *user_data)
{
int N, retval;
realtype ***P;
sunindextype **pivot;
int i, if0, if00, ig, igx, igy, j, jj, jx, jy;
int *jxr, *jyr, ngrp, ngx, ngy, mxmp;
sunindextype mp, denseretval;
realtype uround, fac, r, r0, save, srur;
realtype *f1, *fsave, *cdata, *rewtdata;
void *cvode_mem;
WebData wdata;
N_Vector rewt;
wdata = (WebData) user_data;
cvode_mem = CVodeGetAdjCVodeBmem(wdata->cvode_mem, wdata->indexB);
if(check_retval((void *)cvode_mem, "CVadjGetCVodeBmem", 0)) return(1);
rewt = wdata->rewt;
retval = CVodeGetErrWeights(cvode_mem, rewt);
if(check_retval(&retval, "CVodeGetErrWeights", 1)) return(1);
cdata = N_VGetArrayPointer(c);
rewtdata = N_VGetArrayPointer(rewt);
uround = UNIT_ROUNDOFF;
P = wdata->P;
pivot = wdata->pivot;
jxr = wdata->jxr;
jyr = wdata->jyr;
mp = wdata->mp;
srur = wdata->srur;
ngrp = wdata->ngrp;
ngx = wdata->ngx;
ngy = wdata->ngy;
mxmp = wdata->mxmp;
fsave = wdata->fsave;
/* Make mp calls to fblock to approximate each diagonal block of Jacobian.
Here, fsave contains the base value of the rate vector and
r0 is a minimum increment factor for the difference quotient. */
f1 = N_VGetArrayPointer(wdata->vtemp);
fac = N_VWrmsNorm (fcB, rewt);
N = NEQ;
r0 = RCONST(1000.0)*SUNRabs(gamma)*uround*N*fac;
if (r0 == ZERO) r0 = ONE;
for (igy = 0; igy < ngy; igy++) {
jy = jyr[igy];
if00 = jy*mxmp;
for (igx = 0; igx < ngx; igx++) {
jx = jxr[igx];
if0 = if00 + jx*mp;
ig = igx + igy*ngx;
/* Generate ig-th diagonal block */
for (j = 0; j < mp; j++) {
/* Generate the jth column as a difference quotient */
jj = if0 + j;
save = cdata[jj];
r = SUNMAX(srur*SUNRabs(save),r0/rewtdata[jj]);
cdata[jj] += r;
fac = gamma/r;
fblock (t, cdata, jx, jy, f1, wdata);
for (i = 0; i < mp; i++) {
P[ig][i][j] = (f1[i] - fsave[if0+i])*fac;
}
cdata[jj] = save;
}
}
}
/* Add identity matrix and do LU decompositions on blocks. */
for (ig = 0; ig < ngrp; ig++) {
denseAddIdentity(P[ig], mp);
denseretval = denseGETRF(P[ig], mp, mp, pivot[ig]);
if (denseretval != 0) return(1);
}
*jcurPtr = SUNTRUE;
return(0);
}
