linux-kernel - Red back tree and scheduler usage

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: Windows password security audit tool. GUI, reports in PDF.

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

Date:	Tue, 15 Jun 2010 15:00:40 +0200
From:	Francis Moreau <francis.moro@...il.com>
To:	Linux Kernel Mailing List <linux-kernel@...r.kernel.org>
Subject: Red back tree and scheduler usage

Hello,

I've a question regarding the usage of the red black tree done by the
scheduler. It seems that nodes with the same keys are allowed. However
I'm not sure if this is correct since rotations can break the binary
search tree property (key(left) < key(node) <= key(right)) in that
case. I'm not sure about the consequence though.

Could anybody confirm that this won't hurt ?

Thanks
-- 
Francis
--
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/