uaccess.h 3.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113
  1. /*
  2. * User memory access support for Hexagon
  3. *
  4. * Copyright (c) 2010-2011, The Linux Foundation. All rights reserved.
  5. *
  6. * This program is free software; you can redistribute it and/or modify
  7. * it under the terms of the GNU General Public License version 2 and
  8. * only version 2 as published by the Free Software Foundation.
  9. *
  10. * This program is distributed in the hope that it will be useful,
  11. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  12. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  13. * GNU General Public License for more details.
  14. *
  15. * You should have received a copy of the GNU General Public License
  16. * along with this program; if not, write to the Free Software
  17. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
  18. * 02110-1301, USA.
  19. */
  20. #ifndef _ASM_UACCESS_H
  21. #define _ASM_UACCESS_H
  22. /*
  23. * User space memory access functions
  24. */
  25. #include <linux/mm.h>
  26. #include <asm/segment.h>
  27. #include <asm/sections.h>
  28. /*
  29. * access_ok: - Checks if a user space pointer is valid
  30. * @type: Type of access: %VERIFY_READ or %VERIFY_WRITE. Note that
  31. * %VERIFY_WRITE is a superset of %VERIFY_READ - if it is safe
  32. * to write to a block, it is always safe to read from it.
  33. * @addr: User space pointer to start of block to check
  34. * @size: Size of block to check
  35. *
  36. * Context: User context only. This function may sleep if pagefaults are
  37. * enabled.
  38. *
  39. * Checks if a pointer to a block of memory in user space is valid.
  40. *
  41. * Returns true (nonzero) if the memory block *may* be valid, false (zero)
  42. * if it is definitely invalid.
  43. *
  44. * User address space in Hexagon, like x86, goes to 0xbfffffff, so the
  45. * simple MSB-based tests used by MIPS won't work. Some further
  46. * optimization is probably possible here, but for now, keep it
  47. * reasonably simple and not *too* slow. After all, we've got the
  48. * MMU for backup.
  49. */
  50. #define __access_ok(addr, size) \
  51. ((get_fs().seg == KERNEL_DS.seg) || \
  52. (((unsigned long)addr < get_fs().seg) && \
  53. (unsigned long)size < (get_fs().seg - (unsigned long)addr)))
  54. /*
  55. * When a kernel-mode page fault is taken, the faulting instruction
  56. * address is checked against a table of exception_table_entries.
  57. * Each entry is a tuple of the address of an instruction that may
  58. * be authorized to fault, and the address at which execution should
  59. * be resumed instead of the faulting instruction, so as to effect
  60. * a workaround.
  61. */
  62. /* Assembly somewhat optimized copy routines */
  63. unsigned long raw_copy_from_user(void *to, const void __user *from,
  64. unsigned long n);
  65. unsigned long raw_copy_to_user(void __user *to, const void *from,
  66. unsigned long n);
  67. #define INLINE_COPY_FROM_USER
  68. #define INLINE_COPY_TO_USER
  69. __kernel_size_t __clear_user_hexagon(void __user *dest, unsigned long count);
  70. #define __clear_user(a, s) __clear_user_hexagon((a), (s))
  71. #define __strncpy_from_user(dst, src, n) hexagon_strncpy_from_user(dst, src, n)
  72. /* get around the ifndef in asm-generic/uaccess.h */
  73. #define __strnlen_user __strnlen_user
  74. extern long __strnlen_user(const char __user *src, long n);
  75. static inline long hexagon_strncpy_from_user(char *dst, const char __user *src,
  76. long n);
  77. #include <asm-generic/uaccess.h>
  78. /* Todo: an actual accelerated version of this. */
  79. static inline long hexagon_strncpy_from_user(char *dst, const char __user *src,
  80. long n)
  81. {
  82. long res = __strnlen_user(src, n);
  83. if (unlikely(!res))
  84. return -EFAULT;
  85. if (res > n) {
  86. long left = raw_copy_from_user(dst, src, n);
  87. if (unlikely(left))
  88. memset(dst + (n - left), 0, left);
  89. return n;
  90. } else {
  91. long left = raw_copy_from_user(dst, src, res);
  92. if (unlikely(left))
  93. memset(dst + (res - left), 0, left);
  94. return res-1;
  95. }
  96. }
  97. #endif