GIT.Harvie.CZ / svn / Cll1h / .git / blame
? search:
summary | shortlog | log | commit | commitdiff | tree
blob | blame (incremental) | history | HEAD
lot of work - def_mem(), uses locale.h + strcoll(), etc.
[svn/Cll1h/.git] / cll1.h
CommitLineData
005431b8 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/
f5725936 4'---------------------------------------------------------------------- */
5/*
6 Copyright (c) 2004-2008 Michael xChaos Polak - x(at)n.cz
30628092 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
ceb7f88d 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
097bac9a 21*/
097bac9a 22#ifndef _CLL1_H
23#define _CLL1_H
f5725936 24#define CLL1H_VERSION "0.7.1"
005431b8 25/* .----------------------------------------------------------------------.
f5725936 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*/
005431b8 34/* .----------------------------------------------------------------------.
f5725936 35 / 1. C<<1 header auto include, updated 2008-01-26 xCh.
36 '---------------------------------------------------------------------- */
bce4b05d 37#ifndef DISABLE_LIBRARY_LIBC
30628092 38#include <string.h>
25a3f430 39#include <strings.h>
04a13a6f 40#include <malloc.h>
30628092 41#include <time.h>
04a13a6f 42#include <stdlib.h>
420bb771 43#include <stdarg.h>
04a13a6f 44#include <unistd.h>
4643aeaf 45#include <locale.h>
04a13a6f 46#ifdef USE_LIBRARY_FASTCGI
47#include <fcgi_stdio.h>
48#else
49#include <stdio.h>
50#endif
bce4b05d 51#endif
52#ifdef USE_LIBRARY_MYSQL
53#include <mysql/mysql.h>
54#endif
005431b8 55/* .----------------------------------------------------------------------.
4643aeaf 56 / 0. C<<1 typedefs and public gloabl variables, updated 2008-02-03 xCh.
57 '----------------------------------------------------------------------- */
58typedef char * str;
59/* Note: we may later #ifdef USE_MODULE_UNICODE .. typedef wchar_t * str; */
60typedef char * buffer;
61/* Note: this could be buf instead of buffer, like str instead of string. */
62typedef FILE * file;
63typedef int bool;
64extern str NIL,EOL,OFS,IFS;
65extern unsigned RANDOM_SEED;
66#define _EXPORT_GLOBALS str NIL="NULL", EOL="\n", OFS=" ", IFS=" \t\n"; unsigned RANDOM_SEED=0;
67/* .----------------------------------------------------------------------.
68 / 1. C<<1 then buddhist section, updated 2008-02-03 xCh.
f5725936 69 '----------------------------------------------------------------------- */
70#ifndef DISABLE_MODULE_THEN_BUDDHISM
04a13a6f 71#define then
25a3f430 72#define MAYBE (int)((long)(RANDOM_SEED?random():((RANDOM_SEED=(unsigned)time(NULL)),srandom(RANDOM_SEED),random()))%2)
73#define WHOKNOWS (int)(srandom((unsigned)time(NULL)),random()%2)
4643aeaf 74#define samsara(MIND,SOUL) for(MIND=SOUL; MIND || ((MIND->__next=SOUL),0) ; MIND=MIND->__next)
25a3f430 75//#define atob(EXPR) (word_in_stri(YES,(EXPR))?1:0)
4643aeaf 76//#define _EXPORT_YES str YES="TRUE\nYES\nJA\nOUI\nDA\nANO\nY\n1";
25a3f430 77//#else
25a3f430 78#define atob(EXPR) (eqi((EXPR),YES)?1:0)
4643aeaf 79#define _EXPORT_YES str YES="TRUE";
f5725936 80#endif
005431b8 81/* .----------------------------------------------------------------------.
61ad8a2b 82 / 2. C<<1 almost then buddhist section, updated 2008-02-02 xCh.
f5725936 83 '----------------------------------------------------------------------- */
30628092 84#define not !
4a48705a 85#define and &&
86#define or ||
30628092 87#define TRUE 1
88#define FALSE 0
9ae3b221 89#define WEIRDINT (1<<(sizeof(int)*8-1))
25a3f430 90#define btoa(EXPR) ((EXPR)?"TRUE":"FALSE")
91#define coalesce(VAR,EXPR) (VAR?VAR:(EXPR))
005431b8 92/* .----------------------------------------------------------------------.
547332b7 93 / 4. C<<1 data declaration and allocation, updated 2008-01-31 xCh.
f5725936 94 '----------------------------------------------------------------------- */
4643aeaf 95#define def_mem(TYPE) typedef struct _##TYPE##_t * TYPE; struct _##TYPE##_t
96#define get_mem(...) _GET_MEM(__VA_ARGS__,NULL)
97#define create_mem(ID,...) _ARG1(__VA_ARGS__,) ID=_GET_MEM(__VA_ARGS__,NULL)
98#define new_mem(ID,...) _ARG1(__VA_ARGS__,) ID=init_mem(__VA_ARGS__)
99#define init_mem(...) _ARG1(__VA_ARGS__,)_construct( _ARG2(__VA_ARGS__,,) - 0 )
100#define construct_mem(TYPE) TYPE TYPE##_init(void) { create_mem(this,TYPE); /* <-' */ _##TYPE##_init(this); return this; } _##TYPE##_init(TYPE this)
101#define list(TYPE) TYPE __next
102#define tree(TYPE) TYPE __next; TYPE __seek
103#define dictionary(TYPE) TYPE __next; TYPE __seek; str __key
104#define array(TYPE) struct TYPE __next; TYPE __seek; int __key
f5725936 105#define interface(TYPE) struct TYPE *__interface
4643aeaf 106#define this_must_be(TYPE) TYPE this
005431b8 107/* .----------------------------------------------------------------------.
f5725936 108 / 5. C<<1 string manipulation, updated 2008-01-26 xCh.
109 '----------------------------------------------------------------------- */
61ad8a2b 110#define get_str(...) _cll1_get_str(__VA_ARGS__,NIL)
4643aeaf 111#define len(...) __cll1__strlen(__VA_ARGS__,NIL)
112#define eq(A,B) (A && ((B && !strcmp(A,B)) || !B))
113#define eqi(A,B) (A && ((B && !strcasecmp(A,B)) || !B))
114#define in_str(A,B) _cll1_str_str(A,B)
25a3f430 115#define word_in_str(A,B) _cll1_wordinstr(A,B,0)
bce4b05d 116#define print(...) _cll1_print(__VA_ARGS__,NIL)
117#define fprint(...) _cll1_fprint(__VA_ARGS__,NIL)
118#define file_print(...) _cll1_fprint(_F,__VA_ARGS__,NIL)
119#define echo(...) _cll1_echo(__VA_ARGS__,NIL)
120#define fecho(...) _cll1_fecho(__VA_ARGS__,NIL)
121#define file_echo(...) _cll1_fecho(_F,__VA_ARGS__,NIL)
005431b8 122#define suffix(A,B,C) (((A=strrchr(B,C))&&!(*(A++)=0))||(A=B))
123#define prefix(A,B,C) ((A=B),((B=strchr(B,C))&&!(*(B++)=0)||(B=A)))
547332b7 124#define tr(STR,B,C) _NEW(S,STR) while(S && *_S) { if(*_S==B)*_S=C; /* <-' */ _S++; }
005431b8 125/* .----------------------------------------------------------------------.
f5725936 126 / 6. C<<1 data container manipulation, updated 2008-01-26 xCh.
127 '----------------------------------------------------------------------- */
005431b8 128#define push(NODE,HEAD) ( NODE ? ((NODE->__next=HEAD),(HEAD=NODE)) : NULL )
129#define pop(NODE,HEAD) ( HEAD ? ((NODE=HEAD->__next),free(HEAD),(HEAD=NODE)) : (NODE=NULL) )
06ab91f0 130#define append(NODE,HEAD) { void *N=NODE; /* <-' */ NODE->__next=NULL; for_search(NODE,HEAD,!NODE->__next) { NODE->__next=N; break; } }
131#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); }
f5725936 132#define drop(NODE,HEAD) for( NODE=HEAD; NODE || (HEAD=NULL); HEAD=NODE, NODE=NODE->__next, free(HEAD) )
005431b8 133//to do: seek
134//to do: store
4643aeaf 135#define count(NODE,HEAD,VAR) { _NEW(I,0) for(NODE=HEAD; NODE || ((VAR=_I),0) ; (NODE=NODE->__next)?(_I++):0 ); }
f5725936 136#define order_by(K1,K2) (K1>K2)
137#define desc_order_by(K1,K2) (K1<K2)
4643aeaf 138#define sort_by(K1,K2) (_cll1_str_cmp(K1,K2)>0)
139#define desc_sort_by(K1,K2) (_cll1_str_cmp(K1,K2)<0)
140#define ascii_by(K1,K2) (strcmp(K1,K2)>0)
141#define desc_ascii_by(K1,K2) (strcmp(K1,K2)<0)
06ab91f0 142#define insert(NODE,HEAD,EXP,K) { if(HEAD) { void **_L=NULL, *H=HEAD; /* <-' */ for_search(HEAD,H,EXP(HEAD->K,NODE->K)) { if(_L) {*_L=NODE; NODE->__next=HEAD; } else push(NODE,H); break; } else _L=(void *)&(HEAD->__next); if(!HEAD)*_L=NODE; HEAD=H; } else if (NODE) { push(NODE,HEAD); HEAD->__next=NULL; } }
143#define sort(NODE,HEAD,EXP,K) { void *_NEXT; /* <-' */ NODE=HEAD; HEAD=NULL; do { _NEXT=NODE->__next; NODE->__next=NULL; insert(NODE,HEAD,EXP,K); NODE=_NEXT; } while(_NEXT); }
005431b8 144/* .----------------------------------------------------------------------.
f5725936 145 / 7. C<<1 builtin iterators and conditionals, updated 2008-01-26 xCh.
146 '----------------------------------------------------------------------- */
04a13a6f 147#define loop while(TRUE)
bce4b05d 148#define repeat(N) if(N>0) _NEW(I,0) while(_I++<N)
086367cd 149#define for_range(VAR,FROM,TO) for( VAR=FROM ; FROM<=TO?VAR<=TO:VAR>=TO ; FROM<=TO?VAR++:VAR--)
f5725936 150#define for_each(NODE,HEAD) for(NODE=HEAD; NODE; NODE=NODE->__next)
151#define for_search(NODE,HEAD,EXPR) for_each(NODE,HEAD) if(EXPR)
bce4b05d 152#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 */
153#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 */
9ae3b221 154#define for_ints(VAR,...) _NEW(I,0) while( (VAR=_cll1_for_ints(_I++,__VA_ARGS__,WEIRDINT))!=WEIRDINT )
25a3f430 155#define for_strs(VAR,...) _NEW(I,0) while( (VAR=(char *)_cll1_for_ptrs(_I++,__VA_ARGS__,NIL))!=NIL )
bce4b05d 156#define for_args _NEW(I,1) while(_I++<argc)
8a93c4ed 157#define this_arg argv[_I]
420bb771 158#define next_arg ((_I+1<argc)?argv[_I]:NULL)
f5725936 159#define skip_next _I++
61ad8a2b 160#define if_exists(NODE,HEAD,EXPR) for_search(NODE,HEAD,EXPR) break; if(NODE)
bce4b05d 161#define if_args if(argc>1)
162#define switch_for_args for_args switch_str(this_arg)
163#define switch_str(STR) _NEW(S,STR)
164#define if_case(VAL) if(eq(argv[_I],VAL))
25a3f430 165#define for_fields(FIELD,STR) for_valid_split(FIELD,STR,*OFS)
bce4b05d 166#define for_split_str(A,B,C) for(prefix(A,B,C);A;(A!=B)&&prefix(A,B,C)||(A=NULL))
167#define for_valid_split(A,B,C) for_split_str(A,B,C) if(*A)
168#define switch_for_columns(A,B,C) _FOR_COLUMNS(A,B,C) switch(__I)
169#define switch_for_valid_columns(A,B,C) _FOR_VALID_COLUMNS(A,B,C) switch (_I)
170#define if_column_number(A,B,C,V) _FOR_COLUMNS(A,B,C) if(_I==V)
171#define if_valid_column_number(A,B,C,V) _FOR_VALID_COLUMNS(A,B,C) if(_I==V)
005431b8 172/* .----------------------------------------------------------------------.
547332b7 173 / 8. C<<1 object oriented infrastructure, updated 2008-01-31
8db501a0 174 '----------------------------------------------------------------------- */
4643aeaf 175#define I_must_be(TYPE) TYPE self, void *_method
176#define we_can_be(TYPE) TYPE _we, void *_method
177#define we_can_be_whatever void *_we, void *_method
178#define I_am(TYPE) TYPE self=(TYPE)_we
179#define def_community(METATYPE,ITYPE) def_mem(METATYPE) { ITYPE __interface; };
180#define construct_interface(MTYPE,ITYPE) ITYPE _init_##MTYPE##ITYPE(void *dummy, ...) { new_mem(_FACE,ITYPE); va_list(ap); _##MTYPE##ITYPE##_init(_FACE); return _FACE; } void _##MTYPE##ITYPE##_init(struct IFACE *_FACE)
8db501a0 181#define bind_method(METHOD,FUNCTION) _FACE->METHOD=FUNCTION
4643aeaf 182#define new_interface(ID,MTYPE,...) _ARG1(__VA_ARGS__,) ID=_init_##MTYPE##_ARG1(__VA_ARGS__,) ((void *)init_##MTYPE##__VA_ARGS__,)
547332b7 183#define init_interface(TYPE,...)
4643aeaf 184#define construct_object(TYPE,...) (struct _ARG2(__VA_ARGS__,TYPE,) *)_init_##TYPE##_()
185#define init_object(TYPE,...) (TYPE)_init_##TYPE##_(__VA_ARGS__)
186#define init_polymorph(TYPE,...) _init_##TYPE##_(__VA_ARGS__)
547332b7 187#define _(OBJECT,...) ( _ASSERT(OBJECT), (*( OBJECT->interface->_ARG1(__VA_ARGS__,) )) ( OBJECT,OBJECT->interface->__VA_ARGS__ ) )
188#define __(OBJECT,...) ( _ASSERT(OBJECT), (*( __cll1_seekmethod(OBJECT->interface,_ARG1(__VA_ARGS__,)) )) ( OBJECT,OBJECT->interface->__VA_ARGS__ ) )
bce4b05d 189#define call(OBJTYPE,METHOD,...) { int _N=0; struct OBJTYPE *_OBJ; /* <-' */ while( (_OBJ=(struct OBJTYPE *)_cll1_for_ptrs(_N++,__VA_ARGS__,NIL))!=(struct OBJTYPE *)NIL ) _(_OBJ,METHOD); }
8db501a0 190/* .----------------------------------------------------------------------.
191 / 9. implementation of C<<1 library functions, updated 2008-01-26 xCh.
f5725936 192 '----------------------------------------------------------------------- */
f5725936 193#define _MALLOC void *_cll1_malloc(size_t size,...) { /*temporary solution*/ return malloc(size); }
bce4b05d 194#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); }
4643aeaf 195#define _DECLARE_PRINT void _cll1_print(char *s,...)
196#define _PRINT _DECLARE_PRINT _CLL1_FPRINT(stdout)
197#define _DECLARE_FPRINT void _cll1_fprint(FILE *f,char *s,...)
198#define _FPRINT _DECLARE_FPRINT _CLL1_FPRINT(f)
bce4b05d 199#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); }
200#define _ECHO void _cll1_echo(char *s,...) _CLL1_FECHO(stdout)
201#define _FECHO void _cll1_fecho(FILE *f,char *s,...) _CLL1_FECHO(f)
9ae3b221 202#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; }
bce4b05d 203#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; }
4643aeaf 204#define _STRCMP int _cll1_str_cmp(char *a,char *b) { if(a && b) return strcoll(a,b); else return (int)(a-b); }
205//#define _STRCMPI int _cll1_str_cmpi(char *a,char *b) { if(a && b) return strcasecmp(a,b); else return (int)(a-b); }
206#define _STRSTR char *_cll1_str_str(char *h,char *n) { if(h && n) return strstr(h,n); else return NULL; }
25a3f430 207//#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; }
4643aeaf 208extern _DECLARE_PRINT;
209extern _DECLARE_FPRINT;
210#define _EXPORT_OUTS _PRINT _FPRINT _ECHO _FECHO
211#define _EXPORT_STRS _STRCMP /*_STRCMPI*/ _STRSTR //_WORDINSTR
212#define _EXPORT_ARGS _FOR_INTS _FOR_PTRS
005431b8 213/* .----------------------------------------------------------------------.
4643aeaf 214 / 10. C<<1 private infrastructure, updated 2008-02-03 by xCh.
f5725936 215 '----------------------------------------------------------------------- */
bce4b05d 216#define _I (_Iatom->I)
217#define _S (_Satom->S)
4643aeaf 218#define _F (_Fatom->F)
bce4b05d 219#define _CTX (_CTXatom->CTX)
4643aeaf 220#define _ARG1(ARG1,...) ARG1
221#define _ARG2(ARG1,ARG2,...) ARG2
222#define _GET_MEM(TYPE,CTX) ((TYPE)_cll1_malloc(sizeof(struct _##TYPE##_t),CTX))
223#define _ANYATOM(TYPE,NAME) def_mem(_##NAME##Atom ) { TYPE NAME; int c; list( _##NAME##Atom ); }
bce4b05d 224#define _FOR_COLUMNS(A,B,C) _NEW(I,0) for( prefix(A,B,C) ; A ; ((A!=B)&&prefix(A,B,C)||(A=NULL) ),_I++ )
225#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)
4643aeaf 226#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--)
227#define _ANYSTACK(NAME) _##NAME##Atom _##NAME##atom,_##NAME##stack=NULL;
228#define _EXPORT_STACKS _ANYSTACK(I) _ANYSTACK(S) _ANYSTACK(F) _ANYSTACK(CTX)
229_ANYATOM(int,I);
230_ANYATOM(str,S);
231_ANYATOM(FILE *,F);
232_ANYATOM(void *,CTX);
233/* .----------------------------------------------------------------------.
234 / 11. C<<1 memory contexts - alternative to garbage collection
235 '----------------------------------------------------------------------- */
236typedef _CTXAtom * context;
237#define create_context(ID) create_mem(ID,context)
005431b8 238/* .----------------------------------------------------------------------.
4643aeaf 239 / 12. C<<1 CGI and FASTCGI handling, updated 2008-01-16 by xCh.
f5725936 240 '----------------------------------------------------------------------- */
04a13a6f 241#ifdef USE_LIBRARY_FASTCGI
242#define while_fastcgi_accept while(FCGI_Accept()>=0)
7f13bdad 243#define USE_MODULE_CGI
244#endif
245#ifdef USE_MODULE_CGI
bce4b05d 246#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); }
547332b7 247#define _GETCGI char *getcgi(VAR) { }
25a3f430 248#define _CGI_GLOBALS def_context(_CGI); struct _CGIVariable { char *V; dictionary(_CGIVariable); } *_CGIvariable,*_CGIdict;
8db501a0 249#else
547332b7 250#define _GETCGI
bce4b05d 251#define _CGI_GLOBALS
04a13a6f 252#endif
005431b8 253/* .----------------------------------------------------------------------.
4643aeaf 254 / 13. MySQL wrappers + SQL object interface, updated 2007-12-19 by xCh.
f5725936 255 '----------------------------------------------------------------------- */
7f13bdad 256#ifdef USE_LIBRARY_MYSQL
25a3f430 257#define def_sql(CONN) MYSQL *CONN
bce4b05d 258#define create_sql(CONN) MYSQL *ID=mysql_init(NULL)
259#define sql_connect(CONN,S,U,P,D) mysql_real_connect(CONN,S,U,P,D,0,NULL,0)
260//todo sql_query
261//todo sql_queryf
262//todo for_sql_query_results(ROW,CONN,QUERY)
263//todo for_sql_queryf_results
264#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)
265#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) )
266//todo db_query
267//todo for_db_results
268//todo for_db_queryf_results(ROW,...)
269//todo db_queryf
270#define _MYSQLC (_MYSQLCatom->MYSQLC)
271#define _MYSQLR (_MYSQLRatom->MYSQLR)
272#define _SQL_GLOBALS _ANYSTACK(MYSQL,MYSQLC) _ANYSTACK(MYSQL_RES,MYSQLR)
7f13bdad 273#else
bce4b05d 274#define _SQL_GLOBALS
7f13bdad 275#endif
bce4b05d 276//#ifdef USE_INTERFACE_SQL
277//todo #define _SQL_OBJECT mem Sql { interface(SqlInterface); char *hostname; char *username; char *password; char *database; }
25a3f430 278//todo #define _SQL_CONSTRUCT def_construct(Sql) { self->hostname="localhost"; }
bce4b05d 279//#endif
4643aeaf 280
04a13a6f 281/* ------------------------------------------------------------------- */
7f13bdad 282/* old - from version 0.6 */
f5725936 283/* =================================================================== */
7f13bdad 284/*
285obsolete
30628092 286#define strlwr(A) {char *_S=A; while(_&&*_S){*_S=tolower(*_S);_S++;}}
287#define strupr(A) {char *_S=A; while(_&&*_S){*_S=toupper(*_S);_S++;}}
288#define string(S,L) (S=(char *)malloc(L),*S=0)
289#define duplicate(A,B) if(A) { string(B,strlen(A)+1); strcpy(B,A); }
290#define concatenate(A,B,C) if (A && B) { string(C,strlen(A)+strlen(B)+1); strcpy(C,A); strcat(C,B); }
30628092 291#define gotoalpha(CHAR) if(CHAR)while(*CHAR && !isalpha(*CHAR))CHAR++
292#define goto_alpha(CHAR) if(CHAR)while(*CHAR && !isalpha(*CHAR) && *CHAR!='_')CHAR++
293#define gotoalnum(CHAR) if(CHAR)while(*CHAR && !isalnum(*CHAR))CHAR++
294#define goto_alnum(CHAR) if(CHAR)while(*CHAR && !isalnum(*CHAR) && *CHAR!='_')CHAR++
295#define skipalpha(CHAR) if(CHAR)while(*CHAR && isalpha(*CHAR))CHAR++
296#define skip_alpha(CHAR) if(CHAR)while(*CHAR && (isalpha(*CHAR) || *CHAR=='_'))CHAR++
297#define skipalnum(CHAR) if(CHAR)while(*CHAR && isalnum(*CHAR))CHAR++
298#define skip_alnum(CHAR) if(CHAR)while(*CHAR && (isalnum(*CHAR) || *CHAR=='_'))CHAR++
299#define skipspaces(CHAR) if(CHAR)while(*CHAR==' ')CHAR++
300#define cutspaces(CHAR) if(CHAR){int _L=strlen(CHAR); while(--_L>0 && CHAR[_L]==' ')CHAR[_L]=0;}
301#define gotochr(CHAR,C) if(CHAR)while(*CHAR && *CHAR!=C)CHAR++
30628092 302#define strswitch(CHAR) {char *_K=CHAR; FILE *_F=NULL; {{
303#define stroption(STR) if(eq(STR,_K))
304#define match(KEY,VAL) {char *_K=KEY, *_V=VAL; FILE *_F=NULL; {{
305#define assign(STR,SETVAR) stroption(STR) SETVAR=_V
7f13bdad 306*/
30628092 307/* I/O iterations, updated 2004-04-19 by xCh. */
308
bce4b05d 309//#define fparse(S,L,F) for(fgets(S,L,F);*S && !feof(F);fgets(S,L,F))
310//#define input(S,L) fparse(S,L,stdin)
311//#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);}
312//#define parses(S,F) {FILE *_F=fopen(F,"r"); if(_F) { while(!feof(_F)) { fstring(S,_F);
f5725936 313//obsolete
314//#define parse(F) {char *_; FILE *_F=fopen(F,"r"); if(_F) { while(!feof(_F)) { fstring(_,_F);
315//#define fail }} else {{
316//#define done }} if(_F)fclose(_F);}
005431b8 317//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);}
318//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);}
319//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);}
30628092 320
30628092 321/* I/O sequences, updated 2003-05-29 by xCh. */
322
323#define nullreopen(F) F=freopen("/dev/null","r",F)
324#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]);}
325#define shell(CMD) stdinredir(system(CMD))
326#define paste(STR) stdinredir(fputs(STR,stdout))
327
30628092 328/* Useful structures, updated 2003-05-29 by xCh. */
329
f5725936 330//#define date(S) { time_t _T; _T=time(NULL); duplicate(ctime(&_T),S); }
4643aeaf 331
097bac9a 332/* some general ideas, unfinished */
f5725936 333//bind_exception, unbind_exception
7f13bdad 334//#define _CLL1_THROW(ERR)
f5725936 335//#define _CLL1_TRY _NEW_E for(bind_exception(0,NULL);;) if () {.... if(_Eatom->SYS) { if(_Eatom->RET) return; else break;} else { }
420bb771 336//#define _ASSERT(EXPR) assert(EXPR)
420bb771 337
005431b8 338/* .----------------------------------------------------------------------.
f5725936 339 / 99. We have have done our homework - now let's have some fun:
340 '----------------------------------------------------------------------- */
4643aeaf 341#define _INIT_VARIABLES _EXPORT_GLOBALS _EXPORT_YES _EXPORT_STACKS _SQL_GLOBALS _CGI_GLOBALS
342#define _IMPL_FUNCTIONS _MALLOC _EXPORT_OUTS _EXPORT_ARGS _EXPORT_STRS
343#define _IMPL_INTERFACE //_SQL_IFC _CAKE_IFC _STD_IFC _X_IFC
344#define _IMPLEMENT_CLL1_LIBRARY _INIT_VARIABLES _IMPL_FUNCTIONS _IMPL_INTERFACE
f5725936 345#ifdef USE_PREPROCESSOR
346#include "_include.c"
347#endif
4643aeaf 348
349#define program _IMPLEMENT_CLL1_LIBRARY void _program(int argc, char **argv); int main(int argc, char **argv) { setlocale(LC_ALL, ""); _program(argc,argv); return 0; } void _program(int argc, char **argv)
420bb771 350#endif
https://dev.arachne.cz/repos/cll1h/trunk (mirrored @ Fri, 10 May 2024 00:15:08 +0200)
This page took 0.462723 seconds and 4 git commands to generate.