mmap.c 2.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125
  1. /*
  2. * arch/sh/mm/mmap.c
  3. *
  4. * Copyright (C) 2008 Paul Mundt
  5. *
  6. * This file is subject to the terms and conditions of the GNU General Public
  7. * License. See the file "COPYING" in the main directory of this archive
  8. * for more details.
  9. */
  10. #include <linux/io.h>
  11. #include <linux/mm.h>
  12. #include <linux/mman.h>
  13. #include <linux/module.h>
  14. #include <asm/page.h>
  15. #include <asm/processor.h>
  16. #ifdef CONFIG_MMU
  17. unsigned long shm_align_mask = PAGE_SIZE - 1; /* Sane caches */
  18. EXPORT_SYMBOL(shm_align_mask);
  19. /*
  20. * To avoid cache aliases, we map the shared page with same color.
  21. */
  22. #define COLOUR_ALIGN(addr, pgoff) \
  23. ((((addr) + shm_align_mask) & ~shm_align_mask) + \
  24. (((pgoff) << PAGE_SHIFT) & shm_align_mask))
  25. unsigned long arch_get_unmapped_area(struct file *filp, unsigned long addr,
  26. unsigned long len, unsigned long pgoff, unsigned long flags)
  27. {
  28. struct mm_struct *mm = current->mm;
  29. struct vm_area_struct *vma;
  30. unsigned long start_addr;
  31. int do_colour_align;
  32. if (flags & MAP_FIXED) {
  33. /* We do not accept a shared mapping if it would violate
  34. * cache aliasing constraints.
  35. */
  36. if ((flags & MAP_SHARED) && (addr & shm_align_mask))
  37. return -EINVAL;
  38. return addr;
  39. }
  40. if (unlikely(len > TASK_SIZE))
  41. return -ENOMEM;
  42. do_colour_align = 0;
  43. if (filp || (flags & MAP_SHARED))
  44. do_colour_align = 1;
  45. if (addr) {
  46. if (do_colour_align)
  47. addr = COLOUR_ALIGN(addr, pgoff);
  48. else
  49. addr = PAGE_ALIGN(addr);
  50. vma = find_vma(mm, addr);
  51. if (TASK_SIZE - len >= addr &&
  52. (!vma || addr + len <= vma->vm_start))
  53. return addr;
  54. }
  55. if (len > mm->cached_hole_size) {
  56. start_addr = addr = mm->free_area_cache;
  57. } else {
  58. mm->cached_hole_size = 0;
  59. start_addr = addr = TASK_UNMAPPED_BASE;
  60. }
  61. full_search:
  62. if (do_colour_align)
  63. addr = COLOUR_ALIGN(addr, pgoff);
  64. else
  65. addr = PAGE_ALIGN(mm->free_area_cache);
  66. for (vma = find_vma(mm, addr); ; vma = vma->vm_next) {
  67. /* At this point: (!vma || addr < vma->vm_end). */
  68. if (unlikely(TASK_SIZE - len < addr)) {
  69. /*
  70. * Start a new search - just in case we missed
  71. * some holes.
  72. */
  73. if (start_addr != TASK_UNMAPPED_BASE) {
  74. start_addr = addr = TASK_UNMAPPED_BASE;
  75. mm->cached_hole_size = 0;
  76. goto full_search;
  77. }
  78. return -ENOMEM;
  79. }
  80. if (likely(!vma || addr + len <= vma->vm_start)) {
  81. /*
  82. * Remember the place where we stopped the search:
  83. */
  84. mm->free_area_cache = addr + len;
  85. return addr;
  86. }
  87. if (addr + mm->cached_hole_size < vma->vm_start)
  88. mm->cached_hole_size = vma->vm_start - addr;
  89. addr = vma->vm_end;
  90. if (do_colour_align)
  91. addr = COLOUR_ALIGN(addr, pgoff);
  92. }
  93. }
  94. #endif /* CONFIG_MMU */
  95. /*
  96. * You really shouldn't be using read() or write() on /dev/mem. This
  97. * might go away in the future.
  98. */
  99. int valid_phys_addr_range(unsigned long addr, size_t count)
  100. {
  101. if (addr < __MEMORY_START)
  102. return 0;
  103. if (addr + count > __pa(high_memory))
  104. return 0;
  105. return 1;
  106. }
  107. int valid_mmap_phys_addr_range(unsigned long pfn, size_t size)
  108. {
  109. return 1;
  110. }