Jerome Glisse wrote: > This change allow driver to pass sorted memory placement, > from most prefered placement to least prefered placement. > In order to avoid long function prototype a structure is > used to gather memory placement informations such as range > restriction (if you need a buffer to be in given range). > Range restriction is determined by fpfn & lpfn which are > the first page and last page number btw which allocation > can happen. If those fields are set to 0 ttm will assume > buffer can be put anywhere in the address space (thus it > avoids putting a burden on the driver to always properly > set those fields). > > This patch also factor few functions like evicting first > entry of lru list or getting a memory space. This avoid > code duplication. > Jerome, Dave
I think the API looks OK now. I'd like to do a more thorough review, basically to verify that locking and refcounting looks correct, however I don't have time to do this until this weekend earliest so if there's a time shortage due to merge windows, I'm Ok with this patch going in, and that we can submit corrections if any as bugfixes later. /Thomas ------------------------------------------------------------------------------ Return on Information: Google Enterprise Search pays you back Get the facts. http://p.sf.net/sfu/google-dev2dev -- _______________________________________________ Dri-devel mailing list Dri-devel@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/dri-devel
