Lines Matching refs:tuple_count
130 unsigned tuple_count; member
777 return (bi_nconstants(clause) < 13 - (clause->tuple_count + 1)); in bi_space_for_more_constants()
1131 can_spill_to_moves &= (bi_nconstants(clause) < 13 - (clause->tuple_count + 2)); in bi_instr_schedulable()
1132 can_spill_to_moves &= (clause->tuple_count < 7); in bi_instr_schedulable()
1470 bi_merge_pairs(struct bi_const_state *consts, unsigned tuple_count, in bi_merge_pairs() argument
1475 for (unsigned t = 0; t < tuple_count; ++t) { in bi_merge_pairs()
1506 bi_merge_singles(struct bi_const_state *consts, unsigned tuple_count, in bi_merge_singles() argument
1512 for (unsigned t = 0; t < tuple_count; ++t) { in bi_merge_singles()
1597 unsigned tuple_count, unsigned constant_count) in bi_apply_constant_modifiers() argument
1599 unsigned start = bi_ec0_packed(tuple_count) ? 1 : 0; in bi_apply_constant_modifiers()
1605 if (*pcrel_idx == 0 && (tuple_count == 5 || tuple_count == 8)) { in bi_apply_constant_modifiers()
1691 .last = (clause->tuple_count == 0), in bi_schedule_clause()
1701 unsigned idx = max_tuples - clause->tuple_count - 1; in bi_schedule_clause()
1794 clause->tuple_count++; in bi_schedule_clause()
1810 clause_state.tuple_count++; in bi_schedule_clause()
1811 } while(clause->tuple_count < 8); in bi_schedule_clause()
1814 if (!clause->tuple_count) in bi_schedule_clause()
1818 for (unsigned i = max_tuples - clause->tuple_count; i < max_tuples; ++i) { in bi_schedule_clause()
1841 constant_pairs, &pcrel_idx, clause->tuple_count, in bi_schedule_clause()
1846 for (unsigned i = max_tuples - clause->tuple_count; i < max_tuples; ++i) { in bi_schedule_clause()
1881 clause->tuples + (max_tuples - clause->tuple_count), in bi_schedule_clause()
1882 clause->tuple_count * sizeof(clause->tuples[0])); in bi_schedule_clause()
1888 for (unsigned t = 1; t < clause->tuple_count; ++t) in bi_schedule_clause()
1933 for (unsigned i = 0; i < clause->tuple_count; ++i) { in bi_schedule_block()
2069 .tuple_count = 1, in bi_add_nop_for_atest()