亚洲欧美第一页_禁久久精品乱码_粉嫩av一区二区三区免费野_久草精品视频

? 歡迎來(lái)到蟲(chóng)蟲(chóng)下載站! | ?? 資源下載 ?? 資源專(zhuān)輯 ?? 關(guān)于我們
? 蟲(chóng)蟲(chóng)下載站

?? bio.c

?? unix v7是最后一個(gè)廣泛發(fā)布的研究型UNIX版本
?? C
字號(hào):
#include "../h/param.h"#include "../h/systm.h"#include "../h/dir.h"#include "../h/user.h"#include "../h/buf.h"#include "../h/conf.h"#include "../h/proc.h"#include "../h/seg.h"#define	DISKMON	1#ifdef	DISKMONstruct {	int	nbuf;	long	nread;	long	nreada;	long	ncache;	long	nwrite;	long	bufcount[NBUF];} io_info;#endif/* * swap IO headers. * they are filled in to point * at the desired IO operation. */struct	buf	swbuf1;struct	buf	swbuf2;/* * The following several routines allocate and free * buffers with various side effects.  In general the * arguments to an allocate routine are a device and * a block number, and the value is a pointer to * to the buffer header; the buffer is marked "busy" * so that no one else can touch it.  If the block was * already in core, no I/O need be done; if it is * already busy, the process waits until it becomes free. * The following routines allocate a buffer: *	getblk *	bread *	breada * Eventually the buffer must be released, possibly with the * side effect of writing it out, by using one of *	bwrite *	bdwrite *	bawrite *	brelse *//* * Read in (if necessary) the block and return a buffer pointer. */struct buf *bread(dev, blkno)dev_t dev;daddr_t blkno;{	register struct buf *bp;	bp = getblk(dev, blkno);	if (bp->b_flags&B_DONE) {#ifdef	DISKMON		io_info.ncache++;#endif		return(bp);	}	bp->b_flags |= B_READ;	bp->b_bcount = BSIZE;	(*bdevsw[major(dev)].d_strategy)(bp);#ifdef	DISKMON	io_info.nread++;#endif	iowait(bp);	return(bp);}/* * Read in the block, like bread, but also start I/O on the * read-ahead block (which is not allocated to the caller) */struct buf *breada(dev, blkno, rablkno)dev_t dev;daddr_t blkno, rablkno;{	register struct buf *bp, *rabp;	bp = NULL;	if (!incore(dev, blkno)) {		bp = getblk(dev, blkno);		if ((bp->b_flags&B_DONE) == 0) {			bp->b_flags |= B_READ;			bp->b_bcount = BSIZE;			(*bdevsw[major(dev)].d_strategy)(bp);#ifdef	DISKMON			io_info.nread++;#endif		}	}	if (rablkno && !incore(dev, rablkno)) {		rabp = getblk(dev, rablkno);		if (rabp->b_flags & B_DONE)			brelse(rabp);		else {			rabp->b_flags |= B_READ|B_ASYNC;			rabp->b_bcount = BSIZE;			(*bdevsw[major(dev)].d_strategy)(rabp);#ifdef	DISKMON			io_info.nreada++;#endif		}	}	if(bp == NULL)		return(bread(dev, blkno));	iowait(bp);	return(bp);}/* * Write the buffer, waiting for completion. * Then release the buffer. */bwrite(bp)register struct buf *bp;{	register flag;	flag = bp->b_flags;	bp->b_flags &= ~(B_READ | B_DONE | B_ERROR | B_DELWRI | B_AGE);	bp->b_bcount = BSIZE;#ifdef	DISKMON	io_info.nwrite++;#endif	(*bdevsw[major(bp->b_dev)].d_strategy)(bp);	if ((flag&B_ASYNC) == 0) {		iowait(bp);		brelse(bp);	} else if (flag & B_DELWRI)		bp->b_flags |= B_AGE;	else		geterror(bp);}/* * Release the buffer, marking it so that if it is grabbed * for another purpose it will be written out before being * given up (e.g. when writing a partial block where it is * assumed that another write for the same block will soon follow). * This can't be done for magtape, since writes must be done * in the same order as requested. */bdwrite(bp)register struct buf *bp;{	register struct buf *dp;	dp = bdevsw[major(bp->b_dev)].d_tab;	if(dp->b_flags & B_TAPE)		bawrite(bp);	else {		bp->b_flags |= B_DELWRI | B_DONE;		brelse(bp);	}}/* * Release the buffer, start I/O on it, but don't wait for completion. */bawrite(bp)register struct buf *bp;{	bp->b_flags |= B_ASYNC;	bwrite(bp);}/* * release the buffer, with no I/O implied. */brelse(bp)register struct buf *bp;{	register struct buf **backp;	register s;	if (bp->b_flags&B_WANTED)		wakeup((caddr_t)bp);	if (bfreelist.b_flags&B_WANTED) {		bfreelist.b_flags &= ~B_WANTED;		wakeup((caddr_t)&bfreelist);	}	if (bp->b_flags&B_ERROR)		bp->b_dev = NODEV;  /* no assoc. on error */	s = spl6();	if(bp->b_flags & B_AGE) {		backp = &bfreelist.av_forw;		(*backp)->av_back = bp;		bp->av_forw = *backp;		*backp = bp;		bp->av_back = &bfreelist;	} else {		backp = &bfreelist.av_back;		(*backp)->av_forw = bp;		bp->av_back = *backp;		*backp = bp;		bp->av_forw = &bfreelist;	}	bp->b_flags &= ~(B_WANTED|B_BUSY|B_ASYNC|B_AGE);	splx(s);}/* * See if the block is associated with some buffer * (mainly to avoid getting hung up on a wait in breada) */incore(dev, blkno)dev_t dev;daddr_t blkno;{	register struct buf *bp;	register struct buf *dp;	dp = bdevsw[major(dev)].d_tab;	for (bp=dp->b_forw; bp != dp; bp = bp->b_forw)		if (bp->b_blkno==blkno && bp->b_dev==dev)			return(1);	return(0);}/* * Assign a buffer for the given block.  If the appropriate * block is already associated, return it; otherwise search * for the oldest non-busy buffer and reassign it. */struct buf *getblk(dev, blkno)dev_t dev;daddr_t blkno;{	register struct buf *bp;	register struct buf *dp;#ifdef	DISKMON	register i;#endif	if(major(dev) >= nblkdev)		panic("blkdev");    loop:	spl0();	dp = bdevsw[major(dev)].d_tab;	if(dp == NULL)		panic("devtab");	for (bp=dp->b_forw; bp != dp; bp = bp->b_forw) {		if (bp->b_blkno!=blkno || bp->b_dev!=dev)			continue;		spl6();		if (bp->b_flags&B_BUSY) {			bp->b_flags |= B_WANTED;			sleep((caddr_t)bp, PRIBIO+1);			goto loop;		}		spl0();#ifdef	DISKMON		i = 0;		dp = bp->av_forw;		while (dp != &bfreelist) {			i++;			dp = dp->av_forw;		}		if (i<NBUF)			io_info.bufcount[i]++;#endif		notavail(bp);		return(bp);	}	spl6();	if (bfreelist.av_forw == &bfreelist) {		bfreelist.b_flags |= B_WANTED;		sleep((caddr_t)&bfreelist, PRIBIO+1);		goto loop;	}	spl0();	notavail(bp = bfreelist.av_forw);	if (bp->b_flags & B_DELWRI) {		bp->b_flags |= B_ASYNC;		bwrite(bp);		goto loop;	}	bp->b_flags = B_BUSY;	bp->b_back->b_forw = bp->b_forw;	bp->b_forw->b_back = bp->b_back;	bp->b_forw = dp->b_forw;	bp->b_back = dp;	dp->b_forw->b_back = bp;	dp->b_forw = bp;	bp->b_dev = dev;	bp->b_blkno = blkno;	return(bp);}/* * get an empty block, * not assigned to any particular device */struct buf *geteblk(){	register struct buf *bp;	register struct buf *dp;loop:	spl6();	while (bfreelist.av_forw == &bfreelist) {		bfreelist.b_flags |= B_WANTED;		sleep((caddr_t)&bfreelist, PRIBIO+1);	}	spl0();	dp = &bfreelist;	notavail(bp = bfreelist.av_forw);	if (bp->b_flags & B_DELWRI) {		bp->b_flags |= B_ASYNC;		bwrite(bp);		goto loop;	}	bp->b_flags = B_BUSY;	bp->b_back->b_forw = bp->b_forw;	bp->b_forw->b_back = bp->b_back;	bp->b_forw = dp->b_forw;	bp->b_back = dp;	dp->b_forw->b_back = bp;	dp->b_forw = bp;	bp->b_dev = (dev_t)NODEV;	return(bp);}/* * Wait for I/O completion on the buffer; return errors * to the user. */iowait(bp)register struct buf *bp;{	spl6();	while ((bp->b_flags&B_DONE)==0)		sleep((caddr_t)bp, PRIBIO);	spl0();	geterror(bp);}/* * Unlink a buffer from the available list and mark it busy. * (internal interface) */notavail(bp)register struct buf *bp;{	register s;	s = spl6();	bp->av_back->av_forw = bp->av_forw;	bp->av_forw->av_back = bp->av_back;	bp->b_flags |= B_BUSY;	splx(s);}/* * Mark I/O complete on a buffer, release it if I/O is asynchronous, * and wake up anyone waiting for it. */iodone(bp)register struct buf *bp;{	if(bp->b_flags&B_MAP)		mapfree(bp);	bp->b_flags |= B_DONE;	if (bp->b_flags&B_ASYNC)		brelse(bp);	else {		bp->b_flags &= ~B_WANTED;		wakeup((caddr_t)bp);	}}/* * Zero the core associated with a buffer. */clrbuf(bp)struct buf *bp;{	register *p;	register c;	p = bp->b_un.b_words;	c = BSIZE/sizeof(int);	do		*p++ = 0;	while (--c);	bp->b_resid = 0;}/* * swap I/O */swap(blkno, coreaddr, count, rdflg)register count;{	register struct buf *bp;	register tcount;	bp = &swbuf1;	if(bp->b_flags & B_BUSY)		if((swbuf2.b_flags&B_WANTED) == 0)			bp = &swbuf2;	spl6();	while (bp->b_flags&B_BUSY) {		bp->b_flags |= B_WANTED;		sleep((caddr_t)bp, PSWP+1);	}	while (count) {		bp->b_flags = B_BUSY | B_PHYS | rdflg;		bp->b_dev = swapdev;		tcount = count;		if (tcount >= 01700)	/* prevent byte-count wrap */			tcount = 01700;		bp->b_bcount = ctob(tcount);		bp->b_blkno = swplo+blkno;		bp->b_un.b_addr = (caddr_t)(coreaddr<<6);		bp->b_xmem = (coreaddr>>10) & 077;		(*bdevsw[major(swapdev)].d_strategy)(bp);		spl6();		while((bp->b_flags&B_DONE)==0)			sleep((caddr_t)bp, PSWP);		count -= tcount;		coreaddr += tcount;		blkno += ctod(tcount);	}	if (bp->b_flags&B_WANTED)		wakeup((caddr_t)bp);	spl0();	bp->b_flags &= ~(B_BUSY|B_WANTED);	if (bp->b_flags & B_ERROR)		panic("IO err in swap");}/* * make sure all write-behind blocks * on dev (or NODEV for all) * are flushed out. * (from umount and update) */bflush(dev)dev_t dev;{	register struct buf *bp;loop:	spl6();	for (bp = bfreelist.av_forw; bp != &bfreelist; bp = bp->av_forw) {		if (bp->b_flags&B_DELWRI && (dev == NODEV||dev==bp->b_dev)) {			bp->b_flags |= B_ASYNC;			notavail(bp);			bwrite(bp);			goto loop;		}	}	spl0();}/* * Raw I/O. The arguments are *	The strategy routine for the device *	A buffer, which will always be a special buffer *	  header owned exclusively by the device for this purpose *	The device number *	Read/write flag * Essentially all the work is computing physical addresses and * validating them. */physio(strat, bp, dev, rw)register struct buf *bp;int (*strat)();{	register unsigned base;	register int nb;	int ts;	base = (unsigned)u.u_base;	/*	 * Check odd base, odd count, and address wraparound	 */	if (base&01 || u.u_count&01 || base>=base+u.u_count)		goto bad;	ts = (u.u_tsize+127) & ~0177;	if (u.u_sep)		ts = 0;	nb = (base>>6) & 01777;	/*	 * Check overlap with text. (ts and nb now	 * in 64-byte clicks)	 */	if (nb < ts)		goto bad;	/*	 * Check that transfer is either entirely in the	 * data or in the stack: that is, either	 * the end is in the data or the start is in the stack	 * (remember wraparound was already checked).	 */	if ((((base+u.u_count)>>6)&01777) >= ts+u.u_dsize	    && nb < 1024-u.u_ssize)		goto bad;	spl6();	while (bp->b_flags&B_BUSY) {		bp->b_flags |= B_WANTED;		sleep((caddr_t)bp, PRIBIO+1);	}	bp->b_flags = B_BUSY | B_PHYS | rw;	bp->b_dev = dev;	/*	 * Compute physical address by simulating	 * the segmentation hardware.	 */	ts = (u.u_sep? UDSA: UISA)->r[nb>>7] + (nb&0177);	bp->b_un.b_addr = (caddr_t)((ts<<6) + (base&077));	bp->b_xmem = (ts>>10) & 077;	bp->b_blkno = u.u_offset >> BSHIFT;	bp->b_bcount = u.u_count;	bp->b_error = 0;	u.u_procp->p_flag |= SLOCK;	(*strat)(bp);	spl6();	while ((bp->b_flags&B_DONE) == 0)		sleep((caddr_t)bp, PRIBIO);	u.u_procp->p_flag &= ~SLOCK;	if (bp->b_flags&B_WANTED)		wakeup((caddr_t)bp);	spl0();	bp->b_flags &= ~(B_BUSY|B_WANTED);	u.u_count = bp->b_resid;	geterror(bp);	return;    bad:	u.u_error = EFAULT;}/* * Pick up the device's error number and pass it to the user; * if there is an error but the number is 0 set a generalized * code.  Actually the latter is always true because devices * don't yet return specific errors. */geterror(bp)register struct buf *bp;{	if (bp->b_flags&B_ERROR)		if ((u.u_error = bp->b_error)==0)			u.u_error = EIO;}

?? 快捷鍵說(shuō)明

復(fù)制代碼 Ctrl + C
搜索代碼 Ctrl + F
全屏模式 F11
切換主題 Ctrl + Shift + D
顯示快捷鍵 ?
增大字號(hào) Ctrl + =
減小字號(hào) Ctrl + -
亚洲欧美第一页_禁久久精品乱码_粉嫩av一区二区三区免费野_久草精品视频
欧美日韩国产片| 日韩电影免费在线观看网站| 久久久三级国产网站| 日韩精品一区二区三区四区视频 | 色猫猫国产区一区二在线视频| 国产成人精品综合在线观看| 成人午夜电影久久影院| 成人免费的视频| 99久久久国产精品| 欧美性生活大片视频| 欧美综合亚洲图片综合区| 欧美日精品一区视频| 91麻豆精品国产自产在线| 欧美一区二区三区视频| 久久久另类综合| 久久综合色之久久综合| 欧美国产精品一区二区| 亚洲日本一区二区| 亚洲第一福利视频在线| 麻豆国产精品视频| 国产精品538一区二区在线| 成人的网站免费观看| 日本精品一区二区三区高清 | 欧美亚洲高清一区| 欧美狂野另类xxxxoooo| 欧美www视频| 国产精品国产三级国产有无不卡 | 精品一区二区三区免费播放 | 久久久久国产免费免费| 国产精品久久久久aaaa樱花| 亚洲综合久久av| 蜜桃视频一区二区三区在线观看| 国产suv精品一区二区883| 91丨porny丨国产| 69久久99精品久久久久婷婷| 久久久国产午夜精品| 亚洲伊人伊色伊影伊综合网| 久久精品99久久久| 91在线一区二区三区| 欧美一区二区福利在线| 国产色产综合产在线视频| 亚洲一卡二卡三卡四卡无卡久久| 韩国午夜理伦三级不卡影院| av日韩在线网站| 欧美一级片在线| 日韩美女视频一区二区| 免费的国产精品| 91蜜桃婷婷狠狠久久综合9色| 欧美日本一区二区三区四区| 国产日韩精品一区二区浪潮av | 国产寡妇亲子伦一区二区| 一本色道**综合亚洲精品蜜桃冫| 日韩欧美激情四射| 一区二区激情视频| 国产 欧美在线| 在线播放中文一区| 日韩一区有码在线| 国内精品嫩模私拍在线| 欧美人牲a欧美精品| 中文字幕永久在线不卡| 韩国在线一区二区| 欧美少妇性性性| 亚洲欧洲99久久| 国产麻豆精品久久一二三| 678五月天丁香亚洲综合网| 亚洲色图丝袜美腿| 国产91在线观看丝袜| 日韩一级片在线观看| 亚洲一区二区三区四区中文字幕| 成人免费视频app| 日韩精品一区二区三区中文不卡 | 色综合天天综合网国产成人综合天| 日韩视频免费观看高清完整版在线观看 | 91免费视频观看| 久久久99精品久久| 男女视频一区二区| 欧洲精品一区二区| 日韩毛片一二三区| 国产91丝袜在线观看| 久久综合一区二区| 美女精品一区二区| 欧美精品日韩一区| 午夜伦理一区二区| 91福利视频久久久久| 亚洲免费看黄网站| av亚洲产国偷v产偷v自拍| 欧美激情一区二区三区不卡| 国内外成人在线视频| 精品久久久影院| 蜜臀av性久久久久蜜臀aⅴ | 日韩伦理av电影| 99r国产精品| 亚洲丝袜精品丝袜在线| www.色综合.com| 中文字幕在线观看一区| jlzzjlzz亚洲日本少妇| 国产精品美女一区二区在线观看| 国产寡妇亲子伦一区二区| 久久久国产精华| 国产1区2区3区精品美女| 国产欧美视频在线观看| 国产成人免费av在线| 国产精品少妇自拍| 成人av网站在线观看免费| 综合在线观看色| 色八戒一区二区三区| 亚洲国产综合人成综合网站| 欧美日韩在线电影| 日本亚洲天堂网| 精品三级在线观看| 国产成人午夜电影网| 亚洲欧洲日韩一区二区三区| 色综合天天综合网天天狠天天 | 色综合久久中文字幕综合网 | 成人综合婷婷国产精品久久蜜臀| 日本一区免费视频| 99re这里只有精品6| 一区二区欧美在线观看| 欧美精品aⅴ在线视频| 美女网站在线免费欧美精品| 久久色中文字幕| 99天天综合性| 亚洲午夜日本在线观看| 91精品国产色综合久久| 国产乱理伦片在线观看夜一区| 欧美国产日韩a欧美在线观看| 色综合天天狠狠| 男人的天堂久久精品| 国产色一区二区| 欧美性生活一区| 激情综合色丁香一区二区| 国产精品丝袜久久久久久app| 一本大道久久精品懂色aⅴ| 日韩国产成人精品| 久久综合九色综合欧美98| 91视频com| 久久精品国产久精国产| 欧美极品少妇xxxxⅹ高跟鞋| 在线免费观看日本一区| 美女视频黄频大全不卡视频在线播放| 久久蜜桃香蕉精品一区二区三区| 91碰在线视频| 美女www一区二区| 亚洲人成人一区二区在线观看| 宅男在线国产精品| 99在线视频精品| 日本aⅴ亚洲精品中文乱码| 中文字幕第一页久久| 欧美高清激情brazzers| 成人动漫中文字幕| 美女在线视频一区| 亚洲欧美乱综合| 精品88久久久久88久久久| 色婷婷国产精品| 国内成人免费视频| 亚洲成人动漫精品| 国产精品黄色在线观看 | 男女性色大片免费观看一区二区| 亚洲国产精华液网站w| 欧美日本一区二区在线观看| thepron国产精品| 免费观看91视频大全| 亚洲精品视频一区二区| 久久精品夜色噜噜亚洲a∨| 欧美精品色综合| 一本大道久久精品懂色aⅴ| 国产精品一区二区在线播放| 日韩电影网1区2区| 亚洲免费观看高清完整版在线| 久久综合五月天婷婷伊人| 欧美美女一区二区三区| 99国产精品久久久久久久久久| 国产一级精品在线| 视频精品一区二区| 亚洲男人都懂的| 国产欧美综合在线| 日韩免费观看高清完整版| 欧美日韩免费在线视频| 91免费版在线| 成a人片国产精品| 韩国女主播成人在线| 奇米精品一区二区三区在线观看 | 中文字幕不卡在线观看| 精品伦理精品一区| 777色狠狠一区二区三区| 欧美羞羞免费网站| 日本精品视频一区二区| caoporn国产一区二区| 国产福利91精品一区二区三区| 麻豆精品在线观看| 日韩精品国产欧美| 亚洲成人自拍偷拍| 亚洲在线视频网站| 亚洲综合久久久久| 亚洲综合精品自拍| 亚洲一区在线免费观看| 亚洲在线成人精品| 一区二区三区av电影| 亚洲综合在线电影| 一区二区三区欧美|