Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Are there systems, where minimal page of memory (pagesize) has a size not divisible by 2, or by 1024, 4096?
Can it be 3000 or 3500?
Will any posix program break, if pagesize will be not divisible by 1024?
You can safely assume that pagesize is a power of 2, at least until ternary computers are used. In practice, modern systems will have a pagesize that is a multiple of 1024.
As for programs breaking, few programs are concerned about pagesize so as long as the kernel is consistent all is well. If a program did calculations based on pagesize and used headers with macros that assume pagesize is a power of two (truncpage,roundpage) then it would have problems.