Messages in this thread | | | Date | Sun, 27 Apr 2003 10:50:54 +0200 | From | Rene Herman <> | Subject | Re: [PATCH] Alternative patching for prefetches & cleanup |
| |
Linus Torvalds wrote:
> That's not the fibonacci sequence, that's just a regular sigma(i) > (i=1..n) sequence. And if you were to generate the sequence numbers at > compile-time I might agree with you, if you also were to avoid using > inline asms.
If the sigma(i) method is to stay, please note that
sigma(1 <= i <= n | i) = n*(n+1) / 2
for all n > 0 (trivial proof by induction).
That is, no need to loop; in this case, with n = num - 1
k = ((num - 1) * num) / 2
Rene.
- 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/
| |