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