Commit 6beb8201 authored by Nicolai Hähnle's avatar Nicolai Hähnle Committed by Alex Deucher

drm/ttm: fix documentation of ttm_bo_reserve

Previously, the comment was inconsistent. EDEADLK is what the ww_mutex
mechanism really returns.
Signed-off-by: default avatarNicolai Hähnle <Nicolai.Haehnle@amd.com>
Signed-off-by: default avatarAlex Deucher <alexander.deucher@amd.com>
parent 4e926d2d
...@@ -826,10 +826,10 @@ static inline int __ttm_bo_reserve(struct ttm_buffer_object *bo, ...@@ -826,10 +826,10 @@ static inline int __ttm_bo_reserve(struct ttm_buffer_object *bo,
* reserved, the validation sequence is checked against the validation * reserved, the validation sequence is checked against the validation
* sequence of the process currently reserving the buffer, * sequence of the process currently reserving the buffer,
* and if the current validation sequence is greater than that of the process * and if the current validation sequence is greater than that of the process
* holding the reservation, the function returns -EAGAIN. Otherwise it sleeps * holding the reservation, the function returns -EDEADLK. Otherwise it sleeps
* waiting for the buffer to become unreserved, after which it retries * waiting for the buffer to become unreserved, after which it retries
* reserving. * reserving.
* The caller should, when receiving an -EAGAIN error * The caller should, when receiving an -EDEADLK error
* release all its buffer reservations, wait for @bo to become unreserved, and * release all its buffer reservations, wait for @bo to become unreserved, and
* then rerun the validation with the same validation sequence. This procedure * then rerun the validation with the same validation sequence. This procedure
* will always guarantee that the process with the lowest validation sequence * will always guarantee that the process with the lowest validation sequence
......
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment