内核并发竞态解决机制
来源:互联网 发布:逆回购 知乎 编辑:程序博客网 时间:2024/06/06 11:01
#include <linux/init.h>#include <linux/module.h>#include <linux/kernel.h>#include <linux/version.h>#include <asm/io.h>#include <linux/fs.h>#include <linux/cdev.h>#include <linux/slab.h>#include <asm/uaccess.h> #include <linux/highmem.h> #include <asm/kmap_types.h>MODULE_LICENSE("Dual BSD/GPL");MODULE_DESCRIPTION("a simple driver example!");struct fifo{dev_t num;struct cdev cdev;//int available;atomic_t available;//struct mutex lock;//spinlock_t lock;//queue propertychar *qbuf;int start; //posint end; //posint cursize;int maxsize;}FIFO;static int fifo_open(struct inode *inodep, struct file *filep){//printk("fifo open called\n");//local_irq_disable();//mutex_lock(&FIFO.lock);//spin_lock(&FIFO.lock);//if(FIFO.available)//{//FIFO.available = 0;//local_irq_enable();//mutex_unlock(&FIFO.lock);//spin_unlock(&FIFO.lock);if(0 == atomic_dec_and_test(&FIFO.available))return 0;//}//local_irq_enable();//mutex_unlock(&FIFO.lock);//spin_unlock(&FIFO.lock);atomic_inc(&FIFO.available, 1);return -EBUSY;}static ssize_t fifo_read (struct file *f, char __user *p, size_t n, loff_t *off){int size = n>FIFO.cursize?FIFO.cursize:n;if(size == 0)return 0;int len1, len2;if(FIFO.start <= FIFO.end)// copy once{if(copy_to_user(p, FIFO.qbuf, size)){printk("copy to user fail1\n");return -EINVAL;}}else{len1 = FIFO.maxsize-FIFO.start;if(copy_to_user(p, &FIFO.qbuf[FIFO.start], len1)){printk("copy to user fail2\n");return -EINVAL;}len2 = size-len1;if(copy_to_user(p+len1, FIFO.qbuf, len2)){printk("copy to user fail3\n");return -EINVAL;}}FIFO.start = (FIFO.start+size)%FIFO.maxsize;FIFO.cursize -= size;return size;}static ssize_t fifo_write (struct file *f, const char __user *p, size_t n, loff_t *off){int space = FIFO.maxsize - FIFO.cursize;int size = n>space?space:n;int len1 = (FIFO.maxsize-1 - FIFO.end);int len2;if(!space)return 0;//copy_from_user(&FIFO.qbuf[end+1], p, size);if(len1 >= size)//copy once{if(copy_from_user(&FIFO.qbuf[FIFO.end+1], p, size)){printk("copy from user fail1\n");return -EINVAL;}}else{if(copy_from_user(&FIFO.qbuf[FIFO.end+1], p, len1)){printk("copy from user fail2\n");return -EINVAL;}len2 = size-len1;if(copy_from_user(FIFO.qbuf, p+len1, len2)){printk("copy from user fail3\n");return -EINVAL;}}FIFO.end = (FIFO.end+size)%FIFO.maxsize;FIFO.cursize += size;return size;}static long fifo_ioctl(struct file *f, unsigned int cmd, unsigned long arg){return 0;}static int fifo_release(struct inode *inodep, struct file *filep){//printk("fifo closed\n");//FIFO.available = 1;atomic_inc(&FIFO.available, 1);return 0;}int fifo_mmap(struct file *f, struct vm_area_struct *vma){return remap_pfn_range(vma, vma->vm_start, virt_to_phys(FIFO.qbuf)>>PAGE_SHIFT, vma->vm_end-vma->vm_start, vma->vm_page_prot);}struct file_operations myops = {.owner = THIS_MODULE,.open = fifo_open,.unlocked_ioctl = fifo_ioctl,.read = fifo_read,.write = fifo_write,.mmap = fifo_mmap,.release = fifo_release};static int __init mymodule_init(void){int ret = 0;printk("fifo module in\n");//FIFO.available = 1;atomic_init(&FIFO.available, 1);//mutex_init(&FIFO.lock);//spin_lock_init(&FIFO.lock);FIFO.qbuf = (char*)__get_free_page(GFP_KERNEL);FIFO.maxsize = 1<<PAGE_SHIFT;FIFO.cursize = FIFO.start = 0;FIFO.end = -1;//request dev numret = alloc_chrdev_region(&FIFO.num, 0, 1, "fifodddddddddd");if(ret){printk("devnum alloc fail!\n");return ret;}printk("num: %d\n", MAJOR(FIFO.num) );//create cdev object#if 0FIFO.mycdev = cdev_alloc();if(NULL==fifo.mycdev){printk("alloc cdev fail!\n");goto cdev_alloc_out;}#endif//init cdev opscdev_init(&FIFO.cdev, &myops);FIFO.cdev.owner = THIS_MODULE;//register cdev into kernelret = cdev_add(&FIFO.cdev, FIFO.num, 1);if(ret){printk("add cdev fail!\n");goto cdev_add_out;}return 0;cdev_add_out:#if 0kfree(FIFO.mycdev);#endif//cdev_alloc_out:unregister_chrdev_region(FIFO.num, 1);return ret;}static void __exit mymodule_exit(void){//unregister cdev from kernelcdev_del(&FIFO.cdev);#if 0//release cdev objectkfree(&FIFO.cdev);#endif//release dev numunregister_chrdev_region(FIFO.num, 1); free_page((unsigned long)FIFO.qbuf);printk("fifo module release\n");}module_init(mymodule_init);module_exit(mymodule_exit);
总结:
1. 屏蔽本地中断
2. 互斥锁
3. 信号量
4. 自旋锁
5. 原子操作
0 0
- 内核并发竞态解决机制
- Linux内核并发机制
- 内核中的并发处理机制
- 并发基础 -- Linux 内核同步机制
- 内核竞态同步机制
- linux内核的并发与竞态
- linux内核并发与竞态
- 并发与竞态及解决途径
- 并发与竞态及解决途径
- 并发与竞态及解决途径
- 【内核&驱动】并发和竞态【1】
- 《Linux内核并发与竞态》分析Linux2.6.29内核死锁
- Linux 并发、竞态管理的实现机制
- 用同步机制解决多线程并发所产生的问题
- 利用锁机制解决并发下的数据不准确
- linux内核并发和竟态:
- Driver:内核的竞态和并发:中断屏蔽、原子操作、自旋锁、信号量
- Linux内核的并发
- CSS font-family常见中文字体对应的英文名称
- 【笔试面试】简单总结笔试和面试中的海量数据问题
- 解决高德地图the map must have a size 错误
- android http post提交数据
- HiveSQL 进阶指南
- 内核并发竞态解决机制
- Android---keycode
- 跟小博老师一起学习数据库 ——JDBC-上篇
- hadoop日志
- JAVA-练习MyShopping升级菜单切换
- Chrome学习笔记(二):UI组件,皮肤引擎
- linux下shell脚本学习
- hadoop三种启动方式
- Chrome学习笔记(三):UI组件,皮肤引擎