| 1 | /* .----------------------------------------------------------------------. |
| 2 | / C<<1 header file - C language style sheet - GNU C/ANSI C99 compliant |
| 3 | / Cumbersome Extraction and Report Language - http://cll1h.arachne.cz/ |
| 4 | '---------------------------------------------------------------------- */ |
| 5 | /* |
| 6 | Copyright (c) 2004-2008 Michael xChaos Polak - x(at)n.cz |
| 7 | |
| 8 | The C<<1 header file is free software; you can redistribute it and/or |
| 9 | modify it under the terms of the GNU Lesser General Public |
| 10 | License as published by the Free Software Foundation; either |
| 11 | version 2.1 of the License, or (at your option) any later version. |
| 12 | |
| 13 | The C<<1 header file is distributed in the hope that it will be useful, |
| 14 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 15 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
| 16 | Lesser General Public License for more details. |
| 17 | |
| 18 | You should have received a copy of the GNU Lesser General Public License |
| 19 | along with C<<1 header file; if not, write to the Free Software |
| 20 | Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA |
| 21 | |
| 22 | */ |
| 23 | |
| 24 | #ifndef _CLL1_H |
| 25 | #define _CLL1_H |
| 26 | #define CLL1H_VERSION "0.7.1" |
| 27 | /* .----------------------------------------------------------------------. |
| 28 | / 0. Library definitions not parsed by @CC, updated 2008-01-26 xCh. |
| 29 | '---------------------------------------------------------------------- */ |
| 30 | /* |
| 31 | @define USE_LIBRARY_MYSQL -lmysqlclient |
| 32 | @define USE_LIBRARY_FASTCGI -lfcgi |
| 33 | @define USE_PREPROCESSOR cake *.html *.xml > _include.c |
| 34 | @define USE_POSTPROCESSOR strip @ |
| 35 | */ |
| 36 | /* .----------------------------------------------------------------------. |
| 37 | / 1. C<<1 header auto include, updated 2008-01-26 xCh. |
| 38 | '---------------------------------------------------------------------- */ |
| 39 | #include <string.h> |
| 40 | #include <malloc.h> |
| 41 | #include <time.h> |
| 42 | #include <stdlib.h> |
| 43 | #include <stdarg.h> |
| 44 | #include <unistd.h> |
| 45 | #ifdef USE_LIBRARY_MYSQL |
| 46 | #include <mysql/mysql.h> |
| 47 | #endif |
| 48 | #ifdef USE_LIBRARY_FASTCGI |
| 49 | #include <fcgi_stdio.h> |
| 50 | #else |
| 51 | #include <stdio.h> |
| 52 | #endif |
| 53 | /* .----------------------------------------------------------------------. |
| 54 | / 2. C<<1 then buddhist section, updated 2008-01-26 xCh. |
| 55 | '----------------------------------------------------------------------- */ |
| 56 | #ifndef DISABLE_MODULE_THEN_BUDDHISM |
| 57 | #define then |
| 58 | #define MAYBE (int)((RANDOM_SEED?random():(RANDOM_SEED=time(NULL),srandom(RANDOM_SEED),random()))%2) |
| 59 | #define WHOKNOWS (int)(srandom(time(NULL)),random()%2) |
| 60 | #define Create_var(ID,TYPE,INIT) TYPE ID=INIT |
| 61 | #define Define_var(ID,TYPE) TYPE ID |
| 62 | #endif |
| 63 | /* .----------------------------------------------------------------------. |
| 64 | / 3. C<<1 constants and optional keywords, updated 2008-01-26 xCh. |
| 65 | '----------------------------------------------------------------------- */ |
| 66 | #define not ! |
| 67 | #define and && |
| 68 | #define or || |
| 69 | #define boolean int |
| 70 | #define bool_str(VALUE) ((VALUE)?"TRUE":"FALSE") |
| 71 | #define TRUE 1 |
| 72 | #define FALSE 0 |
| 73 | #define coalesce(VAR,NOTNULL) (VAR?VAR:(NOTNULL)) |
| 74 | #define mem struct |
| 75 | #define construct struct |
| 76 | #define _GLOBALS time_t RANDOM_SEED=0; char *EOL="\n", *OFS=" ", *IFS=" \t\n", *NIL="NULL"; |
| 77 | /* .----------------------------------------------------------------------. |
| 78 | / 4. C<<1 data declaration and allocation, updated 2008-01-07 xCh. |
| 79 | '----------------------------------------------------------------------- */ |
| 80 | #define Create_str(ID,INIT) char *ID=INIT |
| 81 | #define Define_str(ID) char *ID=NULL |
| 82 | #define Create_mem(ID,...) struct _ARG1(__VA_ARGS__,) *ID=get_mem(__VA_ARGS__) |
| 83 | #define Define_mem(ID,TYPE) struct TYPE *ID=NULL |
| 84 | #define Define_mems(ID1,ID2,TYPE) Define_mem(ID1,TYPE); Define_mem(ID2,TYPE) |
| 85 | #define Create_list(ID1,I2,TYPE) Create_mem(ID1,TYPE); struct TYPE *ID2=((ID1->__next=NULL),ID1) |
| 86 | #define Define_var(ID,TYPE) TYPE ID |
| 87 | #define list(TYPE) struct TYPE *__next |
| 88 | #define tree(TYPE) struct TYPE *__next;struct TYPE *__seek |
| 89 | #define dictionary(TYPE) tree(TYPE);char *__key |
| 90 | #define array(TYPE) tree(TYPE);int __key |
| 91 | #define interface(TYPE) struct TYPE *__interface |
| 92 | #define get_mem(...) (struct _ARG1(__VA_ARGS__,)*)_cll1_malloc(sizeof(struct _ARG1(__VA_ARGS__,)),NULL) |
| 93 | #define get_str(...) (char *)_cll1_get_str(__VA_ARGS__,(void *)&_cll1_get_str) |
| 94 | /* .----------------------------------------------------------------------. |
| 95 | / 5. C<<1 string manipulation, updated 2008-01-26 xCh. |
| 96 | '----------------------------------------------------------------------- */ |
| 97 | #define eq(A,B) !strcmp(A,B) |
| 98 | #define eqi(A,B) !strcasecmp(A,B) |
| 99 | #define print(...) _cll1_print(__VA_ARGS__,(void *)&_cll1_print) |
| 100 | #define fprint(...) _cll1_fprint(__VA_ARGS__,(void *)&_cll1_fprint) |
| 101 | #define file_print(...) _cll1_fprint(_F,__VA_ARGS__,(void *)&_cll1_fprint) |
| 102 | #define echo(...) _cll1_echo(__VA_ARGS__,(void *)&_cll1_echo) |
| 103 | #define fecho(...) _cll1_fecho(__VA_ARGS__,(void *)&_cll1_fecho) |
| 104 | #define file_echo(...) _cll1_fecho(_F,__VA_ARGS__,(void *)&_cll1_fecho) |
| 105 | #define suffix(A,B,C) (((A=strrchr(B,C))&&!(*(A++)=0))||(A=B)) |
| 106 | #define prefix(A,B,C) ((A=B),((B=strchr(B,C))&&!(*(B++)=0)||(B=A))) |
| 107 | #define for_split(A,B,C) for(prefix(A,B,C);A;(A!=B)&&prefix(A,B,C)||(A=NULL)) |
| 108 | #define for_valid_split(A,B,C) for_split_str(A,B,C) if(*A) |
| 109 | #define switch_for_columns(A,B,C) _FOR_COLUMNS(A,B,C) switch(__I) |
| 110 | #define switch_for_valid_columns(A,B,C) _FOR_VALID_COLUMNS(A,B,C) switch (_I) |
| 111 | #define if_column_number(A,B,C,V) _FOR_COLUMNS(A,B,C) if(_I==V) |
| 112 | #define if_valid_column_number(A,B,C,V) _FOR_VALID_COLUMNS(A,B,C) if(_I==V) |
| 113 | #define tr(STR,B,C) {char *_S=STR; /***/ while(S && *_S) {if(*_S==B)*_S=C; _S++;} } |
| 114 | /* .----------------------------------------------------------------------. |
| 115 | / 6. C<<1 data container manipulation, updated 2008-01-26 xCh. |
| 116 | '----------------------------------------------------------------------- */ |
| 117 | #define push(NODE,HEAD) ( NODE ? ((NODE->__next=HEAD),(HEAD=NODE)) : NULL ) |
| 118 | #define pop(NODE,HEAD) ( HEAD ? ((NODE=HEAD->__next),free(HEAD),(HEAD=NODE)) : (NODE=NULL) ) |
| 119 | #define append(NODE,HEAD) { void *N=NODE; /**/ NODE->__next=NULL; for_search(NODE,HEAD,!NODE->__next) { NODE->__next=N; break; } } |
| 120 | #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); } |
| 121 | #define drop(NODE,HEAD) for( NODE=HEAD; NODE || (HEAD=NULL); HEAD=NODE, NODE=NODE->__next, free(HEAD) ) |
| 122 | //to do: seek |
| 123 | //to do: store |
| 124 | #define order_by(K1,K2) (K1>K2) |
| 125 | #define desc_order_by(K1,K2) (K1<K2) |
| 126 | #define sort_by(K1,K2) (strcasecmp(K1, K2)>0) |
| 127 | #define desc_sort_by(K1,K2) (strcasecmp(K1, K2)<0) |
| 128 | #define ascii_by(K1,K2) (strcmp(K1, K2)>0) |
| 129 | #define desc_ascii_by(K1,K2) (strcmp(K1, K2)<0) |
| 130 | #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; } } |
| 131 | #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); } |
| 132 | /* .----------------------------------------------------------------------. |
| 133 | / 7. C<<1 builtin iterators and conditionals, updated 2008-01-26 xCh. |
| 134 | '----------------------------------------------------------------------- */ |
| 135 | #define loop while(TRUE) |
| 136 | #define repeat(N) if(N>0) _NEW_I for_range(_I,1,N) |
| 137 | #define for_range(VAR,FROM,TO) for( VAR=FROM ; FROM<=TO?VAR<=TO:VAR>=TO ; FROM<=TO?VAR++:VAR--) |
| 138 | #define for_each(NODE,HEAD) for(NODE=HEAD; NODE; NODE=NODE->__next) |
| 139 | #define for_search(NODE,HEAD,EXPR) for_each(NODE,HEAD) if(EXPR) |
| 140 | #define for_file_lines(STR,F) /* _NEW_F for() */ |
| 141 | #define for_ints(VAR,...) _NEW_I for( _I=0 ; (VAR=_cll1_it_ints(_I,__VA_ARGS__,-1))>=0 ; _I++) |
| 142 | #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++) |
| 143 | #define if_exists(A,B,C) for_search(A,B,C) break; if(A) |
| 144 | #define for_args _NEW_I for(_I=1;_I<argc;_I++) |
| 145 | #define if_args if(argc>1) |
| 146 | #define if_arg(VAL) if(eq(argv[_I],VAL)) |
| 147 | #define this_arg argv[_I] |
| 148 | #define next_arg ((_I+1<argc)?argv[_I]:NULL) |
| 149 | #define skip_next _I++ |
| 150 | /* .----------------------------------------------------------------------. |
| 151 | / 8. C<<1 va_list based library functions, updated 2008-01-26 xCh. |
| 152 | '----------------------------------------------------------------------- */ |
| 153 | #define _ARG1(ARG1,...) ARG1 |
| 154 | #define _MALLOC void *_cll1_malloc(size_t size,...) { /*temporary solution*/ return malloc(size); } |
| 155 | #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); } |
| 156 | #define _PRINT void _cll1_print(char *s,...) _CLL1_FPRINT(stdout,(void *)&_cll1_print) |
| 157 | #define _FPRINT void _cll1_fprint(FILE *f,char *s,...) _CLL1_FPRINT(f,(void *)&_cll1_fprint) |
| 158 | #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); } |
| 159 | #define _ECHO void _cll1_echo(char *s,...) _CLL1_FECHO(stdout,(void *)&_cll1_echo) |
| 160 | #define _FECHO void _cll1_fecho(FILE *f,char *s,...) _CLL1_FECHO(f,(void *)&_cll1_fecho) |
| 161 | #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++<i) n=va_arg(ap,int); return n; } |
| 162 | #define _IT_STRS char *_cll1_it_strs(int i, char *s, ...) { int j=0;va_list ap; /**/ va_start(ap,s); while(s!=(void *)&_cll1_it_strs && j++<i) s=va_arg(ap,char *); return s; } |
| 163 | /* .----------------------------------------------------------------------. |
| 164 | / 9. C<<1 hidden stack infrastructure, updated 2008-01-26 by xCh. |
| 165 | '----------------------------------------------------------------------- */ |
| 166 | #define _ISTACK struct _IStack { int I; int _23; list(_IStack); } *_Iatom,*_Istack=NULL; |
| 167 | #define _SSTACK struct _SStack { char *S; int _23; list(_SSTACK); } *_Satom,*_Sstack=NULL; |
| 168 | #define _FSTACK struct _FStack { FILE *F; int _23; list(_FSTACK); } *_Fatom,*_Fstack=NULL; |
| 169 | #define _NEW_(ATOM,STACK,TYPE) (ATOM=get_mem(TYPE),ATOM->_23=1,push(ATOM,STACK);ATOM->_23||pop(ATOM,STACK)&&0;ATOM->_23--) |
| 170 | #define _NEW_I for _NEW_(_Iatom,_Istack,_IStack) |
| 171 | #define _NEW_S for _NEW_(_Satom,_Sstack,_SStack) |
| 172 | #define _NEW_F for _NEW_(_Fatom,_Fstack,_FStack) |
| 173 | #define _I (_Iatom->I) |
| 174 | #define _S (_Satom->I) |
| 175 | #define _F (_Satom->F) |
| 176 | #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++) |
| 177 | #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) |
| 178 | /* .----------------------------------------------------------------------. |
| 179 | / 10. C<<1 CGI and FASTCGI handling, updated 2008-01-16 by xCh. |
| 180 | '----------------------------------------------------------------------- */ |
| 181 | #ifdef USE_LIBRARY_FASTCGI |
| 182 | #define while_fastcgi_accept while(FCGI_Accept()>=0) |
| 183 | #define USE_MODULE_CGI |
| 184 | #endif |
| 185 | #ifdef USE_MODULE_CGI |
| 186 | #define cgi(MIME) /* _init_cgi */ if(MIME) printf("Content-type: %s\r\n\r\n",MIME); |
| 187 | //todo getcgi(VAR) |
| 188 | //todo define_init_cgi |
| 189 | //todo #define _QSTACK struct _QStack { char *Q; int _23; list(_QStack); } *_Qatom,*_Qstack=NULL; |
| 190 | #endif |
| 191 | /* .----------------------------------------------------------------------. |
| 192 | / 11. MySQL infrastructure and wrappers - updated 2007-12-19 by xCh. |
| 193 | '----------------------------------------------------------------------- */ |
| 194 | #ifdef USE_LIBRARY_MYSQL |
| 195 | #define mysql_connect(S,U,P,D) ((_Matom=get_mem(_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)) |
| 196 | #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)) |
| 197 | #define _MSTACK struct _MStack { MYSQL *M; int _23; list(_MStack); } *_Matom,*_Mstack=NULL; |
| 198 | #define _RSTACK struct _RStack { MYSQL_RES *R; int _23; list(_RStack); } *_Ratom,*_Rstack=NULL; |
| 199 | #else |
| 200 | #define _MSTACK |
| 201 | #define _RSTACK |
| 202 | #endif |
| 203 | |
| 204 | /* ------------------------------------------------------------------- */ |
| 205 | /* old - from version 0.6 */ |
| 206 | /* =================================================================== */ |
| 207 | |
| 208 | /* |
| 209 | obsolete |
| 210 | #define strlwr(A) {char *_S=A; while(_&&*_S){*_S=tolower(*_S);_S++;}} |
| 211 | #define strupr(A) {char *_S=A; while(_&&*_S){*_S=toupper(*_S);_S++;}} |
| 212 | #define string(S,L) (S=(char *)malloc(L),*S=0) |
| 213 | #define duplicate(A,B) if(A) { string(B,strlen(A)+1); strcpy(B,A); } |
| 214 | #define concatenate(A,B,C) if (A && B) { string(C,strlen(A)+strlen(B)+1); strcpy(C,A); strcat(C,B); } |
| 215 | #define gotoalpha(CHAR) if(CHAR)while(*CHAR && !isalpha(*CHAR))CHAR++ |
| 216 | #define goto_alpha(CHAR) if(CHAR)while(*CHAR && !isalpha(*CHAR) && *CHAR!='_')CHAR++ |
| 217 | #define gotoalnum(CHAR) if(CHAR)while(*CHAR && !isalnum(*CHAR))CHAR++ |
| 218 | #define goto_alnum(CHAR) if(CHAR)while(*CHAR && !isalnum(*CHAR) && *CHAR!='_')CHAR++ |
| 219 | #define skipalpha(CHAR) if(CHAR)while(*CHAR && isalpha(*CHAR))CHAR++ |
| 220 | #define skip_alpha(CHAR) if(CHAR)while(*CHAR && (isalpha(*CHAR) || *CHAR=='_'))CHAR++ |
| 221 | #define skipalnum(CHAR) if(CHAR)while(*CHAR && isalnum(*CHAR))CHAR++ |
| 222 | #define skip_alnum(CHAR) if(CHAR)while(*CHAR && (isalnum(*CHAR) || *CHAR=='_'))CHAR++ |
| 223 | #define skipspaces(CHAR) if(CHAR)while(*CHAR==' ')CHAR++ |
| 224 | #define cutspaces(CHAR) if(CHAR){int _L=strlen(CHAR); while(--_L>0 && CHAR[_L]==' ')CHAR[_L]=0;} |
| 225 | #define gotochr(CHAR,C) if(CHAR)while(*CHAR && *CHAR!=C)CHAR++ |
| 226 | #define strswitch(CHAR) {char *_K=CHAR; FILE *_F=NULL; {{ |
| 227 | #define stroption(STR) if(eq(STR,_K)) |
| 228 | #define match(KEY,VAL) {char *_K=KEY, *_V=VAL; FILE *_F=NULL; {{ |
| 229 | #define assign(STR,SETVAR) stroption(STR) SETVAR=_V |
| 230 | */ |
| 231 | /* I/O iterations, updated 2004-04-19 by xCh. */ |
| 232 | |
| 233 | #define fparse(S,L,F) for(fgets(S,L,F);*S && !feof(F);fgets(S,L,F)) |
| 234 | #define input(S,L) fparse(S,L,stdin) |
| 235 | #define fstring(S,F) { int _C=0,_L=0; fpos_t _P; fgetpos(F,&_P); while(_C!='\n' && !feof(F)){ _C=fgetc(F); _L++; } string(S,_L); fsetpos(F,&_P);fgets(S,_L,F);fgetc(F);} |
| 236 | #define parses(S,F) {FILE *_F=fopen(F,"r"); if(_F) { while(!feof(_F)) { fstring(S,_F); |
| 237 | //obsolete |
| 238 | //#define parse(F) {char *_; FILE *_F=fopen(F,"r"); if(_F) { while(!feof(_F)) { fstring(_,_F); |
| 239 | //#define fail }} else {{ |
| 240 | //#define done }} if(_F)fclose(_F);} |
| 241 | //to do #define option(STR,SETVAR) if(_){char *_K,*_V,*_O,*_Q; duplicate(_,_Q); _O=_Q; tr(_O,'\t',' '); prefix(_K,_O,' '); if(eq(STR,_K)) {skipspaces(_O); prefix(_V,_O,'#'); cutspaces(_V); SETVAR=_V; _=NULL;} else free(_Q);} |
| 242 | //to do #define ioption(STR,SETVAR) if(_){char *_K,*_V,*_O,*_Q; duplicate(_,_Q); _O=_Q; tr(_O,'\t',' '); prefix(_K,_O,' '); if(eq(STR,_K)) {skipspaces(_O); prefix(_V,_O,'#'); cutspaces(_V); SETVAR=atoi(_V); _=NULL;} free(_Q);} |
| 243 | //to do #define loption(STR,SETVAR) if(_){char *_K,*_V,*_O,*_Q; duplicate(_,_Q); _O=_Q; tr(_O,'\t',' '); prefix(_K,_O,' '); if(eq(STR,_K)) {skipspaces(_O); prefix(_V,_O,'#'); cutspaces(_V); SETVAR=atol(_V); _=NULL;} free(_Q);} |
| 244 | |
| 245 | /* I/O sequences, updated 2003-05-29 by xCh. */ |
| 246 | |
| 247 | #define nullreopen(F) F=freopen("/dev/null","r",F) |
| 248 | #define stdinredir(CMD) {int _r[2];pipe(_r);if(fork()==0){dup2(_r[1],1);close(_r[0]);CMD;exit(0);}nullreopen(stdin);dup2(_r[0],0);close(_r[1]);} |
| 249 | #define shell(CMD) stdinredir(system(CMD)) |
| 250 | #define paste(STR) stdinredir(fputs(STR,stdout)) |
| 251 | |
| 252 | /* Useful structures, updated 2003-05-29 by xCh. */ |
| 253 | |
| 254 | //#define date(S) { time_t _T; _T=time(NULL); duplicate(ctime(&_T),S); } |
| 255 | |
| 256 | /* ------------------------------------------------------------------- */ |
| 257 | /* Object infrastructure and basic macros - updated 2008-01-13 by xCh. */ |
| 258 | /* unfinished */ |
| 259 | |
| 260 | #define method(NAME) |
| 261 | #define define_interface(IFACE,TYPE) struct TYPE *__get_##_##IFACE(void) { Create_mem(_FACE,TYPE); __bind_##_##IFACE(_FACE); return _IFC; } void __bind_##_##IFACE(struct TYPE *_FACE) |
| 262 | #define bind_method(METHOD,FUNCTION) _IFACE->METHOD=FUNCTION |
| 263 | #define get_interface(IFACE) __get_##_##IFACE(void) |
| 264 | //get_dynamic_interface |
| 265 | //#define get_object(TYPE) |
| 266 | //#define _(OBJECT,...) (assert(OBJECT),/**/(*(OBJECT->interface->_ARG1(__VA_ARGS__,)))/**/(OBJECT,OBJECT->interface->__VA_ARGS__)/**/) |
| 267 | |
| 268 | /* ------------------------------------------------------------------- */ |
| 269 | /* some general ideas, unfinished */ |
| 270 | //bind_exception, unbind_exception |
| 271 | //#define _CLL1_THROW(ERR) |
| 272 | //#define _CLL1_TRY _NEW_E for(bind_exception(0,NULL);;) if () {.... if(_Eatom->SYS) { if(_Eatom->RET) return; else break;} else { } |
| 273 | //#define _ASSERT(EXPR) assert(EXPR) |
| 274 | /* =================================================================== */ |
| 275 | |
| 276 | |
| 277 | |
| 278 | /* .----------------------------------------------------------------------. |
| 279 | / 99. We have have done our homework - now let's have some fun: |
| 280 | '----------------------------------------------------------------------- */ |
| 281 | #define _DEF_VARIABLES _GLOBALS _ISTACK _SSTACK _FSTACK _MSTACK _RSTACK //_QSTACK |
| 282 | #define _DEF_FUNCTIONS _MALLOC _ECHO _PRINT _FECHO _FPRINT _IT_INTS _IT_STRS // _GET_STR _GET_MEM |
| 283 | #define _DEF_INTERFACE //_CAKE _STD _X |
| 284 | #define implement_cll1_library _DEF_VARIABLES _DEF_FUNCTIONS _DEF_INTERFACE |
| 285 | #ifdef USE_PREPROCESSOR |
| 286 | #include "_include.c" |
| 287 | #endif |
| 288 | #define program implement_cll1_library int main(int argc, char **argv) |
| 289 | /* #ifndef _CLL1_H */ |
| 290 | #endif |