spawn.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413
  1. /**
  2. * @file spawn.c
  3. * @author Ambroz Bizjak <ambrop7@gmail.com>
  4. *
  5. * @section LICENSE
  6. *
  7. * Redistribution and use in source and binary forms, with or without
  8. * modification, are permitted provided that the following conditions are met:
  9. * 1. Redistributions of source code must retain the above copyright
  10. * notice, this list of conditions and the following disclaimer.
  11. * 2. Redistributions in binary form must reproduce the above copyright
  12. * notice, this list of conditions and the following disclaimer in the
  13. * documentation and/or other materials provided with the distribution.
  14. * 3. Neither the name of the author nor the
  15. * names of its contributors may be used to endorse or promote products
  16. * derived from this software without specific prior written permission.
  17. *
  18. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
  19. * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
  20. * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
  21. * DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY
  22. * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
  23. * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
  24. * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
  25. * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
  26. * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
  27. * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  28. *
  29. * @section DESCRIPTION
  30. *
  31. * Module which starts a process from a process template on initialization, and
  32. * stops it on deinitialization.
  33. *
  34. * Synopsis:
  35. * spawn(string template_name, list args)
  36. *
  37. * Description:
  38. * On initialization, creates a new process from the template named
  39. * 'template_name', with arguments 'args'. On deinitialization, initiates termination
  40. * of the process and waits for it to terminate. The process can access objects
  41. * as seen from 'spawn' via the _caller special object.
  42. *
  43. * Synopsis:
  44. * spawn::join()
  45. *
  46. * Description:
  47. * A join() on a spawn() is like a depend() on a provide() which is located at the
  48. * end of the spawned process.
  49. *
  50. * Variables:
  51. * Exposes objects from the spawned process.
  52. */
  53. #include <stdlib.h>
  54. #include <string.h>
  55. #include <misc/offset.h>
  56. #include <misc/debug.h>
  57. #include <structure/LinkedList0.h>
  58. #include <ncd/NCDModule.h>
  59. #include <generated/blog_channel_ncd_spawn.h>
  60. #define ModuleLog(i, ...) NCDModuleInst_Backend_Log((i), BLOG_CURRENT_CHANNEL, __VA_ARGS__)
  61. #define STATE_WORKING 1
  62. #define STATE_UP 2
  63. #define STATE_WAITING 3
  64. #define STATE_WAITING_TERMINATING 4
  65. #define STATE_TERMINATING 5
  66. struct instance {
  67. NCDModuleInst *i;
  68. NCDModuleProcess process;
  69. LinkedList0 clean_list;
  70. LinkedList0 dirty_list;
  71. int state;
  72. };
  73. struct join_instance {
  74. NCDModuleInst *i;
  75. struct instance *spawn;
  76. LinkedList0Node list_node;
  77. int is_dirty;
  78. };
  79. static void assert_dirty_state (struct instance *o);
  80. static void process_handler_event (struct instance *o, int event);
  81. static int process_func_getspecialobj (struct instance *o, NCD_string_id_t name, NCDObject *out_object);
  82. static int caller_obj_func_getobj (struct instance *o, NCD_string_id_t name, NCDObject *out_object);
  83. static void bring_joins_down (struct instance *o);
  84. static void continue_working (struct instance *o);
  85. static void continue_terminating (struct instance *o);
  86. static void instance_free (struct instance *o);
  87. enum {STRING_CALLER};
  88. static struct NCD_string_request strings[] = {
  89. {"_caller"}, {NULL}
  90. };
  91. static void assert_dirty_state (struct instance *o)
  92. {
  93. ASSERT(!LinkedList0_IsEmpty(&o->dirty_list) == (o->state == STATE_WAITING || o->state == STATE_WAITING_TERMINATING))
  94. }
  95. static void process_handler_event (struct instance *o, int event)
  96. {
  97. assert_dirty_state(o);
  98. switch (event) {
  99. case NCDMODULEPROCESS_EVENT_UP: {
  100. ASSERT(o->state == STATE_WORKING)
  101. ASSERT(LinkedList0_IsEmpty(&o->dirty_list))
  102. // set state up
  103. o->state = STATE_UP;
  104. // bring joins up
  105. for (LinkedList0Node *ln = LinkedList0_GetFirst(&o->clean_list); ln; ln = LinkedList0Node_Next(ln)) {
  106. struct join_instance *join = UPPER_OBJECT(ln, struct join_instance, list_node);
  107. ASSERT(join->spawn == o)
  108. ASSERT(!join->is_dirty)
  109. NCDModuleInst_Backend_Up(join->i);
  110. }
  111. } break;
  112. case NCDMODULEPROCESS_EVENT_DOWN: {
  113. ASSERT(o->state == STATE_UP)
  114. ASSERT(LinkedList0_IsEmpty(&o->dirty_list))
  115. // bring joins down, moving them to the dirty list
  116. bring_joins_down(o);
  117. // set state waiting
  118. o->state = STATE_WAITING;
  119. // if we have no joins, continue immediately
  120. if (LinkedList0_IsEmpty(&o->dirty_list)) {
  121. continue_working(o);
  122. return;
  123. }
  124. } break;
  125. case NCDMODULEPROCESS_EVENT_TERMINATED: {
  126. ASSERT(o->state == STATE_TERMINATING)
  127. ASSERT(LinkedList0_IsEmpty(&o->dirty_list))
  128. // die finally
  129. instance_free(o);
  130. return;
  131. } break;
  132. default: ASSERT(0);
  133. }
  134. }
  135. static int process_func_getspecialobj (struct instance *o, NCD_string_id_t name, NCDObject *out_object)
  136. {
  137. if (name == strings[STRING_CALLER].id) {
  138. *out_object = NCDObject_Build(NULL, o, NULL, (NCDObject_func_getobj)caller_obj_func_getobj);
  139. return 1;
  140. }
  141. return 0;
  142. }
  143. static int caller_obj_func_getobj (struct instance *o, NCD_string_id_t name, NCDObject *out_object)
  144. {
  145. return NCDModuleInst_Backend_GetObj(o->i, name, out_object);
  146. }
  147. static void bring_joins_down (struct instance *o)
  148. {
  149. LinkedList0Node *ln;
  150. while (ln = LinkedList0_GetFirst(&o->clean_list)) {
  151. struct join_instance *join = UPPER_OBJECT(ln, struct join_instance, list_node);
  152. ASSERT(join->spawn == o)
  153. ASSERT(!join->is_dirty)
  154. NCDModuleInst_Backend_Down(join->i);
  155. LinkedList0_Remove(&o->clean_list, &join->list_node);
  156. LinkedList0_Prepend(&o->dirty_list, &join->list_node);
  157. join->is_dirty = 1;
  158. }
  159. }
  160. static void continue_working (struct instance *o)
  161. {
  162. ASSERT(o->state == STATE_WAITING)
  163. ASSERT(LinkedList0_IsEmpty(&o->dirty_list))
  164. // continue process
  165. NCDModuleProcess_Continue(&o->process);
  166. // set state working
  167. o->state = STATE_WORKING;
  168. }
  169. static void continue_terminating (struct instance *o)
  170. {
  171. ASSERT(o->state == STATE_WAITING_TERMINATING)
  172. ASSERT(LinkedList0_IsEmpty(&o->dirty_list))
  173. // request process to terminate
  174. NCDModuleProcess_Terminate(&o->process);
  175. // set state terminating
  176. o->state = STATE_TERMINATING;
  177. }
  178. static void func_new (void *vo, NCDModuleInst *i, const struct NCDModuleInst_new_params *params)
  179. {
  180. struct instance *o = vo;
  181. o->i = i;
  182. // check arguments
  183. NCDValRef template_name_arg;
  184. NCDValRef args_arg;
  185. if (!NCDVal_ListRead(params->args, 2, &template_name_arg, &args_arg)) {
  186. ModuleLog(o->i, BLOG_ERROR, "wrong arity");
  187. goto fail0;
  188. }
  189. if (!NCDVal_IsStringNoNulls(template_name_arg) || !NCDVal_IsList(args_arg)) {
  190. ModuleLog(o->i, BLOG_ERROR, "wrong type");
  191. goto fail0;
  192. }
  193. // signal up.
  194. // Do it before creating the process so that the process starts initializing before our own process continues.
  195. NCDModuleInst_Backend_Up(o->i);
  196. // create process
  197. if (!NCDModuleProcess_Init(&o->process, o->i, NCDVal_StringValue(template_name_arg), args_arg, o, (NCDModuleProcess_handler_event)process_handler_event)) {
  198. ModuleLog(o->i, BLOG_ERROR, "NCDModuleProcess_Init failed");
  199. goto fail0;
  200. }
  201. // set object resolution function
  202. NCDModuleProcess_SetSpecialFuncs(&o->process, (NCDModuleProcess_func_getspecialobj)process_func_getspecialobj);
  203. // init lists
  204. LinkedList0_Init(&o->clean_list);
  205. LinkedList0_Init(&o->dirty_list);
  206. // set state working
  207. o->state = STATE_WORKING;
  208. return;
  209. fail0:
  210. NCDModuleInst_Backend_SetError(i);
  211. NCDModuleInst_Backend_Dead(i);
  212. }
  213. void instance_free (struct instance *o)
  214. {
  215. ASSERT(LinkedList0_IsEmpty(&o->dirty_list))
  216. // unlink joins
  217. LinkedList0Node *ln;
  218. while (ln = LinkedList0_GetFirst(&o->clean_list)) {
  219. struct join_instance *join = UPPER_OBJECT(ln, struct join_instance, list_node);
  220. ASSERT(join->spawn == o)
  221. ASSERT(!join->is_dirty)
  222. LinkedList0_Remove(&o->clean_list, &join->list_node);
  223. join->spawn = NULL;
  224. }
  225. // free process
  226. NCDModuleProcess_Free(&o->process);
  227. NCDModuleInst_Backend_Dead(o->i);
  228. }
  229. static void func_die (void *vo)
  230. {
  231. struct instance *o = vo;
  232. ASSERT(o->state != STATE_WAITING_TERMINATING)
  233. ASSERT(o->state != STATE_TERMINATING)
  234. assert_dirty_state(o);
  235. // bring joins down
  236. if (o->state == STATE_UP) {
  237. bring_joins_down(o);
  238. }
  239. // set state waiting terminating
  240. o->state = STATE_WAITING_TERMINATING;
  241. // start terminating now if possible
  242. if (LinkedList0_IsEmpty(&o->dirty_list)) {
  243. continue_terminating(o);
  244. return;
  245. }
  246. }
  247. static void join_func_new (void *vo, NCDModuleInst *i, const struct NCDModuleInst_new_params *params)
  248. {
  249. struct join_instance *o = vo;
  250. o->i = i;
  251. if (!NCDVal_ListRead(params->args, 0)) {
  252. ModuleLog(o->i, BLOG_ERROR, "wrong arity");
  253. goto fail0;
  254. }
  255. o->spawn = NCDModuleInst_Backend_GetUser((NCDModuleInst *)params->method_user);
  256. assert_dirty_state(o->spawn);
  257. LinkedList0_Prepend(&o->spawn->clean_list, &o->list_node);
  258. o->is_dirty = 0;
  259. if (o->spawn->state == STATE_UP) {
  260. NCDModuleInst_Backend_Up(i);
  261. }
  262. return;
  263. fail0:
  264. NCDModuleInst_Backend_SetError(i);
  265. NCDModuleInst_Backend_Dead(i);
  266. }
  267. static void join_func_die (void *vo)
  268. {
  269. struct join_instance *o = vo;
  270. if (o->spawn) {
  271. assert_dirty_state(o->spawn);
  272. // remove from list
  273. if (o->is_dirty) {
  274. LinkedList0_Remove(&o->spawn->dirty_list, &o->list_node);
  275. } else {
  276. LinkedList0_Remove(&o->spawn->clean_list, &o->list_node);
  277. }
  278. if (o->is_dirty && LinkedList0_IsEmpty(&o->spawn->dirty_list)) {
  279. ASSERT(o->spawn->state == STATE_WAITING || o->spawn->state == STATE_WAITING_TERMINATING)
  280. if (o->spawn->state == STATE_WAITING) {
  281. continue_working(o->spawn);
  282. } else {
  283. continue_terminating(o->spawn);
  284. }
  285. }
  286. }
  287. NCDModuleInst_Backend_Dead(o->i);
  288. }
  289. static int join_func_getobj (void *vo, NCD_string_id_t name, NCDObject *out)
  290. {
  291. struct join_instance *o = vo;
  292. if (!o->spawn) {
  293. return 0;
  294. }
  295. return NCDModuleProcess_GetObj(&o->spawn->process, name, out);
  296. }
  297. static void join_func_clean (void *vo)
  298. {
  299. struct join_instance *o = vo;
  300. if (!(o->spawn && o->is_dirty)) {
  301. return;
  302. }
  303. assert_dirty_state(o->spawn);
  304. ASSERT(o->spawn->state == STATE_WAITING || o->spawn->state == STATE_WAITING_TERMINATING)
  305. LinkedList0_Remove(&o->spawn->dirty_list, &o->list_node);
  306. LinkedList0_Prepend(&o->spawn->clean_list, &o->list_node);
  307. o->is_dirty = 0;
  308. if (LinkedList0_IsEmpty(&o->spawn->dirty_list)) {
  309. if (o->spawn->state == STATE_WAITING) {
  310. continue_working(o->spawn);
  311. } else {
  312. continue_terminating(o->spawn);
  313. }
  314. }
  315. }
  316. static struct NCDModule modules[] = {
  317. {
  318. .type = "spawn",
  319. .func_new2 = func_new,
  320. .func_die = func_die,
  321. .alloc_size = sizeof(struct instance)
  322. }, {
  323. .type = "synchronous_process", // deprecated name
  324. .func_new2 = func_new,
  325. .func_die = func_die,
  326. .alloc_size = sizeof(struct instance)
  327. }, {
  328. .type = "spawn::join",
  329. .func_new2 = join_func_new,
  330. .func_die = join_func_die,
  331. .func_getobj = join_func_getobj,
  332. .func_clean = join_func_clean,
  333. .alloc_size = sizeof(struct join_instance),
  334. .flags = NCDMODULE_FLAG_CAN_RESOLVE_WHEN_DOWN
  335. }, {
  336. .type = NULL
  337. }
  338. };
  339. const struct NCDModuleGroup ncdmodule_spawn = {
  340. .modules = modules,
  341. .strings = strings
  342. };