KonstantinSeurer
/
mesa
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

intel/tools: Fix aubinator usage of rb_tree. 

The order of comparison has changed, so we need to invert the logic of
"insert_left" when using rb_tree_insert_at().

Fixes: dae33052db (util/rb_tree: Reverse the order of comparison
                    functions).
Reviewed-by: Jason Ekstrand <jason@jlekstrand.net>
This commit is contained in:
Rafael Antognolli 2019-09-30 12:34:12 -07:00
parent 089da33c4d
commit b9994cb8d5
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
src/intel/tools/aub_mem.c
View File

@ -109,7 +109,7 @@ ensure_ggtt_entry(struct aub_mem *mem, uint64_t virt_addr)
if (!node || (cmp = cmp_ggtt_entry(node, &virt_addr))) {
struct ggtt_entry *new_entry = calloc(1, sizeof(*new_entry));
new_entry->virt_addr = virt_addr;
rb_tree_insert_at(&mem->ggtt, node, &new_entry->node, cmp > 0);
rb_tree_insert_at(&mem->ggtt, node, &new_entry->node, cmp < 0);
node = &new_entry->node;
}
@ -153,7 +153,7 @@ ensure_phys_mem(struct aub_mem *mem, uint64_t phys_addr)
mem->mem_fd, new_mem->fd_offset);
assert(new_mem->data != MAP_FAILED);
rb_tree_insert_at(&mem->mem, node, &new_mem->node, cmp > 0);
rb_tree_insert_at(&mem->mem, node, &new_mem->node, cmp < 0);
node = &new_mem->node;
}