tree b7f1d58b2b3a7b498f71d90c451367644964ff21
parent bf4e0a4b3e16fb08382bd404b4178fff657414c3
author Bas Nieuwenhuizen <bas@basnieuwenhuizen.nl> 1607267141 +0100
committer Dylan Baker <dylan.c.baker@intel.com> 1610494060 -0800

radv/winsys: Fix inequality for sparse buffer remapping.

Found a case where we mapped a range too many.

Per the comment the constraint is:

	/* [first, last] is exactly the range of ranges that either overlap the
	 * new parent, or are adjacent to it. This corresponds to the bind ranges
	 * that may change.
	 */

So that means that after the ++last we the ranges[last] should still
be adjacent. So we need to test the post-increment value to see whether
it is adjacent.

Failure case:
  ranges:
    0: 0 - ffff
    1: 10000 - 1ffff
    2: 20000 - 2ffff
    3: 30000 - 3ffff
  new range: 10000 - 1ffff

wrong first, last: 0,3
  However range 3 clearly isn't adjacent at all.

Fixes: 715df30a4e2 "radv/amdgpu: Add winsys implementation of virtual buffers."
Reviewed-by: Samuel Pitoiset <samuel.pitoiset@gmail.com>
Part-of: <https://gitlab.freedesktop.org/mesa/mesa/-/merge_requests/7953>
(cherry picked from commit 2b12e6931ef240df44d2c0f9374d6575ad202675)