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

? 歡迎來到蟲蟲下載站! | ?? 資源下載 ?? 資源專輯 ?? 關于我們
? 蟲蟲下載站

?? rcutorture.c

?? linux 2.6.19 kernel source code before patching
?? C
?? 第 1 頁 / 共 2 頁
字號:
/* * Read-Copy Update module-based torture test facility * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation; either version 2 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. * * Copyright (C) IBM Corporation, 2005, 2006 * * Authors: Paul E. McKenney <paulmck@us.ibm.com> *          Josh Triplett <josh@freedesktop.org> * * See also:  Documentation/RCU/torture.txt */#include <linux/types.h>#include <linux/kernel.h>#include <linux/init.h>#include <linux/module.h>#include <linux/kthread.h>#include <linux/err.h>#include <linux/spinlock.h>#include <linux/smp.h>#include <linux/rcupdate.h>#include <linux/interrupt.h>#include <linux/sched.h>#include <asm/atomic.h>#include <linux/bitops.h>#include <linux/module.h>#include <linux/completion.h>#include <linux/moduleparam.h>#include <linux/percpu.h>#include <linux/notifier.h>#include <linux/cpu.h>#include <linux/random.h>#include <linux/delay.h>#include <linux/byteorder/swabb.h>#include <linux/stat.h>#include <linux/srcu.h>MODULE_LICENSE("GPL");MODULE_AUTHOR("Paul E. McKenney <paulmck@us.ibm.com> and "              "Josh Triplett <josh@freedesktop.org>");static int nreaders = -1;	/* # reader threads, defaults to 2*ncpus */static int nfakewriters = 4;	/* # fake writer threads */static int stat_interval;	/* Interval between stats, in seconds. */				/*  Defaults to "only at end of test". */static int verbose;		/* Print more debug info. */static int test_no_idle_hz;	/* Test RCU's support for tickless idle CPUs. */static int shuffle_interval = 5; /* Interval between shuffles (in sec)*/static char *torture_type = "rcu"; /* What RCU implementation to torture. */module_param(nreaders, int, 0444);MODULE_PARM_DESC(nreaders, "Number of RCU reader threads");module_param(nfakewriters, int, 0444);MODULE_PARM_DESC(nfakewriters, "Number of RCU fake writer threads");module_param(stat_interval, int, 0444);MODULE_PARM_DESC(stat_interval, "Number of seconds between stats printk()s");module_param(verbose, bool, 0444);MODULE_PARM_DESC(verbose, "Enable verbose debugging printk()s");module_param(test_no_idle_hz, bool, 0444);MODULE_PARM_DESC(test_no_idle_hz, "Test support for tickless idle CPUs");module_param(shuffle_interval, int, 0444);MODULE_PARM_DESC(shuffle_interval, "Number of seconds between shuffles");module_param(torture_type, charp, 0444);MODULE_PARM_DESC(torture_type, "Type of RCU to torture (rcu, rcu_bh, srcu)");#define TORTURE_FLAG "-torture:"#define PRINTK_STRING(s) \	do { printk(KERN_ALERT "%s" TORTURE_FLAG s "\n", torture_type); } while (0)#define VERBOSE_PRINTK_STRING(s) \	do { if (verbose) printk(KERN_ALERT "%s" TORTURE_FLAG s "\n", torture_type); } while (0)#define VERBOSE_PRINTK_ERRSTRING(s) \	do { if (verbose) printk(KERN_ALERT "%s" TORTURE_FLAG "!!! " s "\n", torture_type); } while (0)static char printk_buf[4096];static int nrealreaders;static struct task_struct *writer_task;static struct task_struct **fakewriter_tasks;static struct task_struct **reader_tasks;static struct task_struct *stats_task;static struct task_struct *shuffler_task;#define RCU_TORTURE_PIPE_LEN 10struct rcu_torture {	struct rcu_head rtort_rcu;	int rtort_pipe_count;	struct list_head rtort_free;	int rtort_mbtest;};static int fullstop = 0;	/* stop generating callbacks at test end. */static LIST_HEAD(rcu_torture_freelist);static struct rcu_torture *rcu_torture_current = NULL;static long rcu_torture_current_version = 0;static struct rcu_torture rcu_tortures[10 * RCU_TORTURE_PIPE_LEN];static DEFINE_SPINLOCK(rcu_torture_lock);static DEFINE_PER_CPU(long [RCU_TORTURE_PIPE_LEN + 1], rcu_torture_count) =	{ 0 };static DEFINE_PER_CPU(long [RCU_TORTURE_PIPE_LEN + 1], rcu_torture_batch) =	{ 0 };static atomic_t rcu_torture_wcount[RCU_TORTURE_PIPE_LEN + 1];static atomic_t n_rcu_torture_alloc;static atomic_t n_rcu_torture_alloc_fail;static atomic_t n_rcu_torture_free;static atomic_t n_rcu_torture_mberror;static atomic_t n_rcu_torture_error;static struct list_head rcu_torture_removed;/* * Allocate an element from the rcu_tortures pool. */static struct rcu_torture *rcu_torture_alloc(void){	struct list_head *p;	spin_lock_bh(&rcu_torture_lock);	if (list_empty(&rcu_torture_freelist)) {		atomic_inc(&n_rcu_torture_alloc_fail);		spin_unlock_bh(&rcu_torture_lock);		return NULL;	}	atomic_inc(&n_rcu_torture_alloc);	p = rcu_torture_freelist.next;	list_del_init(p);	spin_unlock_bh(&rcu_torture_lock);	return container_of(p, struct rcu_torture, rtort_free);}/* * Free an element to the rcu_tortures pool. */static voidrcu_torture_free(struct rcu_torture *p){	atomic_inc(&n_rcu_torture_free);	spin_lock_bh(&rcu_torture_lock);	list_add_tail(&p->rtort_free, &rcu_torture_freelist);	spin_unlock_bh(&rcu_torture_lock);}struct rcu_random_state {	unsigned long rrs_state;	long rrs_count;};#define RCU_RANDOM_MULT 39916801  /* prime */#define RCU_RANDOM_ADD	479001701 /* prime */#define RCU_RANDOM_REFRESH 10000#define DEFINE_RCU_RANDOM(name) struct rcu_random_state name = { 0, 0 }/* * Crude but fast random-number generator.  Uses a linear congruential * generator, with occasional help from get_random_bytes(). */static unsigned longrcu_random(struct rcu_random_state *rrsp){	long refresh;	if (--rrsp->rrs_count < 0) {		get_random_bytes(&refresh, sizeof(refresh));		rrsp->rrs_state += refresh;		rrsp->rrs_count = RCU_RANDOM_REFRESH;	}	rrsp->rrs_state = rrsp->rrs_state * RCU_RANDOM_MULT + RCU_RANDOM_ADD;	return swahw32(rrsp->rrs_state);}/* * Operations vector for selecting different types of tests. */struct rcu_torture_ops {	void (*init)(void);	void (*cleanup)(void);	int (*readlock)(void);	void (*readdelay)(struct rcu_random_state *rrsp);	void (*readunlock)(int idx);	int (*completed)(void);	void (*deferredfree)(struct rcu_torture *p);	void (*sync)(void);	int (*stats)(char *page);	char *name;};static struct rcu_torture_ops *cur_ops = NULL;/* * Definitions for rcu torture testing. */static int rcu_torture_read_lock(void) __acquires(RCU){	rcu_read_lock();	return 0;}static void rcu_read_delay(struct rcu_random_state *rrsp){	long delay;	const long longdelay = 200;	/* We want there to be long-running readers, but not all the time. */	delay = rcu_random(rrsp) % (nrealreaders * 2 * longdelay);	if (!delay)		udelay(longdelay);}static void rcu_torture_read_unlock(int idx) __releases(RCU){	rcu_read_unlock();}static int rcu_torture_completed(void){	return rcu_batches_completed();}static voidrcu_torture_cb(struct rcu_head *p){	int i;	struct rcu_torture *rp = container_of(p, struct rcu_torture, rtort_rcu);	if (fullstop) {		/* Test is ending, just drop callbacks on the floor. */		/* The next initialization will pick up the pieces. */		return;	}	i = rp->rtort_pipe_count;	if (i > RCU_TORTURE_PIPE_LEN)		i = RCU_TORTURE_PIPE_LEN;	atomic_inc(&rcu_torture_wcount[i]);	if (++rp->rtort_pipe_count >= RCU_TORTURE_PIPE_LEN) {		rp->rtort_mbtest = 0;		rcu_torture_free(rp);	} else		cur_ops->deferredfree(rp);}static void rcu_torture_deferred_free(struct rcu_torture *p){	call_rcu(&p->rtort_rcu, rcu_torture_cb);}static struct rcu_torture_ops rcu_ops = {	.init = NULL,	.cleanup = NULL,	.readlock = rcu_torture_read_lock,	.readdelay = rcu_read_delay,	.readunlock = rcu_torture_read_unlock,	.completed = rcu_torture_completed,	.deferredfree = rcu_torture_deferred_free,	.sync = synchronize_rcu,	.stats = NULL,	.name = "rcu"};static void rcu_sync_torture_deferred_free(struct rcu_torture *p){	int i;	struct rcu_torture *rp;	struct rcu_torture *rp1;	cur_ops->sync();	list_add(&p->rtort_free, &rcu_torture_removed);	list_for_each_entry_safe(rp, rp1, &rcu_torture_removed, rtort_free) {		i = rp->rtort_pipe_count;		if (i > RCU_TORTURE_PIPE_LEN)			i = RCU_TORTURE_PIPE_LEN;		atomic_inc(&rcu_torture_wcount[i]);		if (++rp->rtort_pipe_count >= RCU_TORTURE_PIPE_LEN) {			rp->rtort_mbtest = 0;			list_del(&rp->rtort_free);			rcu_torture_free(rp);		}	}}static void rcu_sync_torture_init(void){	INIT_LIST_HEAD(&rcu_torture_removed);}static struct rcu_torture_ops rcu_sync_ops = {	.init = rcu_sync_torture_init,	.cleanup = NULL,	.readlock = rcu_torture_read_lock,	.readdelay = rcu_read_delay,	.readunlock = rcu_torture_read_unlock,	.completed = rcu_torture_completed,	.deferredfree = rcu_sync_torture_deferred_free,	.sync = synchronize_rcu,	.stats = NULL,	.name = "rcu_sync"};/* * Definitions for rcu_bh torture testing. */static int rcu_bh_torture_read_lock(void) __acquires(RCU_BH){	rcu_read_lock_bh();	return 0;}static void rcu_bh_torture_read_unlock(int idx) __releases(RCU_BH){	rcu_read_unlock_bh();}static int rcu_bh_torture_completed(void){	return rcu_batches_completed_bh();}static void rcu_bh_torture_deferred_free(struct rcu_torture *p){	call_rcu_bh(&p->rtort_rcu, rcu_torture_cb);}struct rcu_bh_torture_synchronize {	struct rcu_head head;	struct completion completion;};static void rcu_bh_torture_wakeme_after_cb(struct rcu_head *head){	struct rcu_bh_torture_synchronize *rcu;	rcu = container_of(head, struct rcu_bh_torture_synchronize, head);	complete(&rcu->completion);}static void rcu_bh_torture_synchronize(void){	struct rcu_bh_torture_synchronize rcu;	init_completion(&rcu.completion);	call_rcu_bh(&rcu.head, rcu_bh_torture_wakeme_after_cb);	wait_for_completion(&rcu.completion);}static struct rcu_torture_ops rcu_bh_ops = {	.init = NULL,	.cleanup = NULL,	.readlock = rcu_bh_torture_read_lock,	.readdelay = rcu_read_delay,  /* just reuse rcu's version. */	.readunlock = rcu_bh_torture_read_unlock,	.completed = rcu_bh_torture_completed,	.deferredfree = rcu_bh_torture_deferred_free,	.sync = rcu_bh_torture_synchronize,	.stats = NULL,	.name = "rcu_bh"};static struct rcu_torture_ops rcu_bh_sync_ops = {	.init = rcu_sync_torture_init,	.cleanup = NULL,	.readlock = rcu_bh_torture_read_lock,	.readdelay = rcu_read_delay,  /* just reuse rcu's version. */	.readunlock = rcu_bh_torture_read_unlock,	.completed = rcu_bh_torture_completed,	.deferredfree = rcu_sync_torture_deferred_free,	.sync = rcu_bh_torture_synchronize,	.stats = NULL,	.name = "rcu_bh_sync"};/* * Definitions for srcu torture testing. */static struct srcu_struct srcu_ctl;static void srcu_torture_init(void){	init_srcu_struct(&srcu_ctl);	rcu_sync_torture_init();}static void srcu_torture_cleanup(void){	synchronize_srcu(&srcu_ctl);	cleanup_srcu_struct(&srcu_ctl);}static int srcu_torture_read_lock(void) __acquires(&srcu_ctl){	return srcu_read_lock(&srcu_ctl);}static void srcu_read_delay(struct rcu_random_state *rrsp){	long delay;	const long uspertick = 1000000 / HZ;	const long longdelay = 10;	/* We want there to be long-running readers, but not all the time. */	delay = rcu_random(rrsp) % (nrealreaders * 2 * longdelay * uspertick);	if (!delay)		schedule_timeout_interruptible(longdelay);}static void srcu_torture_read_unlock(int idx) __releases(&srcu_ctl){	srcu_read_unlock(&srcu_ctl, idx);}static int srcu_torture_completed(void){	return srcu_batches_completed(&srcu_ctl);}static void srcu_torture_synchronize(void){	synchronize_srcu(&srcu_ctl);}static int srcu_torture_stats(char *page){	int cnt = 0;	int cpu;	int idx = srcu_ctl.completed & 0x1;	cnt += sprintf(&page[cnt], "%s%s per-CPU(idx=%d):",		       torture_type, TORTURE_FLAG, idx);	for_each_possible_cpu(cpu) {		cnt += sprintf(&page[cnt], " %d(%d,%d)", cpu,			       per_cpu_ptr(srcu_ctl.per_cpu_ref, cpu)->c[!idx],			       per_cpu_ptr(srcu_ctl.per_cpu_ref, cpu)->c[idx]);	}	cnt += sprintf(&page[cnt], "\n");	return cnt;}static struct rcu_torture_ops srcu_ops = {	.init = srcu_torture_init,	.cleanup = srcu_torture_cleanup,	.readlock = srcu_torture_read_lock,	.readdelay = srcu_read_delay,	.readunlock = srcu_torture_read_unlock,	.completed = srcu_torture_completed,	.deferredfree = rcu_sync_torture_deferred_free,	.sync = srcu_torture_synchronize,	.stats = srcu_torture_stats,	.name = "srcu"};/* * Definitions for sched torture testing. */static int sched_torture_read_lock(void){	preempt_disable();	return 0;}static void sched_torture_read_unlock(int idx){	preempt_enable();}static int sched_torture_completed(void){	return 0;}static void sched_torture_synchronize(void){	synchronize_sched();}static struct rcu_torture_ops sched_ops = {	.init = rcu_sync_torture_init,	.cleanup = NULL,	.readlock = sched_torture_read_lock,	.readdelay = rcu_read_delay,  /* just reuse rcu's version. */	.readunlock = sched_torture_read_unlock,	.completed = sched_torture_completed,	.deferredfree = rcu_sync_torture_deferred_free,	.sync = sched_torture_synchronize,	.stats = NULL,

?? 快捷鍵說明

復制代碼 Ctrl + C
搜索代碼 Ctrl + F
全屏模式 F11
切換主題 Ctrl + Shift + D
顯示快捷鍵 ?
增大字號 Ctrl + =
減小字號 Ctrl + -
亚洲欧美第一页_禁久久精品乱码_粉嫩av一区二区三区免费野_久草精品视频
午夜精品一区二区三区三上悠亚| 视频一区二区国产| 欧美日韩国产综合久久| 激情久久五月天| 亚洲一区二区三区四区在线| 久久综合色天天久久综合图片| 91欧美激情一区二区三区成人| 麻豆精品视频在线观看视频| 亚洲黄色av一区| 久久女同精品一区二区| 欧美日韩一二区| 91亚洲精品久久久蜜桃| 国产综合久久久久影院| 日本不卡的三区四区五区| 亚洲女爱视频在线| 国产欧美日韩精品一区| 日韩亚洲欧美一区二区三区| 色激情天天射综合网| 成人黄色电影在线| 国产黄色精品网站| 久久国产精品无码网站| 日一区二区三区| 一区二区高清免费观看影视大全| 国产精品久久久久久久久久久免费看| 欧美大片日本大片免费观看| 欧美日韩成人在线一区| 色94色欧美sute亚洲线路二| 岛国av在线一区| 国产成人在线色| 国产在线精品免费| 精品影院一区二区久久久| 日日噜噜夜夜狠狠视频欧美人 | 色欧美日韩亚洲| 成人一道本在线| 国产成人精品免费视频网站| 国产一区二区三区在线观看精品| 美女视频一区二区三区| 日韩av一区二| 美美哒免费高清在线观看视频一区二区 | 亚洲国产精品国自产拍av| 337p日本欧洲亚洲大胆色噜噜| 91精品蜜臀在线一区尤物| 欧美精品aⅴ在线视频| 欧美剧在线免费观看网站| 欧美日韩不卡在线| 欧美日韩国产123区| 69久久99精品久久久久婷婷 | 国产米奇在线777精品观看| 欧美aaaaaa午夜精品| 日本美女一区二区三区视频| 免费的成人av| 国产一区二区三区在线观看免费| 国产精品一区不卡| 成人激情小说网站| 色悠悠亚洲一区二区| 日本大香伊一区二区三区| 欧美午夜电影一区| 91麻豆精品国产91久久久| 欧美成人免费网站| 国产三级一区二区| 亚洲欧美福利一区二区| 亚洲无线码一区二区三区| 日韩av一级片| 国产福利视频一区二区三区| 99久久综合国产精品| 欧美午夜不卡视频| 2021国产精品久久精品| 亚洲国产精品激情在线观看| 亚洲激情六月丁香| 蜜桃视频一区二区| 粉嫩嫩av羞羞动漫久久久| 色综合视频在线观看| 欧美一三区三区四区免费在线看| 久久久久高清精品| 亚洲蜜臀av乱码久久精品蜜桃| 天堂在线亚洲视频| 国产a精品视频| 欧美在线观看你懂的| 精品欧美一区二区在线观看| 国产精品麻豆网站| 婷婷开心激情综合| 粉嫩aⅴ一区二区三区四区 | 在线成人午夜影院| 久久久精品免费网站| 亚洲午夜精品在线| 国产成人在线色| 欧美日韩国产免费| 中文字幕国产精品一区二区| 天堂久久久久va久久久久| 国产成人精品www牛牛影视| 欧美日韩在线播放一区| 国产日产精品1区| 亚洲bt欧美bt精品777| 成人午夜免费视频| 日韩一级黄色片| 亚洲精品成人a在线观看| 国产一区在线看| 欧美人牲a欧美精品| 中文字幕人成不卡一区| 美脚の诱脚舐め脚责91| 欧洲色大大久久| 国产精品视频观看| 久久不见久久见中文字幕免费| 色狠狠色狠狠综合| 中文字幕第一页久久| 九色综合狠狠综合久久| 欧美视频一区二区三区在线观看| 久久久精品国产99久久精品芒果| 五月天激情综合网| 91美女片黄在线观看| 欧美激情在线一区二区| 麻豆成人久久精品二区三区红| 在线免费视频一区二区| 国产精品久久三| 国模大尺度一区二区三区| 欧美日韩成人在线| 亚洲综合网站在线观看| 成人av资源在线观看| 2020日本不卡一区二区视频| 奇米一区二区三区| 欧美群妇大交群的观看方式| 亚洲人精品午夜| 波多野结衣亚洲| 亚洲国产成人私人影院tom| 国产精品亚洲专一区二区三区 | 亚洲乱码国产乱码精品精小说 | 欧洲激情一区二区| 亚洲日本丝袜连裤袜办公室| 国产成a人亚洲| 久久久久久亚洲综合| 狠狠久久亚洲欧美| 欧美精品一区二区久久婷婷| 免费高清成人在线| 欧美一区2区视频在线观看| 亚洲成人一二三| 在线成人小视频| 日本麻豆一区二区三区视频| 3atv在线一区二区三区| 男女性色大片免费观看一区二区| 91麻豆精品91久久久久同性| 青草国产精品久久久久久| 欧美一区二区三区免费视频 | 精品久久99ma| 精品一区二区免费看| 久久婷婷色综合| 国产传媒一区在线| 中文字幕不卡一区| 99久久伊人久久99| 一区二区三区蜜桃网| 欧美特级限制片免费在线观看| 无码av免费一区二区三区试看| 91精品国产综合久久久久| 久久精品国产亚洲5555| 国产亚洲1区2区3区| 99九九99九九九视频精品| 亚洲精品国产高清久久伦理二区| 欧美日韩中文国产| 精品在线免费观看| 国产精品对白交换视频| 欧美午夜不卡视频| 久久99久久久欧美国产| 国产欧美一区二区精品性| 91亚洲精品久久久蜜桃网站| 亚洲第一在线综合网站| 精品福利一二区| 91首页免费视频| 午夜精品免费在线| 久久先锋影音av鲁色资源网| 97精品电影院| 蜜臀久久99精品久久久画质超高清 | 亚洲精品一区在线观看| 国产老女人精品毛片久久| 中文字幕日韩精品一区| 欧美日本高清视频在线观看| 韩国成人福利片在线播放| 亚洲四区在线观看| 日韩欧美黄色影院| 97久久超碰国产精品| 青青草国产精品97视觉盛宴| 国产精品久线在线观看| 欧美日韩美女一区二区| 国产成人在线色| 三级成人在线视频| 中文字幕中文在线不卡住| 日韩亚洲欧美中文三级| 97久久超碰国产精品电影| 久久99精品视频| 一区二区三区精品| 国产欧美一区二区精品婷婷| 欧美日韩免费高清一区色橹橹| 懂色av中文字幕一区二区三区 | 蜜臀va亚洲va欧美va天堂| 国产精品毛片久久久久久| 欧美一级片在线| 91热门视频在线观看| 国精品**一区二区三区在线蜜桃| 亚洲在线观看免费| 日本一区二区久久| 久久女同精品一区二区| 欧美精品在线视频|