Re: [PATCH] Priority Lists for the RT mutex

[Daniel Walker]

On Sat, 7 May 2005, Oleg Nesterov wrote:
> Yes. ->node_list contains *ALL* nodes, that is why we can:
> 
> 	#define	plist_for_each(pos, head)	\
> 		 list_for_each_entry(pos, &(head)->node_list, node_list)
> 
> head <=======>  prio=1 <===> prio=2 <===> ...
>                  /\        /|  /\
>                  |         |   |
>                  \/        |   \/
>                 prio=1     | prio=2
>                  /\       /    /\
>                  |       /     |
>                  \/     /      \/
>                 prio=1 /      ....
>                   <---/
> 
>                                /\
> Where <===> means ->prio_list, |  ->node_list.
>                                \/
> Will do. However, I'm unfamiliar with Ingo's tree, so I
> can send only new plist's implementation.


I've got something like this queued up .. Feel free to send yours as well 
.. 


Daniel

-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@xxxxxxxxxxxxxxx
More majordomo info at  http://vger.kernel.org/majordomo-info.html
Please read the FAQ at  http://www.tux.org/lkml/