| lists.openwall.net | lists / announce owl-users owl-dev john-users john-dev passwdqc-users yescrypt popa3d-users / oss-security kernel-hardening musl sabotage tlsify passwords / crypt-dev xvendor / Bugtraq Full-Disclosure linux-kernel linux-netdev linux-ext4 linux-hardening linux-cve-announce PHC | |
|
Open Source and information security mailing list archives
| ||
|
Date: Sat, 21 Jun 2008 14:24:07 +0530 From: Balbir Singh <balbir@...ux.vnet.ibm.com> To: Paul Menage <menage@...gle.com> CC: akpm@...ux-foundation.org, containers@...ts.linux-foundation.org, linux-kernel@...r.kernel.org Subject: Re: [PATCH] Priority heap infrastructure enhancements Paul Menage wrote: > On Sat, Jun 21, 2008 at 1:05 AM, Balbir Singh <balbir@...ux.vnet.ibm.com> wrote: >> I would like to be able to drop the smallest value. Since we cannot drop the >> smallest value, dropping a leaf (heap->size) should be sufficiently good enough. >> I want a max heap and losing the root of the heap does not work for me. >> > > What are you actually trying to do? Can you get round this by just > inverting your "gt" operator? i.e. provide one that actually > implements "less-than"? Paul, That would convert the entire heap to a min-heap. With my soft limit patches, that I am working on for the memory controller; I want the controller that has exceeded it's soft limit by the maximum amount to be picked off the heap, so that we can reclaim from it on memory contention. Ideally, I would also like to be able to find an existing node in the heap, but that is hard. I can work around that problem for now. -- Warm Regards, Balbir Singh Linux Technology Center IBM, ISTL -- To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majordomo@...r.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html Please read the FAQ at http://www.tux.org/lkml/
Powered by blists - more mailing lists