job.cc 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439
  1. /* vim:expandtab:shiftwidth=2:tabstop=2:smarttab:
  2. *
  3. * Gearmand client and server library.
  4. *
  5. * Copyright (C) 2011-2012 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. /**
  39. * @file
  40. * @brief Server job definitions
  41. */
  42. #include "gear_config.h"
  43. #include "libgearman-server/common.h"
  44. #include <string.h>
  45. #include <libgearman-server/queue.h>
  46. /*
  47. * Private declarations
  48. */
  49. /**
  50. * @addtogroup gearman_server_job_private Private Server Job Functions
  51. * @ingroup gearman_server_job
  52. * @{
  53. */
  54. /**
  55. * Get a server job structure from the unique ID. If data_size is non-zero,
  56. * then unique points to the workload data and not a real unique key.
  57. */
  58. static gearman_server_job_st * _server_job_get_unique(gearman_server_st *server, uint32_t unique_key,
  59. gearman_server_function_st *server_function,
  60. const char *unique, size_t data_size)
  61. {
  62. gearman_server_job_st *server_job;
  63. for (server_job= server->unique_hash[unique_key % server->hashtable_buckets];
  64. server_job != NULL; server_job= server_job->unique_next)
  65. {
  66. if (data_size == 0)
  67. {
  68. if (server_job->function == server_function &&
  69. server_job->unique_key == unique_key &&
  70. !strcmp(server_job->unique, unique))
  71. {
  72. return server_job;
  73. }
  74. }
  75. else
  76. {
  77. if (server_job->function == server_function &&
  78. server_job->unique_key == unique_key &&
  79. server_job->data_size == data_size &&
  80. memcmp(server_job->data, unique, data_size) == 0)
  81. {
  82. return server_job;
  83. }
  84. }
  85. }
  86. return NULL;
  87. }
  88. /** @} */
  89. #pragma GCC diagnostic push
  90. #pragma GCC diagnostic ignored "-Wold-style-cast"
  91. /*
  92. * Public definitions
  93. */
  94. gearman_server_job_st * gearman_server_job_add(gearman_server_st *server,
  95. const char *function_name, size_t function_name_size,
  96. const char *unique, size_t unique_size,
  97. const void *data, size_t data_size,
  98. gearman_job_priority_t priority,
  99. gearman_server_client_st *server_client,
  100. gearmand_error_t *ret_ptr,
  101. int64_t when)
  102. {
  103. return gearman_server_job_add_reducer(server,
  104. function_name, function_name_size,
  105. unique, unique_size,
  106. NULL, 0, // reducer
  107. data, data_size,
  108. priority, server_client, ret_ptr, when);
  109. }
  110. gearman_server_job_st *
  111. gearman_server_job_add_reducer(gearman_server_st *server,
  112. const char *function_name, size_t function_name_size,
  113. const char *unique, size_t unique_size,
  114. const char *reducer_name, size_t reducer_size,
  115. const void *data, size_t data_size,
  116. gearman_job_priority_t priority,
  117. gearman_server_client_st *server_client,
  118. gearmand_error_t *ret_ptr,
  119. int64_t when)
  120. {
  121. gearman_server_function_st *server_function= gearman_server_function_get(server, function_name, function_name_size);
  122. if (server_function == NULL)
  123. {
  124. *ret_ptr= GEARMAND_MEMORY_ALLOCATION_FAILURE;
  125. return NULL;
  126. }
  127. uint32_t key;
  128. gearman_server_job_st *server_job;
  129. if (unique_size == 0)
  130. {
  131. server_job= NULL;
  132. key= 0;
  133. }
  134. else
  135. {
  136. if (unique_size == 1 && *unique == '-')
  137. {
  138. if (data_size == 0)
  139. {
  140. key= 0;
  141. server_job= NULL;
  142. }
  143. else
  144. {
  145. /* Look up job via unique data when unique = '-'. */
  146. key= _server_job_hash((const char*)data, data_size);
  147. server_job= _server_job_get_unique(server, key, server_function, (const char*)data, data_size);
  148. }
  149. }
  150. else
  151. {
  152. /* Look up job via unique ID first to make sure it's not a duplicate. */
  153. key= _server_job_hash(unique, unique_size);
  154. server_job= _server_job_get_unique(server, key, server_function, unique, 0);
  155. }
  156. }
  157. if (server_job == NULL)
  158. {
  159. gearmand_log_debug(GEARMAN_DEFAULT_LOG_PARAM, "Comparing queue %u to limit %u for priority %u",
  160. server_function->job_total, server_function->max_queue_size[priority],
  161. priority);
  162. if (server_function->max_queue_size[priority] > 0 &&
  163. server_function->job_total >= server_function->max_queue_size[priority])
  164. {
  165. *ret_ptr= GEARMAND_JOB_QUEUE_FULL;
  166. return NULL;
  167. }
  168. server_job= gearman_server_job_create(server);
  169. if (server_job == NULL)
  170. {
  171. *ret_ptr= GEARMAND_MEMORY_ALLOCATION_FAILURE;
  172. return NULL;
  173. }
  174. server_job->priority= priority;
  175. server_job->function= server_function;
  176. server_function->job_total++;
  177. int checked_length;
  178. checked_length= snprintf(server_job->job_handle, GEARMAND_JOB_HANDLE_SIZE, "%s:%u",
  179. server->job_handle_prefix, server->job_handle_count);
  180. if (checked_length >= GEARMAND_JOB_HANDLE_SIZE || checked_length < 0)
  181. {
  182. gearmand_log_error(GEARMAN_DEFAULT_LOG_PARAM, "Job handle plus handle count beyond GEARMAND_JOB_HANDLE_SIZE: %s:%u",
  183. server->job_handle_prefix, server->job_handle_count);
  184. }
  185. server_job->unique_length= unique_size;
  186. checked_length= snprintf(server_job->unique, GEARMAN_MAX_UNIQUE_SIZE, "%.*s",
  187. (int)unique_size, unique);
  188. if (checked_length >= GEARMAN_MAX_UNIQUE_SIZE || checked_length < 0)
  189. {
  190. gearmand_log_error(GEARMAN_DEFAULT_LOG_PARAM, "We received a unique beyond GEARMAN_MAX_UNIQUE_SIZE: %.*s", (int)unique_size, unique);
  191. }
  192. server->job_handle_count++;
  193. server_job->data= data;
  194. server_job->data_size= data_size;
  195. server_job->when= when;
  196. if (reducer_size)
  197. {
  198. strncpy(server_job->reducer, reducer_name, reducer_size);
  199. server_job->reducer[reducer_size]= 0;
  200. }
  201. else
  202. {
  203. server_job->reducer[0]= 0;
  204. }
  205. server_job->unique_key= key;
  206. key= key % server->hashtable_buckets;
  207. GEARMAND_HASH_ADD(server->unique, key, server_job, unique_);
  208. key= _server_job_hash(server_job->job_handle,
  209. strlen(server_job->job_handle));
  210. server_job->job_handle_key= key;
  211. key= key % server->hashtable_buckets;
  212. GEARMAND_HASH__ADD(server->job, key, server_job);
  213. gearmand_log_debug(GEARMAN_DEFAULT_LOG_PARAM, "JOB %s :%u",
  214. server_job->job_handle, server_job->job_handle_key);
  215. if (server->state.queue_startup)
  216. {
  217. server_job->job_queued= true;
  218. }
  219. else if (server_client == NULL)
  220. {
  221. *ret_ptr= gearman_queue_add(server,
  222. server_job->unique, unique_size,
  223. function_name,
  224. function_name_size,
  225. data, data_size, priority,
  226. when);
  227. if (gearmand_failed(*ret_ptr))
  228. {
  229. server_job->data= NULL;
  230. gearman_server_job_free(server_job);
  231. return NULL;
  232. }
  233. server_job->job_queued= true;
  234. }
  235. *ret_ptr= gearman_server_job_queue(server_job);
  236. if (gearmand_failed(*ret_ptr))
  237. {
  238. if (server_client == NULL)
  239. {
  240. /* Do our best to remove the job from the queue. */
  241. (void)gearman_queue_done(server,
  242. server_job->unique, unique_size,
  243. server_job->function->function_name,
  244. server_job->function->function_name_size);
  245. }
  246. gearman_server_job_free(server_job);
  247. return NULL;
  248. }
  249. }
  250. else
  251. {
  252. *ret_ptr= GEARMAND_JOB_EXISTS;
  253. }
  254. if (server_client)
  255. {
  256. server_client->job= server_job;
  257. GEARMAND_LIST_ADD(server_job->client, server_client, job_);
  258. }
  259. return server_job;
  260. }
  261. void gearman_server_job_free(gearman_server_job_st *server_job)
  262. {
  263. if (server_job)
  264. {
  265. if (server_job->worker != NULL)
  266. {
  267. server_job->function->job_running--;
  268. }
  269. server_job->function->job_total--;
  270. if (server_job->data != NULL)
  271. {
  272. free((void *)(server_job->data));
  273. server_job->data= NULL;
  274. }
  275. while (server_job->client_list != NULL)
  276. {
  277. gearman_server_client_free(server_job->client_list);
  278. }
  279. if (server_job->worker != NULL)
  280. {
  281. GEARMAND_LIST_DEL(server_job->worker->job, server_job, worker_);
  282. }
  283. uint32_t key= server_job->unique_key % Server->hashtable_buckets;
  284. GEARMAND_HASH_DEL(Server->unique, key, server_job, unique_);
  285. key= server_job->job_handle_key % Server->hashtable_buckets;
  286. GEARMAND_HASH__DEL(Server->job, key, server_job);
  287. if (Server->free_job_count < GEARMAND_MAX_FREE_SERVER_JOB)
  288. {
  289. gearman_server_st *server= Server;
  290. GEARMAND_LIST__ADD(server->free_job, server_job);
  291. }
  292. else
  293. {
  294. destroy_gearman_server_job_st(server_job);
  295. }
  296. }
  297. }
  298. gearmand_error_t gearman_server_job_queue(gearman_server_job_st *job)
  299. {
  300. if (job->worker)
  301. {
  302. job->retries++;
  303. if (Server->job_retries != 0 && Server->job_retries == job->retries)
  304. {
  305. gearmand_log_notice(GEARMAN_DEFAULT_LOG_PARAM,
  306. "Dropped job due to max retry count: %s %.*s",
  307. job->job_handle,
  308. (int)job->unique_length, job->unique);
  309. for (gearman_server_client_st* client= job->client_list; client != NULL; client= client->job_next)
  310. {
  311. gearmand_error_t ret= gearman_server_io_packet_add(client->con, false,
  312. GEARMAN_MAGIC_RESPONSE,
  313. GEARMAN_COMMAND_WORK_FAIL,
  314. job->job_handle,
  315. (size_t)strlen(job->job_handle),
  316. NULL);
  317. if (gearmand_failed(ret))
  318. {
  319. gearmand_log_gerror_warn(GEARMAN_DEFAULT_LOG_PARAM, ret, "Failed to send WORK_FAIL packet to %s:%s", client->con->host(), client->con->port());
  320. }
  321. }
  322. /* Remove from persistent queue if one exists. */
  323. if (job->job_queued)
  324. {
  325. gearmand_error_t ret= gearman_queue_done(Server,
  326. job->unique, job->unique_length,
  327. job->function->function_name,
  328. job->function->function_name_size);
  329. if (gearmand_failed(ret))
  330. {
  331. gearmand_log_gerror_warn(GEARMAN_DEFAULT_LOG_PARAM, ret, "Failed to removed %.*s from persistent queue", int(job->unique_length), job->unique);
  332. }
  333. }
  334. gearman_server_job_free(job);
  335. return GEARMAND_SUCCESS;
  336. }
  337. GEARMAND_LIST_DEL(job->worker->job, job, worker_);
  338. job->worker= NULL;
  339. job->function->job_running--;
  340. job->function_next= NULL;
  341. job->numerator= 0;
  342. job->denominator= 0;
  343. }
  344. /* Queue NOOP for possible sleeping workers. */
  345. if (job->function->worker_list != NULL)
  346. {
  347. gearman_server_worker_st *worker= job->function->worker_list;
  348. uint32_t noop_sent= 0;
  349. do
  350. {
  351. if (worker->con->is_sleeping && ! (worker->con->is_noop_sent))
  352. {
  353. gearmand_error_t ret= gearman_server_io_packet_add(worker->con, false,
  354. GEARMAN_MAGIC_RESPONSE,
  355. GEARMAN_COMMAND_NOOP, NULL);
  356. if (gearmand_failed(ret))
  357. {
  358. gearmand_log_gerror_warn(GEARMAN_DEFAULT_LOG_PARAM, ret, "Failed to send NOOP packet to %s:%s", worker->con->host(), worker->con->port());
  359. }
  360. else
  361. {
  362. worker->con->is_noop_sent= true;
  363. noop_sent++;
  364. }
  365. }
  366. worker= worker->function_next;
  367. }
  368. while (worker != job->function->worker_list &&
  369. (Server->worker_wakeup == 0 ||
  370. noop_sent < Server->worker_wakeup));
  371. job->function->worker_list= worker;
  372. }
  373. /* Queue the job to be run. */
  374. if (job->function->job_list[job->priority] == NULL)
  375. {
  376. job->function->job_list[job->priority]= job;
  377. }
  378. else
  379. {
  380. job->function->job_end[job->priority]->function_next= job;
  381. }
  382. job->function->job_end[job->priority]= job;
  383. job->function->job_count++;
  384. return GEARMAND_SUCCESS;
  385. }
  386. #pragma GCC diagnostic pop