Lines Matching defs:clause
529 /* Architectural limit of 8 tuples/clause */
533 /* For scoreboarding -- the clause ID (this is not globally unique!)
536 * bitfield matching the hardware, except shifted by a clause (the
545 /* Can we prefetch the next clause? Usually it makes sense, except for
552 /* Corresponds to the usual bit but shifted by a clause */
555 /* Constants read by this clause. ISA limit. Must satisfy:
574 /* Unique in a clause */
893 bi_clause * bi_next_clause(bi_context *ctx, bi_block *block, bi_clause *clause);
900 void bi_print_clause(bi_clause *clause, FILE *fp);
969 /* Returns the size of the final clause */
1060 /* Invariant: a tuple must be nonempty UNLESS it is the last tuple of a clause,
1072 bi_first_instr_in_clause(bi_clause *clause)
1074 return bi_first_instr_in_tuple(&clause->tuples[0]);
1078 bi_last_instr_in_clause(bi_clause *clause)
1080 bi_tuple tuple = clause->tuples[clause->tuple_count - 1];
1084 assert(clause->tuple_count >= 2);
1085 tuple = clause->tuples[clause->tuple_count - 2];
1094 * (end) of the clause and adding a condition for the clause boundary */
1096 #define bi_foreach_instr_in_clause(block, clause, pos) \
1097 for (bi_instr *pos = LIST_ENTRY(bi_instr, bi_first_instr_in_clause(clause), link); \
1099 && (pos != bi_next_op(bi_last_instr_in_clause(clause))); \
1102 #define bi_foreach_instr_in_clause_rev(block, clause, pos) \
1103 for (bi_instr *pos = LIST_ENTRY(bi_instr, bi_last_instr_in_clause(clause), link); \
1105 && pos != bi_prev_op(bi_first_instr_in_clause(clause)); \
1109 bi_before_clause(bi_clause *clause)
1111 return bi_before_instr(bi_first_instr_in_clause(clause));
1121 bi_after_clause(bi_clause *clause)
1123 return bi_after_instr(bi_last_instr_in_clause(clause));