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 |
21 | |
097bac9a |
22 | */ |
097bac9a |
23 | #ifndef _CLL1_H |
24 | #define _CLL1_H |
f5725936 |
25 | #define CLL1H_VERSION "0.7.1" |
005431b8 |
26 | /* .----------------------------------------------------------------------. |
f5725936 |
27 | / 0. Library definitions not parsed by @CC, updated 2008-01-26 xCh. |
28 | '---------------------------------------------------------------------- */ |
29 | /* |
30 | @define USE_LIBRARY_MYSQL -lmysqlclient |
31 | @define USE_LIBRARY_FASTCGI -lfcgi |
32 | @define USE_PREPROCESSOR cake *.html *.xml > _include.c |
33 | @define USE_POSTPROCESSOR strip @ |
34 | */ |
005431b8 |
35 | /* .----------------------------------------------------------------------. |
f5725936 |
36 | / 1. C<<1 header auto include, updated 2008-01-26 xCh. |
37 | '---------------------------------------------------------------------- */ |
30628092 |
38 | #include <string.h> |
04a13a6f |
39 | #include <malloc.h> |
30628092 |
40 | #include <time.h> |
04a13a6f |
41 | #include <stdlib.h> |
420bb771 |
42 | #include <stdarg.h> |
04a13a6f |
43 | #include <unistd.h> |
44 | #ifdef USE_LIBRARY_MYSQL |
45 | #include <mysql/mysql.h> |
46 | #endif |
47 | #ifdef USE_LIBRARY_FASTCGI |
48 | #include <fcgi_stdio.h> |
49 | #else |
50 | #include <stdio.h> |
51 | #endif |
005431b8 |
52 | /* .----------------------------------------------------------------------. |
f5725936 |
53 | / 2. C<<1 then buddhist section, updated 2008-01-26 xCh. |
54 | '----------------------------------------------------------------------- */ |
55 | #ifndef DISABLE_MODULE_THEN_BUDDHISM |
04a13a6f |
56 | #define then |
f5725936 |
57 | #define MAYBE (int)((RANDOM_SEED?random():(RANDOM_SEED=time(NULL),srandom(RANDOM_SEED),random()))%2) |
58 | #define WHOKNOWS (int)(srandom(time(NULL)),random()%2) |
b3674906 |
59 | #define create_var(ID,TYPE,INIT) TYPE ID=INIT |
60 | #define define_var(ID,TYPE) TYPE ID |
f5725936 |
61 | #endif |
005431b8 |
62 | /* .----------------------------------------------------------------------. |
f5725936 |
63 | / 3. C<<1 constants and optional keywords, updated 2008-01-26 xCh. |
64 | '----------------------------------------------------------------------- */ |
30628092 |
65 | #define not ! |
4a48705a |
66 | #define and && |
67 | #define or || |
6e567bcc |
68 | #define boolean int |
f5725936 |
69 | #define bool_str(VALUE) ((VALUE)?"TRUE":"FALSE") |
30628092 |
70 | #define TRUE 1 |
71 | #define FALSE 0 |
f5725936 |
72 | #define coalesce(VAR,NOTNULL) (VAR?VAR:(NOTNULL)) |
099b0ca0 |
73 | #define mem struct |
f5725936 |
74 | #define _GLOBALS time_t RANDOM_SEED=0; char *EOL="\n", *OFS=" ", *IFS=" \t\n", *NIL="NULL"; |
005431b8 |
75 | /* .----------------------------------------------------------------------. |
f5725936 |
76 | / 4. C<<1 data declaration and allocation, updated 2008-01-07 xCh. |
77 | '----------------------------------------------------------------------- */ |
b3674906 |
78 | #define create_str(ID,INIT) char *ID=INIT |
79 | #define define_str(ID) char *ID=NULL |
80 | #define create_mem(ID,...) struct _ARG1(__VA_ARGS__,) *ID=get_mem(__VA_ARGS__) |
81 | #define define_mem(ID,TYPE) struct TYPE *ID=NULL |
82 | #define define_mems(ID1,ID2,TYPE) define_mem(ID1,TYPE); define_mem(ID2,TYPE) |
83 | #define create_list(ID1,I2,TYPE) create_mem(ID1,TYPE); struct TYPE *ID2=((ID1->__next=NULL),ID1) |
84 | #define create_context(ID) create_mem(ID,_MAtom) |
85 | #define define_context(ID) define_mem(ID,_MAtom) |
f5725936 |
86 | #define list(TYPE) struct TYPE *__next |
8db501a0 |
87 | #define tree(TYPE) struct TYPE *__next; struct TYPE *__seek |
88 | #define dictionary(TYPE) tree(TYPE); char *__key |
89 | #define array(TYPE) tree(TYPE); int __key |
f5725936 |
90 | #define interface(TYPE) struct TYPE *__interface |
f5725936 |
91 | #define get_str(...) (char *)_cll1_get_str(__VA_ARGS__,(void *)&_cll1_get_str) |
b194148d |
92 | #define get_mem(...) (struct _ARG1(__VA_ARGS__,)*)_cll1_malloc(sizeof(struct _ARG1(__VA_ARGS__,)), _ARG2(__VA_ARGS__,,) - 0 ) |
005431b8 |
93 | /* .----------------------------------------------------------------------. |
f5725936 |
94 | / 5. C<<1 string manipulation, updated 2008-01-26 xCh. |
95 | '----------------------------------------------------------------------- */ |
96 | #define eq(A,B) !strcmp(A,B) |
97 | #define eqi(A,B) !strcasecmp(A,B) |
98 | #define print(...) _cll1_print(__VA_ARGS__,(void *)&_cll1_print) |
99 | #define fprint(...) _cll1_fprint(__VA_ARGS__,(void *)&_cll1_fprint) |
100 | #define file_print(...) _cll1_fprint(_F,__VA_ARGS__,(void *)&_cll1_fprint) |
101 | #define echo(...) _cll1_echo(__VA_ARGS__,(void *)&_cll1_echo) |
102 | #define fecho(...) _cll1_fecho(__VA_ARGS__,(void *)&_cll1_fecho) |
103 | #define file_echo(...) _cll1_fecho(_F,__VA_ARGS__,(void *)&_cll1_fecho) |
005431b8 |
104 | #define suffix(A,B,C) (((A=strrchr(B,C))&&!(*(A++)=0))||(A=B)) |
105 | #define prefix(A,B,C) ((A=B),((B=strchr(B,C))&&!(*(B++)=0)||(B=A))) |
8db501a0 |
106 | #define for_split_str(A,B,C) for(prefix(A,B,C);A;(A!=B)&&prefix(A,B,C)||(A=NULL)) |
005431b8 |
107 | #define for_valid_split(A,B,C) for_split_str(A,B,C) if(*A) |
108 | #define switch_for_columns(A,B,C) _FOR_COLUMNS(A,B,C) switch(__I) |
109 | #define switch_for_valid_columns(A,B,C) _FOR_VALID_COLUMNS(A,B,C) switch (_I) |
110 | #define if_column_number(A,B,C,V) _FOR_COLUMNS(A,B,C) if(_I==V) |
111 | #define if_valid_column_number(A,B,C,V) _FOR_VALID_COLUMNS(A,B,C) if(_I==V) |
112 | #define tr(STR,B,C) {char *_S=STR; /***/ while(S && *_S) {if(*_S==B)*_S=C; _S++;} } |
113 | /* .----------------------------------------------------------------------. |
f5725936 |
114 | / 6. C<<1 data container manipulation, updated 2008-01-26 xCh. |
115 | '----------------------------------------------------------------------- */ |
005431b8 |
116 | #define push(NODE,HEAD) ( NODE ? ((NODE->__next=HEAD),(HEAD=NODE)) : NULL ) |
117 | #define pop(NODE,HEAD) ( HEAD ? ((NODE=HEAD->__next),free(HEAD),(HEAD=NODE)) : (NODE=NULL) ) |
118 | #define append(NODE,HEAD) { void *N=NODE; /**/ NODE->__next=NULL; for_search(NODE,HEAD,!NODE->__next) { NODE->__next=N; break; } } |
f5725936 |
119 | #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); } |
120 | #define drop(NODE,HEAD) for( NODE=HEAD; NODE || (HEAD=NULL); HEAD=NODE, NODE=NODE->__next, free(HEAD) ) |
005431b8 |
121 | //to do: seek |
122 | //to do: store |
f5725936 |
123 | #define order_by(K1,K2) (K1>K2) |
124 | #define desc_order_by(K1,K2) (K1<K2) |
125 | #define sort_by(K1,K2) (strcasecmp(K1, K2)>0) |
126 | #define desc_sort_by(K1,K2) (strcasecmp(K1, K2)<0) |
127 | #define ascii_by(K1,K2) (strcmp(K1, K2)>0) |
128 | #define desc_ascii_by(K1,K2) (strcmp(K1, K2)<0) |
005431b8 |
129 | #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; } } |
f5725936 |
130 | #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 |
131 | /* .----------------------------------------------------------------------. |
f5725936 |
132 | / 7. C<<1 builtin iterators and conditionals, updated 2008-01-26 xCh. |
133 | '----------------------------------------------------------------------- */ |
04a13a6f |
134 | #define loop while(TRUE) |
956a4c05 |
135 | #define repeat(N) if(N>0) _NEW_I for_range(_I,1,N) |
086367cd |
136 | #define for_range(VAR,FROM,TO) for( VAR=FROM ; FROM<=TO?VAR<=TO:VAR>=TO ; FROM<=TO?VAR++:VAR--) |
f5725936 |
137 | #define for_each(NODE,HEAD) for(NODE=HEAD; NODE; NODE=NODE->__next) |
138 | #define for_search(NODE,HEAD,EXPR) for_each(NODE,HEAD) if(EXPR) |
8a93c4ed |
139 | #define for_file_lines(STR,F) /* _NEW_F for() */ |
f5725936 |
140 | #define for_ints(VAR,...) _NEW_I for( _I=0 ; (VAR=_cll1_it_ints(_I,__VA_ARGS__,-1))>=0 ; _I++) |
141 | #define for_strs(VAR,...) _NEW_I for( _I=0 ; (VAR=_cll1_it_strs(_I,__VA_ARGS__,(void *)&_cll1_it_strs))!=(void *)&_cll1_it_strs ; _I++) |
7f13bdad |
142 | #define if_exists(A,B,C) for_search(A,B,C) break; if(A) |
420bb771 |
143 | #define for_args _NEW_I for(_I=1;_I<argc;_I++) |
144 | #define if_args if(argc>1) |
8a93c4ed |
145 | #define if_arg(VAL) if(eq(argv[_I],VAL)) |
146 | #define this_arg argv[_I] |
420bb771 |
147 | #define next_arg ((_I+1<argc)?argv[_I]:NULL) |
f5725936 |
148 | #define skip_next _I++ |
005431b8 |
149 | /* .----------------------------------------------------------------------. |
8db501a0 |
150 | / 8. C<<1 object oriented infrastructure, updated 2008-01-26 |
151 | '----------------------------------------------------------------------- */ |
152 | #define define_metaobject(METATYPE,ITYPE) struct METATYPE { struct ITYPE *__interface; }; |
b3674906 |
153 | #define define_interface(MTYPE,ITYPE) struct ITYPE *_construct_##_##MTYPE##_##ITYPE(void *dummy, ...) { define_mem(_FACE,IFACE); va_list(ap); _FACE=get_mem(IFACE) _bind_##_##MTYPE##_##ITYPE(_FACE); return _FACE; } void _bind_##_##MTYPE##_##ITYPE(struct IFACE *_FACE) |
8db501a0 |
154 | #define bind_method(METHOD,FUNCTION) _FACE->METHOD=FUNCTION |
b3674906 |
155 | #define construct_interface(MTYPE,...) _construct_##_##MTYPE##_##_ARG1(__VA_ARGS__)((void *)__get_##_##MTYPE##_##__VA_ARGS__) |
156 | #define get_object(TYPE,...) (struct TYPE *)_cll1_allocate_object(sizeof(struct TYPE), __VA_ARGS__) |
8db501a0 |
157 | #define construct_object(TYPE,...) |
158 | //#define _(OBJECT,...) (_ASSERT(OBJECT),/**/(*(OBJECT->interface->_ARG1(__VA_ARGS__,)))/**/(OBJECT,OBJECT->interface->__VA_ARGS__)/**/) |
8db501a0 |
159 | /* .----------------------------------------------------------------------. |
160 | / 9. implementation of C<<1 library functions, updated 2008-01-26 xCh. |
f5725936 |
161 | '----------------------------------------------------------------------- */ |
f5725936 |
162 | #define _MALLOC void *_cll1_malloc(size_t size,...) { /*temporary solution*/ return malloc(size); } |
163 | #define _CLL1_FPRINT(IOSTREAM,LASTARG) { int p2=0;char *ofs=coalesce(OFS,"\0");va_list ap; /**/ for(va_start(ap,s);s!=LASTARG;s=va_arg(ap,char *)) { if(p2 && *ofs) fputs(ofs,IOSTREAM); else p2=1; fputs(coalesce(s,NIL),IOSTREAM); } va_end(ap); if(EOL && *EOL) fputs(EOL,IOSTREAM); } |
164 | #define _PRINT void _cll1_print(char *s,...) _CLL1_FPRINT(stdout,(void *)&_cll1_print) |
165 | #define _FPRINT void _cll1_fprint(FILE *f,char *s,...) _CLL1_FPRINT(f,(void *)&_cll1_fprint) |
166 | #define _CLL1_FECHO(IOSTREAM,LASTARG) { va_list ap; /**/ for(va_start(ap,s);s!=LASTARG;s=va_arg(ap,char *)) fputs(coalesce(s,NIL),IOSTREAM); va_end(ap); } |
167 | #define _ECHO void _cll1_echo(char *s,...) _CLL1_FECHO(stdout,(void *)&_cll1_echo) |
168 | #define _FECHO void _cll1_fecho(FILE *f,char *s,...) _CLL1_FECHO(f,(void *)&_cll1_fecho) |
169 | #define _IT_INTS int _cll1_it_ints(int i, int n, ...) { int j=0;va_list ap; /**/ va_start(ap,n); while(n>=0 && j++<i) n=va_arg(ap,int); return n; } |
170 | #define _IT_STRS char *_cll1_it_strs(int i, char *s, ...) { int j=0;va_list ap; /**/ va_start(ap,s); while(s!=(void *)&_cll1_it_strs && j++<i) s=va_arg(ap,char *); return s; } |
005431b8 |
171 | /* .----------------------------------------------------------------------. |
8db501a0 |
172 | / 10. C<<1 globals and private macros, updated 2008-01-27 by xCh. |
f5725936 |
173 | '----------------------------------------------------------------------- */ |
8db501a0 |
174 | #define _ARG1(ARG1,...) ARG1 |
b3674906 |
175 | #define _ARG2(ARG1,ARG2,...) ARG2 |
176 | #define _ISTACK struct _IAtom { int i; int _23; list(_IAtom); } *_Iatom,*_Istack=NULL; |
177 | #define _SSTACK struct _SAtom { char *s; int _23; list(_SAtom); } *_Satom,*_Sstack=NULL; |
8db501a0 |
178 | #define _FSTACK struct _FAtom { FILE *F; int _23; list(_FAtom); } *_Fatom,*_Fstack=NULL; |
b3674906 |
179 | #define _MSTACK struct _MAtom { void *ptr; size_t size; int _23; tree(_MAtom); } *_Matom,*_Mstack=NULL; |
f5725936 |
180 | #define _NEW_(ATOM,STACK,TYPE) (ATOM=get_mem(TYPE),ATOM->_23=1,push(ATOM,STACK);ATOM->_23||pop(ATOM,STACK)&&0;ATOM->_23--) |
8db501a0 |
181 | #define _NEW_I for _NEW_(_Iatom,_Istack,_IAtom) |
182 | #define _NEW_S for _NEW_(_Satom,_Sstack,_SAtom) |
183 | #define _NEW_F for _NEW_(_Fatom,_Fstack,_FAtom) |
b3674906 |
184 | #define _I (_Iatom->i) |
185 | #define _S (_Satom->s) |
f5725936 |
186 | #define _F (_Satom->F) |
005431b8 |
187 | #define _FOR_COLUMNS(A,B,C) _NEW_I for(_I=0,prefix(A,B,C);A;((A!=B)&&prefix(A,B,C)||(A=NULL)),_I++) |
188 | #define _FOR_VALID_COLUMNS(A,B,C) _NEW_I for(_I=0,prefix(A,B,C);A;((A!=B)&&prefix(A,B,C))||(A=NULL)) if(*A&&++_I) |
189 | /* .----------------------------------------------------------------------. |
b194148d |
190 | / 11. C<<1 CGI and FASTCGI handling, updated 2008-01-16 by xCh. |
f5725936 |
191 | '----------------------------------------------------------------------- */ |
04a13a6f |
192 | #ifdef USE_LIBRARY_FASTCGI |
193 | #define while_fastcgi_accept while(FCGI_Accept()>=0) |
7f13bdad |
194 | #define USE_MODULE_CGI |
195 | #endif |
196 | #ifdef USE_MODULE_CGI |
8db501a0 |
197 | #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); } |
198 | //todo #define _GETCGI char *getcgi(VAR) { } |
b3674906 |
199 | #define _CGIDICT define_context(_CGI); struct _CGIVariable { char *V; dictionary(_CGIVariable); } *_CGIvariable,*_CGIdict; |
8db501a0 |
200 | #else |
b3674906 |
201 | #define _CGIDICT |
04a13a6f |
202 | #endif |
005431b8 |
203 | /* .----------------------------------------------------------------------. |
b194148d |
204 | / 12. MySQL infrastructure and wrappers, updated 2007-12-19 by xCh. |
f5725936 |
205 | '----------------------------------------------------------------------- */ |
7f13bdad |
206 | #ifdef USE_LIBRARY_MYSQL |
8db501a0 |
207 | #define mysql_connect(S,U,P,D) ((_SQLCatom=get_mem(_SQLCAtom)) && push(_SQLCatom,_SQLCstack) && (_SQLCatom->C=mysql_init(NULL)),(_SQLCatom->C && mysql_real_connect(_SQLCatom->C,S,U,P,D,0,NULL,0)?_SQLCatom->C:NULL)) |
208 | #define for_mysql_query_results(ROW,QUERY) _NEW_(_SQLRatom,_SQLRstack,_SQLRAtom)for(_SQLRatom->R=(mysql_query(_SQLCatom->C,QUERY)?NULL:mysql_use_result(_SQLCatom->C)),ROW=(_SQLRatom->R?mysql_fetch_row(_SQLRatom->R):NULL);ROW;ROW=mysql_fetch_row(_SQLRatom->R)) |
209 | #define _SQLCSTACK struct _SQLCAtom { MYSQL *C; int _23; list(_SQLCAtom); } *_SQLCatom,*_SQLCstack=NULL; |
210 | #define _SQLRSTACK struct _SQLRAtom { MYSQL_RES *R; int _23; list(_SQLRAtom); } *_SQLRatom,*_SQLRstack=NULL; |
7f13bdad |
211 | #else |
8db501a0 |
212 | #define _SQLCSTACK |
213 | #define _SQLRSTACK |
7f13bdad |
214 | #endif |
04a13a6f |
215 | /* ------------------------------------------------------------------- */ |
7f13bdad |
216 | /* old - from version 0.6 */ |
f5725936 |
217 | /* =================================================================== */ |
7f13bdad |
218 | /* |
219 | obsolete |
30628092 |
220 | #define strlwr(A) {char *_S=A; while(_&&*_S){*_S=tolower(*_S);_S++;}} |
221 | #define strupr(A) {char *_S=A; while(_&&*_S){*_S=toupper(*_S);_S++;}} |
222 | #define string(S,L) (S=(char *)malloc(L),*S=0) |
223 | #define duplicate(A,B) if(A) { string(B,strlen(A)+1); strcpy(B,A); } |
224 | #define concatenate(A,B,C) if (A && B) { string(C,strlen(A)+strlen(B)+1); strcpy(C,A); strcat(C,B); } |
30628092 |
225 | #define gotoalpha(CHAR) if(CHAR)while(*CHAR && !isalpha(*CHAR))CHAR++ |
226 | #define goto_alpha(CHAR) if(CHAR)while(*CHAR && !isalpha(*CHAR) && *CHAR!='_')CHAR++ |
227 | #define gotoalnum(CHAR) if(CHAR)while(*CHAR && !isalnum(*CHAR))CHAR++ |
228 | #define goto_alnum(CHAR) if(CHAR)while(*CHAR && !isalnum(*CHAR) && *CHAR!='_')CHAR++ |
229 | #define skipalpha(CHAR) if(CHAR)while(*CHAR && isalpha(*CHAR))CHAR++ |
230 | #define skip_alpha(CHAR) if(CHAR)while(*CHAR && (isalpha(*CHAR) || *CHAR=='_'))CHAR++ |
231 | #define skipalnum(CHAR) if(CHAR)while(*CHAR && isalnum(*CHAR))CHAR++ |
232 | #define skip_alnum(CHAR) if(CHAR)while(*CHAR && (isalnum(*CHAR) || *CHAR=='_'))CHAR++ |
233 | #define skipspaces(CHAR) if(CHAR)while(*CHAR==' ')CHAR++ |
234 | #define cutspaces(CHAR) if(CHAR){int _L=strlen(CHAR); while(--_L>0 && CHAR[_L]==' ')CHAR[_L]=0;} |
235 | #define gotochr(CHAR,C) if(CHAR)while(*CHAR && *CHAR!=C)CHAR++ |
30628092 |
236 | #define strswitch(CHAR) {char *_K=CHAR; FILE *_F=NULL; {{ |
237 | #define stroption(STR) if(eq(STR,_K)) |
238 | #define match(KEY,VAL) {char *_K=KEY, *_V=VAL; FILE *_F=NULL; {{ |
239 | #define assign(STR,SETVAR) stroption(STR) SETVAR=_V |
7f13bdad |
240 | */ |
30628092 |
241 | /* I/O iterations, updated 2004-04-19 by xCh. */ |
242 | |
243 | #define fparse(S,L,F) for(fgets(S,L,F);*S && !feof(F);fgets(S,L,F)) |
244 | #define input(S,L) fparse(S,L,stdin) |
245 | #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);} |
246 | #define parses(S,F) {FILE *_F=fopen(F,"r"); if(_F) { while(!feof(_F)) { fstring(S,_F); |
f5725936 |
247 | //obsolete |
248 | //#define parse(F) {char *_; FILE *_F=fopen(F,"r"); if(_F) { while(!feof(_F)) { fstring(_,_F); |
249 | //#define fail }} else {{ |
250 | //#define done }} if(_F)fclose(_F);} |
005431b8 |
251 | //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);} |
252 | //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);} |
253 | //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 |
254 | |
30628092 |
255 | /* I/O sequences, updated 2003-05-29 by xCh. */ |
256 | |
257 | #define nullreopen(F) F=freopen("/dev/null","r",F) |
258 | #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]);} |
259 | #define shell(CMD) stdinredir(system(CMD)) |
260 | #define paste(STR) stdinredir(fputs(STR,stdout)) |
261 | |
30628092 |
262 | /* Useful structures, updated 2003-05-29 by xCh. */ |
263 | |
f5725936 |
264 | //#define date(S) { time_t _T; _T=time(NULL); duplicate(ctime(&_T),S); } |
097bac9a |
265 | /* ------------------------------------------------------------------- */ |
266 | /* some general ideas, unfinished */ |
f5725936 |
267 | //bind_exception, unbind_exception |
7f13bdad |
268 | //#define _CLL1_THROW(ERR) |
f5725936 |
269 | //#define _CLL1_TRY _NEW_E for(bind_exception(0,NULL);;) if () {.... if(_Eatom->SYS) { if(_Eatom->RET) return; else break;} else { } |
420bb771 |
270 | //#define _ASSERT(EXPR) assert(EXPR) |
f5725936 |
271 | /* =================================================================== */ |
420bb771 |
272 | |
005431b8 |
273 | /* .----------------------------------------------------------------------. |
f5725936 |
274 | / 99. We have have done our homework - now let's have some fun: |
275 | '----------------------------------------------------------------------- */ |
b3674906 |
276 | #define _DEF_VARIABLES _GLOBALS _ISTACK _SSTACK _FSTACK _MSTACK //_SQLCSTACK _SQLRSTACK _CGIDICT |
f5725936 |
277 | #define _DEF_FUNCTIONS _MALLOC _ECHO _PRINT _FECHO _FPRINT _IT_INTS _IT_STRS // _GET_STR _GET_MEM |
278 | #define _DEF_INTERFACE //_CAKE _STD _X |
279 | #define implement_cll1_library _DEF_VARIABLES _DEF_FUNCTIONS _DEF_INTERFACE |
280 | #ifdef USE_PREPROCESSOR |
281 | #include "_include.c" |
282 | #endif |
420bb771 |
283 | #define program implement_cll1_library int main(int argc, char **argv) |
f5725936 |
284 | /* #ifndef _CLL1_H */ |
420bb771 |
285 | #endif |