Searched refs:idx_a (Results 1 – 3 of 3) sorted by relevance
274 const int64 idx_a = std::get<1>(entries_to_copy[i]); in AddToAccumGradFunction() local280 sum_indices_vec->push_back(accum_idx_vec_->at(idx_a)); in AddToAccumGradFunction()281 T* accum_slice_ptr = &accum_flat(idx_a, 0); in AddToAccumGradFunction()284 sum_counts->push_back(count_element_->at(idx_a)); in AddToAccumGradFunction()288 sum_indices_vec->push_back(accum_idx_vec_->at(idx_a)); in AddToAccumGradFunction()291 T* accum_slice_ptr = &accum_flat(idx_a, 0); in AddToAccumGradFunction()294 sum_counts->push_back(count_element_->at(idx_a) + 1); in AddToAccumGradFunction()
18 %idx_a = getelementptr <vscale x 4 x i32>, <vscale x 4 x i32>* %a, i64 %020 %tmp = load <vscale x 4 x i32>, <vscale x 4 x i32>* %idx_a
121 int32_t get_dominator(int idx_a, int idx_b, Program* program, bool is_linear) in get_dominator() argument124 if (idx_a == -1) in get_dominator()127 return idx_a; in get_dominator()129 while (idx_a != idx_b) { in get_dominator()130 if (idx_a > idx_b) in get_dominator()131 idx_a = program->blocks[idx_a].linear_idom; in get_dominator()136 while (idx_a != idx_b) { in get_dominator()137 if (idx_a > idx_b) in get_dominator()138 idx_a = program->blocks[idx_a].logical_idom; in get_dominator()143 assert(idx_a != -1); in get_dominator()[all …]