Pavel Machek wrote:
On Sat 2007-12-08 09:00:44, Oliver Neukum wrote:
Am Freitag, 7. Dezember 2007 19:01:12 schrieb David Brownell:
FWIW the appended patch removes that rude "order of registration"
policy, so that the suspend/resume list matches the device tree.
It's behaved OK on PCs and, in light duty, a few development boards;
I've carried it around most of this year.
As it is a tree, why not store it as such?
IIRC because we do not want recursive tree walkers in the kernel --
stack limits.
Surely it is possible to code a tree walker that is not a recursive
function?
I believe you can use a simple loop and the heap to store state that
would otherwise be stored on the stack in a recursive function.
_______________________________________________
linux-pm mailing list
linux-pm@xxxxxxxxxxxxxxxxxxxxxxxxxx
https://lists.linux-foundation.org/mailman/listinfo/linux-pm
