linux-kernel - Re: Does the kernel page the CFS's red-black tree nodes?

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

Hash Suite for Android: free password hash cracker in your pocket

[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]

Date:	Wed, 16 Jun 2010 12:15:17 +0100
From:	Alan Cox <alan@...rguk.ukuu.org.uk>
To:	Richard Yao <shiningarcanine@...il.com>
Cc:	linux-kernel@...r.kernel.org
Subject: Re: Does the kernel page the CFS's red-black tree nodes?

The kernel doesn't page its own data structures (there a couple of
exceptional cases). That avoids the entire nightmare of trying to have
partly paged kernels, the resulting priority inversions and all the other
horrors you can get plus the big overheads from it.

Alan
--
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/