Quoting Michał Winiarski (2017-07-19 15:23:47)
> On Mon, Jul 17, 2017 at 09:42:34AM +0100, Chris Wilson wrote:
> Matches what I have in my tree, except for "first" hidden in pointer.
> Can we #define the bit where we're keeping the "first" status? This way we can
> immediatelly see what's going on
On Mon, Jul 17, 2017 at 09:42:34AM +0100, Chris Wilson wrote:
> In the next patch we will want to reinsert a request not at the end of
> the priority queue, but at the front. Here we split insert_request()
> into two, the first function retrieves the priority list (for reuse for
> unsubmit later)
In the next patch we will want to reinsert a request not at the end of
the priority queue, but at the front. Here we split insert_request()
into two, the first function retrieves the priority list (for reuse for
unsubmit later) and a wrapper function to insert at the end of that list
and to
