X-Git-Url: https://git.harvie.cz/?a=blobdiff_plain;f=cll1.h;h=a12fdfffae86f8a30fdcda710d6e6d7e812ac957;hb=b3674906486c6b6fd944b4c7ffd280589cf8a165;hp=47e7024ad68dab47de88c825cf6575d69cc8f3b5;hpb=79c1af4ba4ce2faca03a60d9768873f494dd4c8b;p=svn%2FCll1h%2F.git diff --git a/cll1.h b/cll1.h index 47e7024..a12fdff 100644 --- a/cll1.h +++ b/cll1.h @@ -1,8 +1,9 @@ -/* ------------------------------------------------------------------- */ -/* C<<1 header file v0.7.1 - style sheet for ANSI C */ -/* CERL - Cumbersome Extraction and Report Language */ -/* ------------------------------------------------------------------- */ -/* Copyright (c) 2004-2008 Michael xChaos Polak, x(at)n.cz +/* .----------------------------------------------------------------------. + / C<<1 header file - C language style sheet - GNU C/ANSI C99 compliant + / Cumbersome Extraction and Report Language - http://cll1h.arachne.cz/ +'---------------------------------------------------------------------- */ +/* + Copyright (c) 2004-2008 Michael xChaos Polak - x(at)n.cz The C<<1 header file is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public @@ -14,17 +15,32 @@ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for more details. - You should have received a copy of the GNU Lesser General Public - License along with the GNU C Library; if not, write to - Michael Polak, Svojsikova 7, 169 00 Praha 6 Czech Republic */ -/* ------------------------------------------------------------------- */ -#ifndef __CLL1H__ -#define __CLL1H__ + You should have received a copy of the GNU Lesser General Public License + along with C<<1 header file; if not, write to the Free Software + Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA + +*/ +#ifndef _CLL1_H +#define _CLL1_H +#define CLL1H_VERSION "0.7.1" +/* .----------------------------------------------------------------------. + / 0. Library definitions not parsed by @CC, updated 2008-01-26 xCh. + '---------------------------------------------------------------------- */ +/* +@define USE_LIBRARY_MYSQL -lmysqlclient +@define USE_LIBRARY_FASTCGI -lfcgi +@define USE_PREPROCESSOR cake *.html *.xml > _include.c +@define USE_POSTPROCESSOR strip @ +*/ +/* .----------------------------------------------------------------------. + / 1. C<<1 header auto include, updated 2008-01-26 xCh. + '---------------------------------------------------------------------- */ #include #include #include #include +#include #include #ifdef USE_LIBRARY_MYSQL #include @@ -34,78 +50,179 @@ #else #include #endif -/* ------------------------------------------------------------------- */ -/* 1. C<<1 constants and optional keywords, updated 2008-01-07 by xCh. */ -/* ------------------------------------------------------------------- */ +/* .----------------------------------------------------------------------. + / 2. C<<1 then buddhist section, updated 2008-01-26 xCh. + '----------------------------------------------------------------------- */ +#ifndef DISABLE_MODULE_THEN_BUDDHISM #define then +#define MAYBE (int)((RANDOM_SEED?random():(RANDOM_SEED=time(NULL),srandom(RANDOM_SEED),random()))%2) +#define WHOKNOWS (int)(srandom(time(NULL)),random()%2) +#define create_var(ID,TYPE,INIT) TYPE ID=INIT +#define define_var(ID,TYPE) TYPE ID +#endif +/* .----------------------------------------------------------------------. + / 3. C<<1 constants and optional keywords, updated 2008-01-26 xCh. + '----------------------------------------------------------------------- */ #define not ! #define and && #define or || +#define boolean int +#define bool_str(VALUE) ((VALUE)?"TRUE":"FALSE") #define TRUE 1 #define FALSE 0 -/* ------------------------------------------------------------------- */ -/* 2. C<<1 data types - updated 2008-01-07 by xCh. */ -/* ------------------------------------------------------------------- */ -#define list(T) struct T *_next -#define tree(T) struct T *_next;struct T *_seek -#define create(A,T) (A=(struct T *)malloc(sizeof(struct T)),A->_next=NULL,A) -#define push(A,B) ((A && A!=B)?A->_next=B:0,B=A) -#define pop(A,B) (B?((A?free(A):0),A=B=B->_next):(A=NULL)) -#define append(A,B) if(B) { void *N=A; A->_next=NULL; for_search(A,B,!A->_next) {A->_next=N; break;}} else push(A,B); -#define remove(A,B,C) { void **_D=NULL; for_search(A,B,C) { if(_D)*_D=A->_next; else B=A->_next; free(A); } else _D=(void *)&(A->_next); } -#define drop(A,B) for( A=B; A || (B=NULL); B=A, A=A->_next, free(B) ) -/* ------------------------------------------------------------------- */ -/* 3. C<<1 iterators - updated 2008-01-07 by xCh. */ -/* ------------------------------------------------------------------- */ -#define loop while(TRUE) -#define repeat(N) _NEW_I for_range(_I,1,N) -#define for_range(VAR,FROM,TO) for(VAR=FROM; FROM<=TO?VAR<=TO:VAR>=TO; FROM<=TO?VAR++:VAR--) -#define for_each(A,B) for(A=B; A; A=A->_next) -#define for_search(A,B,C) for_each(A,B) if(C) -/*to do: #define for_file_lines(STR,F) _NEW_F for() */ -#ifdef USE_LIBRARY_MYSQL -#define for_mysql_query_results(ROW,QUERY) _NEW_(_Ratom,_Rstack,_RStack)for(_Ratom->R=(mysql_query(_Matom->M,QUERY)?NULL:mysql_use_result(_Matom->M)),ROW=(_Ratom->R?mysql_fetch_row(_Ratom->R):NULL);ROW;ROW=mysql_fetch_row(_Ratom->R)) -#endif -#ifdef USE_LIBRARY_FASTCGI -#define while_fastcgi_accept while(FCGI_Accept()>=0) -#endif -/*obsolete #define every(A,B) for( A=B; A; A=A->_next) */ -/*obsolete #define search(A,B,C) every(A,B) if(C) */ -/*obsolete #define find(A,B,C) search(A,B,C) break; if(A) */ - -/* ------------------------------------------------------------------- */ -/* 4.C<<1 conditionals - updated 2008-01-07 by xCh. */ -/* ------------------------------------------------------------------- */ -#define if_exists(A,B,C) for_search(A,B,C) break; if(A) - -/* ------------------------------------------------------------------- */ -/* old - from version 0.6 */ -/* ------------------------------------------------------------------- */ -/* EXP macros for Dummysort sequences, updated 2003-05-29 by xCh. */ - +#define coalesce(VAR,NOTNULL) (VAR?VAR:(NOTNULL)) +#define mem struct +#define _GLOBALS time_t RANDOM_SEED=0; char *EOL="\n", *OFS=" ", *IFS=" \t\n", *NIL="NULL"; +/* .----------------------------------------------------------------------. + / 4. C<<1 data declaration and allocation, updated 2008-01-07 xCh. + '----------------------------------------------------------------------- */ +#define create_str(ID,INIT) char *ID=INIT +#define define_str(ID) char *ID=NULL +#define create_mem(ID,...) struct _ARG1(__VA_ARGS__,) *ID=get_mem(__VA_ARGS__) +#define define_mem(ID,TYPE) struct TYPE *ID=NULL +#define define_mems(ID1,ID2,TYPE) define_mem(ID1,TYPE); define_mem(ID2,TYPE) +#define create_list(ID1,I2,TYPE) create_mem(ID1,TYPE); struct TYPE *ID2=((ID1->__next=NULL),ID1) +#define create_context(ID) create_mem(ID,_MAtom) +#define define_context(ID) define_mem(ID,_MAtom) +#define list(TYPE) struct TYPE *__next +#define tree(TYPE) struct TYPE *__next; struct TYPE *__seek +#define dictionary(TYPE) tree(TYPE); char *__key +#define array(TYPE) tree(TYPE); int __key +#define interface(TYPE) struct TYPE *__interface +#define get_mem(...) (struct _ARG1(__VA_ARGS__,)*)_cll1_malloc(sizeof(struct _ARG1(__VA_ARGS__,)), _ARG2(__VA_ARGS__,,) - 0 ) +#define get_str(...) (char *)_cll1_get_str(__VA_ARGS__,(void *)&_cll1_get_str) +/* .----------------------------------------------------------------------. + / 5. C<<1 string manipulation, updated 2008-01-26 xCh. + '----------------------------------------------------------------------- */ +#define eq(A,B) !strcmp(A,B) +#define eqi(A,B) !strcasecmp(A,B) +#define print(...) _cll1_print(__VA_ARGS__,(void *)&_cll1_print) +#define fprint(...) _cll1_fprint(__VA_ARGS__,(void *)&_cll1_fprint) +#define file_print(...) _cll1_fprint(_F,__VA_ARGS__,(void *)&_cll1_fprint) +#define echo(...) _cll1_echo(__VA_ARGS__,(void *)&_cll1_echo) +#define fecho(...) _cll1_fecho(__VA_ARGS__,(void *)&_cll1_fecho) +#define file_echo(...) _cll1_fecho(_F,__VA_ARGS__,(void *)&_cll1_fecho) +#define suffix(A,B,C) (((A=strrchr(B,C))&&!(*(A++)=0))||(A=B)) +#define prefix(A,B,C) ((A=B),((B=strchr(B,C))&&!(*(B++)=0)||(B=A))) +#define for_split_str(A,B,C) for(prefix(A,B,C);A;(A!=B)&&prefix(A,B,C)||(A=NULL)) +#define for_valid_split(A,B,C) for_split_str(A,B,C) if(*A) +#define switch_for_columns(A,B,C) _FOR_COLUMNS(A,B,C) switch(__I) +#define switch_for_valid_columns(A,B,C) _FOR_VALID_COLUMNS(A,B,C) switch (_I) +#define if_column_number(A,B,C,V) _FOR_COLUMNS(A,B,C) if(_I==V) +#define if_valid_column_number(A,B,C,V) _FOR_VALID_COLUMNS(A,B,C) if(_I==V) +#define tr(STR,B,C) {char *_S=STR; /***/ while(S && *_S) {if(*_S==B)*_S=C; _S++;} } +/* .----------------------------------------------------------------------. + / 6. C<<1 data container manipulation, updated 2008-01-26 xCh. + '----------------------------------------------------------------------- */ +#define push(NODE,HEAD) ( NODE ? ((NODE->__next=HEAD),(HEAD=NODE)) : NULL ) +#define pop(NODE,HEAD) ( HEAD ? ((NODE=HEAD->__next),free(HEAD),(HEAD=NODE)) : (NODE=NULL) ) +#define append(NODE,HEAD) { void *N=NODE; /**/ NODE->__next=NULL; for_search(NODE,HEAD,!NODE->__next) { NODE->__next=N; break; } } +#define remove(NODE,HEAD,EXPR) { void **_D=NULL; /**/ for_search(NODE,HEAD,EXPR) { if(_D)*_D=NODE->__next; else HEAD=NODE->__next; free(NODE); } else _D=(void *)&(NODE->__next); } +#define drop(NODE,HEAD) for( NODE=HEAD; NODE || (HEAD=NULL); HEAD=NODE, NODE=NODE->__next, free(HEAD) ) +//to do: seek +//to do: store #define order_by(K1,K2) (K1>K2) #define desc_order_by(K1,K2) (K10) #define desc_sort_by(K1,K2) (strcasecmp(K1, K2)<0) #define ascii_by(K1,K2) (strcmp(K1, K2)>0) #define desc_ascii_by(K1,K2) (strcmp(K1, K2)<0) - -/* Dummysort sequences, updated 2003-05-29 by xCh. */ - -#define insert(A,B,EXP,K) { if(B) { void **_L=NULL, *H=B; for_search(B,H,EXP(B->K,A->K)) { if(_L) {*_L=A; A->_next=B; } else push(A,H); break; } else _L=(void *)&(B->_next); if(!B)*_L=A; B=H; } else push(A,B); } -#define sort(A,B,EXP,K) { void *_C; A=B; B=NULL; do { _C=A->_next; A->_next=NULL; insert(A,B,EXP,K); A=_C; } while(_C); } - -/* String macros & sequences, updated 2004-04-19 by xCh. */ - -#define eq(A,B) !strcmp(A,B) -#define strcmpi(A,B) strcasecmp(A,B) +#define insert(NODE,HEAD,EXP,K) { if(HEAD) { void **_L=NULL, *H=HEAD; /**/ for_search(HEAD,H,EXP(HEAD->K,NODE->K)) { if(_L) {*_L=NODE; NODE->__next=HEAD; } else push(NODE,H); break; } else _L=(void *)&(HEAD->__next); if(!HEAD)*_L=NODE; HEAD=H; } else if (NODE) { push(NODE,HEAD); HEAD->__next=NULL; } } +#define sort(NODE,HEAD,EXP,K) { void *_NEXT; /**/ NODE=HEAD; HEAD=NULL; do { _NEXT=NODE->__next; NODE->__next=NULL; insert(NODE,HEAD,EXP,K); NODE=_NEXT; } while(_NEXT); } +/* .----------------------------------------------------------------------. + / 7. C<<1 builtin iterators and conditionals, updated 2008-01-26 xCh. + '----------------------------------------------------------------------- */ +#define loop while(TRUE) +#define repeat(N) if(N>0) _NEW_I for_range(_I,1,N) +#define for_range(VAR,FROM,TO) for( VAR=FROM ; FROM<=TO?VAR<=TO:VAR>=TO ; FROM<=TO?VAR++:VAR--) +#define for_each(NODE,HEAD) for(NODE=HEAD; NODE; NODE=NODE->__next) +#define for_search(NODE,HEAD,EXPR) for_each(NODE,HEAD) if(EXPR) +#define for_file_lines(STR,F) /* _NEW_F for() */ +#define for_ints(VAR,...) _NEW_I for( _I=0 ; (VAR=_cll1_it_ints(_I,__VA_ARGS__,-1))>=0 ; _I++) +#define for_strs(VAR,...) _NEW_I for( _I=0 ; (VAR=_cll1_it_strs(_I,__VA_ARGS__,(void *)&_cll1_it_strs))!=(void *)&_cll1_it_strs ; _I++) +#define if_exists(A,B,C) for_search(A,B,C) break; if(A) +#define for_args _NEW_I for(_I=1;_I1) +#define if_arg(VAL) if(eq(argv[_I],VAL)) +#define this_arg argv[_I] +#define next_arg ((_I+1METHOD=FUNCTION +#define construct_interface(MTYPE,...) _construct_##_##MTYPE##_##_ARG1(__VA_ARGS__)((void *)__get_##_##MTYPE##_##__VA_ARGS__) +#define get_object(TYPE,...) (struct TYPE *)_cll1_allocate_object(sizeof(struct TYPE), __VA_ARGS__) +#define construct_object(TYPE,...) +//#define _(OBJECT,...) (_ASSERT(OBJECT),/**/(*(OBJECT->interface->_ARG1(__VA_ARGS__,)))/**/(OBJECT,OBJECT->interface->__VA_ARGS__)/**/) +/* .----------------------------------------------------------------------. + / 9. implementation of C<<1 library functions, updated 2008-01-26 xCh. + '----------------------------------------------------------------------- */ +#define _MALLOC void *_cll1_malloc(size_t size,...) { /*temporary solution*/ return malloc(size); } +#define _CLL1_FPRINT(IOSTREAM,LASTARG) { int p2=0;char *ofs=coalesce(OFS,"\0");va_list ap; /**/ for(va_start(ap,s);s!=LASTARG;s=va_arg(ap,char *)) { if(p2 && *ofs) fputs(ofs,IOSTREAM); else p2=1; fputs(coalesce(s,NIL),IOSTREAM); } va_end(ap); if(EOL && *EOL) fputs(EOL,IOSTREAM); } +#define _PRINT void _cll1_print(char *s,...) _CLL1_FPRINT(stdout,(void *)&_cll1_print) +#define _FPRINT void _cll1_fprint(FILE *f,char *s,...) _CLL1_FPRINT(f,(void *)&_cll1_fprint) +#define _CLL1_FECHO(IOSTREAM,LASTARG) { va_list ap; /**/ for(va_start(ap,s);s!=LASTARG;s=va_arg(ap,char *)) fputs(coalesce(s,NIL),IOSTREAM); va_end(ap); } +#define _ECHO void _cll1_echo(char *s,...) _CLL1_FECHO(stdout,(void *)&_cll1_echo) +#define _FECHO void _cll1_fecho(FILE *f,char *s,...) _CLL1_FECHO(f,(void *)&_cll1_fecho) +#define _IT_INTS int _cll1_it_ints(int i, int n, ...) { int j=0;va_list ap; /**/ va_start(ap,n); while(n>=0 && j++_23=1,push(ATOM,STACK);ATOM->_23||pop(ATOM,STACK)&&0;ATOM->_23--) +#define _NEW_I for _NEW_(_Iatom,_Istack,_IAtom) +#define _NEW_S for _NEW_(_Satom,_Sstack,_SAtom) +#define _NEW_F for _NEW_(_Fatom,_Fstack,_FAtom) +#define _I (_Iatom->i) +#define _S (_Satom->s) +#define _F (_Satom->F) +#define _FOR_COLUMNS(A,B,C) _NEW_I for(_I=0,prefix(A,B,C);A;((A!=B)&&prefix(A,B,C)||(A=NULL)),_I++) +#define _FOR_VALID_COLUMNS(A,B,C) _NEW_I for(_I=0,prefix(A,B,C);A;((A!=B)&&prefix(A,B,C))||(A=NULL)) if(*A&&++_I) +/* .----------------------------------------------------------------------. + / 11. C<<1 CGI and FASTCGI handling, updated 2008-01-16 by xCh. + '----------------------------------------------------------------------- */ +#ifdef USE_LIBRARY_FASTCGI +#define while_fastcgi_accept while(FCGI_Accept()>=0) +#define USE_MODULE_CGI +#endif +#ifdef USE_MODULE_CGI +#define cgi(MIME) { char *PTR; /***/ recycle_context(_CGI); _CGIdict=NULL; for_split_str(PTR,getenv("QUERY_STRING"),'&') /* _init_cgi */ if(MIME) printf("Content-type: %s\r\n\r\n",MIME); } +//todo #define _GETCGI char *getcgi(VAR) { } +#define _CGIDICT define_context(_CGI); struct _CGIVariable { char *V; dictionary(_CGIVariable); } *_CGIvariable,*_CGIdict; +#else +#define _CGIDICT +#endif +/* .----------------------------------------------------------------------. + / 12. MySQL infrastructure and wrappers - updated 2007-12-19 by xCh. + '----------------------------------------------------------------------- */ +#ifdef USE_LIBRARY_MYSQL +#define mysql_connect(S,U,P,D) ((_SQLCatom=get_mem(_SQLCAtom)) && push(_SQLCatom,_SQLCstack) && (_SQLCatom->C=mysql_init(NULL)),(_SQLCatom->C && mysql_real_connect(_SQLCatom->C,S,U,P,D,0,NULL,0)?_SQLCatom->C:NULL)) +#define for_mysql_query_results(ROW,QUERY) _NEW_(_SQLRatom,_SQLRstack,_SQLRAtom)for(_SQLRatom->R=(mysql_query(_SQLCatom->C,QUERY)?NULL:mysql_use_result(_SQLCatom->C)),ROW=(_SQLRatom->R?mysql_fetch_row(_SQLRatom->R):NULL);ROW;ROW=mysql_fetch_row(_SQLRatom->R)) +#define _SQLCSTACK struct _SQLCAtom { MYSQL *C; int _23; list(_SQLCAtom); } *_SQLCatom,*_SQLCstack=NULL; +#define _SQLRSTACK struct _SQLRAtom { MYSQL_RES *R; int _23; list(_SQLRAtom); } *_SQLRatom,*_SQLRstack=NULL; +#else +#define _SQLCSTACK +#define _SQLRSTACK +#endif +/* ------------------------------------------------------------------- */ +/* old - from version 0.6 */ +/* =================================================================== */ +/* +obsolete #define strlwr(A) {char *_S=A; while(_&&*_S){*_S=tolower(*_S);_S++;}} #define strupr(A) {char *_S=A; while(_&&*_S){*_S=toupper(*_S);_S++;}} #define string(S,L) (S=(char *)malloc(L),*S=0) #define duplicate(A,B) if(A) { string(B,strlen(A)+1); strcpy(B,A); } #define concatenate(A,B,C) if (A && B) { string(C,strlen(A)+strlen(B)+1); strcpy(C,A); strcat(C,B); } -#define suffix(A,B,C) (((A=strrchr(B,C))&&!(*(A++)=0))||(A=B)) -#define prefix(A,B,C) ((A=B)&&((B=strchr(B,C))&&!(*(B++)=0)||(B=A))) #define gotoalpha(CHAR) if(CHAR)while(*CHAR && !isalpha(*CHAR))CHAR++ #define goto_alpha(CHAR) if(CHAR)while(*CHAR && !isalpha(*CHAR) && *CHAR!='_')CHAR++ #define gotoalnum(CHAR) if(CHAR)while(*CHAR && !isalnum(*CHAR))CHAR++ @@ -117,59 +234,25 @@ #define skipspaces(CHAR) if(CHAR)while(*CHAR==' ')CHAR++ #define cutspaces(CHAR) if(CHAR){int _L=strlen(CHAR); while(--_L>0 && CHAR[_L]==' ')CHAR[_L]=0;} #define gotochr(CHAR,C) if(CHAR)while(*CHAR && *CHAR!=C)CHAR++ -#define tr(CHAR,B,C) {char *_S=CHAR; while(*_S){ if(*_S==B)*_S=C; _S++; }} #define strswitch(CHAR) {char *_K=CHAR; FILE *_F=NULL; {{ #define stroption(STR) if(eq(STR,_K)) #define match(KEY,VAL) {char *_K=KEY, *_V=VAL; FILE *_F=NULL; {{ #define assign(STR,SETVAR) stroption(STR) SETVAR=_V -/* ------------------------------------------------------------------- */ -/* Infrastructure, updated 2008-01-08 by xCh. */ -/* ------------------------------------------------------------------- */ -/* old #define program int _I; int main(int argc, char **argv) */ -#define _ISTACK struct _IStack { int I; int _23; list(_IStack); } *_Iatom,*_Istack=NULL; -#define _SSTACK struct _SStack { char *S; int _23; list(_SSTACK); } *_Satom,*_Sstack=NULL; -#define _FSTACK struct _FStack { FILE *F; int _23; list(_FSTACK); } *_Fatom,*_Fstack=NULL; -#ifdef USE_LIBRARY_MYSQL -#define _MSTACK struct _MStack { MYSQL *M; int _23; list(_MStack); } *_Matom,*_Mstack=NULL; -#define _RSTACK struct _RStack { MYSQL_RES *R; int _23; list(_RStack); } *_Ratom,*_Rstack=NULL; -#else -#define _MSTACK -#define _RSTACK -#endif -#define program _ISTACK _SSTACK _FSTACK _MSTACK _RSTACK int main(int argc, char **argv) - -#define _NEW_(ATOM,STACK,TYPE) (create(ATOM,TYPE),ATOM->_23=1,push(ATOM,STACK);ATOM->_23||pop(ATOM,STACK)&&0;ATOM->_23--) -#define _NEW_I for _NEW_(_Iatom,_Istack,_IStack) -//#define _NEW_I for(create(_Iatom,_IStack),_Iatom->_23=1,push(_Iatom,_Istack);_Iatom->_23||pop(_Iatom,_Istack)&&0;_Iatom->_23--) -#define _NEW_S for(create(_Satom,_SStack),_Satom->_23=1,push(_Satom,_Sstack);_Satom->_23||pop(_Satom,_Sstack)&&0;_Satom->_23--) -#define _I _Iatom->I -#define _S _Satom->I - -/* Section For Dummies part 2, updated 2004-05-07 by xCh. */ - -#define arguments if(argc>1) for(_I=1;_IK=_S; A->_eoln=TRUE; append(A,B);} done; A->_eoln=FALSE;} */ -/* obsolete #define save(A,B,F,K) {FILE *_F=fopen(F,"w"); if(_F) { for_each(A,B) {fputs(A->K,_F); if(A->_eoln) fputc('\n',_F);} fclose(_F);}} */ - /* I/O sequences, updated 2003-05-29 by xCh. */ #define nullreopen(F) F=freopen("/dev/null","r",F) @@ -177,26 +260,27 @@ #define shell(CMD) stdinredir(system(CMD)) #define paste(STR) stdinredir(fputs(STR,stdout)) -/* String iterations, updated 2003-06-19 by xCh. */ - -#define split(A,B,C) for(prefix(A,B,C);A;(A!=B)&&prefix(A,B,C)||(A=NULL)) -#define valid_split(A,B,C) split(A,B,C) if(*A) -#define columns(A,B,C,V) for(V=0,prefix(A,B,C);A;((A!=B)&&prefix(A,B,C)||(A=NULL)),V++) -#define valid_columns(A,B,C,V) for(V=0,prefix(A,B,C);A;((A!=B)&&prefix(A,B,C))||(A=NULL)) if(*A&&++V) -#define column(A,B,C,V) { int _V; columns(A,B,C,_V) if(_V==V) break; } -#define valid_column(A,B,C,V) { int _V; valid_columns(A,B,C,_V) if(_V==V) break; } - /* Useful structures, updated 2003-05-29 by xCh. */ -#define hashtable(TYPE,NAME,VALUE) struct TYPE { char *NAME; char *VALUE; list(TYPE); } -#define textfile(TYPE,LINE) struct TYPE { char *LINE; char _eoln; list(TYPE); } -#define date(S) { time_t _T; _T=time(NULL); duplicate(ctime(&_T),S); } - -#ifdef USE_LIBRARY_MYSQL +//#define date(S) { time_t _T; _T=time(NULL); duplicate(ctime(&_T),S); } /* ------------------------------------------------------------------- */ -/* MySQL Infrastructure and basic macros - updated 2007-12-19 by xCh. */ -/* ------------------------------------------------------------------- */ -#define mysql_connect(S,U,P,D) (create(_Matom,_MStack) && push(_Matom,_Mstack) && (_Matom->M=mysql_init(NULL)),(_Matom->M && mysql_real_connect(_Matom->M,S,U,P,D,0,NULL,0)?_Matom->M:NULL)) -#endif +/* some general ideas, unfinished */ +//bind_exception, unbind_exception +//#define _CLL1_THROW(ERR) +//#define _CLL1_TRY _NEW_E for(bind_exception(0,NULL);;) if () {.... if(_Eatom->SYS) { if(_Eatom->RET) return; else break;} else { } +//#define _ASSERT(EXPR) assert(EXPR) +/* =================================================================== */ +/* .----------------------------------------------------------------------. + / 99. We have have done our homework - now let's have some fun: + '----------------------------------------------------------------------- */ +#define _DEF_VARIABLES _GLOBALS _ISTACK _SSTACK _FSTACK _MSTACK //_SQLCSTACK _SQLRSTACK _CGIDICT +#define _DEF_FUNCTIONS _MALLOC _ECHO _PRINT _FECHO _FPRINT _IT_INTS _IT_STRS // _GET_STR _GET_MEM +#define _DEF_INTERFACE //_CAKE _STD _X +#define implement_cll1_library _DEF_VARIABLES _DEF_FUNCTIONS _DEF_INTERFACE +#ifdef USE_PREPROCESSOR +#include "_include.c" +#endif +#define program implement_cll1_library int main(int argc, char **argv) +/* #ifndef _CLL1_H */ #endif