cand
struct mem_range_desc *cand;
for (i = 0, cand = sc->mr_desc; i < sc->mr_ndesc; i++, cand++)
if ((cand->mr_base == mrd->mr_base) &&
(cand->mr_len == mrd->mr_len))
return(cand);
struct mem_range_desc *cand;
for (i = 0, cand = sc->mr_desc; i < sc->mr_ndesc; i++, cand++)
if ((cand->mr_base == mrd->mr_base) &&
(cand->mr_len == mrd->mr_len))
return(cand);
static struct cand *clist; /* merely a free storage pot for candidates */
struct cand *q;
struct cand *q;
static struct cand *clist; /* merely a free storage pot for candidates */
struct cand *q;
struct cand *q;
static struct cand *clist; /* merely a free storage pot for candidates */
struct cand *q;
struct cand *q;
TAILQ_ENTRY(vertex) cand;
TAILQ_REMOVE(&cand_list, w, cand);
TAILQ_FOREACH(c, &cand_list, cand) {
TAILQ_INSERT_BEFORE(c, v, cand);
TAILQ_INSERT_BEFORE(c, v, cand);
TAILQ_INSERT_TAIL(&cand_list, v, cand);
TAILQ_REMOVE(&cand_list, c, cand);
TAILQ_FOREACH(c, &cand_list, cand) {
TAILQ_REMOVE(&cand_list, c, cand);
TAILQ_ENTRY(vertex) cand;
TAILQ_REMOVE(&cand_list, w, cand);
TAILQ_FOREACH(c, &cand_list, cand) {
TAILQ_INSERT_BEFORE(c, v, cand);
TAILQ_INSERT_BEFORE(c, v, cand);
TAILQ_INSERT_TAIL(&cand_list, v, cand);
TAILQ_REMOVE(&cand_list, c, cand);
TAILQ_FOREACH(c, &cand_list, cand) {
TAILQ_REMOVE(&cand_list, c, cand);