Lines Matching refs:lane
1484 // These will be either a D- or a Q-register form, with a single lane
1572 for (unsigned lane = 0; lane < vd_lane_count; lane++) {
1573 unsigned index = lane + (iteration * vd_lane_count);
1595 for (unsigned lane = 0; lane < vd_lane_count; lane++) {
1596 unsigned output_index = (n * vd_lane_count) + lane;
1615 for (unsigned lane = 0; lane < std::max(vd_lane_count, vn_lane_count);
1616 lane++) {
1617 unsigned output_index = (n * vd_lane_count) + lane;
1618 unsigned input_index_n = (first_index_n + lane) % inputs_n_length;
1685 // B and S lane sizes.
1779 for (unsigned lane = 0; lane < vd_lane_count; lane++) {
1780 unsigned index = lane + (iteration * vd_lanes_per_q);
1802 for (unsigned lane = 0; lane < vd_lane_count; lane++) {
1803 unsigned expected_index = (n * vd_lane_count) + lane;
1804 unsigned results_index = (n * vd_lanes_per_q) + lane;
1813 for (unsigned lane = vd_lane_count; lane < vd_lanes_per_q; lane++) {
1814 unsigned results_index = (n * vd_lanes_per_q) + lane;
1839 for (unsigned lane = 0; lane < vn_lane_count; lane++) {
1841 (n * vd_lanes_per_q) + ((vn_lane_count - 1) - lane);
1843 (inputs_n_length - vn_lane_count + n + 1 + lane) %
1847 if ((vn_lane_count - 1) == lane) {
1848 // This is the last lane to be printed, ie. the least-significant
1849 // lane, so use the expected value; any other lane should be zero.
2040 for (unsigned lane = 0; lane < vd_lane_count; lane++) {
2041 unsigned index = lane + (iteration * vd_lane_count);
2064 for (unsigned lane = 0; lane < vd_lane_count; lane++) {
2066 (m * vd_lane_count) + lane;
2086 for (unsigned lane = 0; lane < vd_lane_count; lane++) {
2088 (m * vd_lane_count) + lane;
2090 (inputs_n_length - vd_lane_count + n + 1 + lane) %
2093 (inputs_m_length - vd_lane_count + m + 1 + lane) %
2101 static_cast<uint64_t>(inputs_d[lane]),
2308 for (unsigned lane = 0; lane < vd_lane_count; lane++) {
2309 unsigned index = lane + (iteration * vd_lane_count);
2333 for (unsigned lane = 0; lane < vd_lane_count; lane++) {
2337 lane;
2357 for (unsigned lane = 0; lane < vd_lane_count; lane++) {
2361 (index * vd_lane_count) + lane;
2363 (inputs_n_length - vd_lane_count + n + 1 + lane) %
2366 (inputs_m_length - vd_lane_count + m + 1 + lane) %
2375 static_cast<uint64_t>(inputs_d[lane]),
2440 // These will be either a D- or a Q-register form, with a single lane
2536 for (unsigned lane = 0; lane < vd_lane_count; lane++) {
2537 unsigned index = lane + (iteration * vd_lane_count);
2560 for (unsigned lane = 0; lane < vd_lane_count; lane++) {
2562 (m * vd_lane_count) + lane;
2583 for (unsigned lane = 0; lane < std::max(vd_lane_count, vn_lane_count);
2584 lane++) {
2586 (m * vd_lane_count) + lane;
2587 unsigned input_index_n = (first_index_n + lane) % inputs_n_length;
2657 // These will be either a D- or a Q-register form, with a single lane
2766 for (unsigned lane = 0; lane < vd_lane_count; lane++) {
2767 unsigned index = lane + (iteration * vd_lane_count);
2793 for (unsigned lane = 0; lane < vd_lane_count; lane++) {
2797 (imm2 * vd_lane_count) + lane;
2819 for (unsigned lane = 0; lane < vd_lane_count; lane++) {
2824 (imm2 * vd_lane_count) + lane;
2826 (inputs_n_length - vd_lane_count + n + 1 + lane) %
2837 static_cast<uint64_t>(inputs_d[lane]),