lkml.org 
[lkml]   [2004]   [Nov]   [22]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
From
SubjectRe: page fault scalability patch V11 [0/7]: overview
Linus Torvalds wrote:
>
> On Sat, 20 Nov 2004, Nick Piggin wrote:
>
>>The per thread rss may wrap (maybe not 64-bit counters), but even so,
>>the summation over all threads should still end up being correct I
>>think.
>
>
> Yes. As long as the total rss fits in an int, it doesn't matter if any of
> them wrap. Addition is still associative in twos-complement arithmetic
> even in the presense of overflows.
>
> If you actually want to make it proper standard C, I guess you'd have to
> make the thing unsigned, which gives you the mod-2**n guarantees even if
> somebody were to ever make a non-twos-complement machine.

I think other stuff breaks as well, I think I saw you post some example
code using something like (a & -a) or similar within the last few
months. Fortunately neither 1's comp or BCD are likeliy to return in
hardware. Big-end vs. little-end is still an issue, though.

--
-bill davidsen (davidsen@tmr.com)
"The secret to procrastination is to put things off until the
last possible moment - but no longer" -me

-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@vger.kernel.org
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/

\
 
 \ /
  Last update: 2005-03-22 14:08    [W:0.267 / U:0.280 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site