On Tue, 1 Jun 2010 22:00:35 +0200 Florian Mickler <florian@xxxxxxxxxxx> wrote: > On Tue, 1 Jun 2010 07:05:19 -0700 > mark gross <640e9920@xxxxxxxxx> wrote: > > > > > Only works 1/2 the time, but I like the idea! > > It fails to get the righ answer when constraints are reduced. But, this > > idea is a good improvement i'll roll into the next pm_qos update! > > > > thanks! > > > > --mgross > > outch. shure. i had the binary block/unblock case in my mind. (where > the comparitor would be just the logical &&) And even there it wouldn't work in general. What about keeping the list sorted? (Or using the rbtree implementation). Well, I'm getting some sleep and tomorrow I will think about it some more. > cheers, > Flo > _______________________________________________ linux-pm mailing list linux-pm@xxxxxxxxxxxxxxxxxxxxxxxxxx https://lists.linux-foundation.org/mailman/listinfo/linux-pm
