Messages in this thread | | | Date | Wed, 01 Jun 2005 19:47:23 +0400 | From | Oleg Nesterov <> | Subject | Re: [patch] Real-Time Preemption, -RT-2.6.12-rc4-V0.7.47-06 |
| |
Daniel Walker wrote: > > On Wed, 1 Jun 2005, Oleg Nesterov wrote: > > > Sorry, I don't understand you. Could you please explain this to me? > > plist_for_each() was just created to walk through all the nodes in the > list, There is no guaranteed ordering via that method. From your test it > appeared to be working since you printed all the nodes you inserted.
Yes, plist_for_each() without plist_entry() works.
> There are other methods like plist_first() which will give you FIFO > ordered nodes (or should) . The reason is that plist_first() pulls off the > dp_node , which is the first node inserted at that priority. All the other > nodes are inserted behind the dp_node. That's why I used list_add() and > not list_add_tail()
So plist_for_each() works in reverse order, and the comment about fifo ordering applies only to plist_first(). Thanks for explanation.
I don't understand why you are doing it this way, though.
Oleg. - To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majordomo@vger.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html Please read the FAQ at http://www.tux.org/lkml/
| |