| 15598816 |
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) |
| 15598816 |
85 | /* .----------------------------------------------------------------------. |
| 86 | / 4. C<<1 almost 'then buddhist' section, updated 2008-02-02 xCh. |
| 87 | '----------------------------------------------------------------------- */ |
| 88 | #define not ! |
| 89 | #define and && |
| 90 | #define or || |
| 91 | #define TRUE 1 |
| 92 | #define FALSE 0 |
| 93 | #define PI 3.141592654 |
| 94 | #define WEIRDINT (1<<(sizeof(int)*8-1)) |
| 9ca7f90d |
95 | #define btoa(EXPR) ((EXPR)?"TRUE":"FALSE") |
| 15598816 |
96 | /* .----------------------------------------------------------------------. |
| 97 | / 5. C<<1 data declaration and allocation, updated 2008-01-31 xCh. |
| 98 | '----------------------------------------------------------------------- */ |
| 99 | #define def_type(TYPE) typedef struct _##TYPE##_struct * TYPE |
| 100 | #define def_mem(TYPE) def_type(TYPE); struct _##TYPE##_struct |
| 101 | #define get_mem(TYPE) _GET_MEM(TYPE) |
| 102 | #define get_array(TYPE,N) (TYPE *)calloc(N,sizeof(TYPE)) /* temporary solution */ |
| 103 | #define get_buf(SIZE) (buf)malloc(SIZE) /* temporary solution */ |
| 104 | //#define size_of_mem(TYPE) sizeof(struct _##TYPE##_struct) |
| 105 | //#define copy_of_mem(TYPE,SRC) _crl1_mem_cpy(sizeof(struct _##TYPE##_struct),SRC) |
| 106 | #define list(TYPE) TYPE __next |
| 107 | #define tree(TYPE) TYPE __next; TYPE __seek |
| 108 | #define dict(TYPE) tree(TYPE); str __key |
| 109 | /* .----------------------------------------------------------------------. |
| 110 | / 5. C<<1 string manipulation, updated 2008-01-26 xCh. |
| 111 | '----------------------------------------------------------------------- */ |
| 112 | #define get_str(...) _crl1_get_str(__VA_ARGS__,NIL) |
| 113 | #define get_strs(...) _crl1_get_strs(__VA_ARGS__,NIL) |
| 114 | #define eq(A,B) (!_crl1_str_cmp(A,B)) |
| 115 | #define eqi(A,B) (!_crl1_str_cmpi(A,B)) |
| 116 | #define str_order(A,B) _crl1_str_coll(A,B) |
| 117 | #define str_ascii(A,B) _crl1_str_cmp(A,B) |
| 118 | #define chars_in_str(...) _crl1_strlen(__VA_ARGS__,NIL) |
| 119 | #define size_of_str(A) mbstowcs(NULL,A,0) |
| 120 | #define str_in(A,B) _crl1_str_str(A,B) |
| 121 | #define word_in(A,B) _crl1_wordinstr(A,B,0) |
| 122 | #define print(...) _crl1_print(__VA_ARGS__,NIL) |
| 123 | #define fprint(...) _crl1_fprint(__VA_ARGS__,NIL) |
| 124 | #define file_print(...) _crl1_fprint(_F,__VA_ARGS__,NIL) |
| 125 | #define echo(...) _crl1_echo(__VA_ARGS__,NIL) |
| 126 | #define fecho(...) _crl1_fecho(__VA_ARGS__,NIL) |
| 127 | #define file_echo(...) _crl1_fecho(_F,__VA_ARGS__,NIL) |
| 128 | #define suffix(A,B,C) (((A=strrchr(B,C))&&!(*(A++)=0))||(A=B)) |
| 129 | #define prefix(A,B,C) ((A=B),((B=strchr(B,C))&&!(*(B++)=0)||(B=A))) |
| 130 | #define tr(STR,B,C) _NEW(S,STR) while(S && *_S) { if(*_S==B)*_S=C; /* <-' */ _S++; } |
| 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_selected(NODE,HEAD,!NODE->__next) { NODE->__next=_PTR; break; } } else HEAD=NODE; } |
| 137 | #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); } |
| 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_num(K1,K2) (K1>K2) |
| 143 | #define order_by_num_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_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; } } |
| 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) for(int _i=0,_j=(N); _i++<_j;) |
| 155 | #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__)) |
| 156 | #define count(ONE_T,ALL_T,...) _count_##ONE_T##_##ALL_T(__VA_ARGS__) |
| 9ca7f90d |
157 | #define _init_char_str(...) str _s=(__VA_ARGS__) |
| 158 | #define _head_char_str(ONE,ALL) ONE=(ALL?*ALL:0),ALL |
| 159 | #define _test_char_str(ONE,...) ONE |
| 160 | #define _free_char_str(...) FALSE |
| 161 | #define _next_char_str(ONE,...) ONE=*(++_s) |
| 162 | #define _count_char_str(S) strlen(S) |
| 163 | #define _init_str_str(...) str _s=(__VA_ARGS__) |
| 241ad5f6 |
164 | #define _head_str_str(ONE,ALL) ONE=_utf8_copy(ONE,ALL),ALL |
| 9ca7f90d |
165 | #define _test_str_str(ONE,...) *ONE |
| 166 | #define _free_str_str(...) FALSE |
| 241ad5f6 |
167 | #define _next_str_str(ONE,...) ONE=_utf8_copy(ONE,(_s+=strlen(ONE))) |
| 027a6411 |
168 | #define _COUNT_STR_STR int _count_str_str(str S) { int l=0; str X=""; for_each(str,X,str,S){l++;} return l; } |
| 9ca7f90d |
169 | #define _init_void_array(...) int _i=(__VA_ARGS__) |
| 170 | #define _head_void_array(ONE,ALL,LEN) ONE=*ALL,0 |
| 171 | #define _test_void_array(ONE,ALL,LEN) _i < LEN |
| 172 | #define _free_void_array(...) FALSE |
| 173 | #define _next_void_array(ONE,ALL,LEN) ONE=ALL[++_i] |
| 174 | //_count_void_array not defined |
| 175 | #define _init_str_array(...) int _i=(__VA_ARGS__) |
| 176 | #define _head_str_array(ONE,ALL,LEN) ONE=(str)*ALL,0 |
| 177 | #define _test_str_array(ONE,ALL,LEN) _i < LEN |
| 178 | #define _free_str_array(...) FALSE |
| 179 | #define _next_str_array(ONE,ALL,LEN) ONE=(str)ALL[++_i] |
| 180 | //_count_str_array not defined |
| 181 | #define _init_str_file(ALL) file _f=fopen(ALL,"r") |
| 182 | #define _head_str_file(ONE,ALL) ALL |
| 183 | #define _test_str_file(ONE,...) (!feof(_f)&&(ONE=fget_str(_f))) |
| 184 | #define _free_str_file(...) fclose(_f) |
| 185 | #define _next_str_file(...) |
| 241ad5f6 |
186 | #define _COUNT_STR_FILE int _count_str_file(str F) { int l=0; str X; for_each(str,X,file,F){l++;} return l; } |
| 9ca7f90d |
187 | #define _init_str_stream(...) (__VA_ARGS__) |
| 188 | #define _head_str_stream(ONE,ALL,LEN) (ONE=(str)get_buf(LEN)) && fgets(ONE,LEN,ALL) && strrchr(ONE,'\n') && (ONE[strlen(ONE)-1]=0) |
| 189 | #define _test_str_stream(ONE,ALL,LEN) !feof(ALL) |
| 190 | #define _free_str_stream(...) FALSE |
| 191 | #define _next_str_stream(ONE,ALL,LEN) ((ONE=(str)get_buf(LEN)) && fgets(ONE,LEN,ALL) && strrchr(ONE,'\n') && (ONE[strlen(ONE)-1]=0)) |
| 192 | //_count_str_stream not defined |
| 193 | #define _EXPORT_COUNTERS _COUNT_STR_STR _COUNT_STR_FILE |
| 15598816 |
194 | /* .----------------------------------------------------------------------. |
| 195 | / 8. C<<1 object oriented infrastructure, updated 2008-02-04 |
| 196 | '----------------------------------------------------------------------- */ |
| 197 | #define def_interface(TYPE,INTERFACE) def_type(TYPE); def_mem(INTERFACE) |
| 198 | #define def_obj(TYPE) struct _##TYPE##_struct |
| 199 | #define interface(TYPE) TYPE __interface |
| 200 | #define interface_of(SELF) SELF->__interface |
| 201 | #define method(NAME) (*NAME) |
| 202 | #define construct(TYPE,INTERFACE) TYPE _init_##TYPE(TYPE o,INTERFACE i) { o->__interface=i; return o; } TYPE __init__##TYPE |
| 203 | #define get_obj(TYPE,INTERFACE,...) __init__##TYPE(_init_##TYPE(get_mem(TYPE),INTERFACE),__VA_ARGS__) |
| 204 | #define get_obj_as(COMMUNITY,MEM,INTERFACE,...) (COMMUNITY)get_obj(MEM,INTERFACE,__VA_ARGS__) |
| 205 | #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) |
| 206 | //#define __(METHOD,...) ( _ASSERT(ARG1(__VA_ARGS__,)), (*( __crl1_seekmethod(ARG1(__VA_ARGS__,),METHOD) )) ( __VA_ARGS__ ) ) |
| 207 | #define call(OBJTYPE,METHOD,...) { int _N=0; OBJTYPE _OBJ; /* <-' */ while( (_OBJ=(OBJTYPE)_crl1_for_ptrs(_N++,__VA_ARGS__,NIL))!=(OBJTYPE)NIL ) _(_OBJ,METHOD); } |
| 208 | #define def_community(TYPE,INTERFACE) def_obj(TYPE) { INTERFACE __interface; }; |
| 209 | /* ---- variable declarators -------------------------------------------- */ |
| 210 | #define Get_obj(ID,MEM,...) MEM ID=get_obj(MEM,__VA_ARGS__) |
| 211 | #define Get_obj_as(ID,COMMUNITY,MEM,...) MEM ID=get_obj_as(COMMUNITY,MEM,INTERFACE,__VA_ARGS__) |
| 212 | #define I_am(SELF,MEM) MEM SELF=(MEM)community |
| 213 | /* .----------------------------------------------------------------------. |
| 214 | / 9. C<<1 setjmp()/longjmp() based exceptions, updated 2008-09-30 |
| 215 | '----------------------------------------------------------------------- */ |
| 216 | #define FAILED_TO_FAIL -273 |
| 217 | #define SYSTEM_FAILURE -1 |
| 218 | #define LOCAL_FAILURE 13 |
| 219 | #define LIBRARY_FAILURE 23 |
| 220 | #define EVIL_FAILURE 666 |
| 221 | #define die(MSG) longjmp(_EENV,(errstr=(MSG),LOCAL_FAILURE)) |
| 222 | #define try _NEW(E,0) if(!(_E=setjmp(_EENV))) |
| 223 | #define fail(E) longjmp(_EENV,((E)>0?(E):FAILED_TO_FAIL)) |
| 224 | #define pass_failure (_Eatom->__next?longjmp((pop(_Eatom,_Estack),_EENV),_E):_SYSFAIL(FAILED_TO_FAIL)) |
| 225 | #define else_switch_failures else switch(_E) |
| 226 | #define else_catch(E) else if (_E==(E)) |
| 227 | /* .----------------------------------------------------------------------. |
| 228 | / 10. implementation of C<<1 library functions, updated 2008-01-26 xCh. |
| 229 | '----------------------------------------------------------------------- */ |
| 230 | /* later... #define _MALLOC void *_crl1_malloc(size_t size) { return malloc(size); } */ |
| 231 | #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); } |
| 232 | #define _DECLARE_PRINT void _crl1_print(const char *s,...) |
| 233 | #define _PRINT _DECLARE_PRINT _CRL1_FPRINT(stdout) |
| 234 | #define _DECLARE_FPRINT void _crl1_fprint(FILE *f,const char *s,...) |
| 235 | #define _FPRINT _DECLARE_FPRINT _CRL1_FPRINT(f) |
| 236 | #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); } |
| 237 | #define _ECHO void _crl1_echo(char *s,...) _CRL1_FECHO(stdout) |
| 238 | #define _FECHO void _crl1_fecho(FILE *f,char *s,...) _CRL1_FECHO(f) |
| 239 | #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; } |
| 240 | #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; } |
| 241 | #define _DECLARE_STRCOLL int _crl1_str_coll(str a, str b) |
| 242 | #define _STRCOLL _DECLARE_STRCOLL { if(a && b) return strcoll(a,b); else return (int)(a-b); } |
| 243 | #define _DECLARE_STRCMP int _crl1_str_cmp(str a, str b) |
| 244 | #define _STRCMP _DECLARE_STRCMP { if(a && b) return strcmp(a,b); else return (int)(a-b); } |
| 245 | #define _DECLARE_STRCMPI int _crl1_str_cmpi(str a, str b) |
| 246 | #define _STRCMPI _DECLARE_STRCMPI { if(a && b) return strcasecmp(a,b); else return (int)(a-b); } |
| 247 | #define _DECLARE_STRSTR str _crl1_str_str(str h, str n) |
| 248 | #define _STRSTR _DECLARE_STRSTR { if(h && n) return strstr(h,n); else return NULL; } |
| 241ad5f6 |
249 | #define _EXPORT_UTF8 str _utf8_copy(str dst, str src) { unsigned char I=*src; if(I > 0 && I < 192 && I != 168 && I != 184) { dst=(str)get_buf(2); dst[0]=src[0]; dst[1]=0; } else if(I >= 224) { dst=(str)get_buf(4);dst[0]=src[0]; dst[1]=src[1]; dst[2]=src[2]; dst[3]=0; } else if(I) { dst=(str)get_buf(3); dst[0]=src[0]; dst[1]=src[1]; dst[2]=0; } else { dst=src; } return dst; } |
| 250 | |
| 15598816 |
251 | // 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; } |
| 252 | extern _DECLARE_PRINT; |
| 253 | extern _DECLARE_FPRINT; |
| 254 | extern _DECLARE_STRCOLL; |
| 255 | extern _DECLARE_STRCMP; |
| 256 | extern _DECLARE_STRCMPI; |
| 257 | extern _DECLARE_STRSTR; |
| 258 | #define _EXPORT_OUTS _PRINT _FPRINT _ECHO _FECHO |
| 259 | #define _EXPORT_STRS _STRCOLL _STRCMP _STRCMPI _STRSTR //_WORDINSTR |
| 260 | #define _EXPORT_ARGS _FOR_INTS _FOR_PTRS |
| 261 | /* .----------------------------------------------------------------------. |
| 262 | / 10. C<<1 private infrastructure, updated 2008-02-03 by xCh. |
| 263 | '----------------------------------------------------------------------- */ |
| 264 | #define _I (_Iatom->I) |
| 265 | #define _J (_Iatom->J) |
| 266 | #define _S (_Satom->S) |
| 267 | #define _F (_Fatom->F) |
| 268 | #define _CTX (_CTXatom->CTX) |
| 269 | #define _E (_Eatom->E) |
| 270 | #define _EENV (_Eatom->ENV) |
| 271 | #define _ERRNO (_Eatom->ERRNO) |
| 272 | #define _ARG1(ARG1,...) ARG1 |
| 273 | //#define _ASSERT(EXPR) (expr?expr:fail(CONSISTENCY_FAILURE)) |
| 274 | #define _SYSFAIL(E) longjmp(_EENV,(_ERRNO=errno,(E))) |
| 275 | #define _GET_MEM(TYPE) ((TYPE)malloc(sizeof(struct _##TYPE##_struct))) /* later... ((TYPE)_crl1_malloc(sizeof(struct _##TYPE##_struct))) */ |
| 276 | #define _ANYATOM(NAME,DECL) def_mem(_##NAME##Atom ) { DECL; int c; list( _##NAME##Atom ); } |
| 277 | //#define _FOR_COLUMNS(A,B,C) _NEW(I,0) for( prefix(A,B,C) ; A ; ((A!=B)&&prefix(A,B,C)||(A=NULL) ),_I++ ) |
| 278 | //#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) |
| 279 | #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--) |
| 280 | #define _ANYSTACK(NAME) extern _##NAME##Atom _##NAME##atom, _##NAME##stack; _##NAME##Atom _##NAME##atom,_##NAME##stack=NULL; |
| 281 | #define _EXPORT_STACKS _ANYSTACK(I) _ANYSTACK(S) _ANYSTACK(F) _ANYSTACK(CTX) _ANYSTACK(E) |
| 282 | _ANYATOM(I, int I;int J); |
| 283 | _ANYATOM(S, str S); |
| 284 | _ANYATOM(F, file F); |
| 285 | _ANYATOM(CTX, void *CTX); |
| 286 | _ANYATOM(E, int E;jmp_buf ENV;int ERRNO); |
| 287 | /* .----------------------------------------------------------------------. |
| 288 | / 11. C<<1 memory contexts - alternative to garbage collection |
| 289 | '----------------------------------------------------------------------- */ |
| 290 | typedef _CTXAtom * context; |
| 291 | #define create_context(ID) create_mem(ID,context) |
| 292 | /* .----------------------------------------------------------------------. |
| 293 | / 12. C<<1 CGI and FASTCGI handling, updated 2008-01-16 by xCh. |
| 294 | '----------------------------------------------------------------------- */ |
| 295 | #ifdef USE_LIBRARY_FASTCGI |
| 296 | #define while_fastcgi_accept while(FCGI_Accept()>=0) |
| 297 | #define USE_MODULE_CGI |
| 298 | #endif |
| 299 | #ifdef USE_MODULE_CGI |
| 300 | #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); } |
| 301 | #define _GETCGI char *getcgi(VAR) { } |
| 302 | #define _CGI_GLOBALS def_context(_CGI); struct _CGIVariable { char *V; dict(_CGIVariable); } *_CGIvariable,*_CGIdict; |
| 303 | #else |
| 304 | #define _GETCGI |
| 305 | #define _CGI_GLOBALS |
| 306 | #endif |
| 307 | /* .----------------------------------------------------------------------. |
| 308 | / 13. MySQL wrappers + SQL object interface, updated 2007-12-19 by xCh. |
| 309 | '----------------------------------------------------------------------- */ |
| 310 | #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) |
| 311 | #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); ) |
| 312 | /* .----------------------------------------------------------------------. |
| 313 | / 14. Obj community with Object interface , updated 2009-01-05 by xCh. |
| 314 | '----------------------------------------------------------------------- */ |
| 315 | #ifdef USE_MODULE_OBJECTS |
| 316 | def_interface(Obj,Object) |
| 317 | { |
| 318 | void method(out) (Obj self); |
| 319 | void method(len) (Obj self); |
| 320 | void method(head) (Obj self); |
| 321 | void method(next) (Obj self); |
| 322 | }; |
| 323 | |
| 324 | def_community(Obj,Object); |
| 325 | |
| 326 | def_mem(Int) |
| 327 | { |
| 328 | interface(Object); |
| 329 | long _value; |
| 330 | }; |
| 331 | |
| 332 | def_mem(Str) |
| 333 | { |
| 334 | interface(Object); |
| 335 | str _value; |
| 336 | }; |
| 337 | |
| 338 | def_mem(Array) |
| 339 | { |
| 340 | interface(Object); |
| 341 | Obj * _value; |
| 342 | }; |
| 343 | |
| 344 | def_mem(List) |
| 345 | { |
| 346 | interface(Object); |
| 347 | Obj _value; |
| 348 | }; |
| 349 | |
| 350 | #endif |
| 351 | /* ------------------------------------------------------------------- */ |
| 352 | /* old - from version 0.6 */ |
| 353 | /* =================================================================== */ |
| 354 | /* |
| 355 | obsolete |
| 356 | #define strlwr(A) {char *_S=A; while(_&&*_S){*_S=tolower(*_S);_S++;}} |
| 357 | #define strupr(A) {char *_S=A; while(_&&*_S){*_S=toupper(*_S);_S++;}} |
| 358 | #define string(S,L) (S=(char *)malloc(L),*S=0) |
| 359 | #define duplicate(A,B) if(A) { string(B,strlen(A)+1); strcpy(B,A); } |
| 360 | #define concatenate(A,B,C) if (A && B) { string(C,strlen(A)+strlen(B)+1); strcpy(C,A); strcat(C,B); } |
| 361 | #define gotoalpha(CHAR) if(CHAR)while(*CHAR && !isalpha(*CHAR))CHAR++ |
| 362 | #define goto_alpha(CHAR) if(CHAR)while(*CHAR && !isalpha(*CHAR) && *CHAR!='_')CHAR++ |
| 363 | #define gotoalnum(CHAR) if(CHAR)while(*CHAR && !isalnum(*CHAR))CHAR++ |
| 364 | #define goto_alnum(CHAR) if(CHAR)while(*CHAR && !isalnum(*CHAR) && *CHAR!='_')CHAR++ |
| 365 | #define skipalpha(CHAR) if(CHAR)while(*CHAR && isalpha(*CHAR))CHAR++ |
| 366 | #define skip_alpha(CHAR) if(CHAR)while(*CHAR && (isalpha(*CHAR) || *CHAR=='_'))CHAR++ |
| 367 | #define skipalnum(CHAR) if(CHAR)while(*CHAR && isalnum(*CHAR))CHAR++ |
| 368 | #define skip_alnum(CHAR) if(CHAR)while(*CHAR && (isalnum(*CHAR) || *CHAR=='_'))CHAR++ |
| 369 | #define skipspaces(CHAR) if(CHAR)while(*CHAR==' ')CHAR++ |
| 370 | #define cutspaces(CHAR) if(CHAR){int _L=strlen(CHAR); while(--_L>0 && CHAR[_L]==' ')CHAR[_L]=0;} |
| 371 | #define gotochr(CHAR,C) if(CHAR)while(*CHAR && *CHAR!=C)CHAR++ |
| 372 | #define strswitch(CHAR) {char *_K=CHAR; FILE *_F=NULL; {{ |
| 373 | #define stroption(STR) if(eq(STR,_K)) |
| 374 | #define match(KEY,VAL) {char *_K=KEY, *_V=VAL; FILE *_F=NULL; {{ |
| 375 | #define assign(STR,SETVAR) stroption(STR) SETVAR=_V |
| 376 | */ |
| 377 | /* I/O iterations, updated 2004-04-19 by xCh. */ |
| 378 | |
| 379 | //#define fparse(S,L,F) for(fgets(S,L,F);*S && !feof(F);fgets(S,L,F)) |
| 380 | //#define input(S,L) fparse(S,L,stdin) |
| 381 | //#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);} |
| 382 | //#define parses(S,F) {FILE *_F=fopen(F,"r"); if(_F) { while(!feof(_F)) { fstring(S,_F); |
| 383 | //obsolete |
| 384 | //#define parse(F) {char *_; FILE *_F=fopen(F,"r"); if(_F) { while(!feof(_F)) { fstring(_,_F); |
| 385 | //#define fail }} else {{ |
| 386 | //#define done }} if(_F)fclose(_F);} |
| 387 | //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);} |
| 388 | //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);} |
| 389 | //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);} |
| 390 | |
| 391 | /* I/O sequences, updated 2003-05-29 by xCh. */ |
| 392 | |
| 393 | #define nullreopen(F) F=freopen("/dev/null","r",F) |
| 394 | #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]);} |
| 395 | #define shell(CMD) stdinredir(system(CMD)) |
| 396 | #define paste(STR) stdinredir(fputs(STR,stdout)) |
| 397 | |
| 398 | /* Useful structures, updated 2003-05-29 by xCh. */ |
| 399 | |
| 400 | //#define date(S) { time_t _T; _T=time(NULL); duplicate(ctime(&_T),S); } |
| 401 | |
| 402 | /* some general ideas, unfinished */ |
| 403 | //bind_exception, unbind_exception |
| 404 | //#define _CRL1_THROW(ERR) |
| 405 | //#define _CRL1_TRY _NEW_E for(bind_exception(0,NULL);;) if () {.... if(_Eatom->SYS) { if(_Eatom->RET) return; else break;} else { } |
| 406 | |
| 407 | /* .----------------------------------------------------------------------. |
| 408 | / 98. We have have done our homework - now let's have some fun: |
| 409 | '----------------------------------------------------------------------- */ |
| 410 | #define _INIT_VARIABLES _EXPORT_GLOBALS _EXPORT_YES _EXPORT_STACKS _CGI_GLOBALS |
| 241ad5f6 |
411 | #define _IMPLEMENT_FUNCTIONS /*_MALLOC*/ _EXPORT_OUTS _EXPORT_ARGS _EXPORT_STRS _EXPORT_COUNTERS _EXPORT_UTF8 |
| 15598816 |
412 | //#define _IMPL_INTERFACE //_SQL_IFC _CAKE_IFC _STD_IFC _X_IFC |
| 9ca7f90d |
413 | #define _IMPLEMENT_CRL1_LIBRARY _INIT_VARIABLES _IMPLEMENT_FUNCTIONS //_IMPL_INTERFACE |
| 15598816 |
414 | //this will be probably accomplished some other way... |
| 415 | #ifndef DISABLE_LIBRARY_CRL1 |
| 416 | _IMPLEMENT_CRL1_LIBRARY |
| 417 | #endif |
| 418 | #ifdef DISABLE_LOCALES |
| 419 | #define _SETLOCALE LANG="C" |
| 420 | #else |
| 421 | #define _SETLOCALE LANG=setlocale(LC_ALL, "") |
| 422 | #endif |
| 423 | #define _DECLARE_PROGRAM void _PROGRAM(int argc, char **argv) |
| 424 | #define _PROGRAM _crl1_program |
| 425 | #define program \ |
| 426 | _DECLARE_PROGRAM; \ |
| 427 | int main(int argc, char **argv) \ |
| 428 | { \ |
| 429 | _SETLOCALE; \ |
| 430 | try \ |
| 431 | { \ |
| 432 | _PROGRAM(argc,argv); \ |
| 433 | return 0; \ |
| 434 | } \ |
| 435 | else_switch_failures \ |
| 436 | { \ |
| 437 | case SYSTEM_FAILURE: \ |
| 438 | errno=_ERRNO; \ |
| 439 | perror(errstr); /* and return -1 */ \ |
| 440 | default: \ |
| 441 | return -1; \ |
| 442 | } \ |
| 443 | } \ |
| 444 | _DECLARE_PROGRAM |
| 445 | #ifdef USE_PREPROCESSOR |
| 446 | #include "_include.c" |
| 447 | #endif |
| 448 | /* .----------------------------------------------------------------------. |
| 449 | / 99. C<<1 is up and running. It's your turn now to show something new. |
| 450 | '----------------------------------------------------------------------- */ |
| 451 | #endif |
GIT.Harvie.CZ / svn / Cll1h / .git / blame