cll1.h

   1 /* ------------------------------------------------------------------- */
   2 /* C<<1 header file v0.7.1 - style sheet for ANSI C                    */
   3 /* CERL - Cumbersome Extraction and Report Language                    */
   4 /* ------------------------------------------------------------------- */
   5 /* Copyright (c) 2004-2008 Michael xChaos Polak, x(at)n.cz
   6
   7    The C<<1 header file is free software; you can redistribute it and/or
   8    modify it under the terms of the GNU Lesser General Public
   9    License as published by the Free Software Foundation; either
  10    version 2.1 of the License, or (at your option) any later version.
  11
  12    The C<<1 header file is distributed in the hope that it will be useful,
  13    but WITHOUT ANY WARRANTY; without even the implied warranty of
  14    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  15    Lesser General Public License for more details.
  16
  17    You should have received a copy of the GNU Lesser General Public License
  18    along with C<<1 header file; if not, write to the Free Software
  19    Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301 USA
  20
  21 */
  22
  23 #ifndef _CLL1_H
  24 #define _CLL1_H
  25
  26 #include <string.h>
  27 #include <malloc.h>
  28 #include <time.h>
  29 #include <stdlib.h>
  30 #include <unistd.h>
  31 #ifdef USE_LIBRARY_MYSQL
  32 #include <mysql/mysql.h>
  33 #endif
  34 #ifdef USE_LIBRARY_FASTCGI
  35 #include <fcgi_stdio.h>
  36 #else
  37 #include <stdio.h>
  38 #endif
  39 /* ------------------------------------------------------------------- */
  40 /* 1. C<<1 constants and optional keywords, updated 2008-01-07 by xCh. */
  41 /* ------------------------------------------------------------------- */
  42 #define then
  43 #define not !
  44 #define and &&
  45 #define or ||
  46 #define TRUE 1
  47 #define FALSE 0
  48 #define bool_str(I) (I?"TRUE":"FALSE")
  49 #define boolean int
  50 #define mem struct
  51 #define construct struct
  52 /* ------------------------------------------------------------------- */
  53 /* 2. C<<1 basic data types - updated 2008-01-07 by xCh.               */
  54 /* ------------------------------------------------------------------- */
  55 #define Create_str(ID,INIT) char *ID=INIT
  56 #define Define_str(ID) char *ID=NULL
  57 #define Create_mem(ID,TYPE) struct TYPE *ID=get_mem(TYPE)
  58 #define Create_mem_in_context(ID,TYPE,CONTEXT) struct TYPE *ID=get_mem_in_context(TYPE,CONTEXT)
  59 #define Define_mem(ID,TYPE) struct TYPE *ID=NULL
  60 #define Define_mems(ID1,I2,TYPE) Define_mem(ID1,TYPE);Define_mem(ID2,TYPE)
  61
  62 /* .... well.. ehm..  not very useful... :-) */
  63 #define Create_var(ID,TYPE,INIT) TYPE ID=INIT
  64 #define Define_var(ID,TYPE) TYPE ID
  65 /* ------------------------------------------------------------------- */
  66 #define list(T) struct T *_next
  67 #define tree(T) struct T *_next;struct T *_seek
  68 #define create(A,T) (A=(struct T *)malloc(sizeof(struct T)),A->_next=NULL,A)
  69 #define push(A,B) ((A && A!=B)?A->_next=B:0,B=A)
  70 #define pop(A,B) (B?((A?free(A):0),A=B=B->_next):(A=NULL))
  71 #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);
  72 #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); }
  73 #define drop(A,B) for( A=B; A || (B=NULL); B=A, A=A->_next, free(B) )
  74 /* ------------------------------------------------------------------- */
  75 /* 3. C<<1 general iterators - updated 2008-01-07 by xCh.              */
  76 /* ------------------------------------------------------------------- */
  77 #define loop while(TRUE)
  78 #define repeat(N) if(N>0) _NEW_I for_range(_I,1,N)
  79 #define for_range(VAR,FROM,TO) for( VAR=FROM ; FROM<=TO?VAR<=TO:VAR>=TO ; FROM<=TO?VAR++:VAR--)
  80 #define for_each(A,B) for(A=B; A; A=A->_next)
  81 #define for_search(A,B,C) for_each(A,B) if(C)
  82 #define for_file_lines(STR,F) /* _NEW_F for() */
  83 #define for_ints(VAR,...) _NEW_I while(_iterate_ints(&VAR,_I,__VA_LIST) )
  84 #define for_strs(VAR,...)  _NEW_S
  85 /* obsolete #define every(A,B) for( A=B; A; A=A->_next) */
  86 /* obsolete #define search(A,B,C) every(A,B) if(C) */
  87 /* obsolete #define find(A,B,C) search(A,B,C) break; if(A) */
  88 /* ------------------------------------------------------------------- */
  89 /* 4.C<<1 conditionals - updated 2008-01-07 by xCh.                    */
  90 /* ------------------------------------------------------------------- */
  91 #define if_exists(A,B,C) for_search(A,B,C) break; if(A)
  92 /* ------------------------------------------------------------------- */
  93 /* 5. C<<1 argument handling, updated 2008-01-16 by xCh.               */
  94 /* ------------------------------------------------------------------- */
  95 #define for_args _NEW_I if(argc>1) for(_I=1;_I<argc;_I++)
  96 #define if_arg(VAL) if(eq(argv[_I],VAL))
  97 #define this_arg argv[_I]
  98 #define next_arg ((_I+1<argc)?argv[++_I]:NULL)
  99 /* ------------------------------------------------------------------- */
 100 /* 6. C<<1 CGI and FASTCGI handling, updated 2008-01-16 by xCh.        */
 101 /* ------------------------------------------------------------------- */
 102 #ifdef USE_LIBRARY_FASTCGI
 103 #define while_fastcgi_accept while(FCGI_Accept()>=0)
 104 #define USE_MODULE_CGI
 105 #endif
 106 #ifdef USE_MODULE_CGI
 107 #define cgi(MIME) /* _init_cgi */ if(MIME) printf("Content-type: %s\r\n\r\n",MIME);
 108 //todo getcgi(VAR)
 109 //todo define_init_cgi
 110 //todo #define _QSTACK struct _QStack { char *Q; int _23; list(_QStack); } *_Qatom,*_Qstack=NULL;
 111 #endif
 112 /* ------------------------------------------------------------------- */
 113 /* 7. MySQL infrastructure and wrappers  -  updated 2007-12-19 by xCh. */
 114 /* ------------------------------------------------------------------- */
 115 #ifdef USE_LIBRARY_MYSQL
 116 #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))
 117 #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))
 118 #define _MSTACK struct _MStack { MYSQL *M; int _23; list(_MStack); } *_Matom,*_Mstack=NULL;
 119 #define _RSTACK struct _RStack { MYSQL_RES *R; int _23; list(_RStack); } *_Ratom,*_Rstack=NULL;
 120 #else
 121 #define _MSTACK
 122 #define _RSTACK
 123 #endif
 124 /* ------------------------------------------------------------------- */
 125 /* old - from version 0.6                                              */
 126 /* ------------------------------------------------------------------- */
 127
 128 /* ------------------------------------------------------------------- */
 129 /* EXP macros for dummysort sequences, updated 2003-05-29 by xCh.      */
 130 /* ------------------------------------------------------------------- */
 131 #define order_by(K1,K2) (K1>K2)
 132 #define desc_order_by(K1,K2) (K1<K2)
 133 #define sort_by(K1,K2) (strcasecmp(K1, K2)>0)
 134 #define desc_sort_by(K1,K2) (strcasecmp(K1, K2)<0)
 135 #define ascii_by(K1,K2) (strcmp(K1, K2)>0)
 136 #define desc_ascii_by(K1,K2) (strcmp(K1, K2)<0)
 137 /* ------------------------------------------------------------------- */
 138 /* Dummysort sequences, updated 2003-05-29 by xCh.                     */
 139 /* ------------------------------------------------------------------- */
 140 #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); }
 141 #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); }
 142 /* String macros & sequences, updated 2004-04-19 by xCh. */
 143
 144 #define eq(A,B) !strcmp(A,B)
 145 #define strcmpi(A,B) strcasecmp(A,B)
 146 /*
 147 obsolete
 148 #define strlwr(A) {char *_S=A; while(_&&*_S){*_S=tolower(*_S);_S++;}}
 149 #define strupr(A) {char *_S=A; while(_&&*_S){*_S=toupper(*_S);_S++;}}
 150 #define string(S,L) (S=(char *)malloc(L),*S=0)
 151 #define duplicate(A,B) if(A) { string(B,strlen(A)+1); strcpy(B,A); }
 152 #define concatenate(A,B,C) if (A && B) { string(C,strlen(A)+strlen(B)+1); strcpy(C,A); strcat(C,B); }
 153 #define suffix(A,B,C) (((A=strrchr(B,C))&&!(*(A++)=0))||(A=B))
 154 #define prefix(A,B,C) ((A=B)&&((B=strchr(B,C))&&!(*(B++)=0)||(B=A)))
 155 #define gotoalpha(CHAR) if(CHAR)while(*CHAR && !isalpha(*CHAR))CHAR++
 156 #define goto_alpha(CHAR) if(CHAR)while(*CHAR && !isalpha(*CHAR) && *CHAR!='_')CHAR++
 157 #define gotoalnum(CHAR) if(CHAR)while(*CHAR && !isalnum(*CHAR))CHAR++
 158 #define goto_alnum(CHAR) if(CHAR)while(*CHAR && !isalnum(*CHAR) && *CHAR!='_')CHAR++
 159 #define skipalpha(CHAR) if(CHAR)while(*CHAR && isalpha(*CHAR))CHAR++
 160 #define skip_alpha(CHAR) if(CHAR)while(*CHAR && (isalpha(*CHAR) || *CHAR=='_'))CHAR++
 161 #define skipalnum(CHAR) if(CHAR)while(*CHAR && isalnum(*CHAR))CHAR++
 162 #define skip_alnum(CHAR) if(CHAR)while(*CHAR && (isalnum(*CHAR) || *CHAR=='_'))CHAR++
 163 #define skipspaces(CHAR) if(CHAR)while(*CHAR==' ')CHAR++
 164 #define cutspaces(CHAR) if(CHAR){int _L=strlen(CHAR); while(--_L>0 && CHAR[_L]==' ')CHAR[_L]=0;}
 165 #define gotochr(CHAR,C) if(CHAR)while(*CHAR && *CHAR!=C)CHAR++
 166 #define tr(CHAR,B,C) {char *_S=CHAR; while(*_S){ if(*_S==B)*_S=C; _S++; }}
 167 #define strswitch(CHAR) {char *_K=CHAR; FILE *_F=NULL; {{
 168 #define stroption(STR) if(eq(STR,_K))
 169 #define match(KEY,VAL) {char *_K=KEY, *_V=VAL; FILE *_F=NULL; {{
 170 #define assign(STR,SETVAR) stroption(STR) SETVAR=_V
 171 */
 172 /* ------------------------------------------------------------------- */
 173 /* Infrastructure, updated 2008-01-08 by xCh.                          */
 174 /* ------------------------------------------------------------------- */
 175 /* old #define program int _I; int main(int argc, char **argv) */
 176 #define _ISTACK struct _IStack { int I; int _23; list(_IStack); } *_Iatom,*_Istack=NULL
 177 #define _SSTACK struct _SStack { char *S; int _23; list(_SSTACK); } *_Satom,*_Sstack=NULL
 178 #define _FSTACK struct _FStack { FILE *F; int _23; list(_FSTACK); } *_Fatom,*_Fstack=NULL
 179
 180 #define define_ccl1_globals _ISTACK; _SSTACK; _FSTACK; _MSTACK; _RSTACK; _QSTACK
 181 #define program define_cll1_globals; int main(int argc, char **argv)
 182
 183 #define _NEW_(ATOM,STACK,TYPE) (create(ATOM,TYPE),ATOM->_23=1,push(ATOM,STACK);ATOM->_23||pop(ATOM,STACK)&&0;ATOM->_23--)
 184 #define _NEW_I for _NEW_(_Iatom,_Istack,_IStack)
 185 //#define _NEW_I for(create(_Iatom,_IStack),_Iatom->_23=1,push(_Iatom,_Istack);_Iatom->_23||pop(_Iatom,_Istack)&&0;_Iatom->_23--)
 186 #define _NEW_S for(create(_Satom,_SStack),_Satom->_23=1,push(_Satom,_Sstack);_Satom->_23||pop(_Satom,_Sstack)&&0;_Satom->_23--)
 187 #define _I _Iatom->I
 188 #define _S _Satom->I
 189 #define _F _Satom->F
 190
 191 /* I/O iterations, updated 2004-04-19 by xCh. */
 192
 193 #define fparse(S,L,F) for(fgets(S,L,F);*S && !feof(F);fgets(S,L,F))
 194 #define input(S,L) fparse(S,L,stdin)
 195 #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);}
 196 #define parses(S,F) {FILE *_F=fopen(F,"r"); if(_F) { while(!feof(_F)) { fstring(S,_F);
 197 #define parse(F) {char *_; FILE *_F=fopen(F,"r"); if(_F) { while(!feof(_F)) { fstring(_,_F);
 198 #define fail }} else {{
 199 #define done }} if(_F)fclose(_F);}
 200 #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);}
 201 #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);}
 202 #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);}
 203
 204 /* Dynamic list advanced I/O, updated 2003-05-30 by xCh. */
 205
 206 /* obsolete #define load(A,B,F,T,K) {char *_S; parses(_S,F) { create(A,T); A->K=_S; A->_eoln=TRUE; append(A,B);} done; A->_eoln=FALSE;} */
 207 /* 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);}} */
 208
 209 /* I/O sequences, updated 2003-05-29 by xCh. */
 210
 211 #define nullreopen(F) F=freopen("/dev/null","r",F)
 212 #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]);}
 213 #define shell(CMD) stdinredir(system(CMD))
 214 #define paste(STR) stdinredir(fputs(STR,stdout))
 215
 216 /* String iterations, updated 2003-06-19 by xCh. */
 217
 218 #define split(A,B,C) for(prefix(A,B,C);A;(A!=B)&&prefix(A,B,C)||(A=NULL))
 219 #define valid_split(A,B,C) split(A,B,C) if(*A)
 220 #define columns(A,B,C,V) for(V=0,prefix(A,B,C);A;((A!=B)&&prefix(A,B,C)||(A=NULL)),V++)
 221 #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)
 222 #define column(A,B,C,V) { int _V; columns(A,B,C,_V) if(_V==V) break; }
 223 #define valid_column(A,B,C,V) { int _V; valid_columns(A,B,C,_V) if(_V==V) break; }
 224
 225 /* Useful structures, updated 2003-05-29 by xCh. */
 226
 227 #define hashtable(TYPE,NAME,VALUE) struct TYPE { char *NAME; char *VALUE; list(TYPE); }
 228 #define textfile(TYPE,LINE) struct TYPE { char *LINE; char _eoln; list(TYPE); }
 229 #define date(S) { time_t _T; _T=time(NULL); duplicate(ctime(&_T),S); }
 230
 231 /* ------------------------------------------------------------------- */
 232 /* Object infrastructure and basic macros - updated 2008-01-13 by xCh. */
 233 /* unfinished */
 234 #define bind_interface(TYPE) struct TYPE *__class
 235 #define method(NAME)
 236 #define define_interface(IFACE,TYPE) struct TYPE *__get_##_##IFACE(void) { struct TYPE *_FACE=get_mem(TYPE); __bind_##_##IFACE(_FACE); return _IFC; } void __bind_##_##IFACE(struct TYPE *_FACE)
 237 #define bind_method(METHOD,FUNCTION) _IFACE->METHOD=FUNCTION
 238 #define get_interface(IFACE) __get_##_##IFACE(void)
 239 // must be function #define get_object(TYPE) (_CLL1_MALLOC(TYPE),CLL1_ASSERT(),)
 240 //#define _(OBJECT,FUNCTION) OBJECT==NULL?NULL::(*(OBJECT->__class->METHOD))(OBJECT
 241 #endif
 242 /* ------------------------------------------------------------------- */
 243 /* some general ideas, unfinished */
 244 //#define _CLL1_THROW(ERR)
 245 //#define _CLL1_TRY _NEW_E for(;;) if () {.... if(_Eatom->SYS) { if(_Eatom->RET) return; else break;} else { }
 246 //#define _CLL1_ASSERT(EXPR) assert(EXPR)
 247 //#define _CLL1_MALLOC(TYPE) malloc(sizeof(TYPE))