Lines Matching refs:clause
589 /* Architectural limit of 8 tuples/clause */
593 /* For scoreboarding -- the clause ID (this is not globally unique!)
596 * bitfield matching the hardware, except shifted by a clause (the
605 /* Can we prefetch the next clause? Usually it makes sense, except for
612 /* Corresponds to the usual bit but shifted by a clause */
615 /* Constants read by this clause. ISA limit. Must satisfy:
634 /* Unique in a clause */
641 /* Should flush-to-zero mode be enabled for this clause? */
1069 bi_clause * bi_next_clause(bi_context *ctx, bi_block *block, bi_clause *clause);
1079 void bi_print_clause(bi_clause *clause, FILE *fp);
1157 /* Returns the size of the final clause */
1267 /* Invariant: a tuple must be nonempty UNLESS it is the last tuple of a clause,
1279 bi_first_instr_in_clause(bi_clause *clause)
1281 return bi_first_instr_in_tuple(&clause->tuples[0]);
1285 bi_last_instr_in_clause(bi_clause *clause)
1287 bi_tuple tuple = clause->tuples[clause->tuple_count - 1];
1291 assert(clause->tuple_count >= 2);
1292 tuple = clause->tuples[clause->tuple_count - 2];
1301 * (end) of the clause and adding a condition for the clause boundary */
1303 #define bi_foreach_instr_in_clause(block, clause, pos) \
1304 for (bi_instr *pos = list_entry(bi_first_instr_in_clause(clause), bi_instr, link); \
1306 && (pos != bi_next_op(bi_last_instr_in_clause(clause))); \
1309 #define bi_foreach_instr_in_clause_rev(block, clause, pos) \
1310 for (bi_instr *pos = list_entry(bi_last_instr_in_clause(clause), bi_instr, link); \
1312 && pos != bi_prev_op(bi_first_instr_in_clause(clause)); \
1316 bi_before_clause(bi_clause *clause)
1318 return bi_before_instr(bi_first_instr_in_clause(clause));
1328 bi_after_clause(bi_clause *clause)
1330 return bi_after_instr(bi_last_instr_in_clause(clause));