int bfd_update_it(BFD *bfd, int j, int bh, int len, const int ind[],
const double val[])
{ int ret;
if (!bfd->valid)
xfault("bfd_update_it: the factorization is not valid\n");
/* try to update the factorization */
if (bfd->fhv != NULL)
{ switch (fhv_update_it(bfd->fhv, j, len, ind, val))
{ case 0:
break;
case FHV_ESING:
bfd->valid = 0;
ret = BFD_ESING;
goto done;
case FHV_ECHECK:
bfd->valid = 0;
ret = BFD_ECHECK;
goto done;
case FHV_ELIMIT:
bfd->valid = 0;
ret = BFD_ELIMIT;
goto done;
case FHV_EROOM:
bfd->valid = 0;
ret = BFD_EROOM;
goto done;
default:
xassert(bfd != bfd);
}
}
else if (bfd->lpf != NULL)
{ switch (lpf_update_it(bfd->lpf, j, bh, len, ind, val))
{ case 0:
break;
case LPF_ESING:
bfd->valid = 0;
ret = BFD_ESING;
goto done;
case LPF_ELIMIT:
bfd->valid = 0;
ret = BFD_ELIMIT;
goto done;
default:
xassert(bfd != bfd);
}
}
else
xassert(bfd != bfd);
/* the factorization has been successfully updated */
/* increase the update count */
bfd->upd_cnt++;
ret = 0;
done: /* return to the calling program */
return ret;
}
int bfd_update_it(BFD *bfd, int j, int bh, int len, const int ind[],
const double val[])
{ int ret;
xassert(bfd != NULL);
xassert(bfd->valid);
/* try to update the factorization */
#if 0 /* 27/IV-2013 */
if (bfd->fhv != NULL)
{ switch (fhv_update_it(bfd->fhv, j, len, ind, val))
{ case 0:
break;
case FHV_ESING:
bfd->valid = 0;
ret = BFD_ESING;
goto done;
case FHV_ECHECK:
bfd->valid = 0;
ret = BFD_ECHECK;
goto done;
case FHV_ELIMIT:
bfd->valid = 0;
ret = BFD_ELIMIT;
goto done;
case FHV_EROOM:
bfd->valid = 0;
ret = BFD_EROOM;
goto done;
default:
xassert(bfd != bfd);
}
}
#else
if (bfd->fi != NULL)
{ /* see fhv_ft_update for return codes */
switch (fhvint_update(bfd->fi, j, len, ind, val))
{ case 0:
break;
case 1:
bfd->valid = 0;
ret = BFD_ESING;
goto done;
case 2:
case 3:
case 5:
bfd->valid = 0;
ret = BFD_ECHECK;
goto done;
case 4:
bfd->valid = 0;
ret = BFD_ELIMIT;
goto done;
default:
xassert(bfd != bfd);
}
}
#endif
else if (bfd->lpf != NULL)
{ switch (lpf_update_it(bfd->lpf, j, bh, len, ind, val))
{ case 0:
break;
case LPF_ESING:
bfd->valid = 0;
ret = BFD_ESING;
goto done;
case LPF_ELIMIT:
bfd->valid = 0;
ret = BFD_ELIMIT;
goto done;
default:
xassert(bfd != bfd);
}
}
else
xassert(bfd != bfd);
/* the factorization has been successfully updated */
/* increase the update count */
bfd->upd_cnt++;
ret = 0;
done: /* return to the calling program */
return ret;
}
