Lines Matching full:rbestpath
280 pr_Path rbestpath;
2010 while ((*i) < pr->rbestpath.rlen) {
2011 with__0 = & pr->rbestpath.rele[*i];
2014 while ((li < 127) && (li < pr->rbestpath.rele[*i].rdepth)) {
2105 } else if (((*i) < (pr->rbestpath.rlen - 1)) && (d != pr->rbestpath.rele[(*i) + 1].rdepth)) {
2106 if ((*i > 0) && (with__0->rdepth-1) == pr->rbestpath.rele[*i + 1].rdepth) {
2123 while ((li < 127) && (li < pr->rbestpath.rele[*i].rdepth-1)) {
2199 for (li = 0; li<pr->rbestpath.rlen; li++) {
2200 with__0 = & pr->rbestpath.rele[li];
2907 } else if (pr->rbestpath.rlen == 0) {
2924 if ((pr->rbestpath.rlen == 0) || (pr->ractpath.rcost < pr->rbestpath.rcost)) {
2925 pr->rbestpath.rlen = pr->ractpath.rlen;
2926 pr->rbestpath.rcost = pr->ractpath.rcost;
2928 pr->rbestpath.rele[li] = pr->ractpath.rele[li];
3017 pr->rbestpath.rlen = 0;
3018 pr->rbestpath.rcost = PR_COST_INIT;
3141 pr->rbestpath.rcost = PR_COST_INIT;
3142 pr->rbestpath.rlen = 0;
3188 pr->rbestpath.rcost = PR_COST_INIT;
3189 pr->rbestpath.rlen = 0;
