server_options.cc 3.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116
  1. /* vim:expandtab:shiftwidth=2:tabstop=2:smarttab:
  2. *
  3. * Gearmand client and server library.
  4. *
  5. * Copyright (C) 2013 Data Differential, http://datadifferential.com/
  6. * Copyright (C) 2013 Keyur Govande
  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 options
  41. */
  42. #include "gear_config.h"
  43. #include "libgearman/common.h"
  44. #include <memory>
  45. bool gearman_request_option(gearman_universal_st &universal,
  46. gearman_string_t &option)
  47. {
  48. // Since we append to universal when we build the options, the below is not a memory leak.
  49. gearman_server_options_st *server_options = new (std::nothrow) gearman_server_options_st{universal, gearman_c_str(option), gearman_size(option)};
  50. if (!server_options)
  51. {
  52. gearman_error(universal, GEARMAN_MEMORY_ALLOCATION_FAILURE, "new gearman_server_options_st()");
  53. return false;
  54. }
  55. return true;
  56. }
  57. gearman_server_options_st::gearman_server_options_st(gearman_universal_st &universal_,
  58. const char* option_arg, const size_t option_arg_size) :
  59. _option{option_arg_size},
  60. next{nullptr},
  61. prev{nullptr},
  62. #if __GNUC__ == 4 && __GNUC_MINOR__ < 9
  63. universal(universal_)
  64. #else
  65. universal{universal_}
  66. #endif
  67. {
  68. _option.append(option_arg, option_arg_size);
  69. if (universal.server_options_list)
  70. {
  71. universal.server_options_list->prev= this;
  72. }
  73. next= universal.server_options_list;
  74. universal.server_options_list= this;
  75. }
  76. gearman_server_options_st::gearman_server_options_st(const gearman_server_options_st& copy) :
  77. _option(copy.option()),
  78. next{nullptr},
  79. prev{nullptr},
  80. universal(copy.universal)
  81. {
  82. if (universal.server_options_list)
  83. {
  84. universal.server_options_list->prev= this;
  85. }
  86. next= universal.server_options_list;
  87. universal.server_options_list= this;
  88. }
  89. gearman_server_options_st::~gearman_server_options_st()
  90. {
  91. { // Remove from universal list
  92. if (universal.server_options_list == this)
  93. {
  94. universal.server_options_list= next;
  95. }
  96. if (prev)
  97. {
  98. prev->next= next;
  99. }
  100. if (next)
  101. {
  102. next->prev= prev;
  103. }
  104. }
  105. }