X-Git-Url: http://git.harvie.cz/?a=blobdiff_plain;f=cll1.h;h=14abb4e144ef3adf7043896c760be3ec9157345a;hb=f94ee7710aeb641fe590fe14c5f9dd7ee8f6828b;hp=3e09887de7d725552e52a795d7e3f99ac3fc7454;hpb=18c2a04b619cbd71f7a9e103be47a7f15d206874;p=svn%2FCll1h%2F.git diff --git a/cll1.h b/cll1.h index 3e09887..14abb4e 100644 --- a/cll1.h +++ b/cll1.h @@ -1,8 +1,9 @@ - -/* C<<1 header file v0.7 - style sheet for ANSI C */ -/* Please pronounce as "cee-shift-left-by-one" :) */ - -/* Copyright (G) 2004-2007 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,79 +15,294 @@ 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__ - -#include + 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. + '---------------------------------------------------------------------- */ +#ifndef DISABLE_MODULE_AUTOINCLUDE #include +#include +#include #include -#include -#include - -/* Section For Dummies part 1, updated 2004-05-07 by xCh. */ - +#include +#include +#include +#include +#ifdef USE_LIBRARY_FASTCGI +#include +#else +#include +#endif +#endif +#ifdef USE_LIBRARY_MYSQL +#include +#endif +/* .----------------------------------------------------------------------. + / 0. C<<1 typedefs and public gloabl variables, updated 2008-02-03 xCh. + '----------------------------------------------------------------------- */ +typedef char * str; /* #ifdef USE_MODULE_UNICODE...typedef wchar_t * str; */ +typedef unsigned char * buf; /* this will be always 8-bit usigned char * */ +typedef FILE * file; +typedef int bool; +extern str NIL,EOL,OFS,IFS; +extern unsigned RANDOM_SEED; +#define _EXPORT_GLOBALS str NIL="(null)", EOL="\n", OFS=" ", IFS=" \t\n"; unsigned RANDOM_SEED=0; +/* .----------------------------------------------------------------------. + / 1. C<<1 then buddhist section, updated 2008-02-04 xCh. + '----------------------------------------------------------------------- */ +#ifndef DISABLE_MODULE_THEN_BUDDHISM +#define then +#define MAYBE (int)((long)(RANDOM_SEED?random():((RANDOM_SEED=(unsigned)time(NULL)),srandom(RANDOM_SEED),random()))%2) +#define WHOKNOWS (int)(srandom((unsigned)time(NULL)),random()%2) +#define for_samsara(MIND,SOUL) for(MIND=SOUL; MIND || ((MIND->__next=SOUL),0) ; MIND=MIND->__next) +#define samsara(MIND,SOUL) for(MIND=SOUL; MIND || ((MIND->__next=SOUL),0) ; MIND=MIND->__next) +//#define atob(EXPR) (word_in_stri(YES,(EXPR))?1:0) +//#define _EXPORT_YES str YES="TRUE\nYES\nJA\nOUI\nDA\nANO\nY\n1"; +//#else +#define atob(EXPR) (eqi((EXPR),YES)?1:0) +#define _EXPORT_YES str YES="TRUE"; +#endif +/* .----------------------------------------------------------------------. + / 2. C<<1 almost then buddhist section, updated 2008-02-02 xCh. + '----------------------------------------------------------------------- */ #define not ! #define and && #define or || #define TRUE 1 #define FALSE 0 -#define loop while(1) -//#define iterate(VAR,FROM,TO) for(VAR=FROM; VAR <= TO; VAR++) -//#define repeat(N) iterate(_i,1,N) -#define repeat(N) _NEW_I for range(_I,1,N) - -/* Dynamic list macros & sequences, updated 2003-05-29 by xCh. */ - -#define list(T) struct T *_next -#define create(A,T) (A=(struct T *)malloc(sizeof(struct T)),A->_next=NULL) -#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; search(A,B,!A->_next) {A->_next=N; break;}} else push(A,B); -#define remove(A,B,C) { void **_D=NULL; for each(A,B) if(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) ) - -/* Dynamic list iterations and sequences, updated 2003-05-29 by xCh. */ - -#define every(A,B) for( A=B; A; A=A->_next) -#define search(A,B,C) every(A,B) if(C) -#define find(A,B,C) search(A,B,C) break; if(A) - -/* Enlightened iterations usable in for() , updated 2007-12-11 by xCh. */ - -#define range(VAR,FROM,TO) (VAR=FROM; VAR <= TO; VAR++) -#define each(A,B) ( A=B; A; A=A->_next) -#define lines(STR,F) () - -/* EXP macros for Dummysort sequences, updated 2003-05-29 by xCh. */ - -#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; 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 WEIRDINT (1<<(sizeof(int)*8-1)) +#define btoa(EXPR) ((EXPR)?"TRUE":"FALSE") +#define coalesce(VAR,EXPR) (VAR?VAR:(EXPR)) +/* .----------------------------------------------------------------------. + / 4. C<<1 data declaration and allocation, updated 2008-01-31 xCh. + '----------------------------------------------------------------------- */ +#define def_mem(TYPE) typedef struct _##TYPE##_t * TYPE; struct _##TYPE##_t +#define construct_mem(TYPE) TYPE _init_##TYPE(void) { create_mem(this,TYPE); /* <-' */ _init_##TYPE(this); return this; } _init_##TYPE(TYPE this) +#define get_mem(...) _GET_MEM(__VA_ARGS__,NULL) +#define init_mem(...) _init_##_ARG1(__VA_ARGS__,)( _ARG2(__VA_ARGS__,,) - 0 ) +#define create_mem(ID,...) _ARG1(__VA_ARGS__,) ID=_GET_MEM(__VA_ARGS__,NULL) +#define new_mem(ID,...) _ARG1(__VA_ARGS__,) ID=init_mem(__VA_ARGS__) +#define mem_len(TYPE) sizeof(struct _##TYPE##_t) +//#define mem_copy +#define list(TYPE) TYPE __next +#define tree(TYPE) TYPE __next; TYPE __seek +#define dict(TYPE) tree(TYPE); str __key +#define array(TYPE) tree(TYPE); int __key +#define interface(TYPE) TYPE __interface +#define this_must_be(TYPE) TYPE this +/* .----------------------------------------------------------------------. + / 5. C<<1 string manipulation, updated 2008-01-26 xCh. + '----------------------------------------------------------------------- */ +#define get_str(...) _cll1_get_str(__VA_ARGS__,NIL) +#define eq(A,B) (!_cll1_str_cmp(A,B)) +#define eqi(A,B) (!_cll1_str_cmpi(A,B)) +//#define str_eq(A,B) eq(A,B) ? +//#define str_eqi(A,B) eqi(A,B) +#define str_order(A,B) _cll1_str_coll(A,B) +#define str_ascii(A,B) _cll1_str_cmp(A,B) +#define str_len(...) _cll1__strlen(__VA_ARGS__,NIL) +#define str_in(A,B) _cll1_str_str(A,B) +#define word_in(A,B) _cll1_wordinstr(A,B,0) +#define print(...) _cll1_print(__VA_ARGS__,NIL) +#define fprint(...) _cll1_fprint(__VA_ARGS__,NIL) +#define file_print(...) _cll1_fprint(_F,__VA_ARGS__,NIL) +#define echo(...) _cll1_echo(__VA_ARGS__,NIL) +#define fecho(...) _cll1_fecho(__VA_ARGS__,NIL) +#define file_echo(...) _cll1_fecho(_F,__VA_ARGS__,NIL) +#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 tr(STR,B,C) _NEW(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 count(NODE,HEAD,VAR) { _NEW(I,0) for(NODE=HEAD; NODE || ((VAR=_I),0) ; (NODE=NODE->__next)?(_I++):0 ); } +#define order_by_int(K1,K2) (K1>K2) +#define order_by_int_desc(K1,K2) (K10) +#define order_by_str_desc(K1,K2) (str_order(K1,K2)<0) +#define order_by_ascii(K1,K2) (str_ascii(K1,K2)>0) +#define order_by_ascii_desc(K1,K2) (str_ascii(K1,K2)<0) +#define insert(NODE,HEAD,ORDERBY,KEY) { if(HEAD) { void **_L=NULL, *H=HEAD; /* <-' */ for_search(HEAD,H,ORDERBY(HEAD->KEY,NODE->KEY)) { 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,ORDERBY,KEY) { void *_NEXT; /* <-' */ NODE=HEAD; HEAD=NULL; do { _NEXT=NODE->__next; NODE->__next=NULL; insert(NODE,HEAD,ORDERBY,KEY); 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,0) while(_I++=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,FNAME) /* _NEW(CTX,get_context()) file_read(FNAME) for(use_context(_CTX),STR=file_line(_F);release_context(_M),(*S && !feof(_F));STR=file_line(_F),end_context()) _CATCH */ +#define for_input_lines(S,L) /* _NEW(CTX,get_context()) for(use_context(_CTX),STR=file_get_line(stdin);release_context(_M),(*S && !feof(stdin));STR=file_get_line(stdin)) _CATCH */ +#define for_ints(VAR,...) _NEW(I,0) while( (VAR=_cll1_for_ints(_I++,__VA_ARGS__,WEIRDINT))!=WEIRDINT ) +#define for_strs(VAR,...) _NEW(I,0) while( (VAR=(char *)_cll1_for_ptrs(_I++,__VA_ARGS__,NIL))!=NIL ) +#define for_args _NEW(I,1) while(_I++1) +#define switch_for_args for_args switch_str(this_arg) +#define switch_str(STR) _NEW(S,STR) +#define if_case(VAL) if(eq(argv[_I],VAL)) +#define for_fields(FIELD,STR) for_valid_split(FIELD,STR,*OFS) +#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) +/* .----------------------------------------------------------------------. + / 8. C<<1 object oriented infrastructure, updated 2008-02-04 + '----------------------------------------------------------------------- */ +#define I_must_be(TYPE) TYPE self, void *_method +#define we_can_be(TYPE) TYPE _we, void *_method +#define we_can_be_whatever void *_we, void *_method +#define I_am(TYPE) TYPE self=(TYPE)_we +#define def_community(METATYPE,ITYPE) def_mem(METATYPE) { ITYPE __interface; }; +#define def_method(RET,NAME,...) RET (*NAME)(__VA_ARGS__) +#define construct_interface(MTYPE,ITYPE) ITYPE _init,_##MTYPE##ITYPE(void *dummy, ...) { new_mem(_FACE,ITYPE); va_list(ap); _##MTYPE##ITYPE##_init(_FACE); return _FACE; } void _##MTYPE##ITYPE##_init(IFACE _FACE) +#define bind_method(METHOD,FUNCTION) _FACE->METHOD=FUNCTION +#define new_interface(ID,MTYPE,...) _ARG1(__VA_ARGS__,) ID=_init_##MTYPE##_ARG1(__VA_ARGS__,) ((void *)init_##MTYPE##__VA_ARGS__,) +#define init_interface(TYPE,...) +#define construct_object(MTYPE,...) (void *)_init_##TYPE##_() +#define init_object(TYPE,...) (TYPE)_init_##TYPE##_(__VA_ARGS__) +#define init_polymorph(TYPE,COMMUNITY,...) (COMMUNITY)_init_##TYPE##_(__VA_ARGS__) +#define _(OBJECT,...) ( _ASSERT(OBJECT), (*( OBJECT->interface->_ARG1(__VA_ARGS__,) )) ( OBJECT,OBJECT->interface->__VA_ARGS__ ) ) +#define __(OBJECT,...) ( _ASSERT(OBJECT), (*( __cll1_seekmethod(OBJECT->interface,_ARG1(__VA_ARGS__,)) )) ( OBJECT,OBJECT->interface->__VA_ARGS__ ) ) +#define call(OBJTYPE,METHOD,...) { int _N=0; OBJTYPE _OBJ; /* <-' */ while( (_OBJ=(OBJTYPE)_cll1_for_ptrs(_N++,__VA_ARGS__,NIL))!=(struct OBJTYPE *)NIL ) _(_OBJ,METHOD); } +/* .----------------------------------------------------------------------. + / 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) { int ofs=0; va_list ap; /* <-' */ for(va_start(ap,s);s!=NIL;s=va_arg(ap,char *)) { if(ofs)fputs(OFS,IOSTREAM);else ofs=1;/**/fputs(coalesce(s,NIL),IOSTREAM); } va_end(ap); fputs(EOL,IOSTREAM); } +#define _DECLARE_PRINT void _cll1_print(char *s,...) +#define _PRINT _DECLARE_PRINT _CLL1_FPRINT(stdout) +#define _DECLARE_FPRINT void _cll1_fprint(FILE *f,char *s,...) +#define _FPRINT _DECLARE_FPRINT _CLL1_FPRINT(f) +#define _CLL1_FECHO(IOSTREAM) { va_list ap; /* <-' */ for(va_start(ap,s);s!=NIL;s=va_arg(ap,char *)) fputs(coalesce(s,NIL),IOSTREAM); va_end(ap); } +#define _ECHO void _cll1_echo(char *s,...) _CLL1_FECHO(stdout) +#define _FECHO void _cll1_fecho(FILE *f,char *s,...) _CLL1_FECHO(f) +#define _FOR_INTS int _cll1_for_ints(int i, int n, ...) { int j=0;va_list ap; /* <-' */ va_start(ap,n); while(n!=WEIRDINT && j++I) +#define _S (_Satom->S) +#define _F (_Fatom->F) +#define _CTX (_CTXatom->CTX) +#define _ARG1(ARG1,...) ARG1 +#define _ARG2(ARG1,ARG2,...) ARG2 +#define _GET_MEM(TYPE,CTX) ((TYPE)_cll1_malloc(sizeof(struct _##TYPE##_t),CTX)) +#define _ANYATOM(TYPE,NAME) def_mem(_##NAME##Atom ) { TYPE NAME; int c; list( _##NAME##Atom ); } +#define _FOR_COLUMNS(A,B,C) _NEW(I,0) for( prefix(A,B,C) ; A ; ((A!=B)&&prefix(A,B,C)||(A=NULL) ),_I++ ) +#define _FOR_VALID_COLUMNS(A,B,C) _NEW(I,0) for( prefix(A,B,C) ; A ; ((A!=B)&&prefix(A,B,C))||(A=NULL) ) if(*A&&++_I) +#define _NEW(NAME,VALUE) for(_##NAME##atom=get_mem(_##NAME##Atom),_##NAME##atom->NAME=(VALUE),_##NAME##atom->c=1,push(_##NAME##atom,_##NAME##stack);_##NAME##atom->c||(pop(_##NAME##atom,_##NAME##stack),0);_##NAME##atom->c--) +#define _ANYSTACK(NAME) _##NAME##Atom _##NAME##atom,_##NAME##stack=NULL; +#define _EXPORT_STACKS _ANYSTACK(I) _ANYSTACK(S) _ANYSTACK(F) _ANYSTACK(CTX) +_ANYATOM(int,I); +_ANYATOM(str,S); +_ANYATOM(FILE *,F); +_ANYATOM(void *,CTX); +/* .----------------------------------------------------------------------. + / 11. C<<1 memory contexts - alternative to garbage collection + '----------------------------------------------------------------------- */ +typedef _CTXAtom * context; +#define create_context(ID) create_mem(ID,context) +/* .----------------------------------------------------------------------. + / 12. 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); } +#define _GETCGI char *getcgi(VAR) { } +#define _CGI_GLOBALS def_context(_CGI); struct _CGIVariable { char *V; dictionary(_CGIVariable); } *_CGIvariable,*_CGIdict; +#else +#define _GETCGI +#define _CGI_GLOBALS +#endif +/* .----------------------------------------------------------------------. + / 13. MySQL wrappers + SQL object interface, updated 2007-12-19 by xCh. + '----------------------------------------------------------------------- */ +#ifdef USE_LIBRARY_MYSQL +#define def_sql(CONN) MYSQL *CONN +#define create_sql(CONN) MYSQL *ID=mysql_init(NULL) +#define sql_connect(CONN,S,U,P,D) mysql_real_connect(CONN,S,U,P,D,0,NULL,0) +//todo sql_query +//todo sql_queryf +//todo for_sql_query_results(ROW,CONN,QUERY) +//todo for_sql_queryf_results +#define if_db_connect(U,P,D) _NEW(SQLC,mysql_init(NULL)) for(;_SQLC && mysql_real_connect(_SQLC,"localhost",U,P,D,0,NULL,0);mysql_close(SQLC),SQLC=NULL) +#define for_db_query_results(ROW,QUERY) _NEW(MYSQLR,mysql_query(_MYSQLC,QUERY)) for( (_SQLR=(_MYSQLR?0:mysql_use_result(_MYSQLC))),(ROW=(_MYSQLR?mysql_fetch_row(_MYSQLR):NULL)) ; ROW ; ROW=mysql_fetch_row(_MYSQLR) ) +//todo db_query +//todo for_db_results +//todo for_db_queryf_results(ROW,...) +//todo db_queryf +#define _MYSQLC (_MYSQLCatom->MYSQLC) +#define _MYSQLR (_MYSQLRatom->MYSQLR) +#define _SQL_GLOBALS _ANYSTACK(MYSQL,MYSQLC) _ANYSTACK(MYSQL_RES,MYSQLR) +#else +#define _SQL_GLOBALS +#endif +//#ifdef USE_INTERFACE_SQL +//todo #define _SQL_OBJECT mem Sql { interface(SqlInterface); char *hostname; char *username; char *password; char *database; } +//todo #define _SQL_CONSTRUCT def_construct(Sql) { self->hostname="localhost"; } +//#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++ @@ -98,46 +314,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 - -/* Section For Dummies part 2, updated 2004-05-07 by xCh. */ - -#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; -#define program2 _ISTACK _SSTACK _FSTACK int main(int argc, char **argv) -#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 -#define arguments if(argc>1) for(_I=1;_IK=_S; A->_eoln=TRUE; append(A,B);} done; A->_eoln=FALSE;} -#define save(A,B,F,K) {FILE *_F=fopen(F,"w"); if(_F) { every(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) @@ -145,19 +340,30 @@ #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); } - +//#define date(S) { time_t _T; _T=time(NULL); duplicate(ctime(&_T),S); } + +/* 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) + +/* .----------------------------------------------------------------------. + / 98. We have have done our homework - now let's have some fun: + '----------------------------------------------------------------------- */ +#define _INIT_VARIABLES _EXPORT_GLOBALS _EXPORT_YES _EXPORT_STACKS _SQL_GLOBALS _CGI_GLOBALS +#define _IMPL_FUNCTIONS _MALLOC _EXPORT_OUTS _EXPORT_ARGS _EXPORT_STRS +#define _IMPL_INTERFACE //_SQL_IFC _CAKE_IFC _STD_IFC _X_IFC +#define _IMPLEMENT_CLL1_LIBRARY _INIT_VARIABLES _IMPL_FUNCTIONS _IMPL_INTERFACE +#define _PROGRAM _cll1_program +#define _DECLARE_PROGRAM void _PROGRAM(int argc, char **argv) +#define program _IMPLEMENT_CLL1_LIBRARY _DECLARE_PROGRAM; int main(int argc, char **argv) { setlocale(LC_ALL, ""); _PROGRAM(argc,argv); return 0; } _DECLARE_PROGRAM +#ifdef USE_PREPROCESSOR +#include "_include.c" +#endif +/* .----------------------------------------------------------------------. + / 99. C<<1 is up and running. It's your turn now to show something new. + '----------------------------------------------------------------------- */ #endif