crl1.h

   1   /* .----------------------------------------------------------------------.
   2  /  C<<1 header file - C language style sheet - GNU C/ANSI C99 compliant
   3 '----------------------------------------------------------------------- */
   4 /*
   5    Copyright (c) 2004-2011 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 #ifndef _CRL1_H
  22 #define _CRL1_H
  23 #define _CRL1H_VERSION "0.9.1"
  24 #ifdef __GNUC__
  25 #if __STDC_VERSION__ >= 199901L
  26 #define _C99
  27 #endif
  28 #endif
  29 /* .----------------------------------------------------------------------.
  30   /  0. Library definitions not parsed by @CC, updated 2008-01-26 xCh.
  31  '---------------------------------------------------------------------- */
  32 /*
  33 @define USE_LIBRARY_MYSQL -lmysqlclient
  34 @define USE_LIBRARY_FASTCGI -lfcgi
  35 @define USE_TOOL cake *.html *.xml > _include.c
  36 @define USE_TOOL strip @
  37 */
  38 /* .----------------------------------------------------------------------.
  39   /  1. C<<1 header auto include, updated 2008-01-26 xCh.
  40  '---------------------------------------------------------------------- */
  41 #ifndef DISABLE_MODULE_AUTOINCLUDE
  42 #include <string.h>
  43 #include <strings.h>
  44 #include <malloc.h>
  45 #include <time.h>
  46 #include <stdlib.h>
  47 #include <stdarg.h>
  48 #include <unistd.h>
  49 #include <setjmp.h>
  50 #include <errno.h>
  51 #include <locale.h>
  52 #ifdef USE_FASTCGI
  53 #include <fcgi_stdio.h>
  54 #else
  55 #include <stdio.h>
  56 #endif
  57 #endif
  58 #ifdef USE_MYSQL
  59 #include <mysql/mysql.h>
  60 #endif
  61 /* .----------------------------------------------------------------------.
  62   /  2. C<<1 typedefs and public global variables, updated 2008-02-03 xCh.
  63  '----------------------------------------------------------------------- */
  64 typedef void * any;
  65 typedef unsigned char * buf; /* this will be always 8-bit usigned char *  */
  66 typedef FILE * file;
  67 typedef int bool;
  68 typedef char * str;
  69 #ifdef USE_MYSQL
  70 typedef MYSQL_ROW row;
  71 #endif
  72 extern  str NIL, EOL, OFS, IFS, LANG, errstr; /* used for: perror(errstr) */
  73 extern  unsigned RANDOM_SEED;
  74 #define _EXPORT_GLOBALS                                         \
  75 str NIL="(null)", EOL="\n", OFS=" ", IFS=" \t\n", LANG=NULL;    \
  76 str ERR="C<<1 0xdead";                                          \
  77 unsigned RANDOM_SEED=0;
  78 /* .----------------------------------------------------------------------.
  79   /  3. C<<1 then buddhist section, updated 2008-02-04 xCh.
  80  '----------------------------------------------------------------------- */
  81 #ifndef DISABLE_MODULE_THEN_BUDDHISM
  82 #define then
  83 #define MAYBE (int)((long)(RANDOM_SEED?random():((RANDOM_SEED=(unsigned)time(NULL)),srandom(RANDOM_SEED),random()))%2)
  84 #define WHOKNOWS (int)(srandom((unsigned)time(NULL)),random()%2)
  85 #define for_samsara(MIND,SOUL) loop for_each(MIND,SOUL)
  86 //#define atob(EXPR) (word_in_stri(YES,(EXPR))?1:0)
  87 //#define _EXPORT_YES str YES="TRUE\nYES\nJA\nOUI\nDA\nANO\nY\n1";
  88 //#else
  89 #define atob(EXPR) (eqi((EXPR),YES)?TRUE:FALSE)
  90 #define _EXPORT_YES str YES="TRUE";
  91 #endif
  92 /* .----------------------------------------------------------------------.
  93   /  4. C<<1 almost 'then buddhist' section, updated 2008-02-02 xCh.
  94  '----------------------------------------------------------------------- */
  95 #define not !
  96 #define and &&
  97 #define or ||
  98 #define TRUE 1
  99 #define FALSE 0
 100 #define PI 3.141592654
 101 #define WEIRDINT (1<<(sizeof(int)*8-1))
 102 #define btoa(EXPR) ((EXPR)?YES:"FALSE")
 103 /* .----------------------------------------------------------------------.
 104   /  5. C<<1 data declaration and allocation, updated 2008-01-31 xCh.
 105  '----------------------------------------------------------------------- */
 106 #define def_type(TYPE) typedef struct _##TYPE##_struct * TYPE
 107 #define def_mem(TYPE) def_type(TYPE); struct  _##TYPE##_struct
 108 #define get_mem(TYPE) _GET_MEM(TYPE)
 109 #define get_array(TYPE,N) (TYPE *)calloc(N,sizeof(TYPE)) /* temporary solution */
 110 #define get_buf(SIZE) (buf)malloc(SIZE) /* temporary solution */
 111 //#define size_of_mem(TYPE) sizeof(struct _##TYPE##_struct)
 112 //#define copy_of_mem(TYPE,SRC) _crl1_mem_cpy(sizeof(struct _##TYPE##_struct),SRC)
 113 #define list(TYPE) TYPE __next
 114 #define tree(TYPE) TYPE __next; TYPE __seek
 115 #define dict(TYPE) tree(TYPE); str __key
 116 /* .----------------------------------------------------------------------.
 117   /  5. C<<1 string manipulation, updated 2008-01-26 xCh.
 118  '----------------------------------------------------------------------- */
 119 #define get_str(...) _crl1_get_str(__VA_ARGS__,NIL)
 120 #define get_strs(...) _crl1_get_strs(__VA_ARGS__,NIL)
 121 #define eq(A,B) (!_crl1_str_cmp(A,B))
 122 #define eqi(A,B) (!_crl1_str_cmpi(A,B))
 123 #define str_order(A,B) _crl1_str_coll(A,B)
 124 #define str_ascii(A,B) _crl1_str_cmp(A,B)
 125 #define chars_in_str(...) _crl1_strlen(__VA_ARGS__,NIL)
 126 #define size_of_str(A) mbstowcs(NULL,A,0)
 127 #define str_in(A,B) _crl1_str_str(A,B)
 128 #define word_in(A,B) _crl1_wordinstr(A,B,0)
 129 #define print(...) _crl1_print(__VA_ARGS__,NIL)
 130 #define fprint(...) _crl1_fprint(__VA_ARGS__,NIL)
 131 #define file_print(...) _crl1_fprint(_F,__VA_ARGS__,NIL)
 132 #define echo(...) _crl1_echo(__VA_ARGS__,NIL)
 133 #define fecho(...) _crl1_fecho(__VA_ARGS__,NIL)
 134 #define file_echo(...) _crl1_fecho(_F,__VA_ARGS__,NIL)
 135 #define suffix(A,B,C) (((A=strrchr(B,C))&&!(*(A++)=0))||(A=B))
 136 #define prefix(A,B,C) ((A=B),((B=strchr(B,C))&&!(*(B++)=0)||(B=A)))
 137 #define tr(STR,B,C) _NEW(S,STR) while(S && *_S) { if(*_S==B)*_S=C; /* <-' */ _S++; }
 138 /* .----------------------------------------------------------------------.
 139   /  6. C<<1 data container manipulation, updated 2008-01-26 xCh.
 140  '----------------------------------------------------------------------- */
 141 #define push(NODE,HEAD) ( NODE ? ((NODE->__next=HEAD),(HEAD=NODE)) : NULL )
 142 #define pop(NODE,HEAD) ( HEAD ? ((NODE=HEAD->__next),free(HEAD),(HEAD=NODE)) : (NODE=NULL) )
 143 #define append(NODE,HEAD) { void *_PTR=NODE; if(NODE) NODE->__next=NULL; if(HEAD) { for_selected(NODE,HEAD,!NODE->__next) { NODE->__next=_PTR; break; } } else HEAD=NODE; }
 144 #define remove(NODE,HEAD,EXPR) { void **_D=NULL; /* <-' */ for_selected(NODE,HEAD,EXPR) { if(_D)*_D=NODE->__next; else HEAD=NODE->__next; free(NODE); } else _D=(void *)&(NODE->__next); }
 145 #define drop(NODE,HEAD) for( NODE=HEAD; NODE || (HEAD=NULL); HEAD=NODE, NODE=NODE->__next, free(HEAD) )
 146 //to do: seek
 147 //to do: store
 148 #define count(NODE,HEAD,VAR) { _NEW(I,0) for(NODE=HEAD; NODE || ((VAR=_I),0) ; (NODE=NODE->__next)?(_I++):0 ); }
 149 #define order_by_num(K1,K2) (K1>K2)
 150 #define order_by_num_desc(K1,K2) (K1<K2)
 151 #define order_by_str(K1,K2) (str_order(K1,K2)>0)
 152 #define order_by_str_desc(K1,K2) (str_order(K1,K2)<0)
 153 #define order_by_ascii(K1,K2) (str_ascii(K1,K2)>0)
 154 #define order_by_ascii_desc(K1,K2) (str_ascii(K1,K2)<0)
 155 #define insert(NODE,HEAD,ORDERBY,KEY) { if(HEAD) { void **_L=NULL, *H=HEAD; /* <-' */ for_selected(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; } }
 156 #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); }
 157 /* .----------------------------------------------------------------------.
 158   /  7. C<<1 builtin iterators and conditionals, updated 2008-01-26 xCh.
 159  '----------------------------------------------------------------------- */
 160 #define loop while(TRUE)
 161 #define repeat(N) for(int _i=0,_j=(N); _i++<_j;)
 162 #define for_each(ONE_T,ONE,ALL_T,...) for(_init_##ONE_T##_##ALL_T(_head_##ONE_T##_##ALL_T(ONE,__VA_ARGS__));_test_##ONE_T##_##ALL_T(ONE,__VA_ARGS__) || _free_##ONE_T##_##ALL_T(ONE,__VA_ARGS__);_next_##ONE_T##_##ALL_T(ONE,__VA_ARGS__))
 163 #define count(ONE_T,ALL_T,...) _count_##ONE_T##_##ALL_T(__VA_ARGS__)
 164
 165
 166
 167 /* .----------------------------------------------------------------------.
 168   /  8. C<<1 object oriented infrastructure, updated 2008-02-04
 169  '----------------------------------------------------------------------- */
 170 #define def_interface(TYPE,INTERFACE) def_type(TYPE); def_mem(INTERFACE)
 171 #define def_obj(TYPE) struct _##TYPE##_struct
 172 #define interface(TYPE) TYPE __interface
 173 #define interface_of(SELF) SELF->__interface
 174 #define method(NAME) (*NAME)
 175 #define construct(TYPE,INTERFACE) TYPE _init_##TYPE(TYPE o,INTERFACE i) { o->__interface=i; return o; } TYPE __init__##TYPE
 176 #define get_obj(TYPE,INTERFACE,...) __init__##TYPE(_init_##TYPE(get_mem(TYPE),INTERFACE),__VA_ARGS__)
 177 #define get_obj_as(COMMUNITY,MEM,INTERFACE,...) (COMMUNITY)get_obj(MEM,INTERFACE,__VA_ARGS__)
 178 #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)
 179 //#define __(METHOD,...) ( _ASSERT(ARG1(__VA_ARGS__,)), (*( __crl1_seekmethod(ARG1(__VA_ARGS__,),METHOD) )) ( __VA_ARGS__ ) )
 180 #define call(OBJTYPE,METHOD,...) { int _N=0; OBJTYPE _OBJ; /* <-' */ while( (_OBJ=(OBJTYPE)_crl1_for_ptrs(_N++,__VA_ARGS__,NIL))!=(OBJTYPE)NIL ) _(_OBJ,METHOD); }
 181 #define def_community(TYPE,INTERFACE) def_obj(TYPE) { INTERFACE __interface; };
 182 /* ---- variable declarators -------------------------------------------- */
 183 #define Get_obj(ID,MEM,...) MEM ID=get_obj(MEM,__VA_ARGS__)
 184 #define Get_obj_as(ID,COMMUNITY,MEM,...) MEM ID=get_obj_as(COMMUNITY,MEM,INTERFACE,__VA_ARGS__)
 185 #define I_am(SELF,MEM) MEM SELF=(MEM)community
 186 /* .----------------------------------------------------------------------.
 187   /  9. C<<1 setjmp()/longjmp() based exceptions, updated 2008-09-30
 188  '----------------------------------------------------------------------- */
 189 #define FAILED_TO_FAIL -273
 190 #define SYSTEM_FAILURE -1
 191 #define LOCAL_FAILURE 13
 192 #define LIBRARY_FAILURE 23
 193 #define EVIL_FAILURE 666
 194 #define die(MSG) longjmp(_EENV,(errstr=(MSG),LOCAL_FAILURE))
 195 #define try _NEW(E,0) if(!(_E=setjmp(_EENV)))
 196 #define fail(E) longjmp(_EENV,((E)>0?(E):FAILED_TO_FAIL))
 197 #define pass_failure (_Eatom->__next?longjmp((pop(_Eatom,_Estack),_EENV),_E):_SYSFAIL(FAILED_TO_FAIL))
 198 #define else_switch_failures else switch(_E)
 199 #define else_catch(E) else if (_E==(E))
 200 /* .----------------------------------------------------------------------.
 201   /  10. implementation of C<<1 library functions, updated 2008-01-26 xCh.
 202  '----------------------------------------------------------------------- */
 203 /* later... #define _MALLOC void *_crl1_malloc(size_t size) {  return malloc(size); } */
 204 #define _CRL1_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); }
 205 #define _DECLARE_PRINT void _crl1_print(const char *s,...)
 206 #define _PRINT _DECLARE_PRINT _CRL1_FPRINT(stdout)
 207 #define _DECLARE_FPRINT void _crl1_fprint(FILE *f,const char *s,...)
 208 #define _FPRINT _DECLARE_FPRINT _CRL1_FPRINT(f)
 209 #define _CRL1_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); }
 210 #define _ECHO void _crl1_echo(char *s,...) _CRL1_FECHO(stdout)
 211 #define _FECHO void _crl1_fecho(FILE *f,char *s,...) _CRL1_FECHO(f)
 212 #define _FOR_INTS int _crl1_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; }
 213 #define _FOR_PTRS void *_crl1_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; }
 214 #define _DECLARE_STRCOLL  int _crl1_str_coll(str a, str b)
 215 #define _STRCOLL _DECLARE_STRCOLL { if(a && b) return strcoll(a,b); else return (int)(a-b); }
 216 #define _DECLARE_STRCMP int _crl1_str_cmp(str a, str b)
 217 #define _STRCMP _DECLARE_STRCMP { if(a && b) return strcmp(a,b); else return (int)(a-b); }
 218 #define _DECLARE_STRCMPI int _crl1_str_cmpi(str a, str b)
 219 #define _STRCMPI _DECLARE_STRCMPI { if(a && b) return strcasecmp(a,b); else return (int)(a-b); }
 220 #define _DECLARE_STRSTR str _crl1_str_str(str h, str n)
 221 #define _STRSTR _DECLARE_STRSTR { if(h && n) return strstr(h,n); else return NULL; }
 222 // later... #define _WORDINSTR char *_crl1_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; }
 223 extern  _DECLARE_PRINT;
 224 extern  _DECLARE_FPRINT;
 225 extern  _DECLARE_STRCOLL;
 226 extern  _DECLARE_STRCMP;
 227 extern  _DECLARE_STRCMPI;
 228 extern  _DECLARE_STRSTR;
 229 #define _EXPORT_OUTS _PRINT _FPRINT _ECHO _FECHO
 230 #define _EXPORT_STRS _STRCOLL _STRCMP _STRCMPI _STRSTR //_WORDINSTR
 231 #define _EXPORT_ARGS _FOR_INTS _FOR_PTRS
 232 /* .----------------------------------------------------------------------.
 233   /  10. C<<1 private infrastructure, updated 2008-02-03 by xCh.
 234  '----------------------------------------------------------------------- */
 235 #define _I (_Iatom->I)
 236 #define _J (_Iatom->J)
 237 #define _S (_Satom->S)
 238 #define _F (_Fatom->F)
 239 #define _CTX (_CTXatom->CTX)
 240 #define _E (_Eatom->E)
 241 #define _EENV (_Eatom->ENV)
 242 #define _ERRNO (_Eatom->ERRNO)
 243 #define _ARG1(ARG1,...) ARG1
 244 //#define _ASSERT(EXPR) (expr?expr:fail(CONSISTENCY_FAILURE))
 245 #define _SYSFAIL(E) longjmp(_EENV,(_ERRNO=errno,(E)))
 246 #define _GET_MEM(TYPE) ((TYPE)malloc(sizeof(struct _##TYPE##_struct))) /* later... ((TYPE)_crl1_malloc(sizeof(struct _##TYPE##_struct))) */
 247 #define _ANYATOM(NAME,DECL) def_mem(_##NAME##Atom ) { DECL; int c; list( _##NAME##Atom ); }
 248 //#define _FOR_COLUMNS(A,B,C) _NEW(I,0) for( prefix(A,B,C) ; A ; ((A!=B)&&prefix(A,B,C)||(A=NULL) ),_I++ )
 249 //#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)
 250 #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--)
 251 #define _ANYSTACK(NAME) extern _##NAME##Atom _##NAME##atom, _##NAME##stack; _##NAME##Atom _##NAME##atom,_##NAME##stack=NULL;
 252 #define _EXPORT_STACKS _ANYSTACK(I) _ANYSTACK(S) _ANYSTACK(F) _ANYSTACK(CTX) _ANYSTACK(E)
 253 _ANYATOM(I, int I;int J);
 254 _ANYATOM(S, str S);
 255 _ANYATOM(F, file F);
 256 _ANYATOM(CTX, void *CTX);
 257 _ANYATOM(E, int E;jmp_buf ENV;int ERRNO);
 258 /* .----------------------------------------------------------------------.
 259   /  11. C<<1 memory contexts - alternative to garbage collection
 260  '----------------------------------------------------------------------- */
 261 typedef _CTXAtom * context;
 262 #define create_context(ID) create_mem(ID,context)
 263 /* .----------------------------------------------------------------------.
 264   /  12. C<<1 CGI and FASTCGI handling, updated 2008-01-16 by xCh.
 265  '----------------------------------------------------------------------- */
 266 #ifdef USE_LIBRARY_FASTCGI
 267 #define while_fastcgi_accept while(FCGI_Accept()>=0)
 268 #define USE_MODULE_CGI
 269 #endif
 270 #ifdef USE_MODULE_CGI
 271 #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); }
 272 #define _GETCGI char *getcgi(VAR) {     }
 273 #define _CGI_GLOBALS def_context(_CGI); struct _CGIVariable { char *V; dict(_CGIVariable); } *_CGIvariable,*_CGIdict;
 274 #else
 275 #define _GETCGI
 276 #define _CGI_GLOBALS
 277 #endif
 278 /* .----------------------------------------------------------------------.
 279   /  13. MySQL wrappers + SQL object interface, updated 2007-12-19 by xCh.
 280  '----------------------------------------------------------------------- */
 281 #define use_mysql(H,U,P,D) for(MYSQL *_M=mysql_init(NULL);_M && mysql_real_connect(_M,H,U,P,D,0,NULL,0) ;mysql_close(_M),_M=NULL)
 282 #define for_sql_rows(R,Q) for(MYSQL_RES *_MYSQLR = (mysql_query(_M,Q)?NULL:mysql_use_result(_M)); (R=(_MYSQLR?mysql_fetch_row(_MYSQLR):NULL)) || (mysql_free_result(_MYSQLR),0); )
 283 /* .----------------------------------------------------------------------.
 284   /  14. Obj community with Object interface , updated 2009-01-05 by xCh.
 285  '----------------------------------------------------------------------- */
 286 #ifdef USE_MODULE_OBJECTS
 287 def_interface(Obj,Object)
 288 {
 289  void method(out) (Obj self);
 290  void method(len) (Obj self);
 291  void method(head) (Obj self);
 292  void method(next) (Obj self);
 293 };
 294
 295 def_community(Obj,Object);
 296
 297 def_mem(Int)
 298 {
 299  interface(Object);
 300  long _value;
 301 };
 302
 303 def_mem(Str)
 304 {
 305  interface(Object);
 306  str _value;
 307 };
 308
 309 def_mem(Array)
 310 {
 311  interface(Object);
 312  Obj * _value;
 313 };
 314
 315 def_mem(List)
 316 {
 317  interface(Object);
 318  Obj _value;
 319 };
 320
 321 #endif
 322 /* ------------------------------------------------------------------- */
 323 /* old - from version 0.6                                              */
 324 /* =================================================================== */
 325 /*
 326 obsolete
 327 #define strlwr(A) {char *_S=A; while(_&&*_S){*_S=tolower(*_S);_S++;}}
 328 #define strupr(A) {char *_S=A; while(_&&*_S){*_S=toupper(*_S);_S++;}}
 329 #define string(S,L) (S=(char *)malloc(L),*S=0)
 330 #define duplicate(A,B) if(A) { string(B,strlen(A)+1); strcpy(B,A); }
 331 #define concatenate(A,B,C) if (A && B) { string(C,strlen(A)+strlen(B)+1); strcpy(C,A); strcat(C,B); }
 332 #define gotoalpha(CHAR) if(CHAR)while(*CHAR && !isalpha(*CHAR))CHAR++
 333 #define goto_alpha(CHAR) if(CHAR)while(*CHAR && !isalpha(*CHAR) && *CHAR!='_')CHAR++
 334 #define gotoalnum(CHAR) if(CHAR)while(*CHAR && !isalnum(*CHAR))CHAR++
 335 #define goto_alnum(CHAR) if(CHAR)while(*CHAR && !isalnum(*CHAR) && *CHAR!='_')CHAR++
 336 #define skipalpha(CHAR) if(CHAR)while(*CHAR && isalpha(*CHAR))CHAR++
 337 #define skip_alpha(CHAR) if(CHAR)while(*CHAR && (isalpha(*CHAR) || *CHAR=='_'))CHAR++
 338 #define skipalnum(CHAR) if(CHAR)while(*CHAR && isalnum(*CHAR))CHAR++
 339 #define skip_alnum(CHAR) if(CHAR)while(*CHAR && (isalnum(*CHAR) || *CHAR=='_'))CHAR++
 340 #define skipspaces(CHAR) if(CHAR)while(*CHAR==' ')CHAR++
 341 #define cutspaces(CHAR) if(CHAR){int _L=strlen(CHAR); while(--_L>0 && CHAR[_L]==' ')CHAR[_L]=0;}
 342 #define gotochr(CHAR,C) if(CHAR)while(*CHAR && *CHAR!=C)CHAR++
 343 #define strswitch(CHAR) {char *_K=CHAR; FILE *_F=NULL; {{
 344 #define stroption(STR) if(eq(STR,_K))
 345 #define match(KEY,VAL) {char *_K=KEY, *_V=VAL; FILE *_F=NULL; {{
 346 #define assign(STR,SETVAR) stroption(STR) SETVAR=_V
 347 */
 348 /* I/O iterations, updated 2004-04-19 by xCh. */
 349
 350 //#define fparse(S,L,F) for(fgets(S,L,F);*S && !feof(F);fgets(S,L,F))
 351 //#define input(S,L) fparse(S,L,stdin)
 352 //#define fstring(S,F) { int _C=0,_L=0; fpos_t _P; fgetpos(F,&_P); while(_C!='\n' && !feof(F)){ _C=fgetc(F); _L++; } S=get_buf(L); fsetpos(F,&_P);fgets(S,_L,F);fgetc(F);}
 353 //#define parses(S,F) {FILE *_F=fopen(F,"r"); if(_F) { while(!feof(_F)) { fstring(S,_F);
 354 //obsolete
 355 //#define parse(F) {char *_; FILE *_F=fopen(F,"r"); if(_F) { while(!feof(_F)) { fstring(_,_F);
 356 //#define fail }} else {{
 357 //#define done }} if(_F)fclose(_F);}
 358 //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);}
 359 //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);}
 360 //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);}
 361
 362 /* I/O sequences, updated 2003-05-29 by xCh. */
 363
 364 #define nullreopen(F) F=freopen("/dev/null","r",F)
 365 #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]);}
 366 #define shell(CMD) stdinredir(system(CMD))
 367 #define paste(STR) stdinredir(fputs(STR,stdout))
 368
 369 /* Useful structures, updated 2003-05-29 by xCh. */
 370
 371 //#define date(S) { time_t _T; _T=time(NULL); duplicate(ctime(&_T),S); }
 372
 373 /* some general ideas, unfinished */
 374 //bind_exception, unbind_exception
 375 //#define _CRL1_THROW(ERR)
 376 //#define _CRL1_TRY _NEW_E for(bind_exception(0,NULL);;) if () {.... if(_Eatom->SYS) { if(_Eatom->RET) return; else break;} else { }
 377
 378 /* .----------------------------------------------------------------------.
 379   /  98. We have have done our homework - now let's have some fun:
 380  '----------------------------------------------------------------------- */
 381 #define _INIT_VARIABLES _EXPORT_GLOBALS _EXPORT_YES _EXPORT_STACKS _CGI_GLOBALS
 382 #define _IMPL_FUNCTIONS /*_MALLOC*/ _EXPORT_OUTS _EXPORT_ARGS _EXPORT_STRS
 383 //#define _IMPL_INTERFACE //_SQL_IFC _CAKE_IFC _STD_IFC _X_IFC
 384 #define _IMPLEMENT_CRL1_LIBRARY _INIT_VARIABLES _IMPL_FUNCTIONS //_IMPL_INTERFACE
 385 //this will be probably accomplished some other way...
 386 #ifndef DISABLE_LIBRARY_CRL1
 387 _IMPLEMENT_CRL1_LIBRARY
 388 #endif
 389 #ifdef DISABLE_LOCALES
 390 #define _SETLOCALE LANG="C"
 391 #else
 392 #define _SETLOCALE LANG=setlocale(LC_ALL, "")
 393 #endif
 394 #define _DECLARE_PROGRAM void _PROGRAM(int argc, char **argv)
 395 #define _PROGRAM _crl1_program
 396 #define program                         \
 397 _DECLARE_PROGRAM;                       \
 398 int main(int argc, char **argv)         \
 399 {                                       \
 400  _SETLOCALE;                            \
 401  try                                    \
 402  {                                      \
 403   _PROGRAM(argc,argv);                  \
 404   return 0;                             \
 405  }                                      \
 406  else_switch_failures                   \
 407  {                                      \
 408   case SYSTEM_FAILURE:                  \
 409    errno=_ERRNO;                        \
 410    perror(errstr); /* and return -1 */  \
 411   default:                              \
 412    return -1;                           \
 413  }                                      \
 414 }                                       \
 415 _DECLARE_PROGRAM
 416 #ifdef USE_PREPROCESSOR
 417 #include "_include.c"
 418 #endif
 419 /* .----------------------------------------------------------------------.
 420   /  99. C<<1 is up and running. It's your turn now to show something new.
 421  '----------------------------------------------------------------------- */
 422 #endif