cycle.cc 3.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112
  1. /* vim:expandtab:shiftwidth=2:tabstop=2:smarttab:
  2. *
  3. * Cycle the Gearmand server
  4. *
  5. * Copyright (C) 2011 Data Differential, http://datadifferential.com/
  6. *
  7. * Redistribution and use in source and binary forms, with or without
  8. * modification, are permitted provided that the following conditions are
  9. * met:
  10. *
  11. * * Redistributions of source code must retain the above copyright
  12. * notice, this list of conditions and the following disclaimer.
  13. *
  14. * * Redistributions in binary form must reproduce the above
  15. * copyright notice, this list of conditions and the following disclaimer
  16. * in the documentation and/or other materials provided with the
  17. * distribution.
  18. *
  19. * * The names of its contributors may not be used to endorse or
  20. * promote products derived from this software without specific prior
  21. * written permission.
  22. *
  23. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
  24. * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
  25. * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
  26. * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
  27. * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
  28. * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
  29. * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
  30. * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
  31. * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
  32. * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
  33. * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  34. *
  35. */
  36. /*
  37. Test that we are cycling the servers we are creating during testing.
  38. */
  39. #include <config.h>
  40. #include <libtest/test.hpp>
  41. using namespace libtest;
  42. #include <libgearman/gearman.h>
  43. #include "tests/ports.h"
  44. #include "tests/start_worker.h"
  45. static gearman_return_t success_fn(gearman_job_st*, void* /* context */)
  46. {
  47. return GEARMAN_SUCCESS;
  48. }
  49. static test_return_t single_cycle(void *)
  50. {
  51. gearman_function_t success_function= gearman_function_create(success_fn);
  52. worker_handle_st *worker= test_worker_start(CYCLE_TEST_PORT, NULL, "success", success_function, NULL, gearman_worker_options_t());
  53. test_true(worker);
  54. test_true(worker->shutdown());
  55. delete worker;
  56. return TEST_SUCCESS;
  57. }
  58. static test_return_t kill_test(void *)
  59. {
  60. static struct timespec global_sleep_value= { 2, 0 };
  61. #ifdef WIN32
  62. sleep(1);
  63. #else
  64. nanosleep(&global_sleep_value, NULL);
  65. #endif
  66. return TEST_SUCCESS;
  67. }
  68. test_st kill_tests[] ={
  69. {"kill", true, (test_callback_fn*)kill_test },
  70. {0, 0, 0}
  71. };
  72. test_st worker_tests[] ={
  73. {"single startup/shutdown", true, (test_callback_fn*)single_cycle },
  74. {0, 0, 0}
  75. };
  76. collection_st collection[] ={
  77. {"kill", 0, 0, kill_tests},
  78. {"worker", 0, 0, worker_tests},
  79. {0, 0, 0, 0}
  80. };
  81. static void *world_create(server_startup_st& servers, test_return_t& error)
  82. {
  83. const char *argv[1]= { "client_gearmand" };
  84. if (not server_startup(servers, "gearmand", CYCLE_TEST_PORT, 1, argv))
  85. {
  86. error= TEST_FAILURE;
  87. }
  88. return NULL;
  89. }
  90. void get_world(Framework *world)
  91. {
  92. world->collections= collection;
  93. world->_create= world_create;
  94. }