Home
last modified time | relevance | path

Searched refs:idx_b (Results 1 – 3 of 3) sorted by relevance

/external/llvm-project/llvm/test/Analysis/LoopAccessAnalysis/
Druntime-pointer-checking-insert-typesize.ll19 %idx_b = getelementptr <vscale x 4 x i32>, <vscale x 4 x i32>* %b, i64 %0
21 store <vscale x 4 x i32> %tmp, <vscale x 4 x i32>* %idx_b
/external/tensorflow/tensorflow/core/kernels/
Dsparse_conditional_accumulator.h275 const int64 idx_b = std::get<2>(entries_to_copy[i]); in AddToAccumGradFunction() local
289 const T* grad_slice_ptr = &grad_flat(idx_b, 0); in AddToAccumGradFunction()
297 sum_indices_vec->push_back(grad_idx->vec<int64>()(idx_b)); in AddToAccumGradFunction()
298 const T* grad_slice_ptr = &grad_flat(idx_b, 0); in AddToAccumGradFunction()
/external/mesa3d/src/amd/compiler/
Daco_spill.cpp121 int32_t get_dominator(int idx_a, int idx_b, Program* program, bool is_linear) in get_dominator() argument
125 return idx_b; in get_dominator()
126 if (idx_b == -1) in get_dominator()
129 while (idx_a != idx_b) { in get_dominator()
130 if (idx_a > idx_b) in get_dominator()
133 idx_b = program->blocks[idx_b].linear_idom; in get_dominator()
136 while (idx_a != idx_b) { in get_dominator()
137 if (idx_a > idx_b) in get_dominator()
140 idx_b = program->blocks[idx_b].logical_idom; in get_dominator()