Lines Matching refs:tuple
511 * registers via slots which are assigned per tuple.
559 * Also implicitly constant_count <= tuple_count since a tuple only
828 #define bi_foreach_instr_in_tuple(tuple, v) \
829 for (bi_instr *v = (tuple)->fma ?: (tuple)->add; \
831 v = (v == (tuple)->add) ? NULL : (tuple)->add)
858 #define bi_foreach_instr_and_src_in_tuple(tuple, ins, s) \
859 bi_foreach_instr_in_tuple(tuple, ins) \
899 void bi_print_tuple(bi_tuple *tuple, FILE *fp);
1060 /* Invariant: a tuple must be nonempty UNLESS it is the last tuple of a clause,
1061 * in which case there must exist a nonempty penultimate tuple */
1064 bi_first_instr_in_tuple(bi_tuple *tuple)
1066 bi_instr *instr = tuple->fma ?: tuple->add;
1080 bi_tuple tuple = clause->tuples[clause->tuple_count - 1];
1081 bi_instr *instr = tuple.add ?: tuple.fma;
1085 tuple = clause->tuples[clause->tuple_count - 2];
1086 instr = tuple.add ?: tuple.fma;
1115 bi_before_tuple(bi_tuple *tuple)
1117 return bi_before_instr(bi_first_instr_in_tuple(tuple));