| | 1 | |
| | 2 | /* C<<1 header file v0.6.2 - style sheet for ANSI C */ |
| | 3 | /* Please pronounce as "cee-shift-left-by-one" :) */ |
| | 4 | |
| | 5 | /* Copyright (G) 2004-2008 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 |
| | 18 | License along with the GNU C Library; if not, write to |
| | 19 | Michael Polak, Svojsikova 7, 169 00 Praha 6 Czech Republic */ |
| | 20 | |
| | 21 | |
| | 22 | #ifndef __CLL1H__ |
| | 23 | #define __CLL1H__ |
| | 24 | |
| | 25 | #include <stdio.h> |
| | 26 | #include <string.h> |
| | 27 | #include <strings.h> |
| | 28 | #include <malloc.h> |
| | 29 | #include <stdlib.h> |
| | 30 | #include <time.h> |
| | 31 | #include <unistd.h> |
| | 32 | #include <ctype.h> |
| | 33 | |
| | 34 | /* Section For Dummies part 1, updated 2004-05-07 by xCh. */ |
| | 35 | |
| | 36 | #define not ! |
| | 37 | #define TRUE 1 |
| | 38 | #define FALSE 0 |
| | 39 | #define loop while(1) |
| | 40 | #define iterate(VAR,FROM,TO) for(VAR=FROM; VAR <= TO; VAR++) |
| | 41 | #define repeat(N) iterate(_i,1,N) |
| | 42 | |
| | 43 | /* Dynamic list macros & sequences, updated 2003-05-29 by xCh. */ |
| | 44 | |
| | 45 | #define list(T) struct T *_next |
| | 46 | #define create(A,T) (A=(struct T *)malloc(sizeof(struct T)),A->_next=NULL) |
| | 47 | #define push(A,B) { if(A && A!=B) A->_next=B; B=A; } |
| | 48 | #define append(A,B) { if(B) { void *N=A; A->_next=NULL; for_selected(A,B,!A->_next) {A->_next=N; break;}} else push(A,B); } |
| | 49 | #define remove(A,B,C) { void **_D=NULL; for_selected(A,B,C) { if(_D)*_D=A->_next; else B=A->_next; free(A); } else _D=(void *)&(A->_next); } |
| | 50 | #define drop(A,B) { for( A=B; A ; B=A, A=A->_next, free(B)); B=NULL; } |
| | 51 | |
| | 52 | /* Dynamic list iterations and sequences, updated 2003-05-29 by xCh. */ |
| | 53 | |
| | 54 | #define for_each(A,B) for( A=B; A; A=A->_next) |
| | 55 | #define for_selected(A,B,C) for_each(A,B) if(C) |
| | 56 | #define if_exists(A,B,C) for_selected(A,B,C) break; if(A) |
| | 57 | |
| | 58 | /* EXP macros for Dummysort sequences, updated 2003-05-29 by xCh. */ |
| | 59 | |
| | 60 | #define order_by(K1,K2) (K1>K2) |
| | 61 | #define desc_order_by(K1,K2) (K1<K2) |
| | 62 | #define sort_by(K1,K2) (strcasecmp(K1, K2)>0) |
| | 63 | #define desc_sort_by(K1,K2) (strcasecmp(K1, K2)<0) |
| | 64 | #define ascii_by(K1,K2) (strcmp(K1, K2)>0) |
| | 65 | #define desc_ascii_by(K1,K2) (strcmp(K1, K2)<0) |
| | 66 | |
| | 67 | /* Dummysort sequences, updated 2003-05-29 by xCh. */ |
| | 68 | |
| | 69 | #define insert(A,B,EXP,K) { if(B) { void **_L=NULL, *H=B; for_selected(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); } |
| | 70 | #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); } |
| | 71 | |
| | 72 | /* String macros & sequences, updated 2004-04-19 by xCh. */ |
| | 73 | |
| | 74 | #define eq(A,B) !strcmp(A,B) |
| | 75 | #define strcmpi(A,B) strcasecmp(A,B) |
| | 76 | #define strlwr(A) {char *_S=A; while(_&&*_S){*_S=tolower(*_S);_S++;}} |
| | 77 | #define strupr(A) {char *_S=A; while(_&&*_S){*_S=toupper(*_S);_S++;}} |
| | 78 | #define string(S,L) (S=(char *)malloc(L),*S=0) |
| | 79 | #define duplicate(A,B) if(A) { string(B,strlen(A)+1); strcpy(B,A); } |
| | 80 | #define concatenate(A,B,C) if (A && B) { string(C,strlen(A)+strlen(B)+1); strcpy(C,A); strcat(C,B); } |
| | 81 | #define suffix(A,B,C) (((A=strrchr(B,C))&&!(*(A++)=0))||(A=B)) |
| | 82 | #define prefix(A,B,C) ((A=B)&&(((B=strchr(B,C))&&!(*(B++)=0))||(B=A))) |
| | 83 | #define gotoalpha(CHAR) if(CHAR)while(*CHAR && !isalpha(*CHAR))CHAR++ |
| | 84 | #define goto_alpha(CHAR) if(CHAR)while(*CHAR && !isalpha(*CHAR) && *CHAR!='_')CHAR++ |
| | 85 | #define gotoalnum(CHAR) if(CHAR)while(*CHAR && !isalnum(*CHAR))CHAR++ |
| | 86 | #define goto_alnum(CHAR) if(CHAR)while(*CHAR && !isalnum(*CHAR) && *CHAR!='_')CHAR++ |
| | 87 | #define skipalpha(CHAR) if(CHAR)while(*CHAR && isalpha(*CHAR))CHAR++ |
| | 88 | #define skip_alpha(CHAR) if(CHAR)while(*CHAR && (isalpha(*CHAR) || *CHAR=='_'))CHAR++ |
| | 89 | #define skipalnum(CHAR) if(CHAR)while(*CHAR && isalnum(*CHAR))CHAR++ |
| | 90 | #define skip_alnum(CHAR) if(CHAR)while(*CHAR && (isalnum(*CHAR) || *CHAR=='_'))CHAR++ |
| | 91 | #define skipspaces(CHAR) if(CHAR)while(*CHAR==' ')CHAR++ |
| | 92 | #define cutspaces(CHAR) if(CHAR){int _L=strlen(CHAR); while(--_L>0 && CHAR[_L]==' ')CHAR[_L]=0;} |
| | 93 | #define gotochr(CHAR,C) if(CHAR)while(*CHAR && *CHAR!=C)CHAR++ |
| | 94 | #define tr(CHAR,B,C) {char *_S=CHAR; while(*_S){ if(*_S==B)*_S=C; _S++; }} |
| | 95 | #define strswitch(CHAR) {char *_K=CHAR; FILE *_F=NULL; {{ |
| | 96 | #define stroption(STR) if(eq(STR,_K)) |
| | 97 | #define match(KEY,VAL) {char *_K=KEY, *_V=VAL; FILE *_F=NULL; {{ |
| | 98 | #define assign(STR,SETVAR) stroption(STR) SETVAR=_V |
| | 99 | |
| | 100 | /* Section For Dummies part 2, updated 2004-05-07 by xCh. */ |
| | 101 | |
| | 102 | #define program int _I; int main(int argc, char **argv) |
| | 103 | #define arguments if(argc>1) for(_I=1;_I<argc;_I++) |
| | 104 | #define argument(A) if(eq(argv[_I],A)) |
| | 105 | #define thisargument(S) (S=argv[_I]) |
| | 106 | #define nextargument(S) if(_I+1<argc && (S=argv[++_I])) |
| | 107 | |
| | 108 | /* I/O iterations, updated 2004-04-19 by xCh. */ |
| | 109 | |
| | 110 | #define fparse(S,L,F) for(fgets(S,L,F);*S && !feof(F);fgets(S,L,F)) |
| | 111 | #define input(S,L) fparse(S,L,stdin) |
| | 112 | #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);} |
| | 113 | #define parses(S,F) {FILE *_F=fopen(F,"r"); if(_F) { while(!feof(_F)) { fstring(S,_F); |
| | 114 | #define parse(F) {char *_; FILE *_F=fopen(F,"r"); if(_F) { while(!feof(_F)) { fstring(_,_F); |
| | 115 | #define fail }} else {{ |
| | 116 | #define done }} if(_F)fclose(_F);} |
| | 117 | #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);} |
| | 118 | #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);} |
| | 119 | #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);} |
| | 120 | #define lloption(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=atoll(_V); _=NULL;} free(_Q);} |
| | 121 | |
| | 122 | /* Dynamic list advanced I/O, updated 2003-05-30 by xCh. */ |
| | 123 | |
| | 124 | #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;} |
| | 125 | #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);}} |
| | 126 | |
| | 127 | /* I/O sequences, updated 2003-05-29 by xCh. */ |
| | 128 | |
| | 129 | #define nullreopen(F) F=freopen("/dev/null","r",F) |
| | 130 | #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]);} |
| | 131 | #define shell(CMD) stdinredir(system(CMD)) |
| | 132 | #define paste(STR) stdinredir(fputs(STR,stdout)) |
| | 133 | |
| | 134 | /* String iterations, updated 2003-06-19 by xCh. */ |
| | 135 | |
| | 136 | #define split(A,B,C) for(prefix(A,B,C);A;(A!=B)&&prefix(A,B,C)||(A=NULL)) |
| | 137 | #define valid_split(A,B,C) split(A,B,C) if(*A) |
| | 138 | #define columns(A,B,C,V) for(V=0,prefix(A,B,C);A;((A!=B)&&prefix(A,B,C)||(A=NULL)),V++) |
| | 139 | #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) |
| | 140 | #define column(A,B,C,V) { int _V; columns(A,B,C,_V) if(_V==V) break; } |
| | 141 | #define valid_column(A,B,C,V) { int _V; valid_columns(A,B,C,_V) if(_V==V) break; } |
| | 142 | |
| | 143 | /* Useful structures, updated 2003-05-29 by xCh. */ |
| | 144 | |
| | 145 | #define hashtable(TYPE,NAME,VALUE) struct TYPE { char *NAME; char *VALUE; list(TYPE); } |
| | 146 | #define textfile(TYPE,LINE) struct TYPE { char *LINE; char _eoln; list(TYPE); } |
| | 147 | #define date(S) { time_t _T; _T=time(NULL); duplicate(ctime(&_T),S); } |
| | 148 | |
| | 149 | #endif |
GIT.Harvie.CZ / svn / Prometheus-QoS / .git / blame_incremental