2 page kernel stacks in older kernels

2009-12-12 Thread Joel Fernandes
There was a requirement in older kernels that the stack (which was then 2 pages and is now 1 page in newer kernels) had to be physically adjacent. Why was there such a requirement? wouldn't it have sufficed for the kernel stack to be contiguous in virtual memory? Thanks, -Joel -- To unsubscribe

Re: keyboard

2009-12-12 Thread Shahar Havivi
There is a keyboard notifier in the kernel that you can use: #include linux/notifier.h static int keyboard_notifier_call(struct notifier_block *blk, unsigned long code, void *_param) { printk(KERN_INFO code=%ld\n, code); return NOTIFY_OK; } static struct

Re: 2 page kernel stacks in older kernels

2009-12-12 Thread qieban qieban
Hi,Joel: There is an explaination about the stack pages from two pages to one page in 2.6 kernel in Robert Love's book Linux Kernel Development (2nd Edition). Before kernel 2.6,the process kernel stack and interrupt handler share the common stack. so there is two pages for process kernel

Re: 2 page kernel stacks in older kernels

2009-12-12 Thread Joel Fernandes
Thanks for your response, but I'm sorry the book does not answer the question.. What I'm talking about is, I'm was under the impression that the kernel stack was just like any other memory allocated internally in kernel space, and that it was virtual and had to go through the Paging unit to

Query regarding large slowstart threshold value in tcp_ipv4.c and parameters returned by getsockopt

2009-12-12 Thread Ashwin Rao
Hi, I opened a tcp connection and after a few bytes were sent I got the tcp_info structure using the getsockopt call. The contents of the structure returned were: 1, 0, 0, 0, 0, 7, 119, 201000, 4, 1448, 536, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1500, 5792, 1000, 750, 2147483647, 4, 1448, 3, 0, 5792, 0