kill.cc 2.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103
  1. /* vim:expandtab:shiftwidth=2:tabstop=2:smarttab:
  2. *
  3. * Gearmand client and server library.
  4. *
  5. * Copyright (C) 2011 Data Differential, http://datadifferential.com/
  6. * Copyright (C) 2008 Brian Aker, Eric Day
  7. * All rights reserved.
  8. *
  9. * Redistribution and use in source and binary forms, with or without
  10. * modification, are permitted provided that the following conditions are
  11. * met:
  12. *
  13. * * Redistributions of source code must retain the above copyright
  14. * notice, this list of conditions and the following disclaimer.
  15. *
  16. * * Redistributions in binary form must reproduce the above
  17. * copyright notice, this list of conditions and the following disclaimer
  18. * in the documentation and/or other materials provided with the
  19. * distribution.
  20. *
  21. * * The names of its contributors may not be used to endorse or
  22. * promote products derived from this software without specific prior
  23. * written permission.
  24. *
  25. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
  26. * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
  27. * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
  28. * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
  29. * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
  30. * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
  31. * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
  32. * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
  33. * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
  34. * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
  35. * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  36. *
  37. */
  38. #include <libgearman/common.h>
  39. #include <cerrno>
  40. #include <unistd.h>
  41. gearman_id_t gearman_id_initialize(void)
  42. {
  43. static gearman_id_t tmp= { -1, -1 };
  44. return tmp;
  45. }
  46. bool gearman_id_valid(const gearman_id_t handle)
  47. {
  48. if (handle.write_fd <= 0 and handle.read_fd <= 0)
  49. {
  50. return false;
  51. }
  52. return true;
  53. }
  54. gearman_return_t gearman_kill(const gearman_id_t handle, const gearman_signal_t sig)
  55. {
  56. if (handle.write_fd <= 0 or handle.read_fd <= 0)
  57. {
  58. return GEARMAN_COULD_NOT_CONNECT;
  59. }
  60. switch (sig)
  61. {
  62. case GEARMAN_SIGNAL_INTERRUPT:
  63. if (write(handle.write_fd, "1", 1) == 1);
  64. {
  65. return GEARMAN_SUCCESS;
  66. }
  67. break;
  68. case GEARMAN_SIGNAL_KILL:
  69. if (close(handle.write_fd) == 0)
  70. {
  71. return GEARMAN_SUCCESS;
  72. }
  73. break;
  74. case GEARMAN_SIGNAL_CHECK:
  75. {
  76. struct pollfd pfds[1];
  77. pfds[0].fd= handle.read_fd;
  78. pfds[0].events= POLLIN;
  79. pfds[0].revents= 0;
  80. char buffer[1];
  81. int ret= ::poll(pfds, sizeof(pfds), 1500);
  82. if (ret >= 0)
  83. {
  84. return GEARMAN_SUCCESS;
  85. }
  86. return GEARMAN_COULD_NOT_CONNECT;
  87. }
  88. }
  89. return GEARMAN_COULD_NOT_CONNECT;
  90. }