membarrier.c 2.5 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071
  1. /*
  2. * Copyright (C) 2010, 2015 Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
  3. *
  4. * membarrier system call
  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 as published by
  8. * the Free Software Foundation; either version 2 of the License, or
  9. * (at your option) any later version.
  10. *
  11. * This program is distributed in the hope that it will be useful,
  12. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  13. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  14. * GNU General Public License for more details.
  15. */
  16. #include <linux/syscalls.h>
  17. #include <linux/membarrier.h>
  18. #include <linux/tick.h>
  19. /*
  20. * Bitmask made from a "or" of all commands within enum membarrier_cmd,
  21. * except MEMBARRIER_CMD_QUERY.
  22. */
  23. #define MEMBARRIER_CMD_BITMASK (MEMBARRIER_CMD_SHARED)
  24. /**
  25. * sys_membarrier - issue memory barriers on a set of threads
  26. * @cmd: Takes command values defined in enum membarrier_cmd.
  27. * @flags: Currently needs to be 0. For future extensions.
  28. *
  29. * If this system call is not implemented, -ENOSYS is returned. If the
  30. * command specified does not exist, or if the command argument is invalid,
  31. * this system call returns -EINVAL. For a given command, with flags argument
  32. * set to 0, this system call is guaranteed to always return the same value
  33. * until reboot.
  34. *
  35. * All memory accesses performed in program order from each targeted thread
  36. * is guaranteed to be ordered with respect to sys_membarrier(). If we use
  37. * the semantic "barrier()" to represent a compiler barrier forcing memory
  38. * accesses to be performed in program order across the barrier, and
  39. * smp_mb() to represent explicit memory barriers forcing full memory
  40. * ordering across the barrier, we have the following ordering table for
  41. * each pair of barrier(), sys_membarrier() and smp_mb():
  42. *
  43. * The pair ordering is detailed as (O: ordered, X: not ordered):
  44. *
  45. * barrier() smp_mb() sys_membarrier()
  46. * barrier() X X O
  47. * smp_mb() X O O
  48. * sys_membarrier() O O O
  49. */
  50. SYSCALL_DEFINE2(membarrier, int, cmd, int, flags)
  51. {
  52. /* MEMBARRIER_CMD_SHARED is not compatible with nohz_full. */
  53. if (tick_nohz_full_enabled())
  54. return -ENOSYS;
  55. if (unlikely(flags))
  56. return -EINVAL;
  57. switch (cmd) {
  58. case MEMBARRIER_CMD_QUERY:
  59. return MEMBARRIER_CMD_BITMASK;
  60. case MEMBARRIER_CMD_SHARED:
  61. if (num_online_cpus() > 1)
  62. synchronize_sched();
  63. return 0;
  64. default:
  65. return -EINVAL;
  66. }
  67. }