membarrier.c 2.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566
  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. /*
  19. * Bitmask made from a "or" of all commands within enum membarrier_cmd,
  20. * except MEMBARRIER_CMD_QUERY.
  21. */
  22. #define MEMBARRIER_CMD_BITMASK (MEMBARRIER_CMD_SHARED)
  23. /**
  24. * sys_membarrier - issue memory barriers on a set of threads
  25. * @cmd: Takes command values defined in enum membarrier_cmd.
  26. * @flags: Currently needs to be 0. For future extensions.
  27. *
  28. * If this system call is not implemented, -ENOSYS is returned. If the
  29. * command specified does not exist, or if the command argument is invalid,
  30. * this system call returns -EINVAL. For a given command, with flags argument
  31. * set to 0, this system call is guaranteed to always return the same value
  32. * until reboot.
  33. *
  34. * All memory accesses performed in program order from each targeted thread
  35. * is guaranteed to be ordered with respect to sys_membarrier(). If we use
  36. * the semantic "barrier()" to represent a compiler barrier forcing memory
  37. * accesses to be performed in program order across the barrier, and
  38. * smp_mb() to represent explicit memory barriers forcing full memory
  39. * ordering across the barrier, we have the following ordering table for
  40. * each pair of barrier(), sys_membarrier() and smp_mb():
  41. *
  42. * The pair ordering is detailed as (O: ordered, X: not ordered):
  43. *
  44. * barrier() smp_mb() sys_membarrier()
  45. * barrier() X X O
  46. * smp_mb() X O O
  47. * sys_membarrier() O O O
  48. */
  49. SYSCALL_DEFINE2(membarrier, int, cmd, int, flags)
  50. {
  51. if (unlikely(flags))
  52. return -EINVAL;
  53. switch (cmd) {
  54. case MEMBARRIER_CMD_QUERY:
  55. return MEMBARRIER_CMD_BITMASK;
  56. case MEMBARRIER_CMD_SHARED:
  57. if (num_online_cpus() > 1)
  58. synchronize_sched();
  59. return 0;
  60. default:
  61. return -EINVAL;
  62. }
  63. }