時間:
2010-01-19 02:58來源:
www.ibm.com/developerworks
作者:
秩名
Linux 2.6.25中的select系統調用主要有4個函數,
層層分工明確:
sys_select:處理時間參數,調用core_sys_select。
core_sys_select:處理三個fd_set參數,調用do_select。
do_select:做select/poll的工作。在合適的時機把自己掛起等待,調用sock_poll。
sock_poll:用函數指標指派到具體的協議層函數tcp_poll、udp_poll、datagram_poll。
/*<br />sys_select(fs/select.c)<br />處理了逾時值(如果有),將struct timeval轉換成了刻度數,調用core_sys_select,然後檢查剩餘時間,處理時間<br />*/<br />asmlinkage long sys_select(int n, fd_set __user *inp, fd_set __user *outp,<br /> fd_set __user *exp, struct timeval __user *tvp)<br />{<br /> s64 timeout = -1;<br /> struct timeval tv;<br /> int ret; </p><p> if (tvp) {/*如果有逾時值*/<br /> if (copy_from_user(&tv, tvp, sizeof(tv)))<br /> return -EFAULT; </p><p> if (tv.tv_sec < 0 || tv.tv_usec < 0)/*時間無效*/<br /> return -EINVAL; </p><p> /* Cast to u64 to make GCC stop complaining */<br /> if ((u64)tv.tv_sec >= (u64)MAX_INT64_SECONDS)<br /> timeout = -1; /* 無限等待*/<br /> else {<br /> timeout = DIV_ROUND_UP(tv.tv_usec, USEC_PER_SEC/HZ);<br /> timeout += tv.tv_sec * HZ;/*計算出逾時的相對時間,單位為刻度數*/<br /> }<br /> } </p><p> /*主要工作都在core_sys_select中做了*/<br /> ret = core_sys_select(n, inp, outp, exp, &timeout); </p><p> if (tvp) {/*如果有逾時值*/<br /> struct timeval rtv; </p><p> if (current->personality & STICKY_TIMEOUTS)/*類比bug的一個機制,不詳細描述*/<br /> goto sticky;<br /> /*rtv中是剩餘的時間*/<br /> rtv.tv_usec = jiffies_to_usecs(do_div((*(u64*)&timeout), HZ));<br /> rtv.tv_sec = timeout;<br /> if (timeval_compare(&rtv, &tv) >= 0)/*如果core_sys_select逾時返回,更新時間*/<br /> rtv = tv;<br /> /*拷貝更新後的時間到使用者空間*/<br /> if (copy_to_user(tvp, &rtv, sizeof(rtv))) {<br />sticky:<br /> /*<br /> * If an application puts its timeval in read-only<br /> * memory, we don't want the Linux-specific update to<br /> * the timeval to cause a fault after the select has<br /> * completed successfully. However, because we're not<br /> * updating the timeval, we can't restart the system<br /> * call.<br /> */<br /> if (ret == -ERESTARTNOHAND)/*ERESTARTNOHAND表明,被中斷的系統調用*/<br /> ret = -EINTR;<br /> }<br /> } </p><p> return ret;<br />} </p><p>/*core_sys_select<br />為do_select準備好了位元影像,然後調用do_select,將返回的結果集,返回到使用者空間<br />*/<br />static int core_sys_select(int n, fd_set __user *inp, fd_set __user *outp,<br /> fd_set __user *exp, s64 *timeout)<br />{<br /> fd_set_bits fds;<br /> void *bits;<br /> int ret, max_fds;<br /> unsigned int size;<br /> struct fdtable *fdt;<br /> /* Allocate small arguments on the stack to save memory and be faster */ </p><p> /*SELECT_STACK_ALLOC 定義為256*/<br /> long stack_fds[SELECT_STACK_ALLOC/sizeof(long)]; </p><p> ret = -EINVAL;<br /> if (n < 0)<br /> goto out_nofds; </p><p> /* max_fds can increase, so grab it once to avoid race */<br /> rcu_read_lock();<br /> fdt = files_fdtable(current->files);/*擷取當前進程的檔案描述符表*/<br /> max_fds = fdt->max_fds;<br /> rcu_read_unlock();<br /> if (n > max_fds)/*修正使用者傳入的第一個參數:fd_set中檔案描述符的最大值*/<br /> n = max_fds; </p><p> /*<br /> * We need 6 bitmaps (in/out/ex for both incoming and outgoing),<br /> * since we used fdset we need to allocate memory in units of<br /> * long-words.<br /> */ </p><p> /*<br /> 如果stack_fds數組的大小不能容納下所有的fd_set,就用kmalloc重新分配一個大數組。<br /> 然後將位元影像平均分成份,並初始化fds結構<br /> */<br /> size = FDS_BYTES(n);<br /> bits = stack_fds;<br /> if (size > sizeof(stack_fds) / 6) {<br /> /* Not enough space in on-stack array; must use kmalloc */<br /> ret = -ENOMEM;<br /> bits = kmalloc(6 * size, GFP_KERNEL);<br /> if (!bits)<br /> goto out_nofds;<br /> }<br /> fds.in = bits;<br /> fds.out = bits + size;<br /> fds.ex = bits + 2*size;<br /> fds.res_in = bits + 3*size;<br /> fds.res_out = bits + 4*size;<br /> fds.res_ex = bits + 5*size; </p><p> /*get_fd_set僅僅調用copy_from_user從使用者空間拷貝了fd_set*/<br /> if ((ret = get_fd_set(n, inp, fds.in)) ||<br /> (ret = get_fd_set(n, outp, fds.out)) ||<br /> (ret = get_fd_set(n, exp, fds.ex)))<br /> goto out; </p><p> zero_fd_set(n, fds.res_in);<br /> zero_fd_set(n, fds.res_out);<br /> zero_fd_set(n, fds.res_ex); </p><p> /*<br /> 接力棒傳給了do_select<br /> */<br /> ret = do_select(n, &fds, timeout); </p><p> if (ret < 0)<br /> goto out; </p><p> /*do_select返回,是一種異常狀態*/<br /> if (!ret) {<br /> /*記得上面的sys_select不?將ERESTARTNOHAND轉換成了EINTR並返回。EINTR表明系統調用被中斷*/<br /> ret = -ERESTARTNOHAND;<br /> if (signal_pending(current))/*噹噹前進程有訊號要處理時,signal_pending返回真,這符合了EINTR的語義*/<br /> goto out;<br /> ret = 0;<br /> } </p><p> /*把結果集,拷貝回使用者空間*/<br /> if (set_fd_set(n, inp, fds.res_in) ||<br /> set_fd_set(n, outp, fds.res_out) ||<br /> set_fd_set(n, exp, fds.res_ex))<br /> ret = -EFAULT; </p><p>out:<br /> if (bits != stack_fds)<br /> kfree(bits);/*對應上面的kmalloc*/<br />out_nofds:<br /> return ret;<br />} </p><p>/*do_select<br />真正的select在此,遍曆了所有的fd,調用對應的xxx_poll函數<br />*/<br />int do_select(int n, fd_set_bits *fds, s64 *timeout)<br />{<br /> struct poll_wqueues table;<br /> poll_table *wait;<br /> int retval, i; </p><p> rcu_read_lock();<br /> /*根據已經開啟fd的位元影像檢查使用者開啟的fd, 要求對應fd必須開啟, 並且返回最大的fd*/<br /> retval = max_select_fd(n, fds);<br /> rcu_read_unlock(); </p><p> if (retval < 0)<br /> return retval;<br /> n = retval; </p><p> /*將當前進程放入自已的等待隊列table, 並將該等待隊列加入到該測試表wait*/<br /> poll_initwait(&table);<br /> wait = &table.pt; </p><p> if (!*timeout)<br /> wait = NULL;<br /> retval = 0; </p><p> for (;;) {/*死迴圈*/<br /> unsigned long *rinp, *routp, *rexp, *inp, *outp, *exp;<br /> long __timeout; </p><p> /*注意:可中斷的睡眠狀態*/<br /> set_current_state(TASK_INTERRUPTIBLE); </p><p> inp = fds->in; outp = fds->out; exp = fds->ex;<br /> rinp = fds->res_in; routp = fds->res_out; rexp = fds->res_ex; </p><p> for (i = 0; i < n; ++rinp, ++routp, ++rexp) {/*遍曆所有fd*/<br /> unsigned long in, out, ex, all_bits, bit = 1, mask, j;<br /> unsigned long res_in = 0, res_out = 0, res_ex = 0;<br /> const struct file_operations *f_op = NULL;<br /> struct file *file = NULL; </p><p> in = *inp++; out = *outp++; ex = *exp++;<br /> all_bits = in | out | ex;<br /> if (all_bits == 0) {<br /> /*<br /> __NFDBITS定義為(8 * sizeof(unsigned long)),即long的位元。<br /> 因為一個long代表了__NFDBITS位,所以跳到下一個位元影像i要增加__NFDBITS<br /> */<br /> i += __NFDBITS;<br /> continue;<br /> } </p><p> for (j = 0; j < __NFDBITS; ++j, ++i, bit <<= 1) {<br /> int fput_needed;<br /> if (i >= n)<br /> break; </p><p> /*測試每一位*/<br /> if (!(bit & all_bits))<br /> continue; </p><p> /*得到file結構指標,並增加引用計數欄位f_count*/<br /> file = fget_light(i, &fput_needed);<br /> if (file) {<br /> f_op = file->f_op;<br /> mask = DEFAULT_POLLMASK; </p><p> /*對於socket描述符,f_op->poll對應的函數是sock_poll<br /> 注意第三個參數是等待隊列,在poll成功後會將本進程喚醒執行*/<br /> if (f_op && f_op->poll)<br /> mask = (*f_op->poll)(file, retval ? NULL : wait); </p><p> /*釋放file結構指標,實際就是減小他的一個引用計數欄位f_count*/<br /> fput_light(file, fput_needed); </p><p> /*根據poll的結果設定狀態,要返回select出來的fd數目,所以retval++。<br /> 注意:retval是in out ex三個集合的總和*/<br /> if ((mask & POLLIN_SET) && (in & bit)) {<br /> res_in |= bit;<br /> retval++;<br /> }<br /> if ((mask & POLLOUT_SET) && (out & bit)) {<br /> res_out |= bit;<br /> retval++;<br /> }<br /> if ((mask & POLLEX_SET) && (ex & bit)) {<br /> res_ex |= bit;<br /> retval++;<br /> }<br /> } </p><p> /*<br /> 注意前面的set_current_state(TASK_INTERRUPTIBLE);<br /> 因為已經進入TASK_INTERRUPTIBLE狀態,所以cond_resched回調度其他進程來運行,<br /> 這裡的目的純粹是為了增加一個搶佔點。被搶佔後,由等待隊列機制喚醒。 </p><p> 在支援搶佔式調度的核心中(定義了CONFIG_PREEMPT),cond_resched是空操作<br /> */<br /> cond_resched();<br /> }<br /> /*根據poll的結果寫回到輸出位元影像裡*/<br /> if (res_in)<br /> *rinp = res_in;<br /> if (res_out)<br /> *routp = res_out;<br /> if (res_ex)<br /> *rexp = res_ex;<br /> }<br /> wait = NULL;<br /> if (retval || !*timeout || signal_pending(current))/*signal_pending前面說過了*/<br /> break;<br /> if(table.error) {<br /> retval = table.error;<br /> break;<br /> } </p><p> if (*timeout < 0) {<br /> /*無限等待*/<br /> __timeout = MAX_SCHEDULE_TIMEOUT;<br /> } else if (unlikely(*timeout >= (s64)MAX_SCHEDULE_TIMEOUT - 1)) {<br /> /* 時間超過MAX_SCHEDULE_TIMEOUT,即schedule_timeout允許的最大值,用一個迴圈來不斷減少逾時值*/<br /> __timeout = MAX_SCHEDULE_TIMEOUT - 1;<br /> *timeout -= __timeout;<br /> } else {<br /> /*等待一段時間*/<br /> __timeout = *timeout;<br /> *timeout = 0;<br /> } </p><p> /*TASK_INTERRUPTIBLE狀態下,調用schedule_timeout的進程會在收到訊號後重新得到調度的機會,<br /> 即schedule_timeout返回,並返回剩餘的刻度數<br /> */<br /> __timeout = schedule_timeout(__timeout);<br /> if (*timeout >= 0)<br /> *timeout += __timeout;<br /> } </p><p> /*設定為運行狀態*/<br /> __set_current_state(TASK_RUNNING);<br /> /*清理等待隊列*/<br /> poll_freewait(&table); </p><p> return retval;<br />} </p><p>static unsigned int sock_poll(struct file *file, poll_table *wait)<br />{<br /> struct socket *sock; </p><p> /*約定socket的file->private_data欄位放著對應的socket結構指標*/<br /> sock = file->private_data; </p><p> /*對應了三個協議的函數tcp_poll,udp_poll,datagram_poll,其中udp_poll幾乎直接調用了datagram_poll<br /> 累了,先休息一下,這三個函數以後分析*/<br /> return sock->ops->poll(file, sock, wait);<br />}
其他重要函數一覽
static int max_select_fd(unsigned long n, fd_set_bits *fds)
返回在fd_set中已經開啟的,並且小於使用者指定最大值,的fd
static inline int get_fd_set(unsigned long nr, void __user *ufdset,
unsigned long *fdset)
從使用者空間拷貝fd_set到核心
static inline void zero_fd_set(unsigned long nr, unsigned long
*fdset)
把fd_set清零
static inline unsigned long __must_check set_fd_set(unsigned long nr,
void __user *ufdset, unsigned long *fdset)
把fd_set拷貝回使用者空間
static inline int signal_pending(struct task_struct *p)
目前進程有訊號需要處理
struct file *fget_light(unsigned int fd, int *fput_needed)
由fd得到其對應的file結構指標,並增加其引用計數
static inline void fput_light(struct file *file, int fput_needed)
釋放由fget_light得到的file結構指標,減少其引用計數
set_current_state
設定當前進程的狀態
static inline int cond_resched(void)
判斷是否有進程需要搶佔當前進程,如果是將立即發生調度。就是額外增加一個搶佔點。
signed long __sched schedule_timeout(signed long timeout)
當前進程睡眠timeout個jiffies
rcu_read_lock
rcu_read_unlock
Linux 2.6新加入的rcu鎖。讀鎖的加鎖、解鎖函數
參考http://www.ibm.com/developerworks/cn/linux/l-rcu
poll_freewait
poll_initwait
poll_wait
...
和檔案IO,poll機制有關的幾個函數,參考《Linux裝置驅動(第三版)》6.3
tcp_poll
udp_poll
datagram_poll
協議層的poll函數