57    minmax_range(ir_constant *low = NULL, ir_constant *high = NULL)  in minmax_range()  argument
60       this->high = high;  in minmax_range()
63    /* low is the lower limit of the range, high is the higher limit. NULL on
64     * low means negative infinity (unlimited) and on high positive infinity
69    ir_constant *high;  member in __anon886a0d750111::minmax_range
248    if (!r0.high) {  in combine_range()
249       ret.high = ismin ? r1.high : r0.high;  in combine_range()
250    } else if (!r1.high) {  in combine_range()
251       ret.high = ismin ? r0.high : r1.high;  in combine_range()
253       ret.high = ismin ? smaller_constant(r0.high, r1.high) :  in combine_range()
254          larger_constant(r0.high, r1.high);  in combine_range()
275    if (!r0.high)  in range_intersection()
276       ret.high = r1.high;  in range_intersection()
277    else if (!r1.high)  in range_intersection()
278       ret.high = r0.high;  in range_intersection()
280       ret.high = smaller_constant(r0.high, r1.high);  in range_intersection()
347          if (limits[i].low && limits[1 - i].high) {  in prune_expression()
348                cr = compare_components(limits[i].low, limits[1 - i].high);  in prune_expression()
356          if (!is_redundant && limits[i].low && baserange.high) {  in prune_expression()
357             cr = compare_components(limits[i].low, baserange.high);  in prune_expression()
365          if (limits[i].high && limits[1 - i].low) {  in prune_expression()
366             cr = compare_components(limits[i].high, limits[1 - i].low);  in prune_expression()
374          if (!is_redundant && limits[i].high && baserange.low) {  in prune_expression()
375             cr = compare_components(limits[i].high, baserange.low);  in prune_expression()
425             limits[1 - i].high = NULL;  in prune_expression()