From: Felix Kuehling <Felix.Kuehling@amd.com> To: amd-gfx@lists.freedesktop.org, dri-devel@lists.freedesktop.org Cc: alex.sierra@amd.com, Philip Yang <Philip.Yang@amd.com> Subject: [PATCH 10/35] drm/amdkfd: register overlap system memory range Date: Wed, 6 Jan 2021 22:01:02 -0500 [thread overview] Message-ID: <20210107030127.20393-11-Felix.Kuehling@amd.com> (raw) In-Reply-To: <20210107030127.20393-1-Felix.Kuehling@amd.com> From: Philip Yang <Philip.Yang@amd.com> No overlap range interval [start, last] exist in svms object interval tree. If process registers new range which has overlap with old range, the old range split into 2 ranges depending on the overlap happens at head or tail part of old range. Signed-off-by: Philip Yang <Philip.Yang@amd.com> Signed-off-by: Felix Kuehling <Felix.Kuehling@amd.com> --- drivers/gpu/drm/amd/amdkfd/kfd_svm.c | 297 ++++++++++++++++++++++++++- 1 file changed, 294 insertions(+), 3 deletions(-) diff --git a/drivers/gpu/drm/amd/amdkfd/kfd_svm.c b/drivers/gpu/drm/amd/amdkfd/kfd_svm.c index 02918faa70d5..ad007261f54c 100644 --- a/drivers/gpu/drm/amd/amdkfd/kfd_svm.c +++ b/drivers/gpu/drm/amd/amdkfd/kfd_svm.c @@ -293,6 +293,278 @@ static void svm_range_debug_dump(struct svm_range_list *svms) } } +static bool +svm_range_is_same_attrs(struct svm_range *old, struct svm_range *new) +{ + return (old->prefetch_loc == new->prefetch_loc && + old->flags == new->flags && + old->granularity == new->granularity); +} + +static int +svm_range_split_pages(struct svm_range *new, struct svm_range *old, + uint64_t start, uint64_t last) +{ + unsigned long old_start; + dma_addr_t *pages_addr; + uint64_t d; + + old_start = old->it_node.start; + new->pages_addr = kvmalloc_array(new->npages, + sizeof(*new->pages_addr), + GFP_KERNEL | __GFP_ZERO); + if (!new->pages_addr) + return -ENOMEM; + + d = new->it_node.start - old_start; + memcpy(new->pages_addr, old->pages_addr + d, + new->npages * sizeof(*new->pages_addr)); + + old->npages = last - start + 1; + old->it_node.start = start; + old->it_node.last = last; + + pages_addr = kvmalloc_array(old->npages, sizeof(*pages_addr), + GFP_KERNEL); + if (!pages_addr) { + kvfree(new->pages_addr); + return -ENOMEM; + } + + d = start - old_start; + memcpy(pages_addr, old->pages_addr + d, + old->npages * sizeof(*pages_addr)); + + kvfree(old->pages_addr); + old->pages_addr = pages_addr; + + return 0; +} + +/** + * svm_range_split_adjust - split range and adjust + * + * @new: new range + * @old: the old range + * @start: the old range adjust to start address in pages + * @last: the old range adjust to last address in pages + * + * Copy system memory pages, pages_addr or vram mm_nodes in old range to new + * range from new_start up to size new->npages, the remaining old range is from + * start to last + * + * Return: + * 0 - OK, -ENOMEM - out of memory + */ +static int +svm_range_split_adjust(struct svm_range *new, struct svm_range *old, + uint64_t start, uint64_t last) +{ + int r = -EINVAL; + + pr_debug("svms 0x%p new 0x%lx old [0x%lx 0x%lx] => [0x%llx 0x%llx]\n", + new->svms, new->it_node.start, old->it_node.start, + old->it_node.last, start, last); + + if (new->it_node.start < old->it_node.start || + new->it_node.last > old->it_node.last) { + WARN_ONCE(1, "invalid new range start or last\n"); + return -EINVAL; + } + + if (old->pages_addr) + r = svm_range_split_pages(new, old, start, last); + else + WARN_ONCE(1, "split adjust invalid pages_addr and nodes\n"); + if (r) + return r; + + new->flags = old->flags; + new->preferred_loc = old->preferred_loc; + new->prefetch_loc = old->prefetch_loc; + new->actual_loc = old->actual_loc; + new->granularity = old->granularity; + bitmap_copy(new->bitmap_access, old->bitmap_access, MAX_GPU_INSTANCE); + bitmap_copy(new->bitmap_aip, old->bitmap_aip, MAX_GPU_INSTANCE); + + return 0; +} + +/** + * svm_range_split - split a range in 2 ranges + * + * @prange: the svm range to split + * @start: the remaining range start address in pages + * @last: the remaining range last address in pages + * @new: the result new range generated + * + * Two cases only: + * case 1: if start == prange->it_node.start + * prange ==> prange[start, last] + * new range [last + 1, prange->it_node.last] + * + * case 2: if last == prange->it_node.last + * prange ==> prange[start, last] + * new range [prange->it_node.start, start - 1] + * + * Context: Caller hold svms->rw_sem as write mode + * + * Return: + * 0 - OK, -ENOMEM - out of memory, -EINVAL - invalid start, last + */ +static int +svm_range_split(struct svm_range *prange, uint64_t start, uint64_t last, + struct svm_range **new) +{ + uint64_t old_start = prange->it_node.start; + uint64_t old_last = prange->it_node.last; + struct svm_range_list *svms; + int r = 0; + + pr_debug("svms 0x%p [0x%llx 0x%llx] to [0x%llx 0x%llx]\n", prange->svms, + old_start, old_last, start, last); + + if (old_start != start && old_last != last) + return -EINVAL; + if (start < old_start || last > old_last) + return -EINVAL; + + svms = prange->svms; + if (old_start == start) { + *new = svm_range_new(svms, last + 1, old_last); + if (!*new) + return -ENOMEM; + r = svm_range_split_adjust(*new, prange, start, last); + } else { + *new = svm_range_new(svms, old_start, start - 1); + if (!*new) + return -ENOMEM; + r = svm_range_split_adjust(*new, prange, start, last); + } + + return r; +} + +static int +svm_range_split_two(struct svm_range *prange, struct svm_range *new, + uint64_t start, uint64_t last, + struct list_head *insert_list, + struct list_head *update_list) +{ + struct svm_range *tail, *tail2; + int r; + + r = svm_range_split(prange, prange->it_node.start, start - 1, &tail); + if (r) + return r; + r = svm_range_split(tail, start, last, &tail2); + if (r) + return r; + list_add(&tail2->list, insert_list); + list_add(&tail->list, insert_list); + + if (!svm_range_is_same_attrs(prange, new)) + list_add(&tail->update_list, update_list); + + return 0; +} + +static int +svm_range_split_tail(struct svm_range *prange, struct svm_range *new, + uint64_t start, struct list_head *insert_list, + struct list_head *update_list) +{ + struct svm_range *tail; + int r; + + r = svm_range_split(prange, prange->it_node.start, start - 1, &tail); + if (r) + return r; + list_add(&tail->list, insert_list); + if (!svm_range_is_same_attrs(prange, new)) + list_add(&tail->update_list, update_list); + + return 0; +} + +static int +svm_range_split_head(struct svm_range *prange, struct svm_range *new, + uint64_t last, struct list_head *insert_list, + struct list_head *update_list) +{ + struct svm_range *head; + int r; + + r = svm_range_split(prange, last + 1, prange->it_node.last, &head); + if (r) + return r; + list_add(&head->list, insert_list); + if (!svm_range_is_same_attrs(prange, new)) + list_add(&head->update_list, update_list); + + return 0; +} + +static int +svm_range_split_add_front(struct svm_range *prange, struct svm_range *new, + uint64_t start, uint64_t last, + struct list_head *insert_list, + struct list_head *update_list) +{ + struct svm_range *front, *tail; + int r = 0; + + front = svm_range_new(prange->svms, start, prange->it_node.start - 1); + if (!front) + return -ENOMEM; + + list_add(&front->list, insert_list); + list_add(&front->update_list, update_list); + + if (prange->it_node.last > last) { + pr_debug("split old in 2\n"); + r = svm_range_split(prange, prange->it_node.start, last, &tail); + if (r) + return r; + list_add(&tail->list, insert_list); + } + if (!svm_range_is_same_attrs(prange, new)) + list_add(&prange->update_list, update_list); + + return 0; +} + +struct svm_range *svm_range_clone(struct svm_range *old) +{ + struct svm_range *new; + + new = svm_range_new(old->svms, old->it_node.start, old->it_node.last); + if (!new) + return NULL; + + if (old->pages_addr) { + new->pages_addr = kvmalloc_array(new->npages, + sizeof(*new->pages_addr), + GFP_KERNEL); + if (!new->pages_addr) { + kfree(new); + return NULL; + } + memcpy(new->pages_addr, old->pages_addr, + old->npages * sizeof(*old->pages_addr)); + } + + new->flags = old->flags; + new->preferred_loc = old->preferred_loc; + new->prefetch_loc = old->prefetch_loc; + new->actual_loc = old->actual_loc; + new->granularity = old->granularity; + bitmap_copy(new->bitmap_access, old->bitmap_access, MAX_GPU_INSTANCE); + bitmap_copy(new->bitmap_aip, old->bitmap_aip, MAX_GPU_INSTANCE); + + return new; +} + /** * svm_range_handle_overlap - split overlap ranges * @svms: svm range list header @@ -334,15 +606,27 @@ svm_range_handle_overlap(struct svm_range_list *svms, struct svm_range *new, node = interval_tree_iter_first(&svms->objects, start, last); while (node) { struct interval_tree_node *next; + struct svm_range *old; pr_debug("found overlap node [0x%lx 0x%lx]\n", node->start, node->last); - prange = container_of(node, struct svm_range, it_node); + old = container_of(node, struct svm_range, it_node); next = interval_tree_iter_next(node, start, last); + prange = svm_range_clone(old); + if (!prange) { + r = -ENOMEM; + goto out; + } + + list_add(&old->remove_list, remove_list); + list_add(&prange->list, insert_list); + if (node->start < start && node->last > last) { pr_debug("split in 2 ranges\n"); + r = svm_range_split_two(prange, new, start, last, + insert_list, update_list); start = last + 1; } else if (node->start < start) { @@ -352,11 +636,15 @@ svm_range_handle_overlap(struct svm_range_list *svms, struct svm_range *new, */ uint64_t old_last = node->last; + pr_debug("change old range last\n"); + r = svm_range_split_tail(prange, new, start, + insert_list, update_list); start = old_last + 1; } else if (node->start == start && node->last > last) { pr_debug("change old range start\n"); - + r = svm_range_split_head(prange, new, last, + insert_list, update_list); start = last + 1; } else if (node->start == start) { @@ -364,12 +652,15 @@ svm_range_handle_overlap(struct svm_range_list *svms, struct svm_range *new, pr_debug("found exactly same range\n"); else pr_debug("next loop to add remaining range\n"); + if (!svm_range_is_same_attrs(prange, new)) + list_add(&prange->update_list, update_list); start = node->last + 1; } else { /* node->start > start */ pr_debug("add new range at front\n"); - + r = svm_range_split_add_front(prange, new, start, last, + insert_list, update_list); start = node->last + 1; } -- 2.29.2 _______________________________________________ dri-devel mailing list dri-devel@lists.freedesktop.org https://lists.freedesktop.org/mailman/listinfo/dri-devel
WARNING: multiple messages have this Message-ID (diff)
From: Felix Kuehling <Felix.Kuehling@amd.com> To: amd-gfx@lists.freedesktop.org, dri-devel@lists.freedesktop.org Cc: alex.sierra@amd.com, Philip Yang <Philip.Yang@amd.com> Subject: [PATCH 10/35] drm/amdkfd: register overlap system memory range Date: Wed, 6 Jan 2021 22:01:02 -0500 [thread overview] Message-ID: <20210107030127.20393-11-Felix.Kuehling@amd.com> (raw) In-Reply-To: <20210107030127.20393-1-Felix.Kuehling@amd.com> From: Philip Yang <Philip.Yang@amd.com> No overlap range interval [start, last] exist in svms object interval tree. If process registers new range which has overlap with old range, the old range split into 2 ranges depending on the overlap happens at head or tail part of old range. Signed-off-by: Philip Yang <Philip.Yang@amd.com> Signed-off-by: Felix Kuehling <Felix.Kuehling@amd.com> --- drivers/gpu/drm/amd/amdkfd/kfd_svm.c | 297 ++++++++++++++++++++++++++- 1 file changed, 294 insertions(+), 3 deletions(-) diff --git a/drivers/gpu/drm/amd/amdkfd/kfd_svm.c b/drivers/gpu/drm/amd/amdkfd/kfd_svm.c index 02918faa70d5..ad007261f54c 100644 --- a/drivers/gpu/drm/amd/amdkfd/kfd_svm.c +++ b/drivers/gpu/drm/amd/amdkfd/kfd_svm.c @@ -293,6 +293,278 @@ static void svm_range_debug_dump(struct svm_range_list *svms) } } +static bool +svm_range_is_same_attrs(struct svm_range *old, struct svm_range *new) +{ + return (old->prefetch_loc == new->prefetch_loc && + old->flags == new->flags && + old->granularity == new->granularity); +} + +static int +svm_range_split_pages(struct svm_range *new, struct svm_range *old, + uint64_t start, uint64_t last) +{ + unsigned long old_start; + dma_addr_t *pages_addr; + uint64_t d; + + old_start = old->it_node.start; + new->pages_addr = kvmalloc_array(new->npages, + sizeof(*new->pages_addr), + GFP_KERNEL | __GFP_ZERO); + if (!new->pages_addr) + return -ENOMEM; + + d = new->it_node.start - old_start; + memcpy(new->pages_addr, old->pages_addr + d, + new->npages * sizeof(*new->pages_addr)); + + old->npages = last - start + 1; + old->it_node.start = start; + old->it_node.last = last; + + pages_addr = kvmalloc_array(old->npages, sizeof(*pages_addr), + GFP_KERNEL); + if (!pages_addr) { + kvfree(new->pages_addr); + return -ENOMEM; + } + + d = start - old_start; + memcpy(pages_addr, old->pages_addr + d, + old->npages * sizeof(*pages_addr)); + + kvfree(old->pages_addr); + old->pages_addr = pages_addr; + + return 0; +} + +/** + * svm_range_split_adjust - split range and adjust + * + * @new: new range + * @old: the old range + * @start: the old range adjust to start address in pages + * @last: the old range adjust to last address in pages + * + * Copy system memory pages, pages_addr or vram mm_nodes in old range to new + * range from new_start up to size new->npages, the remaining old range is from + * start to last + * + * Return: + * 0 - OK, -ENOMEM - out of memory + */ +static int +svm_range_split_adjust(struct svm_range *new, struct svm_range *old, + uint64_t start, uint64_t last) +{ + int r = -EINVAL; + + pr_debug("svms 0x%p new 0x%lx old [0x%lx 0x%lx] => [0x%llx 0x%llx]\n", + new->svms, new->it_node.start, old->it_node.start, + old->it_node.last, start, last); + + if (new->it_node.start < old->it_node.start || + new->it_node.last > old->it_node.last) { + WARN_ONCE(1, "invalid new range start or last\n"); + return -EINVAL; + } + + if (old->pages_addr) + r = svm_range_split_pages(new, old, start, last); + else + WARN_ONCE(1, "split adjust invalid pages_addr and nodes\n"); + if (r) + return r; + + new->flags = old->flags; + new->preferred_loc = old->preferred_loc; + new->prefetch_loc = old->prefetch_loc; + new->actual_loc = old->actual_loc; + new->granularity = old->granularity; + bitmap_copy(new->bitmap_access, old->bitmap_access, MAX_GPU_INSTANCE); + bitmap_copy(new->bitmap_aip, old->bitmap_aip, MAX_GPU_INSTANCE); + + return 0; +} + +/** + * svm_range_split - split a range in 2 ranges + * + * @prange: the svm range to split + * @start: the remaining range start address in pages + * @last: the remaining range last address in pages + * @new: the result new range generated + * + * Two cases only: + * case 1: if start == prange->it_node.start + * prange ==> prange[start, last] + * new range [last + 1, prange->it_node.last] + * + * case 2: if last == prange->it_node.last + * prange ==> prange[start, last] + * new range [prange->it_node.start, start - 1] + * + * Context: Caller hold svms->rw_sem as write mode + * + * Return: + * 0 - OK, -ENOMEM - out of memory, -EINVAL - invalid start, last + */ +static int +svm_range_split(struct svm_range *prange, uint64_t start, uint64_t last, + struct svm_range **new) +{ + uint64_t old_start = prange->it_node.start; + uint64_t old_last = prange->it_node.last; + struct svm_range_list *svms; + int r = 0; + + pr_debug("svms 0x%p [0x%llx 0x%llx] to [0x%llx 0x%llx]\n", prange->svms, + old_start, old_last, start, last); + + if (old_start != start && old_last != last) + return -EINVAL; + if (start < old_start || last > old_last) + return -EINVAL; + + svms = prange->svms; + if (old_start == start) { + *new = svm_range_new(svms, last + 1, old_last); + if (!*new) + return -ENOMEM; + r = svm_range_split_adjust(*new, prange, start, last); + } else { + *new = svm_range_new(svms, old_start, start - 1); + if (!*new) + return -ENOMEM; + r = svm_range_split_adjust(*new, prange, start, last); + } + + return r; +} + +static int +svm_range_split_two(struct svm_range *prange, struct svm_range *new, + uint64_t start, uint64_t last, + struct list_head *insert_list, + struct list_head *update_list) +{ + struct svm_range *tail, *tail2; + int r; + + r = svm_range_split(prange, prange->it_node.start, start - 1, &tail); + if (r) + return r; + r = svm_range_split(tail, start, last, &tail2); + if (r) + return r; + list_add(&tail2->list, insert_list); + list_add(&tail->list, insert_list); + + if (!svm_range_is_same_attrs(prange, new)) + list_add(&tail->update_list, update_list); + + return 0; +} + +static int +svm_range_split_tail(struct svm_range *prange, struct svm_range *new, + uint64_t start, struct list_head *insert_list, + struct list_head *update_list) +{ + struct svm_range *tail; + int r; + + r = svm_range_split(prange, prange->it_node.start, start - 1, &tail); + if (r) + return r; + list_add(&tail->list, insert_list); + if (!svm_range_is_same_attrs(prange, new)) + list_add(&tail->update_list, update_list); + + return 0; +} + +static int +svm_range_split_head(struct svm_range *prange, struct svm_range *new, + uint64_t last, struct list_head *insert_list, + struct list_head *update_list) +{ + struct svm_range *head; + int r; + + r = svm_range_split(prange, last + 1, prange->it_node.last, &head); + if (r) + return r; + list_add(&head->list, insert_list); + if (!svm_range_is_same_attrs(prange, new)) + list_add(&head->update_list, update_list); + + return 0; +} + +static int +svm_range_split_add_front(struct svm_range *prange, struct svm_range *new, + uint64_t start, uint64_t last, + struct list_head *insert_list, + struct list_head *update_list) +{ + struct svm_range *front, *tail; + int r = 0; + + front = svm_range_new(prange->svms, start, prange->it_node.start - 1); + if (!front) + return -ENOMEM; + + list_add(&front->list, insert_list); + list_add(&front->update_list, update_list); + + if (prange->it_node.last > last) { + pr_debug("split old in 2\n"); + r = svm_range_split(prange, prange->it_node.start, last, &tail); + if (r) + return r; + list_add(&tail->list, insert_list); + } + if (!svm_range_is_same_attrs(prange, new)) + list_add(&prange->update_list, update_list); + + return 0; +} + +struct svm_range *svm_range_clone(struct svm_range *old) +{ + struct svm_range *new; + + new = svm_range_new(old->svms, old->it_node.start, old->it_node.last); + if (!new) + return NULL; + + if (old->pages_addr) { + new->pages_addr = kvmalloc_array(new->npages, + sizeof(*new->pages_addr), + GFP_KERNEL); + if (!new->pages_addr) { + kfree(new); + return NULL; + } + memcpy(new->pages_addr, old->pages_addr, + old->npages * sizeof(*old->pages_addr)); + } + + new->flags = old->flags; + new->preferred_loc = old->preferred_loc; + new->prefetch_loc = old->prefetch_loc; + new->actual_loc = old->actual_loc; + new->granularity = old->granularity; + bitmap_copy(new->bitmap_access, old->bitmap_access, MAX_GPU_INSTANCE); + bitmap_copy(new->bitmap_aip, old->bitmap_aip, MAX_GPU_INSTANCE); + + return new; +} + /** * svm_range_handle_overlap - split overlap ranges * @svms: svm range list header @@ -334,15 +606,27 @@ svm_range_handle_overlap(struct svm_range_list *svms, struct svm_range *new, node = interval_tree_iter_first(&svms->objects, start, last); while (node) { struct interval_tree_node *next; + struct svm_range *old; pr_debug("found overlap node [0x%lx 0x%lx]\n", node->start, node->last); - prange = container_of(node, struct svm_range, it_node); + old = container_of(node, struct svm_range, it_node); next = interval_tree_iter_next(node, start, last); + prange = svm_range_clone(old); + if (!prange) { + r = -ENOMEM; + goto out; + } + + list_add(&old->remove_list, remove_list); + list_add(&prange->list, insert_list); + if (node->start < start && node->last > last) { pr_debug("split in 2 ranges\n"); + r = svm_range_split_two(prange, new, start, last, + insert_list, update_list); start = last + 1; } else if (node->start < start) { @@ -352,11 +636,15 @@ svm_range_handle_overlap(struct svm_range_list *svms, struct svm_range *new, */ uint64_t old_last = node->last; + pr_debug("change old range last\n"); + r = svm_range_split_tail(prange, new, start, + insert_list, update_list); start = old_last + 1; } else if (node->start == start && node->last > last) { pr_debug("change old range start\n"); - + r = svm_range_split_head(prange, new, last, + insert_list, update_list); start = last + 1; } else if (node->start == start) { @@ -364,12 +652,15 @@ svm_range_handle_overlap(struct svm_range_list *svms, struct svm_range *new, pr_debug("found exactly same range\n"); else pr_debug("next loop to add remaining range\n"); + if (!svm_range_is_same_attrs(prange, new)) + list_add(&prange->update_list, update_list); start = node->last + 1; } else { /* node->start > start */ pr_debug("add new range at front\n"); - + r = svm_range_split_add_front(prange, new, start, last, + insert_list, update_list); start = node->last + 1; } -- 2.29.2 _______________________________________________ amd-gfx mailing list amd-gfx@lists.freedesktop.org https://lists.freedesktop.org/mailman/listinfo/amd-gfx
next prev parent reply other threads:[~2021-01-07 3:03 UTC|newest] Thread overview: 168+ messages / expand[flat|nested] mbox.gz Atom feed top 2021-01-07 3:00 [PATCH 00/35] Add HMM-based SVM memory manager to KFD Felix Kuehling 2021-01-07 3:00 ` Felix Kuehling 2021-01-07 3:00 ` [PATCH 01/35] drm/amdkfd: select kernel DEVICE_PRIVATE option Felix Kuehling 2021-01-07 3:00 ` Felix Kuehling 2021-01-07 3:00 ` [PATCH 02/35] drm/amdgpu: replace per_device_list by array Felix Kuehling 2021-01-07 3:00 ` Felix Kuehling 2021-01-07 3:00 ` [PATCH 03/35] drm/amdkfd: helper to convert gpu id and idx Felix Kuehling 2021-01-07 3:00 ` Felix Kuehling 2021-01-07 3:00 ` [PATCH 04/35] drm/amdkfd: add svm ioctl API Felix Kuehling 2021-01-07 3:00 ` Felix Kuehling 2021-01-07 3:00 ` [PATCH 05/35] drm/amdkfd: Add SVM API support capability bits Felix Kuehling 2021-01-07 3:00 ` Felix Kuehling 2021-01-07 3:00 ` [PATCH 06/35] drm/amdkfd: register svm range Felix Kuehling 2021-01-07 3:00 ` Felix Kuehling 2021-01-07 3:00 ` [PATCH 07/35] drm/amdkfd: add svm ioctl GET_ATTR op Felix Kuehling 2021-01-07 3:00 ` Felix Kuehling 2021-01-07 3:01 ` [PATCH 08/35] drm/amdgpu: add common HMM get pages function Felix Kuehling 2021-01-07 3:01 ` Felix Kuehling 2021-01-07 10:53 ` Christian König 2021-01-07 10:53 ` Christian König 2021-01-07 3:01 ` [PATCH 09/35] drm/amdkfd: validate svm range system memory Felix Kuehling 2021-01-07 3:01 ` Felix Kuehling 2021-01-07 3:01 ` Felix Kuehling [this message] 2021-01-07 3:01 ` [PATCH 10/35] drm/amdkfd: register overlap system memory range Felix Kuehling 2021-01-07 3:01 ` [PATCH 11/35] drm/amdkfd: deregister svm range Felix Kuehling 2021-01-07 3:01 ` Felix Kuehling 2021-01-07 3:01 ` [PATCH 12/35] drm/amdgpu: export vm update mapping interface Felix Kuehling 2021-01-07 3:01 ` Felix Kuehling 2021-01-07 10:54 ` Christian König 2021-01-07 10:54 ` Christian König 2021-01-07 3:01 ` [PATCH 13/35] drm/amdkfd: map svm range to GPUs Felix Kuehling 2021-01-07 3:01 ` Felix Kuehling 2021-01-07 3:01 ` [PATCH 14/35] drm/amdkfd: svm range eviction and restore Felix Kuehling 2021-01-07 3:01 ` Felix Kuehling 2021-01-07 3:01 ` [PATCH 15/35] drm/amdkfd: add xnack enabled flag to kfd_process Felix Kuehling 2021-01-07 3:01 ` Felix Kuehling 2021-01-07 3:01 ` [PATCH 16/35] drm/amdkfd: add ioctl to configure and query xnack retries Felix Kuehling 2021-01-07 3:01 ` Felix Kuehling 2021-01-07 3:01 ` [PATCH 17/35] drm/amdkfd: register HMM device private zone Felix Kuehling 2021-01-07 3:01 ` Felix Kuehling 2021-03-01 8:32 ` Daniel Vetter 2021-03-01 8:32 ` Daniel Vetter 2021-03-01 8:46 ` Thomas Hellström (Intel) 2021-03-01 8:46 ` Thomas Hellström (Intel) 2021-03-01 8:58 ` Daniel Vetter 2021-03-01 8:58 ` Daniel Vetter 2021-03-01 9:30 ` Thomas Hellström (Intel) 2021-03-01 9:30 ` Thomas Hellström (Intel) 2021-03-04 17:58 ` Felix Kuehling 2021-03-04 17:58 ` Felix Kuehling 2021-03-11 12:24 ` Thomas Hellström (Intel) 2021-03-11 12:24 ` Thomas Hellström (Intel) 2021-01-07 3:01 ` [PATCH 18/35] drm/amdkfd: validate vram svm range from TTM Felix Kuehling 2021-01-07 3:01 ` Felix Kuehling 2021-01-07 3:01 ` [PATCH 19/35] drm/amdkfd: support xgmi same hive mapping Felix Kuehling 2021-01-07 3:01 ` Felix Kuehling 2021-01-07 3:01 ` [PATCH 20/35] drm/amdkfd: copy memory through gart table Felix Kuehling 2021-01-07 3:01 ` Felix Kuehling 2021-01-07 3:01 ` [PATCH 21/35] drm/amdkfd: HMM migrate ram to vram Felix Kuehling 2021-01-07 3:01 ` Felix Kuehling 2021-01-07 3:01 ` [PATCH 22/35] drm/amdkfd: HMM migrate vram to ram Felix Kuehling 2021-01-07 3:01 ` Felix Kuehling 2021-01-07 3:01 ` [PATCH 23/35] drm/amdkfd: invalidate tables on page retry fault Felix Kuehling 2021-01-07 3:01 ` Felix Kuehling 2021-01-07 3:01 ` [PATCH 24/35] drm/amdkfd: page table restore through svm API Felix Kuehling 2021-01-07 3:01 ` Felix Kuehling 2021-01-07 3:01 ` [PATCH 25/35] drm/amdkfd: SVM API call to restore page tables Felix Kuehling 2021-01-07 3:01 ` Felix Kuehling 2021-01-07 3:01 ` [PATCH 26/35] drm/amdkfd: add svm_bo reference for eviction fence Felix Kuehling 2021-01-07 3:01 ` Felix Kuehling 2021-01-07 3:01 ` [PATCH 27/35] drm/amdgpu: add param bit flag to create SVM BOs Felix Kuehling 2021-01-07 3:01 ` Felix Kuehling 2021-01-07 3:01 ` [PATCH 28/35] drm/amdkfd: add svm_bo eviction mechanism support Felix Kuehling 2021-01-07 3:01 ` Felix Kuehling 2021-01-07 3:01 ` [PATCH 29/35] drm/amdgpu: svm bo enable_signal call condition Felix Kuehling 2021-01-07 3:01 ` Felix Kuehling 2021-01-07 10:56 ` Christian König 2021-01-07 10:56 ` Christian König 2021-01-07 16:16 ` Felix Kuehling 2021-01-07 16:16 ` Felix Kuehling 2021-01-07 16:28 ` Christian König 2021-01-07 16:28 ` Christian König 2021-01-07 16:53 ` Felix Kuehling 2021-01-07 16:53 ` Felix Kuehling 2021-01-07 3:01 ` [PATCH 30/35] drm/amdgpu: add svm_bo eviction to enable_signal cb Felix Kuehling 2021-01-07 3:01 ` Felix Kuehling 2021-01-07 3:01 ` [PATCH 31/35] drm/amdgpu: reserve fence slot to update page table Felix Kuehling 2021-01-07 3:01 ` Felix Kuehling 2021-01-07 10:57 ` Christian König 2021-01-07 10:57 ` Christian König 2021-01-07 3:01 ` [PATCH 32/35] drm/amdgpu: enable retry fault wptr overflow Felix Kuehling 2021-01-07 3:01 ` Felix Kuehling 2021-01-07 11:01 ` Christian König 2021-01-07 11:01 ` Christian König 2021-01-07 3:01 ` [PATCH 33/35] drm/amdkfd: refine migration policy with xnack on Felix Kuehling 2021-01-07 3:01 ` Felix Kuehling 2021-01-07 3:01 ` [PATCH 34/35] drm/amdkfd: add svm range validate timestamp Felix Kuehling 2021-01-07 3:01 ` Felix Kuehling 2021-01-07 3:01 ` [PATCH 35/35] drm/amdkfd: multiple gpu migrate vram to vram Felix Kuehling 2021-01-07 3:01 ` Felix Kuehling 2021-01-07 9:23 ` [PATCH 00/35] Add HMM-based SVM memory manager to KFD Daniel Vetter 2021-01-07 9:23 ` Daniel Vetter 2021-01-07 16:25 ` Felix Kuehling 2021-01-07 16:25 ` Felix Kuehling 2021-01-08 14:40 ` Daniel Vetter 2021-01-08 14:40 ` Daniel Vetter 2021-01-08 14:45 ` Christian König 2021-01-08 14:45 ` Christian König 2021-01-08 15:58 ` Felix Kuehling 2021-01-08 15:58 ` Felix Kuehling 2021-01-08 16:06 ` Daniel Vetter 2021-01-08 16:06 ` Daniel Vetter 2021-01-08 16:36 ` Felix Kuehling 2021-01-08 16:36 ` Felix Kuehling 2021-01-08 16:53 ` Daniel Vetter 2021-01-08 16:53 ` Daniel Vetter 2021-01-08 17:56 ` Felix Kuehling 2021-01-08 17:56 ` Felix Kuehling 2021-01-11 16:29 ` Daniel Vetter 2021-01-11 16:29 ` Daniel Vetter 2021-01-14 5:34 ` Felix Kuehling 2021-01-14 5:34 ` Felix Kuehling 2021-01-14 12:19 ` Christian König 2021-01-14 12:19 ` Christian König 2021-01-13 16:56 ` Jerome Glisse 2021-01-13 16:56 ` Jerome Glisse 2021-01-13 20:31 ` Daniel Vetter 2021-01-13 20:31 ` Daniel Vetter 2021-01-14 3:27 ` Jerome Glisse 2021-01-14 3:27 ` Jerome Glisse 2021-01-14 9:26 ` Daniel Vetter 2021-01-14 9:26 ` Daniel Vetter 2021-01-14 10:39 ` Daniel Vetter 2021-01-14 10:39 ` Daniel Vetter 2021-01-14 10:49 ` Christian König 2021-01-14 10:49 ` Christian König 2021-01-14 11:52 ` Daniel Vetter 2021-01-14 11:52 ` Daniel Vetter 2021-01-14 13:37 ` HMM fence (was Re: [PATCH 00/35] Add HMM-based SVM memory manager to KFD) Christian König 2021-01-14 13:37 ` Christian König 2021-01-14 13:57 ` Daniel Vetter 2021-01-14 13:57 ` Daniel Vetter 2021-01-14 14:13 ` Christian König 2021-01-14 14:13 ` Christian König 2021-01-14 14:23 ` Daniel Vetter 2021-01-14 14:23 ` Daniel Vetter 2021-01-14 15:08 ` Christian König 2021-01-14 15:08 ` Christian König 2021-01-14 15:40 ` Daniel Vetter 2021-01-14 15:40 ` Daniel Vetter 2021-01-14 16:01 ` Christian König 2021-01-14 16:01 ` Christian König 2021-01-14 16:36 ` Daniel Vetter 2021-01-14 16:36 ` Daniel Vetter 2021-01-14 19:08 ` Christian König 2021-01-14 19:08 ` Christian König 2021-01-14 20:09 ` Daniel Vetter 2021-01-14 20:09 ` Daniel Vetter 2021-01-14 16:51 ` Jerome Glisse 2021-01-14 16:51 ` Jerome Glisse 2021-01-14 21:13 ` Felix Kuehling 2021-01-14 21:13 ` Felix Kuehling 2021-01-15 7:47 ` Christian König 2021-01-15 7:47 ` Christian König 2021-01-13 16:47 ` [PATCH 00/35] Add HMM-based SVM memory manager to KFD Jerome Glisse 2021-01-13 16:47 ` Jerome Glisse 2021-01-14 0:06 ` Felix Kuehling 2021-01-14 0:06 ` Felix Kuehling
Reply instructions: You may reply publicly to this message via plain-text email using any one of the following methods: * Save the following mbox file, import it into your mail client, and reply-to-all from there: mbox Avoid top-posting and favor interleaved quoting: https://en.wikipedia.org/wiki/Posting_style#Interleaved_style * Reply using the --to, --cc, and --in-reply-to switches of git-send-email(1): git send-email \ --in-reply-to=20210107030127.20393-11-Felix.Kuehling@amd.com \ --to=felix.kuehling@amd.com \ --cc=Philip.Yang@amd.com \ --cc=alex.sierra@amd.com \ --cc=amd-gfx@lists.freedesktop.org \ --cc=dri-devel@lists.freedesktop.org \ /path/to/YOUR_REPLY https://kernel.org/pub/software/scm/git/docs/git-send-email.html * If your mail client supports setting the In-Reply-To header via mailto: links, try the mailto: linkBe sure your reply has a Subject: header at the top and a blank line before the message body.
This is an external index of several public inboxes, see mirroring instructions on how to clone and mirror all data and code used by this external index.