Lines Matching refs:min_q_total
572 g->tmp.min_q_total = reralloc(g, g->tmp.min_q_total, unsigned int,
663 } else if (g->tmp.min_q_total[i] != UINT_MAX) {
664 /* Only update min_q_total and min_q_node if min_q_total != UINT_MAX so
670 if (g->nodes[n].tmp.q_total < g->tmp.min_q_total[i] ||
671 (g->nodes[n].tmp.q_total == g->tmp.min_q_total[i] &&
673 g->tmp.min_q_total[i] = g->nodes[n].tmp.q_total;
702 /* Flag the min_q_total for n's block as dirty so it gets recalculated */
703 g->tmp.min_q_total[n / BITSET_WORDBITS] = UINT_MAX;
734 g->tmp.min_q_total[i] = UINT_MAX;
747 unsigned int min_q_total = UINT_MAX;
781 if (g->tmp.min_q_total[i] == UINT_MAX) {
782 /* The min_q_total and min_q_node are dirty because we added
792 if (g->nodes[n].tmp.q_total < g->tmp.min_q_total[i]) {
793 g->tmp.min_q_total[i] = g->nodes[n].tmp.q_total;
798 if (g->tmp.min_q_total[i] < min_q_total) {
800 min_q_total = g->tmp.min_q_total[i];
805 if (!progress && min_q_total != UINT_MAX) {