queue.cc 7.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221
  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. * All rights reserved.
  7. *
  8. * Redistribution and use in source and binary forms, with or without
  9. * modification, are permitted provided that the following conditions are
  10. * met:
  11. *
  12. * * Redistributions of source code must retain the above copyright
  13. * notice, this list of conditions and the following disclaimer.
  14. *
  15. * * Redistributions in binary form must reproduce the above
  16. * copyright notice, this list of conditions and the following disclaimer
  17. * in the documentation and/or other materials provided with the
  18. * distribution.
  19. *
  20. * * The names of its contributors may not be used to endorse or
  21. * promote products derived from this software without specific prior
  22. * written permission.
  23. *
  24. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
  25. * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
  26. * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
  27. * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
  28. * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
  29. * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
  30. * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
  31. * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
  32. * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
  33. * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
  34. * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  35. *
  36. */
  37. #include "gear_config.h"
  38. #include <iostream>
  39. #include <boost/program_options.hpp>
  40. #include "libgearman-server/common.h"
  41. #include <libgearman-server/queue.h>
  42. #include <libgearman-server/plugins/queue/base.h>
  43. #include <libgearman-server/queue.hpp>
  44. #include <libgearman-server/log.h>
  45. #include <assert.h>
  46. gearmand_error_t gearman_queue_add(gearman_server_st *server,
  47. const char *unique,
  48. size_t unique_size,
  49. const char *function_name,
  50. size_t function_name_size,
  51. const void *data,
  52. size_t data_size,
  53. gearman_job_priority_t priority,
  54. int64_t when)
  55. {
  56. assert(server->state.queue_startup == false);
  57. if (server->queue_version == QUEUE_VERSION_FUNCTION)
  58. {
  59. assert(server->queue.functions->_add_fn);
  60. return (*(server->queue.functions->_add_fn))(server,
  61. (void *)server->queue.functions->_context,
  62. unique, unique_size,
  63. function_name,
  64. function_name_size,
  65. data, data_size, priority,
  66. when);
  67. }
  68. assert(server->queue.object);
  69. return server->queue.object->add(server,
  70. unique, unique_size,
  71. function_name,
  72. function_name_size,
  73. data, data_size, priority,
  74. when);
  75. }
  76. gearmand_error_t gearman_queue_flush(gearman_server_st *server)
  77. {
  78. if (server->queue_version == QUEUE_VERSION_FUNCTION)
  79. {
  80. assert(server->queue.functions->_flush_fn);
  81. return (*(server->queue.functions->_flush_fn))(server, (void *)server->queue.functions->_context);
  82. }
  83. assert(server->queue.object);
  84. return server->queue.object->flush(server);
  85. }
  86. gearmand_error_t gearman_queue_done(gearman_server_st *server,
  87. const char *unique,
  88. size_t unique_size,
  89. const char *function_name,
  90. size_t function_name_size)
  91. {
  92. if (server->queue_version == QUEUE_VERSION_FUNCTION)
  93. {
  94. assert(server->queue.functions->_done_fn);
  95. return (*(server->queue.functions->_done_fn))(server,
  96. (void *)server->queue.functions->_context,
  97. unique, unique_size,
  98. function_name,
  99. function_name_size);
  100. }
  101. assert(server->queue.object);
  102. return server->queue.object->done(server,
  103. unique, unique_size,
  104. function_name,
  105. function_name_size);
  106. }
  107. void gearman_server_set_queue(gearman_server_st& server,
  108. void *context,
  109. gearman_queue_add_fn *add,
  110. gearman_queue_flush_fn *flush,
  111. gearman_queue_done_fn *done,
  112. gearman_queue_replay_fn *replay)
  113. {
  114. delete server.queue.functions;
  115. server.queue.functions= NULL;
  116. delete server.queue.object;
  117. server.queue.object= NULL;
  118. server.queue_version= QUEUE_VERSION_FUNCTION;
  119. server.queue.functions= new queue_st();
  120. if (server.queue.functions)
  121. {
  122. server.queue.functions->_context= context;
  123. server.queue.functions->_add_fn= add;
  124. server.queue.functions->_flush_fn= flush;
  125. server.queue.functions->_done_fn= done;
  126. server.queue.functions->_replay_fn= replay;
  127. }
  128. assert(server.queue.functions);
  129. }
  130. void gearman_server_set_queue(gearman_server_st& server,
  131. gearmand::queue::Context* context)
  132. {
  133. delete server.queue.functions;
  134. server.queue.functions= NULL;
  135. delete server.queue.object;
  136. server.queue.object= NULL;
  137. assert(context);
  138. {
  139. server.queue_version= QUEUE_VERSION_CLASS;
  140. server.queue.object= context;
  141. }
  142. }
  143. namespace gearmand {
  144. namespace queue {
  145. plugins::Queue::vector all_queue_modules;
  146. void add(plugins::Queue* arg)
  147. {
  148. all_queue_modules.push_back(arg);
  149. }
  150. void load_options(boost::program_options::options_description &all)
  151. {
  152. for (plugins::Queue::vector::iterator iter= all_queue_modules.begin();
  153. iter != all_queue_modules.end();
  154. ++iter)
  155. {
  156. all.add((*iter)->command_line_options());
  157. }
  158. }
  159. gearmand_error_t initialize(gearmand_st *, std::string name)
  160. {
  161. bool launched= false;
  162. if (name.empty())
  163. {
  164. return GEARMAN_SUCCESS;
  165. }
  166. std::transform(name.begin(), name.end(), name.begin(), ::tolower);
  167. for (plugins::Queue::vector::iterator iter= all_queue_modules.begin();
  168. iter != all_queue_modules.end();
  169. ++iter)
  170. {
  171. if ((*iter)->compare(name) == 0)
  172. {
  173. if (launched)
  174. {
  175. return gearmand_gerror("Attempt to initialize multiple queues", GEARMAN_UNKNOWN_OPTION);
  176. }
  177. gearmand_error_t rc;
  178. if (gearmand_failed(rc= (*iter)->initialize()))
  179. {
  180. return gearmand_log_gerror(GEARMAN_DEFAULT_LOG_PARAM, rc,
  181. "Failed to initialize %s: %s", name.c_str(), (*iter)->error_string().c_str());
  182. }
  183. launched= true;
  184. }
  185. }
  186. if (launched == false)
  187. {
  188. return gearmand_log_gerror(GEARMAN_DEFAULT_LOG_PARAM, GEARMAN_UNKNOWN_OPTION, "Unknown queue %s", name.c_str());
  189. }
  190. return GEARMAN_SUCCESS;
  191. }
  192. } // namespace queue
  193. } // namespace gearmand