Home
last modified time | relevance | path

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

/external/fio/lib/
Dprio_tree.c173 unsigned long r_index, h_index, index, mask; in prio_tree_insert() local
186 get_index(cur, &r_index, &h_index); in prio_tree_insert()
188 if (r_index == radix_index && h_index == heap_index) in prio_tree_insert()
192 (h_index == heap_index && r_index > radix_index)) { in prio_tree_insert()
197 index = r_index; in prio_tree_insert()
198 r_index = radix_index; in prio_tree_insert()
248 unsigned long r_index, h_index_right, h_index_left; in prio_tree_remove() local
254 get_index(cur->left, &r_index, &h_index_left); in prio_tree_remove()
261 get_index(cur->right, &r_index, &h_index_right); in prio_tree_remove()
298 unsigned long *r_index, unsigned long *h_index) in prio_tree_left() argument
[all …]
Dprio_tree.h27 uint64_t r_index; member
32 struct prio_tree_root *root, uint64_t r_index, uint64_t h_index) in prio_tree_iter_init() argument
35 iter->r_index = r_index; in prio_tree_iter_init()
/external/llvm/test/CodeGen/R600/
Dvector-alloca.ll37 define void @vector_write(i32 addrspace(1)* %out, i32 %w_index, i32 %r_index) {
50 %2 = getelementptr [4 x i32], [4 x i32]* %0, i32 0, i32 %r_index
60 define void @bitcast_gep(i32 addrspace(1)* %out, i32 %w_index, i32 %r_index) {