nommu.c 3.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144
  1. /* nommu.c: mmu-less memory info files
  2. *
  3. * Copyright (C) 2004 Red Hat, Inc. All Rights Reserved.
  4. * Written by David Howells (dhowells@redhat.com)
  5. *
  6. * This program is free software; you can redistribute it and/or
  7. * modify it under the terms of the GNU General Public License
  8. * as published by the Free Software Foundation; either version
  9. * 2 of the License, or (at your option) any later version.
  10. */
  11. #include <linux/init.h>
  12. #include <linux/module.h>
  13. #include <linux/errno.h>
  14. #include <linux/time.h>
  15. #include <linux/kernel.h>
  16. #include <linux/string.h>
  17. #include <linux/mman.h>
  18. #include <linux/proc_fs.h>
  19. #include <linux/mm.h>
  20. #include <linux/mmzone.h>
  21. #include <linux/pagemap.h>
  22. #include <linux/swap.h>
  23. #include <linux/slab.h>
  24. #include <linux/smp.h>
  25. #include <linux/seq_file.h>
  26. #include <linux/hugetlb.h>
  27. #include <linux/vmalloc.h>
  28. #include <asm/uaccess.h>
  29. #include <asm/pgtable.h>
  30. #include <asm/tlb.h>
  31. #include <asm/div64.h>
  32. #include "internal.h"
  33. /*
  34. * display a single VMA to a sequenced file
  35. */
  36. int nommu_vma_show(struct seq_file *m, struct vm_area_struct *vma)
  37. {
  38. unsigned long ino = 0;
  39. struct file *file;
  40. dev_t dev = 0;
  41. int flags, len;
  42. flags = vma->vm_flags;
  43. file = vma->vm_file;
  44. if (file) {
  45. struct inode *inode = vma->vm_file->f_path.dentry->d_inode;
  46. dev = inode->i_sb->s_dev;
  47. ino = inode->i_ino;
  48. }
  49. seq_printf(m,
  50. "%08lx-%08lx %c%c%c%c %08lx %02x:%02x %lu %n",
  51. vma->vm_start,
  52. vma->vm_end,
  53. flags & VM_READ ? 'r' : '-',
  54. flags & VM_WRITE ? 'w' : '-',
  55. flags & VM_EXEC ? 'x' : '-',
  56. flags & VM_MAYSHARE ? flags & VM_SHARED ? 'S' : 's' : 'p',
  57. vma->vm_pgoff << PAGE_SHIFT,
  58. MAJOR(dev), MINOR(dev), ino, &len);
  59. if (file) {
  60. len = 25 + sizeof(void *) * 6 - len;
  61. if (len < 1)
  62. len = 1;
  63. seq_printf(m, "%*c", len, ' ');
  64. seq_path(m, file->f_path.mnt, file->f_path.dentry, "");
  65. }
  66. seq_putc(m, '\n');
  67. return 0;
  68. }
  69. /*
  70. * display a list of all the VMAs the kernel knows about
  71. * - nommu kernals have a single flat list
  72. */
  73. static int nommu_vma_list_show(struct seq_file *m, void *v)
  74. {
  75. struct vm_area_struct *vma;
  76. vma = rb_entry((struct rb_node *) v, struct vm_area_struct, vm_rb);
  77. return nommu_vma_show(m, vma);
  78. }
  79. static void *nommu_vma_list_start(struct seq_file *m, loff_t *_pos)
  80. {
  81. struct rb_node *_rb;
  82. loff_t pos = *_pos;
  83. void *next = NULL;
  84. down_read(&nommu_vma_sem);
  85. for (_rb = rb_first(&nommu_vma_tree); _rb; _rb = rb_next(_rb)) {
  86. if (pos == 0) {
  87. next = _rb;
  88. break;
  89. }
  90. pos--;
  91. }
  92. return next;
  93. }
  94. static void nommu_vma_list_stop(struct seq_file *m, void *v)
  95. {
  96. up_read(&nommu_vma_sem);
  97. }
  98. static void *nommu_vma_list_next(struct seq_file *m, void *v, loff_t *pos)
  99. {
  100. (*pos)++;
  101. return rb_next((struct rb_node *) v);
  102. }
  103. static struct seq_operations proc_nommu_vma_list_seqop = {
  104. .start = nommu_vma_list_start,
  105. .next = nommu_vma_list_next,
  106. .stop = nommu_vma_list_stop,
  107. .show = nommu_vma_list_show
  108. };
  109. static int proc_nommu_vma_list_open(struct inode *inode, struct file *file)
  110. {
  111. return seq_open(file, &proc_nommu_vma_list_seqop);
  112. }
  113. static const struct file_operations proc_nommu_vma_list_operations = {
  114. .open = proc_nommu_vma_list_open,
  115. .read = seq_read,
  116. .llseek = seq_lseek,
  117. .release = seq_release,
  118. };
  119. static int __init proc_nommu_init(void)
  120. {
  121. create_seq_entry("maps", S_IRUGO, &proc_nommu_vma_list_operations);
  122. return 0;
  123. }
  124. module_init(proc_nommu_init);