tree c7479cdee07218b4876f4990d76b4136a6b4ef57
parent 782f6697d20d180843565ac93726f5ec6c7ec8ce
author Mitko Haralanov <mitko.haralanov@intel.com> 1460483201 -0700
committer Doug Ledford <dledford@redhat.com> 1461875546 -0400

IB/hfi1: Correctly compute node interval

The computation of the interval of an interval RB node
was incorrect leading to data corruption due to the RB
search algorithm not properly finding the all RB nodes
in an MMU invalidation interval.

The problem stemmed from the fact that the beginning
address of the node's range was being aligned to a page
boundary. For certain buffer sizes, this would lead to
a end address calculation that was off by 1 page.

An important aspect of keeping the RB same is also
updating the node's range in the case it's being extended.

Reviewed-by: Dean Luick <dean.luick@intel.com>
Signed-off-by: Mitko Haralanov <mitko.haralanov@intel.com>
Signed-off-by: Doug Ledford <dledford@redhat.com>