Messages in this thread | | | Date | Fri, 20 Jan 2006 01:10:56 -0800 | From | Paul Jackson <> | Subject | Re: [PATCH] bitmap: Support for pages > BITS_PER_LONG. |
| |
James wrote: > Is wrong. You're looking for an unset span of order bits at a given > offset.
But your comment, James, said:
* This is used to allocate a memory region from a bitmap. The idea is * that the region has to be 1<<order sized and 1<<order aligned (this * makes the search algorithm much faster).
So, like the other Paul said: > Unless I'm missing something, I don't see how your case > would happen.
James further wrote: > i.e. (assuming BITS_PER_LONG=32) for a span > of 126 at offset 1, you check
I thought that the span had to be a power of two. Perhaps you mean 128, not 126 (order 7: 2**7 == 128).
And I thought, from your comment above, that if the span was 128, then the alignment had to be 128 as well.
-- I won't rest till it's the best ... Programmer, Linux Scalability Paul Jackson <pj@sgi.com> 1.925.600.0401 - 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/
| |