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? */
44 /* Helper to calculate the number of quadwords in a clause. This is a function
71 bi_clause_quadwords(bi_clause *clause)  in bi_clause_quadwords()  argument
73    unsigned X = clause->tuple_count;  in bi_clause_quadwords()
76    unsigned constants = clause->constant_count;  in bi_clause_quadwords()
85  * are from the beginning of a clause so to jump forward we count the current
86  * clause length, but to jump backwards we do not. */
100        * clause to the end */  in bi_block_offset()
101       bi_foreach_clause_in_block_from(start->block, clause, start) {  in bi_block_offset()
102          ret += bi_clause_quadwords(clause);  in bi_block_offset()
105       /* We then need to jump through every clause of every following  in bi_block_offset()
116          /* Count every clause in the block */  in bi_block_offset()
117          bi_foreach_clause_in_block(blk, clause) {  in bi_block_offset()
118             ret += bi_clause_quadwords(clause);  in bi_block_offset()
122       /* We start at the beginning of the clause but have to jump  in bi_block_offset()
124       bi_foreach_clause_in_block_from_rev(start->block, clause, start) {  in bi_block_offset()
125          if (clause == start)  in bi_block_offset()
128          ret -= bi_clause_quadwords(clause);  in bi_block_offset()
131       /* And jump back every clause of preceding blocks up through  in bi_block_offset()
138          bi_foreach_clause_in_block(blk, clause) {  in bi_block_offset()
139             ret -= bi_clause_quadwords(clause);  in bi_block_offset()