Lines Matching refs:each
40 - A int32 lhs_offset, that will be added to each entry of the lhs matrix.
41 - A int32 rhs_offset, that will be added to each entry of the rhs matrix.
46 1. Cast lhs entries from uint8 to int32 and add lhs_offset to each of them.
47 2. Cast rhs entries from uint8 to int32 and add rhs_offset to each of them.
70 1. Cast lhs entries from uint8 to int32 and add lhs_offset to each of them.
71 2. Cast rhs entries from uint8 to int32 and add rhs_offset to each of them.
73 4. Add result_offset to each entry of the result.
74 5. Multiply each entry of the result by the following fraction, and round to
97 scheme requires adding the lhs_offset and rhs_offset to each of the lhs and rhs
118 Adding lhs_offset to each entry of `lhs`, means adding `lhs_offset * P` to
121 Adding rhs_offset to each entry of `rhs`, means adding `rhs_offset * Q` to
146 1's, `P * rhs` has all its rows equal to each other, and equal to the row-vector
147 of sums of all the entries in each column of rhs.
149 Thus, we can compute the second term, `lhs_offset * P * rhs`, by summing each
151 term, we simply need to add this row-vector (multiplied by lhs_offset) to each
157 and can be similarly computed by summing each row of lhs, storing this in a
163 fourth term is simply the rank zero update adding this constant to each matrix
174 sum of each row of the lhs block and the sum of each column of the rhs block.