kscheme.c 8.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367
  1. #include <stdlib.h>
  2. #include <stdio.h>
  3. #include <string.h>
  4. #include <assert.h>
  5. #include <faux/str.h>
  6. #include <faux/list.h>
  7. #include <faux/error.h>
  8. #include <klish/khelper.h>
  9. #include <klish/kplugin.h>
  10. #include <klish/kptype.h>
  11. #include <klish/kview.h>
  12. #include <klish/knspace.h>
  13. #include <klish/kscheme.h>
  14. #include <klish/kcontext.h>
  15. struct kscheme_s {
  16. faux_list_t *plugins;
  17. faux_list_t *ptypes;
  18. faux_list_t *views;
  19. };
  20. // Simple methods
  21. // PLUGIN list
  22. KGET(scheme, faux_list_t *, plugins);
  23. KCMP_NESTED(scheme, plugin, name);
  24. KCMP_NESTED_BY_KEY(scheme, plugin, name);
  25. KADD_NESTED(scheme, plugin);
  26. KFIND_NESTED(scheme, plugin);
  27. KNESTED_LEN(scheme, plugin);
  28. KNESTED_ITER(scheme, plugin);
  29. KNESTED_EACH(scheme, plugin);
  30. // PTYPE list
  31. KGET(scheme, faux_list_t *, ptypes);
  32. KCMP_NESTED(scheme, ptype, name);
  33. KCMP_NESTED_BY_KEY(scheme, ptype, name);
  34. KADD_NESTED(scheme, ptype);
  35. KFIND_NESTED(scheme, ptype);
  36. KNESTED_LEN(scheme, ptype);
  37. KNESTED_ITER(scheme, ptype);
  38. KNESTED_EACH(scheme, ptype);
  39. // VIEW list
  40. KGET(scheme, faux_list_t *, views);
  41. KCMP_NESTED(scheme, view, name);
  42. KCMP_NESTED_BY_KEY(scheme, view, name);
  43. KADD_NESTED(scheme, view);
  44. KFIND_NESTED(scheme, view);
  45. KNESTED_LEN(scheme, view);
  46. KNESTED_ITER(scheme, view);
  47. KNESTED_EACH(scheme, view);
  48. kscheme_t *kscheme_new(void)
  49. {
  50. kscheme_t *scheme = NULL;
  51. scheme = faux_zmalloc(sizeof(*scheme));
  52. assert(scheme);
  53. if (!scheme)
  54. return NULL;
  55. // PLUGIN list
  56. scheme->plugins = faux_list_new(FAUX_LIST_SORTED, FAUX_LIST_UNIQUE,
  57. kscheme_plugin_compare, kscheme_plugin_kcompare,
  58. (void (*)(void *))kplugin_free);
  59. assert(scheme->plugins);
  60. // PTYPE list
  61. scheme->ptypes = faux_list_new(FAUX_LIST_SORTED, FAUX_LIST_UNIQUE,
  62. kscheme_ptype_compare, kscheme_ptype_kcompare,
  63. (void (*)(void *))kptype_free);
  64. assert(scheme->ptypes);
  65. // VIEW list
  66. scheme->views = faux_list_new(FAUX_LIST_SORTED, FAUX_LIST_UNIQUE,
  67. kscheme_view_compare, kscheme_view_kcompare,
  68. (void (*)(void *))kview_free);
  69. assert(scheme->views);
  70. return scheme;
  71. }
  72. void kscheme_free(kscheme_t *scheme)
  73. {
  74. if (!scheme)
  75. return;
  76. faux_list_free(scheme->plugins);
  77. faux_list_free(scheme->ptypes);
  78. faux_list_free(scheme->views);
  79. faux_free(scheme);
  80. }
  81. #define TAG "PLUGIN"
  82. bool_t kscheme_load_plugins(kscheme_t *scheme, kcontext_t *context,
  83. faux_error_t *error)
  84. {
  85. bool_t retcode = BOOL_TRUE;
  86. kscheme_plugins_node_t *iter = NULL;
  87. kplugin_t *plugin = NULL;
  88. assert(scheme);
  89. if (!scheme)
  90. return BOOL_FALSE;
  91. assert(scheme->plugins);
  92. if (!context)
  93. return BOOL_FALSE;
  94. iter = kscheme_plugins_iter(scheme);
  95. while ((plugin = kscheme_plugins_each(&iter))) {
  96. int init_retcode = 0;
  97. if (!kplugin_load(plugin)) {
  98. faux_error_sprintf(error,
  99. TAG ": Can't load plugin \"%s\"",
  100. kplugin_name(plugin));
  101. retcode = BOOL_FALSE;
  102. continue; // Try to load all plugins
  103. }
  104. kcontext_set_type(context, KCONTEXT_PLUGIN_INIT);
  105. kcontext_set_plugin(context, plugin);
  106. if ((init_retcode = kplugin_init(plugin, context)) < 0) {
  107. faux_error_sprintf(error,
  108. TAG ": Can't init plugin \"%s\" (%d)",
  109. kplugin_name(plugin), init_retcode);
  110. retcode = BOOL_FALSE;
  111. continue;
  112. }
  113. }
  114. return retcode;
  115. }
  116. bool_t kscheme_fini_plugins(kscheme_t *scheme, kcontext_t *context,
  117. faux_error_t *error)
  118. {
  119. kscheme_plugins_node_t *iter = NULL;
  120. kplugin_t *plugin = NULL;
  121. assert(scheme);
  122. if (!scheme)
  123. return BOOL_FALSE;
  124. assert(scheme->plugins);
  125. if (!context)
  126. return BOOL_FALSE;
  127. iter = kscheme_plugins_iter(scheme);
  128. while ((plugin = kscheme_plugins_each(&iter))) {
  129. int fini_retcode = -1;
  130. kcontext_set_type(context, KCONTEXT_PLUGIN_FINI);
  131. kcontext_set_plugin(context, plugin);
  132. if ((fini_retcode = kplugin_fini(plugin, context)) < 0) {
  133. faux_error_sprintf(error,
  134. TAG ": Can't fini plugin \"%s\" (%d)",
  135. kplugin_name(plugin), fini_retcode);
  136. }
  137. }
  138. return BOOL_TRUE;
  139. }
  140. bool_t kscheme_fini(kscheme_t *scheme, kcontext_t *context, faux_error_t *error)
  141. {
  142. assert(scheme);
  143. if (!scheme)
  144. return BOOL_FALSE;
  145. if (!context)
  146. return BOOL_FALSE;
  147. if (!kscheme_fini_plugins(scheme, context, error))
  148. return BOOL_FALSE;
  149. return BOOL_TRUE;
  150. }
  151. ksym_t *kscheme_find_sym(const kscheme_t *scheme, const char *name)
  152. {
  153. char *saveptr = NULL;
  154. const char *delim = "@";
  155. char *plugin_name = NULL;
  156. char *cmd_name = NULL;
  157. char *full_name = NULL;
  158. ksym_t *sym = NULL;
  159. assert(scheme);
  160. if (!scheme)
  161. return NULL;
  162. assert(name);
  163. if (!name)
  164. return NULL;
  165. // Parse full name to get sym name and optional plugin name
  166. full_name = faux_str_dup(name);
  167. cmd_name = strtok_r(full_name, delim, &saveptr);
  168. if (!cmd_name) {
  169. faux_str_free(full_name);
  170. return NULL;
  171. }
  172. plugin_name = strtok_r(NULL, delim, &saveptr);
  173. // Search for symbol within specified PLUGIN only
  174. if (plugin_name) {
  175. kplugin_t *plugin = NULL;
  176. plugin = kscheme_find_plugin(scheme, plugin_name);
  177. if (!plugin) {
  178. faux_str_free(full_name);
  179. return NULL;
  180. }
  181. sym = kplugin_find_sym(plugin, cmd_name);
  182. // Search for symbol within all PLUGINs
  183. } else {
  184. kscheme_plugins_node_t *iter = NULL;
  185. kplugin_t *plugin = NULL;
  186. iter = kscheme_plugins_iter(scheme);
  187. while ((plugin = kscheme_plugins_each(&iter))) {
  188. sym = kplugin_find_sym(plugin, cmd_name);
  189. if (sym)
  190. break;
  191. }
  192. }
  193. faux_str_free(full_name);
  194. return sym;
  195. }
  196. bool_t kscheme_prepare_action_list(kscheme_t *scheme, faux_list_t *action_list,
  197. faux_error_t *error) {
  198. faux_list_node_t *iter = NULL;
  199. kaction_t *action = NULL;
  200. bool_t retcode = BOOL_TRUE;
  201. assert(scheme);
  202. if (!scheme)
  203. return BOOL_FALSE;
  204. assert(action_list);
  205. if (!action_list)
  206. return BOOL_FALSE;
  207. if (faux_list_is_empty(action_list))
  208. return BOOL_TRUE;
  209. iter = faux_list_head(action_list);
  210. while ((action = (kaction_t *)faux_list_each(&iter))) {
  211. ksym_t *sym = NULL;
  212. const char *sym_ref = kaction_sym_ref(action);
  213. sym = kscheme_find_sym(scheme, sym_ref);
  214. if (!sym) {
  215. faux_error_sprintf(error, "Can't find symbol \"%s\"",
  216. sym_ref);
  217. retcode = BOOL_FALSE;
  218. continue;
  219. }
  220. kaction_set_sym(action, sym);
  221. }
  222. return retcode;
  223. }
  224. bool_t kscheme_prepare_param_list(kscheme_t *scheme, faux_list_t *param_list,
  225. faux_error_t *error) {
  226. faux_list_node_t *iter = NULL;
  227. kparam_t *param = NULL;
  228. bool_t retcode = BOOL_TRUE;
  229. assert(scheme);
  230. if (!scheme)
  231. return BOOL_FALSE;
  232. assert(param_list);
  233. if (!param_list)
  234. return BOOL_FALSE;
  235. if (faux_list_is_empty(param_list))
  236. return BOOL_TRUE;
  237. iter = faux_list_head(param_list);
  238. while ((param = (kparam_t *)faux_list_each(&iter))) {
  239. kptype_t *ptype = NULL;
  240. const char *ptype_ref = kparam_ptype_ref(param);
  241. ptype = kscheme_find_ptype(scheme, ptype_ref);
  242. if (!ptype) {
  243. faux_error_sprintf(error, "Can't find ptype \"%s\"",
  244. ptype_ref);
  245. retcode = BOOL_FALSE;
  246. continue;
  247. }
  248. kparam_set_ptype(param, ptype);
  249. // Nested PARAMs
  250. if (!kscheme_prepare_param_list(scheme, kparam_params(param),
  251. error))
  252. retcode = BOOL_FALSE;
  253. }
  254. return retcode;
  255. }
  256. /** @brief Prepares schema for execution.
  257. *
  258. * It loads plugins, link unresolved symbols, then iterates all the
  259. * objects and link them to each other, check access
  260. * permissions. Without this function the schema is not fully functional.
  261. */
  262. bool_t kscheme_prepare(kscheme_t *scheme, kcontext_t *context, faux_error_t *error)
  263. {
  264. kscheme_views_node_t *views_iter = NULL;
  265. kview_t *view = NULL;
  266. assert(scheme);
  267. if (!scheme)
  268. return BOOL_FALSE;
  269. if (!context)
  270. return BOOL_FALSE;
  271. if (!kscheme_load_plugins(scheme, context, error))
  272. return BOOL_FALSE;
  273. // Iterate VIEWs
  274. views_iter = kscheme_views_iter(scheme);
  275. while ((view = kscheme_views_each(&views_iter))) {
  276. kview_commands_node_t *commands_iter = NULL;
  277. kcommand_t *command = NULL;
  278. kview_nspaces_node_t *nspaces_iter = NULL;
  279. knspace_t *nspace = NULL;
  280. printf("VIEW: %s\n", kview_name(view));
  281. // Iterate NSPACEs
  282. nspaces_iter = kview_nspaces_iter(view);
  283. while ((nspace = kview_nspaces_each(&nspaces_iter))) {
  284. const char *view_ref = knspace_view_ref(nspace);
  285. kview_t *rview = NULL;
  286. rview = kscheme_find_view(scheme, view_ref);
  287. if (!view)
  288. return BOOL_FALSE;
  289. knspace_set_view(nspace, rview);
  290. printf("NSPACE: %s\n",
  291. kview_name(knspace_view(nspace)));
  292. }
  293. // Iterate COMMANDs
  294. commands_iter = kview_commands_iter(view);
  295. while ((command = kview_commands_each(&commands_iter))) {
  296. printf("COMMAND: %s\n", kcommand_name(command));
  297. // ACTIONs
  298. if (!kscheme_prepare_action_list(scheme,
  299. kcommand_actions(command), error))
  300. return BOOL_FALSE;
  301. // PARAMs
  302. if (!kscheme_prepare_param_list(scheme,
  303. kcommand_params(command), error))
  304. return BOOL_FALSE;
  305. }
  306. }
  307. return BOOL_TRUE;
  308. }