LDD3 scull内存驱动程序改写

       对于第三章的内容,所用设备数据结构有点复杂,从数据操作中解脱出来应该更好理解。

       1、只建立一个设备scull

       2、将数据区域直接改成一个1000的字符数组

       3、实现功能:open,close,read,write,llseek

红色字体为改动的地方:

 

头文件源码

#ifndef _SCULL_H_
#define _SCULL_H_

#include <linux/ioctl.h> /* needed for the _IOW etc stuff used later */

#ifndef SCULL_MAJOR
#define SCULL_MAJOR 0   /* dynamic major by default */
#endif

#ifndef SCULL_NR_DEVS
#define SCULL_NR_DEVS 1    /* scull */
#endif

#ifndef SCULL_P_NR_DEVS
#define SCULL_P_NR_DEVS 1  /* scullpipe0 through scullpipe3 */
#endif

/*
 * The pipe device is a simple circular buffer. Here its default size
 */
#ifndef SCULL_P_BUFFER
#define SCULL_P_BUFFER 4000
#endif

/*
 * Representation of scull quantum sets.
 */
#define Data_Len 1000
struct scull_dev {
 char data[Data_Len];
 struct semaphore sem;     /* mutual exclusion semaphore     */
 struct cdev cdev;   /* Char device structure  */
};


/*
 * The different configurable parameters
 */
extern int scull_major;     /* main.c */
extern int scull_nr_devs;


/*
 * Prototypes for shared functions
 */

ssize_t scull_read(struct file *filp, char __user *buf, size_t count,
                   loff_t *f_pos);
ssize_t scull_write(struct file *filp, const char __user *buf, size_t count,
                    loff_t *f_pos);
loff_t  scull_llseek(struct file *filp, loff_t off, int whence);

 

 

主文件源码:

/*
 * main.c -- the bare scull char module
 *
 * Copyright (C) 2001 Alessandro Rubini and Jonathan Corbet
 * Copyright (C) 2001 O'Reilly & Associates
 *
 * The source code in this file can be freely used, adapted,
 * and redistributed in source or binary form, so long as an
 * acknowledgment appears in derived source files.  The citation
 * should list that the code comes from the book "Linux Device
 * Drivers" by Alessandro Rubini and Jonathan Corbet, published
 * by O'Reilly & Associates.   No warranty is attached;
 * we cannot take responsibility for errors or fitness for use.
 *
 */

#include <linux/config.h>
#include <linux/module.h>
#include <linux/moduleparam.h>
#include <linux/init.h>

#include <linux/kernel.h> /* printk() */
#include <linux/slab.h>  /* kmalloc() */
#include <linux/fs.h>  /* everything... */
#include <linux/errno.h> /* error codes */
#include <linux/types.h> /* size_t */
#include <linux/proc_fs.h>
#include <linux/fcntl.h> /* O_ACCMODE */
#include <linux/seq_file.h>
#include <linux/cdev.h>

#include <asm/system.h>  /* cli(), *_flags */
#include <asm/uaccess.h> /* copy_*_user */

#include "scull.h"  /* local definitions */

/*
 * Our parameters which can be set at load time.
 */

int scull_major =   SCULL_MAJOR;
int scull_minor =   0;
int scull_nr_devs = SCULL_NR_DEVS; /* number of bare scull devices */

module_param(scull_major, int, S_IRUGO);
module_param(scull_minor, int, S_IRUGO);
module_param(scull_nr_devs, int, S_IRUGO);

MODULE_AUTHOR("Alessandro Rubini, Jonathan Corbet");
MODULE_LICENSE("Dual BSD/GPL");

struct scull_dev *scull_devices; /* allocated in scull_init_module */

/*
 * Open and close
 */

int scull_open(struct inode *inode, struct file *filp)
{
 struct scull_dev *dev; /* device information */

 dev = container_of(inode->i_cdev, struct scull_dev, cdev);
 filp->private_data = dev; /* for other methods */

 /* now trim to 0 the length of the device if open was write-only */
 if ( (filp->f_flags & O_ACCMODE) == O_WRONLY) {
  if (down_interruptible(&dev->sem))
   return -ERESTARTSYS;
  up(&dev->sem);
 }
 return 0;          /* success */
}

int scull_release(struct inode *inode, struct file *filp)
{
 return 0;
}
/*
 * Data management: read and write
 */

ssize_t scull_read(struct file *filp, char __user *buf, size_t count,
                loff_t *f_pos)
{
 struct scull_dev *dev = filp->private_data;
 ssize_t retval = 0;

 if (down_interruptible(&dev->sem))
  return -ERESTARTSYS;


 if((*f_pos)>= Data_Len)
  goto out;
 if(((*f_pos)+count)>= Data_Len)
  {
   count= Data_Len-(*f_pos);
  }
 if (copy_to_user(buf, dev->data, count))
  {
   retval = -EFAULT;
   goto out;
  }
 (*f_pos)+=count;
 retval= count;

 

 out:
 up(&dev->sem);
 
 return retval;


}

ssize_t scull_write(struct file *filp, const char __user *buf, size_t count,
                loff_t *f_pos)
{
 struct scull_dev *dev = filp->private_data;
 ssize_t retval = -ENOMEM; /* value used in "goto out" statements */

 if (down_interruptible(&dev->sem))
  return -ERESTARTSYS;


 if((*f_pos+count)>=Data_Len)
  {
  count= Data_Len-(*f_pos);
  }
   if (copy_from_user(&(dev->data[*f_pos]), buf, count)) {
    retval = -EFAULT;
    goto out;
   }
   *f_pos += count;
   retval = count;

 
 out:
   up(&dev->sem
);
   return retval;

}

/*
 * The "extended" operations -- only seek
 */

loff_t scull_llseek(struct file *filp, loff_t off, int whence)
{
 struct scull_dev *dev = filp->private_data;
 loff_t newpos;

 switch(whence) {
   case 0: /* SEEK_SET */
  newpos = off;
  break;

   case 1: /* SEEK_CUR */
  newpos = filp->f_pos + off;
  break;

   case 2: /* SEEK_END */
  newpos = Data_Len;
  break;

   default: /* can't happen */
  return -EINVAL;
 }
 if (newpos < 0) return -EINVAL;
 filp->f_pos = newpos;
 return newpos;
}

 

struct file_operations scull_fops = {
 .owner   =   THIS_MODULE,
 .llseek  = scull_llseek,
 .read    =  scull_read,
 .write   =   scull_write,
 .ioctl   =   NULL,//  scull_ioctl,
 .open   =   scull_open,
 .release  =   scull_release,
};

/*
 * Finally, the module stuff
 */

/*
 * The cleanup function is used to handle initialization failures as well.
 * Thefore, it must be careful to work correctly even if some of the items
 * have not been initialized
 */
void scull_cleanup_module(void)
{
 int i;
 dev_t devno = MKDEV(scull_major, scull_minor);

 /* Get rid of our char dev entries */
 if (scull_devices) {
  for (i = 0; i < scull_nr_devs; i++) {
   cdev_del(&scull_devices[i].cdev);
  }
  kfree(scull_devices);
 }

 /* cleanup_module is never called if registering failed */
 unregister_chrdev_region(devno, scull_nr_devs);

}


/*
 * Set up the char_dev structure for this device.
 */
static void scull_setup_cdev(struct scull_dev *dev, int index)
{
 int err, devno = MKDEV(scull_major, scull_minor + index);
   
 cdev_init(&dev->cdev, &scull_fops);
 dev->cdev.owner = THIS_MODULE;
 dev->cdev.ops = &scull_fops;
 err = cdev_add (&dev->cdev, devno, 1);
 /* Fail gracefully if need be */
 if (err)
  printk(KERN_NOTICE "Error %d adding scull%d", err, index);
}


int scull_init_module(void)
{
 int result, i;
 dev_t dev = 0;

/*
 * Get a range of minor numbers to work with, asking for a dynamic
 * major unless directed otherwise at load time.
 */
 if (scull_major) {
  dev = MKDEV(scull_major, scull_minor);
  result = register_chrdev_region(dev, scull_nr_devs, "scull");
 } else {
  result = alloc_chrdev_region(&dev, scull_minor, scull_nr_devs,
    "scull");
  scull_major = MAJOR(dev);
 }
 if (result < 0) {
  printk(KERN_WARNING "scull: can't get major %d/n", scull_major);
  return result;
 }

        /*
  * allocate the devices -- we can't have them static, as the number
  * can be specified at load time
  */
 scull_devices = kmalloc(scull_nr_devs * sizeof(struct scull_dev), GFP_KERNEL);
 if (!scull_devices) {
  result = -ENOMEM;
  goto fail;  /* Make this more graceful */
 }
 memset(scull_devices, 0, scull_nr_devs * sizeof(struct scull_dev));

        /* Initialize each device. */
 init_MUTEX(scull_devices->sem);
 scull_setup_cdev(scull_devices, 0);


 return 0; /* succeed */

  fail:
 scull_cleanup_module();
 return result;
}

module_init(scull_init_module);
module_exit(scull_cleanup_module);

 

测试程序:

#include <stdio.h>
#include <fcntl.h>
#include <stdlib.h>
#include <errno.h>
#include <string.h>
#define Scull_Device "/dev/scull"
#define Data_Num 100
int main(void)
{
 int fscull;
 int bytesize=0;
 char buff[Data_Num]="i am here ,ericjiang";
 
 fscull=open(Scull_Device,O_RDWR);
 if(fscull== -1)
  {
   perror("open scull device fail!/n");
   return -1;
  }
 sleep(5);
 bytesize=write(fscull,buff,strlen(buff));
 printf("write data byte==%d/n",bytesize);
 buff[0]='a';
 buff[1]='a';
 buff[2]='a';
 buff[3]='a';
 buff[4]='a';
 buff[5]='a';
 buff[6]='a';
 buff[7]='a';
 buff[8]='a';
 buff[9]='a'; 
 lseek(fscull,0,SEEK_SET);
 bytesize=read(fscull,buff,5);
 sleep(5);
 printf("read data byte==%d/n",bytesize);
 printf("str==%s/n",buff);

 close(fscull);
 return 0;

}

 

试验:

make

insmod scull.ko                                  //插入模块

mknod /dev/scull c 253 0                   //建立节点 

 

gcc -o scull_test scull_test.c             //编译测试程序

./scull_test                                        //测试

write data byte==20

read data byte==5

str==i am aaaaa ericjiang

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
1 目标检测的定义 目标检测(Object Detection)的任务是找出图像中所有感兴趣的目标(物体),确定它们的类别和位置,是计算机视觉领域的核心问题之一。由于各类物体有不同的外观、形状和姿态,加上成像时光照、遮挡等因素的干扰,目标检测一直是计算机视觉领域最具有挑战性的问题。 目标检测任务可分为两个关键的子任务,目标定位和目标分类。首先检测图像中目标的位置(目标定位),然后给出每个目标的具体类别(目标分类)。输出结果是一个边界框(称为Bounding-box,一般形式为(x1,y1,x2,y2),表示框的左上角坐标和右下角坐标),一个置信度分数(Confidence Score),表示边界框中是否包含检测对象的概率和各个类别的概率(首先得到类别概率,经过Softmax可得到类别标签)。 1.1 Two stage方法 目前主流的基于深度学习的目标检测算法主要分为两类:Two stage和One stage。Two stage方法将目标检测过程分为两个阶段。第一个阶段是 Region Proposal 生成阶段,主要用于生成潜在的目标候选框(Bounding-box proposals)。这个阶段通常使用卷积神经网络(CNN)从输入图像中提取特征,然后通过一些技巧(如选择性搜索)来生成候选框。第二个阶段是分类和位置精修阶段,将第一个阶段生成的候选框输入到另一个 CNN 中进行分类,并根据分类结果对候选框的位置进行微调。Two stage 方法的优点是准确度较高,缺点是速度相对较慢。 常见Tow stage目标检测算法有:R-CNN系列、SPPNet等。 1.2 One stage方法 One stage方法直接利用模型提取特征值,并利用这些特征值进行目标的分类和定位,不需要生成Region Proposal。这种方法的优点是速度快,因为省略了Region Proposal生成的过程。One stage方法的缺点是准确度相对较低,因为它没有对潜在的目标进行预先筛选。 常见的One stage目标检测算法有:YOLO系列、SSD系列和RetinaNet等。 2 常见名词解释 2.1 NMS(Non-Maximum Suppression) 目标检测模型一般会给出目标的多个预测边界框,对成百上千的预测边界框都进行调整肯定是不可行的,需要对这些结果先进行一个大体的挑选。NMS称为非极大值抑制,作用是从众多预测边界框中挑选出最具代表性的结果,这样可以加快算法效率,其主要流程如下: 设定一个置信度分数阈值,将置信度分数小于阈值的直接过滤掉 将剩下框的置信度分数从大到小排序,选中值最大的框 遍历其余的框,如果和当前框的重叠面积(IOU)大于设定的阈值(一般为0.7),就将框删除(超过设定阈值,认为两个框的里面的物体属于同一个类别) 从未处理的框中继续选一个置信度分数最大的,重复上述过程,直至所有框处理完毕 2.2 IoU(Intersection over Union) 定义了两个边界框的重叠度,当预测边界框和真实边界框差异很小时,或重叠度很大时,表示模型产生的预测边界框很准确。边界框A、B的IOU计算公式为: 2.3 mAP(mean Average Precision) mAP即均值平均精度,是评估目标检测模型效果的最重要指标,这个值介于0到1之间,且越大越好。mAP是AP(Average Precision)的平均值,那么首先需要了解AP的概念。想要了解AP的概念,还要首先了解目标检测中Precision和Recall的概念。 首先我们设置置信度阈值(Confidence Threshold)和IoU阈值(一般设置为0.5,也会衡量0.75以及0.9的mAP值): 当一个预测边界框被认为是True Positive(TP)时,需要同时满足下面三个条件: Confidence Score > Confidence Threshold 预测类别匹配真实值(Ground truth)的类别 预测边界框的IoU大于设定的IoU阈值 不满足条件2或条件3,则认为是False Positive(FP)。当对应同一个真值有多个预测结果时,只有最高置信度分数的预测结果被认为是True Positive,其余被认为是False Positive。 Precision和Recall的概念如下图所示: Precision表示TP与预测边界框数量的比值 Recall表示TP与真实边界框数量的比值 改变不同的置信度阈值,可以获得多组Precision和Recall,Recall放X轴,Precision放Y轴,可以画出一个Precision-Recall曲线,简称P-R
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值