Opinion of SUSE security about O(n^2) worst case in POWER string ops?

[Joseph Myers]

On Thu, 23 Jul 2015, Carlos O'Donell wrote:

> Andreas, Mel,
> 
> Is there anyone at SUSE, aside from yourselves, who would
> be a good security contact for glibc? For example this issue
> of O(n^2) behaviour in the POWER string ops needs more people
> to gather consensus. I had Red Hat security, Florian
> Weimer, give his opinion, but it would certainly help if other
> distro security teams gave their opinion.

Note that it is not clear if we do have O(n^2) worst case, or O(2048n) = 
O(n).  The claim of O(n^2) if m <= 2048 in 
<https://sourceware.org/ml/libc-alpha/2015-07/msg00752.html> seems rather 
odd to me.

-- 
Joseph S. Myers
joseph@codesourcery.com