123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303 |
- #include <stdlib.h>
- #include <stdio.h>
- #include <string.h>
- #include <assert.h>
- #include <faux/str.h>
- #include <faux/list.h>
- #include <klish/khelper.h>
- #include <klish/kplugin.h>
- #include <klish/kptype.h>
- #include <klish/kview.h>
- #include <klish/kscheme.h>
- #include <klish/iview.h>
- #include <klish/ischeme.h>
- #define TAG "SCHEME"
- bool_t ischeme_parse_nested(const ischeme_t *ischeme, kscheme_t *kscheme,
- faux_error_t *error)
- {
- bool_t retval = BOOL_TRUE;
- if (!kscheme || !ischeme) {
- faux_error_add(error, TAG": Internal error");
- return BOOL_FALSE;
- }
- // PLUGIN list
- if (ischeme->plugins) {
- iplugin_t **p_iplugin = NULL;
- for (p_iplugin = *ischeme->plugins; *p_iplugin; p_iplugin++) {
- kplugin_t *kplugin = NULL;
- iplugin_t *iplugin = *p_iplugin;
- kplugin = iplugin_load(iplugin, error);
- if (!kplugin) {
- retval = BOOL_FALSE; // Don't stop
- continue;
- }
- if (!kscheme_add_plugins(kscheme, kplugin)) {
- // Search for PLUGIN duplicates
- if (kscheme_find_plugin(kscheme,
- kplugin_name(kplugin))) {
- faux_error_sprintf(error,
- TAG": Can't add duplicate PLUGIN "
- "\"%s\"", kplugin_name(kplugin));
- } else {
- faux_error_sprintf(error,
- TAG": Can't add PLUGIN \"%s\"",
- kplugin_name(kplugin));
- }
- kplugin_free(kplugin);
- retval = BOOL_FALSE;
- }
- }
- }
- // PTYPE list
- if (ischeme->ptypes) {
- iptype_t **p_iptype = NULL;
- for (p_iptype = *ischeme->ptypes; *p_iptype; p_iptype++) {
- kptype_t *kptype = NULL;
- iptype_t *iptype = *p_iptype;
- kptype = iptype_load(iptype, error);
- if (!kptype) {
- retval = BOOL_FALSE; // Don't stop
- continue;
- }
- if (!kscheme_add_ptypes(kscheme, kptype)) {
- // Search for PTYPE duplicates
- if (kscheme_find_ptype(kscheme,
- kptype_name(kptype))) {
- faux_error_sprintf(error,
- TAG": Can't add duplicate PTYPE "
- "\"%s\"", kptype_name(kptype));
- } else {
- faux_error_sprintf(error,
- TAG": Can't add PTYPE \"%s\"",
- kptype_name(kptype));
- }
- kptype_free(kptype);
- retval = BOOL_FALSE;
- }
- }
- }
- // VIEW list
- // VIEW entries can be duplicate. Duplicated entries will add nested
- // elements to existent VIEW. Also it can overwrite VIEW attributes.
- // So there is no special rule which attribute value will be "on top".
- // It's a random. Technically later VIEW entries will rewrite previous
- // values.
- if (ischeme->views) {
- iview_t **p_iview = NULL;
- for (p_iview = *ischeme->views; *p_iview; p_iview++) {
- kview_t *kview = NULL;
- iview_t *iview = *p_iview;
- const char *view_name = iview->name;
- if (view_name)
- kview = kscheme_find_view(kscheme, view_name);
- // VIEW already exists
- if (kview) {
- if (!iview_parse(iview, kview, error)) {
- retval = BOOL_FALSE;
- continue;
- }
- if (!iview_parse_nested(iview, kview,
- error)) {
- retval = BOOL_FALSE;
- continue;
- }
- continue;
- }
- // New VIEW
- kview = iview_load(iview, error);
- if (!kview) {
- retval = BOOL_FALSE;
- continue;
- }
- if (!kscheme_add_views(kscheme, kview)) {
- faux_error_sprintf(error,
- TAG": Can't add VIEW \"%s\"",
- kview_name(kview));
- kview_free(kview);
- retval = BOOL_FALSE;
- continue;
- }
- }
- }
- // ENTRY list
- // ENTRYs can be duplicate. Duplicated ENTRY will add nested
- // elements to existent ENTRY. Also it can overwrite ENTRY attributes.
- // So there is no special rule which attribute value will be "on top".
- // It's a random. Technically later ENTRYs will rewrite previous
- // values.
- if (ischeme->entrys) {
- ientry_t **p_ientry = NULL;
- for (p_ientry = *ischeme->entrys; *p_ientry; p_ientry++) {
- kentry_t *nkentry = NULL;
- ientry_t *nientry = *p_ientry;
- const char *entry_name = nientry->name;
- if (entry_name)
- nkentry = kscheme_find_entry(kscheme, entry_name);
- // ENTRY already exists
- if (nkentry) {
- if (!ientry_parse(nientry, nkentry, error)) {
- retval = BOOL_FALSE;
- continue;
- }
- if (!ientry_parse_nested(nientry, nkentry,
- error)) {
- retval = BOOL_FALSE;
- continue;
- }
- continue;
- }
- // New ENTRY
- nkentry = ientry_load(nientry, error);
- if (!nkentry) {
- retval = BOOL_FALSE;
- continue;
- }
- kentry_set_parent(nkentry, NULL); // Set empty parent entry
- if (!kscheme_add_entrys(kscheme, nkentry)) {
- faux_error_sprintf(error,
- TAG": Can't add ENTRY \"%s\"",
- kentry_name(nkentry));
- kentry_free(nkentry);
- retval = BOOL_FALSE;
- continue;
- }
- }
- }
- if (!retval)
- faux_error_sprintf(error, TAG": Illegal nested elements");
- return retval;
- }
- bool_t ischeme_load(const ischeme_t *ischeme, kscheme_t *kscheme,
- faux_error_t *error)
- {
- assert(kscheme);
- if (!kscheme) {
- faux_error_sprintf(error, TAG": Internal error");
- return BOOL_FALSE;
- }
- // Parse nested elements
- return ischeme_parse_nested(ischeme, kscheme, error);
- }
- char *ischeme_deploy(const kscheme_t *scheme, int level)
- {
- char *str = NULL;
- char *tmp = NULL;
- kscheme_plugins_node_t *plugins_iter = NULL;
- kscheme_ptypes_node_t *ptypes_iter = NULL;
- kscheme_views_node_t *views_iter = NULL;
- kscheme_entrys_node_t *entrys_iter = NULL;
- tmp = faux_str_sprintf("ischeme_t sch = {\n");
- faux_str_cat(&str, tmp);
- faux_str_free(tmp);
- // PLUGIN list
- plugins_iter = kscheme_plugins_iter(scheme);
- if (plugins_iter) {
- kplugin_t *plugin = NULL;
- tmp = faux_str_sprintf("\n%*cPLUGIN_LIST\n\n", level, ' ');
- faux_str_cat(&str, tmp);
- faux_str_free(tmp);
- while ((plugin = kscheme_plugins_each(&plugins_iter))) {
- tmp = iplugin_deploy(plugin, level + 2);
- faux_str_cat(&str, tmp);
- faux_str_free(tmp);
- }
- tmp = faux_str_sprintf("%*cEND_PLUGIN_LIST,\n", level + 1, ' ');
- faux_str_cat(&str, tmp);
- faux_str_free(tmp);
- }
- // PTYPE list
- ptypes_iter = kscheme_ptypes_iter(scheme);
- if (ptypes_iter) {
- kptype_t *ptype = NULL;
- tmp = faux_str_sprintf("\n%*cPTYPE_LIST\n\n", level, ' ');
- faux_str_cat(&str, tmp);
- faux_str_free(tmp);
- while ((ptype = kscheme_ptypes_each(&ptypes_iter))) {
- tmp = iptype_deploy(ptype, level + 2);
- faux_str_cat(&str, tmp);
- faux_str_free(tmp);
- }
- tmp = faux_str_sprintf("%*cEND_PTYPE_LIST,\n", level + 1, ' ');
- faux_str_cat(&str, tmp);
- faux_str_free(tmp);
- }
- // VIEW list
- views_iter = kscheme_views_iter(scheme);
- if (views_iter) {
- kview_t *view = NULL;
- tmp = faux_str_sprintf("\n%*cVIEW_LIST\n\n", level + 1, ' ');
- faux_str_cat(&str, tmp);
- faux_str_free(tmp);
- while ((view = kscheme_views_each(&views_iter))) {
- tmp = iview_deploy(view, level + 2);
- faux_str_cat(&str, tmp);
- faux_str_free(tmp);
- }
- tmp = faux_str_sprintf("%*cEND_VIEW_LIST,\n", level + 1, ' ');
- faux_str_cat(&str, tmp);
- faux_str_free(tmp);
- }
- // ENTRY list
- entrys_iter = kscheme_entrys_iter(scheme);
- if (entrys_iter) {
- kentry_t *entry = NULL;
- tmp = faux_str_sprintf("\n%*cENTRY_LIST\n\n", level, ' ');
- faux_str_cat(&str, tmp);
- faux_str_free(tmp);
- while ((entry = kscheme_entrys_each(&entrys_iter))) {
- tmp = ientry_deploy(entry, level + 2);
- faux_str_cat(&str, tmp);
- faux_str_free(tmp);
- }
- tmp = faux_str_sprintf("%*cEND_ENTRY_LIST,\n", level + 1, ' ');
- faux_str_cat(&str, tmp);
- faux_str_free(tmp);
- }
- tmp = faux_str_sprintf("};\n");
- faux_str_cat(&str, tmp);
- faux_str_free(tmp);
- return str;
- }
|