spawn.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410
  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 <ncd/static_strings.h>
  60. #include <generated/blog_channel_ncd_spawn.h>
  61. #define ModuleLog(i, ...) NCDModuleInst_Backend_Log((i), BLOG_CURRENT_CHANNEL, __VA_ARGS__)
  62. #define STATE_WORKING 1
  63. #define STATE_UP 2
  64. #define STATE_WAITING 3
  65. #define STATE_WAITING_TERMINATING 4
  66. #define STATE_TERMINATING 5
  67. struct instance {
  68. NCDModuleInst *i;
  69. NCDModuleProcess process;
  70. LinkedList0 clean_list;
  71. LinkedList0 dirty_list;
  72. int state;
  73. };
  74. struct join_instance {
  75. NCDModuleInst *i;
  76. struct instance *spawn;
  77. LinkedList0Node list_node;
  78. int is_dirty;
  79. };
  80. static void assert_dirty_state (struct instance *o);
  81. static void process_handler_event (NCDModuleProcess *process, int event);
  82. static int process_func_getspecialobj (NCDModuleProcess *process, NCD_string_id_t name, NCDObject *out_object);
  83. static int caller_obj_func_getobj (const NCDObject *obj, NCD_string_id_t name, NCDObject *out_object);
  84. static void bring_joins_down (struct instance *o);
  85. static void continue_working (struct instance *o);
  86. static void continue_terminating (struct instance *o);
  87. static void instance_free (struct instance *o);
  88. static void assert_dirty_state (struct instance *o)
  89. {
  90. ASSERT(!LinkedList0_IsEmpty(&o->dirty_list) == (o->state == STATE_WAITING || o->state == STATE_WAITING_TERMINATING))
  91. }
  92. static void process_handler_event (NCDModuleProcess *process, int event)
  93. {
  94. struct instance *o = UPPER_OBJECT(process, struct instance, process);
  95. assert_dirty_state(o);
  96. switch (event) {
  97. case NCDMODULEPROCESS_EVENT_UP: {
  98. ASSERT(o->state == STATE_WORKING)
  99. ASSERT(LinkedList0_IsEmpty(&o->dirty_list))
  100. // set state up
  101. o->state = STATE_UP;
  102. // bring joins up
  103. for (LinkedList0Node *ln = LinkedList0_GetFirst(&o->clean_list); ln; ln = LinkedList0Node_Next(ln)) {
  104. struct join_instance *join = UPPER_OBJECT(ln, struct join_instance, list_node);
  105. ASSERT(join->spawn == o)
  106. ASSERT(!join->is_dirty)
  107. NCDModuleInst_Backend_Up(join->i);
  108. }
  109. } break;
  110. case NCDMODULEPROCESS_EVENT_DOWN: {
  111. ASSERT(o->state == STATE_UP)
  112. ASSERT(LinkedList0_IsEmpty(&o->dirty_list))
  113. // bring joins down, moving them to the dirty list
  114. bring_joins_down(o);
  115. // set state waiting
  116. o->state = STATE_WAITING;
  117. // if we have no joins, continue immediately
  118. if (LinkedList0_IsEmpty(&o->dirty_list)) {
  119. continue_working(o);
  120. return;
  121. }
  122. } break;
  123. case NCDMODULEPROCESS_EVENT_TERMINATED: {
  124. ASSERT(o->state == STATE_TERMINATING)
  125. ASSERT(LinkedList0_IsEmpty(&o->dirty_list))
  126. // die finally
  127. instance_free(o);
  128. return;
  129. } break;
  130. default: ASSERT(0);
  131. }
  132. }
  133. static int process_func_getspecialobj (NCDModuleProcess *process, NCD_string_id_t name, NCDObject *out_object)
  134. {
  135. struct instance *o = UPPER_OBJECT(process, struct instance, process);
  136. if (name == NCD_STRING_CALLER) {
  137. *out_object = NCDObject_Build(-1, o, NCDObject_no_getvar, caller_obj_func_getobj);
  138. return 1;
  139. }
  140. return 0;
  141. }
  142. static int caller_obj_func_getobj (const NCDObject *obj, NCD_string_id_t name, NCDObject *out_object)
  143. {
  144. struct instance *o = NCDObject_DataPtr(obj);
  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_IsString(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_InitValue(&o->process, o->i, template_name_arg, args_arg, 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, 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_DeadError(i);
  211. }
  212. void instance_free (struct instance *o)
  213. {
  214. ASSERT(LinkedList0_IsEmpty(&o->dirty_list))
  215. // unlink joins
  216. LinkedList0Node *ln;
  217. while (ln = LinkedList0_GetFirst(&o->clean_list)) {
  218. struct join_instance *join = UPPER_OBJECT(ln, struct join_instance, list_node);
  219. ASSERT(join->spawn == o)
  220. ASSERT(!join->is_dirty)
  221. LinkedList0_Remove(&o->clean_list, &join->list_node);
  222. join->spawn = NULL;
  223. }
  224. // free process
  225. NCDModuleProcess_Free(&o->process);
  226. NCDModuleInst_Backend_Dead(o->i);
  227. }
  228. static void func_die (void *vo)
  229. {
  230. struct instance *o = vo;
  231. ASSERT(o->state != STATE_WAITING_TERMINATING)
  232. ASSERT(o->state != STATE_TERMINATING)
  233. assert_dirty_state(o);
  234. // bring joins down
  235. if (o->state == STATE_UP) {
  236. bring_joins_down(o);
  237. }
  238. // set state waiting terminating
  239. o->state = STATE_WAITING_TERMINATING;
  240. // start terminating now if possible
  241. if (LinkedList0_IsEmpty(&o->dirty_list)) {
  242. continue_terminating(o);
  243. return;
  244. }
  245. }
  246. static void join_func_new (void *vo, NCDModuleInst *i, const struct NCDModuleInst_new_params *params)
  247. {
  248. struct join_instance *o = vo;
  249. o->i = i;
  250. if (!NCDVal_ListRead(params->args, 0)) {
  251. ModuleLog(o->i, BLOG_ERROR, "wrong arity");
  252. goto fail0;
  253. }
  254. o->spawn = NCDModuleInst_Backend_GetUser((NCDModuleInst *)params->method_user);
  255. assert_dirty_state(o->spawn);
  256. LinkedList0_Prepend(&o->spawn->clean_list, &o->list_node);
  257. o->is_dirty = 0;
  258. if (o->spawn->state == STATE_UP) {
  259. NCDModuleInst_Backend_Up(i);
  260. }
  261. return;
  262. fail0:
  263. NCDModuleInst_Backend_DeadError(i);
  264. }
  265. static void join_func_die (void *vo)
  266. {
  267. struct join_instance *o = vo;
  268. if (o->spawn) {
  269. assert_dirty_state(o->spawn);
  270. // remove from list
  271. if (o->is_dirty) {
  272. LinkedList0_Remove(&o->spawn->dirty_list, &o->list_node);
  273. } else {
  274. LinkedList0_Remove(&o->spawn->clean_list, &o->list_node);
  275. }
  276. if (o->is_dirty && LinkedList0_IsEmpty(&o->spawn->dirty_list)) {
  277. ASSERT(o->spawn->state == STATE_WAITING || o->spawn->state == STATE_WAITING_TERMINATING)
  278. if (o->spawn->state == STATE_WAITING) {
  279. continue_working(o->spawn);
  280. } else {
  281. continue_terminating(o->spawn);
  282. }
  283. }
  284. }
  285. NCDModuleInst_Backend_Dead(o->i);
  286. }
  287. static int join_func_getobj (void *vo, NCD_string_id_t name, NCDObject *out)
  288. {
  289. struct join_instance *o = vo;
  290. if (!o->spawn) {
  291. return 0;
  292. }
  293. return NCDModuleProcess_GetObj(&o->spawn->process, name, out);
  294. }
  295. static void join_func_clean (void *vo)
  296. {
  297. struct join_instance *o = vo;
  298. if (!(o->spawn && o->is_dirty)) {
  299. return;
  300. }
  301. assert_dirty_state(o->spawn);
  302. ASSERT(o->spawn->state == STATE_WAITING || o->spawn->state == STATE_WAITING_TERMINATING)
  303. LinkedList0_Remove(&o->spawn->dirty_list, &o->list_node);
  304. LinkedList0_Prepend(&o->spawn->clean_list, &o->list_node);
  305. o->is_dirty = 0;
  306. if (LinkedList0_IsEmpty(&o->spawn->dirty_list)) {
  307. if (o->spawn->state == STATE_WAITING) {
  308. continue_working(o->spawn);
  309. } else {
  310. continue_terminating(o->spawn);
  311. }
  312. }
  313. }
  314. static struct NCDModule modules[] = {
  315. {
  316. .type = "spawn",
  317. .func_new2 = func_new,
  318. .func_die = func_die,
  319. .alloc_size = sizeof(struct instance)
  320. }, {
  321. .type = "synchronous_process", // deprecated name
  322. .func_new2 = func_new,
  323. .func_die = func_die,
  324. .alloc_size = sizeof(struct instance)
  325. }, {
  326. .type = "spawn::join",
  327. .func_new2 = join_func_new,
  328. .func_die = join_func_die,
  329. .func_getobj = join_func_getobj,
  330. .func_clean = join_func_clean,
  331. .alloc_size = sizeof(struct join_instance),
  332. .flags = NCDMODULE_FLAG_CAN_RESOLVE_WHEN_DOWN
  333. }, {
  334. .type = NULL
  335. }
  336. };
  337. const struct NCDModuleGroup ncdmodule_spawn = {
  338. .modules = modules
  339. };