ientry.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472
  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/conv.h>
  8. #include <klish/khelper.h>
  9. #include <klish/ientry.h>
  10. #include <klish/kentry.h>
  11. #define TAG "ENTRY"
  12. bool_t ientry_parse(const ientry_t *info, kentry_t *entry, faux_error_t *error)
  13. {
  14. bool_t retcode = BOOL_TRUE;
  15. if (!info)
  16. return BOOL_FALSE;
  17. if (!entry)
  18. return BOOL_FALSE;
  19. // Help
  20. if (!faux_str_is_empty(info->help)) {
  21. if (!kentry_set_help(entry, info->help)) {
  22. faux_error_add(error, TAG": Illegal 'help' attribute");
  23. retcode = BOOL_FALSE;
  24. }
  25. }
  26. // Container
  27. if (!faux_str_is_empty(info->container)) {
  28. bool_t b = BOOL_FALSE;
  29. if (!faux_conv_str2bool(info->container, &b) ||
  30. !kentry_set_container(entry, b)) {
  31. faux_error_add(error, TAG": Illegal 'container' attribute");
  32. retcode = BOOL_FALSE;
  33. }
  34. }
  35. // Mode
  36. if (!faux_str_is_empty(info->mode)) {
  37. kentry_mode_e mode = KENTRY_MODE_NONE;
  38. if (!faux_str_casecmp(info->mode, "sequence"))
  39. mode = KENTRY_MODE_SEQUENCE;
  40. else if (!faux_str_casecmp(info->mode, "switch"))
  41. mode = KENTRY_MODE_SWITCH;
  42. else if (!faux_str_casecmp(info->mode, "empty"))
  43. mode = KENTRY_MODE_EMPTY;
  44. if ((KENTRY_MODE_NONE == mode) || !kentry_set_mode(entry, mode)) {
  45. faux_error_add(error, TAG": Illegal 'mode' attribute");
  46. retcode = BOOL_FALSE;
  47. }
  48. }
  49. // Purpose
  50. if (!faux_str_is_empty(info->purpose)) {
  51. kentry_purpose_e purpose = KENTRY_PURPOSE_NONE;
  52. if (!faux_str_casecmp(info->purpose, "common"))
  53. purpose = KENTRY_PURPOSE_COMMON;
  54. else if (!faux_str_casecmp(info->purpose, "ptype"))
  55. purpose = KENTRY_PURPOSE_PTYPE;
  56. else if (!faux_str_casecmp(info->purpose, "prompt"))
  57. purpose = KENTRY_PURPOSE_PROMPT;
  58. else if (!faux_str_casecmp(info->purpose, "cond"))
  59. purpose = KENTRY_PURPOSE_COND;
  60. else if (!faux_str_casecmp(info->purpose, "completion"))
  61. purpose = KENTRY_PURPOSE_COMPLETION;
  62. else if (!faux_str_casecmp(info->purpose, "help"))
  63. purpose = KENTRY_PURPOSE_HELP;
  64. else if (!faux_str_casecmp(info->purpose, "log"))
  65. purpose = KENTRY_PURPOSE_LOG;
  66. if ((KENTRY_PURPOSE_NONE == purpose) || !kentry_set_purpose(entry, purpose)) {
  67. faux_error_add(error, TAG": Illegal 'purpose' attribute");
  68. retcode = BOOL_FALSE;
  69. }
  70. }
  71. // Min occurs
  72. if (!faux_str_is_empty(info->min)) {
  73. unsigned int i = 0;
  74. if (!faux_conv_atoui(info->min, &i, 0) ||
  75. !kentry_set_min(entry, (size_t)i)) {
  76. faux_error_add(error, TAG": Illegal 'min' attribute");
  77. retcode = BOOL_FALSE;
  78. }
  79. }
  80. // Max occurs
  81. if (!faux_str_is_empty(info->max)) {
  82. unsigned int i = 0;
  83. if (!faux_conv_atoui(info->max, &i, 0) ||
  84. !kentry_set_max(entry, (size_t)i)) {
  85. faux_error_add(error, TAG": Illegal 'max' attribute");
  86. retcode = BOOL_FALSE;
  87. }
  88. }
  89. // Ref string
  90. if (!faux_str_is_empty(info->ref)) {
  91. if (!kentry_set_ref_str(entry, info->ref)) {
  92. faux_error_add(error, TAG": Illegal 'ref' attribute");
  93. retcode = BOOL_FALSE;
  94. }
  95. }
  96. // Value
  97. if (!faux_str_is_empty(info->value)) {
  98. if (!kentry_set_value(entry, info->value)) {
  99. faux_error_add(error, TAG": Illegal 'value' attribute");
  100. retcode = BOOL_FALSE;
  101. }
  102. }
  103. // Restore
  104. if (!faux_str_is_empty(info->restore)) {
  105. bool_t b = BOOL_FALSE;
  106. if (!faux_conv_str2bool(info->restore, &b) ||
  107. !kentry_set_restore(entry, b)) {
  108. faux_error_add(error, TAG": Illegal 'restore' attribute");
  109. retcode = BOOL_FALSE;
  110. }
  111. }
  112. // Order
  113. if (!faux_str_is_empty(info->order)) {
  114. bool_t b = BOOL_FALSE;
  115. if (!faux_conv_str2bool(info->order, &b) ||
  116. !kentry_set_order(entry, b)) {
  117. faux_error_add(error, TAG": Illegal 'order' attribute");
  118. retcode = BOOL_FALSE;
  119. }
  120. }
  121. // Filter
  122. if (!faux_str_is_empty(info->filter)) {
  123. kentry_filter_e filter = KENTRY_FILTER_NONE;
  124. if (!faux_str_casecmp(info->filter, "false"))
  125. filter = KENTRY_FILTER_FALSE;
  126. else if (!faux_str_casecmp(info->filter, "true"))
  127. filter = KENTRY_FILTER_TRUE;
  128. else if (!faux_str_casecmp(info->filter, "dual"))
  129. filter = KENTRY_FILTER_DUAL;
  130. if ((KENTRY_FILTER_NONE == filter) || !kentry_set_filter(entry, filter)) {
  131. faux_error_add(error, TAG": Illegal 'filter' attribute");
  132. retcode = BOOL_FALSE;
  133. }
  134. }
  135. return retcode;
  136. }
  137. bool_t ientry_parse_nested(const ientry_t *ientry, kentry_t *kentry,
  138. faux_error_t *error)
  139. {
  140. bool_t retval = BOOL_TRUE;
  141. if (!kentry || !ientry) {
  142. faux_error_add(error, TAG": Internal error");
  143. return BOOL_FALSE;
  144. }
  145. // ENTRY list
  146. // ENTRYs can be duplicate. Duplicated ENTRY will add nested
  147. // elements to existent ENTRY. Also it can overwrite ENTRY attributes.
  148. // So there is no special rule which attribute value will be "on top".
  149. // It's a random. Technically later ENTRYs will rewrite previous
  150. // values.
  151. if (ientry->entrys) {
  152. ientry_t **p_ientry = NULL;
  153. for (p_ientry = *ientry->entrys; *p_ientry; p_ientry++) {
  154. kentry_t *nkentry = NULL;
  155. ientry_t *nientry = *p_ientry;
  156. const char *entry_name = nientry->name;
  157. if (entry_name)
  158. nkentry = kentry_find_entry(kentry, entry_name);
  159. // ENTRY already exists
  160. if (nkentry) {
  161. if (!ientry_parse(nientry, nkentry, error)) {
  162. retval = BOOL_FALSE;
  163. continue;
  164. }
  165. if (!ientry_parse_nested(nientry, nkentry,
  166. error)) {
  167. retval = BOOL_FALSE;
  168. continue;
  169. }
  170. continue;
  171. }
  172. // New ENTRY
  173. nkentry = ientry_load(nientry, error);
  174. if (!nkentry) {
  175. retval = BOOL_FALSE;
  176. continue;
  177. }
  178. kentry_set_parent(nkentry, kentry); // Set parent entry
  179. if (!kentry_add_entrys(kentry, nkentry)) {
  180. faux_error_sprintf(error,
  181. TAG": Can't add ENTRY \"%s\"",
  182. kentry_name(nkentry));
  183. kentry_free(nkentry);
  184. retval = BOOL_FALSE;
  185. continue;
  186. }
  187. }
  188. }
  189. // ACTION list
  190. if (ientry->actions) {
  191. iaction_t **p_iaction = NULL;
  192. for (p_iaction = *ientry->actions; *p_iaction; p_iaction++) {
  193. kaction_t *kaction = NULL;
  194. iaction_t *iaction = *p_iaction;
  195. kaction = iaction_load(iaction, error);
  196. if (!kaction) {
  197. retval = BOOL_FALSE;
  198. continue;
  199. }
  200. if (!kentry_add_actions(kentry, kaction)) {
  201. faux_error_sprintf(error,
  202. TAG": Can't add ACTION #%d",
  203. kentry_actions_len(kentry) + 1);
  204. kaction_free(kaction);
  205. retval = BOOL_FALSE;
  206. continue;
  207. }
  208. }
  209. }
  210. // HOTKEY list
  211. if (ientry->hotkeys) {
  212. ihotkey_t **p_ihotkey = NULL;
  213. for (p_ihotkey = *ientry->hotkeys; *p_ihotkey; p_ihotkey++) {
  214. khotkey_t *khotkey = NULL;
  215. ihotkey_t *ihotkey = *p_ihotkey;
  216. khotkey = ihotkey_load(ihotkey, error);
  217. if (!khotkey) {
  218. retval = BOOL_FALSE;
  219. continue;
  220. }
  221. if (!kentry_add_hotkeys(kentry, khotkey)) {
  222. faux_error_sprintf(error,
  223. TAG": Can't add HOTKEY \"%s\"",
  224. khotkey_key(khotkey));
  225. khotkey_free(khotkey);
  226. retval = BOOL_FALSE;
  227. continue;
  228. }
  229. }
  230. }
  231. if (!retval)
  232. faux_error_sprintf(error, TAG" \"%s\": Illegal nested elements",
  233. kentry_name(kentry));
  234. return retval;
  235. }
  236. kentry_t *ientry_load(const ientry_t *ientry, faux_error_t *error)
  237. {
  238. kentry_t *kentry = NULL;
  239. if (!ientry)
  240. return NULL;
  241. // Name [mandatory]
  242. if (faux_str_is_empty(ientry->name)) {
  243. faux_error_add(error, TAG": Empty 'name' attribute");
  244. return NULL;
  245. }
  246. kentry = kentry_new(ientry->name);
  247. if (!kentry) {
  248. faux_error_sprintf(error, TAG" \"%s\": Can't create object",
  249. ientry->name);
  250. return NULL;
  251. }
  252. if (!ientry_parse(ientry, kentry, error)) {
  253. kentry_free(kentry);
  254. return NULL;
  255. }
  256. // Parse nested elements
  257. if (!ientry_parse_nested(ientry, kentry, error)) {
  258. kentry_free(kentry);
  259. return NULL;
  260. }
  261. return kentry;
  262. }
  263. char *ientry_deploy(const kentry_t *kentry, int level)
  264. {
  265. char *str = NULL;
  266. char *tmp = NULL;
  267. char *mode = NULL;
  268. char *purpose = NULL;
  269. char *filter = NULL;
  270. kentry_entrys_node_t *entrys_iter = NULL;
  271. kentry_actions_node_t *actions_iter = NULL;
  272. kentry_hotkeys_node_t *hotkeys_iter = NULL;
  273. char *num = NULL;
  274. tmp = faux_str_sprintf("%*cENTRY {\n", level, ' ');
  275. faux_str_cat(&str, tmp);
  276. faux_str_free(tmp);
  277. attr2ctext(&str, "name", kentry_name(kentry), level + 1);
  278. attr2ctext(&str, "help", kentry_help(kentry), level + 1);
  279. attr2ctext(&str, "ref", kentry_ref_str(kentry), level + 1);
  280. // Links (ENTRY with 'ref' attribute) doesn't need the following filds
  281. // that will be replaced by content of referenced ENTRY
  282. if (faux_str_is_empty(kentry_ref_str(kentry))) {
  283. attr2ctext(&str, "container", faux_conv_bool2str(kentry_container(kentry)), level + 1);
  284. // Mode
  285. switch (kentry_mode(kentry)) {
  286. case KENTRY_MODE_SEQUENCE:
  287. mode = "sequence";
  288. break;
  289. case KENTRY_MODE_SWITCH:
  290. mode = "switch";
  291. break;
  292. case KENTRY_MODE_EMPTY:
  293. mode = "empty";
  294. break;
  295. default:
  296. mode = NULL;
  297. }
  298. attr2ctext(&str, "mode", mode, level + 1);
  299. // Purpose
  300. switch (kentry_purpose(kentry)) {
  301. case KENTRY_PURPOSE_COMMON:
  302. purpose = "common";
  303. break;
  304. case KENTRY_PURPOSE_PTYPE:
  305. purpose = "ptype";
  306. break;
  307. case KENTRY_PURPOSE_PROMPT:
  308. purpose = "prompt";
  309. break;
  310. case KENTRY_PURPOSE_COND:
  311. purpose = "cond";
  312. break;
  313. case KENTRY_PURPOSE_COMPLETION:
  314. purpose = "completion";
  315. break;
  316. case KENTRY_PURPOSE_HELP:
  317. purpose = "help";
  318. break;
  319. case KENTRY_PURPOSE_LOG:
  320. purpose = "log";
  321. break;
  322. default:
  323. purpose = NULL;
  324. }
  325. attr2ctext(&str, "purpose", purpose, level + 1);
  326. // Min occurs
  327. num = faux_str_sprintf("%u", kentry_min(kentry));
  328. attr2ctext(&str, "min", num, level + 1);
  329. faux_str_free(num);
  330. num = NULL;
  331. // Max occurs
  332. num = faux_str_sprintf("%u", kentry_max(kentry));
  333. attr2ctext(&str, "max", num, level + 1);
  334. faux_str_free(num);
  335. num = NULL;
  336. attr2ctext(&str, "value", kentry_value(kentry), level + 1);
  337. attr2ctext(&str, "restore", faux_conv_bool2str(kentry_restore(kentry)), level + 1);
  338. attr2ctext(&str, "order", faux_conv_bool2str(kentry_order(kentry)), level + 1);
  339. // Filter
  340. switch (kentry_filter(kentry)) {
  341. case KENTRY_FILTER_FALSE:
  342. filter = "false";
  343. break;
  344. case KENTRY_FILTER_TRUE:
  345. filter = "true";
  346. break;
  347. case KENTRY_FILTER_DUAL:
  348. filter = "dual";
  349. break;
  350. default:
  351. filter = NULL;
  352. }
  353. attr2ctext(&str, "filter", filter, level + 1);
  354. // ENTRY list
  355. entrys_iter = kentry_entrys_iter(kentry);
  356. if (entrys_iter) {
  357. kentry_t *nentry = NULL;
  358. tmp = faux_str_sprintf("\n%*cENTRY_LIST\n\n", level + 1, ' ');
  359. faux_str_cat(&str, tmp);
  360. faux_str_free(tmp);
  361. while ((nentry = kentry_entrys_each(&entrys_iter))) {
  362. tmp = ientry_deploy(nentry, level + 2);
  363. faux_str_cat(&str, tmp);
  364. faux_str_free(tmp);
  365. }
  366. tmp = faux_str_sprintf("%*cEND_ENTRY_LIST,\n", level + 1, ' ');
  367. faux_str_cat(&str, tmp);
  368. faux_str_free(tmp);
  369. }
  370. // ACTION list
  371. actions_iter = kentry_actions_iter(kentry);
  372. if (actions_iter) {
  373. kaction_t *action = NULL;
  374. tmp = faux_str_sprintf("\n%*cACTION_LIST\n\n", level + 1, ' ');
  375. faux_str_cat(&str, tmp);
  376. faux_str_free(tmp);
  377. while ((action = kentry_actions_each(&actions_iter))) {
  378. tmp = iaction_deploy(action, level + 2);
  379. faux_str_cat(&str, tmp);
  380. faux_str_free(tmp);
  381. }
  382. tmp = faux_str_sprintf("%*cEND_ACTION_LIST,\n", level + 1, ' ');
  383. faux_str_cat(&str, tmp);
  384. faux_str_free(tmp);
  385. }
  386. // HOTKEY list
  387. hotkeys_iter = kentry_hotkeys_iter(kentry);
  388. if (hotkeys_iter) {
  389. khotkey_t *hotkey = NULL;
  390. tmp = faux_str_sprintf("\n%*cHOTKEY_LIST\n\n", level + 1, ' ');
  391. faux_str_cat(&str, tmp);
  392. faux_str_free(tmp);
  393. while ((hotkey = kentry_hotkeys_each(&hotkeys_iter))) {
  394. tmp = ihotkey_deploy(hotkey, level + 2);
  395. faux_str_cat(&str, tmp);
  396. faux_str_free(tmp);
  397. }
  398. tmp = faux_str_sprintf("%*cEND_HOTKEY_LIST,\n", level + 1, ' ');
  399. faux_str_cat(&str, tmp);
  400. faux_str_free(tmp);
  401. }
  402. } // ref_str
  403. tmp = faux_str_sprintf("%*c},\n\n", level, ' ');
  404. faux_str_cat(&str, tmp);
  405. faux_str_free(tmp);
  406. return str;
  407. }