4 * Copyright (C) 1991, 1992 Linus Torvalds
7 #include <linux/init.h>
9 #include <linux/kdev_t.h>
10 #include <linux/slab.h>
11 #include <linux/string.h>
13 #include <linux/major.h>
14 #include <linux/errno.h>
15 #include <linux/module.h>
16 #include <linux/seq_file.h>
18 #include <linux/kobject.h>
19 #include <linux/kobj_map.h>
20 #include <linux/cdev.h>
21 #include <linux/mutex.h>
22 #include <linux/backing-dev.h>
23 #include <linux/tty.h>
27 static struct kobj_map *cdev_map;
29 static DEFINE_MUTEX(chrdevs_lock);
31 static struct char_device_struct {
32 struct char_device_struct *next;
34 unsigned int baseminor;
37 struct cdev *cdev; /* will die */
38 } *chrdevs[CHRDEV_MAJOR_HASH_SIZE];
40 /* index in the above */
41 static inline int major_to_index(unsigned major)
43 return major % CHRDEV_MAJOR_HASH_SIZE;
48 void chrdev_show(struct seq_file *f, off_t offset)
50 struct char_device_struct *cd;
52 if (offset < CHRDEV_MAJOR_HASH_SIZE) {
53 mutex_lock(&chrdevs_lock);
54 for (cd = chrdevs[offset]; cd; cd = cd->next)
55 seq_printf(f, "%3d %s\n", cd->major, cd->name);
56 mutex_unlock(&chrdevs_lock);
60 #endif /* CONFIG_PROC_FS */
63 * Register a single major with a specified minor range.
65 * If major == 0 this functions will dynamically allocate a major and return
68 * If major > 0 this function will attempt to reserve the passed range of
69 * minors and will return zero on success.
71 * Returns a -ve errno on failure.
73 static struct char_device_struct *
74 __register_chrdev_region(unsigned int major, unsigned int baseminor,
75 int minorct, const char *name)
77 struct char_device_struct *cd, **cp;
81 cd = kzalloc(sizeof(struct char_device_struct), GFP_KERNEL);
83 return ERR_PTR(-ENOMEM);
85 mutex_lock(&chrdevs_lock);
89 for (i = ARRAY_SIZE(chrdevs)-1; i > 0; i--) {
90 if (chrdevs[i] == NULL)
102 cd->baseminor = baseminor;
103 cd->minorct = minorct;
104 strlcpy(cd->name, name, sizeof(cd->name));
106 i = major_to_index(major);
108 for (cp = &chrdevs[i]; *cp; cp = &(*cp)->next)
109 if ((*cp)->major > major ||
110 ((*cp)->major == major &&
111 (((*cp)->baseminor >= baseminor) ||
112 ((*cp)->baseminor + (*cp)->minorct > baseminor))))
115 /* Check for overlapping minor ranges. */
116 if (*cp && (*cp)->major == major) {
117 int old_min = (*cp)->baseminor;
118 int old_max = (*cp)->baseminor + (*cp)->minorct - 1;
119 int new_min = baseminor;
120 int new_max = baseminor + minorct - 1;
122 /* New driver overlaps from the left. */
123 if (new_max >= old_min && new_max <= old_max) {
128 /* New driver overlaps from the right. */
129 if (new_min <= old_max && new_min >= old_min) {
137 mutex_unlock(&chrdevs_lock);
140 mutex_unlock(&chrdevs_lock);
145 static struct char_device_struct *
146 __unregister_chrdev_region(unsigned major, unsigned baseminor, int minorct)
148 struct char_device_struct *cd = NULL, **cp;
149 int i = major_to_index(major);
151 mutex_lock(&chrdevs_lock);
152 for (cp = &chrdevs[i]; *cp; cp = &(*cp)->next)
153 if ((*cp)->major == major &&
154 (*cp)->baseminor == baseminor &&
155 (*cp)->minorct == minorct)
161 mutex_unlock(&chrdevs_lock);
166 * register_chrdev_region() - register a range of device numbers
167 * @from: the first in the desired range of device numbers; must include
169 * @count: the number of consecutive device numbers required
170 * @name: the name of the device or driver.
172 * Return value is zero on success, a negative error code on failure.
174 int register_chrdev_region(dev_t from, unsigned count, const char *name)
176 struct char_device_struct *cd;
177 dev_t to = from + count;
180 for (n = from; n < to; n = next) {
181 next = MKDEV(MAJOR(n)+1, 0);
184 cd = __register_chrdev_region(MAJOR(n), MINOR(n),
192 for (n = from; n < to; n = next) {
193 next = MKDEV(MAJOR(n)+1, 0);
194 kfree(__unregister_chrdev_region(MAJOR(n), MINOR(n), next - n));
200 * alloc_chrdev_region() - register a range of char device numbers
201 * @dev: output parameter for first assigned number
202 * @baseminor: first of the requested range of minor numbers
203 * @count: the number of minor numbers required
204 * @name: the name of the associated device or driver
206 * Allocates a range of char device numbers. The major number will be
207 * chosen dynamically, and returned (along with the first minor number)
208 * in @dev. Returns zero or a negative error code.
210 int alloc_chrdev_region(dev_t *dev, unsigned baseminor, unsigned count,
213 struct char_device_struct *cd;
214 cd = __register_chrdev_region(0, baseminor, count, name);
217 *dev = MKDEV(cd->major, cd->baseminor);
222 * __register_chrdev() - create and register a cdev occupying a range of minors
223 * @major: major device number or 0 for dynamic allocation
224 * @baseminor: first of the requested range of minor numbers
225 * @count: the number of minor numbers required
226 * @name: name of this range of devices
227 * @fops: file operations associated with this devices
229 * If @major == 0 this functions will dynamically allocate a major and return
232 * If @major > 0 this function will attempt to reserve a device with the given
233 * major number and will return zero on success.
235 * Returns a -ve errno on failure.
237 * The name of this device has nothing to do with the name of the device in
238 * /dev. It only helps to keep track of the different owners of devices. If
239 * your module name has only one type of devices it's ok to use e.g. the name
240 * of the module here.
242 int __register_chrdev(unsigned int major, unsigned int baseminor,
243 unsigned int count, const char *name,
244 const struct file_operations *fops)
246 struct char_device_struct *cd;
250 cd = __register_chrdev_region(major, baseminor, count, name);
258 cdev->owner = fops->owner;
260 kobject_set_name(&cdev->kobj, "%s", name);
262 err = cdev_add(cdev, MKDEV(cd->major, baseminor), count);
268 return major ? 0 : cd->major;
270 kobject_put(&cdev->kobj);
272 kfree(__unregister_chrdev_region(cd->major, baseminor, count));
277 * unregister_chrdev_region() - return a range of device numbers
278 * @from: the first in the range of numbers to unregister
279 * @count: the number of device numbers to unregister
281 * This function will unregister a range of @count device numbers,
282 * starting with @from. The caller should normally be the one who
283 * allocated those numbers in the first place...
285 void unregister_chrdev_region(dev_t from, unsigned count)
287 dev_t to = from + count;
290 for (n = from; n < to; n = next) {
291 next = MKDEV(MAJOR(n)+1, 0);
294 kfree(__unregister_chrdev_region(MAJOR(n), MINOR(n), next - n));
299 * __unregister_chrdev - unregister and destroy a cdev
300 * @major: major device number
301 * @baseminor: first of the range of minor numbers
302 * @count: the number of minor numbers this cdev is occupying
303 * @name: name of this range of devices
305 * Unregister and destroy the cdev occupying the region described by
306 * @major, @baseminor and @count. This function undoes what
307 * __register_chrdev() did.
309 void __unregister_chrdev(unsigned int major, unsigned int baseminor,
310 unsigned int count, const char *name)
312 struct char_device_struct *cd;
314 cd = __unregister_chrdev_region(major, baseminor, count);
320 static DEFINE_SPINLOCK(cdev_lock);
322 static struct kobject *cdev_get(struct cdev *p)
324 struct module *owner = p->owner;
325 struct kobject *kobj;
327 if (owner && !try_module_get(owner))
329 kobj = kobject_get(&p->kobj);
335 void cdev_put(struct cdev *p)
338 struct module *owner = p->owner;
339 kobject_put(&p->kobj);
345 * Called every time a character special file is opened
347 static int chrdev_open(struct inode *inode, struct file *filp)
349 const struct file_operations *fops;
351 struct cdev *new = NULL;
354 spin_lock(&cdev_lock);
357 struct kobject *kobj;
359 spin_unlock(&cdev_lock);
360 kobj = kobj_lookup(cdev_map, inode->i_rdev, &idx);
363 new = container_of(kobj, struct cdev, kobj);
364 spin_lock(&cdev_lock);
365 /* Check i_cdev again in case somebody beat us to it while
366 we dropped the lock. */
369 inode->i_cdev = p = new;
370 list_add(&inode->i_devices, &p->list);
372 } else if (!cdev_get(p))
374 } else if (!cdev_get(p))
376 spin_unlock(&cdev_lock);
382 fops = fops_get(p->ops);
386 replace_fops(filp, fops);
387 if (filp->f_op->open) {
388 ret = filp->f_op->open(inode, filp);
400 void cd_forget(struct inode *inode)
402 spin_lock(&cdev_lock);
403 list_del_init(&inode->i_devices);
404 inode->i_cdev = NULL;
405 spin_unlock(&cdev_lock);
408 static void cdev_purge(struct cdev *cdev)
410 spin_lock(&cdev_lock);
411 while (!list_empty(&cdev->list)) {
413 inode = container_of(cdev->list.next, struct inode, i_devices);
414 list_del_init(&inode->i_devices);
415 inode->i_cdev = NULL;
417 spin_unlock(&cdev_lock);
421 * Dummy default file-operations: the only thing this does
422 * is contain the open that then fills in the correct operations
423 * depending on the special file...
425 const struct file_operations def_chr_fops = {
427 .llseek = noop_llseek,
430 static struct kobject *exact_match(dev_t dev, int *part, void *data)
432 struct cdev *p = data;
436 static int exact_lock(dev_t dev, void *data)
438 struct cdev *p = data;
439 return cdev_get(p) ? 0 : -1;
443 * cdev_add() - add a char device to the system
444 * @p: the cdev structure for the device
445 * @dev: the first device number for which this device is responsible
446 * @count: the number of consecutive minor numbers corresponding to this
449 * cdev_add() adds the device represented by @p to the system, making it
450 * live immediately. A negative error code is returned on failure.
452 int cdev_add(struct cdev *p, dev_t dev, unsigned count)
459 error = kobj_map(cdev_map, dev, count, NULL,
460 exact_match, exact_lock, p);
464 kobject_get(p->kobj.parent);
469 static void cdev_unmap(dev_t dev, unsigned count)
471 kobj_unmap(cdev_map, dev, count);
475 * cdev_del() - remove a cdev from the system
476 * @p: the cdev structure to be removed
478 * cdev_del() removes @p from the system, possibly freeing the structure
481 void cdev_del(struct cdev *p)
483 cdev_unmap(p->dev, p->count);
484 kobject_put(&p->kobj);
488 static void cdev_default_release(struct kobject *kobj)
490 struct cdev *p = container_of(kobj, struct cdev, kobj);
491 struct kobject *parent = kobj->parent;
497 static void cdev_dynamic_release(struct kobject *kobj)
499 struct cdev *p = container_of(kobj, struct cdev, kobj);
500 struct kobject *parent = kobj->parent;
507 static struct kobj_type ktype_cdev_default = {
508 .release = cdev_default_release,
511 static struct kobj_type ktype_cdev_dynamic = {
512 .release = cdev_dynamic_release,
516 * cdev_alloc() - allocate a cdev structure
518 * Allocates and returns a cdev structure, or NULL on failure.
520 struct cdev *cdev_alloc(void)
522 struct cdev *p = kzalloc(sizeof(struct cdev), GFP_KERNEL);
524 INIT_LIST_HEAD(&p->list);
525 kobject_init(&p->kobj, &ktype_cdev_dynamic);
531 * cdev_init() - initialize a cdev structure
532 * @cdev: the structure to initialize
533 * @fops: the file_operations for this device
535 * Initializes @cdev, remembering @fops, making it ready to add to the
536 * system with cdev_add().
538 void cdev_init(struct cdev *cdev, const struct file_operations *fops)
540 memset(cdev, 0, sizeof *cdev);
541 INIT_LIST_HEAD(&cdev->list);
542 kobject_init(&cdev->kobj, &ktype_cdev_default);
546 static struct kobject *base_probe(dev_t dev, int *part, void *data)
548 if (request_module("char-major-%d-%d", MAJOR(dev), MINOR(dev)) > 0)
549 /* Make old-style 2.4 aliases work */
550 request_module("char-major-%d", MAJOR(dev));
554 void __init chrdev_init(void)
556 cdev_map = kobj_map_init(base_probe, &chrdevs_lock);
560 /* Let modules do char dev stuff */
561 EXPORT_SYMBOL(register_chrdev_region);
562 EXPORT_SYMBOL(unregister_chrdev_region);
563 EXPORT_SYMBOL(alloc_chrdev_region);
564 EXPORT_SYMBOL(cdev_init);
565 EXPORT_SYMBOL(cdev_alloc);
566 EXPORT_SYMBOL(cdev_del);
567 EXPORT_SYMBOL(cdev_add);
568 EXPORT_SYMBOL(__register_chrdev);
569 EXPORT_SYMBOL(__unregister_chrdev);