cll1.h

   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 #ifndef _CLL1_H
  23 #define _CLL1_H
  24 #define CLL1H_VERSION "0.7.1"
  25 /* .----------------------------------------------------------------------.
  26   /  0. Library definitions not parsed by @CC, updated 2008-01-26 xCh.
  27  '---------------------------------------------------------------------- */
  28 /*
  29 @define USE_LIBRARY_MYSQL -lmysqlclient
  30 @define USE_LIBRARY_FASTCGI -lfcgi
  31 @define USE_PREPROCESSOR cake *.html *.xml > _include.c
  32 @define USE_POSTPROCESSOR strip @
  33 */
  34 /* .----------------------------------------------------------------------.
  35   /  1. C<<1 header auto include, updated 2008-01-26 xCh.
  36  '---------------------------------------------------------------------- */
  37 #ifndef DISABLE_MODULE_AUTOINCLUDE
  38 #include <string.h>
  39 #include <strings.h>
  40 #include <malloc.h>
  41 #include <time.h>
  42 #include <stdlib.h>
  43 #include <stdarg.h>
  44 #include <unistd.h>
  45 #include <locale.h>
  46 #ifdef USE_LIBRARY_FASTCGI
  47 #include <fcgi_stdio.h>
  48 #else
  49 #include <stdio.h>
  50 #endif
  51 #endif
  52 #ifdef USE_LIBRARY_MYSQL
  53 #include <mysql/mysql.h>
  54 #endif
  55 /* .----------------------------------------------------------------------.
  56   /  0. C<<1 typedefs and public gloabl variables, updated 2008-02-03 xCh.
  57  '----------------------------------------------------------------------- */
  58 typedef char * str; /* #ifdef USE_MODULE_UNICODE...typedef wchar_t * str; */
  59 typedef unsigned char * buf; /* this will be always 8-bit usigned char *  */
  60 typedef FILE * file;
  61 typedef int bool;
  62 extern  str NIL,EOL,OFS,IFS;
  63 extern  unsigned RANDOM_SEED;
  64 #define _EXPORT_GLOBALS str NIL="(null)", EOL="\n", OFS=" ", IFS=" \t\n", LANG=NULL; unsigned RANDOM_SEED=0;
  65 /* .----------------------------------------------------------------------.
  66   /  1. C<<1 then buddhist section, updated 2008-02-04 xCh.
  67  '----------------------------------------------------------------------- */
  68 #ifndef DISABLE_MODULE_THEN_BUDDHISM
  69 #define then
  70 #define MAYBE (int)((long)(RANDOM_SEED?random():((RANDOM_SEED=(unsigned)time(NULL)),srandom(RANDOM_SEED),random()))%2)
  71 #define WHOKNOWS (int)(srandom((unsigned)time(NULL)),random()%2)
  72 #define for_samsara(MIND,SOUL) for(MIND=SOUL; MIND || ((MIND->__next=SOUL),0) ; MIND=MIND->__next)
  73 #define samsara(MIND,SOUL) for(MIND=SOUL; MIND || ((MIND->__next=SOUL),0) ; MIND=MIND->__next)
  74 //#define atob(EXPR) (word_in_stri(YES,(EXPR))?1:0)
  75 //#define _EXPORT_YES str YES="TRUE\nYES\nJA\nOUI\nDA\nANO\nY\n1";
  76 //#else
  77 #define atob(EXPR) (eqi((EXPR),YES)?TRUE:FALSE)
  78 #define _EXPORT_YES str YES="TRUE";
  79 #endif
  80 /* .----------------------------------------------------------------------.
  81   /  2. C<<1 almost then buddhist section, updated 2008-02-02 xCh.
  82  '----------------------------------------------------------------------- */
  83 #define not !
  84 #define and &&
  85 #define or ||
  86 #define TRUE 1
  87 #define FALSE 0
  88 #define PI 3.141592654
  89 #define WEIRDINT (1<<(sizeof(int)*8-1))
  90 #define btoa(EXPR) ((EXPR)?"TRUE":"FALSE")
  91 #define coalesce(VAR,EXPR) (VAR?VAR:(VAR=0,(EXPR)))
  92 #define coalesce_str(VAR,EXPR) (VAR && *VAR?VAR:((VAR=NULL),(EXPR)))
  93 /* .----------------------------------------------------------------------.
  94   /  4. C<<1 data declaration and allocation, updated 2008-01-31 xCh.
  95  '----------------------------------------------------------------------- */
  96 #define def_mem(TYPE) typedef struct _##TYPE##_t * TYPE; struct  _##TYPE##_t
  97 #define get_mem(TYPE) _GET_MEM(TYPE)
  98 #define get_buf(SIZE) (buf)malloc(SIZE) /* temporary solution */
  99 #define size_of_mem(TYPE) sizeof(struct _##TYPE##_t)
 100 #define copy_of_mem(TYPE,SRC) _cll1_mem_cpy(sizeof(struct _##TYPE##_t),SRC)
 101 #define list(TYPE) TYPE __next
 102 #define tree(TYPE) TYPE __next; TYPE __seek
 103 #define dict(TYPE) tree(TYPE); str __key
 104 #define array(TYPE) tree(TYPE); int __key
 105 /* variable declarators */
 106 #define Get_mem(ID,TYPE) TYPE ID=get_mem(TYPE)
 107 #define Get_buf(ID,SIZE) buf ID=get_buf(SIZE)
 108 /* .----------------------------------------------------------------------.
 109   /  5. C<<1 string manipulation, updated 2008-01-26 xCh.
 110  '----------------------------------------------------------------------- */
 111 #define get_str(...) _cll1_get_str(__VA_ARGS__,NIL)
 112 #define eq(A,B) (!_cll1_str_cmp(A,B))
 113 #define eqi(A,B) (!_cll1_str_cmpi(A,B))
 114 #define str_order(A,B) _cll1_str_coll(A,B)
 115 #define str_ascii(A,B) _cll1_str_cmp(A,B)
 116 #define chars_in_str(...) _cll1_strlen(__VA_ARGS__,NIL)
 117 #define size_of_str(A) mbstowcs(NULL,A,0)
 118 #define str_in(A,B) _cll1_str_str(A,B)
 119 #define word_in(A,B) _cll1_wordinstr(A,B,0)
 120 #define print(...) _cll1_print(__VA_ARGS__,NIL)
 121 #define fprint(...) _cll1_fprint(__VA_ARGS__,NIL)
 122 #define file_print(...) _cll1_fprint(_F,__VA_ARGS__,NIL)
 123 #define echo(...) _cll1_echo(__VA_ARGS__,NIL)
 124 #define fecho(...) _cll1_fecho(__VA_ARGS__,NIL)
 125 #define file_echo(...) _cll1_fecho(_F,__VA_ARGS__,NIL)
 126 #define suffix(A,B,C) (((A=strrchr(B,C))&&!(*(A++)=0))||(A=B))
 127 #define prefix(A,B,C) ((A=B),((B=strchr(B,C))&&!(*(B++)=0)||(B=A)))
 128 #define tr(STR,B,C) _NEW(S,STR) while(S && *_S) { if(*_S==B)*_S=C; /* <-' */ _S++; }
 129 /* variable declarators */
 130 #define Get_str(ID,...) str ID=get_str(__VA_ARGS__)
 131 /* .----------------------------------------------------------------------.
 132   /  6. C<<1 data container manipulation, updated 2008-01-26 xCh.
 133  '----------------------------------------------------------------------- */
 134 #define push(NODE,HEAD) ( NODE ? ((NODE->__next=HEAD),(HEAD=NODE)) : NULL )
 135 #define pop(NODE,HEAD) ( HEAD ? ((NODE=HEAD->__next),free(HEAD),(HEAD=NODE)) : (NODE=NULL) )
 136 #define append(NODE,HEAD) { void *_PTR=NODE; if(NODE) NODE->__next=NULL; if(HEAD) { for_search(NODE,HEAD,!NODE->__next) { NODE->__next=_PTR; break; } } else HEAD=NODE; }
 137 #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); }
 138 #define drop(NODE,HEAD) for( NODE=HEAD; NODE || (HEAD=NULL); HEAD=NODE, NODE=NODE->__next, free(HEAD) )
 139 //to do: seek
 140 //to do: store
 141 #define count(NODE,HEAD,VAR) { _NEW(I,0) for(NODE=HEAD; NODE || ((VAR=_I),0) ; (NODE=NODE->__next)?(_I++):0 ); }
 142 #define order_by_int(K1,K2) (K1>K2)
 143 #define order_by_int_desc(K1,K2) (K1<K2)
 144 #define order_by_str(K1,K2) (str_order(K1,K2)>0)
 145 #define order_by_str_desc(K1,K2) (str_order(K1,K2)<0)
 146 #define order_by_ascii(K1,K2) (str_ascii(K1,K2)>0)
 147 #define order_by_ascii_desc(K1,K2) (str_ascii(K1,K2)<0)
 148 #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; } }
 149 #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); }
 150 /* .----------------------------------------------------------------------.
 151   /  7. C<<1 builtin iterators and conditionals, updated 2008-01-26 xCh.
 152  '----------------------------------------------------------------------- */
 153 #define loop while(TRUE)
 154 #define repeat(N) _NEW(I,0) _NEW(J,(N)) while(_I++<_J) /* C99  version would be: for(int _i=0,_j=(N);_i++<_j;) */
 155 #define for_range(VAR,FROM,TO) _NEW(I,(FROM)) _NEW(J,(TO)) for( VAR=_I ; _I<=_J?VAR<=_J:VAR>=_J ; _I<=_J?VAR++:VAR--)
 156 #define for_each(NODE,HEAD) for(NODE=HEAD; NODE; NODE=NODE->__next)
 157 #define for_search(NODE,HEAD,EXPR) for_each(NODE,HEAD) if(EXPR)
 158 #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 */
 159 #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 */
 160 #define for_ints(VAR,...) _NEW(I,0) while( (VAR=_cll1_for_ints(_I++,__VA_ARGS__,WEIRDINT))!=WEIRDINT )
 161 #define for_strs(VAR,...) _NEW(I,0) while( (VAR=(char *)_cll1_for_ptrs(_I++,__VA_ARGS__,NIL))!=NIL )
 162 #define for_args(STR) _NEW(I,1) while(_I++<argc)
 163 #define this_arg argv[_I]
 164 #define next_arg ((_I+1<argc)?argv[_I]:NULL)
 165 #define continue_args _I++
 166 #define if_exists(NODE,HEAD,EXPR) for_search(NODE,HEAD,EXPR) break; if(NODE)
 167 #define if_args if(argc>1)
 168 #define switch_for_args for_args switch_str(this_arg)
 169 #define switch_str(STR) _NEW(S,STR)
 170 #define if_case(VAL) if(eq(argv[_I],VAL))
 171 #define for_fields(FIELD,STR) for_valid_split(FIELD,STR,*OFS)
 172 #define for_split_str(A,B,C) for(prefix(A,B,C);A;(A!=B)&&prefix(A,B,C)||(A=NULL))
 173 #define for_valid_split(A,B,C) for_split_str(A,B,C) if(*A)
 174 #define switch_for_columns(A,B,C) _FOR_COLUMNS(A,B,C) switch(__I)
 175 #define switch_for_valid_columns(A,B,C) _FOR_VALID_COLUMNS(A,B,C) switch (_I)
 176 #define if_column_number(A,B,C,V) _FOR_COLUMNS(A,B,C) if(_I==V)
 177 #define if_valid_column_number(A,B,C,V) _FOR_VALID_COLUMNS(A,B,C) if(_I==V)
 178 /* .----------------------------------------------------------------------.
 179   /  8. C<<1 object oriented infrastructure, updated 2008-02-04
 180  '----------------------------------------------------------------------- */
 181 #define def_type(TYPE) typedef struct  _##TYPE##_t * TYPE;
 182 #define def_obj(TYPE) struct _##TYPE##_t
 183 #define interface(TYPE) TYPE __interface
 184 #define interface_of(SELF) SELF->__interface
 185 #define method(NAME) (*NAME)
 186 #define construct(TYPE,INTERFACE) TYPE _init_##TYPE(TYPE o,INTERFACE i) { o->__interface=i; return o; } TYPE __init__##TYPE
 187 #define get_obj(TYPE,INTERFACE,...) __init__##TYPE(_init_##TYPE(get_mem(TYPE),INTERFACE),__VA_ARGS__)
 188 #define get_obj_as(COMMUNITY,MEM,INTERFACE,...) (COMMUNITY)get_obj(MEM,INTERFACE,__VA_ARGS__)
 189 #define _(METHOD,...) ((((_ARG1(__VA_ARGS__,)) || /* will not compile if object is not lvalue: */(_ARG1(__VA_ARGS__,)=NULL)) && (_ARG1(__VA_ARGS__,))->__interface->METHOD)?(*( (_ARG1(__VA_ARGS__,))->__interface->METHOD )) ((void *)__VA_ARGS__):0)
 190 #define __(METHOD,...) ( _ASSERT(ARG1(__VA_ARGS__,)), (*( __cll1_seekmethod(ARG1(__VA_ARGS__,),METHOD) )) ( __VA_ARGS__ ) )
 191 #define call(OBJTYPE,METHOD,...) { int _N=0; OBJTYPE _OBJ; /* <-' */ while( (_OBJ=(OBJTYPE)_cll1_for_ptrs(_N++,__VA_ARGS__,NIL))!=(OBJTYPE)NIL ) _(_OBJ,METHOD); }
 192 #define def_community(TYPE,INTERFACE) def_obj(TYPE) { INTERFACE __interface; };
 193 #define anonymous void *
 194 /* variable declarators */
 195 #define Get_obj(ID,MEM,...) MEM ID=get_obj(MEM,__VA_ARGS__)
 196 #define Get_obj_as(ID,COMMUNITY,MEM,...) MEM ID=get_obj_as(COMMUNITY,MEM,INTERFACE,__VA_ARGS__)
 197 #define I_am(SELF,MEM) MEM SELF=(MEM)community
 198 /* .----------------------------------------------------------------------.
 199   /  9. implementation of C<<1 library functions, updated 2008-01-26 xCh.
 200  '----------------------------------------------------------------------- */
 201 /* later... #define _MALLOC void *_cll1_malloc(size_t size) {  return malloc(size); } */
 202 #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); }
 203 #define _DECLARE_PRINT void _cll1_print(const char *s,...)
 204 #define _PRINT _DECLARE_PRINT _CLL1_FPRINT(stdout)
 205 #define _DECLARE_FPRINT void _cll1_fprint(FILE *f,const char *s,...)
 206 #define _FPRINT _DECLARE_FPRINT _CLL1_FPRINT(f)
 207 #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); }
 208 #define _ECHO void _cll1_echo(char *s,...) _CLL1_FECHO(stdout)
 209 #define _FECHO void _cll1_fecho(FILE *f,char *s,...) _CLL1_FECHO(f)
 210 #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) n=va_arg(ap,int); return n; }
 211 #define _FOR_PTRS void *_cll1_for_ptrs(int i, void *v, ...) { int j=0;va_list ap; /* <-' */ va_start(ap,v); while(v!=(void *)NIL && j++<i) v=va_arg(ap,void *); return v; }
 212 #define _DECLARE_STRCOLL  int _cll1_str_coll(str a, str b)
 213 #define _STRCOLL _DECLARE_STRCOLL { if(a && b) return strcoll(a,b); else return (int)(a-b); }
 214 #define _DECLARE_STRCMP int _cll1_str_cmp(str a, str b)
 215 #define _STRCMP _DECLARE_STRCMP { if(a && b) return strcmp(a,b); else return (int)(a-b); }
 216 #define _DECLARE_STRCMPI int _cll1_str_cmpi(str a, str b)
 217 #define _STRCMPI _DECLARE_STRCMPI { if(a && b) return strcasecmp(a,b); else return (int)(a-b); }
 218 #define _DECLARE_STRSTR str _cll1_str_str(str h, str n)
 219 #define _STRSTR _DECLARE_STRSTR { if(h && n) return strstr(h,n); else return NULL; }
 220 // later... #define _WORDINSTR char *_cll1_wordinstr(char *a,char *b,int ign) { char *IFS=a; for(;a&&*a;a++) for(;*ifs||ifs=IFS;ifs++) if(*a=b);) for    return strcasestr(a,b); else return NULL; }
 221 extern  _DECLARE_PRINT;
 222 extern  _DECLARE_FPRINT;
 223 extern  _DECLARE_STRCOLL;
 224 extern  _DECLARE_STRCMP;
 225 extern  _DECLARE_STRCMPI;
 226 extern  _DECLARE_STRSTR;
 227 #define _EXPORT_OUTS _PRINT _FPRINT _ECHO _FECHO
 228 #define _EXPORT_STRS _STRCOLL _STRCMP _STRCMPI _STRSTR //_WORDINSTR
 229 #define _EXPORT_ARGS _FOR_INTS _FOR_PTRS
 230 /* .----------------------------------------------------------------------.
 231   /  10. C<<1 private infrastructure, updated 2008-02-03 by xCh.
 232  '----------------------------------------------------------------------- */
 233 #define _I (_Iatom->I)
 234 #define _J (_Jatom->J)
 235 #define _S (_Satom->S)
 236 #define _F (_Fatom->F)
 237 #define _CTX (_CTXatom->CTX)
 238 #define _ARG1(ARG1,...) ARG1
 239 #define _ASSERT(EXPR) assert(EXPR) /* later... _cll1_assert(EXPR,handler) */
 240 #define _GET_MEM(TYPE) ((TYPE)malloc(sizeof(struct _##TYPE##_t))) /* later... ((TYPE)_cll1_malloc(sizeof(struct _##TYPE##_t))) */
 241 #define _ANYATOM(TYPE,NAME) def_mem(_##NAME##Atom ) { TYPE NAME; int c; list( _##NAME##Atom ); }
 242 #define _FOR_COLUMNS(A,B,C) _NEW(I,0) for( prefix(A,B,C) ; A ; ((A!=B)&&prefix(A,B,C)||(A=NULL) ),_I++ )
 243 #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)
 244 #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--)
 245 #define _ANYSTACK(NAME) _##NAME##Atom _##NAME##atom,_##NAME##stack=NULL;
 246 #define _EXPORT_STACKS _ANYSTACK(I) _ANYSTACK(J) _ANYSTACK(S) _ANYSTACK(F) _ANYSTACK(CTX)
 247 _ANYATOM(int,I);
 248 _ANYATOM(int,J);
 249 _ANYATOM(str,S);
 250 _ANYATOM(FILE *,F);
 251 _ANYATOM(void *,CTX);
 252 /* .----------------------------------------------------------------------.
 253   /  11. C<<1 memory contexts - alternative to garbage collection
 254  '----------------------------------------------------------------------- */
 255 typedef _CTXAtom * context;
 256 #define create_context(ID) create_mem(ID,context)
 257 /* .----------------------------------------------------------------------.
 258   /  12. C<<1 CGI and FASTCGI handling, updated 2008-01-16 by xCh.
 259  '----------------------------------------------------------------------- */
 260 #ifdef USE_LIBRARY_FASTCGI
 261 #define while_fastcgi_accept while(FCGI_Accept()>=0)
 262 #define USE_MODULE_CGI
 263 #endif
 264 #ifdef USE_MODULE_CGI
 265 #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); }
 266 #define _GETCGI char *getcgi(VAR) {     }
 267 #define _CGI_GLOBALS def_context(_CGI); struct _CGIVariable { char *V; dict(_CGIVariable); } *_CGIvariable,*_CGIdict;
 268 #else
 269 #define _GETCGI
 270 #define _CGI_GLOBALS
 271 #endif
 272 /* .----------------------------------------------------------------------.
 273   /  13. MySQL wrappers + SQL object interface, updated 2007-12-19 by xCh.
 274  '----------------------------------------------------------------------- */
 275 #ifdef USE_LIBRARY_MYSQL
 276 #define def_sql(CONN) MYSQL *CONN
 277 #define create_sql(CONN) MYSQL *ID=mysql_init(NULL)
 278 #define sql_connect(CONN,S,U,P,D) mysql_real_connect(CONN,S,U,P,D,0,NULL,0)
 279 //todo sql_query
 280 //todo sql_queryf
 281 //todo for_sql_query_results(ROW,CONN,QUERY)
 282 //todo for_sql_queryf_results
 283 #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)
 284 #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) )
 285 //todo db_query
 286 //todo for_db_results
 287 //todo for_db_queryf_results(ROW,...)
 288 //todo db_queryf
 289 #define _MYSQLC (_MYSQLCatom->MYSQLC)
 290 #define _MYSQLR (_MYSQLRatom->MYSQLR)
 291 #define _SQL_GLOBALS _ANYSTACK(MYSQL,MYSQLC) _ANYSTACK(MYSQL_RES,MYSQLR)
 292 #else
 293 #define _SQL_GLOBALS
 294 #endif
 295 //#ifdef USE_INTERFACE_SQL
 296 //todo #define _SQL_OBJECT mem Sql { interface(SqlInterface); char *hostname; char *username; char *password; char *database; }
 297 //todo #define _SQL_CONSTRUCT def_construct(Sql) { self->hostname="localhost"; }
 298 //#endif
 299
 300 /* ------------------------------------------------------------------- */
 301 /* old - from version 0.6                                              */
 302 /* =================================================================== */
 303 /*
 304 obsolete
 305 #define strlwr(A) {char *_S=A; while(_&&*_S){*_S=tolower(*_S);_S++;}}
 306 #define strupr(A) {char *_S=A; while(_&&*_S){*_S=toupper(*_S);_S++;}}
 307 #define string(S,L) (S=(char *)malloc(L),*S=0)
 308 #define duplicate(A,B) if(A) { string(B,strlen(A)+1); strcpy(B,A); }
 309 #define concatenate(A,B,C) if (A && B) { string(C,strlen(A)+strlen(B)+1); strcpy(C,A); strcat(C,B); }
 310 #define gotoalpha(CHAR) if(CHAR)while(*CHAR && !isalpha(*CHAR))CHAR++
 311 #define goto_alpha(CHAR) if(CHAR)while(*CHAR && !isalpha(*CHAR) && *CHAR!='_')CHAR++
 312 #define gotoalnum(CHAR) if(CHAR)while(*CHAR && !isalnum(*CHAR))CHAR++
 313 #define goto_alnum(CHAR) if(CHAR)while(*CHAR && !isalnum(*CHAR) && *CHAR!='_')CHAR++
 314 #define skipalpha(CHAR) if(CHAR)while(*CHAR && isalpha(*CHAR))CHAR++
 315 #define skip_alpha(CHAR) if(CHAR)while(*CHAR && (isalpha(*CHAR) || *CHAR=='_'))CHAR++
 316 #define skipalnum(CHAR) if(CHAR)while(*CHAR && isalnum(*CHAR))CHAR++
 317 #define skip_alnum(CHAR) if(CHAR)while(*CHAR && (isalnum(*CHAR) || *CHAR=='_'))CHAR++
 318 #define skipspaces(CHAR) if(CHAR)while(*CHAR==' ')CHAR++
 319 #define cutspaces(CHAR) if(CHAR){int _L=strlen(CHAR); while(--_L>0 && CHAR[_L]==' ')CHAR[_L]=0;}
 320 #define gotochr(CHAR,C) if(CHAR)while(*CHAR && *CHAR!=C)CHAR++
 321 #define strswitch(CHAR) {char *_K=CHAR; FILE *_F=NULL; {{
 322 #define stroption(STR) if(eq(STR,_K))
 323 #define match(KEY,VAL) {char *_K=KEY, *_V=VAL; FILE *_F=NULL; {{
 324 #define assign(STR,SETVAR) stroption(STR) SETVAR=_V
 325 */
 326 /* I/O iterations, updated 2004-04-19 by xCh. */
 327
 328 //#define fparse(S,L,F) for(fgets(S,L,F);*S && !feof(F);fgets(S,L,F))
 329 //#define input(S,L) fparse(S,L,stdin)
 330 //#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);}
 331 //#define parses(S,F) {FILE *_F=fopen(F,"r"); if(_F) { while(!feof(_F)) { fstring(S,_F);
 332 //obsolete
 333 //#define parse(F) {char *_; FILE *_F=fopen(F,"r"); if(_F) { while(!feof(_F)) { fstring(_,_F);
 334 //#define fail }} else {{
 335 //#define done }} if(_F)fclose(_F);}
 336 //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);}
 337 //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);}
 338 //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);}
 339
 340 /* I/O sequences, updated 2003-05-29 by xCh. */
 341
 342 #define nullreopen(F) F=freopen("/dev/null","r",F)
 343 #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]);}
 344 #define shell(CMD) stdinredir(system(CMD))
 345 #define paste(STR) stdinredir(fputs(STR,stdout))
 346
 347 /* Useful structures, updated 2003-05-29 by xCh. */
 348
 349 //#define date(S) { time_t _T; _T=time(NULL); duplicate(ctime(&_T),S); }
 350
 351 /* some general ideas, unfinished */
 352 //bind_exception, unbind_exception
 353 //#define _CLL1_THROW(ERR)
 354 //#define _CLL1_TRY _NEW_E for(bind_exception(0,NULL);;) if () {.... if(_Eatom->SYS) { if(_Eatom->RET) return; else break;} else { }
 355
 356
 357 /* .----------------------------------------------------------------------.
 358   /  98. We have have done our homework - now let's have some fun:
 359  '----------------------------------------------------------------------- */
 360 #define _INIT_VARIABLES _EXPORT_GLOBALS _EXPORT_YES _EXPORT_STACKS _SQL_GLOBALS _CGI_GLOBALS
 361 #define _IMPL_FUNCTIONS /*_MALLOC*/ _EXPORT_OUTS _EXPORT_ARGS _EXPORT_STRS
 362 #define _IMPL_INTERFACE //_SQL_IFC _CAKE_IFC _STD_IFC _X_IFC
 363 #define _IMPLEMENT_CLL1_LIBRARY _INIT_VARIABLES _IMPL_FUNCTIONS _IMPL_INTERFACE
 364 #define _PROGRAM _cll1_program
 365 #define _DECLARE_PROGRAM void _PROGRAM(int argc, char **argv)
 366 #define program _IMPLEMENT_CLL1_LIBRARY _DECLARE_PROGRAM; int main(int argc, char **argv) { LANG=setlocale(LC_ALL, ""); _PROGRAM(argc,argv); return 0; } _DECLARE_PROGRAM
 367 #ifdef USE_PREPROCESSOR
 368 #include "_include.c"
 369 #endif
 370 /* .----------------------------------------------------------------------.
 371   /  99. C<<1 is up and running. It's your turn now to show something new.
 372  '----------------------------------------------------------------------- */
 373 #endif