Lines Matching refs:clause
26 /* The scheduler packs multiple instructions into a clause (grouped as tuple),
27 * and the packing code takes in a clause and emits it to the wire. During
29 * within the clause so constraints can be resolved during scheduling instead
32 * manipulating clause layouts.
35 /* Is embedded constant 0 packed for free in a clause with this many tuples? */
46 /* Helper to calculate the number of quadwords in a clause. This is a function
73 bi_clause_quadwords(bi_clause *clause)
75 unsigned X = clause->tuple_count;
78 unsigned constants = clause->constant_count;
87 * are from the beginning of a clause so to jump forward we count the current
88 * clause length, but to jump backwards we do not. */
102 * clause to the end */
103 bi_foreach_clause_in_block_from(start->block, clause, start) {
104 ret += bi_clause_quadwords(clause);
107 /* We then need to jump through every clause of every following
118 /* Count every clause in the block */
119 bi_foreach_clause_in_block(blk, clause) {
120 ret += bi_clause_quadwords(clause);
124 /* We start at the beginning of the clause but have to jump
126 bi_foreach_clause_in_block_from_rev(start->block, clause, start) {
127 if (clause == start)
130 ret -= bi_clause_quadwords(clause);
133 /* And jump back every clause of preceding blocks up through
140 bi_foreach_clause_in_block(blk, clause) {
141 ret -= bi_clause_quadwords(clause);